Peer Revenue Publish or profit

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

All of arXiv

Thursday 3 September

Numerical Analysis

Mini mixed finite element method for nearly incompressible linear elasticity problems

This paper addresses the numerical solution of nearly incompressible linear elasticity boundary value problems and their associated eigenvalue problems. A mixed finite element formulation based on Mini element is proposed to circumvent the locking phenomenon that plagues standard low-order elements in the nearly incompressible limit. For the boundary value problem, we establish the well-posedness of mixed variational formulation and derive a priori error estimates that are uniform with respect to the Lamé constant $\underline{\lambda}$, thereby proving the method's locking-free property. For the eigenvalue problem, we develop an efficient non-nested augmented subspace algorithm designed within the mixed finite element framework. A comprehensive convergence analysis is provided for the discrete eigenvalue approximation and the proposed iterative solver, demonstrating that the convergence rates remain independent of $\underline{\lambda}$. Numerical experiments on both problems confirm the theoretical conclusions, showing optimal convergence rates and robustness as $\underline{\lambda} \to \infty$. The results validate the effectiveness of Mini element and proposed augmented subspace algorithm for reliable and efficient computation in the nearly incompressible regime.
Read the full abstract

All authors Zhijin Guan, Yue Feng, Hehu Xie, Chenguang Zhou

Instrumentation and Methods for Astrophysics

Morphology of Radio Sources in Representation Space

Understanding radio source morphologies and their classification remains challenging. We previously developed a deep clustering method based on self-supervised learning to classify a subsample of radio sources from the LOFAR Two-meter Sky Survey DR2. This yielded a labelled subset used to fine-tune an ensemble of classifiers. We aim to identify rare morphological classes in a subsample of LoTSS-DR3, which contains > 13 million sources, beyond the 12 classes previously recognised in the DR2 sample. We further aim to characterise the resulting class distribution. We applied the classifier ensemble to derive class probabilities and representations for our samples. Among DR3 sources with low class probabilities, we searched for new clusters in representation space. Moreover, we use these clusters as centroids to classify the low-probability subset. We found that 88% of the sources fall into clearly separated clusters in representation space, coinciding with the DR2 clusters. Within the remaining sources, we identified representatives of six additional morphological classes, including rare morphologies like winged and FR-ambiguous sources. The number of sources in the resulting 18 classes exhibit a strongly skewed distribution, with four dominant classes constituting 69% of the DR3 sample, while rare morphologies account for only a small fraction. The identification of additional morphological classes shows the possibility of open-set recognition with representation learning in an unexplored dataset. Unlike anomaly detection, which flags individual sources as uncommon, this approach identifies representatives of novel morphological classes, providing a framework for discovering novel source populations. The highly skewed class distribution poses a fundamental challenge for constructing balanced training datasets and highlights the need for open-set approaches in future observations.
Read the full abstract

Quantum Physics

Quantisation of Abstract Data Types

In this paper, we introduce a notion of abstract quantum data type within the framework of universal algebra. This notion provides an algebraic foundation for describing data abstraction in quantum programming. We formally define a quantisation of classical data types and show that their equational specifications can be soundly lifted to the quantum setting. Two standard quantisation methods for classical functions, namely the bit oracle and the phase oracle, arise as special cases of this general construction. We illustrate the framework with applications to quantum arrays and quantum error-correcting codes, showing how they can be understood through the lens of data-type quantisation. We further establish conditions under which quantisation preserves structural relationships and constructions of classical data types, including embeddings, isomorphisms, and products.
Read the full abstract

Number Theory

The $\mathfrak{sl}_2$-algebra structure of multiple Eisenstein series

We prove that the algebra of multiple Eisenstein series is an $\mathfrak{sl}_2$-algebra. In particular, we show that it is graded by weight, which also holds after taking complex linear spans. Further, we identify it as a graded $\mathbb{Q}$-algebra with the associated graded algebra of $q$-analogues of multiple zeta values with respect to the weight filtration. The main ingredient is an estimate that compares the usual defining sums of multiple Eisenstein series with sums over a lattice order depending on an integer $N$.
Read the full abstract

Information Theory

Hierarchical Beam Training and Codebook Design for Movable Antenna-Assisted Near-Field Systems

As sixth-generation (6G) communication systems evolve toward higher frequency bands and larger array apertures, the near-field range expands rapidly, making near-field channel estimation increasingly important and challenging. Beam training has been recognized as an effective approach for channel state information (CSI) acquisition. However, because of the propagation characteristics of spherical waves, beam training needs to perform a joint search in the angle and distance domains, which results in unaffordable beam training overhead. By flexibly reconfiguring antenna positions, movable antenna (MA) technology can fully exploit the spatial variations of wireless channels and achieve more accurate beam focusing, thereby providing additional flexibility for efficient beam training design. Therefore, based on MA-assisted near-field systems, we develop a hierarchical beam training strategy that combines reduced training overhead with high beam gain and design a corresponding hierarchical codebook. This codebook forms focused beams over the joint angle-distance domain, maximizing beam gain within the target region while suppressing energy leakage into non-target regions. Simulation results confirm substantial performance gains of the method over the conventional fixed-position antenna (FPA) system and the far-field beam training method.
Read the full abstract

All authors Meihui Liu, Qian Zhang, Xuejun Cheng, Yuhui Jiao, Yunxiao Li, Ju Liu

Computation and Language

Typological Feature Prediction with Large Language Models: An In-Context Learning Approach

Typological features are widely used in multilingual NLP, and the prediction of such features holds downstream utility. However, existing methods to predict missing values lack interpretable justifications for predictions, while their performance across resource levels and feature types remains underexplored. Given LLMs' abilities in meta-linguistic reasoning and in providing rationales, we investigate LLMs' performance in typological feature prediction via an in-context learning approach with linguistic data from URIEL+ and Glottolog. We find that zero-shot prompting is insufficient, but when given phylogenetic and geographic neighbour evidence, LLMs substantially outperform all baselines without disadvantaging low-resource languages. We further find that most LLM rationales are consistent with the provided evidence, offering a step toward explainable typological feature prediction.
Read the full abstract

All authors Qianwen Wang, York Hay Ng, Aditya Khan, En-Shiun Annie Lee

Artificial Intelligence

Rethinking World Models for Safety-Critical Embodied Systems

World models have progressed from compact latent dynamics to generative, controllable, and interactive simulators of embodied environments. However, high predictive likelihood and visual fidelity do not necessarily ensure that a model preserves the evidence required for safe decision-making. This perspective identifies three structural mismatches in current world modeling: likelihood versus risk, prediction versus intervention, and finite-horizon prediction versus accumulated consequences. We propose the Risk-Informed World Model (RIWM) as a decision-centric research direction for safety-critical embodied systems. RIWM organizes world modeling around consequences, intervention, epistemic uncertainty, and recoverability, and integrates four interdependent capabilities: decision-relevant representation, counterfactual reasoning, safety-critical episodic memory, and runtime safety assurance. It distinguishes physical, social, and operational consequences while using epistemic uncertainty to qualify the evidence supporting action. We further discuss open challenges in identifying consequential futures, validating counterfactual reasoning, maintaining revisable safety memories, translating learned consequences into executable constraints, and determining when evidence is sufficient to act. This perspective argues that future world models should move beyond predicting likely futures toward identifying which futures matter, revising judgments through experience, and recognizing when to act, revise, sense, defer, or abstain.
Read the full abstract

All authors Kailang Ma, Heye Huang, Inhi Kim, Kitae Jang

Computer Vision

RealCADBench: Benchmarking Parametric CAD Modeling from Industrial Design Intents

Parametric computer-aided design (CAD) modeling is difficult to evaluate with a single metric. Existing CAD benchmarks often emphasize synthetic or CAD-native settings, limited input modalities, or executability and IoUs alone. We introduce RealCADBench, a benchmark for intent-to-program CAD modeling from real industrial design intents. It contains 12,632 tasks from 19 factory-automation categories and spans text descriptions, 2D engineering drawings, real product pictures, and rendered images for both Part and Assembly modeling. We report results on a 1,770-task evaluation slice: 1,745 Part tasks across four input regimes and RCB-Assm25, a 25-task assembly study used in every reported assembly comparison. Each method generates FreeCAD API Python, which a shared runtime executes to export the 3D model. We evaluate the exported model using executability, Solid IoU, Surface IoU, and a rubric-based visual-semantic identity Judge. Among the nine standalone frontier large models evaluated, no model leads all four metrics. Across six frontier-scale large models, executability ranges from 0.565 to 0.812, Solid IoU from 0.2841 to 0.5379, and Surface IoU from 0.112 to 0.217 across the four Part regimes. The highest regime-balanced composite comes from a different model than the leaders on the four component metrics. On RCB-Assm25, Codex with GPT-5.5 improves executability and both IoU metrics over standalone GPT-5.5, but lowers the Judge score by 6.98 percentage points, leaving GPT-5.5 as the Judge leader. We also observe recurring failure modes, most notably missing fine structures, loss of part identity, and incorrect assembly placement. These results show that execution alone is insufficient to characterize realistic CAD modeling and that frontier models and agents differ substantially across executability, IoUs, and visual-semantic identity.
Read the full abstract

All authors Guanlin Li, Zhichao Huang, Huimu Yu, Yichen Long, Hongsen Liu, Linxin Cai, Qiuhe Hong, Zongzhen Li, Wei Wang, Xianwen Zhong, Yuchen Wang

Materials Science

Heesch Nodal Lines in Inadmissible Achiral Antiferromagnets

Recently, a new class of Weyl semimetals in antiferromagnets named Heesch Weyl semimetals was discovered, which have inadmissible chiral magnetic point group symmetries (inadmissible magnetic point groups are incompatible with ferromagnetic order) and distinctive surface Fermi arcs. In Heesch Weyl semimetals, the Weyl points are pinned at high symmetry momenta with two-dimensional irreducible corepresentations in the Brillouin zone. As the Weyl points are pinned, the Weyl points with opposite topological charges cannot emerge or be brought together for creation and annihilation as in conventional Weyl semimetals. In this work, we show that when mirror or rotoinversion symmetries are restored so that the point group becomes achiral, long doubly degenerate lines connecting Weyl points with opposite topological charges emerge. We call these lines the Heesch nodal lines (HNLs) and their host materials the Heesch nodal line antiferromagnets. HNLs result in a large number of two-dimensional massless Dirac cones for planes intercepting the HNLs in the Brillouin zone. Moreover, a large subset of the HNL antiferromagnets has the special property that the lowest nonvanishing order of the nonlinear anomalous Hall effect starts with the third order. First-principles calculations on representative collinear and noncollinear antiferromagnets, such as MnTe, CrSb, and Mn$_3$GaN, confirm our predictions on the presence of HNLs. When the inadmissible symmetry is broken by strain, the double degeneracy of the HNLs is lifted and the associated massless Dirac cones are gapped out, providing a route to realizing sizable anomalous Hall effects in antiferromagnetic crystals. We conclude that all inadmissible antiferromagnets without parity-time symmetry are topological. They are either Heesch Weyl antiferromagnets or Heesch nodal line antiferromagnets.
Read the full abstract

All authors Xing-Yao Guo, Chung-Yuen Chan, Zi-Ting Sun, Kam Tuen Law

Accelerator Physics

Effects of the Direct Space Charge on Transverse Coupled-Bunch Instabilities

The ultralow transverse emittance of diffraction-limited electron storage rings leads to high beam densities, making direct space-charge effects increasingly relevant despite their relativistic suppression at high energy. In this work, we investigate the impact of direct space charge on transverse coupled-bunch instabilities, using PETRA-IV as a representative example. A Vlasov solver, multi-bunch particle tracking, and analytical calculations in normalized phase space are combined to study the coupled-bunch mode spectrum, the nonlinear incoherent tune spread, and the associated Landau damping. Particle-tracking simulations show that the space-charge-induced tune spread can provide sufficient Landau damping to stabilize higher-order head-tail modes. Landau stability diagrams constructed from the analytical tune spread of a frozen bi-Gaussian beam predict the stabilization of these higher-order modes, in agreement with the tracking simulations. These results demonstrate the important role of direct space charge in transverse coupled-bunch dynamics. The analysis framework developed here can also be extended to collective-instability studies in both electron and hadron accelerators.
Read the full abstract

Machine Learning

OBER+: Continuity-Aware Reporting and Traceable Continuous Improvement in Outcome-Based Education

Institutions practising outcome-based education compute learning outcome attainment routinely, while reviews of curriculum analytics report an absence of evidence on how that computation informs decisions. This paper presents OBER+, an extension of a deployed institutional attainment platform that computes the step from a measured shortfall to an evaluated corrective action. Five connected stages accumulate attainment across deliveries of a course, signal a shortfall and a persistent shortfall, grade it on cutoffs the regulator already uses, record the decision against a catalogue of practices annotated with their evidence, log the change, and quantify the subsequent movement in the shortfall. A further rule compares successive statements of an outcome, so attainment is never read as a series across a point at which the outcome changed. Applying the rules to the live record of two real courses produced three results. Every outcome of a core course was substantively redefined between consecutive deliveries, with subject matter moving between outcome numbers, so a naive reading would have reported a twenty-five point collapse between quantities that do not refer to the same learning. Recomputing the platform's figures from its documented rule showed six of ten differing by more than rounding explains, in a pattern that identified a defect since reported to the institution. Across fifteen statement pairs from three transitions, five were identical character for character, and among the ten that were not, the outcome carrying a given number was nearest to a differently numbered earlier outcome in six, a result resting on an ordering of similarities and requiring no threshold and no labelling. The contribution is a computational design for outcome-based reporting, stated as rules any attainment platform can implement, with evidence of what they make visible in a live institutional record.
Read the full abstract

Quantum Physics

Metricity of separable quantum optimal transport with the Hilbert-Schmidt cost

We prove that the square root of the separable quantum optimal transport cost associated with the orthogonal projection onto the antisymmetric subspace defines a genuine distance between density matrices. Equivalently, this establishes the triangle inequality for the order-two Beatty-França quantum optimal transport construction induced by the Hilbert-Schmidt distance between pure states. The result also proves metricity of the corresponding distance derived from separable SWAP fidelity. The proof replaces the unavailable gluing argument by convex-roof duality and a dimension-independent interpolation result for Hermitian operators.
Read the full abstract

Computational Physics

Computing high-order mixed derivatives in physics-informed neural networks using multi-index Bell polynomials

Physics-informed neural networks for high-order partial differential equations require mixed input derivatives and their gradients with respect to the network parameters. Standard implementations obtain an order-$K$ derivative by repeated automatic differentiation. We instead organize the forward recursion of the multivariate Faà di Bruno formula and its explicit backpropagation over a prescribed downward-closed set of multi-indices, with the Bell-polynomial convolutions tabulated once. The forward pass carries only the derivatives the differential operator requires. The backward pass propagates gradients from losses formed from any subset of them, including nonlinear products and coupled fields. Both recursions are exact up to roundoff and avoid nested computational graphs. An independent Taylor-jet implementation, symbolic checks of the test problems, and finite differences verify derivatives and loss gradients through order seven. On one CPU core, the method evaluates 330 mixed derivatives with respect to four inputs through order seven and the corresponding loss gradient without the memory failures observed for several nested implementations. Numerical tests include third-, fifth-, and seventh-order dispersive equations, incompressible flow, and a manufactured five-field electrohydrodynamic system. The seventh-order Zakharov-Kuznetsov test in $3+1$ dimensions has a relative solution error of $6\times10^{-4}$.
Read the full abstract

Optimization and Control

Lifetime Profit-Maximising Co-optimisation of Multi-Service Stacking for Battery Storage

Grid-scale battery energy storage can generate revenue by stacking services across electricity and frequency response markets, yet identifying the lifetime profit-maximising stacking strategy remains challenging. Decisions across services are coupled through shared battery system capacity, constrained by system operator energy management rules, and further shaped by product-specific technical requirements that govern system operation, degradation, and lifetime profitability. This paper presents an ageing-aware receding-horizon framework for co-optimising multi-service stacking that explicitly captures product-specific characteristics and state-of-energy compliance rules. The framework is applied to the Great Britain market, where storage operators can stack electricity trading with multiple dynamic frequency response services procured through the newly introduced 'Enduring Auction Capability' platform under energy management requirements imposed by the National Energy System Operator. Using real market data, we demonstrate that degradation modelling, discount rate, and battery ageing jointly govern both lifetime value and optimal stacking strategy. Accounting for ageing increases lifetime revenue by up to 32% relative to a degradation-agnostic benchmark, while higher-fidelity ageing modelling can provide a further revenue improvement of up to 16% over simpler formulations. Lower discount rates favour strategies that balance calendar and cycling ageing, while higher discount rates favour aggressive operation. Across all strategies, services responding to positive frequency deviations are consistently preferred over those responding to negative deviations. Lifetime profit is maximised by adapting the optimal service mix as the battery ages.
Read the full abstract

All authors Yuxin Xia, Frederik Schiele, Yihong Zhou, Volkan Kumtepeli, David Howey, Iacopo Savelli, Thomas Morstyn

Strongly Correlated Electrons

Ground-State Phase Diagram, Higher-Winding Topology, and Lifshitz Criticality in an Anisotropic Four-Spin XX Chain

We investigate the quantum critical and topological properties of a spin-$1/2$ XX chain with anisotropic four-spin cluster interactions in a transverse magnetic field. The interplay of exchange anisotropy, cluster interactions, and the external field produces a rich phase diagram with multiple gapped topological phases and distinct quantum critical boundaries. We identify several Lifshitz-type transitions arising from reconstructions of the low-energy Fermi-point structure, including an unconventional multicritical point where distinct critical branches intersect and the momentum-space topology undergoes a singular reorganization. In the isotropic limit, a conventional Lifshitz transition emerges through the merging and annihilation of Fermi points, revealing distinct mechanisms of Fermi-point reconstruction within the same model. The gapped phases are characterized by quantized winding numbers $\nu=0,\pm1,-2,$ and $\pm3$, with the higher-winding phases induced by the extended cluster interactions. The $\nu=\pm3$ phases exhibit a richer topological structure than conventional short-range Kitaev-type chains and are separated from other sectors by field- and interaction-driven gap closings. These topological distinctions are further reflected in characteristic degeneracy patterns of the lowest levels of the bulk entanglement spectrum. Our results demonstrate that anisotropic multispin interactions provide a versatile route to realizing higher-winding topological phases and unconventional multicriticality in one-dimensional quantum systems.
Read the full abstract

Mesoscale and Nanoscale Physics

Coherent interaction of WS$_2$ and quasi-2D perovskite excitons over micrometer distances via a cavity field

The coherent coupling of cavity-confined photons and excitonic matter resonances leads to the formation of cavity polaritons, hybrid light-matter quasi-particles. If multiple exciton resonances couple to the same photonic mode, the resulting polariton constitutes a coherent interaction between matter resonances that can be spatially separated without any direct electronic coupling. In this work, we demonstrate the formation of such a coherent coupling at room temperature using an open optical cavity containing two distinct van der Waals materials - monolayer WS2 and layered quasi-2D halide perovskites (HaPs) - separated by $1.5 \mu\rm m$. The system forms three polariton branches, with the middle branch possessing nearly equal fractions of both excitons and the photonic mode. White-light reflectivity and luminescence measurements are in good agreement with simulations using a coupled harmonic oscillator and a microscopic Wannier-Hopfield framework. Our results lay the foundation to combine highly complementary degrees of freedom in 2D materials in an in-situ tunable fashion to enable new polaritonic functionalities.
Read the full abstract

All authors Marti Struve, Hamid Pashaei Adl, Jamie M. Fitzgerald, Oliwia Janikowska, Maciej Śmiertka, Alessandro Surrente, Sven Stephan, Christoph Lienau, Falk Eilenberger, Zdeněk Sofer, Watcharaphol Paritmongkol, William A. Tisdale, Paulina Plochocka, Ermin Malic, Christian Schneider, Martin Esmann

Optics

3D scattered light imaging: extracting 3D fiber orientations from 1D line profiles in brain imaging

Understanding the 3D fiber architecture of the brain at the microscopic scale is essential for revealing its structural connectivity and function. Polarization-based optical imaging (3D-PLI) techniques enable high-fidelity reconstruction of single nerve fiber orientations but struggle to resolve fiber crossings, which are critical for recovering the full connectome. Scattering-based imaging provides access to the structure factor of three-dimensionally oriented fibers. By probing a fixed scattering angle under multiple azimuthal illumination angles, in-plane fiber orientations and crossings can be recovered using computational scattered light imaging (SLI). However, despite containing 3D information, a theoretical framework to extract full 3D orientations has been lacking. In this talk, a simple analogical approximation of Rayleigh-Gans scattering theory is introduced to extract the 3D orientation of nerve fibers from one-dimensional SLI measurements. The theory is validated using tilted microscopic glass phantoms consisting of 2 um-thick rod lattices fabricated by two-photon lithography. Finally, the method is applied to brain tissue samples and compared with 3D-PLI.
Read the full abstract

All authors Dennis Scheidt, Charlotte Voß, Cristian Rosero Arias, Santiago Saavedra Castano, Felix Matuschke, Roxana Koojimans, Katrin Amunts, Arturo Susarrey-Arce, Markus Axer

Machine Learning

From Nowcasting to Forecasting: Adapting a Reanalysis-Trained

Accurate cloud-cover forecasts are important for temperature prediction, radiation forecasting, and solar-power operations. Short-range forecasting methods can preserve observed cloud placement during the first forecast hours, but their skill decreases when cloud fields evolve through formation, dissipation and deformation. Longer lead times require accounting for atmospheric evolution, but operational numerical weather prediction (NWP) forecasts may not accurately represent the satellite-observed cloud state at initialization. We develop CloudCast v2, a machine-learning model for 12-hour cloud-cover forecasting from observation-based initial conditions. The model is first trained on the Copernicus European Regional Reanalysis (Ridal2024) to learn cloud-evolution dynamics, and is then adapted to satellite-derived cloud fields using conditional flow matching (Lipman2023), a generative method that transforms noise into cloud-cover forecasts conditioned on the observed initial cloud fields and NWP inputs. CloudCast v2 reduces mean absolute error by 10% relative to its predecessor, CloudCast v1 (Partio2025), over the 1-12 h range. It also overtakes CloudCast v1 in fractions skill score, a neighborhood-based measure of spatial agreement, after approximately 3-6 h, depending on the cloudiness category. These results show that observation-initialized machine-learning forecasts can extend beyond the usual 1-3-hour nowcasting range while retaining spatial detail from satellite cloud fields.
Read the full abstract

Machine Learning

Projected Riemannian Gradient Descent for the Bures-Wasserstein Barycenter: Dimension-Independent Linear Convergence at Unit Step Size

The computation of the Bures-Wasserstein (BW) barycenter of an ensemble of positive definite matrices arises throughout machine learning, optimal transport, and quantum information. Riemannian gradient descent (RGD) at unit step size – the fixed-point iteration used in practice – converges rapidly, yet existing analyses present a dichotomy: unit-step guarantees carry worst-case exponential dependence on the dimension, while dimension-independent guarantees require small step sizes that forfeit the empirical speed. We resolve this dichotomy, not by improving the guarantees for unit-step RGD, but by proposing a Projected RGD algorithm that achieves dimension-independent linear convergence at unit step size. The achieved rate, $(1 - \kappa^{-3/2})$, where $\kappa$ is the condition number of the ensemble, also polynomially improves on the best small-step guarantee ($\kappa^{3/2}$ versus $\kappa^{5/2}$ iteration complexity). The crux is a novel Projection Lemma: clipping the eigenvalues of a positive matrix to an interval $[\alpha, \beta]$ is the closed-form, non-expansive (1-Lipschitz) BW-metric projection onto the set $\{S : \alpha I \leq S \leq \beta I\}$ – a statement which, unlike its known one-sided counterpart, does not follow from convexity. The projection is moreover free: it reuses an eigendecomposition the next iteration must perform in any case, so the projected and unprojected iterations cost the same per step. The same analysis covers the invariant matrix projection problem of Brahmachari et al. (2025), whose fixed-point algorithm we identify as unit-step RGD on a totally geodesic submanifold, thereby extending the dimension-independent guarantee to that setting verbatim.
Read the full abstract

Robotics

Robot Aware Computational Design of Object Specific Passive Grippers for Additive Manufacturing

This paper presents an end-to-end computational pipeline that converts a selected object mesh, a measured object state, and a selected six-axis robot into an object-specific, unactuated, additively manufacturable gripper. The method couples exact-mesh RGB-D/ICP pose registration, deterministic surface-contact sampling, uncertainty-aware wrench screening, selection among six passive capture mechanisms, object-conformal surface synthesis, full-orientation robot inverse kinematics, a swept-volume-aware manufacturing domain, directional fused-deposition finite-element screening, and constrained three-dimensional SIMP topology optimization. Unlike workflows that treat grasp selection, tool geometry, motion, and structural design as separate problems, every exported design is bound to the source mesh, object pose, robot flange, contact set, and insertion hypothesis by a traceable design identifier. We derive the implemented registration, contact, fit-tolerance, finite-element, and density-optimization equations and prove three properties of the numerical construction: nodal load preservation, monotonic compliance sensitivity under SIMP interpolation, and voxel-domain containment after topology post-processing. Four archived object-specific attempts - a rabbit, camera flange, 3DBenchy, and faceted bust - meet the nominal fit, uncertain-wrench, runtime-sweep, and baseline/post-topology FEA gates. A deliberately enlarged +/-3 mm, +/-5 degree pose stress check differentiates the designs, retaining 29-134 of 160 simulated trials. Their reconstructed topologies retain 92.0-97.6% of the FE domain because functional regions are protected. Archived robot photographs show the corresponding printed assemblies qualitatively, while nominal material properties and absent coupon-calibrated, instrumented tests keep all four at digital-screening status rather than operational release.
Read the full abstract

Robotics

Virtual Testing of Automated Driving Systems through Credible Simulations

Simulation is increasingly used to support safety-related decision-making in road transport, particularly for the assessment and approval of automated driving systems (ADS). The complexity of ADS behavior and size of their operational design domains make exclusive reliance on physical testing impractical, leading to extensive use of virtual testing (VT) during the approval phase. This shift raises critical questions regarding the credibility of modelling and simulation (M&S) results used to support road safety decisions. Current VT accreditation approaches in the ADS domain typically rely on validation-only practices, which have been shown to scale poorly when applied to complex, multi-tool simulation environments. To address this limitation, this paper proposes a risk-based framework for assessing the credibility of simulation toolchains used in ADS safety evaluation, drawing inspiration from established practices in other safety-critical domains, notably NASA's STD-7009 for models and simulations. The framework extends traditional verification and validation (V&V) by explicitly linking credibility requirements to the intended use of simulation outputs and to the safety criticality of the decisions they support within the approval process. It provides a lifecycle-oriented assessment scheme integrating toolchain management, modelling assumptions and limitations, verification, validation, and sensitivity analysis. Credibility acceptance thresholds are defined proportionally, allowing differentiated requirements depending on whether simulation is used for exploratory safety analysis, partial decision support, or as a substitute for physical testing. While demonstrated for ADS, the proposed approach is directly applicable to road safety and simulation studies where VT plays a central role in safety assessment and regulatory decision-making.
Read the full abstract

Earth and Planetary Astrophysics

Disk survey in the Serpens star-forming region: Environmental effects in nearby star-forming regions

The external environment where protoplanetary disks are embedded regulates disk evolution. External irradiation, which heats and evaporates gas, as well as frequent stellar encounters, which truncate disks, can reduce disk sizes and masses. Disk surveys in nearby star-forming regions with various environments can help us understand how external environments impact disk evolution. The Serpens star-forming region, which is thought to be dense but not highly irradiated by massive stars, is an ideal laboratory to study the dynamical effects on disk properties. We aim to study how dynamical interactions modify disk dust masses by comparing Serpens with other nearby star-forming regions through their disk masses and 3D stellar densities. We survey 321 young stellar objects from Class I to III in Serpens using ALMA at 0.25 arcsec. We measure disk dust masses from millimeter observations under the optically thin assumption and recompute the 3D stellar density using Gaia data. We apply the same method to other nearby star-forming regions for direct comparison with Serpens. The cumulative disk dust mass distribution of Serpens is similar to those of similarly aged nearby star-forming regions, such as Lupus and Taurus. Along with re-assessment of the 3D stellar density, it suggests that Serpens is not likely to have experienced strong tidal truncation capable of producing lower disk dust masses. We also find that the low disk dust mass tension in Ophiuchus and Corona Australis can be resolved when only disks that have been explicitly identified as members of young (1-2 Myr) sub-clusters are considered. Disks without Gaia identifications, especially in Ophiuchus, are spatially clustered in the 2D projected sky plane and less massive than nearby disks with Gaia identifications, possibly tracing the effects of tidal truncation in denser environments at earlier evolutionary stages.
Read the full abstract

All authors Simin Tong, Nienke van der Marel, Jonathan P. Williams, Alexa R. Anderson

Robotics

A Multi-Vine Soft Robot Enabling Accessible Working Channel and Steering

Soft eversion robots, also known as vine robots, have attracted growing interest for navigation and inspection tasks, including minimally invasive medical applications [1]. A vine robot consists of a thin, flexible, inextensible tube folded inward that everts and grows forward when pressurized. This tip-growth enables navigation with minimal friction, making vine robots well suited for complex environments such as the human colon [2]. While their inherent softness allows passive conforma- tion to curved pathways in confined spaces, navigation performance strongly depends on environmental inter- actions, including contact angle and the length of un- constrained deployed material [3], [4]. Sharp directional changes, such as those in the sigmoid colon, often limit passive growth and necessitate active steering. Existing solutions include distributed artificial muscles [5] or dedicated tip-based steering mechanisms [6]. In addition, many applications require payload delivery, such as sensors and tools [7], [8]. Within the ERC Synergy project EndoTheranostics, this motivates the development of vine robots capable of delivering micro- surgical tools during growth. Prior work has integrated working channels within the vine body [8], [9], but these approaches constrain tool size, introduce friction, and limit access to the environment to the robot tip. In this work, we propose a multi-vine architecture in which two vine robots are coupled to an externally integrated working channel via soft mounting tips [10]. Independent vine actuation enables active tip steering while advancing the working channel without embed- ding it within the vine bodies Figure 1. Experiments demonstrate sharp steering of nearly 90 degrees during growth, highlighting the potential of this architecture for versatile medical and non-medical applications.
Read the full abstract

All authors Reza Kashef, Cem Suulker, Mohammad Sheikh Sofla, Kaspar Althoefer

Materials Science

Ion-Engineered Insulator-to-Semiconductor Transition in Natural 2D Biotite

Naturally occurring layered silicates offer an abundant yet unexplored class of 2D materials, but their insulating nature limits their functional utility. Here, we demonstrate a chemical strategy that transforms liquid-phase-exfoliated biotite nanosheets into a tunable 2D semiconductor through controlled NaOH treatment. The resulting insulator-to-semiconductor transition originates from Na incorporation, defect generation, and local structural reconstruction while largely preserving the layered framework. Structural and chemical analyses reveal lattice distortion, interlayer reorganization, hydroxylation, and partial Na+-K+ exchange, establishing the origin of the electronic restructuring. This transformation broadens the optical response, shifting the approximately 221 nm absorption toward approximately 280 and 975 nm, reducing the optical bandgap from approximately 5.2 to 3.2-3.5 eV, and introducing low-energy transitions at approximately 1.12-1.17 eV. Electrical measurements reveal nonlinear transport with currents reaching close to 10 microA, demonstrating activated carrier conduction. Ultrafast transient absorption reveals pronounced excited-state absorption, with carrier cooling (0.16-0.38 ps) followed by fast (35-60 ps) and long-lived (336-491 ps) relaxation associated with trap-mediated recombination. Fluence-dependent dynamics reveal a hot-phonon bottleneck at elevated carrier densities. Together with density functional theory calculations, these results establish chemical defect and ion engineering as a powerful route for converting naturally abundant layered minerals into electronically tunable 2D materials for emerging optoelectronic and ultrafast photonic technologies.
Read the full abstract

All authors Dipanwita Mitra, Raphael B. de Oliveira, Guilherme S. L. Fabris, Debkanta Ghosh, AyonJyoti Karmakar, Raphael M. Tromer, Marcelo L. Pereira Junior, Douglas S. Galvão, Chandra Sekhar Tiwary, Prasanta Kumar Datta

Computer Vision

ENEAS: Embedding-guided Neural Ensemble for Adaptive Segmentation

We present ENEAS, a unified, text-promptable method for instance tracking and semantic discovery. Text-promptable segmentation models, including the latest foundation models such as SAM 3, still suffer from temporal hallucinations, spatial fragmentation, and semantic misclassification: they fail to report target absence when an object leaves the field of view, segment local textures instead of the complete object during extreme close-ups, and prioritize visual features over ontological reality, so that visually similar artifacts such as statues, paintings, or reflections are segmented as target entities. ENEAS works two ways from a single method: precise tracking and high-quality segmentation of a unique instance, and open-concept discovery of every instance a text query names, resolved by a semantic verification layer. For tracking, we extend the geometrically robust SeC architecture, previously limited to point interactions, with a text-prompting adapter and leverage its temporal memory, so that the target is held through disappearance without drifting to distractors and kept whole even when it fills the entire view. For discovery, the verification layer combines high-speed visual embedding matching with conditional VLM refinement, invoking semantic reasoning only for ambiguous candidates, which filters out the ontological errors that visual-only models cannot distinguish while keeping latency low. Designed with 3D reconstruction in mind, where a single misclassified distractor corrupts the asset, ENEAS unlocks high-quality semantic tracking and segmentation of video, of broad libraries, and of collections of temporally or spatially unordered data, together with the discrimination to tell true instances from their doppelgangers: things that look alike but are not the same. The code and models are available at https://github.com/speridlabs/eneas
Read the full abstract

All authors Javier del Pino, Salvador Rodríguez, Alejandro Garabito, Javier Álvarez, Chema Garabito

Combinatorics

The scramble number of outerplanar graphs

For planar graphs, it is known that their treewidth is bounded by $O(\sqrt{n})$, where $n$ is the number of vertices of the graph. A related invariant to treewidth, is the scramble number of graphs. Recently, Connor et. al proved that planar graphs of bounded maximal degree have scramble number bounded by $O(\sqrt{n})$. An open question is whether the scramble number of any planar graph follows this same bound. We give a definitive answer with an explicit bound for a subset of planar graphs, the simple outerplanar graphs and the simple near outerplanar graphs.
Read the full abstract

Optimization and Control

Automated Priority Rule Design for the Resource-Constrained Project Scheduling Problem: A Large Language Model-Guided Population-Based Search

The objective of the resource-constrained project scheduling problem (RCPSP) is to minimize makespan while satisfying precedence and renewable-resource constraints. Priority-rule heuristics construct feasible schedules with low computational cost and explicit decision logic, making them widely used in practice and an attractive alternative to more computationally intensive methods. However, no traditional rule performs consistently well across projects, and researchers have therefore investigated automated priority-rule design. Genetic programming (GP) hyper-heuristics have been the predominant approach to this task, but evolving a high-performing rule may require evaluating many candidate rules on the training projects. Recent advances in large language models (LLMs) make it possible to generate and iteratively revise priority rules using performance feedback. This paper presents an LLM-guided population-based framework for automated priority-rule design. During the offline search, an LLM generates and revises candidate rules, while schedule quality on training projects determines candidate fitness and guides subsequent revisions. At the end of the search, the best rule is returned and applied directly to unseen projects without further search or LLM calls. Experiments show that the LLM-designed rules outperform traditional single rules across the test sets and outperform GP-designed rules obtained under comparable search effort, while remaining competitive with rules obtained from a substantially larger GP search. On large projects, selected LLM-designed rules outperform all considered traditional rules and two genetic algorithm configurations on highly parallel projects. An ablation study examines how changes to the main search components affect performance, while rule analyses describe the structure and decision behavior of the LLM-designed rules.
Read the full abstract

Artificial Intelligence

SimSkill: A Self-Evolving LLM Agent for Skill and Knowledge Accumulation in Traffic Simulation

Cumulative culture enables humans to preserve, reuse, and extend knowledge and skills across experiences and generations. Inspired by this principle, we introduce SimSkill, a self-evolving agent built around the Simulation of Urban MObility (SUMO) traffic simulator. SimSkill continually identifies capability gaps, generates and solves environment-grounded tasks, verifies solutions through an action–critic loop, and consolidates experience into episodic, procedural, and semantic memory. Through autonomous exploration, it builds a library of reusable skills and knowledge spanning major stages of the traffic-simulation workflow. We evaluate SimSkill on two held-out benchmarks across three backbone LLMs, with each result independently verified. It improves verified success by up to 25 percentage points, and ablations show complementary contributions from procedural and semantic memory. Its benefits remain backbone- and budget-dependent, as memory does not improve every model or uniformly reduce inference cost. More broadly, SimSkill illustrates a natural-language-centered design paradigm for LLM-based agent systems. Its high-level control logic, operating principles, and accumulated knowledge are expressed in natural language, while an LLM integrates them with executable tools and code to realize precise and reproducible execution. All code and experimental data are publicly available at https://github.com/qiliuchn/SimSkill-V1.
Read the full abstract

All authors Qi Liu, Qinzheng Wang, Can Li, Yiming Bie, Wanjing Ma

Mesoscale and Nanoscale Physics

Real-space Floquet topology written by the orbital angular momentum of light

Floquet engineering usually treats light as a uniform control field that changes the topology of an entire driven material. Here we show that structured light carrying orbital angular momentum (OAM) enables a different regime, in which topology is written directly in real space. For ultrathin topological insulator films, circularly polarized Laguerre–Gaussian beams generate a radial Floquet mass whose sign changes define a topological annulus bounded by two concentric chiral ring modes. The transition is helicity selective: below a thickness-dependent critical frequency, left-circularly polarized light drives mass inversion, whereas right-circularly polarized light increases the gap and leaves the film trivial. Independently, the OAM quantum number shifts and reshapes the annulus without changing the frequency, intensity, or helicity. In the decoupled-surfaces limit, the same mechanism produces a purely Floquet-induced topological mass and a vortex-core zero mode. These results identify photon OAM as a control parameter for nonequilibrium topology and provide a route to programmable topological landscapes in quantum materials.
Read the full abstract

Classical Analysis and ODEs

Sparse bounds for maximal rough singular integrals

Let $\Omega\in L^1(S^{d-1})$ have vanishing average, and let $T_\Omega^\ast$ be the maximal truncation of the associated rough homogeneous singular integral. We prove quantitative sparse bounds for $T_\Omega^\ast$. If $\Omega\in L^\infty(S^{d-1})$, then, for every $1<p<\infty$, \[ \|T_\Omega^\ast\|_{(1,p)\text{-}\mathrm{sparse}} \lesssim_d p'\|\Omega\|_{L^\infty(S^{d-1})}. \] For unbounded angular kernels, if $1<q<\infty$ and $\Omega\in L^{q,1}\log L(S^{d-1})$, then the same estimate holds for $q'\leq p<\infty$, with the right-hand side replaced by \[ C_{d,q}p' \|\Omega\|_{L^{q,1}\log L(S^{d-1})}. \] These estimates retain a genuine $L^1$ average in the first entry of the sparse form. In the bounded-kernel case, the upper bound has the same linear growth in $p'$ as the known sparse bound for the nonmaximal operator. The unbounded-kernel estimate includes the critical exponent $p=q'$. As a consequence, we obtain weighted weak-type $(1,1)$ estimates for all $A_1$ weights in the bounded-kernel case and for weights in $A_1\cap RH_{q'}$ in the unbounded-kernel case. The proof combines physical-space linearization and microlocal decomposition with localized sparse testing. An amplitude decomposition of the second input, together with the Rademacher–Menshov inequality, yields the quantitative dependence on $p$.
Read the full abstract