For every paper on this page, at least one of the original authors has seen our plain-language explanation and engaged with it — either confirming it reads accurately or requesting corrections that we then applied. An endorsement does not mean the authors formally approve every sentence, but it does mean the explanation has passed the eyes of the people who wrote the paper.

438 papers reviewed by authors · 51–60 / 438

Note on higher spins and holographic symmetry algebra

This paper extends the holographic symmetry algebra for gravitons and gluons by demonstrating that conformally soft higher spin particles generate a ww_{\infty} subalgebra (and an SS-algebra for colored particles) that does not commute with the standard w1+w_{1+\infty} subalgebra, a result verified via tree-level MHV amplitudes and extended to non-zero cosmological constants.

Shamik Banerjee, Suman Guchait, Raju Mandal, Sudhakar Panda2026-05-25✓ Author reviewed ⚛️ hep-th

From Correctness to Preference: A Framework for Personalized Agentic Reinforcement Learning

This paper proposes a unified framework for personalized Agentic Reinforcement Learning that integrates Personalized Anchor Reward-Decoupled Policy Optimization (PARPO), a preference-disentangled reward model, and Preference-Aligned Skill Evolution Graph Memory (PSGM) to effectively address heterogeneous user preferences and improve agent performance across diverse planning and tool-use scenarios.

Ranxu zhang, zeyang li, Jiacheng Huang, Rui Zhang, Xiaozhou Xu, sun zhe, Yanyong Zhang, Chao Wang2026-05-25✓ Author reviewed 💬 cs.CL

An Open-Source Training Dataset for Foundation Models for Black-box Optimization

This paper introduces BBO-Pile, the first large-scale open-source dataset containing over 500,000 optimization trajectories across 3,095 black-box functions, and demonstrates that foundation models trained on this data can effectively learn and imitate black-box optimization strategies through scalable pre-training.

Aaron Klein, Herilalaina Rakotoarison, Luca Thale-Bombien, David Salinas2026-05-25✓ Author reviewed 🤖 cs.LG

Fine-Tuning Causal LLMs for Text Classification: Embedding-Based vs. Instruction-Based Approaches

This paper demonstrates that for resource-constrained single-label text classification, fine-tuning causal LLMs with a classification head on final-token embeddings is significantly more parameter-efficient than instruction tuning while achieving comparable or superior performance to both instruction-tuned LLMs and domain-specific BERT models.

Amirhossein Yousefiramandi, Ciaran Cooney2026-05-25✓ Author reviewed 💬 cs.CL

Swarical: An Integrated Hierarchical Approach to Localizing Flying Light Specks

Swarical is a swarm-based hierarchical localization technique that enables miniature Flying Light Specks to accurately and efficiently localize themselves and illuminate complex shapes by leveraging hardware-specific sensor data and heterogeneous orientations, achieving state-of-the-art accuracy with more than twice the speed of existing decentralized methods.

Hamed Alimohammadzadeh, Shahram Ghandeharizadeh2026-05-25✓ Author reviewed 💻 cs

Prompt photon production in a bremsstrahlung in proton-proton collisions at s\sqrt{\mathbf{s}}=10 GeV NICA energies

This paper investigates the kinematic dependencies and polarization effects on the differential cross-section and double spin asymmetry of prompt photon production via bremsstrahlung in proton-proton collisions at NICA energies of s=10\sqrt{s}=10 GeV, noting that while this process constitutes a small fraction (0.03%) of the total prompt photon yield, it exhibits significant sensitivity to proton polarization at high transverse momenta.

Mohsun Rasim Alizada, Azar Inshalla Ahmadov2026-05-22✓ Author reviewed ⚛️ hep-ph

A generalization of the Erd\H{o}s-Sierpinski conjecture

This paper investigates the equation σ(n+1)=kσ(n)\sigma(n+1) = k\sigma(n) by combining combinatorial generalizations of Zumkeller numbers with advanced probabilistic number theory techniques to prove that the solution set has zero natural density with an explicit upper bound of O(x/logloglogx)O(x/\sqrt{\log \log \log x}), while also establishing conditional infinitude for the case k=2k=2 under Schinzel's H Hypothesis.

Amirali Fatehizadeh2026-05-22✓ Author reviewed 🔢 math