Peer Revenue Equity in science

Papers

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

All of arXiv

Saturday 29 August

Optimization and Control

Nechvile-Transformed Spacecraft Dynamics and Propellant Computation in the 3-Body Problem

The uncontrolled equations of motion in the Nechvile frame for the restricted three-body problem have been well-known since at least the 1960s. It would seem that adding an external force to these equations is quite trivial: simply add an external force per mass term to the acceleration equations. Here we show that the last statement is not true. In fact, we show that the additive generic external force must be multiplied by the inverse of $(1 + e \cos\theta)^3$ where $e$ is the relative eccentricity of the primaries and $\theta$ is the true anomaly of the rotating frame located at the barycenter. Furthermore, when this result is combined with the mass flow rate equation, it generates several surprising results due to the mismatch between the resulting quadratic term and the cubic term in the equations of motion. This leads to a corresponding modification of the rocket equation itself. A Birkhoff-theoretic solution to an illustrative cislunar space mission problem shows propellent savings of 80% with the use of the correct cost functional. The popular quadratic cost utilizes more than $2X$ the minimum propellant consumption.
Read the full abstract

Computation and Language

SHADOWBENCH: Toward Reliable Automatic Evaluation of Semantic Alignment in Autoformalization

Autoformalization translates informal mathematical theorems into code for proof assistants such as Lean. A central challenge is that current evaluation metrics can accept type-correct but misaligned statements or reject correct statements written in a different formulation. Inspired by Pass@$k$, we propose SA-Pass (*Semantic Alignment Pass*), which tests formal statements using auxiliary statements called *shadows* that characterize the intended statement. A generated statement receives full credit only when it compiles, implies each shadow (forward check), and is implied by their conjunction (backward check). We instantiate SA-Pass in ShadowBench, a Lean 4 full autoformalization benchmark of 178 postgraduate- to research-level problems spanning eight mathematical areas. Claude Code (Opus 4.8) with Numina-Lean-Agent reaches $61.8\%$ compile rate and $11.2\%$ SA-Pass. Across outputs generated by six agentic configurations, SA-Pass achieves $98.8\%$ binary agreement with expert judgments. An early version of ShadowBench served as the benchmark for Track 4 of the ICML 2026 AI4Math Challenge.
Read the full abstract

All authors Hojae Han, Jongyoon Kim, Sanghyeok Park, Dongwook Cheon, Yeachan Park, Myeong Jae Jeon, Sunjong Choe, Soonho Kong, Wonseok Hur, Seung-won Hwang, Donghoon Hyeon

Computer Vision

LightFuse: Relightable Interactive Gaussian Scene Reconstruction via Multi-Scan Fusion and 2D Gaussian Ray Tracing

Relightable interactive scene reconstruction aims to build an editable 3D model from scans of different object arrangements and render new layouts under novel illumination. Existing methods either bake lighting into appearance or recover material and illumination only for fixed scenes, leaving edited layouts with inconsistent shadows and indirect lighting. We present LightFuse, a 2D Gaussian framework that extends interactive scene reconstruction with explicit material-illumination decomposition and physically based relighting. LightFuse first fuses observations across states to reconstruct a shared background and movable objects. It then conducts ray-tracing-oriented geometry refinement to produce more complete and consistent surfaces. On the refined geometry, staged training with differentiable one-bounce ray tracing separates shared metallic–roughness material from state-specific environment lighting. The resulting scene supports object rearrangement, material editing, and relighting, while ray tracing recomputes appearance after each interaction. Experiments across synthetic scenes demonstrate state-of-the-art relighting quality, outperforming the strongest baseline by +9.74\,dB PSNR and +0.121 SSIM on average. Project page: https://zhn202.github.io/LightFuse/
Read the full abstract

All authors Haonan Zhou, Gaoxiang Linghu, Youlin Jia, Hongyu Cui, Kewei Wei, Kaiyue Zhou, Bruce X.B. Yu, Gaoang Wang

Computer Vision

Learning to Ground Before Reading: Unified PCB Engineering Drawing Parsing with Compact Vision-Language Models

PCB engineering drawings mix sparse graphics, dense tables, and text whose meaning depends on page position. Localizing the regions and sending crops to specialized recognizers are determined as the methods for most parsers, so missed regions cannot be recovered downstream. We train a compact VLM to read the full page and get a sequence of region classes, normalized boxes, and text or HTML content. Bounding boxes are converted to coordinate tokens for supervision. Inference uses no detector or crop parser. The joint target is difficult to optimize because class and box tokens are sparse relative to the much longer content sequences. Our localization-first curriculum learns the class-box format before adding content targets with content-aware resampling. On the fixed validation split of the Engineering Drawing Dataset (ED dataset), Localization-First improves strict localization F1 by 0.0955 over joint training (paired image-bootstrap 95% interval: [0.0350, 0.1572]). G-Unified has the lowest NED, highest cell F1, and only nonzero exact-match score. It provides a detector-free baseline for full-page PCB drawing parsing.
Read the full abstract

All authors Jinghao Liu, Xingrun Liu, Gengchen Sun, Han Xiao, Xingyu Chen, Yuhui Deng

Representation Theory

Model structures on the category of Q-shaped modules

We develop a method for constructing abelian model structures on the category Q,AMod of Q-shaped modules from cotorsion pairs in AMod, where Q is a small preadditive category satisfying certain conditions and AMod denotes the category of left A-modules for any ring A. More precisely, we construct two cotorsion pairs in Q,AMod from a given cotorsion pair in AMod. This leads to a construction of projective model structures on Q,AMod under the condition that Q has no cycles. We further apply this method to the category Dif(A) of differential left A-modules, viewed as a category of Q-shaped modules for a suitable choice of Q. In this case, the induced cotorsion pairs are shown to be compatible, thereby giving rise to abelian model structures on Dif(A).
Read the full abstract

Physics and Society

Measurement Validity in LLM Cultural Alignment

Researchers increasingly treat LLM survey responses as a proxy for human cultural values. This includes projecting model outputs onto instruments like the Inglehart-Welzel Cultural Map and drawing conclusions about which cultures a model resembles. While a model's answer to a value-laden questions may be interpreted as a cultural signal, it also carries sampling noise and, can be quite sensitive to question framing. In this paper, we separate survey responses, sampling noise and question framing for multiple LLMs. We decompose response variance from these models into variation across random seeds, prompt rewordings. We employ noise-to-signal ratio (NSR) to test whether a model's apparent cultural position is distinguishable from noise. When applied across a dozen models from four geographic origins, calibrated against 88 Integrated Values Survey countries, the answer is often no. NSR exceeds 1.0 on 49 of 117 valid model-question pairs (42%), reaching 5.56 in the worst case. Two models even refuse to answer sufficient number of survey questions outright. Our results corroborate previous findings that LLMs cluster toward Western, English-speaking cultural positions. However, what does not hold up in this study is the precision with which anyone can currently interpret a specific model's coordinates: prompt tone alone can shift a model by 2.4 map units, comparable to the distance between actual countries in the Inglehart-Welzel Cultural Map. These findings suggest that cultural attribution from LLM survey responses requires establishing the reliability of the underlying measurements before interpreting model coordinates as evidence of cultural representation.
Read the full abstract

Statistical Computation

Signed random Fourier features for fast density estimation with indefinite kernels

Kernel density estimation (KDE) is one of the most fundamental statistical estimators of density functions. Its direct implementation on a dataset of $N$ points incurs an $\mathcal{O}(N^{2})$ computational cost, which is prohibitive for large-scale datasets. Kernel approximation techniques can be applied to bring the computational cost down to $\mathcal{O}(N)$. The random Fourier features (RFF) technique, based on sampling from the spectral density of the kernel function, has become popular to speed up kernel estimators for machine learning applications. Unfortunately, it is restricted to positive definite kernels, while the majority of kernel functions popular in KDE, such as the parabolic kernel, do not satisfy this property. To overcome this limitation, this article introduces the signed random Fourier features (SRFF) technique. It is a generalization of RFF compatible with indefinite kernels whose inverse Fourier transform is absolutely integrable. The motivation for introducing this method is to speed up KDE in the case of multivariate compact kernels, which are generally not positive definite. We detail how to implement SRFF for both product kernels and isotropic kernels. For the class of Kuttner-Golubov kernels $K(\boldsymbol{x}_{i},\boldsymbol{x}_{j})=(1-\left\Vert \boldsymbol{x}_{i}-\boldsymbol{x}_{j}\right\Vert ^{\alpha})^{\beta}\mathbf{1}_{\{\left\Vert \boldsymbol{x}_{i}-\boldsymbol{x}_{j}\right\Vert \leq1\}}$ where $\boldsymbol{x}_{i}\in\mathbb{R}^{d}$, $\boldsymbol{x}_{j}\in\mathbb{R}^{d}$, $\alpha>0$, $\beta>0$, which includes the triangular, parabolic, biweight, triweight, and other kernel functions of interest for KDE as particular examples, we provide an explicit acceptance-rejection algorithm to sample from its signed spectral density. Our numerical tests on a dataset of one million points confirm the computational efficiency and accuracy of SRFF for large-scale KDE.
Read the full abstract

Artificial Intelligence

EpaCache: Error-Propagation-Aware Caching for Accelerating Diffusion-Based Visual Generation

Diffusion-based visual generative models deliver strong image and video synthesis quality but incur high inference costs because sequential samplers repeatedly evaluate large networks. Caching-based methods reduce inference latency by reusing intermediate computations across adjacent timesteps. However, existing cache controllers rely primarily on local temporal variation and overlook the trajectory-level consequences of cache reuse. We introduce Error-Propagation-Aware Cache (EpaCache), a training-free caching policy that adaptively allocates the reuse budget on timesteps with lower downstream impact. Experiments on image and video synthesis models demonstrate that EpaCache consistently improves the latency–fidelity trade-off over existing caching methods. On FLUX.1-dev, EpaCache outperforms the prior state-of-the-art caching method in both latency and fidelity, reducing inference time from $11.7$ s to $11.3$ s while improving PSNR from $21.4$ to $22.8$. On HunyuanVideo, EpaCache achieves a $2.63\times$ speedup over uncached inference and improves SSIM from $0.891$ to $0.905$ over the prior state-of-the-art method at matched latency.
Read the full abstract

All authors Yuhan Liu, Zongwei Hong, Jinglun Li, Linze Li, Shen Zhang, Yao Tang

Artificial Intelligence

RACER: Reinforced Agent Collaboration for Explainable Reasoning on Knowledge Graphs

Large Language Models (LLMs) often suffer from hallucination and struggle with complex reasoning tasks requiring multi-hop domain knowledge. While integrating Knowledge Graphs (KGs) provides a structured and verifiable information source, current KG-enhanced LLM paradigms usually rely on single-agent path extraction and fixed prompting, lacking adaptability and facing huge search spaces. To address these challenges, we propose RACER, a Reinforced Agent Collaboration framework for Explainable Reasoning on knowledge graphs. RACER employs a semantic-aware action pruning and teacher-guided reinforcement learning mechanism to efficiently extract high-quality reasoning pathways from large-scale KGs. Furthermore, to mitigate single-path generation pitfalls, we introduce a cross-task accumulated shared memory graph paired with an attention-driven multi-path knowledge refinement module. Finally, RACER orchestrates these components through a four-role multi-agent collaboration system (GraphAgent, TemplateAgent, AnswerAgent, and CriticAgent) to dynamically refine prompts and evaluate answers. Extensive experiments on CommonsenseQA and OpenBookQA datasets demonstrate that RACER significantly outperforms state-of-the-art KG-enhanced LLM baselines with an average improvement of 5%, offering robust and highly interpretable reasoning capabilities.
Read the full abstract

All authors Yuwei Lou, Hao Hu, Yuzhou Jiang, Zongfei Zhang, Liang Wang, Jincai Liu, Jidong Ge, Xianping Tao

Machine Learning

Adaptive Multi-Branching for Shallow Decision Tree Induction

Decision trees are attractive for tabular prediction tasks because each prediction follows an interpretable sequence of feature-threshold tests. Under a strict maximum-depth budget, however, conventional binary trees can be under-expressive, since each internal node makes only a single threshold decision. We study shallow-depth tree induction, where the goal is to improve accuracy while keeping root-to-leaf paths short. We propose the Multi-Branch Neural Decision Tree with Adaptive Pruning (MBNDT), a single axis-aligned tree trained end-to-end with differentiable multi-way splits. Each internal node learns ordered thresholds over a selected feature and a branch mask that adapts its effective arity, and the trained model is converted to a deterministic single-path tree for inference. Across 21 OpenML binary-classification benchmarks, MBNDT achieves the best average rank and mean balanced accuracy among depth-constrained single-tree baselines; a controlled ablation isolates multi-way splitting as the source of the gain. These gains come with an explicit trade-off: MBNDT realizes more leaves than the other single-tree baselines, making it best suited when accuracy under short, bounded decision paths is prioritized over minimal global tree size.
Read the full abstract

All authors Hanul Park, Jeonghoon Choi, Juseong Kim, Sanghun Sel, Giltae Song

Category Theory

Factorization Systems on $\infty$-Categories: Un/Straightening and Monadicity

We prove two structural results about factorization systems on $\infty$-categories. Firstly, we classify factorization systems on the total spaces of a class of fibrations of $\infty$-categories in terms of factorization systems on the base and the fibers. This will be interpreted as an un/straightening equivalence for $\infty$-categories equipped with a factorization system, using Juran's double $\infty$-categorical framework. Along the way, we develop the general theory of lifting through faithful functors of $n$-uple $\infty$-categories. Secondly, we prove that the forgetful functor from $\infty$-categories equipped with a factorization system to $\infty$-categories is a monadic right adjoint.
Read the full abstract

Combinatorics

Generalized Spectral Closedness and the Nonexistence of Walk-Realizable Supporters for Split Graphs

Let $\mathcal F=\{2K_2,C_4,C_5\}$, so that $\operatorname{Forb}(\mathcal F)$ is the class of split graphs. Resolving a conjecture of Wang and Tang, we prove that the class of split graphs is generalized spectrally closed and that it admits no walk-realizable $\mathcal F$-supporter of any finite order.
Read the full abstract

High Energy Physics (Phenomenology)

Embedding dependence of fermion mass hierarchies in $S_3$-symmetric Yukawa sectors

When irreducible representations occur with multiplicity, a family symmetry fixes the representation content of a Yukawa sector but need not fix its embedding in the space of generation tensors. We study the spectral consequences of this additional embedding data for complex-symmetric three-family tensors with the $S_3$ assignment $V=\mathbf{1}\oplus\mathbf{2}$. Since $\operatorname{Sym}^2V=2\,\mathbf{1}\oplus2\,\mathbf{2}$, three-dimensional invariant Yukawa subspaces of type $\mathbf{1}\oplus\mathbf{2}$ form a continuous $\mathbb{CP}^1\times\mathbb{CP}^1$ family, denoted $\mathcal L_{t,\kappa}$ on a finite affine chart. On the $\kappa=0$ branch, we solve the inverse singular-value problem and obtain necessary and sufficient conditions for any prescribed ordered positive mass spectrum. A fixed singlet embedding imposes a finite hierarchy bound, whereas varying the embedding accommodates every positive three-family spectrum. For general embeddings, $\mathcal L_{t,\kappa}$ contains a nonzero rank-one matrix if and only if $2t\kappa^2=1$; equivalently, these are precisely the finite-chart embeddings for which $\sigma_3/\sigma_2$ is unbounded. In a conventional complex-symmetric $S_3$ three-Higgs sector, the same condition becomes $y_2y_5^2=\sqrt{2}\,y_1y_3^2$, so order-one Yukawa coupling ratios can support arbitrarily large mass hierarchies. We then apply the result to a recent Clifford-algebraic construction and show that its family-resolved Yukawa tensors span $\mathcal L_{2,0}$, whose singular values obey $m_1+m_2\leq m_3\leq m_1+3m_2$. This excludes the observed charged-lepton hierarchy for arbitrary complex vacuum alignment within the existing Higgs directions. The resulting obstruction is therefore tied to the fixed multiplicity embedding rather than to the $S_3$ representation content alone.
Read the full abstract

Analysis of PDEs

Global small data radial symmetric solutions of 3D semilinear Euler-Poisson-Darboux equations

For the 3D semilinear Euler-Poisson-Darboux equation $\square u+\frac{\mu}{t}\partial_tu=|u|^p$, where $t\geq1$, $\mu>0$ and $p>1$, it is conjectured that there is a critical exponent $p_{crit}(3,\mu)=\max\{p_s(3+\mu), p_f(3)\}$ with the Strauss exponent $p_s(3+\mu)=\frac{\mu+4+\sqrt{\mu^2+16\mu+32}}{2(\mu+2)}$ and the Fujita exponent $p_f(3)=\frac{5}{3}$ such that when $p>p_{crit}(3,\mu)$, the small data solution $u$ exists globally, otherwise, when $1<p\le p_{crit}(3,\mu)$, the solution $u$ can blow up in finite time. It is pointed out that for $1<p\le p_{crit}(3,\mu)$, the blowup of solution $u$ has been shown. However, it is still open for the global existence of small solution $u$ when $p>p_{crit}(3,\mu)$. Note that $p_{crit}(3,\mu)=p_s(3+\mu)$ for $0<\mu<\frac{14}{5}$ and $p_{crit}(3,\mu)=p_f(3)$ for $\mu\geq\frac{14}{5}$. In the recent paper [16], the authors have obtained the global small solution $u$ for $p>\max\{\frac{5}{3},1+\frac{2}{\mu}\}$ and $\mu\geq\frac{14}{5}$. In this paper, by utilizing the hypergeometric Riemann representation and establishing some delicate pointwise spacetime weighted estimates, we prove the global existence of small data radial solution $u$ in the remaining range of $\frac{5}{3}<p\leq1+\frac{2}{\mu}$ and $\frac{14}{5}\leq\mu<3$. Therefore, for the radially symmetric case and $\mu\geq\frac{14}{5}$, the global existence problem of small data solution $u$ is solved when $p>p_{crit}(3,\mu)=\frac{5}{3}$.
Read the full abstract

Computation and Language

Large Language Models Systematically Favor Popular Options: Evidence and Mitigation Across MCQs

Multiple-choice questions (MCQs) are a standard format for evaluating large language models (LLMs), yet the popularity of answer options can confound evaluation. Modern LLMs systematically prefer popular but incorrect options over less popular correct ones, a vulnerability we call popularity bias. This pattern aligns with confidence miscalibration: model confidence remains high even as accuracy collapses for popular options. To systematically isolate this phenomenon, we introduce PopMCQ, a benchmark with six controlled strategies that vary option popularity while keeping the correct answer fixed. In our most adversarial setting, where all distractors are more popular than the correct option, models choose popular but wrong answers 66% of the time. To mitigate this bias, we propose PopDebias, a lightweight inference-time correction that estimates and removes a popularity prior from model predictions. It requires no fine-tuning, is label-free at test time (using only a small calibration split for parameter fitting), and adds negligible computational cost. Experiments on 22 open-source LLMs (0.5B to 32B parameters) show consistent improvements, with accuracy gains up to 54.1 percentage points under strong popularity pressure. The code and data are available https://github.com/DataScienceUIBK/PopMCQ
Read the full abstract

All authors Abdelrahman Abdallah, Mohammed Ali, Bhawna Piryani, Mahmoud Abdalla, Adam Jatowt

Networking

Sense Once, Serve Many: Common-Trace Factorized Constrained PPO for Online Sensing-Session Consolidation in Multi-Tenant ISAC Networks

Integrated sensing and communication (ISAC) networks can serve compatible requests through shared sensing sessions, but consolidation couples admission, reuse, profile selection, sensing service-level agreements (SLAs), communication quality of service (QoS), and future commitments. We formulate this problem as a constrained Markov decision process and propose Common-Trace Factorized Constrained Proximal Policy Optimization (CT-PPO). During training, stochastic policy replicas share the same primitive workload trace; leave-one-out discounted Monte Carlo return contrasts provide reward credit to applicable actor factors, while constraint credit remains factor/prefix-specific. Across five training seeds and matched workloads, CT-PPO achieves the highest mean macro return, exceeding matched Joint-Credit PPO (JC-PPO) by 0.934 (95% confidence interval [0.702, 1.164]) and SLA-Aware Greedy by 1.847; versus JC-PPO, it reduces sensing-resource cost by 6.277 and raises accepted requests per created session by 0.0806. A four-way ablation shows that the factorized surrogate alone yields no detectable macro-return gain, whereas adding common-trace reward credit produces the dominant improvement. Without retraining, CT-PPO retains a return advantage at low, nominal, and high arrival loads, with the strongest gain under clustered arrivals. Deployment uses public observations and hard masks; CT-PPO's extra parameters are training-side, its actor footprint matches JC-PPO, and actor-only CPU latency is effectively unchanged.
Read the full abstract

Networking

A-MADiff: Attention-Guided Multi-Agent DRL with Diffusion Policies for Memory-Aware Task Orchestration in Mobile AIGC Networks

Artificial Intelligence-Generated Content (AIGC) services employ Generative AI (GenAI) models to automatically generate diverse content. Mobile AIGC networks host GenAI models on edge-located AIGC Service Providers (ASPs) to deliver low-latency and personalized AIGC services for mobile users. However, AIGC inference tasks typically occupy GPU memory until task completion, causing GPU memory exhaustion at serving ASPs and triggering out-of-memory failures rather than merely increasing service latency. Existing studies on AIGC task orchestration have largely overlooked GPU memory feasibility constraints. To address this issue, we develop a cooperative multi-agent orchestration framework, in which each edge node is equipped with a scheduling agent to route tasks to local ASPs or neighboring edge nodes. Since scheduling agents make decisions based only on local observations, while peer offloading couples their resource states and long-term utilities, we formulate the orchestration process as a cooperative Decentralized Partially Observable Markov Decision Process (Dec-POMDP). To solve the Dec-POMDP, we propose an \underline{A}ttention-guided \underline{M}ulti-\underline{A}gent deep reinforcement learning algorithm with \underline{Diff}usion policies (A-MADiff) under the centralized training with a decentralized execution paradigm. A-MADiff employs diffusion-based decentralized actors to generate multi-modal preferences over feasible orchestration actions, and an attention-guided centralized critic to estimate per-agent values from cross-agent states under GPU memory heterogeneity. Numerical results demonstrate that A-MADiff significantly improves the cumulative reward over the state-of-the-art baseline.
Read the full abstract

All authors Chongzhi Wu, Zhengtao Li, Jiawen Kang, Jinbo Wen, Xiaohuan Li, Maomao Zhang, Ekram Hossain

Earth and Planetary Astrophysics

The refractory fraction of phosphorus in planet-forming discs

Context. Phosphorus (P) is an essential element for life on Earth and a potential tracer of planet formation history. However, there has been no detection of P-bearing molecules in protoplanetary discs so far. Herbig Ae/Be stars constantly accrete matter from their pro- toplanetary disc, which alters the composition of the stellar photosphere due to their shallow convective, or fully radiative, envelope. The altered surface composition reflects the composition of the accreting matter, and thus that of the inner protoplanetary disc. This accretion contamination of stellar photosphere can persist after accretion has ended in young A and B-type stars (age < 50 Myr). Aims. We aim to quantify the fraction of P locked in dust (the refractory fraction of P) compared to gas in the inner protoplanetary disc around Herbig Ae/Be stars. Methods. We measure the stellar parameters and abundance of 5 Herbig Ae/Be stars using optical and UV spectra, to compare their P and Fe abundances. We also used a 20 Myrs old main sequence B-type star, which has P and Fe abundance estimated from optical spectrum. Fe is assumed to be completely locked in refractory reservoirs in the inner disc. A parameterised relationship between the stellar P and Fe abundance gives the fraction of P locked in refractory reservoirs. Results. We find the refractory fraction of P in the inner protoplanetary disc to be > 96 % within 95th percentile of the posterior distribution. Conclusions. Consistent with a previous finding in the HD 100546 system, we conclude most of the P in the inner protoplanetary disc is locked in dust, likely in refractory minerals like schreibersite or apatite. Our result, combined with the low cosmic abundance of P, is also consistent with the lack of infrared and mm-wavelength observations of P-bearing molecules in protoplanetary discs to date.
Read the full abstract

All authors Sandipan P. D. Borthakur, Mihkel Kama, Luca Fossati, Colin P. Folsom, Anna Aret, Christiane Helling

Computer Vision

QCell: Recombining and Aligning Cell Queries for Overlapping Instance Segmentation

Instance segmentation of overlapping cells in microscopy remains challenging due to semi-transparent structures that produce weak boundaries and mixed visual evidence in overlap regions. Existing methods address this through local regions of interest or shape priors but lack global reasoning across overlapping objects. We present QCell, a novel query-based model that de-overlaps cell instances in microscopy scenes. Our approach combines (i) an instance recombination module that decomposes and recombines query representations in latent space, enabling the model to reason about complete object structure under overlap, and (ii) a contrastive query alignment objective that combines distinctive instance feature learning and separation of overlapping cell queries. We additionally introduce a new Organoid dataset benchmark for overlapping cell segmentation. We show that QCell outperforms state-of-the-art methods across multiple benchmarks, achieving +2.2 AP and +2.7 AJI on ISBI2014. Code is available at https://github.com/SlavkoPrytula/QCell
Read the full abstract

Artificial Intelligence

Dynamic Important Example Mining for Reinforcement Finetuning

Reinforcement fine-tuning (RFT) is increasingly used to strengthen the reasoning abilities of large models, yet its effectiveness is bound by how training data are selected and used. Most data-centric RFT methods rely on static or heuristic sample selection, implicitly assuming a sample's value is fixed over training. This overlooks the non-stationary dynamics of policy learning and can lead to suboptimal updates. We propose Dynamic Important Example Mining (DIEM), a principled and fully automated framework that makes data utilization adaptive throughout RFT. DIEM integrates two components into each optimization step: (i) a gradient-alignment importance estimator that efficiently approximates each sample's marginal contribution to policy improvement; and (ii) a constrained batch reweighting scheme that maximizes aggregate utility while preserving the update's gradient magnitude to stabilize optimization. Across several reasoning benchmarks, DIEM consistently outperforms strong static and dynamic baselines. The code will be released via https://github.com/hrtan/DIEM.
Read the full abstract

All authors Haoru Tan, Sitong Wu, Yanfeng Chen, Shizhen Zhao, Yang-Tian Sun, Tianjia Liu, Chirui Chang, Shaofeng Zhang, Samm Sun, Xiuzhe Wu, Ruobing Xie, Xiaojuan Qi

Artificial Intelligence

GuardianAgent: Policy-Conditioned Risk-Adaptive Anonymization with Verified Adversarial Escalation

Privacy protection for live web traffic requires more than detecting private spans. Agent-based privacy protection systems must determine whether an outgoing action complies with the destination site's privacy policy, then apply only the level of rewriting or sanitisation justified by the residual disclosure risk. We present GuardianAgent, a policy-conditioned anonymization framework that couples structured risk assessment with verified adaptive rewriting. GuardianAgent computes risk through AMRSF (Adaptive Multi-factor Risk Scoring Formula), an explicit controller that combines policy-violation likelihood with data sensitivity, recipient transmission, purpose legitimacy, contextual basis, and policy transparency, rather than relying on an LLM to assign risk directly. This risk score determines both the allow/transform/deny decision and the initial anonymization level. For efficiency, GuardianAgent uses an evidential fast path for low-uncertainty policy matches and invokes an LLM slow path only for uncertain cases. For rewriting, it applies a five-level hierarchy driven by a verified adversarial guesser: guesses trigger escalation only when supported by the original text, preventing hallucinated attacker confidence from causing unnecessary over-anonymization. Experiments across three benchmarks spanning legal text (TAB), Reddit posts (SynthPAI), and multi-format synthetic PII records (PII-Masking-300k) show that GuardianAgent achieves the strongest privacy-utility trade-off among published baselines and is the only method to reach more than 0.90 privacy in all three domains, remaining robust under a backbone switch. Action-context stress tests further show that the same outgoing text receives different decisions and anonymization strengths under different recipients, purposes, action bases, and policy-transparency conditions.
Read the full abstract

All authors Ruiyi Yang, Gayathri Lihinikaduarachchi, Rahat Masood, Flora D. Salim, Salil S. Kanhere

Analysis of PDEs

Global Existence of classical solutions to 3D nonlinear Klein-Gordon equations with low-regularity initial data

This paper studies global existence for the Cauchy problem of nonlinear Klein-Gordon equations in three space dimensions, strictly within the regularity regime of classical local existence. We prove it via higher-order and lower-order energy estimates. The proof relies on two key ingredients. The first is due to the work of Georgiev and Popivanov, which reduces quadratic nonlinearities to cubic terms plus ghost-energy-controllable terms, securing lower-order estimates. The second is a sharp Klainerman-Sobolev-type inequality without the scaling operator, established herein, which yields enough time decay for derivatives up to second order; integration by parts then controls derivative loss terms in the higher-order estimates.
Read the full abstract

Artificial Intelligence

Validating FKG.in: Soundness Assessment in LLM-Augmented Indian Food Knowledge

The online culinary ecosystem is increasingly populated by recipe content generated, modified, or summarized by LLMs. Although often convincing, such outputs may contain hallucinated ingredients, misrepresented quantities, or culturally implausible combinations, limiting their suitability for downstream applications and knowledge graph construction. In this paper, we present a semi-automated soundness assessment workflow for validating structured recipe data extracted from informal culinary sources and augmented by LLMs. Developed as part of FKG(.in), a knowledge graph of Indian food, the pipeline identifies and addresses common failure modes, including structural inconsistencies, semantic and logical incoherence, and deviations from the source text, through a multi-stage process combining formal grammars, vocabulary-based checks, statistical heuristics, Set Transformer-based coherence modeling, and retrieval-based verification. Although evaluated on Indian recipes, the proposed methods are applicable to broader multilingual and multicultural culinary domains. We provide a practical, auditable, and application-agnostic approach to improving the reliability of machine-readable food knowledge infrastructures in the era of LLM-generated content.
Read the full abstract

All authors Saransh Kumar Gupta, Armaan Shah, Lipika Dey, Partha Pratim Das, Ramesh Jain

Solar and Stellar Astrophysics

Evolution of Stellar Activity and Habitable Zone (EATEN): III. X-ray Activity of Dwarfs in Open Clusters and Field Stars

Stellar X-ray emission serves as a direct diagnostic of coronal activity, which is fundamentally linked to coronal heating processes. It also strongly influences the atmospheres and long-term habitability of orbiting exoplanets. Investigating how this high-energy emission evolves is therefore essential for understanding the evolution of stellar magnetic dynamos and planetary atmospheres and habitability. In this work, we investigate the evolution of X-ray activity and XUV irradiation for a sample of F-M dwarf stars based on Chandra and XMM-Newton observations. We find that F- and G-type stars broadly follow the traditional evolutionary picture of an early saturated (or weakly declining) phase followed by a modest decline, whereas K- and M-type stars exhibit a clear three-phase evolution of a saturated phase, an intermediate phase of rapid decay, and a final modest decline phase. By combining X-ray, ultraviolet, and Ca II H&K bands, we show that coronal emission becomes increasingly dominant toward lower-mass stars. Based on the cumulative XUV emission calculated from our fitted relation, planets around F- and G-type stars experience relatively moderate XUV environments, while those around K- and M-type stars may exceed the empirical cosmic shoreline shortly after reaching the main sequence, though this conclusion depends on the adopted shoreline value.
Read the full abstract

All authors Xue Li, Song Wang, Henggeng Han, Jun Ma, Yang Huang, Jifeng Liu

Machine Learning

RL-FAT: Reinforcement Learning for Fair Adversarial Training

Deep neural networks remain highly vulnerable to adversarial perturbations, and adversarial training (AT) has become a widely used approach for improving robustness. However, improvements in average robust accuracy often mask substantial class-wise disparities: while some classes become more robust, others may remain disproportionately vulnerable under attack. This imbalance raises an important adversarial fairness concern, particularly in vision tasks where reliable robustness is expected across all categories. To address this challenge, we propose RL-FAT, a reinforcement-learning-inspired fair adversarial training framework that uses policy-gradient based feedback from adversarial predictions. RL-FAT interprets the prediction distribution as a policy and combines correctness-based prediction rewards with class-wise value estimates to compute class-specific advantages for policy-gradient optimization. This enables the model to adaptively focus on class-wise misclassification. Furthermore, we introduce a fairness-emphasis adversarial loss that assigns stronger training pressure to classes with high adversarial loss, thereby mitigating class-wise robustness disparity. By combining reinforcement-driven adaptation with fairness-emphasis regularization, RL-FAT improves adversarial robustness while promoting a more balanced robustness distribution across classes. Extensive experiments demonstrate that our method achieves competitive robust accuracy and substantially reduces class-wise robustness imbalance compared with standard adversarial training baselines.
Read the full abstract

Image and Video Processing

The MYOSAIQ Challenge: Myocardial Segmentation with Automated Infarct Quantification

Late gadolinium enhancement (LGE) cardiac magnetic resonance (MR) imaging is the modality of choice to assess myocardial infarction (MI) lesions. Nowadays MI volume quantification is not performed routinely in clinical practice. Numerous deep learning (DL) methods have been developed to automate the segmentation of the myocardium and infarct regions. However, most studies rely on relatively small datasets which typically undergo pre-processing steps to standardize images and focus on a specific phase of myocardial infarction following reperfusion therapy. These limitations have impeded the development of models that are generalizable across diverse conditions and thus suitable for routine clinical use. To advance research and establish benchmarks in generalizable learning for myocardial infarct quantification, this paper presents findings from the Myocardial Segmentation with Automated Infarct Quantification (MYOSAIQ) challenge. The dataset set up for the challenge combines 439 CMR volumes from two multicenter clinical trials, with representative data acquired in acute and chronic phases after acute MI. Data were acquired in 16 centers using MRI scanners from three different vendors. Six teams participated until the end of the challenge, employing various baseline models, data augmentation techniques, and confidence strategies. To enhance the significance of this study, we compare the challengers' results with those of fine-tuned foundation models. Our results indicate that well-designed UNet-based techniques outperform fully automatic foundation models for LGE MR segmentation. While the best methods achieve high-quality and stable delineations of the left ventricle and myocardium under various conditions, they remain improvable in accurately segmenting infarct regions.
Read the full abstract

All authors Olivier Bernard, William A. Romero R., Cyprien Bouton, Celia Goujat, Hang Jung Ling, Pierre-Marc Jodoin, Fumin Guo, Calder Sheagren, Graham Wright, Abdul Qayyum, Moona Mazher, Steven A. Niederer, Hairui Wang, Xiaomei Wu, Franz Thaler, Gernot Plank, Martin Urschler, Ricardo M. Rosales, Esther Pueyo, Nicolas Duchateau, Frederic Cervenansky, Patrick Clarysse, Loic Belle, Thomas Bochaton, Nathan Mewton, Magalie Viallon, Pierre Croisille

Materials Science

Field-free precessional magnetization dynamics in a multidomain magnet driven by light-induced strain

Ultrafast lattice excitation offers a route to controlling magnetization through magnetoelastic coupling, yet its ability to drive large-amplitude dynamics within pre-existing multidomain states remains less explored. Here, we show that a single 5-ps mid-infrared pulse induces a large-amplitude, reversible magnetic response in cobalt-doped yttrium iron garnet at zero applied magnetic field. Time-resolved magneto-optical microscopy reveals a transient reversal of the out-of-plane magnetic contrast within approximately 2 ns, followed by recovery of the initial state, while the labyrinthine domain morphology remains largely preserved. Concurrent polarization microscopy reveals a localized, long-lived strain-sensitive response and a propagating acoustic wave. The correlated structural and magnetic responses, together with micromagnetic simulations, support a mechanism in which transient strain modifies the magnetic anisotropy and drives precessional reorientation within existing domains. These findings establish single-pulse magnetoelastic excitation as a route to reversible, large-amplitude magnetization dynamics without substantial domain reorganization or an externally applied magnetic field.
Read the full abstract

All authors Héloïse Damas, Carl S. Davies, Tomasz Zalewski, Petr M. Vetoshko, Vladimir I. Belotelov, Andrzej Stupakiewicz, Andrei Kirilyuk

Cosmology and Nongalactic Astrophysics

The onset of the strong backreaction regime in axion inflation, an analytical study

Models where an axion-like inflaton is coupled to a $U(1)$ gauge field are theoretically well motivated and can display a rich phenomenology. The regime in which the quanta of the gauge field strongly backreact on the rolling inflaton has been studied for well more than a decade, and yet we cannot say that it is fully understood. In this paper we present an analytical study of the onset of the strong backreaction regime. Our formalism relies on a Laplace transform to convert a complicated integro-differential equation into the search of the poles of an analytic function. We confirm the existence, previously observed using a completely different formalism, of a stable region of strong backreaction. Our work provides, for the first time, analytical formulae that allow to study the evolution of the system as it transitions from the weak to the strong backreaction regime.
Read the full abstract

Computer Vision

DARD: Zero-Shot Degradation-Aware Retinex-Guided Diffusion for Low-Light Image Enhancement

Existing diffusion-based enhancement methods provide strong generative capability for low-light image enhancement (LLIE), yet they either rely on paired supervision or lack reliable scene constraints in zero-shot settings, often leading to structural inconsistency and color drift. Motivated by conventional Retinex models, which offer physically interpretable priors that can serve as reliable scene constraints yet struggle with mixed degradations in real-world scenarios, we propose DARD, a zero-shot Degradation-Aware Retinex-guided Diffusion framework for LLIE. DARD first extracts image-specific physical priors from the degraded input through a test-time degradation-aware Retinex decomposition, thereby providing reliable structural guidance for zero-shot restoration. It then injects these priors into reverse diffusion through a timestep-adaptive frequency fusion strategy to balance structural anchoring and detail generation. Finally, a guided reverse refinement process with physical consistency and Contrastive Language-Image Pre-training (CLIP)-based semantic guidance is introduced to suppress structural artifacts and semantic drift during sampling. Extensive experiments show that DARD achieves strong distortion and perceptual performance and consistently outperforms existing zero-shot baselines across multiple real-world low-light benchmarks. To further validate the practical utility of our method for downstream applications, we evaluated its impact on semantic segmentation. Experiments demonstrate that images enhanced by DARD achieve a 28.10% relative improvement in mIoU over AGLLDiff.
Read the full abstract

All authors Wenjie Cai, Yuezhe Yang, Jianyang Xia, Xingbo Dong, Zhe Jin

Robotics

AnyWorld: Factorized Egocentric World Models for Cross-Embodiment Generalization

Collecting contact-rich robot experiences at scale remains a major bottleneck for generalizable manipulation. Beyond data quantity, robot learning also requires diverse experiences across embodiments, viewpoints, and scenes. Human egocentric videos provide abundant physical interactions, but each video captures only a narrow slice of experience under a single body, camera trajectory, and environment. We propose AnyWorld, a cross-embodiment world modeling framework that expands a single human interaction into diverse robot-native rollouts without paired human-robot demonstrations. Our model factorizes an interaction into action, camera, and embodiment: action controls capture the motion structure, camera controls specify viewpoint evolution, and the target embodiment context defines the acting body and its interaction geometry. This formulation enables independent recomposition of embodiment, viewpoint, and scene factors, allowing a single model to generate many robot-domain experiences while preserving the underlying dynamics and object interactions. We train the model with large-scale human interaction pretraining followed by mixed-embodiment fine-tuning. Experiments show that our model supports controllable recomposition across embodiments, viewpoints, and scenes, and we further demonstrate that the generated data can improve manipulation performance on the RoboCasa GR1 tabletop benchmark and a real IRON humanoid robot. Beyond aggregate gains, we test whether unpaired human experience can be recomposed into robot-native video-action pairs that target a policy gap. Controlled IRON interventions correct a spurious completion prior and establish language-grounded spatial target selection; an action-only counterfactual intervention fails to learn the latter reliably, showing that both action calibration and visual recomposition are necessary.
Read the full abstract

All authors Cheng Chen, Jerry Bai, Jiacheng Wei, Boyu Chen, Xiaoji Zheng, Fan Wu, Minghao Yang, Tianrun Chen, Ruibo Li, Xiaoyu Yue, Xiaoyang Guo, Yixiao Ge, Guosheng Lin, Fayao Liu