Tootfinder

Page Match: Spotify synchronisiert Buch und Hörbuch
Mit Page Match ermöglicht es Spotify, nahtlos zwischen dem Lesen eines Buchs und dem Hören eines Audiobooks zu wechseln. Dafür muss man nur ein Foto machen.
https://ww…

Replaced article(s) found for cs.DS. https://arxiv.org/list/cs.DS/new
[1/1]:
- Optimal Hardness of Online Algorithms for Large Independent Sets
David Gamarnik, Eren C. K{\i}z{\i}lda\u{g}, Lutz Warnke
https://arxiv.org/abs/2504.11450 https://mastoxiv.page/@arXiv_csDS_bot/114346418465357434
- An Approximation Algorithm for Monotone Submodular Cost Allocation
Ryuhei Mizutani
https://arxiv.org/abs/2511.00470 https://mastoxiv.page/@arXiv_csDS_bot/115490466535056736
- Expected Cost of Greedy Online Facility Assignment on Regular Polygons (v3)
Md. Rawha Siddiqi Riad, Md. Tanzeem Rahat, Md. Manzurul Hasan
https://arxiv.org/abs/2512.00506 https://mastoxiv.page/@arXiv_csDS_bot/115648910775471187
- Nested and outlier embeddings into trees
Shuchi Chawla, Kristin Sheridan
https://arxiv.org/abs/2601.15470 https://mastoxiv.page/@arXiv_csDS_bot/115943420904659985
- Bankrupting DoS Attackers
Trisha Chakraborty, Abir Islam, Valerie King, Daniel Rayborn, Jared Saia, Maxwell Young
https://arxiv.org/abs/2205.08287
- An Algorithm for Fast and Correct Computation of Reeb Spaces for PL Bivariate Fields
Amit Chattopadhyay, Yashwanth Ramamurthi, Osamu Saeki
https://arxiv.org/abs/2403.06564 https://mastoxiv.page/@arXiv_csCG_bot/112081476174323525
- On Densest $k$-Subgraph Mining and Diagonal Loading: Optimization Landscape and Finite-Step Exact...
Qiheng Lu, Nicholas D. Sidiropoulos, Aritra Konar
https://arxiv.org/abs/2410.07388 https://mastoxiv.page/@arXiv_csSI_bot/113287589348257824
- A New Quantum Linear System Algorithm Beyond the Condition Number and Its Application to Solving ...
Jianqiang Li
https://arxiv.org/abs/2510.05588 https://mastoxiv.page/@arXiv_quantph_bot/115337999786748703
- On Purely Private Covariance Estimation
Tommaso d'Orsi, Gleb Novikov
https://arxiv.org/abs/2510.26717 https://mastoxiv.page/@arXiv_csLG_bot/115468358153466988
- The Query Complexity of Local Search in Rounds on General Graphs
Simina Br\^anzei, Ioannis Panageas, Dimitris Paparas
https://arxiv.org/abs/2601.13266 https://mastoxiv.page/@arXiv_csCC_bot/115932039505257286
toXiv_bot_toot

Lesenswerter Post von @… zu #Venezuela
https://steady.page/d…

Ils sont où les résultats du vote ?
https://www.lemonde.fr/recherche/?search_keywords=Hongrie &page=1

edit_wikibooks: Wikipedia book edits (2010)
Two bipartite user-page networks extracted from Wikipedia, about books. A user connects to a page if that user edited that page. Edits (edges) are timestamped. Edge weights represent counts of the number of edits.
This network has 9144 nodes and 32618 edges.
Tags: Informational, Web graph, Multigraph, Timestamps
…

50 years ago tonight, the jerry garcia band at duke university, only surfaced semi-recently. another show opened by uncle vinty. spring ’76, show #18. https://archive.org/details/jg76-04-04.134922.jgb.early-late.aud.flac1644
“mystery train” video, from th…

I'm the president of Minneapolis Regional Labor Federation,
and my city is under occupation by the federal government.
Our community has pulled together, doing everything we can to protect our neighbors from being kidnapped and detained by ICE and border patrol.
One of our members was detained by ICE in the parking lot of their workplace and taken to a facility in Texas.
After two weeks in detention under astonishing conditions,
being pressured to sign &quo…

Home Page - The Labor Force
The Labor Force unites all workers to strengthen the labor movement through groundbreaking organizing and strategic partnerships.

📰 Deine finanzielle Unterstützung macht’s möglich: Ich informiere täglich über #Zukunftsthemen, die uns alle betreffen. #Klimaschutz, #Energiewende und

KlimaCrew
Ich informiere über Zukunftsthemen, um Menschen vor Risiken zu warnen und Fortschritte sichtbar zu machen.

Menschen, die nach einer stressigen Aufgabe im Grünen spazieren, erholen sich messbar schneller. ⬇️
#Stress #Erholung
#LernenImWandel

Warum dein Gehirn draußen besser denkt
Ein Spaziergang durch den Park oder einen Wald kann wie Medizin wirken. Buchstäblich. Das sage ich als Person, die nie gern spazierenging.

OK, Beowulf bug. Both EVAL and APPLY in Beowulf are straight transcriptions of the mexprs on pages 70 and 71 of the #Lisp 1.5 Porgammer's Manual.
CONC is the only FEXPR I have implemented so far (and one of only three FEXPRs in the manual).
The unit test for CONC fails, because EVLIS is called on the argument list by EVAL (line 20 on page 71) before it reaches APPLY, and therefore b…

Sharp Bohr Radii for Schwarz Functions and Directional derivative Operators in \mathbb{C}^n
Molla Basir Ahamed, Sujoy Majumder, Debabrata Pramanik
https://arxiv.org/abs/2603.03349

Speak up for our oceans! #Canada #ocean

Our ocean needs you to speak up!
Our ocean is under severe threat from climate change and biodiversity loss. It's time to act!

[2026-02-04 Wed (UTC), 20 new articles found for math.AP Analysis of PDEs]
toXiv_bot_toot

Replaced article(s) found for cs.CL. https://arxiv.org/list/cs.CL/new
[5/5]:
- AppellateGen: A Benchmark for Appellate Legal Judgment Generation
Yang, Wang, Fan, Hu, Wang, Liu, Zeng, Fu, Gong, Zhang, Li, Zheng, Xu
https://arxiv.org/abs/2601.01331 https://mastoxiv.page/@arXiv_csCY_bot/115847038572575387
- Vision-Language Agents for Interactive Forest Change Analysis
James Brock, Ce Zhang, Nantheera Anantrasirichai
https://arxiv.org/abs/2601.04497 https://mastoxiv.page/@arXiv_csCV_bot/115864542639529766
- FigEx2: Visual-Conditioned Panel Detection and Captioning for Scientific Compound Figures
Jifeng Song, Arun Das, Pan Wang, Hui Ji, Kun Zhao, Yufei Huang
https://arxiv.org/abs/2601.08026 https://mastoxiv.page/@arXiv_csCV_bot/115892719657942341
- Sparse-RL: Breaking the Memory Wall in LLM Reinforcement Learning via Stable Sparse Rollouts
Luo, Zhang, Hu, Zhang, Wang, Su, Sun, Liang, Zhang
https://arxiv.org/abs/2601.10079 https://mastoxiv.page/@arXiv_csLG_bot/115904206341755873
- Compounding Disadvantage: Auditing Intersectional Bias in LLM-Generated Explanations Across India...
Amogh Gupta (Neil), Niharika Patil (Neil), Sourojit Ghosh (Neil), SnehalKumar (Neil), S Gaikwad
https://arxiv.org/abs/2601.14506 https://mastoxiv.page/@arXiv_csCY_bot/115937624654783353
- Measuring Complexity at the Requirements Stage: Spectral Metrics as Development Effort Predictors
Vierlboeck, Pugliese, Nilchian, Grogan, Babu
https://arxiv.org/abs/2602.07182 https://mastoxiv.page/@arXiv_csSE_bot/116045826365214235
- CoPE-VideoLM: Leveraging Codec Primitives For Efficient Video Language Modeling
Sarkar, Pautrat, Miksik, Pollefeys, Armeni, Rad, Dusmanu
https://arxiv.org/abs/2602.13191 https://mastoxiv.page/@arXiv_csCV_bot/116079824094529198
- MoD-DPO: Towards Mitigating Cross-modal Hallucinations in Omni LLMs using Modality Decoupled Pref...
Ashutosh Chaubey, Jiacheng Pang, Mohammad Soleymani
https://arxiv.org/abs/2603.03192 https://mastoxiv.page/@arXiv_csCV_bot/116170511143131333
- Image Generation Models: A Technical History
Rouzbeh Shirvani
https://arxiv.org/abs/2603.07455 https://mastoxiv.page/@arXiv_csCV_bot/116204960613280699
- Rethinking Attention Output Projection: Structured Hadamard Transforms for Efficient Transformers
Shubham Aggarwal, Lokendra Kumar
https://arxiv.org/abs/2603.08343 https://mastoxiv.page/@arXiv_csLG_bot/116205064359384079
- FGTR: Fine-Grained Multi-Table Retrieval via Hierarchical LLM Reasoning
Chaojie Sun, Bin Cao, Tiantian Li, Chenyu Hou, Ruizhe Li, Jing Fan
https://arxiv.org/abs/2603.12702 https://mastoxiv.page/@arXiv_csIR_bot/116237827836520478
- CausalEvolve: Towards Open-Ended Discovery with Causal Scratchpad
Yongqiang Chen, Chenxi Liu, Zhenhao Chen, Tongliang Liu, Bo Han, Kun Zhang
https://arxiv.org/abs/2603.14575 https://mastoxiv.page/@arXiv_csLG_bot/116243782215605653
- Silicon Bureaucracy and AI Test-Oriented Education: Contamination Sensitivity and Score Confidenc...
Yiliang Song, Hongjun An, Jiangan Chen, Xuanchen Yan, Huan Song, Jiawei Shao, Xuelong Li
https://arxiv.org/abs/2603.21636 https://mastoxiv.page/@arXiv_csAI_bot/116283590092117172
- Problems with Chinchilla Approach 2: Systematic Biases in IsoFLOP Parabola Fits
Eric Czech, Zhiwei Xu, Yael Elmatad, Yixin Wang, William Held
https://arxiv.org/abs/2603.22339 https://mastoxiv.page/@arXiv_csLG_bot/116288991182888131
- X-OPD: Cross-Modal On-Policy Distillation for Capability Alignment in Speech LLMs
Di Cao, Dongjie Fu, Hai Yu, Siqi Zheng, Xu Tan, Tao Jin
https://arxiv.org/abs/2603.24596 https://mastoxiv.page/@arXiv_eessAS_bot/116300009464853696
toXiv_bot_toot

The effects of non Bunch-Davies initial conditions on gravitationally produced relics
Enrico Bertuzzo, Gabriel M. Salla, Andrea Tesi
https://arxiv.org/abs/2603.03430 https://

Crosslisted article(s) found for cs.DS. https://arxiv.org/list/cs.DS/new
[1/1]:
- A Fault-Tolerant Version of Safra's Termination Detection Algorithm
Wan Fokkink, Georgios Karlos, Andy Tatman
https://arxiv.org/abs/2602.00272 https://mastoxiv.page/@arXiv_csDC_bot/116005743114928343
- Non-Clashing Teaching in Graphs: Algorithms, Complexity, and Bounds
Sujoy Bhore, Liana Khazaliya, Fionn Mc Inerney
https://arxiv.org/abs/2602.00657 https://mastoxiv.page/@arXiv_csCC_bot/116005533092908045
- Sublinear Time Quantum Algorithm for Attention Approximation
Zhao Song, Jianfei Xue, Jiahao Zhang, Lichen Zhang
https://arxiv.org/abs/2602.00874 https://mastoxiv.page/@arXiv_quantph_bot/116006587128552159
- Hallucination is a Consequence of Space-Optimality: A Rate-Distortion Theorem for Membership Testing
Anxin Guo, Jingwei Li
https://arxiv.org/abs/2602.00906 https://mastoxiv.page/@arXiv_csLG_bot/116006973804501595
- Counting Unit Circular Arc Intersections
Haitao Wang
https://arxiv.org/abs/2602.01074 https://mastoxiv.page/@arXiv_csCG_bot/116005535191670040
- Profit Maximization in Closed Social Networks
Poonam Sharma, Suman Banerjee
https://arxiv.org/abs/2602.01232 https://mastoxiv.page/@arXiv_csSI_bot/116005691056225955
- Totally $\Delta$-Modular Tree Decompositions of Graphic Matrices for Integer Programming
Caleb McFarland
https://arxiv.org/abs/2602.01499 https://mastoxiv.page/@arXiv_mathCO_bot/116006381339684193
- Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex A...
Taihei Oki, Shinsaku Sakaue
https://arxiv.org/abs/2602.01682 https://mastoxiv.page/@arXiv_csLG_bot/116007186801693076
- Stable Matching with Predictions: Robustness and Efficiency under Pruned Preferences
Samuel McCauley, Benjamin Moseley, Helia Niaparast, Shikha Singh
https://arxiv.org/abs/2602.02254 https://mastoxiv.page/@arXiv_csGT_bot/116005915605630934
- Deciding Reachability and the Covering Problem with Diagnostics for Sound Acyclic Free-Choice Wor...
Thomas M. Prinz, Christopher T. Schwanen, Wil M. P. van der Aalst
https://arxiv.org/abs/2602.02447 https://mastoxiv.page/@arXiv_csFL_bot/116005733006023408
toXiv_bot_toot

Told you yesterday 😁

[2026-02-04 Wed (UTC), 1 new article found for physics.atom-ph Atomic Physics]
toXiv_bot_toot

Replaced article(s) found for cs.LG. https://arxiv.org/list/cs.LG/new
[4/6]:
- Neural Proposals, Symbolic Guarantees: Neuro-Symbolic Graph Generation with Hard Constraints
Chuqin Geng, Li Zhang, Mark Zhang, Haolin Ye, Ziyu Zhao, Xujie Si
https://arxiv.org/abs/2602.16954 https://mastoxiv.page/@arXiv_csLG_bot/116102434757760085
- Multi-Probe Zero Collision Hash (MPZCH): Mitigating Embedding Collisions and Enhancing Model Fres...
Ziliang Zhao, et al.
https://arxiv.org/abs/2602.17050 https://mastoxiv.page/@arXiv_csLG_bot/116102517335590034
- MASPO: Unifying Gradient Utilization, Probability Mass, and Signal Reliability for Robust and Sam...
Fu, Lin, Fang, Zheng, Hu, Shao, Qin, Pan, Zeng, Cai
https://arxiv.org/abs/2602.17550 https://mastoxiv.page/@arXiv_csLG_bot/116102581561441103
- A Theoretical Framework for Modular Learning of Robust Generative Models
Corinna Cortes, Mehryar Mohri, Yutao Zhong
https://arxiv.org/abs/2602.17554 https://mastoxiv.page/@arXiv_csLG_bot/116102582216715527
- Multi-Round Human-AI Collaboration with User-Specified Requirements
Sima Noorani, Shayan Kiyani, Hamed Hassani, George Pappas
https://arxiv.org/abs/2602.17646 https://mastoxiv.page/@arXiv_csLG_bot/116102592047544971
- NEXUS: A compact neural architecture for high-resolution spatiotemporal air quality forecasting i...
Rampunit Kumar, Aditya Maheshwari
https://arxiv.org/abs/2602.19654 https://mastoxiv.page/@arXiv_csLG_bot/116125610403473755
- Augmenting Lateral Thinking in Language Models with Humor and Riddle Data for the BRAINTEASER Task
Mina Ghashami, Soumya Smruti Mishra
https://arxiv.org/abs/2405.10385 https://mastoxiv.page/@arXiv_csCL_bot/112472190479013167
- Watermarking Language Models with Error Correcting Codes
Patrick Chao, Yan Sun, Edgar Dobriban, Hamed Hassani
https://arxiv.org/abs/2406.10281 https://mastoxiv.page/@arXiv_csCR_bot/112636307340218522
- Learning to Control Unknown Strongly Monotone Games
Siddharth Chandak, Ilai Bistritz, Nicholas Bambos
https://arxiv.org/abs/2407.00575 https://mastoxiv.page/@arXiv_csMA_bot/112715733875586837
- Classification and reconstruction for single-pixel imaging with classical and quantum neural netw...
Sofya Manko, Dmitry Frolovtsev
https://arxiv.org/abs/2407.12506 https://mastoxiv.page/@arXiv_quantph_bot/112806295477530195
- Statistical Inference for Temporal Difference Learning with Linear Function Approximation
Weichen Wu, Gen Li, Yuting Wei, Alessandro Rinaldo
https://arxiv.org/abs/2410.16106 https://mastoxiv.page/@arXiv_statML_bot/113350611306532443
- Big data approach to Kazhdan-Lusztig polynomials
Abel Lacabanne, Daniel Tubbenhauer, Pedro Vaz
https://arxiv.org/abs/2412.01283 https://mastoxiv.page/@arXiv_mathRT_bot/113587812663608119
- MoEMba: A Mamba-based Mixture of Experts for High-Density EMG-based Hand Gesture Recognition
Mehran Shabanpour, Kasra Rad, Sadaf Khademi, Arash Mohammadi
https://arxiv.org/abs/2502.17457 https://mastoxiv.page/@arXiv_eessSP_bot/114069047434302054
- Tightening Optimality gap with confidence through conformal prediction
Miao Li, Michael Klamkin, Russell Bent, Pascal Van Hentenryck
https://arxiv.org/abs/2503.04071 https://mastoxiv.page/@arXiv_statML_bot/114120074927291283
- SEED: Towards More Accurate Semantic Evaluation for Visual Brain Decoding
Juhyeon Park, Peter Yongho Kim, Jiook Cha, Shinjae Yoo, Taesup Moon
https://arxiv.org/abs/2503.06437 https://mastoxiv.page/@arXiv_csCV_bot/114142690988862508
- How much does context affect the accuracy of AI health advice?
Prashant Garg, Thiemo Fetzer
https://arxiv.org/abs/2504.18310 https://mastoxiv.page/@arXiv_econGN_bot/114414380916957986
- Reproducing and Improving CheXNet: Deep Learning for Chest X-ray Disease Classification
Daniel J. Strick, Carlos Garcia, Anthony Huang, Thomas Gardos
https://arxiv.org/abs/2505.06646 https://mastoxiv.page/@arXiv_eessIV_bot/114499319986528625
- Sharp Gaussian approximations for Decentralized Federated Learning
Soham Bonnerjee, Sayar Karmakar, Wei Biao Wu
https://arxiv.org/abs/2505.08125 https://mastoxiv.page/@arXiv_statML_bot/114505047719395949
- HoloLLM: Multisensory Foundation Model for Language-Grounded Human Sensing and Reasoning
Chuhao Zhou, Jianfei Yang
https://arxiv.org/abs/2505.17645 https://mastoxiv.page/@arXiv_csCV_bot/114572928659057348
- A Copula Based Supervised Filter for Feature Selection in Diabetes Risk Prediction Using Machine ...
Agnideep Aich, Md Monzur Murshed, Sameera Hewage, Amanda Mayeaux
https://arxiv.org/abs/2505.22554 https://mastoxiv.page/@arXiv_statML_bot/114589983451462525
- Synthesis of discrete-continuous quantum circuits with multimodal diffusion models
Florian F\"urrutter, Zohim Chandani, Ikko Hamamura, Hans J. Briegel, Gorka Mu\~noz-Gil
https://arxiv.org/abs/2506.01666 https://mastoxiv.page/@arXiv_quantph_bot/114618420761346125
toXiv_bot_toot

Replaced article(s) found for physics.ins-det. https://arxiv.org/list/physics.ins-det/new
[1/1]:
- Frequency domain laser ultrasound for inertial confinement fusion target wall thickness measurements
Martin Ryzy, Guqi Yan, Clemens Gr\"unsteidl, Georg Watzl, Kevin Sequ…

Over the last days, I wrote a personal tag-page about #music and how it relates to me: https://karl-voit.at/tags/music/
Have fun, if you're interested in my point of views.
And there is more in the pipe…

[2026-03-05 Thu (UTC), 1 new article found for math.CV Complex Variables]
toXiv_bot_toot

OK, I got a new toy and get obsessed with it... again. Nonetheless, I'm digging quite a lot to keep the focus on the less obvious hack you can do on your X4.
Today, we’ll explore how practical it is for reading manga or comics before you start throwing stones!
https://www-gem.codeberg.page/cli_x4_m

OFERA: Blendshape-driven 3D Gaussian Control for Occluded Facial Expression to Realistic Avatars in VR
Seokhwan Yang, Boram Yoon, Seoyoung Kang, Hail Song, Woontack Woo
https://arxiv.org/abs/2602.01748 https://arxiv.org/pdf/2602.01748 https://arxiv.org/html/2602.01748
arXiv:2602.01748v1 Announce Type: new
Abstract: We propose OFERA, a novel framework for real-time expression control of photorealistic Gaussian head avatars for VR headset users. Existing approaches attempt to recover occluded facial expressions using additional sensors or internal cameras, but sensor-based methods increase device weight and discomfort, while camera-based methods raise privacy concerns and suffer from limited access to raw data. To overcome these limitations, we leverage the blendshape signals provided by commercial VR headsets as expression inputs. Our framework consists of three key components: (1) Blendshape Distribution Alignment (BDA), which applies linear regression to align the headset-provided blendshape distribution to a canonical input space; (2) an Expression Parameter Mapper (EPM) that maps the aligned blendshape signals into an expression parameter space for controlling Gaussian head avatars; and (3) a Mapper-integrated Avatar (MiA) that incorporates EPM into the avatar learning process to ensure distributional consistency. Furthermore, OFERA establishes an end-to-end pipeline that senses and maps expressions, updates Gaussian avatars, and renders them in real-time within VR environments. We show that EPM outperforms existing mapping methods on quantitative metrics, and we demonstrate through a user study that the full OFERA framework enhances expression fidelity while preserving avatar realism. By enabling real-time and photorealistic avatar expression control, OFERA significantly improves telepresence in VR communication. A project page is available at https://ysshwan147.github.io/projects/ofera/.
toXiv_bot_toot

404 page not found! wtf!

SDSS J153231.80 420342.7: a triple black hole candidate with a close binary black hole
Qi Zheng, YiWen Jiang, Xue-Guang Zhang, Qirong Yuan
https://arxiv.org/abs/2604.02161 https…

Lower bound on the radii of black-hole shadows
Shahar Hod
https://arxiv.org/abs/2603.03421 https://arxiv.org/pdf/2603.03421

Normality of monomial ideals in three variables
Maki Ataka, Naoyuki Matsuoka
https://arxiv.org/abs/2602.01782 https://arxiv.org/pdf/2602.01782 https://arxiv.org/html/2602.01782
arXiv:2602.01782v1 Announce Type: new
Abstract: An ideal $I$ in a Noetherian ring is called \textit{normal} if $I^n$ is integrally closed for all $n \geq 1$. Zariski proved that in two-dimensional regular local rings, every integrally closed ideal is normal. However, in dimension three and higher, this is no longer true in general, including monomial ideals in polynomial rings.
In this paper, we study the normality of integrally closed monomial ideals in the polynomial ring $k[x,y,z]$ over a field $k$. We prove that every such ideal with at most seven minimal monomial generators is normal, thereby giving a sharp bound for normality in this setting. The proof is based on a detailed case-by-case analysis, combined with valuation-theoretic and combinatorial methods via Newton polyhedra.
toXiv_bot_toot

Polarization Effects in Laser-Assisted (e,2e) Collision on H-atom by Twisted Electrons
Neha, Rakesh Choubisa
https://arxiv.org/abs/2603.02894 https://arxiv…

Jens Spahn: „Der Heizungskeller wird wieder zur Privatsache!“ Klimaschutz ist - wie Nils Minkmar korrekt bemerkt - keine Laune von Robert Habeck, sondern Pflicht – so das Bundesverfassungsgericht. Wer das ignoriert, verabschiedet sich aus der Verantwortung. Emissionen sind nie privat. Politik sollte mehr können als Parolen.
#Klimaschutz

Politische Privatsachen
Spahn im Keller/Clarkson’s Farm/Einaudi Solo Piano/Was bisher geschah–Leni Riefenstahl/Chicken parm/Veggie dirty Rice Die Bundesregierung gleicht jetzt schon, kaum ein…

Size and shape of terrestrial animals
Neelima Sharma, Madhusudhan Venkadesan
https://arxiv.org/abs/2602.00832 https://arxiv.org/pdf/2602.00832

Machine Learning to Predict Spectral Anisotropy in Valence-to-Core X-ray Emission Spectroscopy
Charles A. Cardot, John Tichenor, Seth M. Shjandemaar, Josh J. Kas, Fernando D. Vila, Gerald T. Seidler, John J. Rehr
https://arxiv.org/abs/2602.00242

Replaced article(s) found for cs.LG. https://arxiv.org/list/cs.LG/new
[5/6]:
- Watermarking Degrades Alignment in Language Models: Analysis and Mitigation
Apurv Verma, NhatHai Phan, Shubhendu Trivedi
https://arxiv.org/abs/2506.04462 https://mastoxiv.page/@arXiv_csCL_bot/114635190037336859
- Sensory-Motor Control with Large Language Models via Iterative Policy Refinement
J\^onata Tyska Carvalho, Stefano Nolfi
https://arxiv.org/abs/2506.04867 https://mastoxiv.page/@arXiv_csAI_bot/114635187854195641
- ICE-ID: A Novel Historical Census Dataset for Longitudinal Identity Resolution
de Carvalho, Popov, Kaatee, Correia, Th\'orisson, Li, Bj\"ornsson, Sigur{\dh}arson, Dibangoye
https://arxiv.org/abs/2506.13792 https://mastoxiv.page/@arXiv_csAI_bot/114703312162525342
- Feedback-driven recurrent quantum neural network universality
Lukas Gonon, Rodrigo Mart\'inez-Pe\~na, Juan-Pablo Ortega
https://arxiv.org/abs/2506.16332 https://mastoxiv.page/@arXiv_quantph_bot/114732532383196043
- Programming by Backprop: An Instruction is Worth 100 Examples When Finetuning LLMs
Cook, Sapora, Ahmadian, Khan, Rocktaschel, Foerster, Ruis
https://arxiv.org/abs/2506.18777 https://mastoxiv.page/@arXiv_csAI_bot/114738213040759661
- Stochastic Quantum Spiking Neural Networks with Quantum Memory and Local Learning
Jiechen Chen, Bipin Rajendran, Osvaldo Simeone
https://arxiv.org/abs/2506.21324 https://mastoxiv.page/@arXiv_csNE_bot/114754367612728319
- Enjoying Non-linearity in Multinomial Logistic Bandits: A Minimax-Optimal Algorithm
Pierre Boudart (SIERRA), Pierre Gaillard (Thoth), Alessandro Rudi (PSL, DI-ENS, Inria)
https://arxiv.org/abs/2507.05306 https://mastoxiv.page/@arXiv_statML_bot/114822374525501660
- Characterizing State Space Model and Hybrid Language Model Performance with Long Context
Saptarshi Mitra, Rachid Karami, Haocheng Xu, Sitao Huang, Hyoukjun Kwon
https://arxiv.org/abs/2507.12442 https://mastoxiv.page/@arXiv_csAR_bot/114867589638074984
- Is Exchangeability better than I.I.D to handle Data Distribution Shifts while Pooling Data for Da...
Ayush Roy, Samin Enam, Jun Xia, Won Hwa Kim, Vishnu Suresh Lokhande
https://arxiv.org/abs/2507.19575 https://mastoxiv.page/@arXiv_csCV_bot/114935399825741861
- TASER: Table Agents for Schema-guided Extraction and Recommendation
Nicole Cho, Kirsty Fielding, William Watson, Sumitra Ganesh, Manuela Veloso
https://arxiv.org/abs/2508.13404 https://mastoxiv.page/@arXiv_csAI_bot/115060386723032051
- Morphology-Aware Peptide Discovery via Masked Conditional Generative Modeling
Nuno Costa, Julija Zavadlav
https://arxiv.org/abs/2509.02060 https://mastoxiv.page/@arXiv_qbioBM_bot/115139546511384706
- PCPO: Proportionate Credit Policy Optimization for Aligning Image Generation Models
Jeongjae Lee, Jong Chul Ye
https://arxiv.org/abs/2509.25774 https://mastoxiv.page/@arXiv_csCV_bot/115298580419859537
- Multi-hop Deep Joint Source-Channel Coding with Deep Hash Distillation for Semantically Aligned I...
Didrik Bergstr\"om, Deniz G\"und\"uz, Onur G\"unl\"u
https://arxiv.org/abs/2510.06868 https://mastoxiv.page/@arXiv_csIT_bot/115343320768797486
- MoMaGen: Generating Demonstrations under Soft and Hard Constraints for Multi-Step Bimanual Mobile...
Chengshu Li, et al.
https://arxiv.org/abs/2510.18316 https://mastoxiv.page/@arXiv_csRO_bot/115416889485910123
- A Spectral Framework for Graph Neural Operators: Convergence Guarantees and Tradeoffs
Roxanne Holden, Luana Ruiz
https://arxiv.org/abs/2510.20954 https://mastoxiv.page/@arXiv_statML_bot/115445273121677005
- Breaking Agent Backbones: Evaluating the Security of Backbone LLMs in AI Agents
Bazinska, Mathys, Casucci, Rojas-Carulla, Davies, Souly, Pfister
https://arxiv.org/abs/2510.22620 https://mastoxiv.page/@arXiv_csCR_bot/115451397563132982
- Uncertainty Calibration of Multi-Label Bird Sound Classifiers
Raphael Schwinger, Ben McEwen, Vincent S. Kather, Ren\'e Heinrich, Lukas Rauch, Sven Tomforde
https://arxiv.org/abs/2511.08261 https://mastoxiv.page/@arXiv_csSD_bot/115535982708483824
- Two-dimensional RMSD projections for reaction path visualization and validation
Rohit Goswami (Institute IMX and Lab-COSMO, \'Ecole polytechnique f\'ed\'erale de Lausanne)
https://arxiv.org/abs/2512.07329 https://mastoxiv.page/@arXiv_physicschemph_bot/115688910885717951
- Distribution-informed Online Conformal Prediction
Dongjian Hu, Junxi Wu, Shu-Tao Xia, Changliang Zou
https://arxiv.org/abs/2512.07770 https://mastoxiv.page/@arXiv_statML_bot/115689281155541568
- Coupling Experts and Routers in Mixture-of-Experts via an Auxiliary Loss
Ang Lv, Jin Ma, Yiyuan Ma, Siyuan Qiao
https://arxiv.org/abs/2512.23447 https://mastoxiv.page/@arXiv_csCL_bot/115808311310246601
toXiv_bot_toot

By accident, my #lazyblorg is one of the first blogging solutions that include a "Share on #Mastodon" functionality on each article page. 🥳
Learn how to do it yourself:

Kangol’s Silence to Rabbit Torture is LOUD – Ban Angora NOW! #AnimalRights

Kangol’s Silence to Rabbit Torture is LOUD - Ban Angora NOW!
To make an angora wool, rabbits always pay the price - in fear, in pain, often in blood, and death.

Perfect Network Resilience in Polynomial Time
Matthias Bentert, Stefan Schmid
https://arxiv.org/abs/2602.03827 https://arxiv.org/pdf/2602.03827 https://arxiv.org/html/2602.03827
arXiv:2602.03827v1 Announce Type: new
Abstract: Modern communication networks support local fast rerouting mechanisms to quickly react to link failures: nodes store a set of conditional rerouting rules which define how to forward an incoming packet in case of incident link failures. The rerouting decisions at any node $v$ must rely solely on local information available at $v$: the link from which a packet arrived at $v$, the target of the packet, and the incident link failures at $v$. Ideally, such rerouting mechanisms provide perfect resilience: any packet is routed from its source to its target as long as the two are connected in the underlying graph after the link failures. Already in their seminal paper at ACM PODC '12, Feigenbaum, Godfrey, Panda, Schapira, Shenker, and Singla showed that perfect resilience cannot always be achieved. While the design of local rerouting algorithms has received much attention since then, we still lack a detailed understanding of when perfect resilience is achievable.
This paper closes this gap and presents a complete characterization of when perfect resilience can be achieved. This characterization also allows us to design an $O(n)$-time algorithm to decide whether a given instance is perfectly resilient and an $O(nm)$-time algorithm to compute perfectly resilient rerouting rules whenever it is. Our algorithm is also attractive for the simple structure of the rerouting rules it uses, known as skipping in the literature: alternative links are chosen according to an ordered priority list (per in-port), where failed links are simply skipped. Intriguingly, our result also implies that in the context of perfect resilience, skipping rerouting rules are as powerful as more general rerouting rules. This partially answers a long-standing open question by Chiesa, Nikolaevskiy, Mitrovic, Gurtov, Madry, Schapira, and Shenker [IEEE/ACM Transactions on Networking, 2017] in the affirmative.
toXiv_bot_toot

Lower-dimensional Gauss-Bonnet gravity black holes with quintessence
G. Alencar, T. M. Crispim, J. Macedo, C. R. Muniz
https://arxiv.org/abs/2603.03408 https://

Geometric mechanisms enabling spin- and enantio-sensitive observables in one photon ionization of chiral molecules
Philip Caesar M. Flores, Stefanos Carlstr\"om, Serguei Patchkovskii, Misha Ivanov, Andres F. Ordonez, Olga Smirnova
https://arxiv.org/abs/2603.02735

Replaced article(s) found for math.CV. https://arxiv.org/list/math.CV/new
[1/1]:
- Approximations of Functions With Essential Singularities with Applications to Painlev\'e's First ...
Nicholas Castillo

Spectropolarimetry of the changing-look active galactic nucleus NGC 1566 and its potential link to supermassive black hole binaries
F. Marin, V. H. Sasse, J. Biedermann, D. Hutsem\'ekers, R. C. Fernandes, D. Porquet, V. Oknyansky
https://arxiv.org/abs/2604.01872

ZOR filters: fast and smaller than fuse filters
Antoine Limasset
https://arxiv.org/abs/2602.03525 https://arxiv.org/pdf/2602.03525 https://arxiv.org/html/2602.03525
arXiv:2602.03525v1 Announce Type: new
Abstract: Probabilistic membership filters support fast approximate membership queries with a controlled false-positive probability $\varepsilon$ and are widely used across storage, analytics, networking, and bioinformatics \cite{chang2008bigtable,dayan2018optimalbloom,broder2004network,harris2020improved,marchet2023scalable,chikhi2025logan,hernandez2025reindeer2}. In the static setting, state-of-the-art designs such as XOR and fuse filters achieve low overhead and very fast queries, but their peeling-based construction succeeds only with high probability, which complicates deterministic builds \cite{graf2020xor,graf2022binary,ulrich2023taxor}.
We introduce \emph{ZOR filters}, a deterministic continuation of XOR/fuse filters that guarantees construction termination while preserving the same XOR-based query mechanism. ZOR replaces restart-on-failure with deterministic peeling that abandons a small fraction of keys, and restores false-positive-only semantics by storing the remainder in a compact auxiliary structure. In our experiments, the abandoned fraction drops below $1\%$ for moderate arity (e.g., $N\ge 5$), so the auxiliary handles a negligible fraction of keys. As a result, ZOR filters can achieve overhead within $1\%$ of the information-theoretic lower bound $\log_2(1/\varepsilon)$ while retaining fuse-like query performance; the additional cost is concentrated on negative queries due to the auxiliary check. Our current prototype builds several-fold slower than highly optimized fuse builders because it maintains explicit incidence information during deterministic peeling; closing this optimisation gap is an engineering target.
toXiv_bot_toot

New symmetry for the imperfect fluid
Alcides Garat
https://arxiv.org/abs/2603.03397 https://arxiv.org/pdf/2603.03397

Lifting systems for finite length modules
Benjamin Katz, Nawaj KC, Kesavan Mohana Sundaram, Andrew J. Soto Levins, Ryan Watson
https://arxiv.org/abs/2602.01440 https://arxiv.org/pdf/2602.01440 https://arxiv.org/html/2602.01440
arXiv:2602.01440v1 Announce Type: new
Abstract: This paper is concerned with lifting modules along a surjective map of noetherian local rings, say $\varphi \colon R \twoheadrightarrow S$. A finitely generated $R$-module $L$ is a naive lift of an $S$-module $M$ if $L \otimes_R S \cong M$. We are concerned with the maximum depth and dimension among all naive lifts of $M$, which we call the liftable depth and liftable dimension, respectively, of $M$ along $\varphi$. We approach this via a notion of lifting systems that we introduce in this paper. We then provide a necessary and sufficient condition for a module of finite length to lift and Serre lift to a regular local ring in terms of lifting systems.
toXiv_bot_toot

Relativistic calculations of electron impact excitation cross-sections of neutral tungsten
Ritu Dey, Ayushi Agarwal, Reetesh Kumar Gangwar, Deepti Sharma, M. B. Chowdhuri, Rajesh Srivastava, Joydeep Ghosh
https://arxiv.org/abs/2603.02612

Crosslisted article(s) found for math.CV. https://arxiv.org/list/math.CV/new
[1/1]:
- Electric Teichm\"uller spaces and $k$-multicurve graphs
Kento Sakai
h…

Harnessing the Peripheral Surface Information Entropy from Globular Protein-Peptide Complexes
Tyler Grear, Donald J. Jacobs
https://arxiv.org/abs/2602.00498 https://

[2026-02-03 Tue (UTC), 10 new articles found for cond-mat.str-el Strongly Correlated Electrons]
toXiv_bot_toot

Inter-detector differential fuzz testing for tamper detection in gamma spectrometers
Pei Yao Li, Jayson R. Vavrek, Sean Peisert
https://arxiv.org/abs/2602.00336 https://arxiv.org/pdf/2602.00336 https://arxiv.org/html/2602.00336
arXiv:2602.00336v1 Announce Type: new
Abstract: We extend physical differential fuzz testing as an anti-tamper method for radiation detectors [Vavrek et al., Science and Global Security 2025] to comparisons across multiple detector units. The method was previously introduced as a tamper detection method for authenticating a single radiation detector in nuclear safeguards and treaty verification scenarios, and works by randomly sampling detector configuration parameters to produce a sequence of spectra that form a baseline signature of an untampered system. At a later date, after potential tampering, the same random sequence of parameters is used to generate another series of spectra that can be compared against the baseline. Anomalies in the series of comparisons indicate changes in detector behavior, which may be due to tampering. One limitation of this original method is that once the detector has `gone downrange' and may have been tampered with, the original baseline is fixed, and a new trusted baseline can never be established if tests at new parameters are required. In this work, we extend our anti-tamper fuzz testing concept to multiple detector units, such that the downrange detector can be compared against a trusted or `golden copy' detector, even despite normal inter-detector manufacturing variations. We show using three NaI detectors that this inter-detector differential fuzz testing can detect a representative attack, even when the tested and golden copy detectors are from different manufacturers and have different performances. Here, detecting tampering requires visualizing the comparison metric vs. the parameter values and not just the sample number; moreover this baseline is non-linear and may require anomaly detection methods more complex than a simple threshold. Overall, this extension to multiple detectors improves prospects for operationalizing the technique in real-world treaty verification and safeguards contexts.
toXiv_bot_toot

On the Complexity of Maximal/Closed Frequent Tree Mining for Bounded Height Trees
Kenta Komoto, Kazuhiro Kurita, Hirotaka Ono
https://arxiv.org/abs/2602.03436 https://arxiv.org/pdf/2602.03436 https://arxiv.org/html/2602.03436
arXiv:2602.03436v1 Announce Type: new
Abstract: In this paper, we address the problem of enumerating all frequent maximal/closed trees. This is a classical and central problem in data mining. Although many practical algorithms have been developed for this problem, its complexity under ``realistic assumptions'' on tree height has not been clarified. More specifically, while it was known that the mining problem becomes hard when the tree height is at least 60, the complexity for cases where the tree height is smaller has not yet been clarified. We resolve this gap by establishing results for these tree mining problems under several settings, including ordered and unordered trees, as well as maximal and closed variants.
toXiv_bot_toot

Characterization of Feshbach resonances in $^6\mathrm{Li}{-}^7\mathrm{Li}$ using improved interaction potentials
Jing-Chen Zhang, Paul Julienne, Yu Liu
https://arxiv.org/abs/2603.02361

Replaced article(s) found for math.CV. https://arxiv.org/list/math.CV/new
[1/1]:
- On a problem of Pavlovi\'{c} involving harmonic quasiconformal mappings
Zhi-Gang Wang, Xiao-Yuan Wang, Antti Rasila, Jia-Le Qiu

Replaced article(s) found for cs.LG. https://arxiv.org/list/cs.LG/new
[6/6]:
- Fast-ThinkAct: Efficient Vision-Language-Action Reasoning via Verbalizable Latent Planning
Chi-Pin Huang, Yunze Man, Zhiding Yu, Min-Hung Chen, Jan Kautz, Yu-Chiang Frank Wang, Fu-En Yang
https://arxiv.org/abs/2601.09708 https://mastoxiv.page/@arXiv_csCV_bot/115898618760721320
- Universality of Many-body Projected Ensemble for Learning Quantum Data Distribution
Quoc Hoan Tran, Koki Chinzei, Yasuhiro Endo, Hirotaka Oshima
https://arxiv.org/abs/2601.18637 https://mastoxiv.page/@arXiv_quantph_bot/115967001797773134
- FROST: Filtering Reasoning Outliers with Attention for Efficient Reasoning
Haozheng Luo, Zhuolin Jiang, Md Zahid Hasan, Yan Chen, Soumalya Sarkar
https://arxiv.org/abs/2601.19001 https://mastoxiv.page/@arXiv_csCL_bot/115972068838908815
- Analysis of Shuffling Beyond Pure Local Differential Privacy
Shun Takagi, Seng Pei Liew
https://arxiv.org/abs/2601.19154 https://mastoxiv.page/@arXiv_csDS_bot/115971701218309765
- CryoLVM: Self-supervised Learning from Cryo-EM Density Maps with Large Vision Models
Weining Fu, Kai Shu, Kui Xu, Qiangfeng Cliff Zhang
https://arxiv.org/abs/2602.02620
- XtraLight-MedMamba for Classification of Neoplastic Tubular Adenomas
Sultana, Afsar, Rahu, Singh, Shula, Combs, Forchetti, Asari
https://arxiv.org/abs/2602.04819
- Flow-Based Conformal Predictive Distributions
Trevor Harris
https://arxiv.org/abs/2602.07633 https://mastoxiv.page/@arXiv_statML_bot/116045671088130364
- GOT-Edit: Geometry-Aware Generic Object Tracking via Online Model Editing
Shih-Fang Chen, Jun-Cheng Chen, I-Hong Jhuo, Yen-Yu Lin
https://arxiv.org/abs/2602.08550 https://mastoxiv.page/@arXiv_csCV_bot/116046486984991360
- UI-Venus-1.5 Technical Report
Venus Team, et al.
https://arxiv.org/abs/2602.09082 https://mastoxiv.page/@arXiv_csCV_bot/116050980295461008
- The Wisdom of Many Queries: Complexity-Diversity Principle for Dense Retriever Training
Xincan Feng, Noriki Nishida, Yusuke Sakai, Yuji Matsumoto
https://arxiv.org/abs/2602.09448 https://mastoxiv.page/@arXiv_csIR_bot/116051022881293649
- Intent Laundering: AI Safety Datasets Are Not What They Seem
Shahriar Golchin, Marc Wetter
https://arxiv.org/abs/2602.16729 https://mastoxiv.page/@arXiv_csCR_bot/116101884238965526
- The Metaphysics We Train: A Heideggerian Reading of Machine Learning
Heman Shakeri
https://arxiv.org/abs/2602.19028 https://mastoxiv.page/@arXiv_csCY_bot/116125225694943789
- Skill-Inject: Measuring Agent Vulnerability to Skill File Attacks
David Schmotz, Luca Beurer-Kellner, Sahar Abdelnabi, Maksym Andriushchenko
https://arxiv.org/abs/2602.20156 https://mastoxiv.page/@arXiv_csCR_bot/116125330557447048
- A Very Big Video Reasoning Suite
Maijunxian Wang, et al.
https://arxiv.org/abs/2602.20159 https://mastoxiv.page/@arXiv_csCV_bot/116125664801070747
toXiv_bot_toot

Milky-Way-like stars in a galaxy core 8 billion years ago revealed by gravitational lensing
Quirino D'Amato, Filippo Mannucci, Alessandro Sonnenfeld, Martina Scialpi, James W. Nightingale, Cristiana Spingola, Stefano Zibetti, Alessandro Marconi, Piero Rosati, Cosimo Marconcini, Guido Agapito, Anna Gallazzi, Enrico Di Teodoro, Gloria Andreuzzi, Francesco Belfiore, Elena Bertola, Caterina Bracci, Stefano Carniani, Elisa Cataldi, Avinanda Chakraborty, Matteo Ceci, Claudia Cicone, Anna…

Learning-augmented smooth integer programs with PAC-learnable oracles
Hao-Yuan He, Ming Li
https://arxiv.org/abs/2602.02505 https://arxiv.org/pdf/2602.02505 https://arxiv.org/html/2602.02505
arXiv:2602.02505v1 Announce Type: new
Abstract: This paper investigates learning-augmented algorithms for smooth integer programs, covering canonical problems such as MAX-CUT and MAX-k-SAT. We introduce a framework that incorporates a predictive oracle to construct a linear surrogate of the objective, which is then solved via linear programming followed by a rounding procedure. Crucially, our framework ensures that the solution quality is both consistent and smooth against prediction errors. We demonstrate that this approach effectively extends tractable approximations from the classical dense regime to the near-dense regime. Furthermore, we go beyond the assumption of oracle existence by establishing its PAC-learnability. We prove that the induced algorithm class possesses a bounded pseudo-dimension, thereby ensuring that an oracle with near-optimal expected performance can be learned with polynomial samples.
toXiv_bot_toot

Quantum Scattering of Fullerene 12C60 with Rare Gas Atoms and its selection rules for rotational quenching
Alexander Petrov, Anna Linnik, Jacek Klos, Eite Tiesinga, Svetlana Kotochigova
https://arxiv.org/abs/2603.02292

Crosslisted article(s) found for math.CV. https://arxiv.org/list/math.CV/new
[1/1]:
- Genus $2$ pencils on surfaces with $p_g=K^2=1$, envelopes, and conics tangent to plane cubic curves
Fabrizio Catanese (Universit\"at Bayreuth), Noah Ruhland (Universit\"at Bayreuth)

You ain't seen nothing, and yet: Future biochemical concentrations can be predicted with surprisingly high accuracy
Ketevan Danelia, Sean A. Ridout, Ilya Nemenman
https://arxiv.org/abs/2602.00261

Development and extension of a monochromatic neutron beamline for neutron polarimetry device characterization at the Spallation Neutron Source
Kavish Imam, Vince Cianciolo, Brad Filippone, Nadia Fomin, Geoffrey Greene, Chenyang Jiang, Jordan O'Kronley, Seppo Penttila, Josh Pierce, John Ramsey, Isaiah Wallace
https://arxiv.org/abs/2602.00167 https://arxiv.org/pdf/2602.00167 https://arxiv.org/html/2602.00167
arXiv:2602.00167v1 Announce Type: new
Abstract: The precise manipulation and analysis of neutron spin states are foundational for a wide range of physics experiments, from fundamental symmetry tests to materials science. To enable systematic characterization of neutron polarimetry devices, we have constructed and extended a monochromatic neutron beamline at the Spallation Neutron Source, Oak Ridge National Laboratory. The beamline delivers monochromatic neutrons and provides a flexible platform for deploying and evaluating advanced neutron spin manipulation instruments. We describe the design and commissioning of the extended beamline and present a proof-of-concept neutron polarimetry study using three devices: a supermirror neutron polarizer, a Mezei spin flipper, and an in situ neutron 3He spin analyzer system. Performance metrics, optimization strategies, and systematic effects are discussed, demonstrating the beamline utility for neutron instrumentation testing. These results establish the extended monochromatic beamline as a useful resource for the development and validation of neutron polarimetry technologies.
toXiv_bot_toot

[2026-02-04 Wed (UTC), 4 new articles found for cs.DS Data Structures and Algorithms]
toXiv_bot_toot

Long-lived metastable states in the 4f$^{13}$5d6s configuration of Yb$^ $
Z. E. D. Ackerman, A. Cadarso Quevedo, Ilango Maran, L. P. H. Gallagher, R. J. C. Spreeuw, J. C. Berengut, R. Gerritsma
https://arxiv.org/abs/2603.04250

Orthogonal polynomials in de Branges--Rovnyak spaces
Eugenio Dellepiane, Daniel Seco
https://arxiv.org/abs/2603.03093 https://arxiv.org/pdf/2603.03093

Diverse lifestyles of bar-like galaxies and their coevolution with the brightest galaxy in the most massive cluster of TNG50
Ewa L. Lokas
https://arxiv.org/abs/2604.01758 https:…

Angular distribution of K{\alpha} x rays following nonradiative double electron capture in relativistic collisions of Xe54 ions with Kr and Xe atoms
Bian Yang, Deyang Yu, Konstantin N. Lyashchenko, Caojie Shao, Zhongwen Wu, Mingwu Zhang, Oleg Yu. Andreev, Junliang Liu, Zhangyong Song, Yingli Xue, Wei Wang, Fangfang Ruan, Yehong Wu, Rongchun Lu, Chenzhong Dong, Xiaohong Cai

[2026-03-04 Wed (UTC), 1 new article found for math.CV Complex Variables]
toXiv_bot_toot

Intelligent Control of Transportation Flow in Physarum Networks
Bingyang Han, Luolan Chen, Tieyan Si
https://arxiv.org/abs/2602.00200 https://arxiv.org/pdf…

[2026-02-03 Tue (UTC), 7 new articles found for physics.ins-det Instrumentation and Detectors]
toXiv_bot_toot

The Galactic Halo Rotation by Weyl Incorporated Gravity
Asghar Qadir, Ashmal Shahid, Noraiz Tahir
https://arxiv.org/abs/2604.01643 https://arxiv.org/pdf/26…

Effects of PLGA coating on biological and mechanical behaviors of tissue engineering scaffolds
A. M. Maadani, F. Davoodian, E. Salahinejad
https://arxiv.org/abs/2602.00146 https…

Fast $k$-means Seeding Under The Manifold Hypothesis
Poojan Shah, Shashwat Agrawal, Ragesh Jaiswal
https://arxiv.org/abs/2602.01104 https://arxiv.org/pdf/2602.01104 https://arxiv.org/html/2602.01104
arXiv:2602.01104v1 Announce Type: new
Abstract: We study beyond worst case analysis for the $k$-means problem where the goal is to model typical instances of $k$-means arising in practice. Existing theoretical approaches provide guarantees under certain assumptions on the optimal solutions to $k$-means, making them difficult to validate in practice. We propose the manifold hypothesis, where data obtained in ambient dimension $D$ concentrates around a low dimensional manifold of intrinsic dimension $d$, as a reasonable assumption to model real world clustering instances. We identify key geometric properties of datasets which have theoretically predictable scaling laws depending on the quantization exponent $\varepsilon = 2/d$ using techniques from optimum quantization theory. We show how to exploit these regularities to design a fast seeding method called $\operatorname{Qkmeans}$ which provides $O(\rho^{-2} \log k)$ approximate solutions to the $k$-means problem in time $O(nD) \widetilde{O}(\varepsilon^{1 \rho}\rho^{-1}k^{1 \gamma})$; where the exponent $\gamma = \varepsilon \rho$ for an input parameter $\rho < 1$. This allows us to obtain new runtime - quality tradeoffs. We perform a large scale empirical study across various domains to validate our theoretical predictions and algorithm performance to bridge theory and practice for beyond worst case data clustering.
toXiv_bot_toot

The velocity field of our Milky Way outer stellar halo based on DESI DR2
Songting Li, Wenting Wang, Sergey E. Koposov, Jo\~ao A. S. Amarante, Alis J. Deason, Monica Valluri, Ting S. Li, Amanda Bystr\"om, Mika Lambert, Tian Qiu, Joan Najita, Gustavo E. Medina, Oleg Y. Gnedin, Leandro Beraldo e Silva, Richard A. N. Brooks, Raymond G. Carlberg, Namitha Kizhuprakkat, Jiaxin Han, Jessica Nicole Aguilar, Steven Ahlen, Davide Bianchi, David Brooks, Todd Claybaugh, Andrei Cuceu, Axel de l…

Crosslisted article(s) found for physics.ins-det. https://arxiv.org/list/physics.ins-det/new
[1/1]:
- Observational Evidence for Wind-Driven Low-Pass Filtering of Infrasound at Short Range
Silber, Bowman, Egan, Burkett, Fleigle, Kim, Newton, Schaible, Sonnenfeld, Wynn, Sni…

[2026-02-03 Tue (UTC), 6 new articles found for physics.bio-ph Biological Physics]
toXiv_bot_toot

Galaxy formation in the first billion years
Rachel S. Somerville
https://arxiv.org/abs/2604.01445 https://arxiv.org/pdf/2604.01445

A domain in $\mathbb C^4$ and its connection with $\mu$-synthesis problem
Sourav Pal, Nitin Tomar
https://arxiv.org/abs/2603.01483 https://arxiv.org/pdf/26…

Calibrating Photometric Mid-Infrared Star Formation Rates for JWST
Stacey Alberts, George H. Rieke, Irene Shivaei, Zhiyuan Ji, Pascal Oesch, Gabriel Brammer, Jakob M. Helton, Jianwei Lyu, Erica J. Nelson, Naveen Reddy, Pierluigi Rinaldi, Yang Sun, Katherine E. Whitaker, Christina C. Williams, Christopher N. A. Willmer, Stijn Wuyts
https://…

On boundary non-preserving mappings with integral constraints
Victoria Desyatka, Oleksandr Dovhopiatyi, Evgeny Sevost'yanov
https://arxiv.org/abs/2603.00969 https://

Analytic and quasiregular distortion of Nagata dimension
Manisha Garg, Jeremy T. Tyson
https://arxiv.org/abs/2603.00323 https://arxiv.org/pdf/2603.00323

Low-mass Active Galaxies in the SAMI Galaxy Survey with Spatially-resolved Spectroscopy
Stellan Bechtold, Amy Reines
https://arxiv.org/abs/2604.01297 https://

A polynomial-time algorithm for recognizing high-bandwidth graphs
Luis M. B. Varona
https://arxiv.org/abs/2602.01755 https://arxiv.org/pdf/2602.01755 https://arxiv.org/html/2602.01755
arXiv:2602.01755v1 Announce Type: new
Abstract: An unweighted, undirected graph $G$ on $n$ nodes is said to have \emph{bandwidth} at most $k$ if its nodes can be labelled from $0$ to $n - 1$ such that no two adjacent nodes have labels that differ by more than $k$. It is known that one can decide whether the bandwidth of $G$ is at most $k$ in $O(n^k)$ time and $O(n^k)$ space using dynamic programming techniques. For small $k$ close to $0$, this approach is effectively polynomial, but as $k$ scales with $n$, it becomes superexponential, requiring up to $O(n^{n - 1})$ time (where $n - 1$ is the maximum possible bandwidth). In this paper, we reformulate the problem in terms of bipartite matching for sufficiently large $k \ge \lfloor (n - 1)/2 \rfloor$, allowing us to use Hall's marriage theorem to develop an algorithm that runs in $O(n^{n - k 1})$ time and $O(n)$ auxiliary space (beyond storage of the input graph). This yields polynomial complexity for large $k$ close to $n - 1$, demonstrating that the bandwidth recognition problem is solvable in polynomial time whenever either $k$ or $n - k$ remains small.
toXiv_bot_toot

[2026-02-03 Tue (UTC), 7 new articles found for physics.atom-ph Atomic Physics]
toXiv_bot_toot

[2026-03-03 Tue (UTC), 3 new articles found for math.CV Complex Variables]
toXiv_bot_toot

Tree-ring structure of Galactic bar resonance in N-body simulations
Rimpei Chiba, Michiko Fujii, Junichi Baba, John Dubinski, Ralph Sch\"onrich
https://arxiv.org/abs/2604.01294

A $5$-Approximation Analysis for the Cover Small Cuts Problem
Miles Simmons, Ishan Bansal, Joe Cheriyan
https://arxiv.org/abs/2602.01462 https://arxiv.org/pdf/2602.01462 https://arxiv.org/html/2602.01462
arXiv:2602.01462v1 Announce Type: new
Abstract: In the Cover Small Cuts problem, we are given a capacitated (undirected) graph $G=(V,E,u)$ and a threshold value $\lambda$, as well as a set of links $L$ with end-nodes in $V$ and a non-negative cost for each link $\ell\in L$; the goal is to find a minimum-cost set of links such that each non-trivial cut of capacity less than $\lambda$ is covered by a link. Bansal, Cheriyan, Grout, and Ibrahimpur (arXiv:2209.11209, Algorithmica 2024) showed that the WGMV primal-dual algorithm, due to Williamson, Goemans, Mihail, and Vazirani (Combinatorica, 1995), achieves approximation ratio $16$ for the Cover Small Cuts problem; their analysis uses the notion of a pliable family of sets that satisfies a combinatorial property. Later, Bansal (arXiv:2308.15714v2, IPCO 2025) and then Nutov (arXiv:2504.03910, MFCS 2025) proved that the same algorithm achieves approximation ratio $6$. We show that the same algorithm achieves approximation ratio $5$, by using a stronger notion, namely, a pliable family of sets that satisfies symmetry and structural submodularity.
toXiv_bot_toot

Atomic Data for Non-Equilibrium Modeling of Kilonovae: The Ionization Properties of Te I - III
S. Bromley, E. Garbe, N. McElroy, C. Ballance, M. Fogle, P. Stancil, S. Loch
https://arxiv.org/abs/2603.00346

Replaced article(s) found for math.CV. https://arxiv.org/list/math.CV/new
[1/1]:
- Stein spaces and Stein algebras
Olivier Benoist
https://

Constraints on the Galactic Chemical Evolution of $^3\rm{He}$
Miqaela K. Weller, David H. Weinberg
https://arxiv.org/abs/2604.01289 https://arxiv.org/pdf/2…

Benchmarking of algorithms for set partitions
Arnav Khinvasara, Alexander Pikovski
https://arxiv.org/abs/2602.01350 https://arxiv.org/pdf/2602.01350 https://arxiv.org/html/2602.01350
arXiv:2602.01350v1 Announce Type: new
Abstract: Set partitions are arrangements of distinct objects into groups. The problem of listing all set partitions arises in a variety of settings, in particular in combinatorial optimization tasks. After a brief review, we give practical approximate formulas for determining the number of set partitions, both for small and large set sizes. Several algorithms for enumerating all set partitions are reviewed, and benchmarking tests were conducted. The algorithm of Djokic et al. is recommended for practical use.
toXiv_bot_toot

Crosslisted article(s) found for math.CV. https://arxiv.org/list/math.CV/new
[1/1]:
- Perturbation of monic matrix polynomials
Cong Trinh Le, Gue Myung Lee, Yongdo Lim, Tien Son Pham

Simultaneous Detection, Demodulation, and Angle-of-Arrival Determination of Communication Signals Using a Dual Ladder Rydberg Receiver
Stone B. Oliver, Samuel Berweger, Eugeniy E. Mikhailov, Dixith Manchaiah, Nikunjkumar Prajapati, Christopher L. Holloway, Matthew T. Simons
https://arxiv.org/abs/2603.00297

Spatially Resolved AGN Ionization and Star Formation at Cosmic Noon with JWST/JEMS
Sophie Lebowitz, Kevin N. Hainline, Stephanie Juneau, Christina C. William, Swayamtrupta Panda, Jianwei Lyu, Michael V. Maseda, Sandro Tacchella, Yongda Zhu, Jessica L. Aguayo
https://arxiv.org/abs/2604.01271

Fanciful Figurines flip Free Flood-It -- Polynomial-Time Miniature Painting on Co-gem-free Graphs
Christian Rosenke, Mark Scheibner
https://arxiv.org/abs/2602.00690 https://arxiv.org/pdf/2602.00690 https://arxiv.org/html/2602.00690
arXiv:2602.00690v1 Announce Type: new
Abstract: Inspired by the eponymous hobby, we introduce Miniature Painting as the computational problem to paint a given graph $G=(V,E)$ according to a prescribed template $t \colon V \rightarrow C$, which assigns colors $C$ to the vertices of $G$. In this setting, the goal is to realize the template using a shortest possible sequence of brush strokes, where each stroke overwrites a connected vertex subset with a color in $C$. We show that this problem is equivalent to a reversal of the well-studied Free Flood-It game, in which a colored graph is decolored into a single color using as few moves as possible. This equivalence allows known complexity results for Free Flood-It to be transferred directly to Miniature Painting, including NP-hardness under severe structural restrictions, such as when $G$ is a grid, a tree, or a split graph. Our main contribution is a polynomial-time algorithm for Miniature Painting on graphs that are free of induced co-gems, a graph class that strictly generalizes cographs. As a direct consequence, Free Flood-It is also polynomial-time solvable on co-gem-free graphs, independent of the initial coloring.
toXiv_bot_toot

Hyperfine spectroscopy and laser cooling of the fermionic isotopes $^{47}$Ti and $^{49}$Ti
Jackson Schrott, Scott Eustice, Pouya Sadeghpour, Rowan Duim, Hiromitsu Sawaoka, Dmytro Filin, Marianna S. Safronova, Dan M. Stamper-Kurn
https://arxiv.org/abs/2603.00282

Hardness and Tractability of T_{h 1}-Free Edge Deletion
Ajinkya Gaikwad, Soumen Maity, Leeja R
https://arxiv.org/abs/2602.00644 https://arxiv.org/pdf/2602.00644 https://arxiv.org/html/2602.00644
arXiv:2602.00644v1 Announce Type: new
Abstract: We study the parameterized complexity of the T(h 1)-Free Edge Deletion problem. Given a graph G and integers k and h, the task is to delete at most k edges so that every connected component of the resulting graph has size at most h. The problem is NP-complete for every fixed h at least 3, while it is solvable in polynomial time for h at most 2.
Recent work showed strong hardness barriers: the problem is W[1]-hard when parameterized by the solution size together with the size of a feedback edge set, ruling out fixed-parameter tractability for many classical structural parameters. We significantly strengthen these negative results by proving W[1]-hardness when parameterized by the vertex deletion distance to a disjoint union of paths, the vertex deletion distance to a disjoint union of stars, or the twin cover number. These results unify and extend known hardness results for treewidth, pathwidth, and feedback vertex set, and show that several restrictive parameters, including treedepth, cluster vertex deletion number, and modular width, do not yield fixed-parameter tractability when h is unbounded.
On the positive side, we identify parameterizations that restore tractability. We show that the problem is fixed-parameter tractable when parameterized by cluster vertex deletion together with h, and also when parameterized by neighborhood diversity together with h via an integer linear programming formulation. We further present a fixed-parameter tractable bicriteria approximation algorithm parameterized by k. Finally, we show that the problem admits fixed-parameter tractable algorithms on split graphs and interval graphs, and we establish hardness for a directed generalization even on directed acyclic graphs.
toXiv_bot_toot

Ultrafast Ionization Dynamics Encoded in a Photoelectron Spin Torus
Xiaodan Mao, Feng He, Pei-Lun He
https://arxiv.org/abs/2604.02062 https://arxiv.org/pdf…

End Cover for Initial Value Problem: Complete Validated Algorithms with Complexity Analysis
Bingwei Zhang, Chee Yap
https://arxiv.org/abs/2602.00162 https://arxiv.org/pdf/2602.00162 https://arxiv.org/html/2602.00162
arXiv:2602.00162v1 Announce Type: new
Abstract: We consider the first-order autonomous ordinary differential equation \[ \mathbf{x}' = \mathbf{f}(\mathbf{x}), \] where $\mathbf{f} : \mathbb{R}^n \to \mathbb{R}^n$ is locally Lipschitz. For a box $B_0 \subseteq \mathbb{R}^n$ and $h > 0$, we denote by $\mathrm{IVP}_{\mathbf{f}}(B_0,h)$ the set of solutions $\mathbf{x} : [0,h] \to \mathbb{R}^n$ satisfying \[ \mathbf{x}'(t) = \mathbf{f}(\mathbf{x}(t)), \qquad \mathbf{x}(0) \in B_0 . \]
We present a complete validated algorithm for the following \emph{End Cover Problem}: given $(\mathbf{f}, B_0, \varepsilon, h)$, compute a finite set $\mathcal{C}$ of boxes such that \[ \mathrm{End}_{\mathbf{f}}(B_0,h) \;\subseteq\; \bigcup_{B \in \mathcal{C}} B \;\subseteq\; \mathrm{End}_{\mathbf{f}}(B_0,h) \oplus [-\varepsilon,\varepsilon]^n , \] where \[ \mathrm{End}_{\mathbf{f}}(B_0,h) = \left\{ \mathbf{x}(h) : \mathbf{x} \in \mathrm{IVP}_{\mathbf{f}}(B_0,h) \right\}. \]
Moreover, we provide a complexity analysis of our algorithm and introduce a novel technique for computing the end cover $\mathcal{C}$ based on covering the boundary of $\mathrm{End}_{\mathbf{f}}(B_0,h)$. Finally, we present experimental results demonstrating the practicality of our approach.
toXiv_bot_toot

Low frequency electric field sensing with a Rydberg beam
Jeremy Glick, John R Dickson, Josie Wood, Paul Kunz
https://arxiv.org/abs/2604.01513 https://arxiv…

A vapor-cell clock with fractional frequency reaching $10^{-16}$ level stability
Siqi Wu, Zhenqi Zhang, Xingyue Liu, Chuanshuai Zhu, Zhiyuan Wang, Zhiyu Ma, Hongli Liu, Wenhao Yuan, Xiaochi Liu, Pengfei Wang, Feng Zhao, Jan Hrabina, Jie Zhang, Zehuang Lu, Ke Deng
https://arxiv.org/abs/2603.00424

Endpoint Estimates for Bergman Commutators and New Characterizations of the Bloch Space and $H^\infty$
Adam B. Christopherson, Zhenghui Huo, Nathan A. Wagner, Yunus E. Zeytuncu
https://arxiv.org/abs/2602.24186