Peer Revenue Past citations are no guarantee of future returns

Papers

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

All of arXiv

Sunday 13 September

Human-Computer Interaction

CALICO: A Human-Centered, Codebook-Aligned System for Annotation

Large language models are increasingly used to scale codebook-based annotation in scientific research, but existing workflows provide limited support for translating domain experts' codebooks into reliable, revisable, and auditable prompts. Prompts are often treated as fixed instructions and hidden from annotators, making it difficult for non-technical domain experts to diagnose and correct model behavior when outputs violate codebook guidelines. In this paper, we present CALICO, a human-centered, codebook-aligned annotation workflow that treats prompts as editable, versioned, and optimizable artifacts. CALICO integrates codebook parsing, prompt generation, result inspection, prompt versioning, natural language human feedback, and label-supervised prompt optimization through existing optimizers such as GEPA, MIPROv2, and OPRO, together with our reflection-based optimizer, ReflectAgent. Empirically, we evaluate CALICO on domain-specific AI-companion chatbot conversation codebooks. Across evaluated dimensions, CALICO improves mean held-out performance by +13.0 and +7.4 absolute points for two coders, respectively. A coder-specificity analysis further suggests that optimized prompts capture coder-specific interpretations rather than only generic codebook clarification. CALICO runs as a web application that takes users from raw codebook materials to inspectable, exportable labels; the website, codebase, and live demo are released at https://calico-annotation.github.io/ under the Apache 2.0 License.
Read the full abstract

All authors Boqin Yuan, Xiaoyi Gu, Fiona Li, Chang Wan, Angel Hsing-Chi Hwang, Jieyu Zhao

Computer Vision

CrossDistill: Balancing Quality and Diversity via Trajectory-Level Hybrid Few-Step Distillation

Few-step distillation accelerates diffusion models but must balance diversity and fidelity: trajectory-based distillation preserves mode coverage, while distribution matching sharpens samples but can reduce diversity. We show that this tension can be exploited in a noise-regime-dependent way: high-noise steps largely determine global modes, whereas low-noise steps refine local details. We propose CrossDistill, a trajectory-level hybrid distillation framework that splits the sampling trajectory at a crossover point, applies a trajectory-preserving objective on the high-noise interval and a distribution-matching objective on the low-noise interval, and couples the two stages through the crossover state. In contrast to loss-level mixing, and complementarily to training-time two-stage recipes, CrossDistill explicitly assigns complementary objectives along the noise axis, so that global branching is preserved before local statistics are sharpened. CrossDistill is a noise-level scheduling policy: PCM and DMD are plug-in instantiations, while the noise partition, crossover coupling, and objective ordering are the key design elements. Experiments on text-to-video diffusion models and qualitative image-to-video results show that CrossDistill expands the few-step quality-diversity frontier, retaining seed-level variation while achieving competitive visual fidelity.
Read the full abstract

All authors Yuxi Liu, Haoyu Li, Yixiang Cai, Tengxu Sun, Zekun Zhang, Baole Ai, Ang Wang, Jiamang Wang, Lin Qu, Kun Yuan, Kai Zhang

Artificial Intelligence

Bayesian Intelligence from the Outside

Inferring intelligence from observable behavior is a foundational challenge in artificial intelligence. We develop a theory of Bayesian intelligence for agents such as language models. Each prompt induces a possibly imperfect internal experiment; the agent updates a full-support prior by Bayes' rule and faithfully reports its posterior over the possible answers to the question. Repetitions draw fresh, independent outcomes from the same unobserved experiment at one fixed state. We show that the agent's behavior admits this explanation if and only if its reports are not fully contradictory, i.e., some state remains possible under every report across all prompts. Report frequencies and the sizes of positive probabilities impose no further restrictions. We further propose and characterize the behavioral implications of an intelligence order that makes the behavior of two agents consistent with one agent having access to a more informative experiment: there should exist a coupling of report distributions such that the more informative agent's report excludes every answer excluded by its counterpart. Finally, we show the difficulty of aggregating coarse reports from intelligent agents: unless the agent reports a belief about the complete state of the world, the optimal aggregation can assign arbitrary weights to states that have not been excluded. These results provide a basis for understanding when agents' behavior is intelligent and highlight the difficulty of rejecting Bayesian rationality.
Read the full abstract

Cryptography and Security

Detecting and Localizing Segment-Level Poisoning in Multi-Source LLM-Agent Inputs

Modern large language model (LLM) agents often construct prompts by aggregating retrieved passages, user reviews, and documents from multiple external sources. This paradigm exposes them to segment-level poisoning attacks, in which an adversary controlling only a small subset of sources injects malicious content to manipulate model outputs. Existing defenses mainly rely on textual patterns, external embeddings, or auxiliary detectors and may therefore fail against fluent, semantically plausible poisoned segments. They also provide limited support for locating the responsible segments. We observe that successful corrupted-evidence and adversarial-instruction attacks induce structured shifts in the LLM's internal activations, forming a consistent activation-space pattern that we call the poison direction. Based on this observation, we propose ActProbe, an internal-state-based framework for detecting and localizing poisoned segments in multi-source LLM inputs. ActProbe projects MLP activations onto a learned poison direction and uses a lightweight linear SVM trained on a small calibration set to detect contaminated prompts. It then applies BinRoL, which combines recursive replacement ablation, Mahalanobis-distance-based branch pruning, and MAD-based robust leaf detection to locate poisoned segments. ActProbe requires no modification to the backend LLM and reduces localization overhead from O(n) exhaustive probing to O(k log n) forward passes. Across three datasets, two attacks, and four open-weight LLMs, ActProbe achieves a 0.01 false-positive rate, a 0.05 false-negative rate, 0.94 localization recall, and a 0.90 localization F1-score. It remains effective against defense-aware adaptive attacks and can protect black-box APIs through surrogate-based poisoned-segment removal.
Read the full abstract

All authors Xue Tan, Changhui Wang, Sanrui Yang, Hao Luan, Zhuyang Yu, Jin Wei, Ping Chen, Xiaoyan Sun, Jun Dai

Computer Vision

PC$^2$-AD: Point Cloud Upsampling to Safeguard 3D Anomaly Detection with Resolution-constrained Edge Devices

Low-cost and low-resolution sensors used in edge deployments can produce test point clouds that are substantially sparser than the normal training data. This train-test sampling-resolution gap changes the local geometry available to a 3D anomaly detector. We propose PC$^2$-AD, a point cloud upsampling framework that compensates sparse test inputs before downstream detection. Target Domain Candidate Generation (TCG) adapts a pretrained upsampler to normal training geometry and generates a dense candidate pool. Geometry-Aware Candidate Filtering (GACF) selects candidates according to geometric spacing and spatial coverage. Normality-Preserving Point Compensation (NPPC) refines the selection by comparing candidate normality scores with those of their input anchors. The selected points are combined with the unchanged input points and processed by the existing detector. Experiments with six detectors on two Anomaly-ShapeNet settings and Real3D-AD show improvements in the mean of object-level and point-level AUROC for all six detectors in each Anomaly-ShapeNet setting and four on Real3D-AD. These results support point cloud compensation as an input-level approach to improving 3D anomaly detection under low-resolution sensing conditions. Code is publicly available at https://github.com/gyutong406-commits/PC2-AD.
Read the full abstract

All authors Yutong Gu, Yingxi Xie, Kejin Huang, Jian Ning, Hanzhe Liang, Linlin Shen, Jinbao Wang

Software Engineering

A Two-Dimensional Study of the Model Context Protocol: Publication and Adoption

The Model Context Protocol (MCP), released by Anthropic in November 2024, standardizes how large language model applications connect to external tools and data sources. Despite MCP's rapid growth, no study has jointly characterized its emergence in the research literature, its adoption on GitHub and the relationship between them. We address this gap with a longitudinal, two-dimensional study of 802 MCP-related publications and 33,319 GitHub repositories. We characterize their growth and identify their application domains via BERTopic and usage contexts via a human-validated GPT-5.6-Luna classifier. We find that publications and repositories began rapid growth within a month of each other in 2025, and peaked together in March 2026. Notably, a second growth wave alone accounts for 49.5% of the GitHub repositories. Most publications (57.8%) and nearly all repositories (93.7%) use MCP as an enabling technology rather than for analyzing, evaluating, extending, or securing it directly. Among repositories, the latter category concentrates almost entirely in one general-purpose topic, while applied usage spreads into product-specific niches. Finally, we provide an overview of the MCP landscape and recommendations to researchers and practitioners in this field.
Read the full abstract

Applied Physics

Shape- and Cation-Engineered Ferrite Nanoparticles for Enhanced Theranostic Performance in Ovarian Cancer Tumor-Mimicking Phantom

Magnetic hyperthermia integrated with magnetic resonance imaging (MRI) requires nanoparticles that combine strong heating, T2 contrast, and hemocompatibility after systemic administration. Here, we prepared citrate-stabilized ferrite nanoparticles (Fe3O4, Co0.6Fe2.4O4, Zn0.3Fe2.7O4, and Zn0.35Mn0.25Fe2.4O4) in spherical (8-10.5 nm) and quasi-cubic (9-12.5 nm) forms, along with 35 nm Fe3O4 cubes. By coupling morphology engineering with spinel-lattice cation substitution, we tuned saturation magnetization, coercivity, T2-weighted signal attenuation, and heat dissipation in ovarian tumor-mimicking phantoms under clinically compatible alternating magnetic fields. The 35 nm Fe3O4 cube and quasi-cubic Zn0.35Mn0.25Fe2.4O4 generated the highest phantom temperature rises, whereas smaller spherical particles produced softer heating. All formulations were cytocompatible in SKOV3 cells, with >96% viability at 24 h. However, hemocompatibility distinguished the leading candidates: 35 nm Fe3O4 cubes induced red blood cell deformation despite minimal hemolysis, while 9 nm quasi-cubic Zn0.35Mn0.25Fe2.4O4 showed no change versus PBS up to 1,000 {\mu}g mL-1. Perfusable GelMA models under physiological flow further confirmed biocompatibility. MRI phantoms showed that Fe3O4 cubes produced extended signal voids that may obscure boundaries. Overall, 9.5 nm quasi-cubic Zn0.35Mn0.25Fe2.4O4 is the leading intravenous candidate, combining strong heating, T2 contrast, and hemocompatibility, whereas large Fe3O4 cubes are better suited for localized intratumoral hyperthermia.
Read the full abstract

All authors Bahareh Rezaei, Md Shahriar, Shahriar Mostufa, Karla Mercedes Paz González, Nguyen Thuy Linh Tran, Changxue Xu, Jenifer Gómez-Pastora, Kai Wu

Systems and Control

Recent Advances in Resilient Multi-Energy Systems Against Climate Change

Climate change is a global threat to the long-term sustainable development of energy systems. Recent works have explored the emerging opportunity of coordinating different energy carriers and sectors (e.g. electricity, natural gas, heating, hydrogen, transportation, and water sectors) to unlock the cross-sector flexibility against climate change. This review has established a holistic framework for resilient multi-energy systems through the lens of nested coupling. It covers the most recent progress in resilience resources, resilience evaluation, resilience-oriented operation & planning, resilience pricing & investment, and real-world implementation. This work differs from prior studies through a full investigation on climate change impacts (distribution shifts), resilience pricing, and global projects. Within this area, we advocate for a unique and interdisciplinary perspective spanning across energy systems, climate science, sociology, economics, and data science. At the end, seven major challenges and opportunities are identified, including data deficiency, distributed coordination & privacy, high-fidelity simulation, and machine learning techniques. Researchers, industrial experts, and policy makers can follow this review to capture the emerging trend and future opportunities in this growing area.
Read the full abstract

All authors Grant Ruan, Zhengmao Li, Yi Wang, Ning Zhang

Machine Learning

Are Gradient Boosting Models Suitable for Intermittent Demand Forecasting?

Demand forecasting is critical in modern industry, offering opportunities to reduce costs and gain competitive advantage through improved inventory management. However, forecasting becomes particularly challenging for products with intermittent demand, where demand occurs infrequently and time series contain many zero observations. Such dynamics are common across diverse sectors, such as industrial organizations, consumer goods, aviation, automotive, and electronics. Motivated by these challenges, this paper explores the potential of gradient boosting models to improve forecasting performance. We evaluate statistical, specialized, machine learning, and ensemble approaches across multiple datasets. The results show that specialized methods achieve the strongest performance among individual models, while gradient boosting on its own tends to underperform. However, combining a machine learning model with a specialized approach improves forecasting accuracy by up to 10%, demonstrating that even simple ensembles can outperform single models. Overall, the findings highlight the value of combining machine learning with domain-specific forecasting techniques for intermittent demand.
Read the full abstract

Machine Learning

Carryover Drafting: Recycling Rejected States for Speculative Decoding

Speculative decoding accelerates LLM inference by verifying multiple drafted tokens in parallel, allowing a single target forward pass to accept several tokens. By construction, verification computes representations for both accepted and rejected tokens. Yet, conventional drafters retain only the representations of accepted tokens, leaving the substantial verifier computation spent on rejected tokens effectively wasted. We find that these discarded hidden states generated during target forward retain useful information about future tokens that can improve subsequent drafts. However, realizing this opportunity poses two distinct challenges. At inference, recycling overhead can increase drafting latency, diminishing the speedup gained from increased acceptance length. During training, standard parallel drafter training does not produce inference-aligned rejected states, while obtaining them through sequential rollouts would sacrifice parallelism across training positions. We introduce Carryover Drafting, which addresses both challenges. Carryover recycles rejected target hidden states as temporary KV context, allowing the drafter to selectively attend to them. It reuses the drafter's existing interface and adds only a single learned embedding to distinguish rejected states from committed context. The additional KV context is replaced each drafting round, keeping its length bounded by one proposal block. We introduce parallel draft–verify–draft training that exposes the drafter to inference-aligned rejected states while preserving parallelism across training positions. Experiments with DFlash and a DSpark-derived semi-autoregressive drafter across two target models show that this simple Carryover mechanism improves average acceptance length by 6.5–14.7% and end-to-end vLLM speedup by 7.9–14.4% over the corresponding baselines, with speedup gains reaching 28.8% on translation.
Read the full abstract

All authors Jahyun Koo, Sunghyeon Woo, Jaeeun Kil, Jeongtae Lee, Sungjae Lee, Kyomin Jung, Minsub Kim

Artificial Intelligence

Moral Rebel Agents: Decision-Making Under Conflicting Obligations

Autonomous agents are typically obliged to follow user-assigned tasks. However, strict obedience may conflict with moral obligations that arise during execution. This paper investigates moral rebellion: the ability of an autonomous agent to deviate from a user-assigned task when morally justified. We formalize five agent architectures: an amoral agent that pursues assigned tasks without considering moral obligations, and four forms of moral rebel agency: (1) utilitarian agents that opportunistically maximize task outcomes; (2) deontic agents that enforce normative constraints; (3) utilitarian-deontic (UD) agents that combine deontic constraints with utilitarian reasoning; and (4) dutiful agents that additionally preserve commitments to assigned tasks. We implement these architectures within a hierarchical task network planning framework and evaluate them in a Mini Search-and-Rescue domain that exposes trade-offs among assigned-task completion, opportunistic rescue, and norm compliance. Our empirical results show that the proposed agents exhibit distinct trade-offs among rescue results, assigned-task completion, and norm compliance. In particular, the preservation of task commitments emerges as an important dimension of moral rebellion, for which the UD and dutiful agents produce substantially different behaviors despite their shared utilitarian and deontological foundations. These findings highlight the importance of commitment-aware moral reasoning for autonomous agents operating in morally consequential environments.
Read the full abstract

Artificial Intelligence

Depth and Scale in the Sub-150M Regime: JugnuLM-53M vs JugnuLM-110M

We scale our conventional sub-150M pretraining recipe from 53.5M to 109.7M parameters, holding the method fixed (Qwen3-style decoder with grouped-query attention, RoPE, SwiGLU, RMSNorm, QK-Norm, and a z-loss; FineWeb-Edu data) and changing only the geometry to a deep-and-thin 23-layer x 576-hidden design. The larger model improves across the board – BLiMP 78.1 -> 81.3, ARC-Easy 51.4 -> 52.5, WikiText-2 byte-perplexity 2.04 -> 1.95 – and its 81.3% BLiMP essentially matches GPT-X2-125M (81.28) at about 12% fewer parameters. Notably the 110M model achieves this on fewer training tokens (about 8B vs 12B), so the gain is attributable to capacity and depth, not more data. Both models are deliberately conventional; this report is a clean scaling control and the baseline rung (R0) of an ablation study of what further improves models in this regime. An ablation ladder follows: value residuals (R1) and the Muon optimizer (R2) lift ARC-Easy by a cumulative +3.6 (52.5 -> 56.1) at a near-flat BLiMP and are kept; a diverse data blend (R3) and two logit-distillation settings (R4a/R4b) are not kept – honest negatives. R3 pins ARC-Easy to FineWeb-Edu's educational filtering rather than raw diversity; distillation from a 1.7B teacher can reach the class-leading ARC-Easy (56.99, matching GPT-X2-125M) but only at a perplexity cost that dialing KD down then erases – so R2 remains the best kept stack.
Read the full abstract

Number Theory

Prime Plus a Non-Square-Free Integer: An Elementary Approach

Lee and O'Clarey recently conjectured that every integer $n>24$ can be written as the sum of a prime and a positive integer that is not square-free. They proved this for odd $n$, and for all $n>24$ assuming the generalised Riemann hypothesis for Dirichlet $L$-functions. We prove their conjecture unconditionally for every integer $n>24$ that is not divisible by $997\#$, where $997\#=\prod_{p\leq 997}p$. In particular, any counterexample must be divisible by every prime up to $997$, and hence exceeds $10^{415}$. The proof uses an elementary congruence argument together with finite computation.
Read the full abstract

Differential Geometry

Finiteness of null subvarieties and optimal destabilizers for the J-equation

Let $X$ be a compact Kähler manifold and $(\alpha,\beta)$ be a pair of Kähler classes. We show that when $(\alpha,\beta)$ is $J$-semistable, the collection of positive-dimensional irreducible $J$-null subvarieties is finite. We also obtain a uniform positive lower bound for the normalized $J$-slope of every irreducible non-$J$-null subvariety. This confirms the finiteness and uniform-gap expectation of Khalid-Sjöström Dyrefelt \cite[Section 1.2, Theorem 1.5; Remark 1.8]{KSD26}. As a corollary, we show that the collection of optimal destabilizers is finite when the stability threshold is nonpositive.
Read the full abstract

Performance

Learning Metastable Dynamics

Metastability—a phenomenon where systems remain trapped in quasi-stable states before abruptly transitioning under rare perturbations—is ubiquitous in physical systems. Although metastability is a widely observed phenomenon, its identification and analysis present significant challenges. To address these challenges, we propose a novel framework for analyzing metastability using Koopman theory. We use a finite set of system trajectories to learn a representation of the dynamics that defines a latent space in which the system evolves linearly, thereby enabling a systematic characterization of metastable behavior through the spectral properties of the linear mapping. Empirical evaluations demonstrate that our approach is capable of anticipating metastable behavior significantly earlier than its actual manifestation, even with $10\%$ of the simulation duration. Moreover, we establish that the dominant eigenvalue of the learned Koopman matrix in the latent space serves as a critical indicator for detecting metastability across both single-server and multi-server configurations.
Read the full abstract

All authors Rupak Majumdar, Mahmoud Salamati, Nikhil Singh, Sadegh Soudjani

Machine Learning

GRPO-QPS: Target-Preserving Reinforcement Learning for Quantum Posterior Sampling

Bayesian quantum tomography requires efficient inference while preserving a posterior fixed by the prior and Born likelihood. Learned transport provides fast amortized samples, but reward tuning can reshape the generated distribution rather than improve exploration of this fixed target. We introduce GRPO-QPS, a target-preserving framework in which GRPO learns proposal behavior and an exact Metropolis correction preserves the posterior after training. Across the evaluated reconstruction benchmarks, GRPO-QPS improves over BuresTomFlow and Flow-GRPO on thermal, cat, Dicke, and cluster families, and it closely matches an exact two-qubit reference posterior. Tuned conventional MCMC is slightly stronger on several original continuous benchmarks where the available fixed proposals already match the posterior geometry well. To test whether this reflects a fundamental limitation of learned exploration, we evaluate a more challenging multimodal thermal posterior. At six qubits and 800 shots, the learned proposal achieves a minimum effective sample size of 102 per $1{,}000$ likelihood calls, compared with 28 for prior independence, 27 for a tuned fixed mixture, and 20 for Haario adaptive Metropolis. A record-conditioned policy also transfers to unseen 3,000-shot records, matching or exceeding the strongest conventional baseline in all nine held-out seed-record comparisons. These results show that GRPO-QPS combines target-preserving Bayesian inference with broad gains over learned transport baselines and a sampling advantage when efficient exploration requires proposal geometry beyond the evaluated conventional kernels.
Read the full abstract

All authors Yufeng Wang, Parivesh Priye, Lu Wei, Haibin Ling

Robotics

A Novel Robot-Assisted Learning Pedagogy for Children with ASD

Interaction paradigms used in robot-assisted autism intervention have historically employed robots as teachers, clinical assistants, or more-abled peers to promote a variety of social skills. These modalities often leverage the expertise of trained practitioners to ensure that child-robot interactions are productive or clinically grounded to yield positive therapeutic benefits for children across the autism spectrum. Yet, despite the fact that the majority of children with autism spectrum disorder (ASD) attend mainstream schools and spend 80% or more of their time in the general classroom [27], there is a paucity of research incorporating validated classroom teaching pedagogies into robot-assisted autism interventions. In this work, we introduce a novel teaching methodology for advancing social skills in school-aged children with ASD. We evaluate the effectiveness of a novel robot-assisted autism intervention which incorporates the learning-by-teaching pedagogy and explores the comparative benefits of employing a robot versus a human confederate for improved performance on a set of social skills tasks. Results show that 80% of study participants performed better in the robot condition (mean performance in the robot condition=63%, mean performance in the confederate condition=37%), irrespective of the scenario order. Further, 90% of all participants were significantly more engaged in the robot condition (mean engagement: robot=61%, confederate=32%) and, while the effect did not result in the confederate condition, analyses indicate that overall engagement in the robot condition contributed to improved performance. These results suggest that robots employed in a learning-by-teaching context may help enhance engagement and improve performance on a simple social skills task for children with ASD.
Read the full abstract

All authors Laura Boccanfuso, Erin Barney, Marilena Mademtzi, Claire Foster, Quan Wang, Colette Torres, Lisa Chen, Brian Scassellati, Pamela Ventola, Frederick Shic

Machine Learning

An immune world model for multiscale forecasting and therapeutic hypothesis generation

Immune therapies act across cell-intrinsic programs, tissue ecosystems, and patient-specific immune states, yet most predictors address these scales separately. We used a governed evolutionary AI Scientist to construct the Immune World Model, an action-conditioned model that learns how interventions move immune states across cellular, tissue, and individual levels. The Immune World Model–building Scientist searched candidate architectures and workflows, and the resulting world model was frozen before independent confirmation. The frozen model generalized to unseen interventions and biological contexts, recovered intervention-specific cellular programs, integrated cell and tissue information to improve ecosystem and patient-response prediction, and forecast unseen perturbation combinations. Immune World Model–guided analysis then combined measured perturbations with cross-axis inference to nominate IL-36$\gamma$ plus SIRP$\alpha$ inhibition as a complementary-axis therapeutic hypothesis, whereas a governed self-correction audit rejected every screened cytokine pair. The Immune World Model provides a framework for multiscale immune simulation that connects AI Scientist-driven model construction, intervention forecasting, and the generation of prospectively testable therapeutic hypotheses.
Read the full abstract

All authors Taoyong Cui, Xi Wang, Zonghang Li, Jinchao Ding, Lingsen You, Yuzhi Xu, Wanghan Xu, Fang Wu, Kejun Ying, Wanli Ouyang, Pheng Ann Heng, Ling Yang, Zhenfei Yin, Yingcheng Wu

Artificial Intelligence

Lightning Weave: Improving the Accuracy-Efficiency Frontier of Reasoning Models through Capability Composition

A core goal of efficient reasoning is to improve the accuracy-efficiency frontier. However, jointly improving reasoning accuracy and inference efficiency can be challenging, as the two objectives can favor different reasoning behaviors. Independently post-trained models already offer distinct strengths in accuracy and efficiency. We introduce Lightning Weave, a post-training framework that extracts and composes these independently learned capabilities in a single student through on-policy distillation. Each acquired capability is represented by the policy shift from the model before post-training to the resulting specialist. Lightning Weave combines aligned log-ratio shifts at shared student token states and uses Tilted-Target DOPD to convert the cached signals into a stable learning target. Each anchor pair scores the cached trajectories once, enabling subsequent student training without serving multiple live anchor models concurrently. Across diverse student models and benchmarks in mathematics and code, Lightning Weave substantially improves upon the base students and achieves a state-of-the-art accuracy-efficiency frontier. On Qwen3.5-4B, it raises HMMT 2025 accuracy from 59.2% to 64.0% with 10.7% fewer response tokens, and LiveCodeBench v5 accuracy from 41.7% to 54.2% with 9.6% fewer response tokens. Adjusting the relative strengths of the anchor signals yields a strong empirical accuracy-efficiency Pareto frontier. These results establish Lightning Weave as a new practical route to efficient reasoning through capability composition. Code is released at https://github.com/jet-ai-projects/Lightning-Weave.
Read the full abstract

Quantum Physics

Unique determination and generation of rank two single-qubit quantum channels

An important problem in quantum technologies is the generation of a target evolution of an open quantum system. A core component of this task is the ability to determine whether the actual evolution of the system coincides with the target evolution. For the generation of unitary quantum channels in open quantum systems, it was shown by Goerz, Reich and Koch [New J. Phys. 16 055012 (2014)] that for determining whether the actual evolution coincides with a desired unitary it is sufficient to compare their action on three special density matrices. In this work, we consider controlled generation and unique determination of non-unitary quantum channels in open quantum systems with particular emphasis on rank two single-qubit quantum channels. We prove that to uniquely determine such quantum channels it is sufficient to consider their action on only three suitably chosen density matrices. Based on this theoretical result, we numerically investigate generation of various non-unitary target single-qubit quantum channels in open quantum systems using coherent and incoherent controls.
Read the full abstract

All authors Nina Kuklina, Vasilii Vasilenko, Boris Volkov, Alexander Pechen

Machine Learning

WaterKron and FlipFlop Hessian: Information-Theoretically Grounded Quantization with Kronecker-factored Hessians

How should a Kronecker-factored Hessian approximation be chosen for post-training quantization? We address this question through WaterKron, which combines two-sided GPTQ with row- and column-dependent waterfilling scales and entropy coding. We derive its high-rate distortion with respect to the full Hessian using an explicit Kronecker-Hessian mismatch factor $\Phi$. This factor quantifies the asymptotic distortion penalty due to the Kronecker Hessian approximation and provides a criterion for selecting the factors optimally. Minimizing $\Phi$ leads to a Gaussian covariance-fitting problem with classical “flip-flop” updates. We thus give a rate-distortion justification for using the resulting FlipFlop Hessian in quantization. We evaluate it empirically, finding that the FlipFlop Hessian consistently improves KL divergence and perplexity over input-only, marginal, and Frobenius-based Hessian choices.
Read the full abstract

Strongly Correlated Electrons

Rhombohedral Multilayer Graphene as a $p$-Wave Magnet

We propose rhombohedral multilayer graphene in an applied in-plane magnetic field as a highly tunable platform for nonrelativistic collinear $p$-wave magnetism. The orbital coupling to the magnetic field breaks time-reversal symmetry and, together with interaction-driven layer antiferromagnetism, generates an odd-in-momentum spin splitting without relying on spin-orbit coupling. Using a minimal low-energy effective theory, we show that the resulting $p$-wave spin splitting is strongly enhanced with increasing layer number. This enhancement originates from the surface-localized nature of the low-energy states and their layer-dependent orbital coupling to the in-plane field. The Zeeman coupling only weakly perturbs this predominantly orbital-field-induced mechanism. We further estimate stability of the $p$-wave magnetism under hole-doping and distinct transport signature using a more realistic Hubbard model. Our results establish orbital coupling to an external magnetic field as a controllable route to odd-parity spin splitting in collinear magnets.
Read the full abstract

Earth and Planetary Astrophysics

WINERED Detects a Strong Atmospheric Outflow on the Sub-Neptune GJ 3090b

Sub-Neptunes are the most common short-period ($P<100$ d) planets known. A major goal for the field is to build a comprehensive understanding of their compositions and evolutionary histories, and an important tool for achieving this goal is metastable helium (He$^*$) transmission spectroscopy, which traces atmospheric escape. In this paper, we report the detection of He$^*$ in the atmosphere of the sub-Neptune GJ 3090b at high spectral resolution. We observed two consecutive transits of this planet with Magellan II/WINERED, and detected peak He$^*$ absorptions during transit of $2.033\pm0.086\%$ (23.6$\sigma$) and $1.619\pm0.122\%$ (13.3$\sigma$), respectively. The first transit was affected by a stellar flare near egress while the second transit was unaffected. The signal is variable in amplitude and deeper than anticipated by the JWST/NIRISS observations of Ahrer et al. (2025). We do not observe a significant Doppler shift, and the signal has a FWHM of $25$ km s$^{-1}$, implicating photoevaporation. Our outflow modeling suggests that $Z_\mathrm{atm}\lesssim100\times$ solar, as the observed He$^*$ amplitudes are challenging to achieve in a metal-rich atmosphere. To match the muted transmission spectra from JWST and VLT/CRIRES+, GJ 3090b's lower atmosphere is likely covered by aerosols. Finally, we found that GJ 3090b has an atmospheric lifetime of $\sim300$ Myr, much shorter than previously reported. This adolescent ($\sim1$ Gyr) sub-Neptune is currently in a transformative phase of photoevaporative evolution.
Read the full abstract

All authors Shreyas Vissapragada, Zifan Lin, Annabella Meech, Collin Cherubim, Leonardo A. Dos Santos, Aaron Householder, Krishna Kanumalla, Mercedes Lopez-Morales, Andrew McWilliam, William Misener, Ava Morrissey, Morgan Saidel, Jessica J. Spake, Johanna Teske, Nicole L. Wallack

Computer Vision

Patient-Level, Leakage-Aware Deep Learning for Cross-Center Periapical Radiograph Classification

Dental caries and endodontic disease are among the most common health conditions worldwide, and intraoral periapical radiographs are central to their detection, treatment planning, and follow-up. Automated tooth-level classification of these images, however, lacks reproducible benchmarks, is often evaluated with image-level splits that leak patients between training and test, and is rarely validated across clinics. This paper presents the first patient-level, leakage-aware classification benchmark for single-tooth intraoral periapical radiographs on the DentIRO dataset, which comprises 5,300 images from 3,243 patients across two clinics and four classes: Healthy, Caries, Crowned, and Root Canal. Five transfer-learning models are compared with patient-grouped stratified cross-validation, so that every patient remains within a single fold. DenseNet121 gave the strongest and most stable result at a mean macro-F1 of 0.9787, while the four ImageNet-initialized backbones performed comparably. A controlled comparison on a fixed architecture showed that chest-radiograph pretraining transferred less effectively than ImageNet initialization. Bidirectional cross-center validation produced a small average generalization gap of 0.0077, and Grad-CAM confirmed that predictions rely on clinically meaningful tooth regions rather than acquisition artifacts. The benchmark offers a rigorous and reproducible baseline for intraoral radiograph classification.
Read the full abstract

Group Theory

Finiteness properties of closed subgroups of Thompson's group $F$

A subgroup $H$ of Thompson's group $F$ is closed if every piecewise-$H$ function in $F$ belongs to $H$. Prominent examples of closed subgroups are the maximal subgroups of infinite index, stabilizers and pointwise stabilizers of sets of points, and many of Jones' subgroups. A closed subgroup is finitely generated if and only if its Stallings $2$-core is finite, and it is then isomorphic to a diagram group over the core, in the sense of Guba and Sapir. We study the finiteness properties of closed finitely generated subgroups of $F$ with finitely many orbits on the dyadic rationals. For such a subgroup $H$ the following are equivalent: $H$ is of type $\mathrm{FP}_2$; $H$ is finitely presented; $H$ is of type $F_\infty$; $H$ has finitely many orbits on pairs of dyadic rationals; the action of $H$ on the dyadic rationals is oligomorphic. If moreover the action of $H$ on $(0,1)$ is minimal, these conditions hold if and only if the image of $H$ in the abelianization $\mathbb Z^2$ of $F$ has rank two. All these conditions can be decided from the core of $H$, and when they hold a finite presentation of $H$ can be computed. As a consequence, every finitely generated maximal subgroup of $F$ is of type $F_\infty$.
Read the full abstract

General Relativity and Quantum Cosmology

Full set of scenarios of high energy collision in the Schwarzschild background and kinematic censorship

We consider collisions between particles moving freely in the Schwarzschild background. We suggest classification of scenarios that lead to unbounded energy output in the center of mass frame. Although this is forbidden in the exterior of a black hole, the phenomenon becomes possible with account of white hole region and mirror universe in the complete space-time diagram. Also, we scrutinize collisions in the vicinity of the bifurcation point and reveal the role of resting observers in the inner region beyond the horizon. In some scenarios $E_{c.m.}$ not only diverges but becomes seemingly infinite that is, as a matter of fact, impossible according to the principle of so-called kinematic censorship. We resolve a corresponding paradox and argue, why this principle remains valid.
Read the full abstract

All authors A. V. Toporensky, P. Gusin, A. Radosz, O. B. Zaslavskii

High Energy Physics (Phenomenology)

Spin-spin entanglement at high energy

Spin correlations offer a quantum-information perspective on the partonic final states produced in high-energy scattering. We discuss the spin-density matrix of a heavy quark-antiquark pair in two complementary small-$x$ processes. In coherent diffractive production, color-singlet exchange enforces an unusually strong relation between entanglement and Bell nonlocality: a longitudinal photon creates a maximally entangled pair, whereas for a transverse photon the pair is generically both entangled and Bell nonlocal, with a model-independent point of maximal entanglement. In inclusive back-to-back production, the density matrix factorizes into a hard spin tensor and the unpolarized and linearly polarized Weizsäcker–Williams gluon distributions. The latter generates an azimuthal modulation and can increase the concurrence when the dijet relative momentum and imbalance are approximately orthogonal. Strikingly, in the saturation model considered, nonlinear effects wash out this modulation for $q_\perp\lesssim 3Q_s$, whereas the dilute BFKL limit, in which $G_2/G_0\to1$, yields a maximal modulation independent of the imbalance magnitude. These results connect quantum-information observables with the Pomeron and saturation physics.
Read the full abstract

Computer Vision

Perceive, Refine, Reason: A Calibrated Pipeline for Measuring Indicators in Strategic Visual Communication on Social Media

Visual content shapes audience perception and opinion on social media, and computational social science increasingly relies on automated tools to analyze images at scale. Yet a measurement gap persists: existing tools rely on predefined categories or produce only coarse image-level labels, while measuring which specific objects appear in an image, how prominently, and where in the frame remains difficult at scale. We introduce Perceive, Refine, Reason (PRR), a calibrated pipeline that turns flexible vision-language detectors into auditable measurement instruments for social-scientific research. PRR combines natural-language category prompts with pixel-level spatial refinement via the Segment Anything Model (SAM) and a multimodal LLM arbitration layer whose reasoning chains externalize domain knowledge and lower the expertise threshold for human-in-the-loop validation. A complementary three-tier auditability framework applies quantification learning to profile per-category reliability, support task-aligned configuration, and statistically correct prevalence estimates. Across four vision-language detectors and nine sociological categories, the pipeline yields substantial precision gains over zero-shot baselines, including a 43.3-point improvement for the strongest backbone. Applying PRR to 103,920 Facebook images from U.S. legislators during the 2024 election cycle and linking detections to DW-NOMINATE ideology scores, we find that more conservative legislators display U.S. flags as larger visual elements, with a weaker tendency toward peripheral placement, a spatial pattern invisible to binary detection. PRR provides computational social scientists with a model-agnostic toolkit for accessible, spatially-grounded, and correctable visual measurement.
Read the full abstract

Logic

Lascar Rank in Expansions

We prove that the SU-rank of a supersimple theory is no greater than that of any of its supersimple expansions. A proof for finite rank theories already exists in the literature, but non-continuity presents a problem at limit ranks. We prove the non-decreasing of SU-rank in expansions type-by-type by reducing to finding, in the base theory, certain trees of forking extensions in which the formulas and dividing numbers which witness dividing have a sufficiently uniform pattern. In the case of countable ranks, we can give an especially nice description of this uniformity: for a countable ordinal $\alpha$, any type of SU-rank at least $\alpha$ in a supersimple theory has a chain of forking extensions in the reverse order type of $\alpha$.
Read the full abstract

Human-Computer Interaction

Vulnerabilities in Personalization: Assessing Health Privacy Risks in ChatGPT Logs and Memory

As conversational LLMs become deeply embedded in daily life, users frequently disclose sensitive personal health information during routine interactions. We present a large-scale computational audit analyzing 179,057 conversations across India, Nigeria, Brazil, and Pakistan (N = 1,057) to evaluate personal health disclosures and background memory synthesis in ChatGPT. We find that 21.31% of audited conversations contain personal health data, with 3.62% posing high-to-extreme privacy risks involving stigmatized conditions, direct identifiers, and precise locations. When evaluating the memory entries of ChatGPT, we uncover a stark disconnect between corporate framing and system behavior: over 95% of profile entries are implicitly extracted without explicit user prompts or consent. Furthermore, background memory synthesis selectively condenses temporary, symptom-level disclosures into permanent diagnostic traits, stripping contextual integrity and amplifying re-identification risks. We conclude with sociotechnical design guidelines to restore user agency and consent-driven boundaries in stateful AI systems.
Read the full abstract