Peer Revenue Equity in science

Papers

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

All of arXiv

Friday 28 August

Cryptography and Security

Membership is Ownership: A Robust Ownership Verification Framework for Diffusion Models

Large-scale diffusion models have fueled numerous profitable downstream applications for AI-related businesses, including visual editing and content creation. Meanwhile, due to the huge amount of resource consumption (e.g., computation and high-quality data) during training, such diffusion models are deemed valuable intellectual property (IP) for tech companies like OpenAI and Google. Yet, the IP assets are vulnerable to various unauthorized uses by adversaries seeking to steal models for customized, usually commercial applications. Some existing approaches have explored IP protection for AI models; however, they mostly face structural limitations in common — using a training-time watermarking by injecting artifacts in the model, which can impose a measurable utility cost and can be weakened by post-hoc fine-tuning. To address these challenges, this work investigates IP protection (i.e., model ownership verification) for diffusion models in a realistic commercial scenario with minimal model utility loss. Specifically, the proposed method builds a framework for model ownership verification, termed “{Membership is Ownership} (MiO)”, based on a population-level hypothesis test on a private member evidence dataset. MiO verifies ownership using two criteria: model attribution through membership inference and model separation from public references. Both are tested at $p<10^{-6}$. We evaluate MiO on DDIM and Stable Diffusion models without modifying the owner model or its sampling pipeline, and report ROC-AUC and true-positive rates at fixed nominal false-positive targets. Furthermore, MiO stays stable under different post-theft fine-tuning and weight perturbation in adversarial scenarios, reflecting better robustness compared to the watermarking methods.
Read the full abstract

All authors Feng Jiang, Zuobin Xiong, An Huang, Zhipeng Cai, Yingshu Li

Mesoscale and Nanoscale Physics

Chiral Tubular Magnonic Crystals with Periodic Dzyaloshinskii–Moriya Interaction

We introduce a chiral tubular magnonic crystal formed by a ferromagnetic nanotube with a periodically modulated interfacial Dzyaloshinskii–Moriya interaction (DMI). Using a plane-wave formalism adapted to the cylindrical geometry, we calculate the spin-wave band structure including exchange, nonlocal dipolar coupling, and interfacial DMI. We show that the tubular geometry qualitatively modifies the role of periodic DMI compared with planar chiral magnonic crystals. Besides producing the usual nonreciprocal frequency shift, curvature converts part of the interfacial DMI into an effective anisotropy-like internal field. This creates a sign-dependent frequency landscape along the tube, so that DMI-covered regions can act either as potential wells or barriers for the lowest-frequency modes. As a result, flat and weakly dispersive bands appear in both Damon–Eshbach-like and backward-volume-like configurations, with the latter having no direct counterpart in planar systems. Our results identify periodically engineered DMI in nanotubes as a route for controlling nonreciprocal spin waves, localized modes, and flat magnonic bands in curved architectures.
Read the full abstract

All authors P. Contreras-Gallardo, J. Flores-Farias, B. Mimica-Figari, V. Puliafito, P. Landeros, R. A. Gallardo

Image and Video Processing

Patch-Based Diffusion Reconstruction for Accelerated Cardiac Cine

Purpose: To develop and evaluate a diffusion-based reconstruction framework for highly accelerated 2D real-time (RT) cine cardiovascular magnetic resonance imaging (CMR). Methods: We trained an unconditional patch-based diffusion model and incorporated it into a reconstruction framework, termed CineDiff, using diffusion posterior sampling for data consistency. CineDiff was evaluated in four settings: (i) 30 retrospectively undersampled breath-held cine at 1.5T and 3T from healthy participants across multiple acceleration rates, (ii) 15 prospectively undersampled free-breathing RT cine at 1.5T and 3T from patients indicated for clinical CMR, and (iii) 10 prospectively undersampled mid-field (0.55T) free-breathing scans, including five from healthy subjects and five from porcine models. For retrospective undersampling, reconstruction quality was assessed using peak signal-to-noise ratio (PSNR), structural similarity index measure (SSIM), learned perceptual image patch similarity (LPIPS), and deep image structure and texture similarity (DISTS). For prospective undersampling, image quality was evaluated by blinded expert scoring on a 5-point Likert scale. Results: In retrospectively undersampled breath-held cine data, CineDiff achieved higher PSNR and SSIM and lower LPIPS and DISTS than the comparison methods across all evaluated acceleration rates. In prospectively undersampled free-breathing RT cine data, CineDiff received higher expert image-quality scores. Qualitatively, CineDiff reduced block-like artifacts and preserved finer anatomical detail compared with traditional compressed sensing and a variational network method, termed CineVN. Conclusion: CineDiff enabled high-quality reconstruction of highly accelerated 2D RT cine CMR. The method also demonstrated robustness to out-of-distribution data, including mid-field and porcine acquisitions.
Read the full abstract

All authors Xuan Lei, Philip Schniter, Juliet Varghese, Rizwan Ahmad

Computation and Language

Leveraging Turn-taking Dynamics for Intent Recognition in Multi-party Conversations

We propose a multi-task learning approach for multi-party dialogue intent recognition that leverages an auxiliary task that models turn-taking dynamics. Specifically, we introduce turn-transition entropy, a self-supervised target computed from the sequence of speaker transitions, which quantifies the predictability of interaction patterns. Experiments on multiple pre-trained models demonstrate that incorporating this auxiliary task improves intent recognition performance, outperforming existing approaches which ignore multi-party interaction dynamics. We find that our proposed continuous target can be learned as a single-task objective, suggesting that it is an actual signal carrying useful information.
Read the full abstract

All authors Galo Castillo-López, Alexis Lombard, Gaël de Chalendar, Nasredine Semmar

Computers and Society

Stress-testing university AI governance: A prospective method for locating policy breakpoints

Universities are producing AI principles and use policies faster than they are building decision pathways for unfamiliar forms of AI agency. This study develops Institutional AI Governance Stress Testing (IAGST), a prospective documentary method for locating where publicly documented governance ceases to yield an accountable response. IAGST adapts established policy stress-testing and wind-tunneling logic. Its originality lies in combining controlled capability escalation, a frozen documentary corpus, a six-dimensional governance response chain, non-compensatory decision rules, and case-level breakpoint diagnosis. The method was demonstrated using 133 substantive public documents from five Western Australian universities and 15 quality-screened scenarios, resulting in 75 university-scenario encounters. Six cases were resolved, 14 were resolved through structured discretion, and 55 were indeterminate. Governed pathways fell from 16 of 25 augmentation cases to four delegation cases and none at autonomous substitution. The dominant weakness was not the complete absence of responsible roles: all 50 authority-gap cases named a role at only a generic level but lacked sufficient decision criteria or process. The findings show how universities can move beyond policy inventories and principal statements by testing whether authority, procedures, safeguards, and reviews remain connected as AI capabilities evolve. IAGST is a reproducible diagnostic for policy learning, not a ranking or measure of implementation.
Read the full abstract

Computation and Language

Causal Interventions Reveal Typologically Organized Syntactic Mechanisms in Multilingual Language Models

Linguistic theory has long recognized cross-linguistic syntactic regularities, leading to claims that these similar structures are processed by similar mechanisms. However, this hypothesis has been difficult to test empirically due to our lack of fine-grained, manipulable access of human processing mechanisms. In this work, we take advantage of techniques from mechanistic interpretability to study such a question in multilingual LMs. We first isolate language-internal mechanisms before attempting to transfer them cross-lingually. Across four models and three well-studied constructions (subject–verb number agreement, anaphoric pronoun gender agreement, and filler–gap object extraction) we find consistent cross-lingual mechanism transfer. We further find transfer to be graded, with more transfer between more typologically similar languages. We believe our work provides novel hypotheses about cross-linguistic syntactic structures and multilingual processing, and more broadly shows how the study of language models can help inform linguistic theory.
Read the full abstract

All authors Sasha Boguraev, Toshiki Nakai, Kyle Mahowald, Julius Steuer

Computer Vision

ActiveAugment: Online Active Learning for Augmentation Selection in Deep Learning

Data augmentation is a cornerstone of deep learning pipelines, yet existing strategies treat it as a static, model-agnostic preprocessing step, either relying on expensive dataset-specific policy search or applying transformations uniformly at random, regardless of what the model has already learned. We introduce ActiveAugment, a unified framework that treats augmentation selection as an online active learning problem. For each training minibatch, ActiveAugment generates a pool of candidate augmented views and scores each candidate using a combination of the model's predictive uncertainty and the feature discrepancy induced by the augmentation. The augmentation under which the current model is most fragile is selected per sample, and the model is then trained with a joint supervised classification and supervised contrastive objective that enforces intra-class invariance to the selected augmentations while maintaining inter-class separation. We evaluate ActiveAugment on eight benchmark datasets spanning natural and medical imaging, using CNN and transformer architectures across three training regimes (training from scratch, full fine-tuning, and linear probing), and comparing eight active selection strategies for augmentation scoring. ActiveAugment outperforms AutoAugment, RandAugment, and TrivialAugment under controlled augmentation shifts across all domains and budgets, with the most pronounced gains at low labelling budgets. On medical imaging datasets, where data is scarce and domain shift relative to natural-image pretrained models is large, ActiveAugment achieves higher test F1 than all baselines, demonstrating strong cross-domain adaptability. Our analysis reveals that the augmentation selection policy evolves meaningfully during training and that strategy choice has a direct impact on generalisation. Code is available at: https://github.com/noahvide/ActiveAugment.
Read the full abstract

Machine Learning

RankShift: In-Database Detection and Explanation of Categorical Shifts

A login service can receive its usual number of failed sign-ins while one source grows from 2% to 30% of them. The same pattern appears in system logs when a rare event template becomes common while the message rate stays stable. These events change which categories are active without changing how many events occur. RankShift detects such changes inside the analytical database that stores the data. It compares each window's category shares with a benign reference using a Pearson score whose terms identify the categories responsible for the change. The same query returns the score, calibrated alert, and largest increasing contributions. We evaluate RankShift on HDFS, BGL, and Thunderbird. It matches the count-vector autoencoder within 0.001 AUROC on HDFS (0.999 versus 1.000) and leads on Thunderbird (0.983 versus 0.949). In a controlled fixed-volume experiment, RankShift detects rare-category shifts that are invisible to event-count monitoring, reaching 0.787 AUROC compared with 0.771 for the autoencoder. Across all three corpora, observed false-alarm rates track the requested operating levels. RankShift requires no model training or inference service, and the autoencoders deployed state is 137x larger.
Read the full abstract

Cryptography and Security

Identity by Design, Demographics by Accident: Demographic Leakage and Suppression in Behavioral Biometric Embeddings

Behavioral biometric authentication (BBA) systems use deep learning models to transform biometric signals, such as eye movements, voice, keystroke/touchstroke dynamics, and gait, into identity embeddings for user authentication. While designed to encode identity, these embeddings may inadvertently reveal sensitive demographic attributes, including gender, age, and height. Consequently, an adversary with access to the authentication model can infer demographic information from biometric signals, including those of users unseen during training or enrollment. In this paper, we present the first systematic audit of demographic leakage in BBA systems, evaluating 11 models across 9 datasets spanning four biometric modalities. We further benchmark four post-hoc suppression methods-Incremental Variable Elimination (IVE), Hilbert-Schmidt Independence Criterion (HSIC), Adversarial Encoder-Decoder (AED), and Protected Attribute Suppression System (PASS) to assess their ability to mitigate demographic leakage while preserving authentication utility. Our analysis reveals substantial variation in leakage and suppressibility across modalities, model architectures, and learning objectives. While voice embeddings exhibit high leakage that can be effectively suppressed, keystroke/touchstroke embeddings exhibit lower leakage but are considerably more difficult to sanitize. These findings highlight a fundamental privacy risk in behavioral biometric authentication and provide insights into the factors governing demographic information suppressibility.
Read the full abstract

All authors Iyadh Khan, Patrick Nilackshan, Mohamed Aathif, Mohamed Theesan, Sandareka Wickramanayake, Sanka Rasnayaka

Data Structures and Algorithms

Parameterized Complexity of Connected Network Microaggregation: The Role of Cluster Size

Network microaggregation is a fundamental technique in statistical disclosure control, where vertices of a graph are partitioned into clusters satisfying size constraints and admitting a center within bounded distance. We study the parameterized complexity of the unweighted Connected Network Microaggregation problem, focusing on structural parameters and natural clustering parameters such as the distance bound $d$ and cluster size gap $u-\ell$. We show that, unlike the weighted variant, the unweighted connected problem is fixed-parameter tractable when parameterized by neighborhood diversity, and hence by vertex cover. In contrast, it remains $\mathrm{W[1]}$-hard for more general structural parameters, including vertex deletion to paths, stars, and cliques. These hardness results hold even for every $d\ge 2$ and any fixed gap $u-\ell$, showing that these clustering parameters do not overcome the structural hardness. We further show that adding the cluster size bound $u$ restores tractability for structural parameters such as treewidth and cluster vertex deletion. Moreover, $u$ is essential: the problem remains $\mathrm{W[1]}$-hard when these structural parameters are considered alone. For kernelization, we prove that the problem has no polynomial kernel parameterized by vertex cover unless $\mathrm{coNP}\subseteq\mathrm{NP/poly}$, even when the distance constraint is vacuous. Adding $u$ yields a polynomial kernel for vertex cover, while kernelization remains unlikely for more general structural parameters even when combined with $u$. Finally, we show that the problem is NP-hard on graphs of bounded clique-width.
Read the full abstract

Emerging Technologies

Emergent Behavior and Uncertainty in IoT-Enhanced Business Processes: Challenges and Future Directions

IoT-enhanced business processes are characterized by high complexity due to heterogeneous actors, varying levels of autonomy among participating systems, continuously evolving execution contexts spanning the digital and physical worlds, and continuous event streams. In such settings, process behavior partially emerges only at runtime through complex interactions involving humans, IoT devices, physical objects, software systems, agents, and services. This complexity introduces partial observability, uncertainty, and runtime dynamics that are difficult to anticipate and that challenge traditional business process management (BPM) assumptions and systems. We discuss these challenges from three perspectives, addressing 1) uncertainty representation, 2) operationalization of IoT-enhanced processes, and 3) runtime management of emergent behavior. Based on a motivating scenario and an analysis of the state of the art, we identify open research gaps and outline short-, medium-, and long-term recommendations to shape a research agenda on emergent behavior in IoT-enhanced business processes.
Read the full abstract

All authors Marco Pegoraro, Sara Pettinari, Ivan Compagnucci, Marco Franceschetti, Ronny Seiger

Instrumentation and Methods for Astrophysics

Pre-shipment optical characterization of the SCALES instrument

The Slicer Combined with an Array of Lenslets for Exoplanet Spectroscopy (SCALES) instrument is a 1-5 micron imager and 2-5 micron integral field spectrograph, currently being commissioned on the Keck II Telescope. SCALES is optimized for exoplanet high-contrast imaging and spectroscopic characterization, and will be sensitive to older, colder exoplanets than existing instrumentation. The 12.3" x 12.3" imaging channel is designed to replicate the capabilities of NIRC2, and the low (R~35-200, 2.2" x 2.2" FOV) and medium (R~2500-5000, 0.36" x 0.34" FOV) spectral resolution modes offer new capabilities compared to existing Keck instrumentation. We present preliminary optical performance results from laboratory testing and commissioning of SCALES.
Read the full abstract

All authors Isabel J. Kain, Reni Kupke, Daren Dillon, R. Deno Stelter, Rosalie McGurk, Gwendolin Weber-Stover, Athira Unni, Marc Kassis, Scott Lilley, Peyton Benac, Mackenzie Lach, Arun Surya, Amirul Hasan, Ravinder Banyal, Raquel Martinez, Nicholas MacDonald, Will Deich, Aaron Hunter, Emily Plume, Michael Gonzales, Cristian Rodriguez, Arjun Kumar, Cyril Bourgenot, Paul Whiteg, Juergen Schmollg, James Wells, Spencer Davies, David Bramall, Dimitri Mawet, Olivier Absil, Michael Fitzgerald, Eric Wang, Steph Sallum, Andrew Skemer

Mathematical Physics

Pseudorandomness and Diffraction

Pseudorandom structures are structures that behave like random ones, without necessarily being random themselves. It is a prominent, and evidently very difficult, conjecture that $$ V(n) = \lambda \cos \Big( 2 \pi \Big( x_1 + n x_2 + \frac{n(n-1)}{2} \alpha \Big) \Big) $$ is pseudorandom from a Schrödinger operator perspective in that the Schrödinger operator in $\ell^2(\mathbb{Z})$ with potential $V$ displays Anderson localization, that is, pure point spectrum with exponentially decaying eigenfunctions for almost all parameter values — the same spectral features as those produced by random potentials. We show that $V$ is pseudorandom in terms of its diffraction properties, that is, the associated diffraction measure is purely absolutely continuous for all $\lambda \not= 0$, all irrational $\alpha$, and all $x_1,x_2$ — which is the case as well for the random case. Our result gives further evidence for the conjecture in the Schrödinger case and it elucidates the apparent dual behavior of Schrödinger spectral measures and diffraction measures.
Read the full abstract

Computation and Language

VoiceCodeBench: Evaluating Exact Structured-Token Recovery in Automatic Speech Recognition

Automatic speech recognition is usually evaluated with word error rate (WER), although voice workflows often require exact written values. VoiceCodeBench measures whether transcripts preserve identifiers, paths, commands, and other structured tokens needed by downstream software. It contains 300 human-recorded English workplace segments (5.59 hours, 85 speakers) and 1,482 audited entities across 26 types and eight domains. Under a raw-audio-only protocol, we evaluate 19 batch and streaming systems using WER, Canonical Token/Entity Match (CTEM), and strict segment-level Task Success Rate (TSR). Across systems, WER has little rank agreement with CTEM (Spearman $\rho=-0.28$) or TSR ($\rho=-0.22$). The best CTEM and TSR are 91.8% and 68.7%. Even the strongest system therefore leaves nearly one-third of recordings with an unrecovered critical value. Symbol-, separator-, and boundary-sensitive entities account for most errors.
Read the full abstract

All authors Tyler Baumgartner, Brandon Tai, Lisa Kaelin-Martin, Candice Fan, Luc Debaupte, Bill Wang, Yi Zhong

Materials Science

Energy landscape and dissipation of sliding magnetic rotor arrays

Magnetically coupled damped rotational degrees of freedom can give rise to tribological loss when excited by a relative sliding motion, linking friction to the dynamics of magnetic moments. We analytically investigate such magnetic friction by studying a recently introduced simplified model for a rigid magnetic rotor array sliding over a commensurate magnetic substrate. Here, the array rotors can rotate about an axis perpendicular to the sliding direction and are damped by microscopic shaft friction, while the substrate magnets have a fixed in-plane orientation. The simplified model reduces the collective rotor dynamics of this setup to a set of coupled nonlinear differential equations, which can be studied by the corresponding energy landscape in the quasi-static regime. We find that the parameter plane spanned by layer separation and time can be divided into distinct chambers, in which the structure of the energy landscape remains invariant. Using these chambers, we identify the layer separation intervals corresponding to different dynamical states and recover the emergence of a regime where the moment alignment alternates globally while exhibiting peak dissipation. Additionally, we derive the leading nontrivial orders of the collective magnetic friction in the regimes of small and large gaps between the array and the substrate. For the alternating regime, we find that friction can be computed by tracking energy jumps from unstable to stable critical points at the chamber boundaries. These results provide an analytical foundation for the observed dynamics and dissipation in sliding rotor arrays. Because the simplified model is scale-free, our conclusions transfer across a broad range of microscopic and macroscopic length scales.
Read the full abstract

Quantum Physics

Exact Haar Statistics of Planar $k$-Purity in Multipartite Quantum Systems

Planar $k$-uniform states have maximally mixed reductions on every $k$-site interval of a ring. We introduce planar $k$-purity—the mean purity of those intervals—as a faithful cost function for this simultaneous constraint. For a Haar-random pure state of $n$ parties with local dimension $p$, the joint purity of two intervals depends only on their overlap. An exhaustive four-replica calculation therefore yields the complete cyclic covariance kernel and a closed variance for every $1\le k\le\lfloor n/2\rfloor$. In the balanced qubit case, $k=\lfloor n/2\rfloor$ and $N=2^n$, the variance is asymptotic to $20/(3nN^2)$ for even $n$ and $6/(nN^2)$ for odd $n$. A site-factorized permutation representation gives all raw moments and permits exact finite-sum evaluation of the skewness. Fixed-seed simulations validate nonbalanced qubit and qutrit cases, while balanced-qubit simulations through $n=10$ validate the parity formulas and finite-size skewness. Balanced planar and absolute balanced purity have the same Haar mean but different fluctuations; the planar variance is approximately $2.83$ times larger at $n=10$. Thus subsystem incidence, although invisible to every one-cut marginal distribution, controls the collective fluctuations of geometrically related cuts. Together with universal attainability and a linear number of interval constraints at balance, this provides a geometry-aware benchmark for multipartite entanglement beyond AME existence regimes.
Read the full abstract

Computer Vision

mmIR: Frequency-Space Inverse Rendering for 3D Millimeter-Wave Radar ADC Synthesis

High-resolution 3D radar data is scarce. Commodity mmWave sensors use small antenna arrays that limit angular resolution to several degrees, and existing datasets provide only 2D range-azimuth maps or sparse point clouds rather than raw analog-to-digital converter (ADC) signals. Hardware scaling is expensive, synthetic-aperture scanning is impractical at fleet scale, and learned synthesis methods are bottlenecked by the very data shortage they aim to address. We present mmIR, an open-source differentiable frequency-modulated continuous-wave (FMCW) radar inverse renderer that fits a physics-based forward model to real captures and re-renders from dense virtual apertures to synthesize high-resolution 3D radar data. Because radar resolution is too coarse to recover geometry directly, mmIR performs LiDAR-assisted inverse rendering: using LiDAR-derived meshes as a geometric scaffold, mmIR optimizes per-vertex International Telecommunication Union (ITU) physics materials, vertex normals, and antenna beam patterns through end-to-end automatic differentiation of a phase-coherent multiple-input multiple-output (MIMO) forward model with multi-bounce propagation, polarization, and free-space diffraction. On seven outdoor and six indoor ColoRadar scenes, mmIR achieves 0.914 mean Pearson correlation on range-azimuth maps versus 0.307 for Sionna-RT. Scenes trained on a cascaded imaging radar transfer to a co-located single-chip radar without re-training (0.554 correlation), and dense virtual arrays (100x100 elements) produce single-frame 3D occupancy validated against LiDAR. Project page: https://mmwave-inverse-rendering.github.io/
Read the full abstract

Biological Physics

Active wetting transition in cell aggregates

During many biological processes, cell aggregates spread on substrates in a process of active wetting. The existing models of tissue spreading, however, do not explicitly capture the state of partial wetting, in which the cell aggregate reaches a non-zero contact angle. Here, modeling cell aggregates as active polar liquid droplets, we predict a transition between partial and complete wetting. This transition emerges from the competition between tissue surface tension and active traction forces, which is captured in an active Young-Dupré equation. The active wetting transition is discontinuous, and it features a region of parameters in which both partial and complete wetting are possible. Unlike in passive wetting, the transition depends on dynamical parameters such as the tissue viscosity and substrate friction. Finally, adding contractile intercellular active stresses leads to higher contact angles and even full dewetting. Overall, our work predicts an active wetting transition for tissues and it captures the partial wetting states often seen in experiments.
Read the full abstract

Machine Learning

SemKV: Semantic Mixed-Precision KV Cache Quantization Guided by the Quality Cliff for Long-Context LLM Inference

The key-value (KV) cache is the dominant memory bottleneck of long-context large language model (LLM) inference, growing linearly with context length. We show that uniform KV quantization on a fractional-bit grid does not degrade gracefully: under a prespecified multi-seed statistical protocol, Llama-3.1-8B-Instruct with an affine quantizer is statistically indistinguishable from FP16 KV down to 2.322 code bits/value and collapses at 2.0 bits - a quality cliff in (2.0, 2.322] that reappears in generation-time quantization and multi-turn dialogue and transfers to Mistral-7B. The cliff reframes importance-aware mixed precision: above it, eight model-internal importance indicators are statistically interchangeable, so the benefit of mixing is grid interpolation, reaching average precisions uniform quantization cannot realize. SemKV preserves every token, ranks tokens by a model-internal score, and assigns two adjacent above-cliff precisions, achieving a measured 6.0x storage reduction with no statistically detectable quality difference from full KV (n=900, three seeds), and outperforming FP16 token pruning granted a 1.5x larger memory budget. Replacing the affine base with a distortion-optimized quantizer (TurboQuant-MSE) lowers the cliff in every protocol tested, raising the no-detectable-loss operating point to 7.9x. The recipe: measure the cliff for the target deployment setting, then interpolate above it.
Read the full abstract

Machine Learning

Learning-Theoretic Foundation for General Coded Computing: The Straggler Setting

Coded computing has emerged as a powerful paradigm for mitigating the impact of straggling workers in distributed computing systems. However, existing coded-computing schemes are predominantly designed for the exact recovery of highly structured computations, such as polynomial evaluation and matrix multiplication, and typically rely on strict recovery thresholds. These assumptions significantly limit their applicability to modern machine-learning workloads, particularly deep neural networks (DNNs), whose computations generally lack rigid algebraic structure and, in many applications, require only accurate approximations rather than exact recovery. To address this gap, we revisit coded computing from a learning-theoretic perspective and introduce General Coded Computing (GCC). Rather than adopting existing algebraic tools, GCC formulates coded computing through a natural end-to-end mean-squared error loss that directly measures the discrepancy between the desired computations and their recovered estimates. By deriving suitable upper bounds and restricting the encoder and decoder to a reproducing kernel Hilbert space (RKHS) with mild smoothness constraints, we show that both the encoder and decoder admit specific representations as linear combinations of RKHS kernel functions. This representation allows the corresponding coefficients to be computed efficiently. Moreover, this framework enables us to establish theoretical performance guarantees for GCC under two complementary straggler regimes. In the worst-case setting with $N$ worker nodes, and at most $S$ stragglers, we show that the end-to-end loss decays at least at rate $O(S^3N^{-3})$ for standard configurations. We then study a probabilistic setting in which each worker independently straggles with probability $p$. We prove that the expected loss can still converge at rate $O(\log_{1/p}^3(N)N^{-3})$.
Read the full abstract

Computer Vision

Coarse to Fine: Iterative Adversarial Neural Cellular Automata for Medical Image Synthesis

Large-scale, publicly available datasets have driven advances in deep learning, but privacy and legal restrictions often limit data sharing in medical imaging. Synthetic data generation offers a privacy-friendly alternative to enable the training of high-performance models on health data. While most state-of-the-art generative models produce high-quality images, they remain computationally expensive, which limits their applicability on resource-constrained hardware. We propose StyleGANCA, the first lightweight general-purpose NCA-based generative adversarial network. The architecture integrates a StyleGAN-inspired mapping network and adaptive style modulation into a multi-scale NCA synthesis process, enabling latent-controlled image generation through iterative local interactions. We evaluate StyleGANCA on BloodMNIST and PathMNIST against adversarial, variational, diffusion, and NCA-based baselines. Experimental results demonstrate that StyleGANCA achieves competitive image quality with substantially fewer parameters than baseline architectures, achieving the best FID and KID scores on PathMNIST with only 617k parameters. Furthermore, downstream experiments show that the generated images preserve class-specific information and effectively support the training of multi-class classifiers. Our code is publicly available at: https://github.com/MECLabTUDA/StyleGANCA
Read the full abstract

Chemical Physics

libNLPBE: An Open-Source Python Package for Solving the Non-Linear Poisson-Boltzmann Equation

Solvent environments surrounding a solute can significantly alter its chemical properties. These changes become more prominent in electrolyte solutions, where mobile ions largely influence the solute through electrostatic interactions. A theoretical description of these ionic effects will benefit the design of chemistry performed in electrolyte solutions. As a result, the non-linear Poisson-Boltzmann equation (NLPBE) has emerged as an efficient implicit solvent model for electronic structure calculations to address such effects. However, the limited availability of NLPBE solvers for molecular electronic structure calculations greatly hinders theoretical investigation into the ionic effects. To improve accessibility of the NLPBE, we present libNLPBE, an open-source Python library, that solves the NLPBE for molecular systems in combination with density functional calculations, specifically to obtain electrostatic correction terms arising from the electrolyte solution environment for the Fock matrix. The library employs the density fitting (DF) approximation to efficiently calculate solute electrostatic potentials. Furthermore, we develop the modified Damped Inexact Newton Multigrid developed by Holst (mDINMH) method for solving the NLPBE. The mDINMH features a symmetric preconditioner for solving the Newton equation, which enables the use of robust multigrid methods designed for symmetric linear operators. In addition, an algebraic multigrid method has been incorporated into the mDINMH to support a broad range of grid points. We also present a GPU-accelerated version of libNLPBE to leverage parallelization efficiency of GPUs.
Read the full abstract

Human-Computer Interaction

Structured State Reconciliation for Human-AI Task Handover

Task handover requires communicating enough current state for a successor to resume work, yet the relevant information is often divided between system records and human observations. System records can be precise and timestamped but only partially observe the task, while human reports capture intent and task knowledge that no log contains but are vulnerable to omission and memory error. We present a provenance-aware pipeline that converts task telemetry and human-authored reports into a shared typed task-state representation, aligns and reconciles their facts, detects conflicts, and generates structured handover reports. We evaluate the approach on 13 paired task states collected in a controlled spatial multitask environment, using task-grounded metrics that estimate the state-reconstruction cost a report would spare a hypothetical recipient and the misinformation burden it would impose. Reconciling both sources preserved greater estimated task-state utility than either the user report or telemetry alone. Relative to a direct end-to-end LLM given the same inputs, structured reconciliation maintained comparable estimated utility while incurring substantially less misinformation, and task-aware rendering retained utility more efficiently (per token) than exhaustive rendering. An exploratory content analysis further shows that human reports contain substantial strategic knowledge that lies outside state-focused metrics. These results support provenance-aware state reconciliation as a design pattern for safer AI-assisted handover.
Read the full abstract

All authors Kayleigh Bishop, Maria P. Stull, Breanne Crockett, Bradley Hayes

Mesoscale and Nanoscale Physics

Design and Modeling of the Charge Readout of a SiMOS Quantum Dot with a Single Electron Transistor and CryoCMOS

Single electron spin qubits trapped in SiMOS quantum dots are a promising technology for scaling to thousand- or million-qubit systems due to their compatibility with mature CMOS manufacturing processes. A readout system that combines a single electron transistor with a custom cryogenic CMOS amplification and digitization chain offers key advantages by avoiding the use of bulky RF components or room-temperature interconnects. We present design techniques and simulation results for an optimized qubit-SET cryoCMOS interface, culminating in the design of the QNDR1 ASIC, the first cryogenic readout ASIC designed under the Quandarum project, which targets the development of a many-channel spin qubit based detector for use in high energy physics.
Read the full abstract

All authors Adam Quinn, Troy England, Andrew Li, Sharmila Mustari Nandita

Machine Learning

Off-Policy Evaluation for Semantic ID Recommenders: Does the Model's Own Code Hierarchy Help?

Generative recommenders increasingly emit semantic IDs (SIDs): each item is a short sequence of hierarchical discrete codes from a residual quantizer, decoded autoregressively. Before spending scarce A/B-test, a team may decide offline which decoder or reranking variants are worth testing - a job for off-policy evaluation (OPE). We ask a simple question: can the model's own SID tree serve as the action abstraction for that OPE? Our answer has three parts. (i) Under the near-argmax logging real recommenders use, per-item OPE is hopeless - as item-level effective sample size is usually small on production logs - but marginalizing items to code-prefix clusters restores estimable support and cuts error. (ii) This gain is thanks to coarsening, not to the hierarchy specifically; but the SID tree is what makes coarsening feasible in a generative system - each cluster's mass is exactly and cheaply returned by the decoder, whereas flat clustering requires enumerating item/leaf masses that a code-only decoder does not directly expose. (iii) Resolution depth is the operative knob - coarser under scarce support - and a conditional bias bound links the coarsening bias to the quantizer's worst-case reconstruction residual and the target-logging divergence.
Read the full abstract

Quantum Physics

Spin-spin effects from non-relativistic limit of Dirac-Pauli-Maxwell Lagrangian

It is natural to expect that the electromagnetic spin-spin interaction has roots in a more fundamental theory: quantum electrodynamics in this case. To show this, we take the non-relativistic limit of the Dirac-Maxwell Lagrangian, using the Foldy-Wouthuysen transformation and derive the Breit interaction by an alternative approach. By adding the Pauli term (i.e., a higher-order interaction between spin and the electromagnetic field), we calculate the correction terms to electromagnetic spin-spin interactions in the non-relativistic limit. Finally, we study some of the physical effects of these terms regarding spin-spin interactions and spin-spin entanglements. Accordingly, we provide theoretical estimates that are not yet accessible with current experiments.
Read the full abstract

Materials Science

Revealing low-energy surfaces of multinary compounds by controlling surface coordination environments

When modeling surfaces of multinary compounds, conventional cleavage planes often cut through strongly bonded polyhedra, resulting in unphysical surface energies. Here, we introduce SALAMI (Symmetric Atomic Layers for Arbitrary Multinary Interfaces), a Python package that generates symmetric, charge-neutral, dipole-free, and low-energy slab models for multinary compounds. SALAMI performs combinatorial searches to selectively remove surface atoms and generate corrugated terminations that preserve optimal coordination environments. We applied this workflow to all symmetrically inequivalent crystallographic orientations with Miller indices up to 2 for two prototypical structures: the solid-state electrolyte Li3PS4 and the transparent conducting oxide ZnSb2O6. Density functional theory calculations reveal that Li3PS4 must preserve all PS4 units to achieve the minimum surface energy. For ZnSb2O6, low-energy surfaces are achieved by partial undercoordination of surface Sb atoms to SbO5 or SbO4 from the bulk SbO6, depending on the surface orientations. Compared to surface models generated with unconstrained coordination, applying constraints to achieve optimal local coordination environments significantly lowers surface energies, shrinking the volume of the predicted Wulff shape by approximately 20%. Our results demonstrate that meticulous control of local coordination environments is necessary for accurately predicting the surface energetics of multinary compounds.
Read the full abstract

All authors Weihang Xie, Harshan Reddy Gopidi, Zhengyu Liu, Romain Claes, Alexander G. Squires, Keith T. Butler, David O. Scanlon, Pieremanuele Canepa

Optics

Defects encode high-dimensional topological information

In polarization fields, Stokes skyrmions are continuous vectorial textures that encode integer-valued topological invariants across real space, enabling robust optical information encoding under complex perturbations. This topological resilience, however, fails when singular points occur where the Stokes vector has no unique limiting value, placing a fundamental constraint on skyrmion-based information manipulation. Here, we show, paradoxically, that the very defects that destroy conventional resilience can become the carriers of topological information. We introduce the resulting structures as Stokes defect skyrmions, in which singular Stokes responses constitute measurable topological degrees of freedom with theoretically minimal size. We design and realize one class of them using all-dielectric metasurfaces that combine arbitrarily controlled distinguished fast-axis singularities with customized retardance profiles. The resulting fields are then described by high-dimensional integer-valued topological tuples, providing theoretically unbounded information capacity at the nanoscale. As a proof-of-concept demonstration, selected tuple components are mapped to represent predefined alphabetic symbols, realizing controlled high-dimensional information representation within a single optical field. Our results establish Stokes defects as functional units for higher-dimensional topological encoding, expanding the role of defects from failure points to engineerable carriers of optical information.
Read the full abstract

All authors Yunqi Zhang, Fengjun Li, Runchen Zhang, Zi-Lan Deng, Liangyu Deng, Zhikai Zhou, Ruofu Liu, Zimo Zhao, Yifei Ma, Yuanzhe Xu, Zixuan Wang, Yixuan Zhao, Jize Yan, Honghui He, Xiangping Li, Chao He

General Relativity and Quantum Cosmology

Spin-Graviton-Spin: a unique probe of quantum gravity

The existence of quantum gravity is the most important question in theoretical physics. Besides the theoretical development in this direction, looking for its low-energy consequences can provide clues. However, besides availability, it is crucial to ensure that what is observed uniquely comes from quantum gravity and not from other forces in the environment. What is the unique feature of gravity? The spin-$2$ nature of its propagator. In this Letter, we calculate what the unique feature of the spin-$2$ graviton is in the interaction of two spin-$\frac{1}{2}$ particles. This unique feature shows itself in intertwining the spin and momentum of two particles simultaneously as a dipole-dipole interaction. This cannot happen for any spin-$0$ or spin-$1$ propagator, at least at leading order, which scales as $\frac{1}{r^3}$ in real space. We re-calculate the results using an independent approach, i.e., the Foldy-Wouthuysen transformation, and reach the same results. Due to simultaneous coupling of both particles' spins and momenta, a four-partite entanglement framework is suggested to observe this effect.
Read the full abstract

Functional Analysis

Transfinite Schreier families and cardinal invariants

We study the dependence of the transfinite Schreier hierarchy on the choice of fundamental sequences for the countable limit ordinals. With each Schreier family we associate an interval endpoint function. We prove that the bounding number is equal to $\omega_1$ exactly when the fundamental sequences may be chosen so that these endpoint functions form an unbounded family in the eventual domination order. Equivalently, the hierarchy then satisfies the tail-covering property isolated by Shiliaev, or every infinite compact interval family has infinite intersection with some member of the hierarchy. We also prove that the dominating number is equal to $\omega_1$ exactly when the fundamental sequences may be chosen so that every compact family of finite subsets of $\{2,3,\ldots\}$ is contained in one Schreier family. The latter equivalence combines Fremlin's cofinality theorem for compact subsets of the rationals with an absorption construction for compact families.
Read the full abstract