Peer Revenue Equity in science

Papers

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

All of arXiv

Saturday 29 August

Optimization and Control

Calculus of the Facial Distance

We develop a few calculus rules to compute or lower bound the facial distance of a polytope. We illustrate our calculus rules on various popular polytopes. In particular, we provide a provide a lower bound on the facial distance of the Birkhoff polytope.

Sound

Diagnose, Then Refine: A Closed-Loop TTS System with AudioLLM-Guided Correction

Current TTS systems typically rely on open-loop, single-pass generation and can produce sporadic local prosodic defects, such as misplaced stress, unnatural pauses, or flattened intonation, that utterance-level metrics often fail to expose. We present LoopTTS, a judge-guided Filter-Judge-Refiner framework for recovering low-quality TTS outputs diagnosed by an AudioLLM. Given an initial utterance from a base TTS model, an AudioLLM Judge identifies salient prosodic issues and generates structured refine instructions; a Refiner, our fine-grained instruction-following TTS model, then performs guided expressive re-synthesis conditioned on the initial utterance, target text, and instruction. To train the Refiner, we construct Refiner-DB, a 42K-example AudioLLM-annotated dataset with word-level prosodic weak supervision. Human evaluation on diagnosed low-quality utterances shows that LoopTTS can detect perceptually salient errors and correct them with the Refiner, outperforming raw generated audio and practical open-loop re-generation baselines in recovery quality. The Refiner also demonstrates stronger instruction-following ability for stress and pause control in targeted prosody modification.
Read the full abstract

All authors Zeyang Song, Tianchi Liu, Tianrui Wang, Chenglin Xu, Steven Y. Guo, Haizhou Li

Systems and Control

Performance Analysis of Time-Delay Systems under External Perturbations Using Output-to-Output Gain

Communication delays are inherent in networked control systems and may significantly affect closed-loop performance. This paper investigates the impact of external perturbations in observer-based linear systems with delayed measurements and control signals using the output-to-output gain (OOG) framework. By employing dissipativity theory and Lyapunov–Krasovskii functionals, delay-dependent linear matrix inequality conditions are derived that provide explicit upper bounds on the OOG for systems with independent delays in measurement and actuation channels. In addition, two special classes of constant-delay systems are considered: Padé-approximated systems and finite-dimension reducible systems. Numerical examples illustrate the applicability of the proposed approaches
Read the full abstract

Artificial Intelligence

Efficient GPU Retrieval for Semantic Search

Semantic Search on LinkedIn must retrieve relevant profiles from a corpus of hundreds of millions in response to natural-language queries such as "a fintech founder in Berlin who worked in payments." The deployed relevance policy is bottleneck-oriented: every active non-negotiable facet must be satisfied, and a pre-existing LLM Graded Relevance (GR) judge operationalizes this through a fixed min/median aggregation over facet grades. Cosine similarity instead averages evidence, letting a strong match on one facet mask failure on another, capping the recall of the first-stage (L0) retriever. We present a policy-aligned retrieval framework: embeddings are partitioned into eight category-supervised segments whose scores follow the same min/median rule at serving time; for multi-vector retrieval, this segment score is computed independently per tagged document slot and maximized across slots. A lightweight single-slot Stage-1 scorer generates high-recall candidates, while scale-invariant relative-norm gating keeps category activation consistent across training, evaluation, and serving. On 21K held-out queries, this representation improves offline relevance over a matched-capacity baseline, with gains broadly distributed across facet combinations. We serve this framework with a two-stage GPU architecture: an FP8 coarse ranker scores the full corpus, increasing per-shard capacity by 71% and Stage-1 matmul throughput by 36%, then an FP16 stage exactly re-ranks an oversampled candidate set, recovering 99.6-99.8% of full-FP16 recall at over 500 QPS per shard replica. In a member-randomized A/B test, exploratory-query Precision@10 under the unchanged GR judge rises from 63.7% to 79.0% and navigational Precision@1 from 65.5% to 74.7%, with a blinded human evaluation independently confirming the Precision@10 gain.
Read the full abstract

All authors Dhritiman Das, Chujie Zheng, Ronak Kaoshik, Pratik Dixit, Vishal Shah, Yanbo Li, Jiahao Xu, Manika Agarwal, Chinmay Naik, Lingyu Zhang, Chetan Bhole, Chirag Bhanuprasad Mehta, Meng Zheng, Puneet Singh Ahluwalia, Shirisha Singh, Ping Jin, Manas Apte, Gokulraj Mohanasundaram, Tugrul Bingol, Raghavan Muthuregunathan, Fedor Borisyuk

Robotics

Brain-Language-Action (BLA) Models: Language-Conditioned EEG for Robotics Control

Electroencephalography (EEG)-based robotic control is commonly formulated as a direct classification problem, in which electrical neural signals are mapped to a fixed set of discrete actions. However, the limited separability and high noise of EEG signals make it difficult to scale this approach to fine-grained robotic control spaces. We introduce Brain-Language-Action (BLA) models, a framework in which language conditions the interpretation of neural representations for robotic action generation. In a BLA, a small set of reliably distinguishable brain states can be dynamically associated with different actions through a language-defined control mapping, allowing a small number of neural classes to apply to a larger global action space. We develop a proof-of-concept BLA for drone control using motor-imagery EEG from the BCI Competition IV 2a dataset. The system is trained in two stages. First, we evaluate multiple candidate EEG encoder architectures using subject-specific four-class motor-imagery classification, converting 250Hz, 3.5-second, 22-channel EEG samples into five 128-dimensional brain-token embeddings. Second, these embeddings are projected into the embedding space of a pretrained large language model (LLM) and jointly fine-tuned with language instructions to autoregressively generate structured three-token drone actions. Across 840 possible language-defined mappings between four neural states and seven flight action combinations, the resulting BLA achieves 90% per-token accuracy during evaluation. These results provide an initial demonstration that language conditioning can expand the effective control range of EEG-based robotic interfaces without requiring a corresponding increase in the number of directly distinguishable neural states.
Read the full abstract

Audio and Speech Processing

When Vocal Tone and Literal Meaning Diverge: An Acoustic-Semantic Incongruity Study for Large Audio-Language Models

Affective cues across modalities may be incongruous (e.g., sarcasm or mocking praise), potentially leading to misinterpretation when relying on a single modality. Large Audio-Language Models (LALMs) have recently gained popularity and been applied to multimodal emotion recognition, but their ability to disentangle acoustic and semantic cues, especially in incongruent cases, remains underexplored. To address this gap, we introduce CREMA-ASIS, a dataset specifically created to investigate incongruence between acoustic emotion and semantic sentiment cues. It pairs acoustic emotion labels with semantic sentiment polarities. Using this dataset, we evaluate LALM biases within a multitask framework and conduct a layer-wise analysis to identify modality dominance across layers. Our findings reveal that LALMs struggle with semantic-acoustic incongruent cases, rarely predicting incongruity, and that LALMs are predominantly influenced by semantic information. However, supervised fine-tuning significantly improves LALM performance on our CREMA-ASIS test set while preserving transcription accuracy and joint emotion recognition. Results demonstrate potential for enhancing both acoustic and semantic understanding on out-of-domain data.
Read the full abstract

All authors Yu-Wen Chen, William Ho, Maxim Topaz, Zoran Kostic, Julia Hirschberg

Artificial Intelligence

From Location Phrases to Geographic Entities: Task-Adapted Retrieval for People Search

People search must map free-form location phrases to geographic entities used as structured retrieval filters. Lexical standardizers handle canonical names well but are brittle to aliases, misspellings, metropolitan expressions, and same-name ambiguity. We formulate this task as graded, set-valued entity retrieval over a fixed ontology. We identify three coupled design requirements: distinguishing identity-preserving variation from knowledge-dependent aliases, controlling false negatives among valid same-name entities, and separating stable transformations from mutable entity knowledge. We realize them in a prompt-asymmetric bi-encoder with calibrated alias support, bounded ambiguity-aware negatives, and editable entity documents that support localized updates without retraining. Across a fixed production-derived development benchmark and a public GeoNames transfer task, task adaptation improves substantially over frozen encoders and standard token baselines. Controlled development ablations show that specialized supervision contributes beyond standard task fine-tuning and encoder scaling. On GeoNames, the adapted model improves known-target Recall@1 throughout zero-to-moderate character overlap, while character n-grams retain a small aggregate Target Recall@5 advantage. In a blinded human comparison on a stratified production challenge set, our model raises relevant P@1 from 28.0% to 46.0% (p=0.012). Fixed-query endpoint estimates improve on non-canonical queries and remain close to control on frequent queries; a randomized live experiment detects no engagement regression. These results support task-adapted geographic entity retrieval as a practical replacement for the incumbent taxonomy-based standardizer, with the largest relevance gains on non-canonical queries.
Read the full abstract

All authors Yanbo Li, Chujie Zheng, Jiahao Xu, Chetan Bhole, Lingyu Zhang, Puneet Singh Ahluwalia, Kevin Nguyen, Raghavan Muthuregunathan, Santhosh Sachindran, Sachin Ahuja, Fedor Borisyuk

Probability

Exponential mixing for the stochastic Navier–Stokes equation with localized noise

This paper studies the 2D Navier–Stokes equation on a bounded domain with Navier-slip boundary conditions, driven by spatially localized stationary forcing generated by a stochastic heat equation. We prove exponential mixing for the associated Navier–Stokes–heat system, and consequently exponential convergence of the velocity law under stationary forcing. The main difficulty is that the white noise is confined to a subdomain and reaches the velocity indirectly through the heat component. To address the degeneracy, the proof combines Malliavin calculus with PDE control theory. The key ingredient is a stabilization scheme that converts localized Navier–Stokes controls into time-regular controls compatible with the heat dynamics.
Read the full abstract

Databases

RENSA: Rich Environment Metadata to Navigate Shared and Distributed Endpoints for Automated Federated SPARQL Query Generation

The number of knowledge graph databases has increased significantly with the proliferation of knowledge graph technologies. Knowledge graphs enable the dynamic integration of distributed data through federated SPARQL queries. However, constructing efficient queries in a federated environment is challenging due to the lack of detailed structural knowledge across decentralized datasets. While standards like VoID provide basic metadata, they often fail to capture the complex interlinks and authority distributions necessary for optimization. Consequently, current engines frequently rely on runtime ASK queries for source selection, increasing communication overhead. We propose RENSA, a federated SPARQL query generation framework that leverages an extension of SPARQL Builder Metadata (SBM). By integrating class and authority information, mapping subject and object usage to specific predicates, RENSA enables precise source selection and semantic constraint inference for query variables without runtime communication. The generated profiles represent less than 1% of the original dataset triples in most cases, ensuring storage efficiency. Evaluation on the LargeRDFBench benchmark (13 datasets with >1B triples, 32 queries) shows that RENSA achieves source selection results comparable to state-of-the-art methods while eliminating ASK query overhead. Furthermore, we demonstrate that RENSA infers class and authority constraints for query variables, enabling the identification of data sources even across heterogeneous endpoints. These profiles additionally offer human-readable structural insights for semi-automated query generation.
Read the full abstract

Quantum Physics

Universal recovery in approximate quantum error correction

Universal recovery – the existence of a single recovery map that corrects an entire family of error channels – is a central feature of quantum error correction (QEC). In exact QEC, linearity guarantees that a code correcting a given error set also corrects every channel whose Kraus operators lie in its linear span, and that a single recovery map suffices for all such channels. Approximate quantum error correction (AQEC), which relaxes perfect recovery to recovery with controlled error, has traditionally lacked this structure. In a recent paper (arXiv:2607.22995), we developed a theory of approximate quantum error correction showing that a restricted form of linearity persists in the approximate setting, yielding uniform AQEC guarantees for the family of channels controlled by a given error set. In this work, we complete the picture by establishing the second half of universal recovery in the approximate setting: a single recovery map can simultaneously correct every channel controlled by a given error set. The error-set theory we proposed quantifies approximate correctability through two parameters: the environment-leakage distance, governing worst-case performance, and the Knill–Laflamme Hellinger distance, governing average-case performance. We show here that both quantities also control universal decoding. We further study the Petz map naturally associated with an error set as an explicit universal recovery, and obtain uniform average- and worst-case guarantees across the entire family of channels.
Read the full abstract

Functional Analysis

Mordukhovich Derivatives and Covering Constant for Set-Valued Metric Projection in General Banach Spaces

In this paper, we find the explicit representation of the set-valued metric projection operator from l1 to the unit closed ball in l1. By using this representation, we investigate the properties of the Mordukhovich derivatives of the set-valued metric projection operator, which is applied to calculate its covering constant. As a special case, we consider the 2-d Banach space. We find the explicit solutions of the set-valued metric projection operator from the considered 2-d Banach space to its unit closed ball. By these solutions, we will calculate its Mordukhovich derivatives in details.
Read the full abstract

Machine Learning

Continuity-Free Near-Minimax Leading-Order Regret for CVaR-UCBVI

For finite-horizon tabular CVaR reinforcement learning, prior work proves a $\widetilde{O}(\tau^{-1}\sqrt{SAK})$ leading regret bound for arbitrary normalized return laws and the sharper $\widetilde{O}(\sqrt{SAK/\tau})$ rate under a density lower bound. We show that the same Bernstein CVaR-UCBVI algorithm attains the sharper rate without continuity assumptions. The key is a selected-budget self-bound: the conditional variance of the episode shortfall is at most $\tau$ plus the value-estimation width. Substitution into the original Bernstein decomposition yields, with high probability, $\widetilde{O}(\sqrt{SAK/\tau}+(SAHK^{1/4}+S^2AH)/\tau)$ regret for arbitrary normalized return laws, including atomic, mixed, and continuous laws. The $\tau^{-1/2}$ leading term matches the expected-regret minimax lower bound up to logarithmic factors. Thus Bernstein CVaR-UCBVI is minimax-optimal over the full return-law class in the leading-order regime; the lower-order terms retain their $\tau^{-1}$ dependence.
Read the full abstract

Mesoscale and Nanoscale Physics

Surface-mediated frequency aging beyond quality-factor saturation in an AlScN-on-silicon resonator

Vacuum package integrity in micro- and nanoelectromechanical resonators is commonly assessed through the quality factor Q, although Q probes residual-gas damping rather than the surface-state evolution that can govern frequency aging. Here, we disentangle the pressure responses of Q and the resonance frequency f0 in a 64.21 MHz Al0.7Sc0.3N-on-silicon cross-sectional Lamé-mode resonator between 0.01 to 760 Torr. Measurements at 25 {\deg}C and at the 68.8{\deg}C frequency turnover, where first-order thermal sensitivity is suppressed, reveal widely separated equilibration timescales. Following each pressure step, Q reaches a reversible, history-independent steady value on the pressure-control timescale and approaches a fitted pressure-independent ceiling of 8.5e4 below approximately 1 Torr. By contrast, f0 responds measurably down to 1e-5 Torr and remains history-dependent, relaxing for hours at fixed pressure. The transients follow stretched-exponential kinetics, consistent with a broad distribution of surface relaxation rates, and individual pressure steps produce fractional frequency shifts as large as 1.9 ppm. Ten-hour phase-locked measurements show a common short-term time-deviation floor near 1e-10 s from 0.01 to 100 Torr, whereas residual deterministic relaxation dominates at long averaging times; at 760 Torr, gas damping degrades short-term tracking through the reduced Q. These results establish gas-damping equilibrium and frequency equilibrium as distinct states. Quality-factor saturation alone is therefore insufficient to qualify vacuum packaging for precision mechanical frequency references; package specifications must also constrain surface-mediated frequency aging.
Read the full abstract

All authors S M Enamul Hoque Yousuf, Mahmudul Hasan, Shruti Mishra, Sourav Mukherjee, Jinghan Gao, Roozbeh Tabrizian

Computation and Language

CoVA-SFT: A Large-Scale Dataset for Chain of Visual Abstractions

Chain-of-thought (CoT) reasoning has dramatically improved large language models (LLMs) by allowing them to decompose problems into intermediate steps. While CoT is widely effective for linguistic tasks, text-only CoT forces models to serialize visual problems into awkward prose. Although architectural solutions exist to process visual inputs, the community lacks a massive, multi-step, self-corrected dataset to teach models how to build and maintain internal visual workspaces when solving purely textual reasoning problems. To address this limitation, we introduce CoVA-SFT, a highly structured corpus of 51.9K samples containing over 222K multimodal reasoning steps across 5 distinct layout families and 17 complex tasks, and CoVA-Bench, a companion benchmark of 1,700 held-out test samples spanning the same tasks for reproducible evaluation. By providing explicit rationale formulations, agentic renderings, and verification loops, CoVA-SFT teaches multimodal language models to interleave text and visual abstractions. We validate the dataset by demonstrating that models fine-tuned on CoVA-SFT outperform all interleaved CoT baselines by more than 2x on average on CoVA-Bench, though they still fall short of strong text-only CoT baselines, highlighting open challenges for future work.
Read the full abstract

All authors Tsung-Han Wu, Heekyung Lee, Anya Ji, Haoming Chen, Trevor Darrell, Joseph E. Gonzalez, David M. Chan

Materials Science

Symmetry-Preserving Phase Transitions in $AM_2$Al$_9$ Materials under Pressure

External parameters such as temperature, pressure, and chemical doping can induce structural phase transitions in materials. Although such transitions usually involve a change in symmetry, an uncommon exception is the isostructural phase transition, which is first order yet preserves the symmetry of the parent structure. Using first-principles calculations, we show that $AM_2$Al$_9$ compounds ($A$ = Ba, Ca, Sr, or Eu; $M$ = Fe, Co, or Ni) undergo pressure-induced isostructural phase transitions. At the transition pressure, these systems exhibit a pronounced volume collapse while retaining the same crystal symmetry and space group ($P6/mmm$). Bonding analysis based on the integrated crystal orbital Hamilton population (ICOHP) shows that the transition is driven by a redistribution of bonding character between intralayer and interlayer atomic bonds. Because isostructural transitions are rare in single crystals, $AM_2$Al$_9$ provides a promising platform for investigating critical phenomena under pressure and for deepening our understanding of symmetry-preserving structural transitions.
Read the full abstract

All authors Jian-Feng Zhang, Sheng Xu, Zhong-Yi Lu, Tao Xiang

Friday 28 August

Human-Computer Interaction

Benefits and Burdens of Technology-Supported Activity Pacing in ME/CFS: A Thematic Analysis of Reddit Discussions

Technology and self-tracking play an increasingly important role in the self-management of chronic conditions. Myalgic Encephalomyelitis/Chronic Fatigue Syndrome (ME/CFS) is a type of energy-limiting condition, with activity pacing as a key self-management strategy that helps individuals regulate their activity within their energy limits to prevent symptom worsening. However, people with ME/CFS frequently adopt technologies designed for healthy bodies, which they have to repurpose to suit their pacing needs. We report findings from a thematic analysis of Reddit data, using the Non-Adoption, Abandonment, Scale-Up, Spread and Sustainability (NASSS) framework as a sensitising concept. We identify three pacing strategies among people with ME/CFS: no-tech pacing, low-tech pacing (e.g., spreadsheets and diaries), and high-tech pacing (relying on continuous passive sensing from consumer wearables), and characterise the benefits and burdens of pacing technology use. Among these, affordability was a salient topic, highlighting the importance of making technology for pacing financially accessible to people with ME/CFS who follow the high-tech route.
Read the full abstract

Robotics

Learning Whole-Body Kinetic Coordination for Wheeled-Quadruped Long-Range Throwing

Long-range throwing on unstructured terrain is a key capability for mobile robots in delivery and retrieval tasks, but it requires high release velocity, coordinated whole-body motion, and robustness to terrain-induced disturbances. We present a whole-body kinetic-coordination framework for a wheeled-quadruped manipulator that combines kinetic-chain arm modeling with SQP-based trajectory optimization and a reference-guided reinforcement learning policy for coordinated base motion. The manipulator is first reduced to a kinetic-chain model and optimized under kinematic and dynamic constraints to produce a high-speed throwing reference. On a stationary base, the optimized arm trajectory reaches a release speed of 12.75 m/s and a throwing distance of 16.68 m. When whole-body coordination is enabled, the system further increases the release speed to 16.64 m/s and the throwing distance to 28.25 m. We then integrate the mobility of the wheeled-quadruped platform and validate the complete policy through hardware experiments on flat ground, grass, slopes, and rough roads. The results show that kinetic-chain optimization and whole-body coordination together enable robust long-range throwing across diverse unstructured terrains.
Read the full abstract

All authors Qinglian Wu, Yidian Hu, Weiqi Fan, Yutian Zhang, Siyuan Ma, Jiaqi Zhai, Wei Dong, Li Xu

Metric Geometry

Necessary and Sufficient Criteria for the Realizability of Kaleidocycles Composed of Six Congruent Isosceles Tetrahedra

A classical kaleidocycle is a closed cyclic chain of congruent, edge-hinged tetrahedra with successive hinge axes at right angles, capable of continuous inside-out motion. Kaleidocycles composed of six isosceles tetrahedra (disphenoids) form a natural generalization in which consecutive hinge axes need not be perpendicular. Their kinematics are governed by the closure equation for threefold-symmetric Bricard 6R linkages. We derive a new compact closure equation directly from threefold symmetry using the composition of rotations, and show its equivalence to the classical formulation. Furthermore, we establish two equivalent necessary and sufficient criteria for a kaleidocycle to admit continuous, unblocked motion in terms of the geometric parameters of the constituent disphenoid. These criteria yield sharp bounds on the admissible geometric parameters of realizable kaleidocycles. Finally, we study assemblies of eight such kaleidocycles joined face-to-face. We identify a configuration exhibiting full octahedral symmetry, which forms a polyhedral structure closely related to the disdyakis dodecahedron.
Read the full abstract

Statistical Methodology

Mean-Tilted Intervals: Regression and Dynamic Models

Mean-tilted intervals (MTIs) provide a fixed-content family of interval targets indexed by retained-mean balance. This paper develops generalized-Bayes computation for using those targets in regression and time-varying endpoint models after content and tilt have been specified. The update combines a prior with an exponentiated residual-product check loss, yielding uncertainty summaries for endpoint functions rather than a response-distribution model. A pseudo-asymmetric-Laplace normal-exponential representation gives generalized-inverse-Gaussian latent-scale updates and Gaussian conditional updates for one root when the other is fixed. The same representation gives deterministic ECM equations for generalized-posterior modes. We present ridge endpoint regression, a conditionally Gaussian shrinkage construction for the zero-tilt case, deterministic fixed-feature readouts, and dynamic linear endpoint states updated by alternating forward-filtering backward-sampling steps. These methods extend the MTI target from iid intervals to regression and dynamic settings; tolerance certification and response prediction require separate calibration or response models.
Read the full abstract

Rings and Algebras

A unified approach to the definition of anti-algebras

We introduce the $\mathfrak M$arseille anti-construction $\mathfrak{Ma}$ for varieties of algebras defined by multilinear identities of degree $3$, obtained by changing the sign of the right-nested part of each defining polynomial. This gives, for any variety $\Var$, a new variety $\mathfrak{Ma}$-$\Var$ that generalizes antiassociative algebras and the recently studied anti-Novikov and anti-right-symmetric $\big($pre-Jacobi–Jordan$\big)$ algebras. We describe free objects in several $\mathfrak{Ma}$-varieties. On the operadic level, over a field of characteristic $\mathrm{char}\,\Bbbk\neq 2$, we show $(\mathfrak{Ma}\text{-}\Var)^{(!)}=\mathfrak{Ma}\text{-}(\Var^{(!)})$ and that the Dong property is preserved by $\mathfrak{Ma}.$ Finally, we obtain the necessary and sufficient condition for $\mathfrak{Ma}\text{-}\Var=\Var$. The second part of the paper is dedicated to another type of anti-algebras, called $\mathcal{M}anin$ anti-algebras. We give the description of this type of algebras via calculation of the white Manin product of suitable operads and present various examples of known $\mathcal{M}anin$ anti-algebras. In the end, we proved that the symmetric affinization of an algebra gives a Jacobi-Jordan algebra if and only if the original algebra is a $\mathcal{M}a$-Novikov algebra, that is, an analog of a well-known result about affinization of Novikov algebras given by Balinskii and Novikov.
Read the full abstract

Rings and Algebras

Operator Algebras and Their Applications

We introduce a new class of commutative associative algebras whose structural constants are linear operators acting in a linear topological space. An analogue of the theory of monogenic functions is developed for such algebras. It is shown that the components of monogenic functions satisfy second-order operator-differential equations. This approach provides a constructive method for obtaining solutions of various partial differential and integro-differential equations. Several illustrative examples are presented.
Read the full abstract

Rings and Algebras

Algebras with Variable Operator-Valued Structural Constants and Their Applications

We introduce a new class of algebras with variable operator-valued structural constants and develop elements of the theory of monogenic functions in such algebras. Compatibility conditions for the structural operators are established. It is shown that the components of monogenic functions satisfy second-order operator-differential equations with variable coefficients, and converse results are proved. The proposed approach provides a constructive method for obtaining solutions of various differential, integro-differential, and functional-differential equations. Several illustrative examples are presented.
Read the full abstract

Rings and Algebras

Algebras with Variable Structural Constants and Their Applications

We introduce a new class of algebras with variable structural constants and develop elements of the theory of monogenic functions in such algebras. Compatibility conditions for the structural functions are established. It is shown that the components of monogenic functions satisfy certain second-order partial differential equations with variable coefficients, and converse results are proved. This approach provides a constructive method for obtaining explicit solutions of such equations. Several illustrative examples are presented.
Read the full abstract

Statistical Methodology

Design-Indexed Heterogeneity in Meta-Analysis: A Constrained Location-Scale Specification

An analyst should not assume that a design score improves a meta-analysis simply because it is labeled as robustness. This paper treats declining heterogeneity along a prespecified, outcome-separated design score as a falsifiable directional hypothesis. In an 18-study illustration, the constrained model lands at $\gamma = 0$ and becomes numerically identical to conventional random effects, while the unrestricted scale fit points in the opposite direction. Simulations that deliberately violate the restriction show the same graceful fallback under wrong-direction and U-shaped heterogeneity; a stepwise decreasing variance function retains an efficiency gain despite functional-form misspecification. DR-Meta formalizes the hypothesis as $\tau^2(\mathrm{DR}) = \tau_0^2 \exp(-\gamma \mathrm{DR})$, $\gamma \geq 0$, within an established location-scale framework. Exact nesting, conditional weight monotonicity, a fixed-effect upper bound, pseudo-true targets under mean misspecification, and score-rescaling behavior are derived with full proofs. Efficiency gains are negligible around an empirically anchored $\gamma$ near 1 and become material only under stronger gradients; the largest RMSE reduction, about 9.6 percent, occurs in a deliberately extreme condition. Plug-in intervals under-cover relative to random effects, and modified Knapp-Hartung adjustment improves coverage only modestly. Widening the $\gamma$ optimization bound changes $\gamma$ estimates much more than pooled-estimate RMSE. The practical contribution is therefore diagnostic rather than automatic efficiency: a nested directional restriction can be supported, contradicted, or collapse transparently to random effects, provided constrained, unrestricted, location, and sensitivity analyses are reported together.
Read the full abstract

Computation and Language

Operator Packages, Proposer Strength, and Construction-Family Plateaus in Office-Scale Verified Search

Verified search, in which a language model proposes programs, a hard evaluator scores them, and selection keeps the best, has recently moved mathematical records; controlled ablations of the proposer-side components remain rare. We instrument a minimal FunSearch-style loop at office scale (a 30B local model on a laptop, 120-600 verified samples per run) with three operator packages: a schematic notebook the model writes and carries instead of verbatim elites, a named obstacle, and behavioural repulsion from constructions already found. On nine construction problems from a public repository, the complete 2^3 factorial with two replicates favours the primary contrast in a nominal two-stage analysis: the composition closes more of the seed-to-record gap (+0.196; nominal pooled p=0.023, stage-combination p~0.08; median per-problem effect +0.045). Repulsion raises construction-hash diversity in eight of nine problems (one-sided p=0.0039; partly a manipulation check). The factorial finds no positive memory-by-repulsion interaction (bounded to about +/-0.04); the gain decomposes additively, and memory+repulsion is the only arm that never collapses (0 of 18 runs), within 0.025 of the full composition. A frontier proposer under the identical loop reaches in tens of samples what the local model does not in hundreds; in single scoping runs its gains arrive without the operators. The searches stall after closing 85-92% of the gap on the flagship problem, and a later analysis reads that plateau as a resolution limit: the reference value is a continuum limit and the unaided long-run finals already carry its family's structure. In the registered family-hint test the family named in words is adopted and loses; handed as code, it is optimized, but our best finite-grid encoding stays below the plateau reached unaided. We release the harness, every candidate, and the dated pre-registrations.
Read the full abstract

2609.29636 · 28 Aug · Version 4 of the paper (arXiv v2): adds the note on the wall (Zenodo v3) and corrections after an audit against the records (listed in the paper). 14 pages. Code: https://github.com/RobertoOno/interrupting-the-loop. Data: Zenodo 10.5281/zenodo.22714138, 10.5281/zenodo.22713807 and 10.5281/zenodo.23163299; this version also at 10.5281/zenodo.23163677

Materials Science

Symmetry-protected intraband exciton-phonon scattering and its breakdown by mass asymmetry

The coupling of excitons to lattice vibrations is typically treated via phenomenological models that artificially separate long-range Fröhlich and short-range Holstein interactions. Recent analytical work has established that, in the delocalized limit, Fröhlich scattering is suppressed by electron–hole interference. Here we present a model-space Bethe–Salpeter framework to evaluate exciton–phonon coupling across the extended-to-localized crossover. We establish a fundamental distinction between the inclusive exciton–phonon coupling weight, obtainable via an exact completeness sum rule without summation over excited states, and the exclusive intraband (internal-state-preserving) scattering amplitude that governs low-energy decoherence. We prove an exact symmetry theorem: for an inversion-symmetric relative-coordinate Hamiltonian with equal electron and hole masses, the intraband Fröhlich vertex vanishes identically, protecting the exciton from low-energy polar phonon scattering. When mass asymmetry is introduced, the finite-momentum relative wavefunction acquires a complex phase twist that breaks this protection. By analyzing the long-wavelength limit, we derive a controlled small-$q$ activation law showing that the intraband vertex scales as $F_{00}(q) \propto \Delta q^2 \langle r^2 \rangle$, where $\Delta$ parameterizes the mass asymmetry. Finally, we compute the second-order polaron self-energy shift and demonstrate that mass asymmetry dramatically enhances phonon dressing, confirming that the symmetry theorem directly governs the many-body energy renormalization of the exciton. These results provide a rigorous conceptual framework for understanding the competition between long-range and local exciton–phonon coupling in polar semiconductors.
Read the full abstract

Combinatorics

Resolutions of two conjectures on the spectral diameter

Let $\lambda_1(G) \geq \dots \geq \lambda_n(G)$ be the adjacency spectrum of a graph $G$ on $n$ vertices. The spectral distance $\sigma(G,H)$ between $n$-vertex graphs $G$ and $H$ is the Manhattan distance between their spectra, i.e. $\sigma(G,H) = \sum_{i=1}^n |\lambda_i(G) - \lambda_i(H)|$. Given a set $\mathcal{G}$ of pairwise non-isomorphic graphs of order $n$, the spectral diameter of $\mathcal{G}$ is defined as $\mathrm{sdiam}(\mathcal{G}) = \max\{\mathrm{secc}_{\mathcal{G}}(G) : G \in \mathcal{G}\}$, where $\mathrm{secc}_{\mathcal{G}}(G) = \max\{\sigma(G,H) : H \in \mathcal{G}\}$ is the spectral eccentricity of $G \in \mathcal{G}$. Among six conjectures on spectral distances posed by Z. Stanić in 2012, two conjectures related to the spectral diameter of certain graph classes remained open. One of them concerns the spectral diameter of the set $\mathcal{B}_n$ of all connected bipartite graphs of order $n$, while the other, of the set $\mathcal{T}_n$ of all trees of order $n$. More precisely, Stanić conjectured that $\mathrm{sdiam}(\mathcal{T}_n) = \sigma(P_n, K_{1,n-1})$, where $P_n$ is the path graph, while $K_{1,n-1}$ is the star, and that $\mathrm{sdiam}(\mathcal{B}_n) = \mathrm{secc}_{\mathcal{B}_n}(K_{\lceil n/2 \rceil, \lfloor n/2 \rfloor})$, where $K_{\lceil n/2 \rceil, \lfloor n/2 \rfloor}$ is the complete bipartite graph. In this paper, both of these conjectures are disproved.
Read the full abstract

Number Theory

On murmurations

In the recent paper “Murmurations", Zubrilina showed that the Fourier coefficients of modular forms follow a certain murmuration pattern. The proof given in “Murmurations" proceeded by estimating the terms of the Skoruppa-Zagier trace formula. However, a few technical issues arise in the proof, including an omission of certain Chebyshev factors that arise in summations from the Skoruppa-Zagier trace formula. In this work, we address these issues to solidify the proof.
Read the full abstract

All authors Timothy Nelson, Erick Ross, Maya Wassercug, Hui Xue

Hardware Architecture

PANEM: A Heuristic Latency Model

Accurate pre-silicon memory modeling is essential for achieving meaningful representation of workloads on cloud-class many-core processors. Existing options force a poor tradeoff between fidelity and speed: fixed-latency models are fast but misleading, while cycle-accurate DRAM models are costly and difficult to scale across large study spaces or onto single-core environments. This paper presents PANEM, a lightweight event-driven heuristic model that has guided four generations of commercial server-core development at Ampere Computing. PANEM converts bandwidth-latency characterization data into a dynamic request-bytes/latency response, allowing miss latency to adapt to transient demand, queuing pressure, and read/write mix during simulation. Integrated into a single-core flow with configurable system-loading assumptions, PANEM enables realistic bandwidth constraints and contention-aware latency behavior without sacrificing throughput. Across a broad cloud workload trace suite, PANEM avoids the optimistic and pessimistic biases of fixed-latency baselines, yields more reliable conclusions for prefetching and dynamic throttling studies, and materially improves core-resource sizing decisions. These results show that a calibrated, contention-aware abstraction can deliver practical predictive value for industrial design-space exploration at simulation costs similar to fixed-latency models.
Read the full abstract

Dynamical Systems

Mathematical modelling of a multicluster open system: transfer-operator recovery from aggregate data under a least-action prior

Many open systems are observed only through aggregate snapshots, while the rule that moves objects between states stays hidden. This paper studies the inverse problem of recovering the transfer operator of a multicluster open system from two adjacent snapshots. The consistent operators fill an affine manifold: the data fix the aggregate flows and leave the internal routing free, so every recovery method commits to a prior that selects one operator. Tikhonov regularisation with a zero reference gives the uniform outflow on each source simplex, which underestimates retention in an inertial system. We propose least action on the operator trajectory, under which the rule changes as little as the data permit. In discrete time this is exact as a probability statement: the action prices a trajectory by its likelihood under a Gaussian reference drawn toward full retention, so least action selects the most probable trajectory consistent with the balance. A causal construction keeps the balance exact by moving the operator only inside the null space of the constraints, and we relate it to optimal transport, to Perron-Frobenius coarse-graining, and to the Schrödinger bridge. Two instantiations carry it: the Russian labour market and a radiation-damped relativistic electron ensemble. The construction holds the balance to machine precision where temporal smoothing corrupts it by twelve percent on the labour series and sixty percent in the physical one. The spectral gap is non-identifiable from aggregate snapshots but available from micro-trajectories, where Ulam's method reproduces the Landau-Lifshitz rate to within six percent. On the short labour series no method beats the naive forecast in point accuracy at conventional significance levels. The value is structural: an interpretable operator, an exactly preserved balance, and an explicit information limit of aggregate observation.
Read the full abstract