Cryptography and Security
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Monday 7 September
Modern mission-critical coordination demands seamless communication across multiple domains. Traditionally, Voice Communication Systems (VCS) have relied on physically separated Red/Black architectures to ensure voice and data segregation. While these hardware-based methods provide strong security assurances and remain foundational in high-security contexts, they can introduce significant complexity and scalability challenges as mission parameters expand into highly dynamic, multi-domain integrations. As defence, emergency response, and critical infrastructure operations increasingly require interoperable, flexible, and cost-efficient communication environments, there is a growing need to understand whether software-based approaches can provide comparable assurance while supporting modern operational requirements. This SoK characterises a transition to software-based Multi-Domain Data Segregation (MDDS) by integrating systems security, networking, and cryptography. Its goal is to consolidate existing research, identify shared architectural patterns, and address the security challenges facing next-generation high-assurance software-based VCS architectures. By assessing software-defined and virtualized approaches, this SoK supports the development of scalable, high-assurance VCS architectures that facilitate secure real-time coordination across diverse operational domains. Specifically, this SoK examines the security implications of Software-Defined Networking, Network Slicing, Separation Kernels, and Cross-Domain Solutions while addressing challenges posed by quantum computing through Post-Quantum Cryptography (PQC). This SoK provides a comprehensive analysis of the shift from hardware isolation to software segregation, serving as a crucial foundation for researchers and industry stakeholders aiming to enhance secure and adaptable VCS infrastructures for mission-critical operations.
Representation Theory
Quasi-projective dimension and Gorenstein projective dimension
Gheibi, Jorgensen and Takahashi recently introduced the quasi-projective dimension, a homological invariant that extends the classical projective dimension. In this paper, we investigate this invariant from the perspective of Gorenstein homological algebra. First, we show that the quasi-projective dimension coincides with the Gorenstein projective dimension under certain conditions. Second, we introduce and study the quasi-Gorenstein projective dimension as a Gorenstein analogue of the quasi-projective dimension.
Read the full abstract
Computation and Language
Fine PT-PT Web: A High-Quality 41 Billion Tokens Data Collection of the European Portuguese Web
Curating Web corpora for regional language variants like European Portuguese (PT-PT) is heavily bottlenecked by dialectal overlap (mainly with PT-BR) and data processing scale. This paper presents an efficient pipeline to curate a production-ready PT-PT corpus from the Portuguese Web, spanning 411 TB of raw data from Arquivo.pt. We introduce a novel post-scraping block that removes boilerplate and line duplicates prior to filtering. This early-stage intervention increases final document yield by 19.04% by rescuing valid text that standard heuristic filters prematurely discard. Integrated with rigorous language identification, weighted fuzzy deduplication, and neural quality classification, our pipeline offers a scalable framework and a clean, representative corpus optimized for LLM pre-training.
Read the full abstract
Signal Processing
Non-Uniform Antenna Array Design with Large Inter-Element Spacing for Massive MIMO
In massive multiple-input multiple-output (MIMO) systems, uniform arrays are typically configured with inter-element spacing no greater than half a wavelength to avoid grating lobes and spatial aliasing. However, many emerging fifth- and sixth-generation (5G/6G) applications rely on distributed arrays whose inter-element spacing far exceeds half a wavelength. In this paper, we propose an electromagnetic mutual-information-theoretic (EMIT)-guided non-uniform array (NUA) design with large inter-element spacing for massive MIMO systems to address the grating lobes and spatial aliasing artifacts, and in the meantime, to reduce the hardware cost and energy consumption. We start by developing a multipath channel model for non-uniform planar arrays, and analyze the resulting channel characteristics in terms of inter-user interference, aperture efficiency, favorable propagation and channel capacity for the proposed typical NUA patterns. The model is further extended to wideband scenarios, where NUAs demonstrate improved robustness against beam squint due to their more compact element distribution. In addition, we introduce an EMIT approach to NUA design, which links the spatial sampling pattern of an antenna array to the capacity of the resulting MIMO channel. This gives rise to two complementary shaping strategies, amplitude tapering and geometric shaping, and their joint optimization. Numerical results demonstrate that the proposed NUAs significantly outperform conventional uniform arrays in aperture efficiency, channel orthogonality, beam squint mitigation, capacity, and error rate performance.
Read the full abstract
Complex Variables
A two-dimensional counterexample for Kobayashi completeness of balanced domains
Jarnicki and Pflug constructed a bounded balanced domain of holomorphy in $\mathbb C^n$, $n\ge 3$, with continuous Minkowski function which is not Kobayashi complete, and explicitly asked whether the same phenomenon can occur in dimension two. We give such a domain in $\mathbb C^2$.
Read the full abstract
Neurons and Cognition
Fisher-Rao Distance Detects Shifts in Kinematic Profiles under Cognitive Load
Motor control research involves the study of movement kinematics derived from the positional trajectories that complex motions describe. In natural, unconstrained motions requiring cognitive and memory processes in real time, the temporal speed profiles are not bell-shaped, may have multiple maxima and the peaks distribution is best fit by the continuous gamma family with two parameters, the shape and the scale. As the stochastic processes described by complex motion trajectories are non-stationary, the gamma shape and scale parameters describing them span stochastic trajectories. These points live on a curved surface where Euclidean distance depends on the arbitrary choice of parameterization. We adopt the Fisher-Rao distance (the geodesic length on the gamma manifold) as a coordinate-free metric for movement fluctuation signatures and present a robust numerical solver that converges across the full range of empirically observed parameters. We demonstrate the metric on a tablet-based digitized Trail Making Test in healthy adults, comparing micromovement fluctuations under low and high cognitive load. Load displaced every participant's fluctuation signature but with no shared direction. Instead, participants converged toward a common operating regime, with those farthest from it at baseline moving the most. Cognitive load thus contracts individuality in motor fluctuations rather than shifting the population uniformly.
Read the full abstract
Databases
Preserving contextual information in cultural heritage metadata through multidimensional knowledge graphs
Using Knowledge Graphs (KGs) to describe Cultural Heritage Objects (CHOs) supports semantic richness and interoperability. However, standard KGs fail to capture the context-dependent validity of statements. This limitation is critical for cultural heritage metadata, which must often accommodate evolving or conflicting viewpoints, such as colonial versus post-colonial perspectives or shifting scientific consensus. While current knowledge representation methods address basic contextualization via provenance, qualifiers or reification, they lack a unified framework to simultaneously model and query data across multiple social, cultural, and political dimensions. To bridge this gap, we introduce the conceptual foundations of Multi-dimensional Knowledge Graphs (MKGs) and discuss how they preserve complex, multi-layered contexts in CHO metadata.
Read the full abstract
Databases
X-DigCheck: Co-Evolving Application Profiles and Knowledge Graphs, Demonstrated on the RTI Documentation of Rupe Magna
We demonstrate X-DigCheck, a domain-independent environment for building and maintaining application profiles as they co-evolve with the data they describe. Profiles developed against a fixed ontology quickly drift from the schema they were meant to capture. X-DigCheck treats profile construction as a continuous ontology-data co-evolution loop: data are lifted into RDF against the profile, checked through competency questions and SHACL, and the resulting reports jointly drive revisions of the ontology, mappings, constraints, and graph. The loop is agnostic to the domain and to the pipeline that produces the graph. We validate and demonstrate the tool in the cultural heritage domain, on the construction of RupeMagna-RTI, the first Reflectance Transformation Imaging (RTI) specialisation of the Cultural Heritage Survey ODP (CHS-ODP), aligned with CIDOC-CRM/CRMdig, ArCo, CHAD-KG, and Getty AAT, with semRTI as the lifting pipeline of this use case. The demonstration lets visitors run one full turn of the loop -on the shipped Rupe Magna (Grosio, Italy) RTI survey, or on a profile and graph of their own -executing the competency-question and SHACL checks live and reading the bidirectional coverage report that flags modelling gaps and stale assumptions. The result is a portable co-evolution environment for profile engineering, together with a reusable RTI application profile produced through it. A screencast of the demonstration is available at https://zenodo.org/records/22210609.
Read the full abstract
Astrophysics of Galaxies
Improving constraints on the Yukawa correction at the Galactic Center with multiple stellar orbits
We investigate the presence of a Yukawa-like correction ($\propto \, \alpha e^{- r/\lambda}$) to Newtonian gravity at the Galactic Center, using a multi-star fitting code, including the newly discovered star S$301$, to improve the constraints obtained using S$2$ orbit alone. We perform a Markov Chain Monte Carlo analysis using the astrometric and spectroscopic data of stars S$2$, S$55$, S$29$, S$38$ and S$301$ collected by GRAVITY, GRAVITY$^+$, NACO and SINFONI instruments, covering the period from $1992$ to $2025$. Compared to GRAVITY Collaboration 2025 (Paper I), in which only S$2$ was fitted, the tightest bound on the Yukawa coupling is again reached at $\lambda = 3\cdot10^{13}\,\rm m\ (\sim 200\,AU)$, where we find $|\alpha| < 6 \cdot10^{-4}$, an improvement of roughly a factor five. The addition of S$301$ extends the constraint to short ranges that were inaccessible to S$2$, yielding $|\alpha| < 0.004$ at $\lambda =10^{12}\,\rm m$ and $|\alpha| < 0.006$ at $\lambda =5\cdot 10^{11}\,\rm m$, while S$29$, with its larger apoapsis, gives $|\alpha| < 0.1$ at $\lambda \sim 2\cdot10^{15}\,\rm m$. The latter two represent the tightest limits at these scale lengths on a Yukawa correction obtained to date around a supermassive black hole.
Read the full abstract
Number Theory
A pencil of quadratic forms in nine variables with no member of Witt index four
We exhibit an explicit pair $(A,B)$ of integral symmetric $9\times9$ matrices, defining a nonsingular pair of quadratic forms over $\mathbb{Q}$, such that no member of the rational pencil $\lambda q_A+\mu q_B$ has Witt index $4$ over $\mathbb{Q}$. This refutes a conjecture from \cite{Que16a}, which predicted that every nonsingular pair in $n$ variables generates a pencil containing a form of Witt index $\lceil (n-1)/2\rceil$. The obstruction is purely $2$-adic and affects the whole pencil at once: every member has Witt index exactly $3$ over $\mathbb{Q}_2$. The proof is finite and elementary: a parity argument on $\det(\lambda A+\mu B)$, a congruence lemma reducing $\mathbb{P}^1(\mathbb{Q}_2)$ to the twelve classes of $\mathbb{P}^1(\mathbb{Z}/8)$, and a verification at each class, in which the anisotropy verdict is certified in two independent ways. All scripts are provided in the GitHub repository.
Read the full abstract
Statistics Theory
Statistical Inference for Persistence Diagrams via Landmark Embeddings: Minimax Theory and Finite Approximation
Hilbert-space embeddings enable inference for populations of persistence diagrams, but separation between individual diagrams need not survive population averaging. We develop a framework for inference on population mean embeddings, with particular attention to the additive landmark representations PLACE and PALACE. Treating each diagram as one independent observation, we apply Hilbert-space limit theory to obtain covariance estimators, two-sample tests, and confidence balls under suitable moment conditions, without requiring a lower-distortion bound. For additive embeddings, we identify the population mean as an embedding of the mean counting measure and show that geometric separation of these measures alone cannot guarantee uniform testing power. We then introduce a model with latent template diagrams, missing features, and location perturbations. Under common or feature-specific prevalence conditions, a diagram-level lower-distortion certificate yields explicit lower bounds on population mean separation. These margins provide finite-sample uniform power guarantees, and an additional information-divergence comparison gives matching sample-complexity bounds over restricted scale ranges. Confidence sets yield lower bounds on transport separation of population mean measures and exclusion guarantees for specified structured alternatives. We also quantify how orthogonal truncation changes the certified signal and the approximation allowance needed for confidence sets targeting the full embedding, relating sample size, retained coordinates, and template separation. Simulations examine calibration, power, and coverage, and an analysis of resting-state connectivity from the Autism Brain Imaging Data Exchange illustrates the procedures.
Read the full abstract
Systems and Control
Online Constrained Control of Storage Systems via Simplex Disturbance-Action Policies
We study online control of a scalar storage system with nonnegative adversarial resource arrivals and state-dependent action constraints. The adversarial, time-varying cost depends on both state and action. At each time, the controller selects a feasible action before the current resource arrival and cost are revealed. To handle the coupling between feasibility and online learning, we introduce Simplex Disturbance-Action Control (SDAC), whose policies have $H$ nonnegative parameters summing to at most one. Every fixed SDAC policy is feasible by construction. Our online SDAC controller updates these parameters using entropic online mirror descent while preserving feasibility along the time-varying trajectory. We prove a regret bound of $O\!\left(\sqrt{T\log(H+1)}\right)$ relative to the best fixed SDAC policy and a minimax lower bound showing that the dependence on $T$ is tight. We also introduce infinite-memory SDAC policies, which include every feasible fixed-fraction policy. SDAC policies approximate this class with an error that decreases geometrically with $H$. For a suitable choice $H=\Theta(\log T)$, the resulting regret against infinite-memory SDAC policies is $O\!\left(\sqrt{T\log\log T}\right)$. The framework applies to energy-harvesting batteries and other storage-constrained resource systems.
Read the full abstract
Machine Learning
Emergent Charging Coordination in Electric Delivery Fleets
In electric delivery fleets, mid-shift charging is non-trivial: each vehicle must decide when, where and how much to charge to finish on time with battery above a safety floor. The choices are coupled: queues build where too many vehicles pick the same station. Prior work resolves this coupling with central dispatching, precomputed schedules or reservations, machinery that charging infrastructure rarely supports. Instead, we use a family of learning agents under purely local control: every vehicle runs the same policy, deciding alone from its time budgets and broadcast station occupancies, leading to emergent coordination without central control or messaging. We validate this paradigm in simulation on real OpenStreetMap networks of twenty cities, each with a frozen scenario calibrated by an omniscient Oracle (99.5% of shifts completed on time), whereas a naive greedy rule (nearest station on low battery) completes just 73%. Agents trained with neuroevolution (NEAT) and policy gradients (PPO) on four cities and deployed zero-shot across all twenty, sixteen never seen in training, complete 96.8% and 98.6% of shifts, with the policy-gradient controllers proving more robust when demand or vehicle characteristics drift beyond the trained regime. In contrast, tuned threshold heuristics that read vehicle urgency alone fall short in contended cities (~80%). Through training, these learning agents rediscover partial charging and short opportunistic sessions, and route around busy stations, cutting per-session queue waits from about 45 minutes to under 2. In summary, this coordination paradigm balances local urgency against public occupancy, reaching near-Oracle performance at minimal implementation cost.
Read the full abstract
Sound
Silent Metronome: Rhythmic Grounding for Live Music Accompaniment
Live accompaniment models generate music for an incoming audio stream, committing to each output frame before hearing what comes next. In this strictly causal setting the model must infer tempo, meter, and metrical phase from its own imperfect past, whereby compounding errors quickly become audible as rhythmic drift. Put simply, the model has ears but no temporal reference, so when the ears hear imperfect, ambiguous music, the model will produce a flawed output. We propose Silent Metronome (SiMe), which gives it the temporal reference, encoding the phase within the beat and within the bar as periodic functions, pairing them with tempo and time signature, and supplying the result as a separate conditioning channel. Because this reference is independent of the generated audio, it cannot drift. Complementary auxiliary heads shape the latent representation, including a novel head that predicts the model's own future tokens. With the metrical signal taken from ground-truth annotations, beat alignment improves by a factor of 3.2 over the strictly causal baseline and surpasses a non-causal reference granted a full second of look-ahead. Coherence between input and accompaniment stays within a single point of that reference. These results suggest that streaming accompaniment systems should treat rhythm as a signal to be shared, as human ensembles do, rather than inferred.
Read the full abstract
Computation and Language
Perspectives on Cross-Lingual Consistency in LLMs for Medical Questions
Should multilingual LLMs answer medical questions consistently across input languages, or adapt responses to cultural cues? Existing multilingual medical benchmarks usually assume that medically correct answers should remain consistent across languages and treat cross-lingual variation as model error. In contrast, cultural adaptation research argues that appropriate medical answers may legitimately differ across contexts. We review the multilingual medical NLP literature through these two perspectives, we identify three gaps: limited stakeholder perspectives (e.g., of medical professionals), a lack of empirical evidence on which approach better serves users, and no benchmarks capable of distinguishing universally correct from culture-specific cases. To address the first gap, we survey 356 participants across three stakeholder groups (medical, NLP, and anthropology professionals) in three countries (Germany, Spain, and the United States). Anthropologists consistently favor adaptation, while medical and NLP respondents remain divided, with notable divergence between U.S. and European medical professionals. LLMs prompted with profession and country personas fail to reproduce this variation, overestimating cross-lingual consistency preference among NLP and medical personas. We conclude that neither consistency nor adaptation can currently be considered clearly preferable, highlighting the need for empirical evidence on which approach better serves users across cultural contexts.
Read the full abstract
Instrumentation and Methods for Astrophysics
Approximating the statistics of a gravitational wave background
The astrophysical origin of the gravitational wave background (GWB) reported by pulsar timing array (PTA) collaborations has yet to be confirmed. A GWB signal made of the sum of individual gravitational wave (GW) from the population of supermassive black hole binaries (SMBHB) would show the imprint of a discrete Poissonian statistics in its spectral properties. In this work, we propose a tool based on the saddlepoint approximation method to estimate the distribution of characteristic strain for any given population model. This tool can be used for Bayesian inference or for a quick visualization of the statistics of the GWB from the output of more realistic semi-analytical models. We introduce the general family of variance mixture Gaussian distributions that models heavy-tailed behavior distributions that is expected for a non-Gaussian GWB signal. We show that setting the correct hierarchical priors to a Gaussian free spectrum PTA likelihood is effectively equivalent to a non-Gaussian likelihood. Using ideal simulations, we compare the performance of the saddlepoint approximation with a log-Normal distribution to infer the parameters of the astrophysical model from the statistics of the GWB and show that correctly modeling higher order moments is essential. Future PTA analyses should include the statistics of the GWB in their pipelines.
Read the full abstract
Computer Vision
CrowdTraj: A Benchmark for Dense Crowd Trajectory Prediction in Realistic Crowded Environments
In real-world applications, pedestrian trajectory prediction models rely on inputs from detection and tracking systems. Prior trajectory prediction benchmarks either contain relatively sparse pedestrian interactions, assume perfect tracking inputs, or rely on overhead viewpoints that minimize occlusion and perspective distortion, limiting evaluation in realistic dense-crowd scenarios. We present CrowdTraj, a benchmark for pedestrian trajectory prediction in natural dense crowd scenes. Unlike previous datasets, CrowdTraj supports end-to-end evaluation from detection through tracking to trajectory prediction under severe occlusion in CCTV views. It also captures diverse, natural pedestrian behaviours, including abrupt directional changes rarely observed in existing benchmarks. CrowdTraj includes five diverse scenes, with an average of 1,146 unique pedestrians per scene, maximum frame-level densities ranging from 114 to 372 pedestrians, and over 3.2 million annotated head bounding boxes. CrowdTraj provides pixel and real-world coordinates via per-scene homography matrices for physically meaningful analysis. Our experimental results show that tracking accuracy (IDF1) drops to 0.68 to 0.70 in the densest scenes, compared with approximately 0.90 in less crowded scenes. Trajectory prediction training also becomes substantially more computationally expensive in dense scenes, with training times increasing by up to 8 times. These findings show that CrowdTraj exposes limitations in current trajectory prediction pipelines that remain hidden on existing sparse-crowd benchmarks, particularly in robustness to tracking noise and computational scalability.
Read the full abstract
Applied Physics
Quantum Sensing for Spatial Spin Noise Mapping via Nitrogen-Vacancy Magnetic Quenching in Diamond
Detecting and mapping spin noise can reveal spatial variations in surface defect states, catalytic residues, free radicals, and spintronic materials. However, bulk measurements average over spatial heterogeneity, while scanning-probe maps require sequential rastering. Here, we demonstrate a microwave-free magnetic quenching (MQ) method for wide-field spin-noise mapping using nitrogen-vacancy (NV) centres in diamond. The protocol combines continuous LED illumination with a low-frequency, amplitude-modulated magnetic field, avoiding resonant microwave delivery or pulsed optical hardware. Field-induced spin-state mixing reduces NV photoluminescence, providing the primary contrast mechanism. We examine the response as a function of optical power and magnetic modulation amplitude, interpreting the results using a spin-state mixing model. The method is validated with aqueous gadobutrol concentration series, showing trends consistent with optically detected magnetic resonance (ODMR) measurements. We map spin-noise variations across boron nitride and single-walled carbon nanotube samples with differing defect and metallic catalyst contributions, supported by electron microscopy and spectroscopy. Notably, MQ detects a spin-noise response in boron nitride nanotubes that is silent in bulk EPR spectroscopy. This approach provides a practical framework for spatially resolved spin-noise sensing across quantum technologies and advanced functional materials.
Read the full abstract
Statistical Methodology
Modeling Brain MRI Using Persistent Homology and Multilevel Functional Data Analysis
Persistent homology provides a multiscale representation of biomedical images by capturing higher-order topological features that reflect their underlying structural organization. However, the resulting topological summaries are typically used as predictors or features for classification and group comparisons rather than treated as primary variables of interest. We construct a generalized multilevel functional framework for analyzing persistent-homology summaries as longitudinal functional responses in repeated three-dimensional structural magnetic resonance imaging (MRI). Specifically, we represent topological features using Betti curves and model these curves as count-valued functional responses. A negative-binomial distribution accommodates the discrete and potentially overdispersed nature of Betti counts, while the multilevel formulation accounts for the dependence induced by repeated measurements and separates between-subject and within-subject sources of functional variation. Functional principal component analysis further evaluates the dominant modes of variation at each level. A Bayesian approach is used for joint estimation of the functional regression and multilevel functional principal components. We apply this modeling framework to longitudinal structural MRI data from the OASIS-2 study to investigate associations between brain topology and demographic and clinical characteristics, including age, gender, follow-up time, and dementia severity. The results demonstrate that the framework can capture covariate-associated variation across the filtration continuum while evaluating distinct sources and patterns of longitudinal variation across homology dimensions.
Read the full abstract
Theoretical Economics
Very Justified Envy
This paper studies the intensity of priority violations in matching markets. An agent is said to have very justified envy if she prefers another agent's match to her own and her priority advantage for the object exceeds $k$ ranks. I show that unless $k$ is prohibitively large, Pareto efficiency is incompatible with the elimination of very justified envy. A simple generalization of Deferred Acceptance and Immediate Acceptance is shown to eliminate very justified envy for any $k$. In simulations of random matching markets, I find that modest relaxations to justified envy can yield significant improvements in assignment ranks.
Read the full abstract
Machine Learning
On the Recall Scaling Laws in Mamba: A Theoretical and Mechanistic Study via Hashing
Associative Recall (AR) is the cognitive ability to learn and retrieve links between items in memory. In NLP, AR is used as a benchmark for evaluating the in-context memory capacity of architectures such as Mamba, and has been found to strongly correlate with language modeling performance. This paper explores AR from the perspective of mechanistic interpretability, aiming to reverse-engineer the exact internal algorithm used by Mamba to perform recall. Our key insight is that Mamba performs recall by implicitly learning linear hash functions, and we identify the low-level circuit that enables this behavior. Building on these findings and inspired by theoretical tools in similarity-preserving hashing, such as the Johnson-Lindenstrauss lemma, we develop a theoretical framework for analyzing AR, which we term Recall Scaling Laws. Given the vocabulary size and the number of facts in context, this framework allows us to (1) predict the embedding and state dimensions required for Mamba to achieve perfect recall, (2) predict recall success probability given the model dimensions, and (3) analyze multi-layer models and multi-head SSM patterns. Empirical results show that our theoretical findings are accurate and predictive, offering insights into how AR capacity scales with vocabulary, state, embedding size, and architecture.
Read the full abstract
Multiagent Systems
Audit Without Verification: When LLM Accountability Layers Relay Rather Than Check
Multi-agent LLM pipelines increasingly span organisational boundaries; when a fault surfaces, someone must determine where it entered. The artifact available is rarely a full execution trace: it is the reports each agent filed, and a filed report can state a conclusion alongside its observations. Using a pre-registered, institutionally partitioned pipeline of six agents with process-level information boundaries, balanced defect injection and matched clean twins (345,600 requests per chain model, two models), we first report that our pre-registered hypothesis – that collective responsibility framing degrades escalation with chain length – is not supported. The layer nevertheless fails asymmetrically. It originates almost nothing: zero allegations across 7,996 clean episodes where every agent stayed silent. It filters upstream error poorly, naming an innocent party in 34.4% and 62.6% of clean episodes where an agent raised a false alarm. Conditional on no agent proposing the true origin (59.5% of episodes on one chain model), an auditor reading the reports recovers it in 4.1% of cases – below a uniform guess (20%) and the best fixed-link accuser (31.0%) – while reaching 60.3% from the raw documentation of the same episodes. Deleting one clause, the field carrying the agents' own conclusion, isolates the cause at constant observations: accuracy rises to 45.2% (+41.2 pp, 95% CI +35.3 to +46.9) and adherence collapses from 94.4% to 3.4%; where the suggestion was correct the same deletion instead costs accuracy, 70.5% to 55.7%. The harm replicates on two frontier auditors in four conditions out of four (+8.5 to +39.0 pp) and in a second domain (+47.7 and +61.1 pp), where the cost disappears. The net effect is governed by upstream reliability together with both conditional magnitudes. An accountability layer needs evidence sufficiently independent of the conclusions it verifies.
Read the full abstract
Computational Engineering
Buildability Assessment of 3D-Printed Concrete Structures Using Smoothed Mohr-Coulomb Plasticity with Isotropic Hardening
Extrusion-based 3D concrete printing builds structural elements layer upon layer without formwork, so freshly deposited material must carry the growing weight of the structure while it is still gaining strength and stiffness. The largest number of layers that can be printed before failure, the buildability, is therefore central to process design. Its prediction rests above all on how accurately the constitutive model represents fresh concrete. Existing finite element frameworks pair gradual pre-failure hardening only with smooth yield surfaces, which leaves the Mohr-Coulomb surface that best describes fresh concrete restricted to perfect plasticity. This work combines a smoothed Mohr-Coulomb yield surface with nonlinear isotropic hardening of the cohesion, formulated in an updated Lagrangian setting with an activation field for layer deposition. Failure is identified from a tangent-stiffness eigenvalue criterion that matches the analytical self-weight buckling load of a slender wall and is insensitive to geometric imperfection. The framework reproduces the measured collapse of a printed straight wall within one layer and predicts the collapse of a hollow cylinder closer to experiment than existing frameworks. A study over six diameters and six hardening rates shows buildability peaking at intermediate diameters and rising with the hardening rate. Recording how much of its strength the material has used at failure, slender cylinders fail with much still in reserve while intermediate ones use nearly all of it. The two failure modes are therefore identified as the limits of one process rather than separate failure mechanisms.
Read the full abstract
Classical Analysis and ODEs
Piñeiro mixed orthogonal polynomials and bidiagonal factorization
We study mixed multiple orthogonal polynomials associated with rank-one matrices of measures and their recurrence relations. On the step line we identify the corresponding banded recurrence matrix through the Gauss–Borel factorization of the moment matrix. Elementary Christoffel transformations lead to a factorization of this recurrence matrix into lower and upper bidiagonal factors. For the mixed Piñeiro system we derive contour-integral and generalized hypergeometric representations and formulas for the recurrence and factorization coefficients.
Read the full abstract
Group Theory
On Natural Groups
A group (G,*) is natural if its group operation is uniquely determined by a metric structure (G,d) on G in the following sense: every group structure (G,.) for which all right translations are isometries of (G,d) must be isomorphic to (G,*). Examples included all connected Lie groups or all groups generated by involutions (Sutherland). The orientation rigidity theorem of Leemann and de la Salle allows to upgrade the non-abelian structure theorem: every non-abelian group of cardinality not larger than the continuum that is not generalized dicyclic is natural. A consequence is that all non-metabelian Lie groups, all simple group of cardinality not larger then the continuum, all homeomorphism-, diffeomorphism -or symplectomorphism groups of manifolds, or automorphism groups probability spaces or non-abelian crystallographic groups are natural. Also the abelian structure theorem is extended: affine rigidity of Jarosz, together with Mazur-Ulam's theorem implies that the additive group of every real or complex vector spaces is natural and that all connected abelian Banach Lie groups are natural. A theorem of Babai implies that every Boolean group is natural for every cardinality. Undecided is whether C_p^k is natural for cardinals k>c and odd prime p, and whether the additive group of any field F is natural, or whether the cardinality assumption in the non-abelian structure theorem is needed. A major question is whether G^2=G implies that G is natural. This is already open for abelian groups: does 2G=G imply that G is natural?
Read the full abstract
Probability
Chain rule symmetry for singular SPDEs from multi-indices to decorated trees
In these lecture notes, we review the recent results around the chain rule for the generalised KPZ equation and the geometric KPZ equation. We introduce the main ideas of Regularity Structures via a B-series type expansion and the two main combinatorial sets for encoding this expansion: decorated trees and multi-indices. Then, we explain how the chain rule was first understood via integration by parts and diagrammatic computations. For the generalised KPZ equation, a scalar-valued equation, we use multi-indices to derive a characterisation in terms of iterations of covariant derivatives. The same characterisation for decorated trees is more involved and requires the use of operadic and homological tools. We summarise the main arguments of this proof.
Read the full abstract
Computational Engineering
Your Agent Says Yes: Interpreting Adversarial Market Behavior Beyond Individual Transactions
Transaction-local controls answer whether one financial request may proceed, but market behavior can be distributed across messages, agents, assets, and time. We study this interpretation gap in a virtual exchange populated by ten role-conditioned language-model agents. The agents communicate, trade reference assets and futures, launch tokens, and manage concentrated-liquidity pools under prescriptive adversarial roles. We analyze eight 72-cycle trajectories across two time-blinded hourly replay paths, with a runner-side wallet policy enabled or disabled. The retained artifacts connect generated outgoing messages, policy events, balances, positions, and cycle-end market state. A focal reconstruction shows a launch–promotion–exit scenario realized across private coordination, public claims, follower positioning, repeatedly withheld exits, and a later non-blocking request aligned with a token balance change. Across policy-enabled runs, the gate withholds direct requests selectively; most policy-categorized candidates are flagged rather than blocked, while the surrounding interaction can continue. Repeated runs also show that category-level and within-trajectory relations can recur even when normalized score-change rankings do not. These findings motivate agent-behavior evaluation that links communication, authorization, and evolving state instead of treating individual transaction verdicts as complete safety judgments.
Read the full abstract
Quantum Physics
Dynamical Crossover of the Quantum Fisher Information in the Spin-Boson Model
We investigate the dynamical quantum Fisher information of a two-level system coupled to a bosonic environment, focusing on the estimation of the qubit gap. We combine analytical calculations with numerically controlled matrix-product-state simulations. In the exactly solvable pure-dephasing Ohmic regime at zero temperature, the long-time quantum Fisher information displays a coupling-dependent algebraic behavior, leading to a dynamical crossover: it grows without bound at weak coupling, approaches a finite asymptotic value at the crossover coupling, and vanishes at strong coupling. At finite temperature, thermal fluctuations suppress the long-time growth and generate a finite-time maximum, whose dependence on the dephasing coupling retains a clear signa- ture of the zero-temperature crossover. We show that this crossover is absent at zero temperature in non-Ohmic baths: the long-time quantum Fisher information vanishes in the sub-Ohmic and diverges in the super-Ohmic regimes. At non-zero temperature instead, the crossover appears for a super-Ohmic quadratic bath and the crossover coupling becomes temperature-dependent. Moreover, in the zero-temperature Ohmic regime, we introduce an additional amplitude-damping system-bath coupling that induces energy relaxation. This relaxation channel replaces the unbounded long-time growth with a finite asymptotic quantum Fisher information associated with the reduced interacting ground state, while a signature of the pure-dephasing crossover persists in the early-time dynamics. These results establish a direct connection between the low-frequency structure of the bath and the asymptotic metrological behavior of dynamical gap sensing, and show how thermal fluctuations and energy relaxation regularize the ideal pure-dephasing dynamical crossover of the quantum Fisher information.
Read the full abstract
Digital Libraries
From Citations to Contributions: LLM-Assisted Credit Scoring of Research Articles
Citation-based measures of scientific influence typically treat citations as uniform signals, ignoring the different roles that cited works play in a paper's contribution. We introduce contribution-based credit scoring for research articles: a structured citation analysis that decomposes a paper's credit between its own original contribution and the prior work it builds on. Motivated by a cooperative-game view of scientific credit, we propose the contribution tree, a hierarchical framework that conserves importance across the document structure and separates original from citation-derived contribution. To make this framework scalable, we use LLMs as noisy comparative estimators of local importance. We further extend the model to article collections by propagating contributions through weighted citation graphs, yielding corpus-level contributions and normalized influence scores. Our experiments suggest that our framework captures contribution signals beyond surface-level heuristics. Our code is available at https://github.com/sanaebrahimi/Importance_Scoring/
Read the full abstract
Artificial Intelligence
Aegix Pulse: A Traceable Three-Stage Architecture for Personalized Content Generation and Context-Preserving Revision
Production content-generation systems must integrate a user's immediate task, long-term brand identity, historical evidence, and revision feedback. We present Aegix Pulse, a production-oriented three-stage architecture that separates current-task clarification and Task Persona finalization, long-term Account Profile (Brand DNA) assembly, and controlled generation and revision while preserving provenance across content versions. We evaluate four preregistered claims using 96 synthetic social-media generation tasks. Four initial-generation conditions progressively introduced a Task Persona, Account Profile, and successful-history style evidence, while two revision conditions compared plain and context-preserving revision. The experiment produced 480 completed generation records and 1,440 blinded LLM-Judge evaluations, supplemented by human review. Adding the Account Profile increased mean brand-consistency scores by 0.1562 points on a five-point scale compared with Task Persona alone (Holm-adjusted p=.1224). Preserving task and brand context during revision increased mean task-preservation scores by 0.2917 points compared with plain revision (Holm-adjusted p=.2432). Neither improvement was statistically conclusive after multiple-comparison correction. Task Persona alone showed a small observed effect, while successful-history evidence provided no additional improvement in brand consistency under the current setting. Human validation did not consistently reproduce the LLM-Judge effect directions and showed low inter-reviewer agreement. These findings provide preliminary evidence for persistent brand context and context-preserving revision while identifying priorities for stronger evidence processing and evaluation.