Peer Revenue Past citations are no guarantee of future returns

Papers

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

All of arXiv

Sunday 13 September

Robotics

An Adaptive Fixed-Time Line-of-Sight Guidance Scheme for 3D Path Following of Underwater Vehicles: Theory and Experiment

Reliable path tracking is crucial for autonomous underwater vehicles (AUVs) operating in dynamic and uncertain marine environments. However, traditional line-of-sight (LOS) guidance methods rely on asymptotic convergence, resulting in slow disturbance recovery and unpredictable tracking performance. Existing robust control methods typically require modifications to the underlying vehicle controller, limiting their practical application on commercial AUV platforms. This paper proposes a robust fixed-time adaptive LOS guidance framework for 3D path tracking for AUVs. By combining fixed-time stability theory with LOS guidance, this method guarantees path tracking convergence within a preset time range, with the convergence time independent of initial conditions. Furthermore, a fixed-time adaptive estimator is developed to rapidly compensate for time-varying sideslip disturbances caused by ocean currents. A time-varying look-ahead mechanism is also introduced to improve tracking performance on curved paths. Lyapunov analysis proves the fixed-time stability of the proposed framework, and numerical simulations and physical experiments demonstrate that, compared to state-of-the-art adaptive LOS methods, this framework exhibits superior tracking accuracy, convergence speed, and anti-interference capability. In simulation, the time-varying look-ahead variant reduced cross-track and vertical-track RMSE by 69.37% and 67.46%, respectively, during curved-path tracking. In field experiments with an Iver 3 AUV, the proposed fixed-time guidance reduced average tracking error by 56.35% in straight-path evaluation and 27.59% in curved-path evaluation compared with conventional adaptive LOS guidance.The proposed method provides a practical guidance-level solution for achieving reliable autonomous navigation of AUVs in complex marine environments.
Read the full abstract

General Relativity and Quantum Cosmology

Horizon Response to Orbital Redistribution in Self Consistent Einstein–Vlasov Black Hole Environments

We study whether orbital redistribution in a self consistent spherical Einstein–Vlasov environment can change the asymptotic normalization of a black hole horizon while the horizon mass, particle rest mass and ADM mass are all held fixed. The matter variable is the occupation of regular bound orbital actions, so the stress tensor, orbital energies and gravitational field are determined by the same distribution. Linearization of the spherical mass constraint gives a kinetic variation law in which orbital energy is conjugate to occupation and the inner lapse ratio multiplies the horizon mass variation. On a locally regular equilibrium branch, mixed variations imply an integrated reciprocity relation between the central mass derivative of orbital energy and the directional response of the horizon normalization. We construct finite mass populations and trace constant mass redistribution curves. For the reference rest mass ratio $0.30$, the calculated endpoint surface gravity shifts are approximately $+15.37$ and $-15.33$ parts per million. The constrained response cancels at simultaneous dilute and Newtonian order, is nonzero for exact Schwarzschild orbits, and is further modified by self gravity. Independent balance, integral, derivative and refinement tests resolve the response well below its reported magnitude.
Read the full abstract

All authors Anirudh Pradhan, K. Ghaderi, M. Zeyauddin, Ajit Kumar

Machine Learning

Calibrating Interpretability Instruments Before Trusting Their Verdicts

Causal claims about large language model (LLM) internals rest on measurements. Those might include a projection, a cosine, an ablation delta, or an interchange patch among others. These measurements fail in specific, diagnosable ways that return a plausible number instead of an error, so a broken instrument can easily read as a finding. A covariance-matched null can saturate until every direction looks typical, a per-head attribution can overshoot the true residual write threefold on reordered-normalization architectures, an interchange patch can go sign-chaotic because its outcome is pinned at a ceiling, or a read-from verdict can be an artifact of measuring past the layer where the model already decided. This note documents six such failures from a causal interpretability program on refusal and moral representation, spanning several papers and a four-model open-weight panel; each mode is established on one or two of the four. For each we give the tell that catches it and a protocol keyed to a detectable trigger (reordered normalization, massive activations, a low-dimensional decision channel), so we and readers can check whether a given setup is exposed. The discipline reduces to four moves: calibrate against a positive-control ladder, certify with an orthogonal cell, compute power before spending compute, and state every read-from verdict at a depth referenced to the model's commitment. The evidence is four architectures across three families within a single program; external replication across programs is future work.
Read the full abstract

Probability

A Superdiffusive Local Limit Theorem for the Elephant Random Walk and the Breakdown of Log-Concavity

Let $(S_n)_{n\geq 1}$ be the one-dimensional Elephant Random Walk (ERW) in the superdiffusive regime, with memory parameter $p\in(3/4,1)$ and first-step bias $\mathbb{P}(S_1=1)=q$. Set $a=2p-1\in(1/2,1)$. If $f_{q,a}$ denotes the density of the superdiffusive limit $L_{q,a}$, we prove the uniform local limit theorem $\lim_{n\to\infty}\sup_{j\in\mathbb{Z},\,j\equiv n\;(\mathrm{mod}\;2)}\left|\frac{n^a}{2}\mathbb{P}(S_n=j)-f_{q,a}(j/n^a)\right|=0$. The proof uses the exact recurrence for the probability mass function of $S_n$, yielding uniform $O(n^{-a})$ and $O(n^{-2a})$ bounds for the p.m.f. and its first discrete differences, respectively. We then disprove a conjecture of Guérin, Laulin, Raschel and Simon concerning eventual log-concavity. Writing $L_a=L_{1,a}$ and $f_a=f_{1,a}$, let $a_{\rm ev}$ be the eventual-log-concavity threshold and let $a_\star$ be the upper failure threshold for log-concavity of $f_a$. Their results imply $a_{\rm ev}\geq(\sqrt{5}-1)/2$, and we prove $(\sqrt{5}-1)/2\leq a_{\rm ev}\leq\min\{0.80399,a_\star\}\leq a_\star<0.918$. The bound $a_\star<0.918$ follows from the first three exact moments of $L_a$ and the sharp skewness inequality for centered log-concave distributions, while $a_{\rm ev}\leq0.80399$ follows from a certified finite-order analysis of the exact p.m.f. recurrence. Direct numerical iterations provide evidence that $a_{\rm ev}\approx0.80399$, equivalently $p_{\rm ev}\approx0.902$.
Read the full abstract

Systems and Control

Velocity-free Attitude Synchronization Using Vector Measurements

This paper addresses the velocity-free leaderless and leader–follower distributed attitude synchronization of a network of rigid body systems, with inertial vector measurements, under an undirected communication graph topology. In the leaderless case all agents achieve consensus on a common constant orientation. In the leader–follower case, all agents synchronize with a prescribed constant orientation available to only one agent. The proposed schemes require neither attitude reconstruction nor angular-velocity, avoid unwinding, and achieve almost-global asymptotic stability of the desired synchronization sets. Numerical simulations illustrate their effectiveness.
Read the full abstract

Physics and Society

From the Physics of Society to a Sociology of Artificial Agents

Sociology emerged from Comte's ambition to study society as a form of "social physics" and was later refined by Durkheim's concept of the social fact a collective regularity that cannot be reduced to any single individual's behavior. This essay argues that a structurally similar problem is now emerging in a new domain: interactions among artificial intelligence agents. Drawing on recent empirical work showing that populations of large language model agents can spontaneously develop shared conventions and collective biases through repeated interaction, the essay proposes a new field of inquiry the Sociology of Artificial Agents dedicated to studying the relational, normative, cultural, and organizational patterns that emerge among AI agents themselves, independent of direct human involvement. It introduces the concept of the "artificial social fact" as an analytical bridge between classical sociology and this new research terrain, while cautioning against anthropomorphizing AI systems. The claim is not that artificial agents form societies in the human sense, but that their interactions already produce measurable collective patterns worthy of systematic sociological study.
Read the full abstract

General Economics

Redistributive Policies for the Times of Transformative AI

After the arrival of transformative artificial intelligence (TAI), broad-based automation is expected to decrease the labor share and increase income and wealth inequality. Although economic growth is likely to accelerate, most of its gains may accrue to a narrow group of individuals and firms. Hence, if unmitigated by redistributive policy, income and wealth inequality may rise to levels unseen in the industrial economy. Using a unifying theoretical framework, we survey the redistributive policies proposed for the era of TAI, such as universal basic income (UBI), universal basic capital (UBC), state-issued compute and robot permits, and taxes on capital, compute, robots, tokens, land, energy, consumption, and wealth. We argue that policies that are able to broadly distribute rents from capital including compute and robots - such as UBC or UBI financed through capital taxes - are most likely to achieve lasting reductions in inequality in a world with human-aligned transformative AI.
Read the full abstract

Lattice Field Theory

Fermionic quantum field theories as probabilistic cellular automata in three dimensions

Wetterich showed that certain 1+1D probabilistic cellular automata are equivalent to fermionic QFTs and posed the 3D construction as an open problem. We construct one: a layered automaton ("coincube") whose conversion blocks form the real quaternion representation of Cl(0,3), controlled by binary environment fields whose streaming outruns the carrier ("fresh tape") – no bit is consulted twice, and the single-particle ensemble propagator equals the annealed Bloch operator at every time. Exact results: the step operator is unitary for an explicit complex structure; the local Grassmann action is extracted mechanically; the single-carrier excitation is a Weyl fermion with an isotropic leading cone (slope ratios 1 within errors, factorized transport excluded by >=10 error bars); at finite momentum the node carries a parity-odd anisotropy c(q)kx ky kz/|k|, cancelled on the Dirac branch whose gap is 2 arctan[qm/(1-qm)], while off-resonant spectators stay massless; media-mediated interaction obeys Ug = (1-2gq^2) U. Obstructions: ballistic transport admits only finite velocity sets; Abelian sign gauges leave the factorized surface; no protected 2-component node survives an exhaustive search. Finally, a dichotomy for the quaternionic event class: an isotropic cone forces overdamping – Q = w_0/Gamma <= pi/(2 ln 2) at all densities, 0.66 at working density – while in-state unitarity forces factorized transport. Postselected two-boundary amplitudes evade this, exactly unitary at all times under the fresh tape, with induced weight positivity open: the relativistic object here is an amplitude whose probabilistic reading is unsettled.
Read the full abstract

Robotics

Beyond Dead Reckoning: A Point of View on Camera–DAS–GNSS Continuity in Road Tunnels

Road tunnels remove satellite visibility where connected and automated vehicles still require continuous, attributable, and integrity-bounded positioning. This Point of View argues that tunnel localization should be treated as infrastructure-assisted cross-modal track continuity, not as extrapolation from the last trusted satellite fix. A trusted portal satellite solution provides the global anchor, distributed acoustic sensing (DAS) continuous motion evidence, cameras sparse identity and lane anchors, onboard sensing short-term dynamics, and edge computing association, fusion, integrity monitoring, and guarded reacquisition. Ground truth is reserved for offline calibration and validation. The article develops a falsifiable research and deployment agenda for progressing from synchronized multimodal evidence to validated, integrity-aware tunnel positioning continuity.
Read the full abstract

All authors Lyes Saad Saoud, Hesham A. Rakha, Mona Jaber, Moussa Ayyash

Chaotic Dynamics

A Canonical Lagrangian Formulation of the Two-Dimensional Lotka-Volterra System

Hamiltonian and Lagrangian mechanics are powerful frameworks for analyzing physical systems. Previous work has extended these formalisms to ecological systems, such as the predator-prey Lotka-Volterra (LV) system. In this Article, we derive a canonical Lagrangian for the two-dimensional LV model directly from its Hamiltonian representation. We find that the two-dimensional LV system admits a standard canonical Lagrangian formulation with one degree of freedom and a non-quadratic kinetic structure. This formulation admits a mechanical interpretation in terms of a particle moving in a potential well, where the non-standard kinetic structure produces a position-dependent damping term that can instead act as "revving." The derivation provides a direct connection between predator-prey dynamics and a canonical formulation of mechanical dynamics. As a verification of the construction, we apply Noether's procedure to the explicitly time-independent derived Lagrangian and reveal that the well-known Hamiltonian of the LV system is the corresponding conserved quantity. We also uncover a subtle redundancy associated with the choice of canonical momentum and its identification with the original population variables.
Read the full abstract

Data Structures and Algorithms

Fast and Theoretically-Efficient Batch-Parallel Link-Cut Trees, Euler Tour Trees, and Treaps

Parallel batch-dynamic trees are a fundamental building block in recent theoretical and practical advances in dynamic graph algorithms. However, all existing parallel batch-dynamic tree data structures, including Euler tour trees, UFO trees, topology trees, and rake-compress trees, are all significantly outperformed in the sequential setting by link-cut trees, which have been the sequential state-of-the-art for over 40 years. Despite their excellent performance in the sequential setting, designing efficient batch-parallel link-cut trees has remained a major open problem. In this paper, we close this gap by introducing MOJOS, a unified framework for theoretically- and practically-efficient parallel batch-dynamic trees. We exploit the fact that both Euler tour trees and link-cut trees rely on a common dynamic sequence abstraction that supports splitting and joining. We introduce a new batch-dynamic sequence built using treaps that achieves optimal work and depth, and outperforms existing parallel skip list and treap implementations for batch updates, queries, and memory usage. With MOJOS, we develop a new batch-parallel Euler tour tree algorithm that outperforms prior batch-dynamic tree implementations supporting subtree queries. Unlike prior batch-parallel Euler tour trees which rely on skip list's ability to represent cyclic sequences, MOJOS allows any batch-dynamic sequence data structure to be used as a drop-in replacement. Finally, we develop the first theoretically-efficient batch-parallel link-cut tree, which is also the first batch-dynamic data structure supporting path queries to achieve $O(\log n)$ depth for batch updates in the binary-forking model. Our link-cut tree implementation outperforms all known parallel batch-dynamic tree data structures supporting path queries.
Read the full abstract

Cryptography and Security

PIMENTO: A Privacy Framework for Querying Text

Currently, there are two state-of-the-art, complementary privacy guarantees: contextual integrity (CI) for what may flow, and differential privacy (DP) for what may be inferred. Yet neither maps cleanly onto natural language, leaving existing approaches unable to provide these guarantees for analytics over unstructured text. We address this gap with Pimento, a framework that takes three forms of natural language: text corpus, queries, and privacy policies; and grounds them into a relational database, creating a common substrate on which both guarantees can be enforced formally. With this design, we not only provide end to end privacy guarantees, but also improvement to utility through three key contributions: DP aware Text-to-SQL, which searches for correct queries requiring the least DP noise; CI aware Text-to-SQL, which compiles natural language policies into executable CI rules over the database; and a new privacy definition we call contextual differential privacy, which redefines the traditional DP neighborhood under CI, and yields a tighter smooth sensitivity bound. Across new benchmarks, Pimento selects the best query in 75.3% of cases (upto +45 points over baselines) and achieves zero leakage under correct policy grounding. To our knowledge, Pimento is the first framework to provide formal privacy guarantees for natural language analytics under CI, DP, and their composition.
Read the full abstract

Artificial Intelligence

Runtime Authorization for Resources Acquired by AI Agents

By acquiring compute, credentials, accounts, services, and other agents, autonomous AI agents can introduce new authority into a task. Payment, budget, OAuth, mandate, and fulfillment checks can validate transaction conditions without deciding whether a returned resource may become usable authority. This post-fulfillment activation gap spans tool-mediated creation, inter-agent delegation, and agentic commerce. We present a provenance-bounded runtime authorization architecture. It quarantines acquired outputs, resolves their actual capabilities from authenticated provider evidence through a versioned resolver, and activates them only through a current activation transaction that checks the resolved manifest, provenance, epochs, and a downward-closed relational envelope over a typed resource-capability hypergraph. The envelope preserves correlated identity, effect, data, delegation, and graph-wide limits. Single-use effect permits are revalidated and consumed at effect linearization. Under explicit assumptions, we prove eight safety properties covering quarantine, backing, non-amplification, split non-evasion, crash/retry, refunds, epochs, and effect confinement. Across five resource classes, reference semantics accepted 20/20 benign traces and rejected 40/40 registered unsafe traces over 810 events; an independent checker agreed on 60 base and 40 refinement traces and rejected 89/89 tamper tests. Frozen Codex and Gemini Model Context Protocol (MCP) client components completed 54/54 deterministic local stdio calls. In a registered 18-case staged MCP-to-Docker composition, both benign paths completed, and none of the 16 unsafe paths added an unauthorized Docker start request. A five-source audit classified 1,248 field pairs across 32 units; no unit alone supplied a complete activation profile.
Read the full abstract

Computation and Language

Quantifying the Generation Modality Gap in Speech-Text Language Models

Pure speech language models often lag behind text and speech-text language models in generating coherent content, but this gap is difficult to quantify because speech and text systems are typically evaluated with different metrics and trained on different data. We study the speech-text modality gap in a family of spoken language models, based on flow matching for continuous acoustic feature generation. We construct a unified generation-based evaluation suite that compares speech-only, text-only, and speech-text language models trained on matched data distributions and evaluated in matched generation settings. We evaluate generated continuations along multiple dimensions: semantic coherence, measured by transcribing generated speech and scoring it with a reference language model; local phonetic structure, measured by phone n-gram distributional statistics; speaker consistency and acoustic quality; and emotion-based distributional metrics. Across datasets, we find that joint speech-text modeling substantially improves semantic coherence. However, the improvement is not uniform across metrics: phone-level metrics change only modestly, speaker similarity and predicted quality are lower for speech-text continuations, while emotion-based distributional metrics improve. Compared with larger-scale speech-only models, our speech-text model closes much of the scaling gap in transcript-based semantic coherence, suggesting that text provides an efficient semantic training signal for spoken language modeling.
Read the full abstract

Numerical Analysis

A Structure-Preserving Symmetric Galerkin Boundary Element Method for Anisotropic Multi-phase Mullins-Sekerka Flow

A structure-preserving symmetric Galerkin boundary element method (SGBEM) is developed for the anisotropic multi-phase Mullins-Sekerka problem in $\mathbb R^2$. The bulk harmonic problems are eliminated through a discrete Dirichlet-to-Neumann operator assembled from region-wise SGBEM discretization, leading to a boundary-only formulation coupled to the evolution of a polygonal curve network with triple junctions. The Galerkin approximation of the resulting boundary problem is shown to be uniquely solvable, and the fully discrete scheme is unconditionally stable with respect to the time step as long as the evolving polygonal network remains in an admissible class. The accuracy of the proposed method is demonstrated by a convergence test under coupled space–time refinement against a similarity-rescaled exact solution consisting of three concentric circles.
Read the full abstract

Computational Engineering

A property-registry contract for retrieve-or-refuse thermal-mechanical lattice search

Early thermal-mechanical lattice requirements are knowledge-intensive and often jointly unsatisfiable: an engineer asks for a cell that is light, stiff, laterally conducting and cheap, and no cell in the library satisfies it. A design system should say so, and say which requirement to loosen and by how much, rather than return the nearest row. A generative model can return a candidate even when the library holds none. This work applies established conflict diagnosis to a catalogue of homogenised properties. Search over 1,397 homogenised unit cells and 19 base materials (26,543 combinations) returns a catalogue row that a second solver can rebuild, or, for an empty feasible set of at most eight constraints, inclusion-minimal unsatisfiable subsets (MUS) and the slack of a repair, not a neighbour. One registry declaration generates the prompt and the evaluator, so undeclared parsed keys cannot reach search. On a frozen suite of 64 typed queries, retrieve-or-refuse matches min-repair on every feasible query (48/48) and refuses every empty one (16/16) with MUS and slack. Constraint-ignoring nearest-neighbour and penalty search violate stated cost or density limits. On 216 empty queries, repairs printed at three significant figures and rounded outward stay feasible in every case (216/216). When density and cost must be kept, a list of minimum-cardinality repairs keeps them on 209 of 211 queries; a protection-first repair keeps them on all 211, the same as full diagnosis. A 308-request parse benchmark is a template-text check, not unconstrained engineer prose.
Read the full abstract

All authors Shaoliang Yang, Henry Chu, Zu Yashengjiang, Jun Wang

Audio and Speech Processing

Bridging Data, Reasoning, and Alignment: A Unified Framework for Context-Aware Instruction-Following TTS

The ISCSLP 2026 CoT-TTS Challenge requires TTS systems to generate Chain-of-Thought (CoT) reasoning from dialogue history before synthesizing contextually appropriate speech. While the official baseline establishes a unified architecture, it remains constrained by limited contextual comprehension, weak instruction fidelity, and suboptimal audio quality. We present a systematic optimization pipeline to address these limitations. First, we develop a data process framework that cleans raw data via FullSubNet denoising, Qwen3-ASR re-transcription, and Qwen3.5-35B-A3B-based history-CoT consistency analysis, while distilling 545K high-fidelity instruction samples using Qwen3-TTS and Seed-VC under strict quality filtration. Second, we propose a Context-Aware Direct Preference Optimization (CA-DPO) method. By employing a cascaded filtering strategy, ASR prescreening, LLM tournament ranking, and speaker similarity verification, we obtain high-confidence preference pairs that significantly enhance holistic “Context$\rightarrow$CoT$\rightarrow$Speech” consistency during DPO training. Third, we establish an evaluation method featuring a 500-sample test set and an LLM-as-Judge framework to independently assess reasoning and execution fidelity. Experiments demonstrate that our system significantly outperforms the baseline across all objective and subjective metrics, validating our data governance and alignment strategies.
Read the full abstract

All authors Jingbin Hu, Luyu Wang, Wenjie Tian, Kangxiang Xia, Qirui Zhan, Haoyu Zhang, Yunxiang Chen, Houdun Liu, Lei Xie, Liumeng Xue

Computation and Language

Building Legal Reward Models for Grounding and Abstention

Large language models are increasingly used in high-stakes domains such as law, where systems must ground their reasoning in retrieved evidence and abstain when that evidence is insufficient. However, existing reward models are largely optimised for general preferences rather than contextual grounding, limiting their ability to evaluate these behaviours in retrieval-augmented generation (RAG) settings. We introduce a framework for transforming existing legal QA datasets into contextual preference data and use it to construct LegalRewardBench (LRB), a benchmark for evaluating grounded legal generation under noisy and insufficient retrieval conditions. Across general and legal contextual evaluation, we find that contextual DPO improves grounded evaluation, but performance is sensitive to preference-data construction. Length-balanced augmentation substantially improves grounded legal evaluation, with the strongest configuration combining length-balanced legal and general contextual preference data and improving performance by up to $\mathbf{+25.6}$pp over baseline. We further find evidence of cross-jurisdiction transfer: models contextually refined primarily on Victorian criminal-law data improve grounded evaluation on external US legal benchmarks, including a $\mathbf{+16.2}$pp improvement on Housing Statute QA. Together, these results provide a reproducible foundation for constructing and evaluating grounded legal reward models in retrieval-augmented settings.
Read the full abstract

All authors Rilton Franzone, Valentin Noël, Puyu Wang, Philip Torr, Fabio J. Fehr

Artificial Intelligence

AppliedScientist: Automated Scientific Revision Through Iterative AI Reviewing

Automated reviewing systems are increasingly evaluated based on the quality of the reviews they produce. Yet a review is only useful if acting on it leads to a measurable improvement in the paper. We present AppliedScientist, a closed-loop system that couples an autonomous AI scientist with an AI reviewer, and evaluate it by iteratively revising rejected papers from a range of research subfields. To mirror how human authors build on earlier drafts, the AI scientist has access to its previous versions during revision. To avoid bias from prior judgments, however, each review is generated independently, with the reviewer having no memory of earlier feedback or scores. We compare three revision settings: one initialized with the original venue reviews, one initialized with AI-generated reviews, and autonomous self-revision using the same fixed prompt in every round. Because the reviewer both guides and evaluates the revision, we also assess the human-initialized revisions using Stanford Reviewer as an independent evaluator. Reviewer-guided revision consistently improves more than fixed-prompt self-revision, and Stanford Reviewer also assigns higher scores to later revisions. AppliedScientist resolves 128 of 150 execution-related weaknesses (85.3%), but only 2 of 18 idea-related weaknesses (11.1%), suggesting that iterative revision is effective at improving experiments and implementation, but rarely changes concerns about novelty or significance.
Read the full abstract

All authors Vidushee Vats, Karun Sharma, Shengzhi Li, Shichao Pei

Cryptography and Security

Trinqet: Private Triangle and Quadrangle Counting over Distributed Graphs

Triangle and quadrangle counts are core statistics in graph analysis. Yet many real-world graphs are distributed across multiple parties and encode highly sensitive relationships, precluding direct data sharing. Secure multi-party computation (MPC) provides a principled alternative, but introduces a fundamental tension: the protocol must hide the graph's topology, forcing fully data-oblivious operations over all potential edges–while real-world graphs are extremely sparse, making most of this work wasted. We propose Trinqet, a system that resolves this tension through new MPC-friendly algorithms for private triangle and quadrangle detection. Trinqet safely exploits sparsity using a suite of novel techniques that eliminate vast numbers of unnecessary operations while preserving strong security in the malicious threat model. Trinqet supports both counting and enumeration and, in our evaluation, outperforms all five baselines by up to 10^5 in runtime.
Read the full abstract

Combinatorics

On properties of the conformal circulant matrices

In this paper, we introduce and study conformal permutation matrices. In particular, for a permutation $\pi_s\in S_n$, we define the corresponding conformal permutation matrix $H_{\pi_s}$ and show that its $d-$th power, where $d=n/\gcd(s,n)$, is a diagonal block matrix whose blocks are products of certain matrix blocks $h_i$. We further show that these diagonal blocks share a common subset of eigenvalues and prove that $H_{\pi_s}$ is block-diagonalizable. We also introduce the notion of conformal circulant matrix and investigate its eigenvalues. Finally, we establish a necessary and sufficient condition for a rectangular matrix to be conformal circulant.
Read the full abstract

Signal Processing

HELENA for 5G NR LEO NTN Channel Estimation: A Comparative Evaluation

Deep Learning (DL)-based channel estimation has shown high accuracy and low latency in terrestrial 5G NR, but Low Earth Orbit (LEO) Non-Terrestrial Networks (NTNs) introduce Doppler and synchronization impairments that may require NTN-specific architectures. We test whether High-Efficiency Learning-based channel Estimation using dual Neural Attention (HELENA), originally designed for terrestrial channels, remains effective after NTN retraining and suitable across high-performance and power-constrained inference platforms. Its unchanged architecture is trained on paired receiver-compensated (NTN-1) and residual-impaired (NTN-2) datasets and compared with eight terrestrial-origin models trained on the same NTN data and the NTN-specific MDELAN-SISO. HELENA achieves the lowest observed SNR-averaged NMSE among the DL estimators in both conditions, including 55.8-62.7% lower linear-scale NMSE than MDELAN-SISO. All DL models degrade in NTN-2, demonstrating the challenge posed by residual Doppler and its associated impairments. On an RTX PRO 4500, HELENA achieves 0.0595 ms 99th-percentile (P99) inference latency, 88.1% below the 0.5 ms budget, with lower energy than its closest attention-based competitors. On a 10 W Jetson Orin NX, it retains a favorable accuracy-energy trade-off, but no model meets the P99 budget. Thus, HELENA needs no NTN-specific redesign for the evaluated task, while embedded tail latency remains an open challenge.
Read the full abstract

Machine Learning

OCT-FedSIR: Toward Trustworthy Federated Ophthalmic Learning under Annotation Noise

Federated learning enables collaborative model development without centralizing patient data, but annotation reliability at participating institutions cannot always be assumed. In ophthalmic imaging, differences in disease prevalence and class composition can resemble changes caused by corrupted supervision. We introduce OCT-FedSIR, a reliability-aware spectral framework for federated OCT classification under client-dependent annotation noise and heterogeneous data distributions. OCT-FedSIR combines class-balanced spectral estimation, Stage-I logit adjustment, complementary spectral descriptors, selective spectral relabeling, and noise-aware federated optimization. We evaluated the framework on the Kermany, University of Illinois Chicago, and Wake Forest datasets under symmetric and structured asymmetric noise and three levels of non-IID heterogeneity. Across 117 experimental conditions, OCT-FedSIR achieved a mean accuracy of 86.73%, compared with 79.94% for RoFL and 78.75% for FedCorr. It correctly separated clients with original and corrupted annotations across all evaluated conditions, while the original FedSIR identification procedure was less robust, particularly under asymmetric noise. Spectral relabeling recovered 77.2% of corrupted annotations with 91.3% correction precision and a 3.5% false-correction rate. Retaining corrected clients outperformed spectral pruning by 9.30 percentage points on average. These findings show that annotation noise can often be identified and corrected without discarding informative client data.
Read the full abstract

All authors Sina Gholami, Abdulmoneam Ali, Tania Haghighi, Rashadul H. Badhon, Behafarin Emam, Sally S. Y. Ong, Atalie C. Thompson, Theodore Leng, Ahmed Arafa, Jennifer I. Lim, Minhaj Nur Alam

Machine Learning

WaVeFuse: Regime-Adaptive Equity Index Forecasting via Channel-Wise Wavelet Denoising and Vertical Attention Fusion

Hybrid Deep Learning for equity index forecasting is limited by three problems: propagation of OHLCV noise into derived technical indicators (TIs), channel-indiscriminate multi-scale decomposition that conflates heterogeneous frequency signatures, and static multi-branch fusion that cannot adapt to market regime shifts. WaVeFuse addresses these limitations through a unified dual-branch architecture. Symlet-4 wavelet denoising (level 2, MAD soft threshold) suppresses microstructure noise in OHLCV. Seven low-lag TIs computed from denoised prices are encoded by a causal channel-wise continuous wavelet transform (Morlet, 32 scales) into a per-timestep scale-space matrix. A CNN-BiLSTM branch captures temporal dynamics, while a dual-layer Transformer (heads=4, dk in {16, 32}) models inter-scale spectral dependencies, and their representations are integrated by a 2-token softmax gate Vertical Attention Fusion (VAF) that dynamically reweights branches as market regimes shift. Evaluated under walk-forward validation (WFV) on KOSPI, DAX, NYSE Composite, and Russell 2000 (2010-2023), WaVeFuse achieves R2 = 0.81-0.96 and directional accuracy 70.5-78.3%. It outperforms seven state-of-the-art models by 8.9-20.2% MAE across twelve dataset-period configurations. Diebold-Mariano statistics (4.62-10.38, p<0.001) confirm superiority over a well-tuned XGBoost benchmark across four indices. Ablation verifies component-wise contributions. Under realistic backtesting with 10 basis point transaction costs, WaVeFuse's directional strategy achieves a mean Sharpe ratio of 3.69 across four markets and limits maximum drawdown to 7.5% during the COVID-19 crash. With 152k parameters (0.68MB) and sub-1.3ms GPU inference, WaVeFuse delivers a computationally efficient, regime-robust framework suitable for research and decision-support deployment.
Read the full abstract

Networking

Energy-Aware LoRaWAN Design for Long-Lived Agricultural Sensing: Insights from a Multi-Year Deployment and Controlled Platform Comparison

Agricultural IoT nodes are often far from mains power and have limited access for maintenance. Therefore, IoT deployments benefit from low-power, long-range communication such as LoRaWAN. However, communication alone does not guarantee multi-year operation. Previous work has measured communication energy, modelled system lifetime, and documented long-lived deployments. This paper connects long-term deployment evidence with controlled platform measurements. The AgriTrust deployment has operated for 2 years and 8 months using MKR WAN1310-based Squirrel Box nodes. Building on this evidence, we compared the MKR WAN1310 and STM32WL LoRaWAN platforms using time-resolved current traces during confirmed-uplink cycles. For this outdoor comparison, we tested nine combinations of payload size and data rate with three repetitions each. Both platforms achieved 3/3 ACKed packets in every condition. The STM32WL had lower cycle energy than the WAN1310 in all tested conditions. Cycle energy ranged from 0.0350 J to 0.3550 J for STM32WL and from 0.0698 J to 0.5662 J for WAN1310. These communication events are brief, while sleep and leakage currents persist between cycles. The STM32WL sleep current was recorded at 59.6 nA, while the WAN1310 sleep current was 104 microamperes, approximately 1745 times that of the STM32WL. This difference shows that sleep current is a first-order determinant of long-term viability. However, the whole-system energy budget also depends on sensing loads, duty cycle, communication energy, and harvested-energy support. The study should be treated as a controlled characterisation, not a universal comparison across all sites, firmware stacks, or LoRaWAN modes.
Read the full abstract

2609.14732 · 13 Sep · 8 pages, 5 figures. Presented at the 4th International Workshop on Long and Short Range Wireless Technologies Applied to IoT for Networks of Tomorrow (LS-NoT 2026), co-located with DCOSS-IoT 2026, Reykjavik, Iceland, 22-24 June 2026

Materials Science

Colossal magnetostriction effect in rare-earth orthoferrites

Within the entire gamut of magnetostrictive, piezomagnetic, and ferromagnetic shape memory alloy systems, the striction effect is found to vary from a few tens of parts per million to a few percent. Here, we report the observation of an unprecedentedly large magnetic-field-induced lattice strain along the $c$ axis (more than 60-100% at 90 kOe field) in single crystals of orthorhombic $R$FeO$_3$ ($R$ = Dy, Ho) below their spin-reorientation transition temperature $T_{SR}$. However, the striction effect is two orders of magnitude smaller along the $a$ and $b$ axes. Like magnetostriction, the magnetodielectric effect is highly anisotropic and very large along the $c$ axis. Such gigantic striction and dielectric effects along the $c$ axis arise as a result of a magnetic-field-induced first-order structural phase transition which possibly stems from large spin-orbit coupling (and, thereby, enormous magnetocrystalline anisotropy). The observed colossal striction in rare-earth orthoferrites could open new opportunities for applications requiring large, reversible magnetic-field-induced strain.
Read the full abstract

All authors Moumita Das, Arup Ghosh, Moumita Nandi, Arumugam Thamizhavel, Dipten Bhattacharya, Prabhat Mandal

Audio and Speech Processing

Parameter isolation with domain-specific experts for incremental audio classification

To successfully deploy a model in time-varying environments such as streaming data prediction and sensing control, domain-incremental learning (DIL) has attracted attention since it aims to adapt a previously trained model to newly arriving domains, while reserving knowledge from earlier domains without accessing their data. Incremental learning across domains can be regarded as a recurrent update, in which the current model is obtained by updating the model carried over from previous domains. Conventional DIL approaches that rely on domain-invariant feature learning and weight regularization gradually overwrite or constrain parameters learned in previous domains, leading to catastrophic forgetting. Instead, this paper proposes a new domain-specific parameter-isolation architecture that retains all past domains. The proposed architecture mitigates catastrophic forgetting through a full-order recurrent update, constructing a new expert using domain-specific data conditioned on all previously frozen models. To achieve this, we incorporate data-free generative replay to reconstruct previous-domain data and cross-domain feature generation to recover later expert features missing from earlier domain samples. Finally, we apply the proposed model architecture to domain-agnostic incremental learning for audio classification, as defined in the DCASE 2026 Challenge Task 7. Consequently, we achieve micro and macro accuracies of 78.4% and 78.9%, respectively, representing increases of 33 and 25 percentage points over the Challenge baseline. Ablation studies are conducted to examine the effectiveness of each processing component in terms of classification accuracy.
Read the full abstract

All authors Jongyeon Park, Do-Hyeon Lim, Sang-won Park, Hong Kook Kim, Kyungdeuk Ko, Hyeongcheol Geum, Jeong Eun Lim

Graphics

Planar-faced and high-Jacobian two-refinement hexahedral templates

Automatically generating high-quality conforming hexahedral (hex) meshes from general input boundaries remains a challenging problem, despite the numerical advantages hex elements offer in simulation. Grid-based adaptive refinement, followed by hanging-node removal, is the most robust fully automatic choice. Among two-refinement methods, primal templates have better mesh quality than dual templates but depend on a strong balancing condition that over-refines the grid; neither family guarantees planar quadrilateral (quad) faces. This paper generalizes recent primal three-refinement templates to a two-refinement scheme under a moderate balancing condition, a relaxation of the strong one. 32 special and five fundamental patterns resolve all 144 symmetry-reduced configurations, followed by either a fast greedy algorithm or an integer linear programming (ILP) algorithm that trades extra runtime for a further reduction in element count. The scheme is the first two-refinement method in which all hexes have planar faces, and its meshes feed directly into a recent quality-guaranteed hex mesh reconstruction algorithm. At comparable element counts, it attains a similar Hausdorff ratio (HR) and a higher minimum scaled Jacobian (min SJ) than its three-refinement counterpart.
Read the full abstract

General Relativity and Quantum Cosmology

Bounds on Black Bounces from Phenomenological Imprints

In this work, we derive phenomenological constraints on a symmetric black-bounce geometry supported by an anisotropic fluid. We investigate the effects of the bounce parameter and the matter parameter on classical and strong-field observables, considering the perihelion advance, light deflection, Shapiro time delay, and black-hole shadow. In the weak-field regime, we obtain analytical corrections to the corresponding general-relativistic predictions and use Solar-System measurements to constrain the parameter space. We find that the matter parameter is generally constrained more strongly than the minimum-radius scale, reflecting the suppressed dependence of weak-field observables on the bounce parameter. In the strong-field regime, we show that the asymptotic shadow radius depends directly on the matter parameter, whereas the bounce parameter enters through the existence condition of the outer unstable photon orbit rather than through an independent correction to the shadow size. These results highlight the distinct roles played by the matter and bounce parameters in weak- and strong-field observables and provide complementary constraints on the parameter space of the symmetric black-bounce geometry.
Read the full abstract

Analysis of PDEs

Blow-up criterion to the compressible full Navier-Stokes equations with inflow-outflow boundary conditions

We investigate the compressible Navier-Stokes equations with heat conduction subject to inflow/outflow boundary conditions, establishing the existence of a strong solution. The primary contribution of this work lies in the derivation of a new regularity criterion for three-dimensional compressible flows, which serves as an analogue to the Beale-Kato-Majda criterion for incompressible fluids. Notably, our findings refine both the strong solution results established by Valli and Zajaczkowski and the conditional regularity framework proposed by Basaric, Feireisl, and Mizerova. Our analysis extends the framework of Basaric, Feireisl, and Mizerova, allowing us to successfully derive the required uniform estimates.
Read the full abstract