Artificial Intelligence
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Saturday 5 September
We introduce ABLE, a benchmark for evaluating LLM agents' ability to use biological AI models (BAIMs), such as ProteinMPNN and AlphaFold3, in dual-use protein design workflows. ABLE assesses agent performance through a set of tasks spanning structure retrieval, sequence generation, and design validation. We evaluate 15 frontier models and find that seven refuse all tasks, while the remaining models exhibit substantial performance differences. Claude Sonnet 4 and Gemini 3 Pro achieve the highest scores across information retrieval, tool selection, and tool use. We further compare model performance on a subset of tasks against an expert human baseline. Our results suggest that current LLMs can substantially lower barriers to protein design, but remain inconsistent in planning, strategy generation, and integrating biological knowledge with tool use.
Statistical Methodology
Bayesian spatiotemporal conditional autoregressive model for local temporal variations
Spatiotemporal areal data are commonly observed in various fields such including epidemiology, social science, economics and so on. To capture both spatial trends and temporal trends, spatiotemporal modeling is often employed, and the conditional autoregressive (CAR) model is one of the most widely used approaches for modeling areal data. This paper proposes a new framework for estimating spatiotemporal trends based on the CAR model. The proposed method provides locally adaptive temporal smoothing while yielding interpretable temporal trends by effectively utilizing information from both spatially neighboring areas and temporally adjacent time points. We also develop a Gibbs sampling algorithm and demonstrate the ability of the proposed method to adapt to to local temporal changes through numerical examples.
Read the full abstract
Computer Vision
CoRe-SAM3: Conditional Semantic–Visual Reconciliation for SAM3 Crack Segmentation
Crack segmentation requires a model to recognize target semantics while accurately recovering thin, low-contrast, and topologically continuous local structures. Although SAM3 provides strong open-concept segmentation, its direct application to the crack domain still misses weak cracks, activates crack-like background regions, and produces local boundary errors. We first diagnose the functional differences between the internal prompt-conditioned semantic representation and native visual representation of SAM3 on five crack datasets. The results show that the semantic representation already carries most task information for crack prediction, whereas the utility of the visual representation depends on the current semantic state. Directly combining the two representations does not yield consistent gains. Based on this finding, we propose Conditional Semantic–Visual Reconciliation, termed CoRe. CoRe retains semantic prediction as the primary decision path, applies lightweight semantic calibration to adjust the target-domain decision mapping, and uses spatially aligned native visual evidence to generate a zero-initialized, bounded, and regularized conditional residual that selectively corrects existing predictions. Across five domains, CoRe-SAM3 improves the average Crack IoU from 62.34% to 70.47% and clDice from 81.98% to 89.24%, while introducing only 18.914 K trainable parameters. Prediction-transition analysis further shows that CoRe corrects an average of 34.38% of native errors, with a damage rate of only 0.23% on pixels correctly classified by native SAM3. These results demonstrate that constrained prediction correction based on the functional differences between internal representations provides an effective and parameter-efficient target-domain adaptation strategy for vision foundation models with strong task-specific semantic priors.
Read the full abstract
Nuclear Theory
Theoretical Review on Bulk Properties and Light/Strange Hadron Production in Heavy-Ion Collisions
Since the discovery of large elliptic flow at RHIC in the early 2000s, relativistic hydrodynamics has become a central framework for quantitative studies of the quark–gluon plasma (QGP). In parallel, increasingly sophisticated analyses have improved constraints on the initial state and the transport properties of the QGP. In this contribution, I overview the recent progress on bulk-property of QGP and light/strange hadron production.
Read the full abstract
Quantum Physics
Towards Continuous Profiling and Optimization of Quantum-Classical Pipelines
Quantum applications increasingly execute as multi-stage quantum-classical pipelines, interleaving QPU computation with classical stages like circuit generation, transpilation, layout mapping, quantum error mitigation (QEM), and post-processing. These stages have diverse resource requirements and exhibit stochastic behavior under drifting hardware noises, yet existing workflow frameworks treat them as static, isolated components. We present LLQM (Low-Level Quantum Machine), a profiling-driven meta-framework for quantum-classical pipelines. LLQM decomposes pipelines into fine-grained tasks and continuously profiles their CPU/GPU, memory, QPU, and queue dependencies alongside real-time hardware states. This unified runtime abstraction captures cross-stage resource dependencies and reveals how classical and quantum decisions interact, enabling characterization of their impact on fidelity and resource consumption. We evaluate LLQM using QEM as a representative pipeline stage, on IBM 156-qubit Heron r2 processors with circuits up to 100 qubits and 1e7 transpiled gates. Our results show that continuous profiling exposes runtime bottlenecks and enables hardware-, fidelity-, and workload-aware optimizations.
Read the full abstract
Quantum Physics
Quantum Query Complexity of Persistence Statistics in Graph Zigzags
We study the query complexity of estimating scalar summaries of zigzag bar lifetimes from snapshot-adjacency bits. For graphs $G_1,\ldots,G_m$ on $n$ labeled vertices, let $\ell_b$ be the snapshot lifetime of a degree-one bar $b$ of the intersection zigzag. For a probability generating function $\phi(x)=\mathbb{E}[x^R]$, the statistic $F_\phi=\sum_b\phi(\ell_b/m)$ includes normalized degree-$r$ total persistence and the mean generalized rank over a uniform time window. An exact identity underlies our algorithm: sample $R$ uniform times; the expected generalized rank between their minimum and maximum equals $F_\phi$. For graphs that rank is the circuit rank of an intersection graph, so a nonlinear barcode functional becomes an average of edge and component counts, and no barcode is computed. Without spectral-gap, homology-state, or QRAM assumptions, this gives a quantum estimator with additive error $\varepsilon n$ and $\widetilde O(\sqrt{m(K+n)}/\varepsilon)$ queries when a bound $K\ge F_\phi$ is supplied, against $\widetilde O(m\min\{n^2,(K+n)/\varepsilon^2\})$ classically, and an adaptive quantum variant with the same instance dependence. These estimators are optimal in two regimes. For every fixed power weight $x^r$, $r\ge2$, and for the uniform-window mean, the worst-case complexities are $\widetilde\Theta(n\sqrt m/\varepsilon)$ quantum and $\Theta(n^2m)$ classical. On sparse instances, under an explicit split-leakage promise met by power and binomial weights of logarithmic degree and the promise $F_\phi\le K$, they are $\widetilde\Theta(\sqrt{mK}/\varepsilon)$ and $\widetilde\Theta(m\min\{n^2,K/\varepsilon^2\})$. The classical lower bounds hold against fully adaptive algorithms, and fewer than $m$ such statistics cannot determine the positive-lifetime histogram. All bounds concern snapshot access; with an explicit update stream, near-linear full-barcode algorithms are known.
Read the full abstract
Quantum Physics
Quantum Query Algorithms for the Constructive Diagonal Ramsey Theorem
The constructive diagonal Ramsey problem asks, given adjacency-oracle access to an $N$-vertex graph, for a clique or independent set of the order guaranteed by Ramsey's theorem. We give a bounded-error quantum algorithm that, for every $K\ge2$ and $N\ge4^{K-1}$, finds and verifies a homogeneous $K$-set using $O\!\left(2^K K\log\frac K\eta\right)$ edge queries with failure probability at most $\eta$. At the Ramsey scale $N=2^n$, this yields a homogeneous set of order $\lfloor n/2\rfloor+1$ using $O(\sqrt N\log N\log(\log N/\eta))$ queries, improving on the $O(N)$ queries of the explicit classical recursion and giving, to our knowledge, the first sublinear worst-case algorithm for the Ramsey relation. We also derive an $\Omega(N^{1/12})$ quantum lower bound by a reduction from collision finding. The algorithm runs the constructive recursion over implicit candidate sets. Each set is represented by a short conjunction of adjacency constraints and sampled using capped unknown-solution quantum search, and a scale-aware concentration schedule balances estimation accuracy against the increasing cost of sampling deeper sets. We complement the upper bound with an $\Omega(N^{1-1/\sqrt2})$ randomized lower bound, transported from the random-Painter analysis of online Ramsey numbers, which holds on the uniform distribution $G(N,1/2)$. On that distribution a greedy quantum search uses only $\widetilde O(N^{1/4})$ queries, giving a provable polynomial quantum speedup for Ramsey search on random graphs. We also give an estimation-free size-biased recursion and extend it to every fixed number of edge colours.
Read the full abstract
Signal Processing
Wideband HF Skywave Propagation: A Review with Link Modeling Corroborated by Propagation Data
The high-frequency (HF) band, ranging from 3 to 30 MHz, is widely used in a number of applications such as beyond-line-of-sight (BLOS) communications and over-the-horizon radar systems. The long-range propagation characteristics of the HF band rely on the Earth's ionosphere as a refracting medium to establish BLOS wireless links. However, traditional HF communications links often use channels with narrow bandwidths (typically 3 kHz), which limits the amount of data that can be transmitted. In this perspective article, we discuss the challenges of establishing wideband HF communications links with emphasis on the ionosphere, noise characteristics, antenna performance, and available bandwidth. Solar radiation drives ionospheric layering, where fluctuating electron densities determine usable frequencies that change with time of day, seasons, and latitude. Since background noise at HF decreases with increasing frequency, operating at the upper HF limit is advantageous. We present a noise prediction model following ITU Recommendation P.372-17 and highlight the role of high-directivity antennas such as Log-Periodic Dipole Arrays, in optimizing the signal-to-noise ratio of the link. Using ray tracing techniques, we model several representative wideband HF links that employ near-vertical-incidence skywave (NVIS) or long-range skywave modes over distances ranging from approximately 390 to 5,200 km. We examine the performance of these links for bandwidths up to 1 MHz and present their day and night ionograms, with transmitter and receiver locations spanning near-equatorial to high northern latitudes. The modeled maximum usable frequencies are corroborated against crowdsourced FT8 reception data and direct ionosonde measurements over the same period for links for which propagation data was available.
Read the full abstract
Number Theory
Primes with Restricted-Digit Differences
Fix a base $b\ge2$ and a digit set $\mathcal{D}\subset\{0,1,\dots,b-1\}$, and let $\mathcal C_k$ be the set of integers in $[0,b^k)$ whose $k$ base-$b$ digits all lie in $\mathcal D$. We study prime pairs and three-term arithmetic progressions in primes whose difference, or common difference, belongs to $\mathcal C_k$. Under a natural digit non-resonance condition, we establish a localized Fourier criterion guaranteeing asymptotic formulae with explicit leading constants for both problems. Using a transfer-operator argument, we verify this criterion in explicit parameter ranges for several natural families of digit sets.
Read the full abstract
History and Philosophy of Physics
Lorenz vs Lorentz. The controversy examined from the original texts
The attribution of the condition div A + (1/c^2) dPhi/dt = 0 has been under discussion since 1938 as a question of priority between Ludvig Lorenz and Hendrik Lorentz. This work argues that the problem is of a different nature, and that the discussion does not close because it has never been specified what is being attributed. Drawing on the three versions of the 1867 paper and on six further primary sources, it is documented that three separable acts have been designated under a single name: the obtaining of the relation between potentials, its imposition as a restriction on the admissible potentials, and its denomination as a gauge. It is further documented that in none of the three versions of the 1867 paper does the word potential appear, that the magnetic field does not figure in it as a quantity of the theory, and that the vocabulary in which that paper is described today enters the literature after it was written. It is concluded that the disjunction between the two denominations, posed without specifying which of the three acts is being attributed, is ill formed.
Read the full abstract
Optics
Physical policy gradient theorem for in situ stochastic-adjoint training
In situ adjoint training extracts parameter gradients directly from measurement, but has so far been limited to reciprocal or restricted systems. We introduce the physical counterpart of the policy gradient theorem: a stochastic-adjoint gradient estimator that lifts these constraints by trading reciprocity for nondegenerate diffusion. As validation, we train a nonlinear resonator network, whose own dynamics supply the policy, against antagonistic temporal modulations with gradients from measured stochastic trajectories alone, without finite differences or a separate adjoint experiment.
Read the full abstract
Computer Vision
MolParser-Mobile: Ultrafast OCSR System for Large-Scale Chemical Literature Mining
Optical Chemical Structure Recognition (OCSR) is a fundamental component of chemical literature mining, enabling molecular database construction, reaction extraction, and AI-driven scientific discovery. Despite substantial progress in recognition accuracy with recent deep learning-based methods, inference throughput remains a critical bottleneck that limits web-scale deployment. To address this challenge, we propose MolParser-Mobile, an AutoML-optimized lightweight end-to-end OCSR framework. MolParser-Mobile contains only 9.98M parameters, while reaching a throughput of 1,520 molecules per second on a single NVIDIA RTX 4090D GPU. Despite its compact design, it maintains competitive and, on several benchmarks, superior recognition accuracy.
Read the full abstract
Artificial Intelligence
Exposing Weaknesses in Emotion Recognition in Conversations
Emotion Recognition in Conversations (ERC) aims to identify speakers' emotions in multi-turn dialogue. Accurate emotion recognition can support a wide range of applications, including empathetic conversational agents, mental health support, and educational technologies. While many recent approaches rely on task-specific fine-tuning, such models may exploit dataset-specific cues. A central yet rarely questioned assumption in ERC is that each utterance can be assigned a single unambiguous emotion label. To investigate this assumption, we study ERC using Large Language Models (LLMs) in a zero-shot setting while incorporating preceding conversational turns as context. We show that aggregate metrics mask systematic failures. Errors concentrate around utterances containing negations, exclamations, and interjections. This pattern is consistent across all evaluated models, suggesting limitations in the benchmarks rather than model-specific weaknesses. A controlled re-annotation study involving four human annotators supports this finding: strong agreement is observed in only 35 percent of cases, with neutral utterances dominating high-agreement instances, while many emotional categories fall into low-agreement regimes. These findings suggest that many apparent model errors reflect genuine annotation ambiguity rather than poor emotion understanding. Standard single-label evaluation is therefore insufficient. To address this limitation, we introduce an LLM-as-Judge framework that evaluates each emotion independently according to its plausibility in the conversational context rather than enforcing a single-label decision.
Read the full abstract
General Mathematics
Odd square roots and the sum of element orders on Sn and An
For a finite group $G$ let $\psi(G)$ be the sum of the orders of its elements. The quotient $S_n/A_n$ has order two. Hence $\psi(S_n/A_n)=3$. The quantity to be compared with $\psi(S_n)$ is therefore $3\psi(A_n)$. Computation indicates that $3\psi(A_n)>\psi(S_n)$ for every $n\ge3$. We reduce this inequality to a question on the parity of square roots. Let $r(\beta)$ be the number of odd permutations $\sigma$ with $\sigma^{2}=\beta$. We show that the sum of the orders of the odd permutations equals $2\sum_{\beta\in A_n}r(\beta)o(\beta)$. We also show that $\sum_{\beta\in A_n}r(\beta)$ equals $|A_n|$. The inequality then says that $r$ and the order function are negatively correlated on $A_n$. It says equally that the average order of an odd permutation is less than twice the average order of an even one. We then rule out two natural approaches. No injection from the odd permutations into $A_n$ can halve the order at every point. The smallest failure occurs at $n=12$. A threshold argument through Landau's function fails as well. Computations up to $n=60$ are reported.
Read the full abstract
General Economics
Why China Succeeds: A Road to Prosperity
Why China Succeeds offers what no existing book does: a single, unified explanatory framework that traces China's rise from its ancient civilizational foundations to its twenty first century technological ascent. Rather than treating China's success as ideologically exceptional or historically accidental, it reveals the universal institutional logic (regulated social mobility, functional land and taxation systems, and formidable state capability) that has sustained Chinese governance across millennia and powered its modern economic miracle. The book directly challenges Western development orthodoxy by demonstrating that institutions can be built through growth, not before it. For policymakers, scholars, and development practitioners worldwide seeking transferable lessons from the world's most consequential development story, this book provides the most historically grounded, analytically rigorous, and forward-looking account available.
Read the full abstract
Networking
Comparative Performance of Graphene-Enabled Transmitarray Antenna and Reflectors for Wide-Angle Terahertz Beam Steering
This work compares a hemispherical graphene-based transmitarray antenna with its planar reflector counterpart for wide-angle beam steering in the THz regime. The theoretical framework of the planar reflector is formulated and numerically evaluated, yielding an elevation beam-steering range of \pm60{\deg}. In contrast, the transmitarray extends the elevation steering range to \pm78{\deg} while maintaining full 360{\deg} azimuthal coverage. The planar reflector exhibits a larger HPBW variation of 26.48{\deg}, compared with 13.1{\deg} for the transmitarray, resulting in a broader reflected-beam distribution and reduced directional power density, directivity, and gain. Meanwhile, the transmitarray maintains a more stable and controllable beamwidth response with greater directional power concentration over a wide steering range. The performance advantages of the transmitarray are demonstrated through comparisons with experimental results reported in the literature for planar reflectors and antennas. We further provide a comprehensive assessment of the performance advantages of the transmitarray over planar configurations across the remaining metrics.
Read the full abstract
Computation and Language
AtomCite: Verification and Correction of Supplied Page-Level Citations in Multi-Page Documents
Large language models answering questions over multi-page documents are expected to cite the supporting pages, yet supplied citations are sometimes inaccurate, and current evaluations score citations at generation time or against text passages: no existing benchmark evaluates whether a system can verify and correct a page-level citation already attached to an answer. We propose AtomCite, an agentic framework that parses an answer into claims, checks each claim against the image of its cited page, and applies a deterministic repair policy. To evaluate it, we introduce DocCite, to our knowledge the first benchmark for systems that verify and correct page-level citations in document images. Built on MP-DocVQA and DUDE, it combines 928 validated injected instances with 2,468 candidate natural errors harvested from frontier- and efficiency-tier models, of which a two-annotator audit confirms 1,909 as genuine errors. Primary labels are assigned deterministically, not by LLM judges, with the human audit as a separate validation layer. Across three model families (Gemini, Claude, and GPT), AtomCite reaches around 93% binary verification accuracy on the injected benchmark, significantly outperforming every OCR-only condition, including a compute-matched control, and exceeding every prior text-based baseline given the same OCR text. Its repair policy lifts citation precision on the injected mix from a constructed 34% to 87-90% while retaining over 90% of correct claims. AtomCite also transfers: with frozen prompts and zero training, it raises the hallucination-detection scores of two open 7-8B models on five public benchmarks above the same models prompted as direct judges. Finally, the audit shows that noise in automatic labels biases measured verifier accuracy and can reverse system rankings, so evaluations relying only on synthetic or automatic labels risk mismeasuring verification capability.
Read the full abstract
Artificial Intelligence
Evidence-Aligned Local Composition of Discrete Experts for Sequence Restoration
A document modeled as a discrete sequence of tokens can be thought of as being generated from a composition of texts from different domains; a README file, for example, moves between prose, code, and configuration. When such a document is corrupted and only frozen domain experts are available, restoring it requires deciding both what is missing and which expert to trust at each position, at test time and without region labels or a trained router. We introduce evidence-aligned local composition, which infers a soft, position-wise weighting over the experts from the marginal evidence of the corrupted observation under a given corruption model, estimating the evidence from the experts' own denoising losses and smoothing the weights across positions. Because the weighting is soft, it recovers a mixture when the true composition is mixed and concentrates on one expert when that suffices. Across a categorical simulator, byte-level experts, and experts fine-tuned from a $1.3$B discrete flow-matching model, the inferred weights track the true regions at $0.85$ field accuracy on naturally mixed scientific documents, and at $0.98$ on constructed mixtures whose regions are lexically disjoint. Restoration improves over a single global weight when the experts are genuinely distinct and reduces to it when they converge, tracking a measure of expert separation.
Read the full abstract
Artificial Intelligence
Spillover-Aware Multi-Value Steering for Pluralistic LLM Alignment
Activation steering controls LLM behavior at inference time by adding learned directions to hidden states, but existing methods handle one concept at a time. Pluralistic alignment, where different stakeholders need different value emphases, requires steering multiple dimensions simultaneously. We show that naive steering produces substantial spillover: the effect intended for one value leaks into others. This parallels the treatment-versus-spillover decomposition in causal inference. We trace spillover to geometric entanglement of steering directions, captured by their Gram matrix, and derive a zero-cost correction from an activation-norm-penalized objective that decouples each direction's contribution exactly. Our end-to-end pipeline requires no fine-tuning, no reward model, and no manual prompt engineering: given only domain questions, it automatically discovers value dimensions, extracts directions, diagnoses entanglement, and applies corrected steering. On climate discourse, the correction improves the net steering effect from +5.9% to +14.0%, validated over 100,000 pairwise judgments.
Read the full abstract
Computation and Language
Dynamic Lagging using Stable-Prefix Training for Simultaneous Translation
In streaming simultaneous speech translation, the speech translation system is trained to learn a read-write policy that alternates between consuming source words and generating target ones. In a cascaded setting, the output from the speech recognizer is passed to a separate machine translation component, making it more difficult to learn such a policy. Approximations such as fixed wait-k strategies or target-suffix deletion can be employed, but these approaches do not provide the model with a streaming system's flexibility to make contextual read-write decisions. This paper presents a training strategy for a cascaded machine translation system that enables it to dynamically decide how much of the growing source prefix to translate. We achieve this by fine-tuning a large language model (Qwen3-8B) on stable prefixes of the training data, which are produced by pairing every source sentence prefix in the training data with the longest translation of that prefix that is shared with the full source sentence translation. We fine-tune variants of the model on different subsets of the prefixes and compare against wait-k and target-suffix deletion. We also investigate the effect of fine-tuning the target-token generation confidence. Our experiments show that stable prefixes improve the quality-latency tradeoff when translating from English into German, Japanese, and Chinese across a range of test sets.
Read the full abstract
Differential Geometry
Cheeger constant rigidity for cocompact negatively curved manifolds
Let $(M^m,g)$, $m\geq2$, be a closed connected Riemannian manifold with $\secg_g\leq-1$, and let $(X,g_X)$ be its universal cover. Yau proved that $\hiso(X)\geq m-1$. We prove that equality is rigid: if $\hiso(X)=m-1$, then $(X,g_X)$ is isometric to $\Hh^m(-1)$.
Computation and Language
Safety Monitors Mostly Catch What the Model Already Refuses
Safety monitors are evaluated by recall on harmful prompts, regardless of whether the target model would answer them. Yet a monitor matters most on the prompts the model does answer. We measure recall on exactly those prompts, defined by sampling the target model and judging its responses. Across four text guards, two activation probes, and Latent Guard, recall at a 1% false positive rate falls sharply on this subset: at a common threshold, every monitor catches the requests the model refuses 1.1 to 6.4 times as often as the requests it answers. Standard metrics hide this; AUROC stays above 0.85 for most monitors. Rewriting each request to be less explicit, with intent held fixed and verified, raises compliance 28-fold and lowers every monitor's flag rate. Of the requests newly answered after rewriting, 44 to 93% slip past the monitor, depending on which is used, and most of their completions are graded harmful. We trace the gap to explicitness itself. As wording softens with intent fixed, the target model's harm and refusal readings fall and it answers; the guards' harm readings fall too, and steering a guard along explicitness alone flips its verdict. Model and monitors miss the same prompts, and stacking monitors does not recover them. Fine-tuning a guard on the rewrites at every level of explicitness, on both sides of the label, raises recall on answered requests from .24 to .89 while transferring to unseen benchmarks; hard negatives, the natural alternative, teach the guard to discount indirect phrasing instead.
Read the full abstract
Machine Learning (Statistics)
Diagonal Attenuation: A Finite-Sample Correction for PCA
Principal component analysis (PCA) can rotate away from its population target when a covariance matrix is estimated from limited data. We introduce diagonal attenuation, which preserves sample cross-covariances while reducing coordinatewise sample variances. The method is revealed exactly by averaging a linear full-output reconstruction loss over random input masks; studying the correction directly extends it beyond the range attainable by masking. We isolate the part of the random coupling between retained and omitted population directions that is contributed by sample-variance errors, and show how attenuation can reduce the resulting rotation. Under balanced marginal variances, we derive an explicit expected-risk theorem, uniform over the attenuation path for all sufficiently large finite samples, and obtain the asymptotically risk-minimizing strength. For general covariances, we characterize when attenuation leaves the population PCA subspace unchanged and give a risk theorem that also accounts for changing eigengaps and the population cost when the target moves. Simulations track this tradeoff from exact preservation back to PCA. Across local image patches, speech spectra, and smartphone acceleration, both mask-derived and direct attenuation improve PCA under two fitting-sample budgets, and one of them has the largest mean gain among seven methods in every data–budget cell. The full path selects strengths beyond the mask-derived boundary on $63\%$–$95\%$ of the subsamples.
Read the full abstract
Data Structures and Algorithms
Polynomial Lower Bounds for Distributed Graph Sketching with Tiny Error: Connectivity and Spanning Tree Construction
We present the first polynomial lower bounds for several fundamental problems in the distributed graph sketching model in the tiny-error regime, which includes deterministic algorithms as a special case. In the graph sketching model, every node sends a single message to the referee who does not have any prior knowledge of the graph and must output the answer. While the work of Nelson and Yu (SODA 2019) and Yu (SODA 2021) showed that $\Theta( \log^3n )$ is optimal for constructing a spanning forest or deciding whether the graph is connected with error at most $\frac{1}{\text{poly}(n)}$ , their approach does not yield any stronger bounds for significantly smaller error probabilities. Our main result is to show that solving either connectivity or spanning tree construction with error at most $\delta$ requires messages of length $\Omega( \min\{n, \log_2 \frac{1}{\delta}\}^{1/3} )$, which implies that algorithms with exponentially small error must send messages of $\Omega( n^{1/3} )$ bits in the worst case. Our results significantly narrows the current gap between the Jelani-Yu threshold of $\Theta( \log^3n )$ and the trivial upper bound of sending $O(n)$ bits per node for deterministic graph sketching. We also extend our results to $k$-edge connectivity. For any $k=O(n^{1/7})$, we recover the same bound of $\Omega( k )$ on the message length for algorithms with exponentially small error that was shown by Robinson and Tan (PODS 2026) only for deterministic algorithms. Finally, for $k=n^{o(1)}$, our result implies a stronger lower bound of $\Omega_\epsilon( n^{\epsilon} )$ bits, for any constant $\epsilon<\tfrac{1}{3}$.
Read the full abstract
Cryptography and Security
Bait-and-Recover: Poisoning Internal Refusal Signals to Defend LLMs against White-Box Editing Jailbreaks
Open-weight large language models face a low-cost white-box threat from representation engineering attacks. Attackers can estimate refusal directions and search for projection-matrix edits that suppress safety alignment while preserving general capabilities, within minutes on a single GPU and without gradient-based training. We propose Bait-and-Recover, a weight-level defense that places a bait adapter where attackers read activations and a paired recovery adapter at the subsequent layer. Trained via gradient routing, this decouples the observation path from the behavior path. By actively poisoning the residual signal used for measurement, Bait-and-Recover disrupts the attacker's edit search, while the recovery layer restores clean downstream computation. Across four open-weight models, our defense raises the minimum refusal rate against white-box edit searches from 16.25% to 71.75% under a strict behavior-preservation budget (KL <= 0.10), with negligible impact on general benchmarks. By invalidating the core measurement assumption of these attacks, observation-path poisoning offers a practical complement to behavior-level safety training.
Read the full abstract
Networking
HalifaxDT: A Wireless Digital Twin from Open Geospatial Data
Wireless digital twins can support site-specific analysis, planning, and experimentation for future wireless networks. However, constructing them at city scale remains challenging when accurate 3D city models are unavailable. This paper presents HalifaxDT, a wireless digital twin of the Halifax Peninsula in Nova Scotia, Canada, constructed from heterogeneous open geospatial and spectrum data. HalifaxDT combines building footprints, LiDAR elevation products, building metadata, and spectrum licensing records through a workflow that reconciles multiple sources of building-height information while preserving the provenance of geometry decisions. The resulting terrain, buildings, and gateway metadata are integrated into Sionna RT for wireless simulation. We evaluate HalifaxDT through two use cases. The first compares its coverage predictions with a reference derived from field measurements and with an analytical baseline. The second uses the digital twin to predict the received signal under normal operating conditions and detect interference. The coverage results show that HalifaxDT better preserves the spatial structure of the measured radio map than the analytical baseline. The interference study shows that deviations from the predicted reference can reveal interference that is difficult to detect from received power alone. We also identify current fidelity limitations, including simplified material representation, missing vegetation, and the need for broader RF calibration and synchronization with live measurements.
Read the full abstract
Econometrics
Scalable Clustered Network Connectedness with Control Variables: Theory and Application to Global Banking
We extend the clustered connectedness framework of Buchwalter, Diebold and Yilmaz (2026) in two complementary directions that improve the robustness and interpretability of cross-cluster connectedness. First, we develop a diagnostic for residual ordering sensitivity by characterizing the distribution of cluster-level net connectedness across all admissible identification orderings and, in particular, by pairing first- and last-position orderings while holding fixed the relative ordering of all other clusters. Second, we introduce a dedicated cluster of control variables to absorb variation associated with observed common macro-financial factors while preserving the computational scalability of the clustered framework. The control cluster is fixed first, and bank innovations are residualized with respect to it before the remaining bank clusters are permuted and orthogonalized as usual, leaving the number of admissible bank-cluster identification strategies unchanged. Under the maintained recursive assumption that control-cluster innovations are contemporaneously exogenous to bank-cluster innovations, the remaining cross-cluster connectedness among the bank clusters can be interpreted as bank-to-bank transmission net of those observed common-factor shocks. We apply the methodology to seventy-one global banks grouped into seven regional clusters over 2003–2024. The treatment of common macro-financial factors materially affects both system-wide cross-group connectedness and cluster-level net positions. Placing the controls in a dedicated first cluster also substantially reduces paired first-versus-last ordering sensitivity across all seven bank clusters, with especially large reductions for the United States and the European clusters.
Read the full abstract
Networking
Semantic Communication for Distributed Spectrum Monitoring over Unreliable Links
Distributed spectrum monitoring relies on spatially separated receivers to infer the state of the radio environment. A central task is to determine how many emitters are active and where they are located. Sensors typically report over shared unreliable links, where contention, fading, or energy limits erase whole reports, so forwarding raw I/Q samples from all receivers to a fusion node becomes impractical. This paper formulates distributed emitter counting and localization as a semantic communication problem over unreliable reporting links. Each receiver maps its local time-frequency observation to a compact latent representation and transmits it. The fusion node pairs each surviving latent with the corresponding receiver position and operates on the resulting unordered set, which keeps the fusion rule compatible with variable membership and receiver-count changes. The encoder and decoder are trained end-to-end with report erasure, and optionally finite-rate quantization, inside the task objective. Experiments on synthetic multi-emitter scenes show that channel-aware training improves robustness under erasure, that set fusion is more robust than fixed-order concatenation, and that one trained model operates across receiver counts without retraining. The rate study shows that a few bits per latent component suffice in the tested setting, and that the rate knee remains roughly stable across erasure levels. These results support the feasibility of low-rate semantic reporting for distributed spectrum monitoring over unreliable links.
Read the full abstract
Statistics Theory
Lehmer Transform
The Lehmer transform encodes a positive dataset as a single analytic curve, the ratio of its power sums at consecutive orders read as a function of the order. As the order sweeps the real line the curve generates every location statistic between the sample extremes, and its logarithm is the unit increment of the free energy of an exponentially tilted ensemble; the statistical theory of the curve flows from that identity. The slope of the curve is a Jeffreys divergence, the arithmetic-geometric gap is a relative entropy, and multiplicativity over independent factors makes deconvolution of multiplicative noise a pointwise division. A quantitative rigidity theorem locates the frontier of identifiability at geometric growth of the curve, with resonant log-periodic families of distinct laws sharing one curve beyond it. The empirical curve is an exact re-coordinatization of the order statistic, hence minimal sufficient, and its influence function, exact leading bias and limit theory are developed in full. At heavy tails the curve undergoes a phase transition whose two knees, one unit apart, sit at the tail index and its unit shift, a whole-sample diagnostic complementing threshold-based estimators.
Read the full abstract
Group Theory
Shirshov's amalgamated free product and generic nilpotent groups
In earlier work, the authors gave a construction and description of an amalgamated free product of filtered Lie algebras within a fixed nilpotency class, based on an intricate induction rooted in the work of Maier and of Higman. In this paper, the authors give a new description of this amalgam, adopting the viewpoint and methods from the work of A. I. Shirshov on amalgamation of Lie algebras, substantially simplifying their previous approach. This new description yields both group-theoretic and descriptive set-theoretic applications. A $c$-nilpotent group is called UL-equivalent if its lower and upper central series coincide. We prove that every finite $c$-nilpotent group of prime exponent $p$ with $p>c$ embeds in a finite UL-equivalent $c$-nilpotent group of exponent $p$. This recovers a result due to Ivanov and Majcher that the Polish space of enumerated $c$-nilpotent groups of exponent $p>c$ has a comeager orbit. Our result also has the following consequences. First, the class of finite $c$-nilpotent groups of exponent $p>c$ has the cofinal amalgamation property (answering a question of Ivanov and Majcher, who showed that it has the weak amalgamation property). Second, the reduct of the Fraïssé limit of $c$-Lazard groups of exponent $p>c$ to the group language is generic in the space of enumerated groups. Finally, we prove analogues of these results also for torsion-free $c$-nilpotent groups.