Peer Revenue Play credits. Real papers.

Papers

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

All of arXiv

Thursday 10 September

Networking

Challenges and Opportunities in the Transition from 5G to 6G Networks

The rapid adoption of 5G revolutionized connectivity worldwide, enabling faster data transfer along withthe support of a variety of use cases. However, next-gen technologies demand higher performance, as the limitations of 5G become increasingly apparent. The 6G network transition is approaching but comes with unique challenges, particularly with spectrum management, security, and data transmission. The present research considers the most significant challenges that must be addressed for a smooth and successful 5G-6G transformation to occur. Based on case studies and academic literature, the research employs a comparative approach and statistical analysis to evaluate 5G limitations and assess the innovative potential of 6G. The envisioned contribution is the identification of the most significant technical, regulatory, and security vulnerabilities, along with proposed solutions. Through these alternatives, the research will help to identify 6G networks that are secure, resilient, and applicable globally for use and additional critical infrastructure support.
Read the full abstract

Quantum Physics

Benchmarking the computational power of quantum computers

Quantum computing hardware is advancing rapidly toward utility-scale machines that will enable scientific breakthroughs. Many teams are pursuing distinct and difficult-to-compare routes to this goal, using different qubit technologies and logical architectures. Tracking progress toward quantum utility therefore requires rigorous benchmarks that measure computational capability relative to utility-scale challenge problems and enable fair comparison across disparate platforms. Here we demonstrate direct, cross-platform measurement of quantum computational capability using a new benchmark that quantifies the size of the largest computationally relevant quantum circuits that a machine can execute successfully and the speed at which it can execute them. We apply this quantum universal operation performance system (QUOPS) experimentally to leading processors from Quantinuum, Google, and IBM, computing directly on physical qubits. Translating state-of-the-art resource requirements for recognized challenge problems that represent useful quantum computation into effective QUOPS circuit sizes shows that computational capability must grow by 5 orders of magnitude, motivating fault-tolerant approaches. We use the same benchmark to assess the performance of a simple fault-tolerant logical-qubit processor implemented on up to eight [[7,1,3]]-encoded logical qubits using Quantinuum Helios-1, and project the growth of capability across successive generations of fault-tolerant quantum computers to show how QUOPS can track progress toward quantum scientific utility.
Read the full abstract

All authors Timothy Proctor, Oliver Hart, Oliver Widzowski Maupin, Matthew Girling, Daniel Hothem, Daniel Mills, Jordan Hines, Karl Mayer, Jacob S. Nelson, Tyler LeBlond, Zohim Chandani, Diego Forlivesi, Piper C. Wysocki, Boldizsár Poór, Joan M. Dreiling, Annie Park, Adam P. Reed, Brian Estey, Cameron Foltz, Akhil Isanaka, M. S. Allman, Michael Mills, Maxwell D. Urmey, Peter E. Siegfried, Audrey Faricy, Jin-Sung Kim, Cristina Cîrstoiu, Andrew D. Baczewski, Charles H. Baldwin, Robin Blume-Kohout

Cryptography and Security

Hardware Fingerprinting FTQC via Quantum Decoder Timing

As the quantum computing field transitions toward Fault-Tolerant Quantum Computing (FTQC), intensive efforts are focused on scaling architectures and realizing active error correction. However, this shift introduces security surfaces that remain largely unexplored. Fault-tolerant quantum computers pair a quantum processor with a classical decoder that sits on the critical path of every syndrome-extraction round. For the first time, this work demonstrates that the wall-clock time each decoder takes to process a syndrome measurement and decoding round constitutes a novel, exploitable hardware side channel on physical quantum hardware. Using per-shot decoder timings from three IBM Heron processors collected over a 68-day window, the decode-time distribution alone allows a passive observer to (i) reconstruct the shot-by-shot detector-firing distribution and estimate the workload's logical error rate $p_L$, (ii) infer the code distance in use, and (iii) fingerprint the specific physical device with up to 89% accuracy (a random guess is 33%), with a pooled two-sample Kolmogorov-Smirnov test confirming the decode-time distributions are statistically distinct. In noisy simulation inspired by public data from Google's 105-qubit Willow processor, decoder timing further distinguishes 9 surface-code patches at different locations on the chip with 81% accuracy, showing the side channel persists on below-threshold fault-tolerant hardware from a different vendor and code family.
Read the full abstract

Networking

On Identifying Adversarial Intent Injection in AI-Native 6G Networks

AI-native 6G networks have brought Intent-Based Networking (IBN) to the forefront, enabling high-level goals to be translated into network configurations. However, this abstraction opens new attack surfaces, primarily adversarial intent injection, where malicious policies are disguised within benign intent flows. The detection of attack instances might become significantly more difficult if the adversaries adopt a stealthy mode of malicious intent injection. With all these in mind, we first define a fine-grained threat model that facilitates the threat of malicious intent injection in an AI-native network. Alongside, we investigate four malicious intent injection strategies$-$ stealth-mode, random distribution, increasing frequency, and decreasing frequency- and propose a dual-path detection framework: (i) a CNN using TF-IDF features for supervised malicious intent detection, and (ii) an AutoEncoder trained exclusively on benign data for one-class malicious intent detection. Our evaluation demonstrates strong detection performance, with accuracy improving to 0.97 (~9% gain) and F1-score to 0.98 (~36% gain) over the state-of-the-art baseline.
Read the full abstract

Distributed Computing

Consensus-based Decentralized Distributed Swarm Learning with Heterogeneous Big Data

Artificial intelligence increasingly relies on large-scale, distributed, and heterogeneous data collected by edge devices. However, the practice of edge intelligence remains challenging due to non-convex objectives, data heterogeneity, and complex wireless network topology. To address these issues, this paper proposes a consensus-based decentralized distributed swarm learning (CD-DSL) framework for wireless edge networks. Our CD-DSL integrates consensus optimization with particle swarm optimization (PSO), by reaching the model consensus among neighboring devices while leveraging the PSO exploration and exploitation. The consensus mechanism supports decentralized coordination without raw-data exchange, while PSO-inspired updates utilize historical and neighbor-shared experience to enhance exploration for non-convex optimization, improve robustness to data heterogeneity, and accelerate convergence. We further develop an adaptive neighbor-mixing strategy that learns performance-aware consensus weights, improving decentralized collaboration among heterogeneous edge devices. Theoretical analysis establishes that CD-DSL maintains participant consistency and achieves non-ergodic convergence to a neighborhood of a stationary point under non-convex objectives. Experimental results show that CD-DSL can mitigate the performance degeneration of existing decentralized baselines caused by heterogeneous data.
Read the full abstract

All authors Zhuoyu Yao, Dong Yang, Yue Wang, Songyang Zhang, Yingshu Li, Zhi Tian, Zhipeng Cai

Robotics

A Data-Driven Distributed Control Scheme: Learning Multi-Objective Agent-Based MPC for Path-Tracking

Agent-based model predictive control (AMPC) has recently been proposed for vehicle systems with various controllers, such as differential braking and torque vectoring, where controllers are regarded as distributed agents contributing to the same objective. However, this scheme is challenging in handling multiple conflicting objectives with coupled agents. A common approach for such tasks is the integrated MPC, where all objectives and agents are stacked together in one optimization. Nevertheless, as more agents and objectives are involved, the integrated MPC will face challenges like computational burdens and maintenance difficulties in practice. To this end, this paper proposes a learning multi-objective AMPC that can improve design flexibility and computing efficiency. First, under the assumption of information exchange, a multi-objective AMPC tailored from the alternating direction method of multipliers (ADMM) is proposed to decouple the system and achieve the same performance as the integrated scheme iteratively. Second, a learning-based method for initializing iterations is proposed to accelerate convergence. In addition, a data management method is proposed for real-time efficiency, and an authentication module is designed for learning reliability. We compare the proposed scheme against the integrated scheme via a combined path-tracking simulation for autonomous vehicles with various controllers. The proposed scheme achieves the same control performance as the integrated one while reducing the computational time by 43.5%. Furthermore, the learning-based method saves 88.6% more computational time than without learning, making it suitable for real-time implementation.
Read the full abstract

All authors Jiaming Zhong, Reza Valiollahi Mehrizi, Yash Vardhan Pant, Amir Khajepour

Information Theory

Random Access and Localization in Cell-Free User-Centric Networks with Multipath Channels

In a wireless network, the initial/random access mechanism (RACH) allows idle/new users to join the network and (possibly) request allocated transmission resources for subsequent traffic. Building on our own previous work, for cell-free user-centric networks, we consider location-dependent random access codebooks such that users in a certain geographic area (location) make use of the corresponding set of random access preambles (codewords). We expand our previous work in two ways: (1) we consider multipath channels with line-of-sight (LoS) propagation within a given radius; (2) we consider two different approaches. The first makes use of Zadoff-Chu (ZC) sequences and GLRT detection to cope with the unknown delay, and it is conceptually similar to the 3GPP 2-step RACH specification (here extended to the cell-free case). The second builds on our previous work on multisource approximate message passing (AMP). For both schemes, we also consider a novel near Maximum-Likelihood approach for localization of the random access users directly from the detected RACH preambles, implicitly using angle of arrival and time difference of arrival information embedded into the LoS components. Simulation results show that the AMP approach achieves generally better performance for random access user detection, while both approaches have similar localization capability with a slight superiority for the frequency-domain scheme.
Read the full abstract

Information Theory

Joint Random Access and Localization in Cell-Free User-Centric Networks with Frequency-Selective Fading Channels

We study random access (RACH) schemes for cell-free (CF) user-centric networks to handle many geographically distributed users with sporadic traffic and intermittent activity. The RACH must allow the system to: 1) detect preambles sent by the (yet unknown) random access users in the RACH slot; 2) localize them for fast allocation of user-centric radio-unit (RU) clusters. Most prior work uses simplified models, neglecting frame-synchronous but chip-asynchronous transmission, possible line-of-sight (LoS) propagation for certain user-RU pairs, and multipath non-line-of-sight (NLoS) propagation yielding frequency-selective channels. Building on our previous work, we consider location-dependent partitioned random access codebooks where users in a geographic area (location) use the corresponding subset of random access preambles. We present a unified framework for joint detection and localization over a spatially consistent network-wide channel model, incorporating these neglected aspects. We evaluate two schemes: 1) a “legacy” scheme using Zadoff-Chu (ZC) sequences, extending the 3GPP 2-step RACH to the CF case; 2) our multisource approximate message passing (AMP) approach extended to multipath frequency-selective fading. For both schemes, we develop novel approximated GLRT preamble detection and Maximum-Likelihood position estimators with super-resolution refinement, implicitly exploiting received signal strength, angle of arrival, and time-difference of arrival information embedded into LoS components. Numerical results show that the AMP-based scheme achieves superior preamble detection, while both schemes have similar and excellent localization capability.
Read the full abstract

Artificial Intelligence

Mined from Scientific Literature: Process Schemas for Atomic Layer Deposition and Etching in Materials Science

Atomic layer deposition (ALD) and atomic layer etching (ALE) are reported heterogeneously across experimental and simulation literature in materials science, hindering comparison and machine-actionable reuse. We present four domain-expert-reviewed JSON Schemas for ALD and ALE experimental and simulation processes. Curated with schema-miner and grounded in QUDT using schema-miner pro, the schemas structure materials, process conditions, configurations , and measured or predicted results. We compare their scope, structure, and semantic grounding, and demonstrate their use for schema-guided literature extraction and publication of structured records through ORKG templates.
Read the full abstract

All authors Sameer Sadruddin, Eleni Poupaki, Alex Watkins, Bora Karasulu, Adriaan J. M. Mackus, Erwin Kessels, Sören Auer, Jennifer D'Souza

Algebraic Geometry

Characteristic Classes of Adelic Vector Bundles and Applications

We define numerical adelic characteristic classes for vector bundles on projective varieties over number fields. The metric data are carried by the tautological quotient line bundle on the associated projective bundle. The construction uses the established intersection theory of adelic line bundles. Higher characteristic classes are multilinear intersection functionals. They are continuous for simultaneously controlled model sequences that are Cauchy for the supremum norm. We construct the resulting tautological numerical intersection algebra. We also prove controlled numerical Bogomolov–Gieseker inequalities. We first treat the case of a curve over $K$, where the numerical inequality is combined with the Deligne pairing and the adelic Hodge index theorem. We then pass to higher dimension, using Moriwaki's model-level dimension induction before taking the controlled Zhang limit. The curve theorem includes equality and uniform-gap criteria.
Read the full abstract

Machine Learning

GUIDE: Generative Utility Inference and Decision Engine

Measuring the preferences of human users remains a fundamental challenge of AI alignment. Existing elicitation approaches struggle to efficiently discover multidimensional preferences or accurately ground these inferences in domain knowledge. To address this, we introduce GUIDE, an LLM-driven elicitation architecture that infers user preferences through conversations by combining Bayesian adaptive sampling for question selection and symbolic representation learning to initialize domain-specific preference models. GUIDE generalizes adaptive sampling to diverse elicitation questions through an extensible type system of transforms on a parameterized preference state. GUIDE produces domain-specific preference representations through an initialization process using symbolic rule-based learning to capture world knowledge and set priors over preference dimensions grounded in data about decision alternatives. The architecture provides observability and steerability to facilitate deployment and analyze elicitation processes. In silico experiments on investment portfolio optimization demonstrate that GUIDE improves cold-start and minimizes recommendation regret consistently within early elicitation interactions across user personas compared to prior work, LLM-only baselines, and ablated GUIDE versions.
Read the full abstract

All authors Anagha Tiwari, Alexander G. Gray, Nick Feamster, Brian Jabarian, Alex Imas, Alex Kale

Statistical Methodology

The Anatomy and Boundary of Adaptation under Temporal Tabular Shift

Prequential adaptation of frozen tabular foundation models under temporal drift, with each label revealed only after prediction, helps some deployments and harms others, yet current practice does not predict which. We study the sources and limits of these gains. A diagnostic anatomy attributes gains to four recurring mechanisms under a streaming protocol that removes three optimistic biases and quantifies a fourth. Within an agnostic total-variation drift class, the target conditional is only partially identified: its identified-set diameter, the wall, is irreducible from unlabeled data uniformly in sample size. A second, orthogonal $L^2$ projection wall quantifies what the frozen representation cannot express. Two canonical mechanism priors collapse the first wall. Under stated nuisance-rate conditions, the wall can be estimated from labeled historical windows at a $\sqrt N$ rate above the margin threshold $\gamma^\star=d_0/(2\alpha_s)$. At $\gamma=0$, the conditional lower-bound program depends on an open affinity estimate; the positive-margin lower branch also remains open. Semi-synthetic data illustrate the finite-sample mechanism with calibrated exponents. Stream-level proxies on eight industrial streams fall on the difficult side under a stated roughness bound, while the equality case $\gamma=\gamma^\star$ remains unresolved.
Read the full abstract

All authors Tianyu Wang, Xi Vincent Wang, Lihui Wang, Mian Li, Zhihao Liu

Combinatorics

Long Cycles in 2-Connected Tough Graphs

Let $G$ be a graph. The circumference of $G$, denoted by $cir(G)$, is the length of a longest cycle in $G$, or zero if $G$ is acyclic. In 1993, Broersma, van den Heuvel, Jung, and Veldman conjectured that, for every $t>0$, there is a constant $A=A(t)>0$ such that every 2-connected $t$-tough graph of order $n$ has circumference at least $A\log n$; the conjecture is recorded as Conjecture~2 in the 2006 survey on toughness by Bauer, Broersma, and Schmeichel. In this note, we confirm the conjecture. More precisely, every 2-connected $t$-tough graph $G$ of order $n$ satisfies $cir(G)\ge \lceil \log_k((k-1)n+1)\rceil$, where $k=\lceil 1/t\rceil+2$. The proof combines Win's bounded-degree spanning tree theorem with the theorem of Briański, Joret, Majewski, Micek, Seweryn, and Sharma that the treedepth of a 2-connected graph is at most its circumference.
Read the full abstract

Representation Theory

A Coefficient Calculus for Unitary (g,K)-Modules of SU(2,2)

We develop an explicit operator and coefficient calculus for admissible (g,K)-modules of SU(2,2), where g = sl(4,C) and K = S(U(2) x U(2)). The K-types are indexed by triples (n,k,m). We introduce operators A_delta and B_delta associated with the noncompact roots, together with auxiliary operators Q and R. We establish their commutator relations, the central coefficient relations, and, in the unitary setting, the corresponding adjoint and norm-factor identities. This reduces part of the analysis of (g,K)-modules to the study of scalar coefficients arising from compositions of these operators. The coefficient formula applies to weights of multiplicity one, including all boundary weights. We derive necessary sign restrictions and explicit relations constraining the coefficient space. These coefficients also determine irreducibility. Several families of unitary (g,K)-modules are analyzed according to the minimal value of n+m. For N=0, the construction yields two-parameter families of unitary modules and describes reducibility when certain coefficients vanish. For N>0, the method produces both larger families of K-types and multiplicity-free ladder-type families. The resulting patterns are compatible with the known description of the unitary dual of SU(2,2) due to Knapp and Speh. The paper provides an explicit framework for recovering unitary (g,K)-modules from their K-type structure and suggests a possible approach to other real reductive groups.
Read the full abstract

Operator Algebras

Stationary states on a $C^*$-algebra for an inner action

We study stationary states for actions of countable discrete groups on unital separable $C^*$-algebras. We prove that the stationary state space associated with an inner action of a subgroup of the unitary group that generates the algebra is a Choquet simplex. We also give a locality criterion covering Bernoulli shifts. The simplex structure yields a canonical decomposition of stationary states into tracial and purely nontracial parts. For inner actions, we characterize extreme stationary states by factoriality of their GNS von Neumann algebras. We further show that a stationary state is tracial if and only if its GNS von Neumann algebra is finite, and that it is purely nontracial if and only if this algebra is of type~$\mathrm{III}$. As applications, for $2\leq d\leq\infty$ the stationary state simplex of $C^*(\mathbb{F}_d)$ has a Poulsen face, while for a nontrivial property~$(T)$ group the stationary state simplex of $C^*(\Gamma)$ is not Poulsen. Finally, we give a sufficient spectral-gap condition for $S_{\mu}(A)$ to be a Bauer simplex and construct a family $(A_d,\Gamma_d,\mu_d)$ satisfying this condition.
Read the full abstract

Computation and Language

Population-level measures of perceived food access reveal barriers beyond geographic proximity

Food access is multidimensional, but population-level measurement still relies heavily on geography because perceived dimensions of access are difficult to measure at scale. Here, we use 25,125 Google Maps reviews from 49 grocery stores in Raleigh, North Carolina, to measure five dimensions of food access: availability, accessibility, affordability, accommodation, and acceptability. We identify review topics with unsupervised topic modeling and assign them to access dimensions using zero-shot classification, with 85.4% agreement against manual coding. The resulting store-level measures capture distinct aspects of food access and reveal barriers that geographic proximity alone does not capture. Comparisons between nearby stores in the same chain further show that identical store policies can be perceived very differently across locations, consistent with food access reflecting the fit between residents and their food environment. Perceived food access also follows systematic socioeconomic and demographic patterns that broadly parallel, but do not replicate, those observed for geographic access. These results show that online grocery reviews can provide a scalable complement to geographic measures of food access.
Read the full abstract

Software Engineering

Missing Dimensions: Integrating Human and Social Systems into Digital Twin Engineering

Digital twins (DTs) have emerged as a key technology at the core of digital transformation, yet their engineering practice remains too narrowly focused on engineered and natural systems. This paper argues that four system dimensions must be explicitly recognized in DT engineering: Engineered, Natural/Biological, Human, and Social. Each dimension brings distinct properties, modeling requirements, and ethical obligations that fundamentally shape what a DT must represent and how it must be built. We further argue that as DTs extend into the Human and Social dimensions, the emphasis should shift from automated control toward decision support and occupant empowerment. We illustrate our arguments using a smart building as a running example and identify four open research challenges for multi-dimensional DT engineering.
Read the full abstract

Soft Condensed Matter

Colloidal shadows reveal hidden solute transport

An object releasing a chemical into a surrounding flow leaves behind a plume that encodes the rate of release, but for most solutes, that plume is invisible. Classical transport theory describes this configuration through a self-similar concentration boundary layer whose structure has never been resolved experimentally in forced flow at low Reynolds number: a century of measurements at these conditions has returned integrated transfer rates rather than the field itself. Here we show that both the field and the information it carries are experimentally accessible. Around hydrogel posts photopatterned inside a microfluidic channel, a released solute drives suspended colloidal particles away by diffusiophoresis, i.e., their drift along chemical gradients, carving a particle-free “shadow” downstream. Using a fluorescent solute, we resolve the concentration field around the post and recover the classical self-similar structure of convective mass transfer. For an invisible surfactant, the width of the shadow, benchmarked against a directly imaged solute on the same platform, then serves as a proxy for the dimensionless rate of mass transfer from the post. Finally, comparing two orientations of a triangular post tests a classical prediction by Brenner: the local concentration fields rearrange, yet no orientation dependence of the integrated transfer rate is resolved. For solute–tracer pairs whose diffusiophoretic response is known, colloidal shadows thus turn ordinary tracer particles into quantitative reporters of chemical exchange that cannot be observed directly.
Read the full abstract

Social and Information Networks

Exploring Climate-Related Anxiety Through Social Media Content

This study explores climate-related anxiety as expressed through social media discussions on Reddit. Using natural language processing techniques, we analyse large-scale textual data to identify recurring themes, emotional patterns, and how these evolve over time. Text data was preprocessed and analysed using BERTopic for topic modelling and a transformer-based model for emotion classification across 28 categories using the RoBERTa-base GoEmotions model. Results show that climate-related discourse is structured around a small number of core themes, primarily separating action-oriented discussions like advocacy and policy from informational and reflective content. Emotional analysis reveals that negative emotions such as fear and sadness are more prominent in posts, while comments often introduce a wider range of responses, including care, encouragement, and neutral reactions. These findings suggest that online climate discourse is shaped not only by the topics being discussed, but also by how users engage with and respond to one another. This work provides an initial framework for understanding climate-related anxiety through large-scale social media analysis and highlights opportunities for improving future models, expanding platform coverage, and incorporating youth-centred perspectives.
Read the full abstract

All authors Karim El-Sharkawy, Zainab Rehman, Vikrant Kumar, Ardavan Shahrabi, Bobbie Williams

Combinatorics

Generalized Sterboul–Deming Configurations

Sterboul and Deming gave classical matching-based characterizations of non-Kőnig–Egerváry graphs through flower–posy and blossom-pair configurations. We consider two classical configuration families, denoted \(T\) and \(S\), and introduce a new walk-based family \(J\), based on \(J\)-flowers and \(J\)-posies. Our main result proves that, for every graph \(G\), \[ \SD_T(G)=\SD_S(G)=\SD_J(G). \] Thus the additional flexibility of the \(J\)-framework preserves the set of vertices detected by the classical configurations. The proof is vertex-preserving and passes through strict-Hall structure in traces of \(J\)-posies. As a consequence, every prescribed vertex of a connected matchable strict-Hall graph lies in a rigid \(T\)-posy for a suitable perfect matching, linking the theory naturally with matching-covered graphs.
Read the full abstract

Computation and Language

Local Edits, Global Ripples: Replay-Informed Policy Adaptation for Workflow Synthesis

Prompt-policy editing offers a practical way to improve agents that synthesize executable workflows without updating the underlying model. However, persistent prompt editing has two coupled properties. First, edit locality does not imply effect locality: an edit confined to one policy segment can ripple through downstream execution, altering behavior beyond the edited segment. Second, edit effects are composition-sensitive: edits that work in isolation can interfere after composition, causing one or both to lose their benefit or become harmful. Persistent adaptation must therefore support two distinct decisions: identifying where the policy should change from execution feedback, and determining whether the resulting edit remains safe to persist after composition. To address these challenges, we introduce RIPPLE (Replay-Informed Persistent Policy Localization and Editing), which separates where an edit is made from whether it remains safe after composition. It diagnoses failed trajectories, maps each actionable failure to a predefined policy segment, and restricts the correction to that part of the policy. RIPPLE then evaluates candidates against the same iteration-start policy to compare their isolated gains, before replaying promising edits after previously accepted updates to expose downstream effects and interactions. Only edits that remain safe under composition are retained. We evaluate RIPPLE on Flow-HO, a synthetic held-out benchmark for executable workflow synthesis. RIPPLE improves validation success by up to 23.1% and yields positive gains on two additional frozen language-model backbones, while maintaining edit efficiency and low execution cost. Targeted interaction analysis further demonstrates both properties: a segment-local tool-use edit changes downstream resource resolution and validation, while an edit beneficial in isolation becomes harmful after composition.
Read the full abstract

All authors Manqing Mao, Hong Wang, Samson Koelle, Jie Yuan, Zhuoer Wang, James Feng, Yanjun Lin, Daniel Edmiston, Nikki Lijing Kuang, Zhecheng Sheng, Wei Niu

Quantum Gases

Topological chirality of dissipative limit cycles in an open Dicke model

In an open, $U(1)$-symmetric Dicke model with chiral atom-cavity couplings, we show that dissipation drives two limit-cycle phases of opposite chirality in the thermodynamic limit, obtaining exact analytical solutions. These phases are separated by a $U(1)$-broken superradiant state, lending the phase diagram a topological character, and persist under $U(1)$-preserving perturbations, making them candidates for chiral continuous time crystals. In addition to stable normal and inverted steady states, the model also exhibits multistability, where the long-time dynamics is set by the initial state. Our results establish dissipation as a resource for inducing chiral dynamical order in light-matter coupled systems.
Read the full abstract

Combinatorics

Curvature-Distortion Numbers of Graphs: Nonnegative Lin–Lu–Yau Curvature

We introduce the curvature-distortion number, a scale-invariant parameter measuring the least multiplicative spread of positive edge weights required to make a weighted discrete curvature nonnegative everywhere. We develop the theory for Lin–Lu–Yau curvature when the transport distance is the fixed combinatorial graph distance. For trees, the invariant admits an explicit nonlinear fixed-point description, which produces a canonical optimal weight that is unique up to scaling. More importantly, the curvature-distortion number controls the branching topology of the tree: for every finite tree $T$, \[ |B(T)|\le \left\lceil \DN_{\LLY}(T)\right\rceil, \] where $B(T)$ is the set of branch vertices. Thus the amount of weight distortion required to achieve nonnegative curvature imposes a direct quantitative restriction on the topological complexity of the tree. For locally finite infinite trees, finite distortion is classified completely: it occurs precisely for the double ray and for one-ended trees obtained from a finite tree by attaching a single ray. This connection between curvature distortion and tree topology extends naturally to general connected graphs through the subgraph formed by edges lying in no cycle of length $3$, $4$, or $5$. Whenever the curvature-distortion number is finite, this tree-like part is a forest unless the whole graph is a cycle of length at least $6$, and each of its tree components inherits the corresponding distortion and topological bounds. In particular, the tree theory yields complete finite-distortion classifications for graphs of girth at least $6$.
Read the full abstract

Quantum Physics

Evidencing Macroscopic Quantum Coherence using Confined Uniform Magnetic Field

A previously unexplored scheme is devised for creating and certifying coherent quantum superposition of distinctly separated states of a spin-tagged massive object passing through a confined uniform magnetic field. This results in entangling the spatial and spin parts of a two-component Pauli wavefunction such that the entailed coherence can be conveniently certified by spin measurements alone. The implementability of this scheme is analysed using NV-centre nanodiamonds of masses $\sim 10^{10}$ amu based on the current technological capabilities.
Read the full abstract

All authors Dipankar Home, Harsh Talwar, Nilaj Saha, Sougato Bose, Arka Banerjee

Machine Learning

Rank-Efficient LoRA via Joint Tangent-Space Optimization under Isotropic Curvature

Low-Rank Adaptation (LoRA) is an effective approach for adapting large pretrained models by learning low-rank weight updates. In practice, the LoRA rank is used to control an adapter's parameter budget and representational capacity. We show that this view is incomplete: while the nominal rank determines the representational capacity, the optimizer shapes how much of that capacity is used in the induced weight-space updates. In a case study of GPT-2 adaptation with LoRA, we observe a strong rank-dependent optimizer effect. Despite using the same nominal rank, AdamW often produces per-step updates with concentrated singular spectra and low effective rank, whereas Muon uses a richer set of directions and benefits more consistently from increasing LoRA rank. These observations motivate ISO-LoRA, an optimizer that couples the LoRA factor updates through spectral descent on the induced tangent perturbation in weight space. ISO-LoRA promotes updates that distribute energy more evenly across singular directions, improving rank utilization while preserving compatibility with the LoRA parameterization. We complement this design with theoretical guarantees showing that ISO-LoRA can achieve higher effective rank than standard factor-wise optimizers through a one-step analysis under a stylized spiked-gradient model. We validate this design on language-model adaptation across 0.1B-7B-parameter models, where ISO-LoRA improves effective rank and downstream performance, with the strongest gains at moderate-to-large LoRA ranks. Our results highlight rank utilization as a key factor in LoRA optimization and suggest that optimizer design offers an important path toward stronger parameter-efficient adaptation.
Read the full abstract

All authors Zihan Zhu, Zhehang Du, Xuyang Chen, Tim Tsz-Kit Lau, Jiayuan Wu, X. Y. Han, Qi Long, Weijie Su

Computation and Language

Quantifying Consonant Contributions to Word Intelligibility via Acoustic Masking

Consonants contribute unequally to whether a word is understood. Given the limited time available for therapy, ranking consonants by contribution to intelligibility helps prioritize intervention targets in motor speech disorders. However, measuring this contribution relies on perceptual studies that are difficult to scale. This paper presents a scalable method that measures consonant contribution using acoustic masking. We silence one consonant at a time in an isolated word and test whether an automatic speech recognition (ASR) model still recognizes the word. We define a consonant's contribution score as the proportion of its masked instances for which the word becomes misrecognized, which we refer to as the mask-induced misrecognition rate (MMR). We relate MMR to two linguistic factors previously reported to correlate with consonant contribution, namely phoneme frequency and functional load. We apply this analysis across four languages, English, Spanish, German, and Czech, using three ASR architectures, MMS (encoder-only), Whisper (encoder-decoder), and Qwen3-ASR (LLM-based). Using partial Spearman correlations, we find that phoneme frequency correlates negatively with MMR while functional load correlates positively. In other words, more frequent consonants are less disruptive when masked, whereas consonants carrying more lexical contrast are more disruptive. Further cross-language analysis shows that consonant rankings agree only partially across languages, indicating that consonant contribution is language-dependent.
Read the full abstract

All authors Eunjung Yeo, Kwanghee Choi, Krupaben Kothadia, Visar Berisha, Julie M. Liss, David R. Mortensen, David Harwath

Algebraic Geometry

Border rank lower bounds beyond weak border apolarity

We provide first examples of border rank lower bounds obtained using border apolarity beyond “weak border apolarity”. Border apolarity introduced by Buczyńska-Buczyński characterizes tensors of border rank greater than $r$ as those whose annihilator does not contain an ideal with certain properties depending on $r$ and the ambient space of the tensor. Previous applications of border apolarity depended on the algorithm developed by Conner-Harper-Landsberg. For a tensor with a large symmetry group it lists a set of ideals that satisfy some of the properties mentioned above. We give first examples where the list is non-empty but we are able to prove that no ideal on this list satisfies all necessary conditions coming from border apolarity. The new lower bound examples include tensors of interest in complexity: the first Schönhage triple sum of matrix multiplication tensors where the border rank was unknown, and the direct sum of two copies of a tensor that could potentially be used to prove the exponent of matrix multiplication is two. A third example of interest in group theory related to work of A. Leitner is also analyzed.
Read the full abstract

High Energy Astrophysical Phenomena

Probing Lorentz Invariance Violation in Cosmogenic Neutrino Propagation with KM3-230213A

We investigate superluminal Lorentz invariance violation (LIV) in the neutrino sector using cosmogenic neutrino fluxes generated with ultrahigh-energy cosmic-ray propagation models. Standard fluxes are calculated with CRPropa 3.2 and subsequently modified using a prescription based on LIV-induced neutrino splitting. Superluminal LIV suppresses the flux at the highest energies while producing an enhancement at PeV - EeV energies. We use the KM3-230213A event as a benchmark to evaluate the sensitivity of current observations to these spectral modifications. Although the available statistics do not allow a formal constraint, the predicted fluxes are particularly sensitive to coefficients in the range $10^{-24} \mathrm{eV}^{-1} \lesssim \delta_{\nu,1} \lesssim 10^{-22}\,\mathrm{eV}^{-1}$, with the results strongly depending on the assumed cosmic-ray source properties. Intermediate coefficients can enhance the expected event rate within the reconstructed energy range of KM3-230213A, whereas larger coefficients may overproduce neutrinos in energy intervals constrained by IceCube and the Pierre Auger Observatory. These results identify a region of observational sensitivity to LIV and provide testable predictions for future neutrino telescopes.
Read the full abstract

Machine Learning

Almost Sure Convergence Analysis of Stochastic Gradient Methods with Clipping and Additive Noise

Stochastic gradient descent (SGD) with gradient clipping and additive noise has become a standard technique for training machine learning models, particularly in applications requiring robustness or privacy guarantees. However, clipping introduces a bias in stochastic gradients, while additive noise introduces additional variance, making the long-run behaviour of individual optimization trajectories difficult to characterize. In this work, we prove that SGD with clipping and additive Gaussian noise (SGD-CN) converges almost surely (a.s.) under smoothness and uniformly bounded stochastic-gradient noise assumptions, provided the step sizes satisfy some standard decaying conditions. Our analysis extends to momentum variants such as the stochastic heavy ball and Nesterov's accelerated gradient, where we show that careful energy constructions yield similar guarantees. These results provide stronger theoretical foundations for understanding the pathwise behaviour of clipped stochastic gradient methods and suggest that, despite the bias and noise introduced by clipping and perturbation, the algorithm remains stable in both convex and nonconvex regimes.
Read the full abstract

Representation Theory

Hitchin's Conjecture for $\mathfrak{sl}_n$ in Odd Prime Degree

We prove Hitchin's conjecture for $\mathfrak{sl}_n$ in every odd prime degree. More precisely, let $p=2k+1$ be prime and let $n\geq k+1$. Every nonzero primitive element $\alpha\in\Lambda^p(\mathfrak{sl}_n^*)^{\mathfrak{sl}_n}$ is nonzero on the top exterior power of the unique $p$-dimensional irreducible submodule of $\mathfrak{sl}_n$ for the adjoint action of a principal $\mathfrak{sl}_2$-subalgebra. The conjecture also holds for types $B_\ell$ and $C_\ell$, with $\ell\geq2$, in every prime degree $p=4r-1$ with $1\leq r\leq\ell$.
Read the full abstract