Systems and Control
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Friday 11 September
Relative navigation is a fundamental task in space proximity operations and autonomous rendezvous. The nonlinear relative orbital dynamics are equivariant and admit a semidirect product Lie group symmetry. This property is used to design an Equivariant Filter (EqF). The filter estimates the relative position and velocity between a chaser spacecraft and a target by lifting the filter dynamics to the group, while respecting the underlying geometry of the problem. Simulations demonstrate the filter's performance and effectiveness.
Geometric Topology
How natural of a geometric operation is Murasugi sum?
Gabai proved that any Murasugi sum of $\pi_1$-essential Seifert surfaces is also $\pi_1$-essential, and Ozawa extended this result to unoriented spanning surfaces. We show, however, that the analogous statement about geometrically essential surfaces is untrue. (A spanning surface is geometrically essential if it cannot be compressed or boundary compressed to another spanning surface.) We also ask when plumbing an unknotted annulus (with any number of twists) onto a compressible spanning surface yields a compressible surface. We provide positive and negative examples, and we establish a simple sufficient condition. As an application, we obtain a new constructive proof of a result of Hatcher and Thurston about essential spanning surfaces for 2-bridge knots and links.
Read the full abstract
Algebraic Geometry
On Skabelund's Ray Class Field Covers of the Suzuki and Ree Curves
Let $\Sm_q$ and $\Rm_q$ denote the Suzuki and Ree curves. Motivated by the Giulietti–Korchmáros curve, Skabelund constructed cyclic covers $\tSm_q$ and $\tRm_q$ of these curves and proved that they are maximal over $\F_{q^4}$ and $\F_{q^6}$, respectively. In the same paper he associated to the Suzuki and Ree curves certain ray class field covers $\Sm_{\rm rcf}$ and $\Rm_{\rm rcf}$, and showed that there are towers \[ \Sm_{\rm rcf}\longrightarrow\tSm_q\longrightarrow\Sm_q, \qquad \Rm_{\rm rcf}\longrightarrow\tRm_q\longrightarrow\Rm_q . \] Computations for small values of $q$ suggested that the first map in each tower is always an isomorphism, and the general case was left open. We prove that \[ \Sm_{\rm rcf}=\tSm_q,\qquad \Rm_{\rm rcf}=\tRm_q \] for every admissible $q$, the comparison being made over $\F_{q^4}$ in the Suzuki case and over $\F_{q^6}$ in the Ree case. The proof combines a Kummer normal form of the ray class extension, allowing a constant twist, with the centrality of its Galois group among lifted automorphisms, the standard involution of the base curve, and the first positive non-gap at the rational point at infinity.
Read the full abstract
Numerical Analysis
A Unified Two-Grid Framework for Anderson Acceleration and Nonlinear GMRES
In this work, we recast two widely used acceleration methods for fixed-point iterations, Anderson acceleration (AA) and the nonlinear generalized minimal residual method (NGMRES), as two-grid methods. By explicitly deriving the error propagation matrices for AA and NGMRES on linear problems, we show that both methods, together with several of their existing variants, can be reformulated as two-grid methods with a single pre- or postsmoothing step and a coarse-grid correction given by a projection with respect to a suitable inner product. This reformulation not only unifies AA, NGMRES, and their variants within a single algorithmic framework, but also enables the design of new variants by independently adjusting the components of the two-grid method, such as the coarse space and the smoothing steps. In particular, we propose a new variant that enlarges the coarse space by incorporating the most recently updated residual, an improvement that is naturally revealed by the two-grid formulation but is hidden in the standard formulations of the AA and NGMRES algorithms. Numerical experiments on both an SPD Poisson problem and a family of non-SPD convection-diffusion problems show that this new variant often outperforms both AA and NGMRES, as well as their variants.
Read the full abstract
Combinatorics
Premaniplexes of rank $3$ and $4$ as symmetry type graphs of maniplexes
We show that every finite premaniplex of rank $3$ or $4$ is the symmetry type graph of a finite maniplex, settling the finite rank $3$ and $4$ case of the maniplex version of the symmetry type graph problem. The proof uses the fact that the universal string Coxeter groups of rank $3$ and $4$ are amalgams (of finite groups), hence they act on a tree, which allows us to use a lifting theorem of Potočnik and Spiga.
Read the full abstract
Software Engineering
Beyond Establishing the Four-Day Workweek: Understanding Adaptation and Long-Term Survival in an Agile Software Organization
Context: Existing research on the four-day workweek (4DWW) has primarily examined its introduction and short-term effects, with limited understanding of its long-term survival or its interaction with agile software development. Objective: We study how a reduced-hour 4DWW is introduced, adapted, institutionalized, and sustained under changing organizational and external conditions in an agile software organization. Method: We conducted a longitudinal single-case study of a software organization operating a 32-hour, four-day week. The study draws on 15 semi-structured interviews in 2022 and 2026, analyzed using qualitative content analysis. Results: The 4DWW is better understood as an evolving arrangement than a one-off intervention. After the introduction, teams redesigned coordination, communication, meetings, agile practices, and iterations to adapt to reduced working time. Once institutionalized, the 4DWW faced ownership change, economic downturn, and market and AI pressures. Rather than reverting to five-day workweek, employees absorbed these pressures through voluntary protective adaptations, while anticipating that a rollback would harm job satisfaction, organizational commitment, and employer image. Contribution: We contribute longitudinal evidence on sustaining 4DWW in agile software development and propose two conceptual artifacts: a lifecycle model of the 4DWW and a 4DWW survival matrix, explaining how external pressures and management rationale rollback risk.
Read the full abstract
Number Theory
Kolyvagin's conjecture at non-ordinary primes
Let $K$ be an imaginary quadratic field and let $p \ge 5$ be a prime that is unramified in $K$. Let $\mathcal{A}_f/\mathbb{Q}$ be an abelian variety of $\mathrm{GL}_2$-type associated with a weight-two modular form $f$, with good non-ordinary reduction at $p$, and suppose that $(f,K)$ satisfies the generalized Heegner hypothesis. In the case where $p$ is inert in $K$, we further assume that $\mathcal{A}_f$ is an elliptic curve. We develop an Euler-characteristic formula for signed Selmer groups over anticyclotomic $\mathbb{Z}_p$-extensions that applies when the corresponding Selmer modules have arbitrary $\Lambda$-rank. Assuming one inclusion in the signed Iwasawa main conjecture, we apply this formula to prove Kolyvagin's conjecture on the non-vanishing of the Kolyvagin system attached to Heegner points. Our results extend to the non-ordinary setting the results of Wei Zhang, Burungale–Castella–Grossi–Skinner, Castella–Sano and Kim in the ordinary case, and complement the works of Sweeting and Kim in the non-ordinary case under different hypotheses. We also study the effect of the exceptional zero phenomenon on the Iwasawa main conjecture in the inert case.
Read the full abstract
Quantum Physics
Composing Detector Error Models
Fault-tolerant quantum programs thread together reusable logical operations, yet correcting errors requires comparing measurements across operation boundaries. Correlations tie each operation's error analysis to the computation around it. Adaptive computation makes this a runtime challenge: measurement results determine which operation comes next, so the error analysis must keep pace with execution. We introduce extended detector error models (EDEMs), which compose in sequence and in parallel, mirroring the composition of physical realizations and their detector contracts. We prove how detectors, the measurement parities used to diagnose errors, can be split across circuit boundaries, and establish conditions under which composition recovers the assembled circuit's detector error model. This structure supports symbolic precompilation and analysis of entire families of circuits. It also defines error models for decoding windows and the boundary information through which committed corrections affect subsequent windows. The same interface thus connects the design of individual logical operations to the decoding of an unfolding quantum program.
Read the full abstract
Optics
Experimental observation of exceptional bound states in the continuum
We experimentally demonstrate second- and third-order exceptional bound states in the continuum (EP-BICs), formed by the merging of two and three symmetry-protected BICs at an exceptional point (EP). Our passive reciprocal acoustic platform consists of symmetry-protected BIC cavities coupled through an acoustic waveguide and enables independent control of intrinsic loss, radiative loss, and near-field coupling between the cavities. A nonuniformly distributed intrinsic loss provides the non-Hermiticity required for EP formation while preserving decoupling from the waveguide radiation channel. The EP-BICs are probed using both near- and far-field excitation. In the near field, local intracavity excitation directly accesses the symmetry-protected BICs and reveals their spectral evolution. For far-field excitation, we intentionally break the protecting geometrical symmetry, converting the BICs into quasi-BICs and making them accessible through transmission measurements. Extending the system to three cavities with graded intrinsic loss realizes a third-order EP-BIC and yields a larger spectral response to the implemented coupling perturbation. These results establish a passive reciprocal route to higher-order exceptional degeneracies with independent control over intrinsic loss, near-field coupling, and radiative access.
Read the full abstract
Optics
Creation and Control of Scattering Singularities in non-Hermitian Systems
The ability to controllably manipulate non-Hermitian wave scattering environments has been used to discover exotic scattering phenomena such as scattering exceptional points and coherent perfect absorption, and create numerous applications including signal routing, filtering, imaging, sensing, wireless power transfer, etc. We introduce the concept that many of these applications and phenomena are fundamentally governed by singularities of the scattering matrix. With this understanding, our demonstrated ability to control the location of scattering singularities can be used to enhance current applications and develop new ones. In generic complex scattering systems, there is an abundance of topologically protected scattering singularities corresponding to complex zeros of various functions of the scattering matrix. We show that with just three tunable parameters we are able to create the conditions for nearly any scattering singularity at arbitrary frequencies in such systems. With five tunable parameters, we demonstrate that more complex scenarios can be accomplished, such as making disparate singularities coincident or placing singularities at different frequencies. A benefit of systems with tunable parameters is that generic complex systems can be re-purposed into exhibiting many different useful properties solely by reconfiguring their tunable parameters. A particularly interesting scattering phenomenon is coherent perfect absorption, where a specific wavefront injected into the system is completely absorbed, with no energy reflected or transmitted through any channel. After creating the conditions for this singularity at an arbitrary preselected frequency, we can find and inject the coherent perfect absorption wavefront and demonstrate output-to-input power ratios as low as 1x10^{-10}, 2x10^{-8}, and 3x10^{-8} in a quarter bowtie billiard with two, three, and four ports, respectively.
Read the full abstract
Functional Analysis
Intrinsic Bohnenblust–Hille Inequalities for Local Qudit Systems
We study dimension-free Bohnenblust–Hille inequalities for local operators on systems of $K$-level qudits. For the operator space of support at most $d$, uniformly over all tensor-product orthonormal operator bases, we prove a Bohnenblust–Hille inequality with the optimal exponent $2d/(d+1)$ whose asymptotic exponential base in the interaction order is of order $O(\sqrt K)$. Our proof is intrinsic, based on a one-site scalarization and block-transversal decoupling, and does not rely on a scalarization to the cyclic group or on a Remez-type argument. We complement the upper bound by showing that the asymptotic exponential Bohnenblust–Hille base satisfies $cK^{1/4}\le \beta(K)\le C\sqrt K$ with universal constants $c,C>0$. In this sense, the present work may be viewed as continuing the line of work of Slote–Volberg–Zhang from a complementary intrinsic viewpoint. We also revisit their Gell–Mann and Heisenberg–Weyl scalarization procedures. In the Heisenberg–Weyl setting, the prime-dimensional case already yields the optimal interaction exponent, whereas for composite $K$ the scalar total degree used in their reduction leads to a larger exponent. A support-sensitive formulation recovers the optimal interaction exponent for every $K$, while the intrinsic argument gives the stronger dependence on the local dimension at the level of the asymptotic exponential base. As further consequences, we determine the sharp scale, up to factors exponential in $d$ with base depending only on $K$, of coefficient $\ell_1$-normalization and unconditionality on the exact-support spaces. This yields dimension-free coefficient sparsification, including sparse generalized-Pauli approximation in Heisenberg–Weyl coordinates, as well as normalization and query bounds for canonical LCU/qubitization constructions.
Read the full abstract
Robotics
Language-Guided Terrain-Adaptive Neural MPC for Autonomous Traversal of Articulated Tracked Robots
In urban search and rescue, articulated tracked robots (ATRs) must traverse structured but contact-rich environments such as stairwells and cluttered building interiors. Reliable autonomy remains challenging because robot-terrain interaction (RTI) is hybrid and discontinuous, and effective flipper-track coordination is difficult to model analytically. We present ASTRIL-MPC, a language-guided neural kinematics model predictive control (MPC) framework for autonomous traversal. A learned kinematics model predicts short-horizon task-state increments from a height sequence and recent trajectories; NMPC plans with multi-objective costs and strict feasibility constraints; and a large language model (LLM) proposes bounded updates to selected weights and bounds through a safety-checked interface with range clipping, rate limiting, and consistency checks. The compiled predictor enables a full control cycle within 100 ms. Across three traversal tasks and a multi-height generalization setting, ASTRIL-MPC improves an aggregate traversal-quality score by up to 71% over a non-adaptive NMPC and by 67% over a PPO baseline, while eliminating measurable collision impacts during descent. These results indicate that combining terrain-conditioned neural kinematics, optimization-based planning, and language-guided adaptation yields data-efficient and robust autonomy for articulated tracked robots. Real-robot trials over four indoor obstacles further demonstrate transfer to contact-rich physical traversal.
Read the full abstract
Artificial Intelligence
Embodied-BenchForge: A Closed-Loop Agentic Workflow for Embodied Benchmark Construction
Agentic systems offer a promising way to automate embodied benchmark construction, but existing approaches typically cover isolated stages or remain specialized to predefined environments and task families. More importantly, multi-step construction produces dependent intermediate artifacts that are often passed downstream without artifact-specific verification, allowing local defects to propagate into the final benchmark. We present Embodied-BenchForge, an agentic framework that transforms user-specified evaluation intents into complete embodied benchmark artifacts. It formulates construction as Closed-Loop Benchmark Synthesis, integrating forward artifact synthesis with backward verification and repair. Skill-Orchestrated Artifact Synthesis composes typed and reusable skills into executable workflows, while an artifact dependency graph records intermediate outputs and their dependencies. Requirement-Guided Verification and Repair applies artifact-specific contracts throughout construction and uses provenance to trigger local re-execution or upstream rollback when verification fails. Embodied-BenchForge constructs six benchmarks covering diverse embodied scenarios in the Offline EQA Track, together with one interactive benchmark containing 220 executable tasks in the Interactive Embodied Track. Evaluations of representative MLLMs and embodied agents show that the benchmarks distinguish model capabilities in both observation-based understanding and closed-loop execution. Quality assessment and ablations validate benchmark quality and the effectiveness of verification and repair, while repair and skill-reuse analyses demonstrate efficient localized recovery and cross-benchmark reusability.
Read the full abstract
Algebraic Geometry
A Higher dimensional log Riemann–Hurwitz inequality and rigidity of covers
Let $\overline{Z}$ be a smooth projective variety with an simple normal crossing divisor $D$ such that $\Omega_{\overline{Z}}^1(\log D)$ is nef. We prove that if $Y\subset Z:=\overline Z\setminus D$ is a smooth closed subvariety with nonzero Euler characteristic, and $P$ is a perverse sheaf on $Y$ with full support, then $\chi(Y,P)>0$. This is a strict version of an inequality obtained in arXiv:2408.15788. Applying this to the trace-zero part of a finite direct image yields a logarithmic Riemann–Hurwitz inequality: if $Y$ has dimension $n$, any finite surjective morphism $f\colon X\to Y$ of degree $d$ with $X$ smooth satisfies $(-1)^n\chi(X)\ge d\,(-1)^n\chi(Y)$, the difference being an explicit sum of nonnegative intersection numbers. When $(-1)^n\chi(Y)>0$ this forces any such $f$ with $\chi(X)=\chi(Y)$ to be an isomorphism. We verify the nef hypothesis for subvarieties of semiabelian varieties, and for $\overline{\mathscr M}_{g,n}$—the moduli of curves, obtaining in particular that every finite surjective self-morphism of a moduli space of curves with level structure is an isomorphism.
Read the full abstract
Mathematical Physics
Trace formulas for TBG
Becker et al. produced a striking trace formula for the sum of fourth powers of generalized magic angles, $ \theta $, for the chiral model of twisted bilayer graphene (TBG) with the exact Bistritzer–MacDonald potential: $\sum \theta^{4} = 8 \pi / \sqrt 3 $. The purpose of this note is to generalize this formula to a larger class of potentials satisfying the symmetries of the model.
Read the full abstract
Analysis of PDEs
Counterexamples to Wang's Conjecture
In this paper, we give a negative answer to Wang's conjecture. For every $n\geq 3$, there exist $\varepsilon>0$ and $\delta \in (0,1)$ such that, for all $q$ and $\lambda$ satisfying \[ \frac{n}{n-2}-\varepsilon<q\le \frac{n}{n-2}, \qquad \frac{1}{q-1}\cdot \delta<\lambda\le \frac{1}{q-1}, \] there exists a bounded Euclidean domain \(\Omega\subset\mathbb{R}^n\) with principal curvatures bigger than \(1\) for which the following nonlinear Robin problem admits a nonconstant positive solution: \begin{align*} \begin{cases} \Delta u=0, & \text{in}\ \Omega,\\[2mm] \dfrac{\partial u}{\partial\nu}+\lambda u=u^q, & \text{on}\ \partial\Omega. \end{cases} \end{align*}
Read the full abstract
Analysis of PDEs
On the vortex filament conjecture for the Gross-Pitaevskii equation
We establish one form of the vortex filament conjecture for the three-dimensional Gross-Pitaevskii equation. Given any smooth closed embedded binormal flow of curves on a compact time interval, we construct, in the small-core limit $\varepsilon\to0$, a family of exact solutions whose degree-one vortex filaments converge uniformly to the prescribed flow. Near the filament the solutions have the standard planar vortex profile, while away from it their phase gradients converge to the associated Biot-Savart field. We also derive a refined modulation law for the vortex filament.
Read the full abstract
Quantum Physics
Exact Fock Amplitudes of the Cubic-Phase Gate on Arbitrary Pure Gaussian States
The cubic phase gate is the only non-Gaussian element of universal continuous-variable quantum computation. Its Fock amplitudes are known in closed form only when the input is a Fock state. For a Gaussian input the usual route is to build the cubic quadrature in a truncated Fock space and exponentiate it, which alters the generator before the exponential is taken. A closed form is obtained here for every pure single-mode Gaussian input, with the squeezing along any quadrature axis and with arbitrary displacement and boost. It is a finite combination of the Airy function and its derivative, and the argument is shared by all Fock indices, so a whole Fock profile costs two Airy evaluations. A recurrence is also derived that builds each coefficient from the four preceding ones, together with the regime in which it is stable. Evaluating the closed form at the weak nonlinearities of current experiments requires care, since its terms grow large and alternate in sign. The precision this demands is quantified, and the truncated construction is benchmarked against the exact result, whose error at cutoffs in common use is found to be of the same size as the quantity being computed.
Read the full abstract
Audio and Speech Processing
MP-Bench: Evaluating Voice Agents as a Multiparty Conversation Participant
Conversational voice agents have advanced significantly, offering increasingly natural human-machine interactions through both cascaded and end-to-end architectures. However, while recent benchmarks extensively evaluate dyadic interactions and passive audio comprehension, they largely overlook a prevalent real-world scenario: multi-party conversations. Evaluating agents in these settings is fundamentally more challenging than in dyadic interactions due to the exponentially greater conversational complexity. For voice agents to integrate seamlessly into human group dynamics, they must not only generate contextually appropriate responses but also demonstrate a nuanced understanding of open turn-taking. To address this gap, we introduce Multiparty Bench (MP-Bench), the first benchmark specifically designed to objectively evaluate conversational speech systems as active participants within multi-party contexts. MP-Bench assesses agent behavior along two primary dimensions: turn-taking awareness and response appropriateness. Additionally, we incorporate comprehension-based question-answering tasks as a complementary evaluation. By benchmarking 12 voice agents, we find that real-time voice agents stay at or below 22% on multiparty comprehension and remain near chance on multiparty turn-taking, exposing an open challenge for real-time voice agents under multiparty scenario.
Read the full abstract
Quantum Physics
Certification of Absolutely Entangled Sets in the Prepare-and-Measure Scenario
An absolutely entangled set (AES) is a collection of states for which at least one member remains entangled under any choice of global unitary transformation. We develop a semi-device-independent framework for certifying this property from dimensionally bounded prepare-and-measure correlations. A witness value above the maximum attainable with separable preparations of a given dimension rules out every non-AES realization. To upperbound this limit, we construct a semidefinite-programming (SDP) hierarchy tailored to separable preparations. For a two-qubit random-access-code witness, the SDP upper bound and the heuristic lower bound coincide to the reported precision, yielding a concrete AES certification. We also formulate a general construction of witnesses for extended preparation sets containing target pure-state AESs. Examples based on equiangular tight frames, a minimal AES, and mutually unbiased bases further illustrate the scope of the method. In summary, our results establish a systematic and experimentally feasible approach to the certification of AESs in semi-device-independent quantum information protocols.
Read the full abstract
Dynamical Systems
Stability and Wandering of Bumps in Neural Fields with Interneuron Subtypes
The maintenance of continuous variable information in working memory is thought to rely on persistent patterns of cortical activity. In delayed-estimation tasks, neural activity can form localized activity peaks, or “bumps,” whose positions track the remembered variable. Such activity is well described by continuous-attractor neural field models, but most existing models collapse cortical inhibition into a single homogeneous population. Here, we introduce a stochastic neural field model with distinct excitatory, parvalbumin-expressing (PV), and somatostatin-expressing (SST) populations to examine how inhibitory subtype structure shapes persistent activity. Using a Heaviside firing-rate approximation, we derive stationary bump solutions and reduce their linear stability to separate shifting and scaling modes. We show that population thresholds and inhibitory timescales determine both bump stability and the mechanism by which stability is lost, while inhibitory connection strengths and spatial scales substantially reshape the stable parameter region. In particular, broader SST connectivity promotes stable bump states. Finally, we derive an effective diffusion coefficient for noise-driven bump wandering and show that increasing the SST spatial footprint reduces the rate of memory diffusion. Together, these results demonstrate how inhibitory subtype structure can shape both the deterministic stability and stochastic precision of continuous-attractor memories.
Read the full abstract
Artificial Intelligence
Autonomous Research for Open-Ended Problems: A Case Study on Telecom Ticket Retrieval
Recent breakthroughs in LLM-based systems and their abilities in problem solving and coding have allowed progress in the AI for Science paradigm, potentially replacing human roles in machine learning (ML) research. However, while several frameworks of fully autonomous end-to-end ML research have been proposed, successful implementations of them are often limited to problems with narrow search spaces, like language modeling or biomedical ML benchmarks. In this paper, we explore how autonomous research can be adapted to solve open-ended, industry-grade ML problems, by considering a case study: telecom ticket retrieval, an open-ended task with degrees of freedom in representation, architecture, and training data generation. We discover that autonomous research for open-ended problems with commercial and open-source agents shows both promise and limitations: while autonomous research can excel in narrow hyperparameter optimization, it lacks human-like intuition and creativity and requires operational overhead. Even with minimal human supervision, autonomous research can reach $90\%$ of state-of-the-art performance (0.34 vs. 0.38 Recall@1) in a much shorter time period (10 weeks vs. 10 months of human work) at a modest cost (up to \$200 per Cursor campaign). Our empirical evidence recommends that human researchers and autonomous research frameworks work together for best results in ML research.
Read the full abstract
Machine Learning
MAxBench: A Multinomial Concept Recovery Benchmark
Fine-grained control of language model behaviors (e.g., steering) is among the more actionable outcomes of interpretability research. For binary concepts such as refusal, a single direction in activation space often suffices for steering. However, many concepts are not binary: Animals and Countries contain many subcategories, each with multiple instances. For these concepts, the search space over possible representation geometries is far larger than for binary concepts; it is thus not clear what geometries are most appropriate, nor what methods are most effective at recovering them. In this work, we introduce MAxBench, a geometry-agnostic evaluation framework for multinomial concept representations based on sampling from the recovered concept representation. We use MAxBench to compare 10 localization methods (covering 5 geometry types) across 6 concepts and 4 models. Using this framework, we find that (i) affine subspaces steer more reliably and have greater recall than rank-one or linear subspaces; (ii) much of this advantage is due to better non-zero offsets rather than the choice of bases; (iii) manifold steering is competitive with the best methods when applicable; and (iv) no method consistently outperforms prompting, in alignment with prior findings on binary concepts. These findings underscore the importance of expanding the scope of interpretability research and meta-evaluation to concepts with more varied structure.
Read the full abstract
Software Engineering
Involving before Evolving: A Vision for Trustworthy Enterprise Digital Twin Engineering
Enterprise Digital Twins (EDTs) promise data-driven decision support at organizational scale, but realizing them requires navigating siloed departments, tacit knowledge, and high-stakes decisions with long-horizon consequences. Existing approaches involve domain experts during model development but focus less on early organizational buy-in in EDTs. We present a vision for trustworthy EDT engineering grounded in an `involving before evolving' paradigm: rapidly involving stakeholders through a working prototype before evolving toward federation and full interoperability. Our three-stage approach combines foundation models for rapid prototyping, an ontological backbone for federated interoperability, and observability tooling for stakeholder trust. We ground our vision in an ongoing collaboration with Michelin, a multinational manufacturer, where an initial prototype has helped support stakeholder buy-in.
Read the full abstract
Mesoscale and Nanoscale Physics
Visualizing Chiral Edge Modes in Twisted Cuprate Superconductors via Scanning-Probe Quantum Sensing
Recently, unconventional superconductivity hosted by twisted van der Waals (vdW) heterostructures has received immense interest due to the exotic pairing symmetry, electronic interactions and nontrivial topological nature that are naturally relevant to the fast-advancing quantum technologies. Here, we report scanning-probe quantum sensing of nanoscale electromagnetic behaviors of twisted vdW cuprate superconductors. Using single-spin relaxometry, we directly visualize edge modes spontaneously formed in twisted Bi2Sr2CaCu2O8+x (BSCCO). By investigating temperature dependent variations of edge-state-induced quantum spin relaxation, we experimentally evaluate the magnitude of nontrivial topological band gap opened at nodal points in twisted BSCCO and its critical temperature behaviors under different twist angles. We further observe alternating chiral domains defined by edge modes, exploring experimental signatures of in-plane magnetic field-induced topology in 45{\deg} twisted BSCCO. Our results advance the current understanding of twisted vdW nodal superconductors, presenting an appealing high-temperature topological superconducting material platform for cutting-edge quantum innovation.
Read the full abstract
High Energy Physics (Phenomenology)
$B_{(s)}\to V M_X$ decays as probes of dark-matter scenarios of Belle II enhancement in $B\to KM_X$ decays
Recently, we have shown that the hypothesis of the dark-matter (DM) origin of the Belle II excess events in $B\to K M_X$ decays allows for a successful description of the data. The DM parameters (masses and couplings) in two DM scenarios with either scalar (S-scenario) or vector (V-scenario) mediator have been extracted with rather small uncertainty from fits to the $B\to K M_X$ data. The same mechanism leads to a similar enhancement of the $B_s\to (\eta,\eta',\phi) M_X$ decay rates. We present a detailed analysis of $B\to K^* M_X$ and $B_s\to \phi M_X$ decays and show that these decays provide a clear probe of the S- and V-scenarios: Compared to the Standard Model, in the S-scenario an enhancement by a factor $\sim 1.6$ is expected, whereas the V-scenario leads to a much larger enhancement by a factor $\sim 3.5$. For the $B\to K^* M_X$ decays, we provide the expected number of events at Belle II for the sample for which a rather large enhancement of $B\to K M_X$ decays compared to the Standard Model expectations has been reported.
Read the full abstract
General Economics
Policy Targeting with Binary Classification Trees: an Application to Rural Hospital Closures
Empirical researchers often use binary classification trees to identify subgroups at risk of adverse outcomes. We compare two classification tree algorithms in this policy-targeting context: classical classification and regression trees (CART) and the maximizing-distance final-split approach (MDFS). We establish a theoretical setting in which MDFS identifies a high-risk subgroup while CART identifies none. Applied to rural hospital closure data, MDFS targets a high-closure-probability subgroup: for-profit hospitals with more than 63 days in accounts receivable. CART misses this subgroup. To facilitate further application of these classification tree algorithms, we provide targetree package in Python, R, and Stata.
Read the full abstract
High Energy Physics (Theory)
Dominant Young Diagrams in Matrix Models and Partial Deconfinement
We discuss dominant representations (or Young diagrams), in thermal matrix models with gauge symmetry from the perspective of partial deconfinement. We propose a prescription for defining the dominant representations for thermal matrix models with interaction terms. As an explicit example, we consider the large-$N$ Gaussian matrix model. We obtain the Vershik–Kerov–Logan–Shepp (VKLS) shape of the dominant Young diagrams through a new analytic saddle-point analysis based on a mapping of the representation theory of U($\infty$) to free fermions in two spacetime dimensions. This computation provides a direct derivation of the previously observed functional relation between the shape of the dominant Young diagrams and the eigenvalue distribution of the thermal holonomy: the position of the complex saddle point is naturally identified with the eigenvalue. The dominant Young diagrams admit a natural interpretation in terms of partial deconfinement: the number of rows in the dominant Young diagrams matches the size of the submatrix corresponding to the deconfined subsector.
Read the full abstract
Probability
Convergence and compactness of discrete aggregation trees
We study a class of random aggregation trees that generalizes the discrete stick-breaking construction of the uniform labelled tree (Aldous, 1991). To sample the tree of size $n$, vertices are added sequentially, with the $i$th vertex starting a new branch with a prescribed probability $f(n,i)$; otherwise, it extends the current branch. We also define a continuum analogue by replacing the Poisson point process of intensity $tdt$ in the construction of the Brownian continuum random tree by one of intensity $f(t)dt$. We establish scaling limits for two families of discrete aggregation trees in the Gromov-Hausdorff-Prokhorov topology. When $f(n,i)=(i/n)^\beta$, with $\beta>0$, after rescaling the graph distance by $n^{-\beta/(\beta+1)}$, the random tree converges to the compact aggregation tree with $f(t)=t^\beta$. This recovers convergence to the Brownian continuum random tree when $\beta=1$ (Aldous, 1991), as well as scaling limits of choice spanning trees for integer $\beta$ (Archer and Shalev, 2024). We also prove convergence under rescaling to the compact aggregation tree with $f(t)=\log^\gamma(1+t)$ for every $\gamma>1$. Finally, we identify necessary conditions for compactness. Consequently, the threshold $\gamma>1$ in the logarithmic family is sharp. These results provide insight into an open problem on compactness criteria for random aggregation trees (Curien and Haas, 2014).
Read the full abstract
Quantum Physics
Error Correction in a Distributed Quantum Computer
Building fault-tolerant quantum computers with large numbers of logical qubits requires both scalable hardware architectures and error-correcting codes that make efficient use of physical qubits. Photonic interconnects address both of these challenges by allowing the physical qubits to be distributed across multiple processors while providing the non-local connectivity necessary to implement resource-efficient codes such as high-rate quantum low-density parity-check (qLDPC) codes. A key requirement for realising this architecture is the ability to perform stabiliser measurements between remote processors, which has not previously been demonstrated experimentally. Here we report the first experimental demonstration of distributed quantum error detection and correction. We generate entanglement between network qubits in two separate trapped-ion processors and use it to perform remote syndrome measurements on data qubits. We first realise a distributed [[2, 1, 1]] repetition code, detecting phase-flip errors on a logical qubit encoded across the two modules in real time and suppressing logical errors. We then combine these mid-circuit syndrome measurements with real-time feedforward to actively correct arbitrary single-qubit Pauli errors on a distributed Bell state. These results provide an experimental foundation for quantum error correction (QEC) across modular quantum architectures.