Computation and Language
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Thursday 27 August
Influential public discourse shapes public beliefs and can also mislead, not only through what is stated, but also through how information is framed, omitted, contextualised, and communicated. Yet less research has focused on how such misleadingness arises and shapes the interpretations formed by readers. To address this gap, we introduce Reader-Centric Misleadingness Understanding (RCMN), a framework that operationalises misleadingness through five dimensions: misleading mechanism, likely reader interpretation, evidence-warranted interpretation, emotional arousal, and communicative intent. Based on this framework, we construct an evidence-grounded dataset of influential public discourse. Empirical findings show that misleadingness is diverse and extends well beyond fabrication, with unsupported inference, exaggeration, and omission among the prevalent mechanisms, and is frequently associated with heightened emotional arousal and distortive communicative intent. Moreover, we investigate whether lightweight claim-and-context representations retain sufficient cues for understanding reader-centric misleadingness without access to richer contextual, evidential, and multimodal information. Evaluation across five recent generative foundation models shows that reader-level interpretations can often be recovered from such limited representations, whereas identifying how misleadingness is produced remains considerably more challenging. These findings highlight the potential of lightweight representations for scalable misleadingness analysis, while reliable understanding of misleading mechanisms continues to require richer contextual and evidential grounding.
Quantum Physics
Randomness can be certified in energy-constrained semi-device-independent scenarios
The prepare-and-measure framework based on energy constraints offers a practical middle ground between fully device-dependent and device-independent quantum cryptography. The only assumption on an otherwise uncharacterized prepare-and-measure device is that the energy of the prepared states is bounded. Existing security analyses of this framework assume that the preparation and measurement devices share at most classical correlations, and under this assumption certified lower bounds on the extractable randomness have been established. Recent work has shown that an adversary who pre-distributes entanglement between the devices can mount attacks that are strictly more powerful than those available when the devices share only classical correlations, reducing the extractable randomness below the previously certified rates. This leaves open the fundamental question of whether randomness can be certified at all in this scenario. We address this open question by constructing semidefinite programming relaxations of the guessing probability by adapting the Navascués-Pironio-Acín hierarchy to the energy-constrained setting where shared entanglement between the devices is permitted. Our relaxations yield certified lower bounds on the extractable randomness without enforcing any restrictions on the dimensions of the quantum state shared between the preparation and measurement devices. We show that these certified lower bounds are strictly positive for a range of energy values, thereby answering the open question affirmatively: certified randomness generation is theoretically possible in the energy-constrained SDI framework even in the presence of a fully quantum adversary.
Read the full abstract
Number Theory
Integers divisible by a shifted prime in a given interval
In this paper we study the behaviour of $H^*(x,y,z)$, the number of integers less than $x$ possessing a divisor in the interval $(y,z]$ of the form $p-1$, where $p$ is a prime, for all values of $y = y(x)$ and $z= z(y)$. We observe multiple phase transitions at critical values of $z$ in terms of $x$ and $y$ guided largely by the anatomy of $n$. Our results generalize a result of Ford from 2017, which corresponds to the case $z = x$.
Read the full abstract
Fluid Dynamics
Dynamical slowdown, bottlenecks, and multiscaling in Voigt-regularised turbulence
We investigate bottleneck formation in turbulence using the Voigt-regularised SABRA model and DNS of the corresponding Voigt-Navier-Stokes (NSV) equations. The Voigt regularisation introduces a scale-dependent slowdown of nonlinear interactions without enhancing dissipation, providing a natural setting to study the interplay between nonlinear transfer and thermalised behaviour. We find three distinct spectral regimes: an inertial range at $k<k_I$, an intermediate equilibrium-like range associated with partial thermalisation for $k_I<k<k_{II}$, and a high-$k$ thermal regime for $k>k_{II}$, where the Voigt contribution dominates the conserved invariant. The crossover to the high-$k$ regime occurs at $k_{II}\sim 1/\alpha$, while $k_I$ marks the onset of thermalised behaviour. Equal and multi-time statistics reveal a progressive suppression of intermittency and a tendency towards Gaussianity at small scales, together with a transition from dynamic multiscaling in the turbulent regime to simple scaling in the equilibrium ranges. The shell model resolves these three regimes over a broad range of scales, while DNS of the corresponding NSV equations reproduces the same qualitative trends, including bottleneck formation, delayed cascade completion, reduced intermittency, and a tendency towards Gaussianity at small scales. We find that bottleneck formation might be associated with scale-dependent dynamical slowdown and incipient thermalisation, rather than being purely dissipative in origin. We provide strong evidence that, in the regime where the regularization parameter $\alpha$ is much smaller than the dissipation length scale, the Voigt model reproduces the same inertial-range turbulent regime and turbulence statistics as the Navier-Stokes (NS) equations. This provides evidence that the Voigt model constitutes an excellent practical approximation to the NS equations for small $\alpha$.
Read the full abstract
Signal Processing
Super-Resolution of Range-Doppler Maps: A Case Study with Chirp-Sequence Radar and Transformer
Range-Doppler (rD) maps produced by chirp- sequence (CS) radar systems are fundamentally limited in reso- lution by bandwidth, carrier frequency, and coherent processing interval constraints. Improving resolution through hardware is often impractical due to regulatory, cost, and real-time operation requirements. In this work, we investigate deep learning-based super- resolution of rD maps in both range and Doppler using a real- world dataset collected with an Infineon millimeter-wave CS radar. We propose a memory-efficient transformer architecture based on dual-path shifted window (DPSWIN) attention, which combines axial/dual-path attention with 1D shifted window (SWIN) attention for scalable processing of high-dimensional radar data. Our model is benchmarked against existing 2D SWIN attention-based super-resolution models, which we adapt to the rD-map super-resolution task. We prioritize reconstruction fidelity over perceptual quality and employ root mean squared error (RMSE)-based training objectives. We avoid adversarial or perceptual losses that may introduce visually plausible but physically incorrect structures. In addition, we incorporate CFAR-based target-detection losses to optimize downstream target detectability in the super-resolved rD maps. We further study the impact of signal processing and training design choices on the super-resolution, including magnitude compression, spatial upsampling strategies, and loss formulations. Experimental results demonstrate that the proposed framework achieves computationally efficient rD map super-resolution on previously unseen real-world environments.
Read the full abstract
Earth and Planetary Astrophysics
Dust torques for realistic dust size distributions
Previous studies have shown that a population of dust particles with a fixed Stokes number can exert a substantial torque on a low-mass planet embedded in a protoplanetary disk, modifying its migration rate. We aim to characterize the dust torque on a low-mass planet for a realistic distribution of dust grain sizes. We performed 2D hydrodynamical simulations of planet-disk interactions using the PLUTO code, with the addition of Lagrangian superparticles representing dust dynamics. We apply an energy-based criterion to exclude the particles that are gravitationally bound to the planet, to prevent circumplanetary flow to contaminate the torque measurements. We find that the dust torque is dominated by the largest grains in the size distribution and is highly sensitive to the maximum grain size. For typical disk conditions, the torque becomes positive for marginally coupled particles ($\mathrm{St} \gtrsim 10^{-2}$) and can exceed the gas torque in the presence of cm-sized pebbles, leading to outward migration of low-mass planets. Unlike previous studies, the turbulent dust diffusion has a negligible influence on the torque over the explored range of $\alpha = 10^{-4}$ to $3\times 10^{-3}$. The dominant contribution arises from within the planetary Hill sphere, highlighting the need for high spatial resolution and accurate integration of particle trajectories. We derive a scaling law for the dust torque as a function of the maximum grain size and the planetary mass, suitable for implementation in population synthesis models.
Read the full abstract
Soft Condensed Matter
Nonparametric multiscale modeling of boundary lubrication: hexadecane in highly pressurized gold asperity contacts
Boundary lubrication is governed by molecular processes at the sliding interface that are inaccessible to classical continuum descriptions. While molecular dynamics (MD) simulations can resolve these processes in atomistic detail, incorporating their output into engineering-scale models through semi-empirical constitutive laws becomes increasingly difficult as confinement approaches the molecular scale. Here, we apply a nonparametric multiscale framework based on Gaussian process (GP) regression to model boundary lubrication of hexadecane confined between gold surfaces under pressures up to 1 GPa and gap heights down to 1.4 nm. The GP surrogates are trained on nonequilibrium MD simulations of the confined fluid and directly provide stress predictions to a continuum thin-film solver, circumventing the need for fixed-form constitutive laws. The framework naturally captures molecular phenomena such as density layering, viscosity changes, and the strongly nonlinear wall slip that dominates the frictional response at high pressures and small gap heights. Our results reproduce the atomistic benchmark data of Codrignani et al., demonstrating that nonparametric surrogate models offer a flexible and physically transparent route toward predictive continuum modeling of boundary lubrication.
Read the full abstract
Machine Learning
Understanding Evolution Strategies for LLM Reasoning: Broader Reasoning Coverage than GRPO
Evolution Strategies (ES) have recently emerged as a memory-efficient post-training paradigm for LLM reasoning. However, the optimization behavior of ES remains understudied, making it hard to define its advantage scope compared to mainstream post-training paradigms (e.g., Group Relative Policy Optimization (GRPO)). By systematically investigating ES dynamics and mechanisms, this paper first identifies a performance advantage of ES over GRPO, theoretically and empirically showing that ES can lead to broader reasoning coverage, thereby better exploiting the reasoning capabilities of pretrained LLMs. Theoretically, we show that verifier-projected Jensen-Shannon diversity across the ES population is helpful to higher Pass@K performances. Empirically, unlike GRPO, which exhibits entropy collapse, ES improves Pass@1 while attaining higher Pass@K than GRPO. We further develop a sequential GRPO-ES training strategy that combines GRPO's strength in Pass@1 with ES's gains in Pass@K. Second, we find that despite substantial whole-model parameter drift, the task-performance gains of ES are only contributed to a sparse subset of larger-magnitude updates. This functional sparsity suggests that large parameter movement need not imply widespread functional change, and held-out evaluations further show that it does not necessarily lead to catastrophic forgetting. Finally, we study how hyperparameter design affects the effectiveness of ES, demonstrating that ES requires a smaller population size in a larger LLM. These findings position ES as a distinct reasoning post-training paradigm rather than a less effective, memory-efficient alternative to GRPO.
Read the full abstract
Quantum Physics
Quantum Chaos and Quantum Optimal Transport
Chaos in classical systems can be characterized by Lyapunov exponents that measure the exponential divergence of nearby trajectories, but directly extending this framework to quantum mechanics has been a persistent challenge. The wavelike nature of quantum states and the non-commutative geometry of quantum phase space obstruct a straightforward generalization of classical chaos theory. Here we develop a rigorous approach to quantum chaos by leveraging quantum optimal transport theory, which provides the missing geometric foundation for measuring distances between extended quantum distributions. We define quantum Lyapunov exponents that naturally avoid divergences encountered when naïvely generalizing classical exponents, and show that in the semiclassical limit they recover the classical global expansion rate, and hence the usual maximal Lyapunov exponent when they coincide. Our framework provides a tight connection between the divergence of classical trajectories and semiclassical phase space evolution, and additionally clarifies the role of out-of-time-order correlators as diagnostics of quantum chaos. These results establish quantum optimal transport as a unifying mathematical foundation for quantum chaos theory, providing new tools to characterize dynamical behavior across the full range of quantum dynamics from simple few-body models to complex many-body systems.
Read the full abstract
Superconductivity
High-Temperature Superconductivity of the Fe-Se-H compound
Using an EPR spectrometer, the dependences of microwave power absorption on magnetic field up to 6000 Oe were measured at temperatures of 3.6-25 K and 295 K in a powdered compound Fe-Se-H, obtained by thermal diffusion of hydrogen into a FeSe single crystal with a critical temperature of 8 K. The shape of the dependences and the analysis of the measurement results confirm the superconductivity of the Fe-Se-H compound at normal pressure, both at temperatures of 3.6-25 K and at 295 K, i.e., at room temperature.
Read the full abstract
Computation and Language
INTENT-AS-A-TOOL Makes it Easy to Track Agentic Misalignment
As large language models (LLMs) are deployed as autonomous agents, safety failures increasingly involve consequential actions. We study agentic misalignment, where agents take harmful actions under goal conflicts and pressures. Using chain-of-thought (CoT) monitoring, we find that harmful execution is often preceded by intent signals in reasoning. However, post-hoc CoT labels are too coarse to show how intent changes during generation. We introduce INTENT-AS-A-TOOL, an approach that adds intent-targeted tools to give the model a dedicated channel for expressing commitment to a target behavior. The probability of calling an intent tool provides a judge-free, fine-grained signal of the model's tendency to pursue that behavior. Our results show that INTENT-AS-A-TOOL complements CoT monitoring, expands post-hoc CoT labels into dense trajectories, and identifies critical steps for online intervention. These findings suggest that action preferences are useful for tracking agentic misalignment during reasoning. Our code and data are accessible: https://github.com/RebeccaZhang22/intent-as-a-tool.
Read the full abstract
Game Theory
Blindfolded pursuit with delays of your choice
We study pursuit-evasion games on graphs with a single pursuer and an invisible evader. The pursuer may assign integer travel times to the edges of the graph and specify a finite sequence of vertices to query, one per time step. The evader then chooses a walk over the same time horizon, aiming to elude all queries. With unit travel times, the setting in which the evader must move at every time step is known as the hunter and rabbit game, while the variant in which the evader can wait at a vertex can be phrased as a firefighting game: the vertices of a burning graph must be extinguished, and any vertex left burning reignites its neighbors. For both settings, we show that the power to choose travel times allows a single pursuer to succeed in polynomial time on any graph. This contrasts with unweighted graphs, where the number of hunters or firefighters needed can grow linearly in the number of vertices. If the evader, in addition to waiting, may start at an earlier time unknown to the pursuer, we show that the pursuer still wins on any graph given exponential time.
Read the full abstract
Complex Variables
The Complete Crouzeix Conjecture in Dimension Three and the Clouâtre-Ostermann-Ransford conjecture
We settle the complete Crouzeix conjecture for matrices of order at most three and prove the Q-algebra case of the completely bounded Clouâtre–Ostermann–Ransford (COR) conjecture for homomorphisms into matrices of order at most three, via sharp abstract column and row estimates. Our approach also establishes the scalar COR conjecture in a stronger form, for homomorphisms with commutative range on Banach algebras with unity satisfying von Neumann's inequality. Under contractivity of the symmetrized map, this result holds on arbitrary Hilbert spaces without initial boundedness assumptions on the homomorphism or the antilinear map. For arbitrary operator algebras, we disprove the complete COR conjecture by an exact three-dimensional example with target matrix order two. We also prove the sharp complete bound for every matrix subalgebra containing the diagonal, in arbitrary matrix order and on arbitrary target Hilbert spaces. We also obtain column and row square-function inequalities with sharp norm bounds, strict scalar bounds for operators similar to normal operators, sharp complete spectral constants for scaled $q$-numerical ranges in dimensions two and three, and rigidity, stability, and representing-measure results.
Read the full abstract
Computer Vision
PAWBench: How Far Are We from Probabilistically Aligned World Modeling?
Recent video generation models are increasingly framed as world models. Many physical processes can unfold in more than one valid way. Therefore, a world model should reproduce not only a plausible trajectory, but also the distribution of possible behaviors under the same initial observation and action. We call this distribution-level requirement probabilistic alignment. However, existing evaluations largely assess individual-video plausibility and do not test whether repeated generations recover the correct distribution. This raises a central question: how far are current video generators from probabilistically aligned world modeling? To answer it, we formalize probabilistic alignment as a distributional criterion for world models and introduce PAWBench, a benchmark for evaluating video generators as stochastic samplers of world dynamics. We further introduce PAWEval, an outcome-level protocol that converts repeated video rollouts into empirical distributions over possible physical behaviors. Across 50 scenarios and eleven current systems, no model consistently matches the reference probabilities while recovering the range of valid behaviors. Having established this gap, we test whether language prompts, initial noise sampling, or model training can reshape the model's predictive distribution. We believe our work can serve as a foundation for future efforts to move towards probabilistically aligned world modeling.
Read the full abstract
Solar and Stellar Astrophysics
Panchromatic Spectra of Nearby Low-mass and Sun-like Stars with Directly Imageable Habitable Zones
Characterizing the high-energy radiation environments of stars plays a critical role in determining which systems' planets are capable of retaining atmospheres and sustaining habitable conditions. X-ray through ultraviolet (UV) radiation drives atmospheric photochemistry, heating, and escape, making accurate characterization of stellar high-energy emission essential for both interpreting future exoplanet observations and identifying the most promising targets for life detection. We construct panchromatic spectral energy distributions (SEDs) spanning the X-ray through radio for 12 nearby low-mass and Sun-like stars with directly imageable habitable zones that are prioritized targets for the Habitable Worlds Observatory (HWO) and Extremely Large Telescopes (ELTs). These SEDs are generated using forward stellar atmosphere models guided and constrained by available archival X-ray and UV observations. We find that many stars in this sample exhibit elevated high-energy radiation environments relative to the modern Sun, with habitable zone X-ray and extreme UV (XUV) fluxes frequently exceeding solar values by 1-2 orders of magnitude. The elevated emission likely reflects a combination of sample selection effects, differences in stellar age and rotation, and intrinsic magnetic variability, with multi-epoch observations demonstrating that variability alone can significantly alter inferred radiation environments. These results highlight high-energy radiation as an important discriminator in identifying the most promising habitable planet hosts and demonstrate the need for expanded X-ray and UV observations to complete the stellar characterization necessary for HWO target prioritization.
Read the full abstract
Computation and Language
Pair-Level Essay-Scale Republication and Reuse from Fragmented Historical Text Reuse: A Workflow Study on Eighteenth-Century Books and Newspapers
This paper addresses the recovery of essay-scale republication and reuse from fragmented text-reuse evidence, a setting whose central challenge is pair-level evidence consolidation and not fragment retrieval alone. The study focuses on a candidate set centered on essays by eighteenth-century Scottish philosopher David Hume, spanning books from ECCO (Eighteenth Century Collections Online) and historical newspapers. Because the input consists of fragmented reuse hits instead of clean document pairs, and positive coverage is inherently incomplete, we formulate the task as pair-level evidence consolidation into plausible transmission relations and compare three methodological families: a staged rule-based workflow, baselines (a decision tree and two direct LLM settings), and automated rule adaptation. On labeled ECCO–ECCO slices, pair-level feature aggregation alone already reaches 0.948 F1 on the main labeled slice, while the final workflow gives the strongest overall precision-recall trade-off among the tested rule stages. On the full ECCO–ECCO candidate universe, direct LLM baselines flag up to 14,886 pairs as reprints compared to 771 for the final workflow, behaving in this direct-prompt setup as high-recall candidate expanders rather than precision-controlled deployment classifiers. On ECCO–Newspaper, manual audit confirms all 176 predicted positives as genuine cases of republication or reuse, while issue duplication and source-side multiplicity reveal additional provenance structure. Under incomplete ground truth, auditable pair-level evidence consolidation provides a practical way to produce compact candidate spaces for historical inspection.
Read the full abstract
Analysis of PDEs
Sign-preserving solutions to the Tzitzéica equation on lattice graphs
On the lattice graph $\mathbb{Z}^n$, we establish the existence of sign-preserving solutions to the Tzitzéica equation. We prove the existence of positive solutions and two classes of negative solutions under different assumptions, and derive their decay estimates. The proof is based on a suitable approximation scheme, the monotone convergence theorem, and an exhaustion argument. These results extend those of Hua, Huang, and Wang (Anal. PDE, 2026) by establishing the existence of both positive and negative sign-preserving solutions together with their decay estimates.
Read the full abstract
Algebraic Geometry
Divisors in projective bundles over the projective line whose complement is affine space
Given a smooth projective variety $X$ of dimension $n$ and a closed subscheme $Z \subseteq X$, it is in general a difficult problem to determine whether $X \setminus Z$ is isomorphic to $\mathbf A^n$. In the case where $X$ is a projective bundle over $\mathbf P^1$ and the restriction of every irreducible component of $Z$ to every fibre is a hyperplane, we give a complete geometric characterisation in terms of the irreducible components of $Z$ and their intersections. In the appendix, we use this to obtain a coordinate-free explanation for the recent first counterexample to the Jacobian conjecture.
Read the full abstract
Artificial Intelligence
Not All Eval-Awareness Is Equal: Capabilities Framing Predicts Compliance
Steering interventions targeting eval-awareness, a model's recognition that it is being tested, are increasingly used in safety evaluation pipelines, where evaluation-awareness is treated as a single quantity to be suppressed. We show that verbalized eval-awareness in chain-of-thought can be identified as capabilities-flavored ("the user is testing my ability to follow instructions"), safety-flavored ("the user is testing my boundaries"), both, or neither: framings that predict compliance very differently. On Qwen3-32B over the FORTRESS dataset, capabilities-framing predicts compliance with a +24 to +46 percentage-point gap over safety-framing across all tested steering conditions. A CoT-prefill intervention on eval-awareness-negative rollouts suggests the link is causal, with 10 of 11 prefills shifting compliance in the predicted direction. Then, eval-awareness is not behaviorally uniform: aggregate suppression rates can move while the safety-relevant component does not, and the same "X% suppression of eval-awareness" can correspond to qualitatively different behavioral outcomes.
Read the full abstract
Machine Learning
Beyond Parallel Blindness: Information Floors and Model Gaps in Block Drafting
Block drafters propose several tokens in one forward pass, before earlier target tokens are realised. Their rejection mixes two losses: missing within-block path information and imperfect modelling of observable information. Accepted length cannot distinguish them. We separate the two with an information floor, the minimum expected rejection at a specified conditioning order; rejection above this floor is the model gap. Measurements across four domains and four open-weight targets, plus floor estimates on a frontier API target, yield three findings. First, the all-parallel floor reaches $0.286$ at the final slot on Qwen3-4B, limiting even the best proposal to $71\%$ per-slot acceptance. Second, one realised token removes $86$–$100\%$ of this floor, a locality also recovered by an independent mutual-information analysis. Third, current drafters remain far above their floors: the final-slot model gap accounts for $43$–$64\%$ of DFlash rejection and $85$–$92\%$ of DSpark's oracle-conditioned rejection. Guided by this separation of short-range conditioning from proposal quality, we replace a context-independent predecessor correction with a prefix-attention head that reads committed context conditional on the predecessor. With supporting backbone components, the resulting Qwen3-4B drafter improves mean serving accepted length by $3.93\%$ over the released DSpark checkpoint across nine tasks, without increasing the conditioning order. Code and data: https://github.com/tie-pilot-qxw/specfloor; drafter checkpoints: https://huggingface.co/TIE-Pilot/dspark-attnconv-block7-qwen3-4b.
Read the full abstract
Multiagent Systems
One Model, Many Minds: Unlocking Multi-Agent Synergy in a Single Agent via Mixture of Roles
Specializing Large Language Models (LLMs) toward distinct abilities underpins successes ranging from personalized assistants to multi-agent systems (MAS). Single-agent paradigms rely on pre-defined personas or steering vectors to induce specialization, yet they impose a single fixed specialization that fails to adapt to diverse queries. Conversely, MAS achieves dynamic multi-perspective problem solving by orchestrating agents with distinct text-based roles, but fusing these specializations requires multi-turn interactions that inflate context length and inference cost. To address these limitations, we propose Mixture of Roles (MoRe), which adaptively composes multiple specializations into a single steering vector for single-turn inference. Specifically, MoRe learns a diversified codeboox of steering vectors, each of which encodes a latent role. A query-aware router dynamically fuses the codebook into a steering vector that encompasses multiple roles. By steering the backbone LLM with the composed vector, MoRe enables multi-perspective specialization in a single-agent, single-turn inference process. The proposed MoRe can be efficiently trained via a three-stage SFT curriculum and GRPO post-training, while the backbone LLM remains frozen. Experiments across reasoning and personality benchmarks show that MoRe outperforms single-agent baselines by 2.2% on average, and achieves performance on par with MAS while reducing token cost by 20x.
Read the full abstract
Quantum Physics
Tsirelson's nonclassicality witness under dissipative dynamics
A dynamics-based test, originally proposed by Tsirelson for the harmonic oscillator, provides a method for certifying quantumness under the assumption of a known Hamiltonian. These tests, however, are typically proposed for isolated systems, an assumption that breaks down in experimental implementation. In this paper, we extend the protocol to the harmonic oscillator coupled to standard models of dissipation: thermal relaxation, pure dephasing, and the Caldeira–Leggett model. Using the Moyal-Wigner formalism of quantum mechanics in phase space, we show that the introduction of dissipation requires a dissipation-dependent shift of the classical bound, and provide the threshold under which the nonclassicality witness retains its validity.
Read the full abstract
Distributed Computing
Consensus with Stochastic Broadcast
We study binary consensus in the stochastic broadcast model, which assumes $n\geq 2$ processes communicating synchronously by message broadcasts. At each round, every process broadcasts a message to all the other processes. Each broadcast succeeds independently with some probability $p\in[0,1]$. If a broadcast succeeds, all processes receive the message, and if it fails, no process receives the message. The sender does not know whether its broadcast was successful or not. In this model, consensus is not solvable; the objective is to design, for a given number of rounds $r$, consensus algorithms that terminate in $r$ rounds, minimizing the probability of error disagreement. This problem has been studied in depth for 2 processes [DISC 2025]. We extend the study to $n> 2$.
Read the full abstract
Optics
Ultra-Low-Loss Silicon Nitride on Sapphire for Broad-Transparency Nonlinear and Quantum Photonics
The field of photonic integrated circuits (PIC) has flourished in the past two decades, fueling numerous cutting-edge applications across sensing, networking, data interconnect, and quantum information processing. As a guiding material for PIC, Si$_3$N$_4$ has seen extensive use for its ultra-low loss, broad transparency, and diversity in implementation across both thin and thick films. Although the standard, traditional silicon dioxide (SiO$_2$) on silicon (Si) substrates that underpin the majority of Si$_3$N$_4$ photonics face drawbacks in the form of long-wavelength transparency limited by SiO$_2$, high-stress deposition for anomalous dispersion thick-film Si$_3$N$_4$, and leakage loss to the Si layer for low-confinement thin-film Si$_3$N$_4$. Featuring increased long-wavelength transparency into the mid-infrared, low-stress deposition of Si$_3$N$_4$, and a low index, this work investigates sapphire substrates as alternate hosts for Si$_3$N$_4$ photonics with greater spectral coverage and reduced fabrication complexity. This work presents a robust method of fabricating ultra-low loss photonic integrated circuits on a 500-nm-thick Si$_3$N$_4$-on-sapphire platform, exhibiting record-low losses below $0.1 \rm \;dB/cm$. Implemented using this process are high-Q microrings with intrinsic quality factors in excess of $4.5\times10^6$ and coupled-ring photonic molecules to support nonlinear gain. Leveraging the achievable low loss and high-Q, this work further reports the first demonstration of Kerr-comb and soliton generation on the Si$_3$N$_4$-on-sapphire platform. These advances in loss, quality factor, and soliton generation on this versatile, broad-transparency platform pave the way for future work in spectroscopy and quantum-enhanced sensing across previously prohibited spectral regions for Si$_3$N$_4$ photonics with reduced fabrication complexity.
Read the full abstract
Computation and Language
BTS-AgentBench: A Deterministic, Replayable Pipeline from Read-Only Telemetry Logs to Agent Benchmarks
Operational facilities accumulate extensive local telemetry, but agent-ready interactive evaluations with source-verifiable answers are costly to construct from such archives. Site-specific measurement histories also motivate a local conversion workflow that can operate where raw operational data must remain under organizational control. We introduce BTS-AgentBench, a deterministic compiler that transforms read-only telemetry and equipment metadata into tool-backed, multi-turn agent tasks, phase-level targets, evidence and executable evaluation contracts. The BTS release includes 532 episodes across nine families; a second-corpus port produces 204 XAI4HEAT episodes. Frozen-input replay reproduces released artifacts byte-for-byte, and independent raw-source checks cover all 89 BTS and 41 XAI4HEAT test episodes. Replayable provenance links 1,170 trial identities to recorded execution and scorer conditions, while 1,125 completed traces retain model responses and tool results. An obligation-level comparison of 216 scored failures found that linked records exposed additional recorded failed obligations in 202 cases (93.5%), including tool arguments, stream identity, state carryover and missing interaction steps. The pipeline thereby supports source-grounded task generation, exact reconstruction and auditable diagnosis of agent executions. Code, released benchmarks, and reproduction instructions are available at https://anonymous.4open.science/r/telemetry-benchmark-reproduction-3D68
Read the full abstract
Quantum Physics
Evaluating Quantum Kernel Methods for Track-Based Classification in High-Energy Physics
We present a systematic design for large-scale quantum kernel classification, demonstrated through a quantum support vector classifier (QSVC) for particle-track classification using centroid-based CLAS12 drift-chamber features. Each event is encoded into a six-qubit state via a fully entangled ZZFeatureMap, whose fidelities define a quantum kernel within a standard SVM framework. By decoupling state preparation from kernel construction and distributing evaluation across a multi-node MPI-based HPC allocation, the approach scales to 1.0x10^5 training and 4.0x10^5 test events with an exactly constructed kernel matrix, to our knowledge more than an order of magnitude larger than prior high-energy-physics quantum-kernel studies. Benchmarked against linear, polynomial, RBF, and sigmoid SVM kernels and extremely randomized trees (ERT), the ideal QSVC achieves the highest recall (99.99%) among all models. Under a calibrated hardware noise model (FakeMumbaiV2, 500 training / 2,000 test events), AUC falls from 0.9985 to 0.9671 and peak significance improvement falls from 17.5 to ~3.5, yet recall remains at 99.51% – indicating this signal-retention advantage is attenuated but not eliminated by circuit-level decoherence. Geometric analysis of the quantum embedding shows near-orthogonal inter-class states with coherent intra-class neighborhoods under ideal simulation; under noise this structure compresses toward the maximally mixed state while preserving its relative ordering. These results demonstrate a scalable, reproducible workflow for quantum kernel experimentation at HEP-relevant scale, quantifying the practical cost of realistic hardware noise on quantum-enhanced classification.
Read the full abstract
Signal Processing
IDSD: Iterative Deep-Learning-Based Signal Decomposition
Data-driven signal decomposition methods decompose a signal into its underlying components in a flexible and adaptive way, taking into account the signal characteristics. Here we focus on univariate signals, whose decomposition is ill-posed. Classical univariate approaches – like variational mode decomposition – constrain the solution space (e.g. through narrowband priors), and often require the number of components to be known in advance. These assumption, however, limit the algorithm's usage in certain real-life applications. Instead, we exploit the flexibility of neural networks to replace fixed (narrowband) priors with data-driven priors. Our model, called Iterative Deep-Learning-Based Signal Decomposition (IDSD), iteratively extracts an adaptive number of various types of components from a signal, with no restrictions on the bandwidth of a component. We show superior performance of IDSD both in a controlled setup with synthetic data, and on two real datasets concerning tidal waves and physiological measurements.
Read the full abstract
Combinatorics
Sharp Same-Color Cycle Covers in Two-Colored Complete Graphs
We extend the conjecture of Erdős and Gyárfás on monochromatic path covers to the setting of monochromatic cycle covers. We prove that, for all $n$, every 2-edge-coloring of the complete graph on $n$ vertices contains a collection of at most $\lceil\sqrt{n}\rceil$ monochromatic cycles, all of the same color, that together cover all vertices. The order of the bound is best possible, and the ceiling is necessary for infinitely many $n$.
Read the full abstract
Quantum Physics
The Geometry of Dissipative Complexity: A Levi-Type Decomposition Theorem for Markovian Quantum Dynamics via Lie Wedges and Invariant Cones
Lie algebras describe how control Hamiltonians combine in closed quantum systems. In open Markovian systems, however, dissipation introduces irreversible directions that the Lie algebra alone does not retain. A dynamical Lie wedge preserves this information as a convex cone of locally admissible generators. The classical Levi decomposition separates a finite-dimensional Lie algebra into semisimple and solvable parts. In this work, we prove a corresponding decomposition and reconstruction theorem for dynamical Lie wedges. The theorem decomposes the wedge into semisimple and solvable data, records how these components are coupled, and provides a converse reconstruction of the wedge. The framework yields four structural types of the generated algebra. We further prove that the total dissipation strength of every admissible generator depends only on its coordinate in the solvable radical. In particular, if the generated Lie algebra is semisimple, every admissible generator is Hamiltonian. Together, these results extend Lie-algebraic structural methods to irreversible Markovian control and clarify how dissipation is encoded in the generator geometry.
Read the full abstract
Materials Science
Coupled anisotropic weak topological states and Floquet mixed-parity altermagnetism in two-dimensional Su-Schrieffer-Heeger models
Su-Schrieffer-Heeger (SSH) topological systems and altermagnetic (AM) states are two important research areas in condensed matter physics. Realizing the coupled states between the SSH lattices and AM phanse in a single syetem remains challenging. However, the Floquet engineering change it. Our work constructs five two-dimensional-(2D-) SSH models to describe the coupled phases of SSH weak topological state and AM order by tight-binding (TB) method. The evolution of band structures, spin-splitting, and topological phase transitions under the circularly polarized light (CPL) and relative atomic displacement (RAD) in 2D SSH lattices were systematically investigated. The results reveal that the inequality of hopping parameters (t1 and t2) serves as the fundamental origin of SSH topological states and AM order. For the 2D nonmagnetic state, anisotropic weak topological states with Zak phase governed edge states are realized by unit cell selection, similar to the conventional 1D SSH model. The collinear antiferromagnetic state preserves the spin-degenerate band structure and intrinsic weak topological properties. Furthermore, the Floquet engineering introduces the AM phase of odd-parity p-wave while the RAD introduces the AM phase of even-parity d-wave. By combining the two effects, the mixed-parity (non-odd/non-even parity) AM phase could be realized, achieving the simultaneous control of the light field of spin-splitting and topological edge states. The physical mechanisms of Floquet engineering and RAD for the 2D rectangular SSH lattice are also from the inequality of t1 and t2, which can be not only fully understand by the TB methods, but also in good agreement with the first-principle calculations of 2D carbon-based materials. This work establishes an effective theoretical platform for coupling anisotropic SSH weak topological states and AM orders with multi-parities in 2D systems.