Peer Revenue Publish or profit

Papers

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

All of arXiv

Thursday 3 September

Numerical Analysis

Conditioning of solutions to the Sylvester equation

We partially answer an open problem, posed by Nick Higham, concerning the conditioning of solutions to Sylvester and Lyapunov equations. The question arises in the backward stability analysis of numerical algorithms for these equations. We first show that the solution to the Sylvester equation $AX-XB = C$ can be arbitrarily ill-conditioned even if $A, B, C$ and the Kronecker sum $I \otimes A - B^T \otimes I$ are all perfectly conditioned. We then derive general a priori bounds on the condition number of the solution, as well as bounds for the Sylvester equation when $A$ and $B$ are diagonalizable. We also provide lower bounds involving matrix exponentials and Zolotarev numbers. For the Lyapunov equation $AX+XA^T = -C$, we obtain upper bounds in two settings: (i) when $A$ is symmetric positive definite while $C$ is symmetric negative definite, and (ii) when $A$ is strictly dissipative and $C$ is symmetric positive definite.
Read the full abstract

High Energy Physics (Phenomenology)

TQ4Q2.0 Fragmentation Functions for Fully Heavy Tetraquark Production

We investigate the fragmentation dynamics underlying the production of fully heavy tetraquarks by means of the TQ4Q2.0 collinear FF set, covering scalar ($0^{++}$), axial-vector ($1^{+-}$), and tensor ($2^{++}$) configurations. The fragmentation inputs are determined within NRQCD factorization for the complete set of relevant partonic channels and are subsequently evolved across heavy-flavor thresholds through the HF-NRevo scheme. Perturbative uncertainties associated with fragmentation-scale variations are consistently propagated together with nonperturbative effects encoded in color-composite long-distance matrix elements. Attention is devoted to the axial-vector sector, whose fragmentation pattern makes it especially sensitive to intrinsic-charm contributions at LHC and FCC energies. TQ4Q2.0 therefore provides an uncertainty-aware framework for exploring fully heavy tetraquark production over a broad kinematic range and for connecting exotic-hadron spectroscopy with the partonic structure of the proton.
Read the full abstract

Computation and Language

Translation as a Decision Space: A Multi-Agent Perspective on Low-Resource Dialect Generation

Neural machine translation (NMT) systems typically produce a single output per input, obscuring the alternative decision trajectories implicitly available within multilingual decoding. This opacity becomes particularly problematic in low-resource dialect settings, where multiple linguistically valid realizations may differ in lexical authenticity, register, and structural stability. We propose reframing translation as a structured decision space explored by autonomous translation agents. Instead of analyzing a single output, we model distinct translation pathways as agents operating over a shared multilingual backbone. Inter-agent divergence is treated not as error but as an interpretable behavioral signal. We conduct an empirical study on Turkish–Syrian Arabic translation using three agents: (1) zero-shot direct translation, (2) dialect-stabilized translation via lightweight fine-tuning, and (3) pivot translation through English. Evaluation is performed on 5,000 dialogue sentences, while stabilization is trained on 5,000 additional Turkish–Syrian sentence pairs drawn from television dialogue and MADAR-Turk resources. Rather than optimizing for conventional performance metrics, we quantify structured behavioral displacement using dialect marker frequency, lexical proximity to standardized Arabic, and structural variance. Lightweight stabilization nearly doubles dialect marker usage, increasing it from 0.2266 to 0.4988, while significantly reducing structural instability. Pivot mediation introduces normalization pressure and measurable compression effects, whereas zero-shot translation exhibits the highest decision variance. We argue that translation divergence across agents reveals latent decision flexibility within multilingual models and we provide a principled interpretability framework for low-resource dialect generation.
Read the full abstract

All authors Hasan Alkhder, Mohammad Abboush, Igor Tchappi, Ahmet Zengin, Amro Najjar

Information Retrieval

The Dice Roll Method: A Standardized Protocol for Repeated-Query Auditing of Large Language Model Brand Recommendations

Background: Researchers increasingly use repeated identical prompts to audit stochastic variation in large language model (LLM) brand recommendations, yet no standardized protocol exists for setting iteration counts, selecting stability metrics, or establishing reliability thresholds. Objective: We formalize the Dice Roll Method as a reusable protocol for repeated-query auditing of LLM brand recommendations, grounded in a generative model of temperature-scaled nucleus sampling. Methods: Total response variance is decomposed into sampling, prompt-phrasing, run-to-run, and model-version components. The stack: a negative-binomial mixed model with iterations as repeated measures; Cliff's delta as the distribution-free effect size; dependence-preserving bootstrap; simulation-based power; a generalizability-theory decomposition; drift diagnostics on pinned snapshots. We reanalyse five brand-recommendation auditing studies: approximately 190,000 observations, 270+ brands, 6 languages, iteration counts 5 to 40. Results: The recomputed D-study supports no fixed tiers. Across 250 distinct questions (S5), G is 0.96 at five runs and 1 to 2 runs reach 0.80, also within each model. For five versions of one question (S1 Valentine's subset, Gemini) it is 0.27 (95% CI 0.00 to 0.52), which fixes no run count. Runs follow from a pilot: n = 4 x residual / cell variance. Simulated single-cell power for a large Cliff's delta is 0.15 to 0.19 at five runs and 0.8 at 15 to 25. The four metric families (count, set, embedding, PASOR) are complementary. A pre-registered external validation on three independent corpora reproduces the D-study prediction in 37 of 39 cells with no failures; fixed tiers do not transfer. Conclusion: The protocol gives repeated-query auditing of LLM brand recommendations a statistically principled footing under the conditional, non-Gaussian structure of real autoregressive generation.
Read the full abstract

Computational Complexity

The Head Complexity of Boolean Functions in Single-Layer Attention

What can a single layer of self-attention compute? We study head complexity: the minimum number of attention heads required to compute a function in a one-layer attention-only model. We establish an exact hierarchy under this measure: $k$ heads compute $k$-bit parity but cannot compute $(k+1)$-bit parity. The lower bound is unconditional in the two resources a transformer might otherwise exploit; it holds at unbounded embedding dimension and unbounded numerical precision. The proof rests on an alternating-sum obstruction: after clearing the softmax denominators, every monomial in the resulting decision polynomial omits at least one of the $k+1$ input bits, forcing its correlation with parity to vanish. The same obstruction yields lower bounds for related tasks, including the well-studied multi-hop induction-head task. We also establish compactness bounds for embedding dimension and numerical precision. Specifically, a compactness theorem shows that any function computable at all can be computed with embedding dimension and precision bounded by the discrete data of the task, namely, head count, alphabet size, and length. Thus, potentially unbounded dimension or precision provably cannot substitute for heads. Finally, we derive nearly matching universal bounds for general binary functions: $2^n$ heads suffice to compute every $n$-bit binary function, with one head per monomial in its multilinear expansion, while a counting argument shows almost all such functions require $\Omega(2^n/n^2)$ heads. This lower bound matches the upper bound to within a $\operatorname{poly}(n)$ factor, even when dimension and precision are unbounded. Together, these results characterize head requirements for Boolean computation in this model.
Read the full abstract

Probability

Heat content and spectrum for subordinated sub-Laplacians

We study heat content and spectral properties of subordinated sub-Laplacians on arbitrary Carnot groups. We consider restrictions of such operators to bounded open sets with zero Dirichlet boundary condition and study their spectral properties. In particular, for a large class of subordinators we give explicit eigenvalue estimates in terms of the subordinator and the eigenvalues of the sub-Laplacian. We also provide large-time asymptotics of the heat content for the subordinated sub-Laplacian in terms of its spectral gap. For fractional sub-Laplacians we prove short-time asymptotics for the corresponding heat content and relative heat content. Our approach combines semigroup methods, probabilistic techniques, geometric measure theory, and heat kernel estimates.
Read the full abstract

All authors Maria Gordina, Liangbing Luo, Andrea Pinamonti, Rohan Sarkar

Nuclear Theory

Microscopic Calculation of Electric Quadrupole Effective Charges in Exotic Nuclei

Electric quadrupole ($E2$) effective charges are evaluated based on the self-consistent relativistic Hartree-Fock single-particle states, with core-polarization corrections resummed to all orders using the Tamm-Dancoff approximation (TDA). Configuration-interaction relativistic Hartree-Fock (CI-RHF) calculations employing the TDA effective charges well reproduce the $B(E2)$ strength for neon isotopes from stability to the neutron drip line. We find that polarization charges associated with continuum states are significantly quenched due to their extended density distributions and weak coupling to the core, underscoring the critical role of continuum effects in $E2$ transition evaluations for exotic nuclei. Moreover, the CI-RHF model predicts a suppressed $B(E2; 2^+_2 \to 0^+_2)$ in $^{30}$Ne, together with strong in-band $B(E2)$ strengths of the yrast band, suggesting the coexistence of a nearly spherical excited $0^+_2$ state and a deformed ground state within the $N=20$ "island of inversion".
Read the full abstract

All authors Jia Liu, Yong Peng, Xiao-Yan Zhu, Xiao-Hua Li, Wen Luo, Yi-Fei Niu, Wen-Hui Long

Logic in Computer Science

Extending concurrent separation logic to the hardware level to verify the xv6 OS kernel on RISC-V with AI agents

MachCSL is a framework for verifying system software, such as an OS kernel, on top of low-level semantics of a RISC-V computer, based on the Sail RISC-V semantics. The key idea behind MachCSL is to adapt concurrent separation logic, based on Iris, to reasoning about low-level hardware execution at the sub-instruction level: page-table translation, TLB, privilege levels, configuration registers, instruction fetch/decode/execute, traps and interrupts, DMA, shared memory, power failures, etc. Reasoning at this level of detail ensures that the system software correctly manages all of the hardware details. Verifying software at this low level of abstraction is tedious, but LLM-based agents are capable of reasoning about such low-level details. As a case study, we verify the xv6 OS kernel (6,657 lines of C and assembly code), which provides a traditional Unix system call interface (processes, file system, file descriptors, and preemptive scheduling) and has substantial internal concurrency (multi-core support with fine-grained locking, shared memory, interrupts, DMA, etc.). In the verification process, we uncovered 11 bugs in the xv6 implementation, as well as one bug in the Sail RISC-V semantics, and one bug in Sail's Lean extraction. The verification effort took us 102 days, including the time to develop the MachCSL framework. On top of the verified xv6 kernel, we prove a theorem about console-level behavior: e.g., if the user types echo hello world as input on the UART console, the only output the system can produce is hello world (if there are no crashes or other errors). This theorem covers both the kernel and the init, sh, echo, cat, grep, sync, and seccomp binaries in the initial file system image.
Read the full abstract

Instrumentation and Detectors

Testbeam characterization of a 3D silicon sensor read out by Timepix4

Testbeam results from a $300\,\mu\mathrm{m}$-thick 3D silicon sensor bump-bonded to a Timepix4 ASIC, are presented. The hit detection efficiency, spatial resolution, and timing performance of the 3D sensor are studied for several track angles, bias voltages and charge thresholds. The time measurements are corrected for Timepix4 clock-frequency variations and timewalk, while for the spatial studies, nonlinear charge-sharing corrections are determined. At perpendicular incidence, the time resolution of the 3D detector is equal to $245\,\mathrm{ps}$ with a $97\%$ hit detection efficiency. An optimal angle of $8^\circ$ with respect to the beam direction of the 3D detector was found, in which the time resolution improves by $6\%$ compared to normal incidence, while the hit detection efficiency reaches above $99\%$ and the spatial resolution is approximately $7\,\mu\mathrm{m}$. Intrapixel studies show that a time resolution of $153\,\mathrm{ps}$ at the most probable value of the signal charge can be achieved for hits between the electrodes at normal incidence, while the timing performance of these best-performing regions deteriorate upon sensor rotation. The timing properties at different depths of the 3D sensor have been investigated with tracks at grazing-angle incidence, revealing a dependence of the time resolution along the sensor depth.
Read the full abstract

All authors E. Chatzianagnostou, M. J. Madurai, K. Akiba, D. Bacher, R. Bates, M. van Beuzekom, T. Bischoff, V. Coco, R. Dumps, T. Evans, K. Heijhoff, D. Johnson, U. Krämer, E. Lemos Cid, D. Oppenhuis, T. Pajero, E. Rodríguez Rodríguez, D. Rolf

High Energy Physics (Theory)

Cutting corners: exciting and magical bounds from the cusp bootstrap

An illuminating probe of the dynamics of a line defect is the global geometry of its worldline. For a conformal line defect in a conformal field theory, sharp corners in the worldline, i.e. cusps, host dynamical degrees of freedom characterized in part by a spectrum of scaling dimensions, called cusp anomalous dimensions. We present various general bounds on cusp anomalous dimensions following from unitarity and cutting-and-gluing consistency of different defect geometries. We first establish, for cusps involving conjugate defects, that level crossings upon varying the cusp angle are forbidden between the lightest singlet cusp and any non-singlet cusp, proving that singlet cusps are the lightest. Then, we study line defects arranged in a rectangular geometry, which are subject to bootstrap constraints reminiscent of the spinless modular bootstrap. We find an analytic “magic" functional that produces an optimal and universal lower bound on the dimension of a right angle bare cusp in terms of the universal defect Casimir energy between the corresponding defect and its conjugate in flat space.
Read the full abstract

Hardware Architecture

Confidence-Gated Admission for Hardware Prefetching: When the Gate Matters More Than the Predictor

Learned cache prefetchers are typically evaluated against classical predictors that always issue requests, confounding the prediction model with the admission policy. We disentangle these variables with matched controls: the same admission gate is applied to both a 257-parameter online MLP and a classical stride predictor. The neural advantage vanishes; the MLP is indistinguishable from gated stride on random traffic and slower on most regular streams. The gate itself is architecturally useful independent of the predictor: on twenty SPEC CPU2017 programs in native ChampSim, it removes 35% of prefetches and improves accuracy from 11% to 15%, but DRAM reads change by only 0.07% demonstrating that proxy metrics do not predict endpoint behavior. We prove gate-closed execution reproduces the no-prefetch baseline exactly. The gate matters more than the predictor, and better proxies do not imply better endpoints.
Read the full abstract

High Energy Physics (Phenomenology)

Exploring Extended Higgs Dynamics via Higgsstrahlung at FCC-ee

The Future Circular Electron-Positron Collider (FCC-ee) will probe aspects of the Higgs boson and the electroweak scale with unprecedented precision via associated Higgs production with a $Z$ boson. We focus on the Two-Higgs-Doublet Model (2HDM) to frame the FCC-ee's precision constraints within a small, concrete parameter space at next-to-leading order. We demonstrate that the projected precision of the FCC-ee's 240 GeV run will enable a precise analysis of Beyond-the-Standard-Model (BSM)-relevant Higgs-sector interactions near the alignment limit. As the key aspects of the 2HDM that drive deviations of the cross section from its Standard Model expectation (presence of new scalar states, Higgs mixing, and non-trivial inter-Higgs couplings) are also typically present in extensions more complex than the 2HDM, this demonstrates the FCC-ee's indirect potential for unveiling BSM physics around the electroweak scale.
Read the full abstract

All authors Anisha, Francisco Arco, Stefano Di Noi, Christoph Englert, Margarete Mühlleitner

Operator Algebras

Minimality for noncommutative dynamical systems

We consider an alternative notion of minimality for C*-dynamical systems, which we refer to as strong minimality. This notion coincides with the usual definition of minimality in the commutative setting, but diverges sharply from it in the noncommutative setting in a way which we argue addresses several fundamental defects in the usual definition. We demonstrate that strong minimality is deeply connected with Rørdam's notion of a C*-irreducible inclusion, giving a new perspective on the study of such inclusions. We provide various characterizations of this property, including for reduced crossed products, tensor products, and subhomogeneous C*-algebras.
Read the full abstract

Quantum Physics

Discrete time crystals in disordered anisotropic Heisenberg chains

A discrete time crystal is an out-of-equilibrium phase of matter characterized by the spontaneous breaking of discrete time-translation symmetry. Using extensive numerical simulations based on matrix-product-state methods, we provide evidence for discrete time-crystalline behavior in strongly disordered spin chains with Heisenberg interactions, including the isotropic point, subject to periodic driving. Starting from a many-body localized regime, we observe that rotations induced by delta kicks produce a pronounced subharmonic response at half the drive frequency in spin observables. We investigate the stability of this response against rotation-angle errors through entanglement entropy, quantum Fisher information, short-range spin correlations, and restricted-control ergotropy. Increasing the rotation error reveals an intermediate dynamical regime separating the time-crystalline and Floquet-localized responses. In this regime, most observables exhibit signatures of weakly correlated dynamics reminiscent of Anderson localization.
Read the full abstract

All authors Francesco Formicola, Grazia Di Bello, Antonio De Candia, Giulio De Filippis, Carmine Antonio Perroni

Solar and Stellar Astrophysics

Ionized Nebulae Around Two New Symbiotic Stars: GR Cygni and [D75] 141

In the course of selecting targets for a spectroscopic survey of faint planetary-nebula nuclei, we encountered two anomalous cases of late-type variable stars surrounded by nebulosities discovered by amateur astronomers. We obtained follow-up deep narrow-band images of the two nebulae: StDr Objet 14 (diameter 1.5 arcmin) and StDr 4 (diameter 2.5 arcmin). StDr Objet 14 is found to be a low-excitation nebula, bright only in Ha+[N II], and showing a unique double-ring "bull's-eye" morphology. StDr 4 exhibits a bow-shock structure, bright in Halpha and [S II], embedded in an extended emission nebula. Both central stars, respectively GR Cygni and [D75] 141, are found to be pulsating semiregular variable stars. Our spectroscopic observations show GR Cyg to be a cool carbon star of type C9,2, with emission lines of the Balmer series, [O II] and [O III], [Ne III], [S II], and Fe II. A synthetic narrow-band image of GR Cyg shows that the source of its strong [O II] 3727 A emission line is a knot displaced from the star by about 1.6 arcsec, indicative of a recent collimated ejection event. [D75] 141 is a M6 III red giant, with weak Balmer-series emission. Both stars show a blue excess, and GR Cyg was detected in the near-UV by the GALEX spacecraft. These data establish both stars as new symbiotic binaries, containing a late-type red giant and a hot companion accreting from its stellar wind. We speculate that the double rings surrounding GR Cyg were ejected during helium-shell thermal pulses (or conceivably from recurring nova outbursts), while the nebula around [D75] 141 may be the result of a collision of the symbiotic star's ejecta with an interstellar cloud. Our accidental discoveries of these two binaries because they are surrounded by faint nebulae supports the view that there is a significant population of "missing" symbiotic stars yet to be discovered.
Read the full abstract

All authors Howard E. Bond, Calvin Carter, Sven E. Eklund, Peter Goodhew, Ulisse Munari, Jonathan Talbot, Gregory R. Zeimann

High Energy Physics (Theory)

Cusped Defects: Cusp Operator Expansion, Conformal Properties and Bootstrap Applications

We analyze general properties of cusped defect lines embedded in generic conformal field theories (CFTs). We prove that suitably defined cusp scaling operators transform like primary operators under general conformal transformations. We show that, via the cusp operator expansion (COE), defects of general shape can be expanded in a basis of cusped defects. These findings are checked and exemplified in the case of the localized magnetic field defect. Finally, we derive analytic constraints on dynamical cusp data by making use of a crossing equation, and discuss possible numerical bootstrap applications of our results.
Read the full abstract

All authors Lorenzo Bianchi, Andrea Cavaglià, A. David Gutiérrez, Stefanos R. Kousvos, Marco Meineri

Computer Vision

Editable Visual Design

While diffusion base models such as GPT-Image-2 and Nano-Banana exhibit remarkable visual expressiveness, their end-to-end generation inherently yields flattened bitmaps with error-prone text, precluding layer-wise post-editing. Conversely, code-based visual generation via Coding Agents provides precise layout control and decoupled layers, yet remains constrained by a lack of global aesthetic intuition and the difficulty of coding complex visual assets. To address this, we propose Editable Visual Design, a new paradigm driven by a Coding Agent. We designate the VLM as the “creative brain” for requirement comprehension, task planning, and aesthetic judgment, while utilizing the image generation model as an on-demand “visual world simulator” to synthesize standalone visual assets. Operating under an “imagine first, then act” closed-loop workflow, the agent generates isolated assets, writes native HTML/CSS, and iteratively refines the design against visual rendering feedback. Furthermore, Agent Design Replay faithfully reproduces the creative and reasoning trajectory akin to that of professional human designers. Ultimately, the system delivers editable artifacts with decoupled layers and real text, enabling users to perform intuitive mouse dragging and layout adjustments on a graphical user interface. Validations on posters, infographics, and other scenarios show that this paradigm successfully achieves both refined aesthetics and production-grade editability.
Read the full abstract

All authors Junyan Ye, Wei Liu, Dongzhi Jiang, Zichen Wen, HaoDong Li, Zhutao Lv, Jiaxin Lin, Jinhua Yu, Jun He, Zilong Huang, Rui Chen, Weijia Li

Algebraic Topology

From configuration spaces to graph complexes via FA-modules

Work of Gadish and Hainaut (after Petersen) models the compactly supported cohomology of a wedge of circles as a polynomial functor. We identify the coefficients of this functor, $\Phi[n,m]$, via a cobar construction of $\mathbf{FA}$-modules. This identification formally implies that these coefficients will arise in computations of graph homology, and we use this result to give examples of graph complexes whose homology may be embedded in $H_c^\ast(F(S^1\vee S^1,n))$. This includes the Payne-Willwacher marked graph complex in genus 2, for which we give a new, explicit decomposition in terms of $\mathbf{FA}$-modules. This allows us to describe $\mathsf{gr}_{11}H_c^{\ast}(\mathcal{M}_{2,n})$ as the cohomology of a complex of decorated trees and to show, for example, $\mathsf{gr}_{11}H_c^{n+1}(\mathcal{M}_{2,n})=0$.
Read the full abstract

Optimization and Control

Stronger Lower Bounds for (Non-)Anytime Acceleration of Gradient Descent

The rate-optimal convergence rate of gradient descent (GD) with a fixed step-size is well known to be $\Theta(N^{-1})$ for $L$-Lipschitz smooth convex objectives in the prior art in convex optimization. Surprisingly, several recent works show that we can accelerate vanilla GD by applying a nonconstant, nonadaptive, deterministic step-size schedule. The best-known upper bounds so far in the non-anytime & anytime setups are $O(N^{-1.271})$ [Altschuler and Parrilo, 2025, Grimmer et al., 2023] and $O(N^{-1.119})$ [Zhang et al., 2025], respectively. On the other hand, the best reported lower bounds (or barriers) up to date in the non-anytime & anytime setups are $\Omega(N^{-1.635})$ and $\Omega(N^{-1.241})$ [Ye and Liu, 2026], respectively. We narrow these gaps by establishing stronger lower bounds for GD's convergence rate in both settings: $\Omega(N^{-1.450})$ for the non-anytime rate bound and $\Omega(N^{-1.184})$ for the anytime rate barrier.
Read the full abstract

Computer Vision

DSAQuant: Denoising-Stage-Aligned Quantization-Aware Training for Video Generation

Video diffusion models (VDMs) have achieved impressive progress in text-to-video generation, but their high memory and computational costs hinder practical deployment. Quantization-aware training (QAT) is an effective solution for compressing and accelerating advanced generative models without runtime overhead at inference. However, existing QAT methods suffer from a distinctive challenge in VDMs: while they often preserve prompt semantics, global layout, and coarse motion, the quantized model severely degrades visual details, texture fidelity, and sharpness. In this paper, we trace this degradation to the timestep-agnostic design of conventional quantization pipelines, which overlooks the stage-wise functionality of video denoising. In VDMs, early denoising steps mainly establish global structure and motion, whereas middle and late steps refine local appearance and high-frequency details. Based on this insight, we propose DSAQuant, a Denoising-Stage-Aligned Quantization-aware training framework for VDMs. During training, Denoising-Stage Oriented Supervision preserves teacher distillation in early steps for stable structure planning, while shifting later steps toward target-driven optimization to enhance detail reconstruction. During inference, Denoising-Stage Gated Guidance disables CFG in the final denoising steps to prevent it from amplifying quantization-induced errors into high-frequency artifacts. Extensive experiments on the Wan and CogVideoX families under W4A4 and W3A3 settings show that DSAQuant consistently outperforms the SOTA QAT baseline, improving the VBench average score by up to 6.60 under aggressive W3A3 quantization while preserving strong text-video alignment. These results demonstrate that effective VDM quantization requires not only reducing quantization error, but also aligning quantization training and inference with the stage-wise nature of video diffusion.
Read the full abstract

All authors Shuaiting Li, Zelin Gao, Haibin Shen, Yujun Shen, Haotong Qin, Yinghao Xu

Artificial Intelligence

IRWOZ 2.0: A Large Language Model-driven Dialogue Dataset for Industrial Robot Conversations

IRWOZ has improved industrial human-robot interaction (HRI) dialogue systems through domain-specific annotations. However, its initial version contains substantial noise in dialogue states and utterances, limiting state-tracking accuracy. We introduce IRWOZ 2.0, which addresses these limitations through large language model (LLM) enhanced generation (Mistral/Claude-3.5) and quality refinements. Our improved dataset expands to 390 dialogues across 4 industrial domains (Assembly, Delivery, Position, Relocation), featuring manual corrections and automated typo removal. Benchmark experiments on dialogue state tracking demonstrate significant improvements, with GPT-2's BLEU-4 score increasing from 0.1651 to 0.5604 compared to original IRWOZ. To support industrial HRI research, we publicly released IRWOZ 2.0 dataset at https://ieee-dataport.org/documents/irwoz-20-large-language-model-driven-dialogue-dataset-industrial-robot-conversations
Read the full abstract

Soft Condensed Matter

Mechanistic Framework for Multicomponent Nanoparticle Assembly: Predicting RNA-lipid and PEI-DNA nanoparticle assembly

The assembly of multicomponent nanoparticles is often kinetically controlled and exhibits strong pathway dependence. Transport, solvent exchange, nucleation/growth, and collision-driven coalescence together determine not only ensemble-averaged properties but also particle-to-particle compositional heterogeneity. Here, we present a computational modeling framework for predicting nanoparticle property distributions by coupling processing conditions, early-stage self-assembly physics, and molecular chemical details with kinetic Monte Carlo (kMC) simulations. The framework combines (i) mixing conditions with solvent-exchange-mediated particle initialization and growth, and (ii) kMC simulations that resolve stochastic collision histories, electrostatics-controlled coalescence, and composition at the level of individual particles. Applied to mRNA lipid nanoparticles, the model predicts size-loading correlations and provides insight into how processing-dependent assembly pathways lead to heterogeneous payload distributions. The kMC simulations further provide merging lineage histories, which explain the emergence of log-normal volume and payload distributions through multiplicative particle-growth pathways. The same framework is also applied to PEI-DNA polyelectrolytic complexation, yielding single-particle-resolved DNA-PEI stoichiometry distributions. The framework and its open-source implementation, FormLNP, provide a process-aware route to predicting and controlling single-particle property distributions across a broad range of multicomponent nanoparticle systems.
Read the full abstract

Computational Engineering

Influence of Extruded Filament Shape on Buildability in 3D Concrete Printing: A Geometry-Informed Deep Learning-FEM Approach

The geometric morphology of deposited filaments can significantly influence the structural performance and stability of 3D concrete-printed (3DCP) structures. However, most finite element (FEM)-based approaches for buildability assessment represent printed layers as simplified rectangles, potentially limiting predictive accuracy. This study proposes a geometry-informed modelling framework that integrates the deep-learning-based filament shape prediction tool ShapeGen3DCP with a layer-activation FEM approach to investigate the effect of realistic filament geometries on buildability. The framework generates geometry-aware numerical models directly from material and process parameters, eliminating the need for experimental filament characterization or computationally intensive fluid-flow simulations. Validation against experimental data and a parametric study of rectilinear walls demonstrate that extrusion parameters and the resulting filament geometry can significantly influence buildability predictions. Realistic filament representations are particularly important for free-flow deposition, whereas layer-pressing strategies are less sensitive to geometric simplifications. Among the investigated representations, an elliptical approximation provides an effective balance between geometric fidelity and modelling simplicity. When rectangular representations are preferred to enable regular computational meshes for faster simulations, defining their dimensions based on volume conservation improves prediction reliability compared with calibrating them using either the maximum filament width or the interlayer contact width. Overall, the proposed methodology demonstrates the importance of incorporating filament geometry into 3DCP simulations and provides practical guidance for selecting efficient and accurate geometric representations for buildability assessment.
Read the full abstract

All authors Giacomo Rizzieri, Saif-Ur-Rehman, Jörg F. Unger, Annika Robens-Radermacher

Optics

Accounting for the detection response brings cavity ring-down spectroscopy to sub-permille accuracy

For nearly four decades, cavity ring-down spectroscopy (CRDS) has been among the simplest, most widely used absorption techniques, requiring no calibration because it measures decay times, not intensities. Yet as accuracy requirements have tightened, CRDS has proven strikingly inconsistent: reported errors range from several percent to the permille level - the signature of an uncontrolled systematic effect so far worked around rather than resolved. This has confined applications demanding the highest accuracy - from testing ab initio theory to atmospheric sensing and quantum-based metrology - to a handful of laboratories relying on advanced calibration or architectures, at the cost of simplicity. Here we show the main source was hiding in plain sight: the detection chain's transient response. It distorts every ring-down, biasing the retrieved decay times differently from instrument to instrument - a bias that routine truncation of the early decay masks rather than removes. We measure this response with a calibration-free beat-note method and build it into the ring-down model. Validation uses a well-characterized carbon monoxide transition and an independent frequency-based reference. Across four detection configurations, line-intensity biases of up to 14 % shrink 41- to 87-fold, the results converge, reaching up to sub-permille agreement with the reference. This holds down to 4 us ring-down times, extending accurate CRDS to stronger absorption. Independent of the absorbing species and requiring no change to the CRDS setup, the approach turns a technique valued for its simplicity into one equally valued for its accuracy. Benchmark-quality measurement thus comes within reach of any CRDS laboratory.
Read the full abstract

All authors Rajesh Chell, Marcin Gibas, Szymon Wójtewicz, Jakub Łasocha, Daniel Lisak, Agata Cygan

Computer Vision

Stable and Scalable Bundle Adjustment of Holistic 3D Structures

Bundle Adjustment (BA) is a cornerstone of 3D computer vision and has benefited from decades of advances in sparse optimization and numerical methods. It was originally developed for jointly optimizing camera intrinsics, poses and sparse 3D points. While extensions incorporate lines and other primitives, integrating richer geometric structures such as parallelism, coplanarity, or wireframes often introduces significantly increased computational cost and reduced numerical stability. In this paper, we propose a unified framework that extends bundle adjustment to jointly optimize geometric features and higher-order relations. We first introduce a taxonomy that distinguishes scalable geometric features with direct 2D measurements (e.g., points and lines), from groups encoding higher-order relations (e.g., coplanarity, parallelism, etc.), where we show that groups can be modeled as camera-like entities within the bundle adjustment framework. Building on this formulation, we propose that both group constraints and cross-feature relations (i.e., point-line associations) can be expressed through 2D reprojection measurements. By formulating group-induced and cross-feature reprojection errors, we preserve the sparsity structure of classical point-based BA under Schur elimination, while avoiding direct 3D regularization that degrades the conditioning and stability. Experiments on both real-world and synthetic datasets demonstrate runtime performance comparable to classical point-only bundle adjustment, while producing significantly richer 3D structures and improved geometric accuracy.
Read the full abstract

All authors Shaohui Liu, Rémi Pautrat, Daniel Barath, Richard Hartley, Viktor Larsson, Marc Pollefeys

Signal Processing

THz-SynC: Collective Synthesis with Contextual-Bandit-Assisted Coordination for Reconfigurable Hybrid Optical-THz AI Datacenters

Terahertz (THz) wireless interconnects offer high-capacity, low-latency, and energy-efficient rack-to-rack links capable of on-demand connectivity reconfiguration, serving as a promising complement to optical fabrics for communication-intensive distributed AI training datacenters. However, co-optimizing optical and THz resources to minimize collective completion time and transmission energy remains challenging due to dynamic optical congestion, THz channel fluctuations, and heterogeneous compute stragglers. Existing reconfigurable data-center designs predominantly optimize network topology and traffic routing, with limited consideration of collective communication semantics in distributed AI workloads over hybrid fabrics. To address these challenges, we propose THz-SynC, a novel framework that integrates collective synthesis with contextual-bandit-assisted hybrid-fabric coordination to optimize the tradeoff between collective completion time and transmission energy. By exploiting collective-specific semantics, THz-SynC synthesizes tailored communication topologies for All-to-All and AllReduce patterns while dynamically allocating THz resources. Furthermore, a contextual-bandit coordinator adaptively routes communication chunks across optical and THz links and selects rack power budgets leveraging real-time observations of network states and collective semantics. Trace-driven evaluations show that THz-SynC outperforms wired-only, wireless-only, and hybrid baselines, achieving a superior delay-energy Pareto frontier under dynamic network conditions.
Read the full abstract

Artificial Intelligence

Instruction Duplication as an Inference-Time Control Primitive

Procedural instruction following is a basic requirement for controllable language-model systems, especially when generated trajectories are inspected or repaired downstream. We introduce instruction duplication, a minimal black-box inference-time control that repeats only the procedural instruction, without retraining or decoding changes. Across seven instruction-tuned models, 300 medical multiple-choice questions, eight placement conditions, and 16,800 scheduled generations, moving from one to two copies raises the deterministic All-8 diagnostic–responses passing all eight observable tests–from 90.22% to 93.17% (+2.95 percentage points), eliminating 30.2% of the failures remaining after one copy. Pre-provisional TF-IDF recall rises from 73.44% to 74.81% (+1.38 points; Holm-adjusted p < .001), while final-answer accuracy remains exactly 60.21%. Premature commitment increases from 1.52% to 2.30% (p_Holm = .00536). A blinded challenge audit yields 10/30 directional confirmations, 20/30 perceptual ties, and no reversals; its prespecified 28/30 confirmation criterion is not met. Yet this distinction can matter operationally when a downstream system acts on the generated trajectory. In Answer Engineering (AE), where explicit trajectory state determines local repair, the published reason-first no-editing SSNHL endpoint was 25.1%; system-only AE was later reproduced at 84.2%, and the same trailing duplicate raised it to 97.1%. For conductive diagnostic branch preservation, the corresponding values are 58.9% published without editing, 78.6% with reproduced AE, and 73.8% with AE plus duplication–a within-AE decrease, but still 14.9 points above the no-editing baseline. Instruction duplication is therefore a low-complexity, placement-sensitive control whose practical value can emerge through the downstream system that consumes the exposed trajectory.
Read the full abstract

Algebraic Geometry

Characterizing Contractions and Weighted Blowdowns

This paper gives a partial answer to a question of Dan Abramovich: consider a proper morphism $f : \mathcal{X} \to \mathcal{Z}$ with connected fibers, between smooth separated Deligne–Mumford stacks, which defines an isomorphism away from a smooth effective Cartier divisor $\mathcal{E} \subseteq \mathcal{X}$. Then, is $f$ a weighted blowup? We confirm that $f$ is an ordinary smooth blowup when $\mathcal{X}$ and $\mathcal{Z}$ are smooth separated schemes of finite type over $\mathbb{C}$, and when $f :\mathcal{X} \to \mathcal{Z}$ is a representable morphism of smooth separated Deligne–Mumford stacks. Further, we show that $f$ is a weighted blowup when $\mathcal{X}$ and $\mathcal{Z}$ are smooth separated Deligne–Mumford surfaces, i.e., $\dim \mathcal{X} = \dim \mathcal{Z} = 2$. As an application we determine when a reduction morphism between Hassett moduli stacks of weighted stable curves is given by a blowup along a smooth center.
Read the full abstract

Computation and Language

Representational alignment yields generalizable safety in language models

Aligning large language models (LLMs) is essential for their safe deployment. Current alignment methods mainly optimize observable responses, yet models remain vulnerable when the same harmful intent is recast in unfamiliar or adversarial forms that humans can easily recognize. Prototype theory offers an account of this adaptability. Human concepts are represented around central cases, and new instances are categorized according to their graded typicality relative to these prototypes. Here we show that such categorization of moral concepts is weakly preserved in current LLMs. Across 23 LLMs, models often failed to distinguish opposed moral categories or preserve fine-grained typicality within each category. These deficits persist across parameter sizes and alignment stages. We developed representational similarity optimization, which directly aligns the latent representations in LLMs with the categorization expressed in human moral judgements, without supervising generated responses. In matched experiments using the same 251,334 moral annotations, standard behavioral alignment learned the intended moral judgements at the response level while leaving the categorization structure largely unchanged and increasing vulnerability across adversarial evaluations. Reorganizing moral categorization produced more modest gains in explicit judgements but consistently improved adversarial robustness across model scales on diverse benchmarks and attack strategies. Our findings provide functional support for the view that prototype-based categorization contributes to behavioral adaptability. They also show that transferring this representational principle to LLMs yields generalizable safety under adversarial conditions.
Read the full abstract

All authors Lingyu Li, Yan Teng, Yingchun Wang, Xia Hu

Artificial Intelligence

FLY-EVAL++: An Evidence-Driven Evaluation Protocol for Safety-Constrained Flight Prediction with Large Language Models

Evaluating large language models (LLMs) in safety-critical, physics-governed environments requires more than accuracy-based metrics, because predictions that are numerically close to the ground truth can still violate operational constraints, combine fields in physically inconsistent ways, or fail to produce usable structured outputs. Existing evaluation protocols do not measure these failure modes reliably. We propose FLY-EVAL++, an evidence-driven evaluation protocol that combines deterministic verification of protocol compliance, physical feasibility, and safety constraints with fixed rubric-guided aggregation into interpretable multi-dimensional scores. We instantiate FLY-EVAL++ for Flight Trajectory and Attitude Prediction (FTAP) by extending the PilotBench setting with history-conditioned and multi-step prediction tasks. Across 66 LLMs, safety compliance is the most discriminative dimension of model behavior: models with comparable predictive performance differ by more than 28 points in safety score, and we observe recurrent failures including safety violations under physically plausible predictions and instability in multi-step rollouts. These results show that evaluation in safety-critical domains should measure constraint satisfaction and structured validity explicitly rather than rely on accuracy-centric reporting alone.
Read the full abstract

All authors Yalun Wu, Junfeng Fang, Jiawei Wang, Haotian Liu, Qijun Yang, Minghan Yang, Hongcheng Guo, Zhoujun Li, Boyang Wang