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

Monday 14 September

Cryptography and Security

Scaling Verification of Cryptographic Software with Aeneas, Rust, and Lean

We develop a new methodology for verifying cryptographic software. We target production code written in Rust for performance and system integration, rather than verification convenience. Rust's ownership discipline enables Aeneas to extract a pure model of this code in Lean, relieving us from low-level reasoning about pointer liveness and aliasing. Lean's extensibility lets us develop tactics and libraries that greatly simplify reasoning about extracted Rust code. We design and tune our toolchain to facilitate the use of AI. Agents autonomously write formal proofs, which are independently verified by the Lean kernel. Agents also assist in the formalization of cryptographic standards and platform-specific intrinsics, which still requires expert design and review. We apply our methodology to SymCrypt, Microsoft's cryptographic provider. We verify its implementations of algorithms such as SHA-3 and ML-KEM, which were ported from C to Rust. We also extend SymCrypt with experimental optimizations and implementations of algorithms such as FrodoKEM, ML-DSA, and HPKE to explore the scalability of writing, adapting, and verifying cryptographic code. Our 237~KLOC Lean development establishes safety, panic-freedom, and functional correctness of 16.7~KLOC of Rust code supporting post-quantum cipher suites for x86-64 and ARM platforms. Our evaluation shows that verified Rust can meet SymCrypt's performance, portability, deployment, and maintainability requirements.
Read the full abstract

All authors Son Ho, Cédric Fournet, Jonathan Protzenko, Michael Naehrig, Joshua Clune, Patrick Longa, Guillaume Boisseau, Fernando Leal Sánchez, Aymeric Fromherz, Antoine Delignat-Lavaud

Computer Vision

MedDiME: Efficient Latent Diffusion with Adaptive Masking for Medical Counterfactual Generation

Medical counterfactual generation modifies images to change model predictions for interpretability. However, existing diffusion-based approaches are often prohibitively slow and memory-intensive, making them difficult to apply in high-resolution settings. Moreover, existing masking strategies are tightly coupled with pixel-space representations, making them incompatible with latent-space diffusion editing. To address these challenges, we propose MedDiME, a latent-space classifier-guided diffusion framework that reduces computational and memory overhead while introducing a latent-compatible, gradient-driven adaptive masking mechanism for spatially precise medical counterfactual generation. Extensive experiments demonstrate that MedDiME achieves high-quality counterfactual generation with significant efficiency gains compared to prior classifier-guided diffusion baselines, achieving up to 40 times faster inference and 13 times lower peak GPU memory usage.
Read the full abstract

All authors Yan Zeng, Changlu Guo, Anders Nymark Christensen, Morten Rieger Hannemose, Anders Bjorholm Dahl

Soft Condensed Matter

Liquid water stability as network resilience

Liquid water is unusually stable, remaining liquid across a wide range of temperatures and even when confined to spaces only a few molecules wide. Yet it eventually fails in both settings: boiling at the critical temperature or drying in narrow pores, phenomena normally studied separately. Water's hydrogen-bond network is thought to underlie this stability, but tracking bond survival has not resolved the puzzle. Extending a concept we recently introduced for wetting (J. Am. Chem. Soc. 148, 21572 (2026)), we show that these stability limits can be accurately derived from a previously overlooked network property: resilience, the capacity to locally repair a broken bond. Only interactions too weak to be repaired constitute genuine defects, a far smaller population than conventional definitions suggest. While intact bonds remain abundant up to failure and conventionally broken bonds already percolate well before it, instability coincides with the percolation of these genuine defects. Comparing local interaction energies with a single intrinsic scale (identified a priori) predicts the wetting-hydrophobicity crossover, nanoconfinement cavitation, and bulk criticality. These phenomena are thus unified through a common molecular framework whose energetic scale also matches a long-unexplained spectroscopic feature of water. A single, parameter-free molecular criterion rooted in network resilience suffices.
Read the full abstract

High Energy Physics (Experiment)

Measurement of the cross sections of $e^+e^-\to K_{S}^{0}\bar\Xi^{0}\Lambda/\Sigma^{0} + \text{c.c.}$ at center-of-mass energies between 3.510 and 4.951 GeV

Using $e^+e^-$ collision data samples collected with the BESIII detector at the BEPCII at center-of-mass energies between 3.510 and 4.951 GeV corresponding to an integrated luminosity of 44.55 fb$^{-1}$, the Born cross sections of the processes $e^+e^- \to K_S^0 \bar{\Xi}^0 \Lambda/\Sigma^0+\text{c.c.}$ are measured with a partial-reconstruction strategy. The dressed cross sections for the channels $e^+e^- \to K_S^0 \bar{\Xi}^0 \Lambda/\Sigma^0 + \text{c.c.}$ are fitted with a model consisting of a power-law function and a charmonium (-like) resonance, considering the candidates $\psi(3770)$, $\psi(4040)$, $\psi(4160)$, $Y(4230)$, $Y(4360)$, $\psi(4415)$, $Y(4500)$, $Y(4660)$, and $Y(4710)$. No significant resonance contribution is observed in any of the fits. The upper limits for the products of the electronic partial widths and branching fractions at the 90% confidence level are provided.
Read the full abstract

All authors BESIII Collaboration: M. Ablikim, M. N. Achasov, P. Adlarson, X. C. Ai, C. S. Akondi, R. Aliberti, A. Amoroso, Q. An, Y. H. An, M. S. Anderson, Y. Bai, O. Bakina, H. R. Bao, X. L. Bao, M. Barbagiovanni, V. Batozskaya, K. Begzsuren, N. Berger, M. Berlowski, M. B. Bertani, D. Bettoni, F. Bianchi, E. Bianco, A. Bortone, I. Boyko, R. A. Briere, A. Brueggemann, D. Cabiati, H. Cai, M. H. Cai, X. Cai, A. Calcaterra, G. F. Cao, N. Cao, S. A. Cetin, X. Y. Chai, J. F. Chang, T. T. Chang, G. R. Che, Y. Z. Che, C. H. Chen, Chao Chen, G. Chen, H. S. Chen, H. Y. Chen, M. L. Chen, S. J. Chen, S. M. Chen, T. Chen, W. Chen, X. R. Chen, X. T. Chen, X. Y. Chen, Y. B. Chen, Y. Q. Chen, Z. K. Chen, J. Cheng, L. N. Cheng, S. K. Choi, X. Chu, G. Cibinetto, F. Cossio, J. Cottee-Meldrum, H. L. Dai, J. P. Dai, X. C. Dai, A. Dbeyssi, R. E. de Boer, D. Dedovich, Z. Y. Deng, A. Denig, I. Denisenko, M. Destefanis, F. De Mori, E. Di Fiore, X. X. Ding, Y. Ding, Y. X. Ding, J. Dong, L. Y. Dong, M. Y. Dong, X. Dong, Z. J. Dong, M. C. Du, S. X. Du, Shaoxu Du, X. L. Du, Y. Q. Du, Y. Y. Duan, Z. H. Duan, P. Egorov, G. F. Fan, J. J. Fan, K. X. Fan, Y. H. Fan, J. Fang, Jin Fang, S. S. Fang, W. X. Fang, Y. Q. Fang, L. Fava, F. Feldbauer, G. Felici, C. Q. Feng, J. H. Feng, Q. X. Feng, Y. T. Feng, M. Fritsch, C. D. Fu, J. L. Fu, Y. W. Fu, H. Gao, Xu Gao, Y. Gao, Y. N. Gao, Y. Y. Gao, Yunong Gao, Z. Gao, S. Garbolino, I. Garzia, L. Ge, P. T. Ge, Z. W. Ge, C. Geng, A. Gilman, K. Goetzen, J. Gollub, J. B. Gong, J. D. Gong, L. Gong, W. X. Gong, W. Gradl, M. Greco, M. D. Gu, M. H. Gu, C. Y. Guan, A. Q. Guo, H. Guo, J. N. Guo, L. B. Guo, M. J. Guo, R. P. Guo, X. Guo, Y. P. Guo, Z. Guo, A. Guskov, J. Gutierrez, J. Y. Han, T. T. Han, X. Han, F. Hanisch, K. D. Hao, X. Q. Hao, F. A. Harris, C. Z. He, K. K. He, K. L. He, F. H. Heinsius, C. H. Heinz, Y. K. Heng, C. Herold, P. C. Hong, G. Y. Hou, X. T. Hou, Y. R. Hou, Z. L. Hou, H. M. Hu, J. F. Hu, Q. P. Hu, S. L. Hu, T. Hu, Y. Hu, Y. X. Hu, Z. M. Hu, G. S. Huang, K. X. Huang, L. Q. Huang, P. Huang, X. T. Huang, Y. P. Huang, Y. S. Huang, T. Hussain, N. Hüsken, N. in der Wiesche, J. Jackson, Q. Ji, Q. P. Ji, W. Ji, X. B. Ji, X. L. Ji, Y. Y. Ji, L. K. Jia, X. Q. Jia, D. Jiang, S. J. Jiang, X. S. Jiang, Y. Jiang, J. B. Jiao, J. K. Jiao, Z. Jiao, L. C. L. Jin, S. Jin, Y. Jin, M. Q. Jing, X. M. Jing, T. Johansson, S. Kabana, X. L. Kang, X. S. Kang, B. C. Ke, V. Khachatryan, A. Khoukaz, O. B. Kolcu, B. Kopf, L. Kröger, L. Krümmel, Y. Y. Kuang, M. Kuessner, X. Kui, N. Kumar, A. Kupsc, W. Kühn, Q. Lan, W. N. Lan, T. T. Lei, M. Lellmann, T. Lenz, C. Li, C. H. Li, C. K. Li, Chunkai Li, Cong Li, D. M. Li, F. Li, G. Li, H. B. Li, H. J. Li, H. L. Li, H. N. Li, H. P. Li, Hui Li, J. N. Li, J. S. Li, J. W. Li, K. Li, K. L. Li, L. J. Li, L. K. Li, Lei Li, M. H. Li, M. R. Li, M. T. Li, P. L. Li, P. R. Li, Q. M. Li, Q. X. Li, R. Li, S. Li, S. X. Li, S. Y. Li, Shanshan Li, T. Li, T. Y. Li, W. D. Li, W. G. Li, X. Li, X. H. Li, X. K. Li, X. L. Li, X. Y. Li, X. Z. Li, Y. Li, Y. H. Li, Y. B. Li, Y. C. Li, Y. G. Li, Y. P. Li, Z. H. Li, Z. J. Li, Z. L. Li, Z. X. Li, Z. Y. Li, Zaiyi Li, C. Liang, H. Liang, Y. F. Liang, Y. T. Liang, Z. Z. Liang, G. R. Liao, L. B. Liao, M. H. Liao, Y. P. Liao, J. Libby, A. Limphirat, C. C. Lin, C. X. Lin, D. X. Lin, T. Lin, B. J. Liu, B. X. Liu, C. Liu, C. X. Liu, F. Liu, F. H. Liu, Feng Liu, G. M. Liu, H. Liu, H. B. Liu, H. M. Liu, Huihui Liu, J. B. Liu, J. J. Liu, K. Liu, K. Y. Liu, Ke Liu, Kun Liu, L. Liu, L. C. Liu, Lu Liu, M. H. Liu, P. L. Liu, Q. Liu, S. B. Liu, T. Liu, W. M. Liu, W. T. Liu, X. Liu, X. K. Liu, X. L. Liu, X. P. Liu, X. T. Liu, X. Y. Liu, Y. Liu, Y. B. Liu, Yi Liu, Z. A. Liu, Z. D. Liu, Z. Q. Liu, Z. X. Liu, Z. Y. Liu, X. C. Lou, H. J. Lu, J. G. Lu, X. L. Lu, Y. Lu, Y. H. Lu, Y. P. Lu, Z. H. Lu, C. L. Luo, J. R. Luo, J. S. Luo, M. X. Luo, T. Luo, X. L. Luo, Z. Y. Lv, X. R. Lyu, Y. F. Lyu, Y. H. Lyu, C. L. Ma, F. C. Ma, H. L. Ma, Heng Ma, J. L. Ma, L. L. Ma, L. R. Ma, Q. M. Ma, R. Q. Ma, R. Y. Ma, T. Ma, X. T. Ma, X. Y. Ma, F. E. Maas, I. MacKay, M. Maggiora, S. Maity, S. Malde, Q. A. Malik, L. M. Mansur, Y. J. Mao, Z. P. Mao, S. Marcello, A. Marshall, F. M. Melendi, Y. H. Meng, Z. X. Meng, G. Mezzadri, H. Miao, T. J. Min, R. E. Mitchell, X. H. Mo, A. F. Mohammad, B. Moses, N. Yu. Muchnoi, J. Muskalla, Y. Nefedov, F. Nerling, H. Neuwirth, Z. Ning, S. Nisar, Q. L. Niu, W. D. Niu, Y. Niu, C. Normand, S. L. Olsen, Q. Ouyang, I. V. Ovtin, S. Pacetti, Y. Pan, C. Y. Pang, A. Pathak, Y. P. Pei, M. Pelizaeus, G. L. Peng, H. P. Peng, X. J. Peng, Y. Y. Peng, K. Peters, K. Petridis, J. L. Ping, R. G. Ping, S. Plura, V. Prasad, L. Pöpping, F. Z. Qi, H. R. Qi, L. Y. Qian, S. Qian, W. B. Qian, C. F. Qiao, J. H. Qiao, J. J. Qin, J. L. Qin, L. Q. Qin, L. Y. Qin, P. B. Qin, X. P. Qin, X. S. Qin, Z. H. Qin, J. F. Qiu, Z. H. Qu, J. Rademacker, K. Ravindran, C. F. Redmer, A. Rivetti, M. Rolo, G. Rong, S. S. Rong, F. Rosini, Ch. Rosner, M. Q. Ruan, W. R. Ruangyoo, N. Salone, A. Sarantsev, Y. Schelhaas, M. Schernau, K. Schoenning, M. Scodeggio, W. Shan, X. Y. Shan, Z. J. Shang, J. F. Shangguan, L. G. Shao, M. Shao, C. P. Shen, H. F. Shen, W. H. Shen, X. Y. Shen, B. A. Shi, Ch. Y. Shi, H. Shi, J. L. Shi, J. Y. Shi, M. H. Shi, S. Shi, S. Y. Shi, X. Shi, X. D. Shi, H. L. Song, J. J. Song, M. H. Song, T. Z. Song, W. M. Song, Y. X. Song, Zirong Song, S. Sosio, S. Spataro, S. Stansilaus, F. Stieler, M. Stolte, S. S Su, G. B. Sun, G. X. Sun, H. Sun, H. K. Sun, J. F. Sun, K. Sun, L. Sun, R. Sun, S. S. Sun, T. Sun, W. Y. Sun, Y. C. Sun, Y. H. Sun, Y. J. Sun, Y. Z. Sun, Z. Q. Sun, Z. T. Sun, H. Tabaharizato, N. T. Tagsinsit, C. J. Tang, G. Y. Tang, J. Tang, J. J. Tang, L. F. Tang, Y. A. Tang, Z. H. Tang, L. Y. Tao, M. Tat, J. X. Teng, J. Y. Tian, W. H. Tian, Y. Tian, Z. F. Tian, K. Yu. Todyshev, I. Uman, E. van der Smagt, B. Wang, Bin Wang, Bo Wang, C. Wang, Chao Wang, Cong Wang, D. Y. Wang, F. K. Wang, H. J. Wang, H. R. Wang, J. Wang, J. H. Wang, J. J. Wang, J. P. Wang, K. Wang, L. L. Wang, L. W. Wang, M. Wang, Mi Wang, N. Y. Wang, P. Wang, S. Wang, Shun Wang, T. Wang, W. Wang, W. P. Wang, X. F. Wang, X. L. Wang, X. N. Wang, Xin Wang, Y. Wang, Y. D. Wang, Y. F. Wang, Y. H. Wang, Y. J. Wang, Y. L. Wang, Y. N. Wang, Yanning Wang, Yaqian Wang, Yi Wang, Yuan Wang, Z. Wang, Z. L. Wang, Z. Q. Wang, Z. Y. Wang, Zhi Wang, Ziyi Wang, D. Wei, D. H. Wei, D. J. Wei, H. R. Wei, F. Weidner, H. R. Wen, S. P. Wen, U. Wiedner, G. Wilkinson, J. F. Wu, L. H. Wu, L. J. Wu, Lianjie Wu, S. G. Wu, S. M. Wu, X. W. Wu, Z. Wu, H. L. Xia, L. Xia, B. H. Xiang, D. Xiao, G. Y. Xiao, H. Xiao, Y. L. Xiao, Z. J. Xiao, C. Xie, K. J. Xie, Y. Xie, Y. G. Xie, Y. H. Xie, Z. P. Xie, T. Y. Xing, D. B. Xiong, G. F. Xu, H. Y. Xu, Q. J. Xu, Q. N. Xu, T. D. Xu, X. P. Xu, Y. Xu, Y. C. Xu, Z. S. Xu, F. Yan, L. Yan, W. B. Yan, W. C. Yan, W. H. Yan, W. P. Yan, X. Q. Yan, Y. Y. Yan, H. J. Yang, H. L. Yang, H. X. Yang, J. H. Yang, L. Y. Yang, R. J. Yang, X. Y. Yang, Y. Yang, Y. G. Yang, Y. H. Yang, Y. M. Yang, Y. Q. Yang, Y. Z. Yang, Youhua Yang, Z. Y. Yang, W. J. Yao, Z. P. Yao, M. Ye, M. H. Ye, Z. J. Ye, K. Yi, Junhao Yin, Qiqin Yin, Z. Y. You, B. X. Yu, C. X. Yu, G. Yu, J. S. Yu, L. W. Yu, T. Yu, X. D. Yu, Y. C. Yu, Yongchao Yu, C. Z. Yuan, H. Yuan, J. Yuan, Jie Yuan, L. Yuan, M. K. Yuan, S. H. Yuan, Y. Yuan, C. X. Yue, Ying Yue, A. A. Zafar, F. R. Zeng, S. H. Zeng, X. Zeng, Y. J. Zeng, Yujie Zeng, Y. C. Zhai, Y. H. Zhan, B. L. Zhang, B. X. Zhang, D. H. Zhang, G. Y. Zhang, Gengyuan Zhang, H. Zhang, H. C. Zhang, H. H. Zhang, H. L. Zhang, H. Q. Zhang, H. R. Zhang, H. Y. Zhang, Han Zhang, J. Zhang, J. J. Zhang, J. L. Zhang, J. Q. Zhang, J. S. Zhang, J. W. Zhang, J. X. Zhang, J. Y. Zhang, J. Z. Zhang, Jianyu Zhang, Jin Zhang, Jiyuan Zhang, L. M. Zhang, Lei Zhang, N. Zhang, P. Zhang, Q. Zhang, Q. Y. Zhang, Q. Z. Zhang, R. Y. Zhang, S. H. Zhang, S. N. Zhang, Shulei Zhang, X. M. Zhang, X. Y. Zhang, Y. T. Zhang, Y. H. Zhang, Y. P. Zhang, Yao Zhang, Yu Zhang, Yu Zhang, Z. Zhang, Z. D. Zhang, Z. H. Zhang, Z. L. Zhang, Z. X. Zhang, Z. Y. Zhang, Z. Z. Zhang, Zh. Zh. Zhang, Zhaoke Zhang, Zhilong Zhang, Ziyang Zhang, Ziyu Zhang, G. Zhao, J.-P. Zhao, J. Y. Zhao, J. Z. Zhao, L. Zhao, Lei Zhao, M. G. Zhao, R. P. Zhao, S. J. Zhao, Y. B. Zhao, Y. L. Zhao, Y. P. Zhao, Y. X. Zhao, Z. G. Zhao, A. Zhemchugov, B. Zheng, B. M. Zheng, J. P. Zheng, W. J. Zheng, W. Q. Zheng, X. R. Zheng, Y. H. Zheng, B. Zhong, C. Zhong, X. Zhong, H. Zhou, J. Q. Zhou, S. Zhou, X. Zhou, X. K. Zhou, X. R. Zhou, X. Y. Zhou, Y. X. Zhou, Y. Z. Zhou, A. N. Zhu, J. Zhu, K. Zhu, K. J. Zhu, K. S. Zhu, L. X. Zhu, Lin Zhu, S. H. Zhu, T. J. Zhu, W. D. Zhu, W. J. Zhu, W. Z. Zhu, Y. C. Zhu, Z. A. Zhu, X. Y. Zhuang, M. Zhuge, J. H. Zou, J. Zu

Atomic Physics

Interactions and excitation blockade of Rydberg macrodimers

We present a theoretical study of interactions between Rydberg macrodimers, molecular bound states of Rydberg atoms, and the largest known neutral homonuclear diatomic molecules. Accounting for the large number of molecular interaction channels from four interacting Rydberg atoms, we show that macrodimer-macrodimer interactions are anisotropic and similar in strength and range to atomic-state Rydberg interactions. Our analysis reveals the presence of two-atom, three-atom, and four-atom contributions in the bimolecular system, and elucidates how these interactions are rooted in the underlying atomic Rydberg-state couplings. Our calculations of the excitation blockade between macrodimers are in reasonable agreement with experimentally observed signals, and pave the way for the exploration of optically controlled collective quantum dynamics in molecular systems.
Read the full abstract

All authors Dhiya Varghese, Rejish Nath, Simon Hollerith, Valentin Walther

Machine Learning

Principal-timestep Restricted Init via Sparse Matrix-decomposition in Flow-matching

Flow-matching diffusion models have recently emerged as a strong paradigm for high-fidelity visual generation. However, their prohibitively high fine-tuning cost limits scalability to downstream tasks. While Low-Rank Adaptation (LoRA) combined with spectral initialization has demonstrated accelerated convergence and improved performance in autoregressive language models by better aligning gradient directions, we find that it fails to deliver similar gains in diffusion fine-tuning, often yielding marginal or even negative improvements over vanilla LoRA.We attribute this discrepancy to a fundamental mismatch between LoRA's low-rank parameterization and the intrinsically high-rank gradients induced by the flow-matching objective. In particular, stochastic timestep sampling introduces directionally heterogeneous gradient signals across training steps, leading to misaligned updates under low-rank constraints.To address this issue, we propose Prism-LoRA,a Principal-timestep Restricted Init via Sparse Matrix-decomposition framework that improves gradient alignment during fine-tuning. Our method consists of two key components: (i) principal timestep selection, which restricts initialization gradients to a subset of dominant timesteps to suppress effective gradient rank, and (ii) principal channel filtering, which removes task-irrelevant channels, enabling the one-step spectral initialization gradient to better align with the long-horizon optimization trajectory. Extensive experiments demonstrate that our method consistently improves both convergence speed and final performance across multiple diffusion fine-tuning benchmarks, including subject-driven generation, controllable generation, and deblurring, achieving not only performance improvement but also earlier stages of convergence over baseline LoRA and other spectral-init methods.
Read the full abstract

All authors Jiayang Gu, Zheng Fang, Lichaun Xiang, Fanghui Liu, Xu Cai, Hongkai Wen

Combinatorics

Protected tails and polynomial-time enumeration of permutations avoiding a direct sum of an increasing pattern and 231

We give an algorithm counting the permutations that avoid a fixed pattern of the following form: the direct sum of an increasing pattern and 231. The first members of the family are 1342 and 12453. For each member the algorithm uses polynomially many operations and stored integers, with degrees that grow linearly in the length of the pattern. It comes from a recurrence that reads a permutation from left to right and records the constraints that the letters read so far impose on those still unread. This recurrence has exponentially many states, but part of each state is protected: later steps carry it along unchanged and do not depend on it, and factoring the protected part out leaves a dynamic program of polynomial size. For 12453 a translation symmetry sharpens the bounds to degree seven for the operations and degree four for the storage. We also compute the number of 12453-avoiding permutations of every length up to 150. The previously published series, due to Biers-Ariel (2019), reached length 38. We also give a sampler of uniformly random avoiders. A floating-point implementation of it, proved to be within total variation distance $3.5\cdot10^{-5}$ of uniform for ideal random bits, draws the one million 12453-avoiding permutations of length 300 shown in a heatmap. The literal and kernel recurrences for 1342 and 12453 are verified in the Lean 4 proof assistant.
Read the full abstract

2609.15642 · 14 Sep · 36 pages, 4 figures, 1 table. v2: revised and shortened exposition, corrected account of prior work, the first 151 terms tabulated, a proved error bound for the floating-point sampler (Appendix A), the Lean 4 development described (Appendix B), and Conjecture 10.1 with the exponent left unspecified. Code, data and Lean 4 development: https://github.com/ulfarsson/public-12453

Fluid Dynamics

Fluctuation-dissipation relations in isotropic turbulence from Kraichnan's fully resolved DIA closure

Kraichnan's Direct Interaction Approximation (DIA) provides a classical closure framework for homogeneous turbulence, yet its quantitative predictions across all scales remain incompletely understood. We present a fully resolved numerical solution of the forced DIA equations without additional modelling assumptions, enabling a consistent analysis of stationary spectral properties and temporal dynamics across all wavenumbers. The main focus is on the fluctuation-dissipation relation between the normalised velocity correlation function and the Green function of linear response. This relation holds only at large scales and is systematically violated in the inertial and dissipation ranges. The non-Gaussian nature of this violation is encoded in the DIA through its non-Markovian equations, even though the DIA can be derived using a Gaussian mean-field approximation in the stochastic field functional. In the inertial range, characteristic decay times agree quantitatively with those obtained from direct numerical simulations, while deviations arise in the dissipation range. These results highlight the ability of the DIA to capture temporal dynamics despite its limitations in predicting spectral scaling.
Read the full abstract

Computer Vision

Human-Grounded Calibration for Long-Text Image-Text Congruence in Vision-Language Models

Long-text image–text congruence scoring is increasingly important for vision-language systems that must evaluate whether detailed textual descriptions match visual content. However, raw similarity scores from dual-encoder models are difficult to interpret as calibrated congruence measures, especially under the modality gap between image and text embeddings. This paper proposes Congruency Score (CS), a lightweight calibration layer that maps image–text similarity evidence into a bounded score. Using DOCCI and Urban1k, we evaluate four frozen vision-language backbones and show that observed reductions in post-projection centroid distance do not uniformly improve image–text retrieval performance. Human-grounded evaluations on DOCCI further reveal a trade-off: direct post-hoc calibration preserves high association with human judgments, whereas selected projection-based configurations can reduce threshold-relevant slope and intercept distortions at the cost of retrieval performance and association strength. These results establish long-text image–text congruence scoring as a calibrated score-estimation problem, where retrieval performance, human association, and threshold calibration must be evaluated as distinct objectives. CS provides a lightweight way to expose and operationalize this separation.
Read the full abstract

Computer Vision

SAM3D-Part: Interactive Part Selection and Generation from 3D Objects

Part-level control is essential for modern 3D asset creation, where objects are frequently edited, reused, animated, or fabricated through their individual components. In many such workflows, users need only several specific components rather than a complete object decomposition. However, existing 3D generation methods produce all parts regardless of user intent, while promptable 3D segmentation methods typically output partial surfaces instead of reusable complete meshes. In addition, image-conditioned part generators further struggle to preserve hidden geometry and accurate placement without directly conditioning on the source mesh. To address these problems, we present SAM3D-Part, a prompt-driven framework for selective part generation from input 3D object meshes. Given a source mesh and a part prompt, SAM3D-Part first encodes the source geometry into compact mesh features and aligns them with the rendered image, selective mask, and point-map observations via pixel-wise channel fusion. The fused representation conditions a feed-forward generative model to produce only the queried component as a completed mesh. To place the generated part back into the source coordinate frame, SAM3D-Part predicts dense per-voxel correspondences and estimates the part transformation from distributed spatial evidence rather than a single global pose code. For sequential multi-part queries, previously generated parts are stored in a part cache and reused as contextual constraints, reducing conflicts among independently requested components. Extensive experiments and ablations demonstrate that SAM3D-Part can significantly improve source alignment, reduce conditioning cost, and enable consistent selective part generation, achieving state-of-the-art. Code and weights will be available at https://github.com/Jiahao620/sam3d-part.
Read the full abstract

All authors Jiahao Chang, Dong Du, Wanhu Sun, Yujian Zheng, Chuanyu Pan, Bowen Zhao, Chongjie Ye, Yuanming Hu, Xiaoguang Han

Artificial Intelligence

Potential of Artificial Intelligence Algorithms for Identification of Relevant Diagnostic and Prognostic Biomarkers of Early-Stage Liver Cancer

This study explores the use of deep learning and explainable artificial intelligence to diagnose hepatocellular carcinoma (HCC) and define effective biomarkers across five different stages of disease development using a transcriptomic biomarker HCC dataset constructed via semi-supervised learning from three source datasets. Several deep learning experiments were conducted with different feature extraction techniques and gene sets to identify the most effective features for training high-accuracy models with minimal loss. The best-performing model, using 15 selected genes with the SelectKBest algorithm, achieved 90.74% accuracy, while the model with the lowest recorded loss of 0.3187 was obtained using 20 selected genes. To address the issue of class imbalance in the dataset, a weighted training approach was conducted, and for model transparency and interpretability a SHAP-based XAI analysis provided insights into the model's decision-making, consistently finding DNAJB14 as the most influential gene. Functional validation in this study has provided compelling evidence that DNAJB14 plays an important role in the adverse properties of HCC and that its inhibition effectively reverses tumour cell migration, invasion, colony and sphere formation. The main limitation of this study is the dataset's class imbalance, and while weighted training helped mitigate this, further research and additional data are needed to guarantee model generalizability. Future studies should also explore the influence of genetic variations, environmental factors, and clinical differences on model performance across diverse populations.
Read the full abstract

All authors Ali Bou Nassif, Darko Castven, Manar Abu Talib, Jibran Sualeh Muhammad, Ahmed Ammar Kubba, Jens Marquardt, Abdalla Sayed Ali

Combinatorics

Independent Sets and Balanced Cycle-Linkings in 2-Connected Graphs

For every $\alpha\ge3$ and all sufficiently large $n$, we identify a single graph that simultaneously maximizes the number of independent sets of every size among all $n$-vertex $2$-connected graphs with independence number $\alpha$. This graph is unique up to isomorphism and is a balanced cycle-linking of the disjoint union of $\alpha$ cliques whose orders differ by at most one. More precisely, for each $3\le\beta\le\alpha$, the graphs maximizing the number of independent $\beta$-sets are exactly the cycle-linkings whose clique-size cyclic words are $\lfloor\beta/2\rfloor$-balanced. These results extend the corresponding extremal result for connected graphs to the $2$-connected setting. The proof combines generalized Turán-type clique counting and the edge-extremal theory of $2$-connected graphs with a coefficientwise balancing-switch argument. The switch also shows that a shortest imbalance of length $r$ first affects the independent-set count in degree $2r$.
Read the full abstract

Hardware Architecture

Trillion-Parameter MoE in a Box: Decoupling Memory Provisioning with High-Bandwidth Flash

An MoE appliance for trillion-parameter models at low concurrency must host terabytes of weights on one node and serve prefill and decode with fixed resources. Combining operator analysis of two trillion-parameter MoE models, a measured expert routing trace, and agentic serving traces over multiple turns, we explore a design space spanning High-Bandwidth Flash (HBF) and DRAM configurations, bandwidth exposure, and near-data compute. We find that state bandwidth and HBF transport form two largely orthogonal knees and address two provisioning questions. Q1: Once weights move to HBF, what bandwidth-to-capacity ratio does DRAM require? With a 256-GB floor for the state tier, both models meet a $1.10\times$ completion time target at ratios of only $1.4$–$4.0~\mathrm{s}^{-1}$, roughly an order of magnitude below HBM3e's $33.3~\mathrm{s}^{-1}$. Q2: As HBF internal bandwidth scales with capacity, must bandwidth to the host scale proportionally? Six HBF packages expose 384~GB/s per package to the host, 2.30~TB/s aggregate and 62.5% below the 6.14~TB/s full exposure reference, while more packages reduce required bandwidth per package at the same target.
Read the full abstract

All authors Pengfei Xia, Tuo Hao, Shengwei Li, Jinjing Chen, Shiru Wei, Wenjun Zou, Rui Zhang, Hui Zang

Computer Vision

ModaLens: Measuring Image Sensitivity in Report-Conditioned Medical VLMs

A radiology report can already answer a clinical question, so it is hard to tell whether a vision-language model also uses the image. ModaLens, a paired image-swap audit, measures how report availability changes image sensitivity: MedGemma-27B on 3,199 paired MIMIC-CXR cases from 293 patients, all 14 questions per case (13 finding-specific and one composite), each image replaced by one from another study, usually of the same patient, with question and report fixed. Under an explicit answer instruction, the model's generated answer changes on 4.26 percent of trials with the report and 20.94 percent without it, a paired increase of 16.7 points (patient-clustered 95 percent CI 15.6 to 17.7), so report availability reduces image-swap sensitivity under this protocol; the original prompt with a lowercase first-token readout gives 4.70 percent against 17.07 percent, and substitutions also move continuous answer scores where the binary prediction does not change. The labels are derived from reports, which limits conclusions about visual correctness; the direction replicates in two further model lineages. Code, the exact prompts and a run record for every number are at https://github.com/criticaldata/MODALENS.
Read the full abstract

All authors Sebastián Andrés Cajas Ordóñez, Maximin Lange, Quang Bui, Anqi Peter Li, Felipe Ocampo Osorio, Rafi Al Attrach, Kushul Reddy Palakala, Sahil Kapadia, Zakaria Laouabdia Sellami, Xinyue Zhang, Ashley Zhang, Leo Anthony Celi

High Energy Physics (Phenomenology)

Xenon Isotope Filtering at the Kinematic Edge of Inelastic Dark Matter

Motivated by high-energy xenon recoil searches, we study isotope-dependent endothermic dark-matter scattering near the upper speed boundary of a truncated Galactic halo. Small differences among xenon nuclear masses shift the minimum incident speed and can be strongly amplified when the required velocity approaches the end of the halo distribution. We formulate the isotope-resolved coherent-contact rate and separate this kinematic filtering from high-momentum nuclear suppression. For $m_\chi=1.1~\TeV$, $\delta=365~\keV$, and $E_R=248~\keV$, the kinematic-only benchmark gives $f_{136}^{\rm kin}\simeq0.289$, while after Helm weighting the largest contribution is $f_{132}\simeq0.346$ and the $^{136}$Xe fraction falls to $\simeq0.094$. For idealized pure-isotope targets at fixed detector mass, microscopic coupling, and halo, the integrated $225$–$271~\keV$ responses relative to natural xenon are approximately $0.404$, $1.235$, and $1.693$ for $^{129}$Xe, $^{132}$Xe, and $^{136}$Xe, respectively. A single effective-xenon nucleus also fails to reproduce the full isotope sum accurately near the edge, changing the benchmark window rate by about $8\%$ and producing larger spectral distortions. These quantitative results depend on the high-speed halo and on the assumed nuclear response; the isotope-dependent kinematic support does not. The calculation is a theory-level diagnostic rather than an LZ likelihood fit or event-by-event isotope identification.
Read the full abstract

Quantum Physics

A Nonrecursive Lindblad Quantization of Dissipative Polynomial Dynamics

We present a direct and nonrecursive construction that maps an arbitrary planar polynomial dissipative flow $\dot{\alpha}=h(\alpha,\alpha^*)$ to an open quantum system in Gorini–Kossakowski–Sudarshan–Lindblad form. Given the homogeneous components of the classical drift, the corresponding Hamiltonian and collapse-operator blocks are obtained algebraically and independently at each degree. No recursive cancellation of lower-order terms is required: in the large-amplitude limit $|\alpha|\sim S\to\infty$, ordering-generated lower-degree terms are parametrically suppressed, while mean-field closure yields the prescribed leading $O(S)$ drift for semiclassically localized states. This provides a simple and systematic route from dissipative classical dynamics to explicit open-quantum-system realizations, without claiming a unique microscopic quantization of the classical flow. We demonstrate the construction for stable fixed points, a Hopf bifurcation, and a bistable-ring flow. The corresponding Liouvillian spectra recover the classical relaxation exponents, the radial Floquet exponent and neutral phase direction of a limit cycle, and the separation between local relaxation and inter-ring switching in the bistable case. These examples show that the construction can be used not only to analyze a given quantum model, but also to design open quantum systems with prescribed classical dynamical structures in the semiclassical limit.
Read the full abstract

Robotics

Flow-Matched Motion Priors: Online Optimal-Transport Rewards for Imitation Learning

Learning a motion prior requires a reward that guides a policy from its current behavior toward demonstrated motion. Adversarial Motion Priors (AMP) provide such a reward with a discriminator. However, adversarial objectives can become uninformative when policy and expert supports are far apart. A naive use of optimal transport (OT) averages matched expert successors into a barycentric target. Averaging across gait phases can weaken the target's joint motion. We introduce Flow-Matched Motion Priors (FMP), an online scalar reward learned from paths connecting current rollout histories to an expert motion bank. Entropic OT supplies the coupling. Before each policy update, we train a neural potential with flow matching (FM) along the rollout-to-expert paths, endpoint-gradient supervision, and relative-value calibration. The actor receives only physical observations and the reward remains a scalar, as in AMP. Controlled reward-model experiments show substantially better generalization beyond the fitting rollout than value-only or endpoint-only fitting. On Unitree G1, matched 50-million-transition experiments compare FMP with AMP, a barycentric OT reward, and nested ablations under demonstration and fixed-pose initialization. FMP produces stable forward walking at 0.727 m/s from demonstration resets and 0.338 m/s from a fixed default pose. In the fixed-pose condition, it incurs 129 falls versus 243 for the endpoint-only control. Against a static score-gradient teacher, dynamic FM reduces score-increment error at interpolation fractions 0.25 and 0.50 while using 29% less offline fitting time.
Read the full abstract

All authors Yilin Zou, Chenghua Liu, Chenglong Wu, Fanghua Jiang

Numerical Analysis

A {\phi}-FEM approach for time-dependent domains with unfitted meshes

In this work, we propose an unfitted finite element scheme to approximate the solution of the heat equation on moving domains. We use the {\phi}-FEM paradigm in which the computational domain is described implicitly by a level-set function {\phi}. This function is incorporated into the variational formulation in order to enforce the boundary conditions, which allows the use of unfitted meshes in space. Such a strategy avoids the need for remeshing at each time step and makes it possible to handle complex geometrical evolutions. Moreover, the {\phi}-FEM approach has the advantage of being simple to implement within standard finite element libraries. We introduce a fully discrete scheme that combines the {\phi}-FEM spatial discretization with the lowest-order discontinuous Galerkin method in time. Under regularity assumptions on the level-set function and a mild restriction linking the time step to the mesh size, we establish an optimal a priori error estimate in the L2(0,T;H1) norm. Finally, we present several numerical experiments that confirm this convergence rate, exhibit a second-order convergence in the L{\infty}(0,T;L2) norm, and illustrate the robustness and accuracy of the proposed method.
Read the full abstract

All authors Michel Duprez, Johan Marguet, Alexei Lozinski, Igor Voulis

Mesoscale and Nanoscale Physics

Percolation threshold in cluster-assembled nanogranular palladium films and related strategies for hydrogen detection

Electrical transport in cluster-assembled nanogranular palladium films was investigated in-situ during growth by Supersonic Cluster Beam Deposition. The percolation onset is observed at a thickness of 1.5 nm, while the percolation completion at 2.5 nm. Films at the percolation thickness (2 nm) and beyond the percolation end (5 nm) were subsequently exposed ex-situ to 0.25% hydrogen in air to investigate how hydrogen-induced structural changes in Pd clusters modulate electrical transport and can be exploited as mechanism for selective hydrogen detection. Implantation of palladium clusters in soft polymer styrene-ethylene-butylene-styrene was also explored to promote clusters separation and enhance quantum tunnelling phenomena within electrical transport. The observed electrical transport pattern features stable baselines in air, suggesting material stability, fast response time (T50% < 10 s), and the coexistence of reversible and irreversible components in conduction changes induced by hydrogen exposure. The irreversible component is tentatively attributed to hydrogen-promoted partial coalescence of Pd clusters. The behaviour of the polymer implanted samples suggests an alternative gas detection mechanism where hydrogen-induced polymer swelling dominates over palladium structural modifications. These results disclose novel possible transducing routes for miniaturized hydrogen detection and multimodal sensing.
Read the full abstract

All authors A. Debot, D. Balakrishnan, A.M. Philippe, E. Barborini

Algebraic Geometry

Algebraic hyperbolicity of very general hypersurfaces in projective spaces

We prove that a very general sextic threefold in $\mathbb{P}^4$ is algebraically hyperbolic, settling the last open case and completing the classification of algebraic hyperbolicity for very general hypersurfaces in projective space. The proof follows the Coskun–Riedl scroll construction, with the moduli of stable maps and the geometric canonical height as new ingredients.
Read the full abstract

Distributed Computing

DeepSeek-V4-Flash on AMD gfx90a: Correctness Recovery and Inference Performance Engineering

We present the enablement, correctness recovery, and performance engineering of DeepSeek-V4-Flash inference on AMD Instinct MI250 GPUs using the gfx90a/CDNA2 architecture. The system integrates native safetensors loading, tensor and expert parallelism, FP4 routed mixture-of-experts computation, FP8 dense projections, sparse attention, HIP graph execution, and OpenAI-compatible serving within SGLang. An initially fast execution path was found to be numerically incorrect because of a routed-expert W2 layout mismatch. We identify the output permutation, repair the weight layout at load time, and establish fixed-token and hash-based correctness checks before further optimization. On the corrected path, decode performance is improved through packed FP4 weights, INT8 activation quantization, CDNA2 dot-product instructions, peer-read all-reduce, and topology-aware kernel geometry. Prefill is accelerated using CDNA2 MFMA kernels, improved packed-weight reuse, reduced sparse-attention overhead, larger chunks, and retuned expert sorting. On four MI250 GCDs, TP4/EP1 native autoregressive decode reaches approximately 74.5 tok/s, while a 4,604-token prompt reaches 2.061-2.062 s TTFT, or approximately 2,234 input tok/s. The results show that efficient DeepSeek-V4-Flash inference on CDNA2 is limited not only by memory bandwidth, but also by FP4 execution-format mismatch, low-M utilization, and per-layer synchronization costs.
Read the full abstract

Rings and Algebras

On implicit operations and balanced categories

The problem of determining whether a category is balanced (i.e., every morphism that is both an epimorphism and a monomorphism is an isomorphism) has been widely investigated, especially in algebra. For complete categories with an extremal projective generator, we characterise the property of being balanced, and the stronger property that every monomorphism is regular, in terms of implicit operations. These characterisations apply, for example, to any quasiequational class of algebras, possibly with a proper class of function symbols and unbounded arities, that admits free algebras.
Read the full abstract

Machine Learning

FedLTLib: A Comprehensive Benchmark for Federated Long-Tail Learning

Driven by the escalating demand for privacy-preserving computing, Federated Learning (FL) has witnessed remarkable progress, becoming a cornerstone technology for bridging distributed data silos in mobile edge networks. However, in real-world mobile computing environments, data is generated by heterogeneous mobile devices with varying user behaviors, leading to a significant Long-Tail Distribution. Unlike idealized balanced datasets, data in the wild manifests an acute imbalance where a minority of head classes dominate the sample space while a vast number of tail classes, often representing rare but critical edge-case events, are extremely scarce. This data heterogeneity, which we formally characterize as "Double Heterogeneity", referring to the superposition of global class imbalance and local statistical skew, precipitates severe performance deterioration on tail classes, thereby spurring the vital research direction of Federated Long-Tail Learning (FL-LT). To standardize evaluation and accelerate research in this field, we introduce FedLTLib, a comprehensive benchmark tailored for FL-LT. Addressing the critical issues of inconsistent experimental configurations and unfair comparisons in prior work, FedLTLib establishes a standardized evaluation framework. The platform not only incorporates diverse benchmark datasets reflecting mobile data characteristics but also implements 13 state-of-the-art FL algorithms (4 traditional FL algorithms and 9 FL-LT algorithms). By leveraging FedLTLib, researchers can perform fair and reproducible evaluations of algorithm robustness and generalization capabilities under a unified experimental protocol, ultimately advancing the deployment of robust intelligence in mobile computing ecosystems.
Read the full abstract

Human-Computer Interaction

Beyond AI Literacy: A Structured Review and Exploratory Meta-Analysis of Measures for Competent Generative-AI Use

Researchers assessing competent generative-AI use at work must choose among self-reports, objective tests, and measures of oversight and reliance. We conducted a structured, seeded review of 24 focal empirical publications, starting from the 2024 COSMIN-based review and adding a targeted update through 17 August 2026. We grouped the measures into four domains: knowledge and use, epistemic oversight, reliance calibration, and operational control of tool-using agents. In an exploratory meta-analysis, we pooled three direct subjective-objective correlations from one research program (REML r = .055; Hartung-Knapp 95% CI [-.047, .156]; combined reported N = 2,765). We could not resolve a discrepancy between the largest study's reported correlation and p-value, leaving its weight uncertain. Adding a synthetic mean of 12 cross-factor correlations from a fourth study gave r = .079 (95% CI [-.025, .181]). This sensitivity analysis concerns a broader comparison. From this small evidence base, we cannot establish a population correlation, validate workplace cutoffs, or justify substituting self-ratings for performance scores. We identified tests of foundation knowledge (AICOS-S and GLAT) and measures of verification, reliance, trust, and dependency. We found no validated individual-level instrument in the focal corpus that tests the full combination of agent scope, permissions, recovery, state isolation, independent review, and evidence-based closure; some cover subsets. We propose a four-layer workplace battery with non-compensatory decision rules, but have not tested its thresholds or whether it improves on other assessment approaches.
Read the full abstract

Systems and Control

MM-LMPC: Multi-Modal Learning Model Predictive Control via Mode-Specific Terminal Design and Bandit-Based Exploration

Learning Model Predictive Control (LMPC) improves iterative control tasks by using previous executions to construct the terminal constraint and terminal cost of the MPC problem. Although effective, this reuse of past trajectories can make LMPC sensitive to the initial data. In particular, LMPC may repeatedly exploit stored trajectories with favorable cost-to-go values while insufficiently exploring alternative route patterns that could yield lower cost after further improvement. To address this issue, we propose Multi-Modal LMPC (MM-LMPC). The proposed framework clusters past trajectories into motion modes, constructs a mode-specific LMPC controller for each mode, and uses an LCB-based meta-controller to select which mode-specific controller to execute at each iteration. Mode information is incorporated into the terminal constraint and terminal cost through two designs. The hard-constrained design uses mode-specific terminal constraints and terminal costs constructed from the data associated with each mode. The soft-regularized design retains a shared terminal constraint while adding membership-based penalties to the terminal cost. These designs reduce the bias caused by pooling all trajectories into a single terminal memory while retaining the recursive feasibility and stability structure of LMPC. Our theoretical analysis shows that both designs preserve recursive feasibility and closed-loop stability. For the hard-constrained design, we further establish mode-wise cost convergence, asymptotic best-mode performance, and a logarithmic cumulative regret bound under the LCB rule. Simulations on multi-route obstacle-avoidance tasks show that MM-LMPC improves exploration and achieves lower costs than standard LMPC.
Read the full abstract

Signal Processing

Packet-Level Complex CIR Tracking for Communication-Native mmWave Sensing: An 802.11ad Testbed

Commercial millimetre-wave (mmWave) Wi-Fi platforms based on IEEE 802.11ad/ay have demonstrated sensing capabilities, but they provide limited visibility into the packet-level measurements and synchronisation mechanisms that determine temporal coherence. We present a programmable 60~GHz IEEE 802.11ad testbed that exposes the complete complex 128-tap channel impulse response (CIR) for every detected packet. This access exposes packet-to-packet delay shifts and common phase drift that commercial-transceiver studies generally do not characterise. We develop a delay-profile alignment method and define a static-reference relative CIR phase that cancels common drift while preserving target-induced variation. We use 30~s respiration sensing to evaluate long-term phase stability for sub-wavelength motion tracking. Across 39 recordings, median absolute waveform correlation increases from 0.41 (timestamp regularised) to 0.52 (delay aligned) and 0.61 (relative-phase calibrated); breathing-rate mean absolute error decreases from 5.1 to 4.1 and 3.6~breaths/min. The results demonstrate controlled characterisation and stabilisation of communication-native WiGig CIR measurements on a fully programmable physical layer.
Read the full abstract

All authors Raquel Marina Noguera Oishi, Haoqiu Xiong, Hany Assasa, Sofie Pollin

Astrophysics of Galaxies

Constraining the Delay Time Distribution of the r- and s-Process from Stellar Ages at Solar Metallicity

We present a new approach to constraining the delay time distribution (DTD) governing r- and s-process element production. Rather than using metallicity as a proxy for time, we work directly with stellar ages at solar metallicity, where chemical equilibrium models are most applicable. We analyze two complementary samples: more than $10,000$ red clump (RC) thin disk stars at solar metallicity from LAMOST, and solar twins with high-precision abundances; both have well-determined stellar ages $\tau$. We fit chemical-equilibrium models with power-law DTDs to the evolution of [Eu/Mg]$(\tau)$ and [Ba/Mg]$(\tau)$ in each sample, taking europium as a canonical r-process element and barium as an s-process element, each referenced to magnesium as a near-instantaneous, CCSNe-dominated element. To validate the method, we first apply it to [Fe/Mg]$(\tau)$ and recover that $\approx\!70\%$ of Fe comes from a delayed channel with a declining DTD $\propto t^{-1.2}$, in agreement with well-established results for iron production in thermonuclear supernovae. It also shows that about $60\%$ of Eu and Ba forming today originate from strongly-delayed processes, and the inferred delayed-production rates of both Eu and Ba rise with delay time, opposite to that of thermonuclear supernovae. These results provide direct temporal constraints on r- and s-process enrichment, complementary to metallicity-based chemical-evolution studies. Because we model abundance referenced to Mg, and the same trend is recovered across stars of different guiding-center radii, this appears unaffected by radial migration and chemical evolution varying with Galactocentric radius. If confirmed, it points to delayed neutron-capture production beyond NS–NS mergers.
Read the full abstract

Machine Learning

Where to Compute and How to Interact: Operator-Readable Adaptation with Gauge-Aware Transport

Adaptive meshes enable neural operators for partial differential equations (PDEs) to allocate spatial samples and computation according to local physical structures. Existing approaches, however, mainly address where to compute, with less attention to how information should interact after node relocation. Mesh adaptation changes local sampling scales, neighborhood structures, and geometric contexts, so representations formed at different nodes may not be directly comparable. Direct aggregation can therefore entangle physical variation with discretization-induced representation variation. Because allocation and interaction are jointly optimized through the same output objective, their individual roles are also difficult to distinguish from final errors alone. We introduce operator readability, requiring an adaptive operator to account for and test why computation is allocated to particular locations and how representations interact under the resulting nonuniform discretization. Based on this principle, we propose the Gauge-Aware Adaptive Mesh Neural Operator (GA-AMNO). Physics-informed adaptive allocation answers where to compute, while geometry-conditioned low-rank Gauge transport maps source features into target representation contexts before aggregation, answering how to interact. This makes mesh-to-solver information exchange inspectable and intervenable. We establish sufficient conditions for representation-consistent aggregation and analyze approximate transport errors and continuity under topology-preserving mesh deformations. Experiments on five PDE benchmarks demonstrate improved predictive accuracy, while controlled interventions and geometric-mismatch analyses verify the roles of allocation and interaction and show that Gauge transport improves cross-discretization representation compatibility under strong geometric mismatch.
Read the full abstract

All authors Zixuan Shen, Quanxu Wan, Bingchuan Wang, Zhi Wang, Biao Luo

Materials Science

Beyond binary at submicron dimensions: crossed-ellipse MTJ free layers as multi-state cells for spintronic crossbars

Spintronic crossbars are promising hardware platforms for energy-efficient neuromorphic computing, but conventional magnetic tunnel junctions (MTJs) are binary, limiting the information density and synaptic precision of each crosspoint. Here, MuMax3 micromagnetic simulations are used to investigate how size and aspect ratio control the switching and remanent-state landscape of crossed-ellipse MTJ free layers, with permalloy as the main model system and CoFeB checks for transferability. At fixed 8:1 aspect ratio, shrinking the device from 16 micron x 2 micron to 80 nm x 10 nm lowers the absolute switching current but raises the switching field from about 11 Oe to about 301 Oe and increases the SOT current density. At fixed major axis 1.6 micron, aspect-ratio tuning produces a low-field four-state regime, while lower aspect ratios stabilize additional remanent states with lower switching fields and current densities. A 1.6 micron x 0.8 micron device exhibits twelve accessible remanent plateaus in its angle-resolved planar Hall response, with the resolved state count depending on both aspect ratio and absolute size. Projected MTJ readout gives multiple electrical levels, while minimum-energy-path calculations show that the twelve configurations are not all thermally independent. Independent MuMax+ calculations reproduce the multistate topology and reveal lower-barrier multistep escape pathways between nominally distant states. These results define a geometry-dependent design window for scalable multistate spintronic crossbar cells.
Read the full abstract

All authors Arup Ghosh, Ariel Zaig, Colin Ducarme, Thomas Coppée, Flavio Abreu Araujo, Lior Klein