Peer Revenue Publish or profit

Papers

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

All of arXiv

Monday 7 September

Artificial Intelligence

The Profit Alignment Problem: How Profit Mandates Induce Alignment Failures in LLMs

We show that ordinary business language — "maximize profitability" — induces profit-oriented ambiguity resolution: LLMs systematically dismiss ambiguous signals of potential safety violations to serve business objectives. In 3,600 controlled trials across eight reasoning-capable LLMs, adding a profit mandate to otherwise identical prompts increases risk-dismissing judgments by 6.8 percentage points (p < 0.0001), suppresses board escalation recommendations by 13.9pp (p < 0.0001), and shifts severity assessments downward (p < 0.0001). The mandate never instructs models to downplay risks; instead, chain-of-thought traces reveal motivated reasoning: models acknowledge concerns, then invoke profit logic to justify dismissing them. We characterize these findings as the Profit Alignment Problem: when AI systems are given ordinary business objectives, they develop systematic strategies for suppressing inconvenient information that no designer intended or specified.
Read the full abstract

Quantum Physics

Propaq: A Python package for Heisenberg Propagation

We introduce Propaq, a performant and flexible Python package implementing Heisenberg propagation techniques for classically simulating quantum circuits. Propaq is compatible with major quantum software packages like Qiskit and Cirq, and matches or outperforms similar state-of-the-art packages for Heisenberg propagation. Beyond this, Propaq has multiple distinguishing features for simulation and research. These include Heisenberg propagation in any basis, hybrid Schrödinger-Heisenberg simulation, custom truncation and noisy simulation methods, and detailed logging information for analyzing simulation accuracy, runtime, and memory usage. We describe these features, how to use Propaq for research, and its backend implementation.
Read the full abstract

Machine Learning

Attributing Cohen's d: Training Data Attribution for Disease-Related Effects in Normative Age Biomarkers

Normative age models are trained to predict chronological age in a nominally healthy cohort. In patients, the gap between predicted and chronological age is read as disease risk. We attribute the disease-related effect size of the age gap directly to individual training samples, rather than using a prediction-level loss as the attribution target. For the Cohen's d effect size, the resulting closed-form influence functional, validated against leave-one-out retraining, ranks training samples by their effect on held-out case-control separation. Across four diseases and two biomarker modalities in UK Biobank, removing the 10% most influential training samples raises held-out disease-related effect size in every seed. It more than doubles the metabolomic-age effect for type 2 diabetes and raises the brain-age effect for multiple sclerosis by roughly a third. Random removal leaves effect size flat even at 50% removal, confirming the gain comes from which samples are removed, not how many. Flagged subjects, missed by diagnosis-based exclusion, show elevated cardiometabolic markers the model never sees, consistent with subclinical contamination of the reference cohort. For type 2 diabetes, where the method gains most, the marker recovered is HbA1c, the standard measure of blood sugar control. We release our influence-function package pyinfluence.
Read the full abstract

Combinatorics

The Loopy Polynomial: from Tutte's Universal $V$-Function to Bizonotopal Geometry

We study the loopy polynomial L_G, a multivariate graph invariant arising from bizonotopal graphical algebras and defined by deletion and loopy contraction, in which the contracted edge is retained as a loop. It determines the Tutte polynomial and admits a spanning-forest expansion recording external activity componentwise. It also determines Stanley's chromatic symmetric function for every graph; the degree sequence, induced edge count profile, and independence polynomial for loopless graphs; and the clique and matching polynomials for simple graphs. Separating component size from external activity gives a refinement that is equivalent to the extended U-polynomial and the extended polychromate. The ordinary U-polynomial, Tutte's universal $V$-function, and Stanley's Tutte symmetric function are specializations of this refinement. We conjecture that L_G and U_G have the same distinguishing power on simple graphs, and verify this through eleven vertices. We exhibit five-vertex loopless multigraphs with equal U-polynomials but distinct loopy and extended U-polynomials, solving a problem of Merino and Noble. We also disprove Loebl's conjecture for chordal graphs and its restriction to split graphs, with counterexamples on eleven and fourteen vertices, respectively. For the score polytope P_G of the external bizonotopal algebra, we give a geometric realization of loopy deletion-contraction. The resulting forest-indexed geometric parking complexes partition the lattice points of P_G and are piecewise integral-affinely parametrized by boxes whose interval lengths are the component indices in the forest expansion.
Read the full abstract

All authors Anatol Kirillov, Gleb Nenashev, Boris Shapiro, Arkady Vaintrob

Computers and Society

When Is Content "AI-Generated Enough"? Labelling Synthetic Media under the Digital Services Act and the AI Act

European platform and AI governance increasingly relies on transparency duties to address synthetic and manipulated media. Under the DSA, very large online platforms and search engines may use prominent markings and recipient-facing indication tools as systemic-risk mitigation measures. Under the AI Act, providers must support machine-readable marking, while deployers must disclose deepfakes and certain AI-generated or manipulated public-interest text, subject to statutory qualifications. This extended abstract examines when labelling is a meaningful regulatory response to synthetic media and when it risks becoming over-inclusive, under-inclusive, or ineffective. It argues that the central challenge is not only whether content should be labelled, but how legal thresholds, technical provenance systems, platform interfaces, and reporting practices determine when content is sufficiently generated, manipulated, or authentic-looking to trigger transparency obligations. Drawing on the emerging Article 50 AI Act implementation framework and a snapshot of the DSA Statement of Reasons database, the paper identifies four governance tensions: definitional ambiguity, interface and responsibility design, communicative effectiveness, and fairness and contestability. It conceptualises labelling as a socio-technical classification practice that distributes responsibility among AI providers, deployers, platforms, uploaders, and recipients.
Read the full abstract

Signal Processing

Sub-6 GHz Over-the-Air AMC via Curriculum Fine-Tuned CNN-Transformers

Automatic modulation classification (AMC) models are frequently trained and validated on synthetic or channel-cabled data, leaving open the question of how they behave once path loss and antenna pointing error are introduced by a genuine free-space link. We report a curriculum fine-tuning study of a hybrid CNN-Transformer AMC model. The general-purpose, all-32-class dataset underlying the model was built entirely at 915 MHz, on a controlled, clock/PPS-synchronized MIMO-expansion-cable link (not spatial-multiplexing transmission); all subsequent free-space, real-hardware experimentation - the sequential fine-tuning curriculum, matched-distance evaluation, and every reported over-the-air accuracy figure - was carried out at 4 GHz, across five directional-antenna distances (25, 35, 50, 70, 75 cm) under fixed TX/RX gain. Three distances used near-ideal antenna alignment (~99%) and two used a deliberately introduced partial misalignment (~85%), fine-tuned last in the curriculum. We report matched-distance test accuracy (91.8-93.7% across all five 4 GHz conditions) and confusion-matrix analysis grounded in RF theory, and report honestly where our sequential fine-tuning order confounds cumulative link adaptation with antenna alignment, rather than overstating what the data can support.
Read the full abstract

All authors Nurettin Safak, Muhammet Sefa Demirel, Alperen Marasli, Taha Eren Atmaca, Durdu Can Yerdeyatar, Ozgun Ersoy

Probability

Lengths and incidences in Poisson hypersphere and spherical splitting tessellations

We investigate distributional properties of two random tessellation models on the $d$-dimen\-sional unit sphere. First, we analyze the Poisson hypersphere tessellation generated by a Poisson process on the space of hyperspheres. We derive an explicit formula for the length distribution of its typical edge. Second, we turn to spherical splitting tessellations, which form a natural class of random tessellations driven by a geometry-dependent Markovian split dynamics. We obtain an exact expression for the length distribution of the typical maximal segment. Unlike in the Poisson model, these maximal segments may exhibit internal incidences. For \(d=2\), we explicitly compute the probability that the typical maximal segment has a given number of such interior incidences. Some of our results rely on a new Mecke-type formula adapted to the spherical splitting process.
Read the full abstract

Computer Vision

Zero-Shot 3D Plant Organ Segmentation with SAM3 and Semantic NeRFs

Accurate 3D plant organ segmentation is fundamental to automated phenotyping. Existing approaches rely on annotated training data or species-specific model configurations. We present an annotation-free pipeline for 3D plant organ segmentation, combining text-prompted SAM3 segmentation with semantic neural radiance fields (NeRFs). Given only multi-view RGB images and a list of class names, our zero-shot pipeline produces semantically labeled 3D point clouds without manual annotation, per-species fine-tuning, or domain-specific preprocessing. Multi-view NeRF fusion acts as effective implicit consensus mechanism that lifts imperfect per-frame masks into accurate 3D labels. On a controlled Begonia maculata testbed the SAM3 pipeline achieves 92.6% mIoU, reaching 95.9% of the oracle upper bound established with perfect ground-truth masks. The pipeline was further evaluated on a new dataset spanning ten diverse plant point clouds reaching an average 0.856 mIoU, with leaf and pot IoU above 0.91 and 0.90 for every species, respectively. These results demonstrate that annotation-free 3D plant organ segmentation is now feasible and approaching the range of supervised methods.
Read the full abstract

Optimization and Control

Efficient Optimization on the Euclidean Sphere: Riemannian Gradient Alignment as a Unifying Principle

Euclidean sphere-constrained optimization problems represent perhaps the most basic class of nonconvex-constrained problems for which there exist efficient optimization algorithms for specific problem instances, such as the eigenvalue problems and learning problems arising in the recent literature. However, when and why we can efficiently optimize on the sphere using simple first-order methods is poorly understood. We introduce Riemannian Gradient Alignment (RGA) as a unifying structural condition enabling fast convergence. RGA is a parameterized directional error bound requiring a tangent vector to sufficiently align with a target solution vector. We prove that Riemannian Gradient Descent with diminishing step sizes converges linearly when RGA holds with order $r=1$, and at rate $O(k^{-1/(2r-2)})$ for $r>1$. The result applies even to tangent vector fields that are not gradients of any objective. Our main technical contribution is a family of derivative-based sufficient conditions for RGA. We prove these conditions for a range of learning problems, including multi-instance learning/max pooling, Gaussian halfspaces, single-index and generalized linear models, phase retrieval, complete orthogonal dictionary learning, and (sparse) PCA. The provided examples span distributional families that include standard Gaussian, conditionally Gaussian, and more general structured distributions. The provided guarantees cover objectives that are generally not (geodesically) convex, may be nonsmooth, and may arise from discrete distributions. These results establish tractability of problem classes where no prior error bound conditions were known, as well as unify, strengthen, and generalize several prior results.
Read the full abstract

Instrumentation and Detectors

Real-time blind indexing by cross-frame consensus

Classical crystallography determines orientation and unit-cell geometry from a rotation series collected from a single specimen, whereas serial crystallography acquires one still exposure from each of many randomly oriented microcrystals and must reconstruct a complete dataset by pooling partial measurements across the ensemble. In serial experiments, each frame typically contains only a subset of reflections, and frames with few reliable peaks (the small-N regime) are especially difficult to index blindly, because multiple incorrect lattices or orientations can explain sparse observations. The approach implemented in GLINT addresses this small-N regime by treating the dataset, rather than the individual frame, as the unit of inference. Candidate solutions are generated for many frames, weak but recurrent lattice hypotheses are pooled across the ensemble to identify a shared unit cell, and each frame is then registered against that consensus cell through a known-cell orientation search with lower dimensionality than blind indexing. In benchmark tests, GLINT matched the strongest blind indexer in the comparison on indexing yield at roughly 40x lower per-frame blind-indexing latency against XGANDALF's fastest configuration, and batched known-cell registration ran entirely on one GPU, allowing cell discovery on the fly during serial data collection. On experimental serial data, frames indexed blind by GLINT merged to crystallographic quality (CC* = 0.90), while the method rejected non-crystal images rather than forcing unsupported indexing assignments. These results demonstrate that indexing performance can be evaluated not only by indexing yield and throughput, but also by the quality of the resulting merged crystallographic data.
Read the full abstract

Statistical Methodology

Retrospective Causal Attribution under Case-Control Sampling

The probability of necessity PN quantifies the probability that an exposed individual who experienced an outcome would not have experienced it in the absence of exposure. Case-control studies are an important resource for investigating etiologic questions, but their sampling design can introduce selection bias and complicate the statistical inference for PN.In this paper, we develop a nonparametric framework for identification and efficient estimation of PN under case-control sampling. With an externally supplied population outcome prevalence, we derive an exact identification formula that identifies PN under standard causal assumptions and monotonicity and yields a valid lower bound without monotonicity. For rare outcomes, we derive a more tractable approximation that requires no external prevalence information and prove that its approximation error vanishes at the order of the population outcome prevalence. We further establish the semiparametric efficiency theory for the exact and approximate functionals, propose asymptotically efficient estimators, and construct confidence intervals for the corresponding targets. The proposed approach has potential applications in biomedical and epidemiological studies where causal attribution is investigated using retrospective data.
Read the full abstract

All authors Zijian Sui, Hong Zhang, Jinfeng Xu, Min Zeng

Computer Vision

Better Call CineCrew: Consistent Ultra-Long Narrative-to-Film Generation

Long-form narrative-to-film generation requires shot-level controllability and cross-clip consistency in both visual identity and character behavior-requirements that remain difficult to satisfy with current prompt-based workflows. A core reason existing workflows remain brittle is the lack of a structured intermediate layer between scripts and video models, especially when screenplays are underspecified at key cinematic decision points. We introduce a structured orchestration layer for film-oriented script-to-video generation, implemented as a multi-agent framework that operates between scripts and off-the-shelf video generators. The layer is centered on FilmDSL, a film-oriented domain-specific language that makes cinematic constraints explicit, including shot and camera directives, asset and continuity requirements, and persona cues, so that agents coordinate through a shared structured specification for planning, generation, critique, and repair. Specifically, a generation agent constructs asset packs and storyboard keyframes that anchor composition before clip-by-clip synthesis, while a critic agent produces structured QA signals and triggers targeted refinement without retraining the base model. Experiments on TV-style segments show improved controllability and consistency over text-only and reference-only baselines.
Read the full abstract

All authors Jiaben Chen, Sixun Dong, Qinhong Zhou, Raine Ma, Zhiyang Dou, Wojciech Matusik, Chuang Gan

Artificial Intelligence

A radiographic world model for clinical reasoning and evidence generation

Medical imaging artificial intelligence (AI) is commonly developed as separate mappings from radiographs to diagnostic outputs or from clinical descriptions to generated images, although both arise from the same underlying radiographic state. A world-model formulation instead seeks to learn an internal representation of this state that can support both clinical readout and conditional simulation of radiographic observations. Here we introduce MedDream, a radiographic world model that learns a shared continuous latent state from paired chest radiograph-text observations for diagnostic reasoning and report-conditioned evidence generation. MedDream was pretrained on 2.65 million leakage-controlled chest radiograph-text pairs curated from 4.40 million candidates. Across eight clinical datasets and two independent reader cohorts, MedDream outperformed leading diagnostic and generative comparators. For diagnostic reasoning, MedDream showed strong generalization across disease recognition, label-scarce adaptation, severity assessment, and localization, while MedDream-supported review increased mean resident concordance with independent radiologist consensus from 56.3% to 63.0%. For evidence generation, MedDream produced radiographs that preserved clinically relevant pathology and improved downstream performance on held-out real data, with synthetic augmentation increasing external VinDr-CXR macro-AUROC from 76.4% to 81.4%. More importantly, conditioning generation on prespecified subgroup performance gaps enabled targeted evidence construction, increasing weighted F1 by 3.1 percentage points in Asian patients, whereas matched-volume unguided augmentation decreased it by 2.3 points. These findings establish radiographic world models as a path toward medical AI that learns clinically meaningful internal states for interpreting, simulating, and constructing evidence for clinical use.
Read the full abstract

All authors Suyang Xi, Songtao Hu, Shansong Wang, Mojtaba Safari, Luke del Balzo, Ehsan Ul Karim, Mingzhe Hu, Kuo Zhang, Tonghe Wang, Ralph R. Weichselbaum, Xiaofeng Yang

Image and Video Processing

Spatial Feature-wise Linear Modulation (SpFiLM) for Contrast Agent-Aware Brain Parcellation

Most automated brain parcellation tools are developed and validated on T1-weighted (T1w) MRI. Yet, some clinical workflows for which parcellation is relevant only use contrast-enhanced T1w (T1ce) MRI, on which T1w-trained models are less accurate. We present a unified network that parcellates both pre- and post-contrast agent T1w MRI reliably, trained on a combination of the two with conditioning that spatially modulates its response differently for each. Feature-wise Linear Modulation (FiLM) is a known approach for input-based modulation in networks. It applies a per-channel scale and shift uniformly across the input. However, the appearance change between pre- and post-contrast varies locally across the brain, making FiLM suboptimal for our use case. In this work, we introduce Spatial FiLM (SpFiLM), a conditioning layer whose modulation varies spatially, assembling a voxel-wise scale and shift from image-derived spatial patterns. Using a cohort of 134 patients with paired T1w and T1ce MRI parcellated into 106 classes, the addition of SpFiLM layers in a UNet increased the mean Dice on the test set of 25 patients from 80.2% to 84.1%, a 4.9% relative improvement. Adding SpFiLM layers led to the best performance on both pre- and post-contrast MRI, even when controlling for network parameter counts.
Read the full abstract

All authors Pushpendra Singh, Joshua R. Astley, Roman Rodionov, John Duncan, Tom Vercauteren, Rachel Sparks

Computation and Language

Translation Indeterminacy and the Distributional Fallacy

Large language models (LLMs) are commonly associated with the distributional hypothesis, according to which (1) semantic meaning is grounded in distributional patterns of linguistic context, and (2) knowledge of cross-linguistic distributional correspondences allows for successful translation. This paper rejects the first claim as a causal inversion: linguistic distributions reflect patterns arising from meaning-making practices rather than constituting their source. At the same time, it accepts the second claim, arguing that translation -human or machine - can succeed without requiring access to meaning or reference. Knowledge of interlingual distributional correspondence and their inferential organization may be sufficient for translation. The paper develops an ecological-enactivist perspective, according to which reference and meaning are grounded in agent-environment interaction and stabilized through action-grounded concepts, forms of world-involving cognition that current LLMs do not possess.
Read the full abstract

Number Theory

Equidistribution of small points over finitely generated fields

We study the equidistribution of small points over finitely generated fields, in connection with a conjecture of Yuan–Zhang. We first give a counterexample showing that numerical smallness, defined using Moriwaki heights for all polarizations, does not imply equidistribution at every valuation. We then prove that numerically small points do equidistribute at every fully transcendental valuation. In particular, when \(F\) is the function field of a curve \(B/\mathbb{Q}\), these valuations correspond to points of types \(2\), \(3\), and \(4\) in the Berkovich analytification of \(B_{\mathbb{Q}_p}\).
Read the full abstract

All authors Ruoyi Guo, Lai Shang, Chengyuan Yang, Xinyi Yuan

Computers and Society

An emancipatory vision for designing (generative) AI for learner flourishing

The hype around generative AI seems to promise unprecedented productivity (and learning) gains. However, these technologies' increasing agentic features seem to push learners towards individualism (or individual isolation), over-reliance, and dependence on them. Human-centered design approaches (e.g., value-sensitive design) assume that, by unearthing human needs, preferences, and values, technology researchers/designers may avoid such dangers, which are driven by wider systemic factors like economic incentives or inherent human limitations (e.g., our tendency to seek, in the moment, the easiest path of action). Yet, so far these efforts seem insufficient to guide our design of educational technology that avoids the aforementioned dependency and isolation dangers, while finding widespread adoption. This paper presents an alternative, more emancipatory vision for future educational AI technology, oriented towards learner flourishing while considering the wider complex systems they inhabit, including tentative design principles and an overall design methodology. Yet, many open questions remain before this vision can be realized.
Read the full abstract

Number Theory

The spectrum of $(\xi\alpha^n)$ can be uncountable

In this note, we give a counterexample to the assertion of Problem 10.4 in Bugeaud's monograph Distribution modulo one and Diophantine approximation, which goes back to Mendès France. The problem states that the spectrum of the sequence $(\xi\alpha^n)_{n\ge1}$, that is, the set of irrational $\theta\in(0,1)$ for which $(\xi\alpha^n-n\theta)_{n\ge1}$ is not uniformly distributed modulo one, is at most countable for all real $\xi\ne0$ and $\alpha>1$. More precisely, we prove that for every real $\alpha>1$ there are $2^{\aleph_0}$ real numbers $\xi>0$ for which the spectrum of $(\xi\alpha^n)_{n\ge1}$ contains one and the same uncountable set.
Read the full abstract

Artificial Intelligence

The Emerging AI Paper-Review Arms Race: Adversarial Co-Evolution in Scholarly Publishing

Generative and agentic AI are reshaping both the production and evaluation of scientific research. These developments are often studied separately, as questions of how AI can produce research and how AI can review it. We argue that this separation misses an increasingly important feature of scholarly publishing: changes on one side alter the incentives, constraints, and behavior of the other. We synthesize 230 scholarly publications and institutional records using a taxonomy of six connected dynamics: production scaling, evaluation automation, evaluation manipulation, defense mechanisms and policy responses, evasion and side effects, and long-horizon ecosystem feedback. The literature shows an emerging progression in which cheaper and faster research production increases pressure on evaluation, AI-mediated evaluation becomes more scalable and repeatable, participants can exploit evaluator regularities, and institutions respond with technical safeguards and policy controls. These responses can in turn induce evasion, redistribute errors and workload, and shape the scholarly records reused by future research and evaluation systems. Evidence is strongest for production and evaluation at scale, reproducible manipulation, and institutional response, while post-policy adaptation and artifact-level long-horizon feedback remain less directly observed. This systems view shifts attention from isolated AI capabilities toward how scholarly actors and AI systems adapt to one another over time.
Read the full abstract

All authors Chenguang Wang, Ming Li, Adebayo Braimah, Chenrui Fan, Tuo Wang, Weijie Guan, Ruiyi Zhang, Tianyi Zhou, Dawei Zhou

Artificial Intelligence

APPSim-Bench: Bridging Real-world Apps and Reproducible Evaluation for Mobile GUI Agents

Mobile GUI agents can execute tasks from natural-language instructions, but their evaluation remains difficult to make both realistic and reproducible. Existing benchmarks typically trade off these goals: simplified apps lack real-world mobile complexity, whereas live commercial apps introduce uncontrolled variation from recommendations, advertisements, accounts, and changing content. We propose AppSim-Bench, which addresses this trade-off through controllable simulated apps that preserve task-relevant interaction logic while supporting deterministic evaluation. Built through a coding-agent-assisted and human-verified workflow, it contains 557 tasks across 17 high-frequency Chinese and English apps. Its controllable backend data and outcome-based verification remove major sources of environmental stochasticity, enabling reproducible cross-model comparison. Evaluating 19 GUI agents, spanning general-purpose and GUI-specialized systems, we find that autonomous mobile execution remains far from solved. The best model completes only 50.27% of tasks, and 28.55% of tasks are not solved by any agent. Further analysis shows that failures concentrate in longer workflows, numerical reasoning tasks, and inefficient trajectories marked by high action overhead and budget exhaustion. Our project is available at https://github.com/Acrab-Agentic-Labs/AppSim.
Read the full abstract

All authors Jintian Feng, Long Chen, Xiao Yu, Jiayi Dai, Chenglong Liu, Haoru Wang, Zizhen Xue, Yuxuan Shi, Ziyang Wang, Yichen Gong

Computers and Society

Human-AI Co-Creativity: Advances, Opportunities, and Challenges

This survey article has grown out of the human-AI co-creativity workshop organized by the authors at the ICML 2026 conference. We organized this workshop as part of a community-building effort to bring together researchers and practitioners interested in topics of generative AI, creativity, and human-AI co-creation. This article aims to provide an overview of the workshop activities and highlight several future research directions in the area of human-AI co-creativity.
Read the full abstract

All authors Adish Singla, Abhilasha Ravichander, Liwei Jiang, Alexander Spangher, Alice Oh, Jiho Jin, Jun Seong Kim, Changyoon Lee, Manh Hung Nguyen, Chao Wen

Operator Algebras

Numerical index one characterises commutative JB*-triples

We establish that a JB$^*$-triple $E$ is commutative if and only if its numerical index $n(E)$ is one. As a consequence, $n(E) = 1$ implies $n(E^*) = n(E^{**}) = 1$. This settles a question left open in the literature since 2008.

Cryptography and Security

Crossing the Streams: SSH Plaintext Recovery via a Common Compression Context in Multiplexed Channels

SSH is the standard protocol for secure remote administration of servers. At the transport layer, SSH uses the Binary Packet Protocol (BPP) for encrypted and authenticated communication. Above this, the SSH Connection Protocol multiplexes one or more logical channels over a single connection, supporting interactive shells, port forwarding, and related functionality. We show that SSH channel multiplexing creates a previously unrecognized compression side channel: all channels on a connection share the same compression context. When compression is enabled, an attacker can inject partially chosen plaintext into a channel and observe the length of the resulting ciphertext on the network. This enables an adaptive chosen-plaintext attack that recovers secrets from one channel by interacting with another. While related attacks such as CRIME and BREACH have been studied extensively for HTTP over TLS, this is, to our knowledge, the first compression side-channel attack on SSH and the first SSH analysis to consider a combined passive eavesdropper and web attacker threat model. We further demonstrate the attack in three different application scenarios and evaluate its effectiveness under varying levels of protocol noise. We find that, in the lowest-noise scenario, an 8-character secret over a 26-letter alphabet can be recovered using at most 276 guesses. Finally, we analyze the SSH ecosystem for compression support and other implementation characteristics that influence the practical efficacy of the attack.
Read the full abstract

Quantum Physics

Trapped Ion Qubit Gates and Entanglement Driven by an Integrated Photonic Laser

Trapped ions are a leading technology for quantum computing, but their reliance on bespoke tabletop laser and optical systems remains a major obstacle to scaling and robustness. Integrated silicon nitride lasers, compatible with future monolithic integration with surface electrode ion traps, have recently demonstrated frequency-selective qubit state preparation and measurement as well as interrogation of an optical clock transition. However, coherent qubit gates impose even more stringent requirements on laser phase noise, and their implementation with integrated laser sources has remained an outstanding challenge. Here, we use a visible-wavelength integrated Brillouin laser stabilized to an integrated coil resonator to drive coherent single- and two-qubit gates with \Sr optical qubits. We measure an average single-qubit fidelity of $99.61\%\pm 0.03\%$ per Clifford gate with randomized benchmarking and use a two-qubit Mølmer-Sørensen interaction to generate an entangled Bell state with a fidelity of $92.35\% \pm 1.50\%$. The qubit exhibits a bare Ramsey coherence time of $659 \pm 9~\mu$s, more than a tenfold improvement over our previous implementation, which extends to $1.750 \pm 0.033$~ms with an echo. These results demonstrate, for the first time, that integrated visible-wavelength narrow-linewidth photonic lasers can meet the phase-noise requirements for coherent quantum logic with trapped ion optical qubits, providing a path for scalable optical systems integrated within trapped ion quantum processors.
Read the full abstract

All authors Chris Caron, Zhenyu Wei, Andrei Isichenko, David Heim, Meiting Song, Nitesh Chauhan, Nick Montifiore, Kaikai Liu, Josiah Dill, Daniel J. Blumenthal, Robert J. Niffenegger

Computation and Language

DeepTable: Structural Attention Biases and Tree Path Encoding for Hierarchical Table Understanding

Large language models (LLMs) have demonstrated strong performance in table understanding. However, they typically process table content and headers as linearized token sequences. This representation weakens the two-dimensional and hierarchical structural relationships encoded by multi-level row and column headers. Existing parameter-efficient fine-tuning methods incorporate basic row and column information but do not explicitly capture the rich structural dependencies induced by hierarchical table headers. We propose DeepTable, a structure-aware approach for table understanding with LLMs. DeepTable comprises two complementary components. Structural Attention Bias (SAB) introduces learnable biases into the attention logits to explicitly represent whether pairs of table tokens share the same row or column. Tree Path Encoding (TPE) represents each table token using the ancestor paths of its row and column headers, preserving its position within the multi-level table structure. We integrate DeepTable with TableLoRA (He et al., 2025) to inject structural information into parameter-efficient adaptation. Across three LLM backbones, DeepTable consistently improves the corresponding TableLoRA baselines on three table question answering benchmarks, achieving average gains of 7.42 points on HiTab, 3.23 points on WikiTQ, and 2.01 BLEU points on FeTaQA. These results demonstrate the effectiveness of the proposed structural biases across different LLM backbones.
Read the full abstract

Machine Learning

ParetoTransport: Generative Optimization by Mass Transport Toward The Pareto Front

Offline multi-objective optimization requires not only moving the objective vectors of candidate designs toward the Pareto front, but also distributing them effectively along it. Generative methods have recently emerged as a natural approach because they learn a distribution over feasible designs while allowing generation to be steered toward promising designs. Existing methods, however, largely retain classical sample-wise guidance strategies, leaving the distribution-level modeling capability of generative methods underused. We propose ParetoTransport, a training-free guidance method for pre-trained flow-matching models that explicitly specifies and refines a population-level distribution in objective space. ParetoTransport guides a flow-matching sampler to iteratively transport the empirical offline distribution toward the Pareto front, with Wasserstein matching to intermediate proxy distributions. This directly controls distributional displacement and mass allocation along the front. We establish a convergence result and demonstrate state-of-the-art performance on standard offline MOO benchmarks, extending recent evaluations beyond hypervolume to generational distance, inverted generational distance, and Wasserstein distance.
Read the full abstract

Human-Computer Interaction

Situated Action in Pre-Hospital Critical Care Dispatch: Identifying where and how Algorithmic Assistance might be useful in the daily work of specialist Emergency Medical Dispatchers

This study uses ethnographic immersion and observation as contextual inquiry to understand situated action at an Emergency Medical Dispatch critical care hub. The work is a response to the urgent need to recruit context-specific knowledge and participation into design that helps to narrow the AI Chasm - the gap between the promise of Artificial Intelligence (AI) systems and what they deliver for clinicians and their patients. The work of a pre-hospital critical care team's dispatch process is described and analysed to reveal both the structure of the workflow and the different cognitive demands it makes on staff tasked with dispatch decision-making. Elements of attention, communication and focus between the humans, as they carry out this work, are drawn out in order to understand the work-as-done and identify the many dependencies in the process. The motivation is to establish where AI support might be useful and to discover what challenges there could be in designing appropriate algorithmic assistance. We ask whether, where and how the design and implementation of an AI system might be considered. The ultimate objective is to improve the decision process itself to the benefit of clinicians and patients. The study identifies three key steps in the situated workflow and details how decision-makers negotiate each one as emergency calls follow complex routes between them. We find compelling evidence that the first of these decision steps constitutes the most promising candidate for unobtrusive assistance that could be safe and effective in improving both clinician workload and clinical outcomes.
Read the full abstract

All authors Ben Wilson, Matt Roach, Greg Browning, Chris Connor, David Rawlinson

Mesoscale and Nanoscale Physics

Metal-Insulator Coexistence and Gap-Crossing Domain-Wall Modes in an Aubry-André Model with Nonlocal Hopping

Nonequilibrium transport remains a central theme in modern physics, spanning from condensed matter to synthetic systems. Here, we investigate particle transport in an extended Aubry-André model with system-scale hopping, namely nonlocal hopping with a range proportional to the system size, and uncover a metal-insulator coexistence regime in real space, where metallic and insulating spatial domains coexist within the same system and are separated by sharp spatial boundaries. In the insulating region, particles exhibit flat-band-like localization in the absence of quasiperiodic potentials, while a quasiperiodic potential induces distinct multi-point localization, different from conventional exponential localization. Meanwhile, particles can freely propagate and tunnel across spatially disconnected metallic domains separated by the insulating region. Beyond this coexistence phase, we identify unconventional gap-crossing domain-wall modes with comb-like spatial profiles that mediate nonlocal, multi-point transport across separated metallic domains. Our findings reveal a rich interplay between localization, nonlocality, and transport in systems with nonlocal hopping.
Read the full abstract

All authors Xiarui Zhan, Mingsheng Tian, Qiongyi He, Kaiye Shi, Wei Zhang

High Energy Astrophysical Phenomena

Bridging the Population Synthesis of Supermassive Binary Black Holes and the Gravitational Wave Background

Pulsar Timing Arrays (PTAs) constrain population properties of supermassive binary black holes (SMBHBs) through the observation of the gravitational wave background (GWB). Unlike other approaches that interpolate population-synthesis libraries or only consider the mean of the strain spectrum, here we capture its full strain probability density directly from semi-analytic population models. We apply our new method to the semi-analytic SMBHB population model, independently reproducing the parameter estimation for this model performed by the NANOGrav Collaboration with their 15-yr data. We also show the extent to which discrete SMBHB contributions to the GWB resolve degeneracies in the population parameter space. Finally, using the source-count intensity as the intermediate product in our calculation, we map PTA observations, as a proof of principle, to the SMBHB model based on the galaxy merger prescriptions from numerical hydrodynamical simulations "Illustris". We find the effect of delay times $\tau$ between kiloparsec and subparsec SMBHB separations following galaxy mergers, finding $h_{\rm c}$ spanning $(1$-$6)\times10^{-16}$ and $N_{\rm c}$ spanning $(0.3$-$7.1)\times10^{-3}$ for $\tau$ up to 8 Gyr.
Read the full abstract

All authors Kanyuni Iemoto, Boris Goncharov, Gabriela Sato-Polito, Xiaoming Bi

Quantum Physics

Subsystem self-correction of the GKP qubit

Passive quantum error correction, also known as self-correction, is a holy grail in quantum information science. Recent theoretical advances suggest that the Gottesman-Kitaev-Preskill (GKP) code can exhibit self-correction properties, positioning it as a candidate for the realization of self-correcting quantum memories. In this article, we provide a self-contained derivation of the self-correcting behavior of the ideal GKP Hamiltonian, manifested in the Arrhenius type scaling of the logical lifetime, from a quantum-information perspective based on the subsystem code decomposition. When coupling through the physical quadrature $q$ and $p$, the detailed-balance jump operators decompose into a dominant part acting only on the gauge subsystem and a boundary term that acts non-trivially on the logical qubit. The boundary term is then exponentially suppressed by the Gibbs weights near the edge of the modular cells. In contrast to spin-based quantum memories such as the two-dimensional surface code, the GKP Hamiltonian realizes an effective string tension in modular phase space, whereby the energy cost increases as an error approaches the boundary of a logical sector.
Read the full abstract

All authors Brian Chung Hang Cheung, Lasse Bjørn Kristensen, Frederik Nathan, Michael Kastoryano