Tootfinder

Filing: Larry Page moved assets out of California ahead of the proposed CA wealth tax, meeting an end-of-2025 deadline; a source said he has left the state (Hugh Langley/Business Insider)
https://www.businessinsider.com/larry-page-leave-c…

Larry Page is officially moving business out of California ahead of a proposed billionaire's tax
The Google cofounder has severed ties between California and several of his business entities, including his family office.

RE: https://c.im/@cdarwin/113938087833247859
Financial Times front page featuring an article about
💥 backlash against Trump from businesses due to trade war concerns.
The main image shows Trump in the Oval Office.
Additional sections discuss tarif…

🔊 #NowPlaying on #BBCRadio3:
#MusicMatters
- Turning the Page
Violinist Tasmin Little speaks to artists about leaving the world of performance behind. This week's focus is on the taboo of injury and the pressure of expectation for soloists.
Relisten now 👇
https://www.bbc.co.uk/programmes/m002s4t0

📰 Gut informiert zu sein, ist unser #Schutzschild gegen Polemik der #Politiker, #Lobbyisten oder Manipulation durch rechte Medien.
Ich tröte aktuelle Informationen zu

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

Film „Junge Mütter“
Vollkommen wahr erfunden
https://zeitung.faz.net/data/697/reader/reader.html?social=#!preferred/0/package/697/pub/973/page/14/content/126976

edit_wiktionary: Wiktionary edits (2010)
Three bipartite user-page networks extracted from Wiktionary, for French, German, and English. 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 5237 nodes and 20835 edges.
Tags: Informational, Web graph, Multigraph, Timestamps

＂Clean up the pkgbase wiki page and remove outdated information.＂
💚 <https://github.com/FreeBSDFoundation/status-updates/blob/main/Isaac_Freund/2026-02.md> 💚
– via <

Es geht wieder los und weiter! Same procedure as every year: meine Aktion #blühklex wird im nunmehr 8. Jahr auch 2026 fortgesetzt! Da die Aussaat ab März möglich ist, liegt meinen innerdeutschen Paketen ab sofort wieder je 1 Tütchen bei. Mehr dazu auf https://www.wandklex.art/page/Klextras-10148.

The new US cyber security strategy just dropped. I'm a Claude user, and I suspiciously inquired of Claude as to the number of em-dashes in this four page document. Then I asked Claude to analyze the probability of this document being LLM-written.
Claude then throws some naughty shade.
ht…

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

Czechia's top diplomat to visit Ukraine as countries 'turn the page' on parliament chairman's controversial remarks: https://benborges.xyz/2026/01/06/czechias-top-diplomat-to-visit.html

"Does Trump only want oil from Venezuela, or is he also concerned about democracy there?", asks @….
Oh come on, Trouw, that's rather the extreme end of naivety. Trump championing democracy 🤦‍♀️🤦🤦‍♂️. He'd be laughing all the way to the bank if he heard that.

A look at the state of AI agents, the evolution of thinking models, the staggering need for inference compute in the coming years, automated research, and more (Eric Jang/Evjang.com)
https://evjang.com/2026/02/04/rocks.html

Wikipedia folk, are FullFact articles considered good references? There are some debunked statements I want to link to from an existing page that lists some anti-vax claims

The Art Newspaper runs down the must-see exhibitions of 2026, including our own "Edmonia Lewis: Said in Stone," organized with the Peabody Essex Museum. It opens at PEM on Valentine's Day, here on August 8 and at the North Carolina Museum of Art next year.
https://lnkd.in/e3uJiw9R

From Open Media
Sign Canada’s Digital Sovereignty Charter
Canadian democracy is under threat. Algorithms and deceptive content are shaping what we see, think, and share, while foreign tech giants collect our data without limits.
Our current laws and digital systems aren’t strong enough to protect us. This leaves Canadian voices, our choices, and our digital identities at risk. Parliament must step up and champion Canada’s Digital Sovereignty Charter now

Endorse Canada’s Digital Sovereignty Charter!
🇨🇦 Canada needs real digital sovereignty NOW to secure the future we deserve. ✍️ Endorse the Digital Sovereignty Charter’s five principles today!

The Front-Runner ... G, avin newsom has a 30-page file of reasons the Democrats lost the 2024 presidential election. (Helen Lewis/The Atlantic)
https://www.theatlantic.com/politics/2026/01/gavin-newsom-feature/685410/?gift=6kW-3kpyH7tV4NcHqyTUk3BPAaTCFSpGNyaGHEgyKs8
http://www.memeorandum.com/260106/p97#a260106p97

I was just finishing the set of password file parsing functions for picolibc and discovered glibc's getpwent_r.
The man page claims this function is re-entrant, and yet then states that it uses the same stream as getpwent and setpwent. Which sure sounds like global state to me.
Am I missing something, or is this function actually useful? Unless there's a good reason, I think I'm going to leave this one out; it looks like a user trap.

"Like many, I never really lost the inner nine-year-old who rejoices at the sight of armed soldiers marching in lockstep"...maaaate, don't admit that on page 25!
Yes, you had the grace to admit you've never experienced war, but how the f*** do you expect readers to react?
Is this what comes of being published by a military history/games publisher (Osprey)? Insufficiently critical editing?
Is this a common sentiment? It's 100% not mine
I'm reading Putin's Wars: From Chechnya to Ukraine by Mark Galeotti
I realise it was published in 2022 as Russia was invading Ukraine, but that sentence is even more distasteful now, in 2026

„That’s three or four clicks just to see the error, and every one of them loads a new page with its own loading spinner, and none of them are fast. You are navigating a bureaucracy. You are filling out forms at the DMV of CI.“
What an apt comparison. The whole piece is *chef’s kiss*!
https://www.

[2026-03-06 Fri (UTC), 17 new articles found for gr-qc General Relativity and Quantum Cosmology]
toXiv_bot_toot

I need a few incoming webmentions for testing (okay, this sounds like a really fishy attempt to generate likes … I promise that it is not 😂). So would you all please like and repost this piece I recently wrote? You can also read it, of course.
https://matthiasott.com/articles/webspace-inv…

Webspace Invaders · Matthias Ott
There’s something happening on the Web at the moment that almost feels like watching that old arcade game Space Invaders play out across our servers. Bots and scrapers marching in formation, attacking our servers wave after wave, systematically requesting page after page, relentlessly filling their data stores while we watch our access logs fill up.

Central Limit Theorem for Intersection Currents of Gaussian Holomorphic Sections
Bin Guo
https://arxiv.org/abs/2603.04588 https://arxiv.org/pdf/2603.04588

Sources: Larry Page bought two Miami estates in December and January for a combined $173.4M; Sergey Brin is also said to be in discussions to buy a Miami home (Wall Street Journal)
https://www.wsj.com/real-estate/luxury-hom

📰 Mit Deiner #Spende förderst Du die kostenlose #Kommunikation wichtiger #Zukunftsthemen: Täglich teile ich

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

Electron Beam Profiling via Rydberg Electromagnetically Induced Transparency in Rubidium Vapor with Crossed Laser beams
Rob Behary (Department of Physics, William \& Mary, Williamsburg, VA, USA), Kevin Su (Department of Physics, William \& Mary, Williamsburg, VA, USA), Nicolas DeStefano (Department of Physics, William \& Mary, Williamsburg, VA, USA), Jennifer Tsai (Department of Physics, William \& Mary, Williamsburg, VA, USA), Todd Averett (Department of Physics, Willi…

Replaced article(s) found for cs.LG. https://arxiv.org/list/cs.LG/new
[2/6]:
- Performance Asymmetry in Model-Based Reinforcement Learning
Jing Yu Lim, Rushi Shah, Zarif Ikram, Samson Yu, Haozhe Ma, Tze-Yun Leong, Dianbo Liu
https://arxiv.org/abs/2505.19698 https://mastoxiv.page/@arXiv_csLG_bot/114578810521008766
- Towards Robust Real-World Multivariate Time Series Forecasting: A Unified Framework for Dependenc...
Jinkwan Jang, Hyungjin Park, Jinmyeong Choi, Taesup Kim
https://arxiv.org/abs/2506.08660 https://mastoxiv.page/@arXiv_csLG_bot/114664238967892509
- Wasserstein Barycenter Soft Actor-Critic
Zahra Shahrooei, Ali Baheri
https://arxiv.org/abs/2506.10167 https://mastoxiv.page/@arXiv_csLG_bot/114675175949432731
- Foundation Models for Causal Inference via Prior-Data Fitted Networks
Yuchen Ma, Dennis Frauen, Emil Javurek, Stefan Feuerriegel
https://arxiv.org/abs/2506.10914 https://mastoxiv.page/@arXiv_csLG_bot/114675529854402158
- FREQuency ATTribution: benchmarking frequency-based occlusion for time series data
Dominique Mercier, Andreas Dengel, Sheraz Ahmed
https://arxiv.org/abs/2506.18481 https://mastoxiv.page/@arXiv_csLG_bot/114738421450807709
- Complexity-aware fine-tuning
Andrey Goncharov, Daniil Vyazhev, Petr Sychev, Edvard Khalafyan, Alexey Zaytsev
https://arxiv.org/abs/2506.21220 https://mastoxiv.page/@arXiv_csLG_bot/114754764750730849
- Transfer Learning in Infinite Width Feature Learning Networks
Clarissa Lauditi, Blake Bordelon, Cengiz Pehlevan
https://arxiv.org/abs/2507.04448 https://mastoxiv.page/@arXiv_csLG_bot/114818005803079705
- A hierarchy tree data structure for behavior-based user segment representation
Liu, Kang, Iyer, Malik, Li, Wang, Lu, Zhao, Wang, Liu, Liu, Liang, Yu
https://arxiv.org/abs/2508.01115 https://mastoxiv.page/@arXiv_csLG_bot/114975999992144374
- One-Step Flow Q-Learning: Addressing the Diffusion Policy Bottleneck in Offline Reinforcement Lea...
Thanh Nguyen, Chang D. Yoo
https://arxiv.org/abs/2508.13904 https://mastoxiv.page/@arXiv_csLG_bot/115060568241390847
- Uncertainty Propagation Networks for Neural Ordinary Differential Equations
Hadi Jahanshahi, Zheng H. Zhu
https://arxiv.org/abs/2508.16815 https://mastoxiv.page/@arXiv_csLG_bot/115094785677272005
- Learning Unified Representations from Heterogeneous Data for Robust Heart Rate Modeling
Zhengdong Huang, Zicheng Xie, Wentao Tian, Jingyu Liu, Lunhong Dong, Peng Yang
https://arxiv.org/abs/2508.21785 https://mastoxiv.page/@arXiv_csLG_bot/115128450608548173
- Monte Carlo Tree Diffusion with Multiple Experts for Protein Design
Liu, Cao, Jiang, Luo, Duan, Wang, Sosnick, Xu, Stevens
https://arxiv.org/abs/2509.15796 https://mastoxiv.page/@arXiv_csLG_bot/115247429156900905
- From Samples to Scenarios: A New Paradigm for Probabilistic Forecasting
Xilin Dai, Zhijian Xu, Wanxu Cai, Qiang Xu
https://arxiv.org/abs/2509.19975 https://mastoxiv.page/@arXiv_csLG_bot/115264498084813952
- Why High-rank Neural Networks Generalize?: An Algebraic Framework with RKHSs
Yuka Hashimoto, Sho Sonoda, Isao Ishikawa, Masahiro Ikeda
https://arxiv.org/abs/2509.21895 https://mastoxiv.page/@arXiv_csLG_bot/115287261047939306
- From Parameters to Behaviors: Unsupervised Compression of the Policy Space
Davide Tenedini, Riccardo Zamboni, Mirco Mutti, Marcello Restelli
https://arxiv.org/abs/2509.22566 https://mastoxiv.page/@arXiv_csLG_bot/115287379672141023
- RHYTHM: Reasoning with Hierarchical Temporal Tokenization for Human Mobility
Haoyu He, Haozheng Luo, Yan Chen, Qi R. Wang
https://arxiv.org/abs/2509.23115 https://mastoxiv.page/@arXiv_csLG_bot/115293273559547106
- Polychromic Objectives for Reinforcement Learning
Jubayer Ibn Hamid, Ifdita Hasan Orney, Ellen Xu, Chelsea Finn, Dorsa Sadigh
https://arxiv.org/abs/2509.25424 https://mastoxiv.page/@arXiv_csLG_bot/115298579764580635
- Recursive Self-Aggregation Unlocks Deep Thinking in Large Language Models
Siddarth Venkatraman, et al.
https://arxiv.org/abs/2509.26626 https://mastoxiv.page/@arXiv_csLG_bot/115298789487177431
- Cautious Weight Decay
Chen, Li, Liang, Su, Xie, Pierse, Liang, Lao, Liu
https://arxiv.org/abs/2510.12402 https://mastoxiv.page/@arXiv_csLG_bot/115377759317818093
- TeamFormer: Shallow Parallel Transformers with Progressive Approximation
Wei Wang, Xiao-Yong Wei, Qing Li
https://arxiv.org/abs/2510.15425 https://mastoxiv.page/@arXiv_csLG_bot/115405933861293858
- Latent-Augmented Discrete Diffusion Models
Dario Shariatian, Alain Durmus, Umut Simsekli, Stefano Peluchetti
https://arxiv.org/abs/2510.18114 https://mastoxiv.page/@arXiv_csLG_bot/115417332500265972
- Predicting Metabolic Dysfunction-Associated Steatotic Liver Disease using Machine Learning Method...
Mary E. An, Paul Griffin, Jonathan G. Stine, Ramakrishna Balakrishnan, Soundar Kumara
https://arxiv.org/abs/2510.22293 https://mastoxiv.page/@arXiv_csLG_bot/115451746201804373
toXiv_bot_toot

Happy to contribute to #Cilium (#documentation).
Good tools deserve good docs. ✨
https://github.com/cilium/cilium/pull/

docs: add policy language chapter headline by orangecms · Pull Request #44204 · cilium/cilium
Up until now, the page title had been 'Layer 3 Examples', which is a section headline and confusing, since it is among other examples. Please ensure your pull request adheres to the followi...

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 348 nodes and 33250 edges.
Tags: Informational, Web gr…

Hey Siri, show me an example of how the West is mired in moral decay.
#Palestine #hungerStrike #lego #starWarsNoises

📰 Gut informiert zu sein, ist unser #Schutzschild gegen Polemik der #Politiker, #Lobbyisten oder Manipulation durch rechte Medien. Ich tröte kostenlos aktuelle Informationen zu

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

[2026-03-06 Fri (UTC), 5 new articles found for math.CV Complex Variables]
toXiv_bot_toot

Crosslisted article(s) found for physics.atom-ph. https://arxiv.org/list/physics.atom-ph/new
[1/1]:
- Photon statistics in chiral waveguide QED: I Mean field and perturbative expansions
M. Eltohfa, F. Robicheaux

The Maxwell-Higgs System with Scalar Potential on Subextremal Kerr Spacetimes: Nonlinear wave operators and asymptotic completeness
Bobby Eka Gunara, Mulyanto, Fiki Taufik Akbar
https://arxiv.org/abs/2603.04202

VoroUDF: Meshing Unsigned Distance Fields with Voronoi Optimization
Ningna Wang, Zilong Wang, Xiana Carrera, Xiaohu Guo, Silvia Sell\'an
https://arxiv.org/abs/2602.02907 https://arxiv.org/pdf/2602.02907 https://arxiv.org/html/2602.02907
arXiv:2602.02907v1 Announce Type: new
Abstract: We present VoroUDF, an algorithm for reconstructing high-quality triangle meshes from Unsigned Distance Fields (UDFs). Our algorithm supports non-manifold geometry, sharp features, and open boundaries, without relying on error-prone inside/outside estimation, restrictive look-up tables nor topologically noisy optimization. Our Voronoi-based formulation combines a L_1 tangent minimization with feature-aware repulsion to robustly recover complex surface topology. It achieves significantly improved topological consistency and geometric fidelity compared to existing methods, while producing lightweight meshes suitable for downstream real-time and interactive applications.
toXiv_bot_toot

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

ProphetKV: User-Query-Driven Selective Recomputation for Efficient KV Cache Reuse in Retrieval-Augmented Generation
Shihao Wang, Jiahao Chen, Yanqi Pan, Hao Huang, Yichen Hao, Xiangyu Zou, Wen Xia, Wentao Zhang, Haitao Wang, Junhong Li, Chongyang Qiu, Pengfei Wang
https://arxiv.org/abs/2602.02579 https://arxiv.org/pdf/2602.02579 https://arxiv.org/html/2602.02579
arXiv:2602.02579v1 Announce Type: new
Abstract: The prefill stage of long-context Retrieval-Augmented Generation (RAG) is severely bottlenecked by computational overhead. To mitigate this, recent methods assemble pre-calculated KV caches of retrieved RAG documents (by a user query) and reprocess selected tokens to recover cross-attention between these pre-calculated KV caches. However, we identify a fundamental "crowding-out effect" in current token selection criteria: globally salient but user-query-irrelevant tokens saturate the limited recomputation budget, displacing the tokens truly essential for answering the user query and degrading inference accuracy.
We propose ProphetKV, a user-query-driven KV Cache reuse method for RAG scenarios. ProphetKV dynamically prioritizes tokens based on their semantic relevance to the user query and employs a dual-stage recomputation pipeline to fuse layer-wise attention metrics into a high-utility set. By ensuring the recomputation budget is dedicated to bridging the informational gap between retrieved context and the user query, ProphetKV achieves high-fidelity attention recovery with minimal overhead. Our extensive evaluation results show that ProphetKV retains 96%-101% of full-prefill accuracy with only a 20% recomputation ratio, while achieving accuracy improvements of 8.8%-24.9% on RULER and 18.6%-50.9% on LongBench over the state-of-the-art approaches (e.g., CacheBlend, EPIC, and KVShare).
toXiv_bot_toot

On Zero-Dimensional Glicci Monomial Ideals
Benjamin Mudrak
https://arxiv.org/abs/2602.03703 https://arxiv.org/pdf/2602.03703 https://arxiv.org/html/2602.03703
arXiv:2602.03703v1 Announce Type: new
Abstract: Consider the polynomial ring $R_n = k[x_1,...,x_n]$, where $k$ is a field. Let $m = (x_1,...,x_n)$ and $I$ be an $m$-primary monomial ideal in $R$. We consider the problem of determining whether such ideals are in the Gorenstein liasion class of a complete intersection (glicci). We prove that all $m$-primary monomial ideals in $k[x,y,z]$ with at most eight generators are homogeneously glicci. We also construct a large class of $m$-primary monomial ideals in $R_n$ for any $n$ with any number of minimal generators that are homogeneously glicci but not in the complete intersection liaison class of a complete intersection (licci). All Gorenstein links used are constructed explicitly and every second step links to another $m$-primary monomial ideal.
toXiv_bot_toot

You can now try @… to ask questions on most recent cs.AI papers.
Examples:
"tell me papers on hallucinations in cs.AI" (you need to specify the category).
https://ma…

Told you yesterday 😁

Replaced article(s) found for cs.LG. https://arxiv.org/list/cs.LG/new
[1/6]:
- Towards Attributions of Input Variables in a Coalition
Xinhao Zheng, Huiqi Deng, Quanshi Zhang
https://arxiv.org/abs/2309.13411
- Knee or ROC
Veronica Wendt, Jacob Steiner, Byunggu Yu, Caleb Kelly, Justin Kim
https://arxiv.org/abs/2401.07390
- Rethinking Disentanglement under Dependent Factors of Variation
Antonio Almud\'evar, Alfonso Ortega
https://arxiv.org/abs/2408.07016 https://mastoxiv.page/@arXiv_csLG_bot/112959235461894530
- Minibatch Optimal Transport and Perplexity Bound Estimation in Discrete Flow Matching
Etrit Haxholli, Yeti Z. Gurbuz, Ogul Can, Eli Waxman
https://arxiv.org/abs/2411.00759 https://mastoxiv.page/@arXiv_csLG_bot/113423933393275133
- Predicting Subway Passenger Flows under Incident Situation with Causality
Xiannan Huang, Shuhan Qiu, Quan Yuan, Chao Yang
https://arxiv.org/abs/2412.06871 https://mastoxiv.page/@arXiv_csLG_bot/113632934357523592
- Characterizing LLM Inference Energy-Performance Tradeoffs across Workloads and GPU Scaling
Paul Joe Maliakel, Shashikant Ilager, Ivona Brandic
https://arxiv.org/abs/2501.08219 https://mastoxiv.page/@arXiv_csLG_bot/113831081884570770
- Universality of Benign Overfitting in Binary Linear Classification
Ichiro Hashimoto, Stanislav Volgushev, Piotr Zwiernik
https://arxiv.org/abs/2501.10538 https://mastoxiv.page/@arXiv_csLG_bot/113872351652969955
- Safe Reinforcement Learning for Real-World Engine Control
Julian Bedei, Lucas Koch, Kevin Badalian, Alexander Winkler, Patrick Schaber, Jakob Andert
https://arxiv.org/abs/2501.16613 https://mastoxiv.page/@arXiv_csLG_bot/113910356206562660
- A Statistical Learning Perspective on Semi-dual Adversarial Neural Optimal Transport Solvers
Roman Tarasov, Petr Mokrov, Milena Gazdieva, Evgeny Burnaev, Alexander Korotin
https://arxiv.org/abs/2502.01310
- Improving the Convergence of Private Shuffled Gradient Methods with Public Data
Shuli Jiang, Pranay Sharma, Zhiwei Steven Wu, Gauri Joshi
https://arxiv.org/abs/2502.03652 https://mastoxiv.page/@arXiv_csLG_bot/113961314098841096
- Using the Path of Least Resistance to Explain Deep Networks
Sina Salek, Joseph Enguehard
https://arxiv.org/abs/2502.12108 https://mastoxiv.page/@arXiv_csLG_bot/114023706252106865
- Distributional Vision-Language Alignment by Cauchy-Schwarz Divergence
Wenzhe Yin, Zehao Xiao, Pan Zhou, Shujian Yu, Jiayi Shen, Jan-Jakob Sonke, Efstratios Gavves
https://arxiv.org/abs/2502.17028 https://mastoxiv.page/@arXiv_csLG_bot/114063477202397951
- Armijo Line-search Can Make (Stochastic) Gradient Descent Provably Faster
Sharan Vaswani, Reza Babanezhad
https://arxiv.org/abs/2503.00229 https://mastoxiv.page/@arXiv_csLG_bot/114103018985567633
- Semantic Parallelism: Redefining Efficient MoE Inference via Model-Data Co-Scheduling
Yan Li, Zhenyu Zhang, Zhengang Wang, Pengfei Chen, Pengfei Zheng
https://arxiv.org/abs/2503.04398 https://mastoxiv.page/@arXiv_csLG_bot/114120014622063602
- A Survey on Federated Fine-tuning of Large Language Models
Wu, Tian, Li, Sun, Tam, Zhou, Liao, Xiong, Guo, Li, Xu
https://arxiv.org/abs/2503.12016 https://mastoxiv.page/@arXiv_csLG_bot/114182234054681647
- Towards Trustworthy GUI Agents: A Survey
Yucheng Shi, Wenhao Yu, Jingyuan Huang, Wenlin Yao, Wenhu Chen, Ninghao Liu
https://arxiv.org/abs/2503.23434 https://mastoxiv.page/@arXiv_csLG_bot/114263024618476521
- CONTINA: Confidence Interval for Traffic Demand Prediction with Coverage Guarantee
Chao Yang, Xiannan Huang, Shuhan Qiu, Yan Cheng
https://arxiv.org/abs/2504.13961 https://mastoxiv.page/@arXiv_csLG_bot/114380404041503229
- Regularity and Stability Properties of Selective SSMs with Discontinuous Gating
Nikola Zubi\'c, Davide Scaramuzza
https://arxiv.org/abs/2505.11602 https://mastoxiv.page/@arXiv_csLG_bot/114538965060456498
- RECON: Robust symmetry discovery via Explicit Canonical Orientation Normalization
Alonso Urbano, David W. Romero, Max Zimmer, Sebastian Pokutta
https://arxiv.org/abs/2505.13289 https://mastoxiv.page/@arXiv_csLG_bot/114539124884913788
- RefLoRA: Refactored Low-Rank Adaptation for Efficient Fine-Tuning of Large Models
Yilang Zhang, Bingcong Li, Georgios B. Giannakis
https://arxiv.org/abs/2505.18877 https://mastoxiv.page/@arXiv_csLG_bot/114578778213033886
- SuperMAN: Interpretable and Expressive Networks over Temporally Sparse Heterogeneous Data
Bechler-Speicher, Zerio, Huri, Vestergaard, Gilad-Bachrach, Jess, Bhatt, Sazonovs
https://arxiv.org/abs/2505.19193 https://mastoxiv.page/@arXiv_csLG_bot/114578790124778172
toXiv_bot_toot

Replaced article(s) found for cond-mat.str-el. https://arxiv.org/list/cond-mat.str-el/new
[1/2]:
- Optical control of spin-splitting in an altermagnet
Sangeeta Rajpurohit, Revsen Karaalp, Yuan Ping, Liang Z. Tan, Tadashi Ogitsu, Peter E. Bl\"ochl

If I had more time and interest, I would dig into this. I'm curious why the description on that page is failing. (It's not my website. I just saw it while scrolling through my timeline.)

Replaced article(s) found for physics.atom-ph. https://arxiv.org/list/physics.atom-ph/new
[1/1]:
- Microwave spectroscopy of ultracold-sodium least-bound molecular states
Manon Ballu, Zhibin Yao, Bastien Mirmand, David Papoular, H\'el\`ene Perrin, Aur\'elien Perrin…

[2026-02-04 Wed (UTC), no new articles found for q-fin.GN General Finance]
toXiv_bot_toot

Braneworld cosmology in $f(\mathbb{Q})$ gravity
J. J. Ramos, J. E. G. Silva
https://arxiv.org/abs/2603.03435 https://arxiv.org/pdf/2603.03435

Replaced article(s) found for physics.atom-ph. https://arxiv.org/list/physics.atom-ph/new
[1/1]:
- Optical excitation and stabilization of ultracold field-linked tetratomic molecules
Bijit Mukherjee, Micha{\l} Tomza

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 394 nodes and 499 edges.
Tags: Informational, Web graph, Multigraph, Timestamps

Replaced article(s) found for cs.LG. https://arxiv.org/list/cs.LG/new
[3/6]:
- Towards Scalable Oversight via Partitioned Human Supervision
Ren Yin, Takashi Ishida, Masashi Sugiyama
https://arxiv.org/abs/2510.22500 https://mastoxiv.page/@arXiv_csLG_bot/115451787490434401
- ContextPilot: Fast Long-Context Inference via Context Reuse
Yinsicheng Jiang, Yeqi Huang, Liang Cheng, Cheng Deng, Xuan Sun, Luo Mai
https://arxiv.org/abs/2511.03475 https://mastoxiv.page/@arXiv_csLG_bot/115502245581974540
- Metabolomic Biomarker Discovery for ADHD Diagnosis Using Interpretable Machine Learning
Nabil Belacel, Mohamed Rachid Boulassel
https://arxiv.org/abs/2601.11283 https://mastoxiv.page/@arXiv_csLG_bot/115921183182326799
- PhysE-Inv: A Physics-Encoded Inverse Modeling approach for Arctic Snow Depth Prediction
Akila Sampath, Vandana Janeja, Jianwu Wang
https://arxiv.org/abs/2601.17074
- SAGE-5GC: Security-Aware Guidelines for Evaluating Anomaly Detection in the 5G Core Network
Cristian Manca, Christian Scano, Giorgio Piras, Fabio Brau, Maura Pintor, Battista Biggio
https://arxiv.org/abs/2602.03596
- LORE: Jointly Learning the Intrinsic Dimensionality and Relative Similarity Structure From Ordina...
Anand, Helbling, Davenport, Berman, Alagapan, Rozell
https://arxiv.org/abs/2602.04192
- Towards Robust Scaling Laws for Optimizers
Alexandra Volkova, Mher Safaryan, Christoph H. Lampert, Dan Alistarh
https://arxiv.org/abs/2602.07712 https://mastoxiv.page/@arXiv_csLG_bot/116046369672796465
- Do We Need Adam? Surprisingly Strong and Sparse Reinforcement Learning with SGD in LLMs
Sagnik Mukherjee, Lifan Yuan, Pavan Jayasinha, Dilek Hakkani-T\"ur, Hao Peng
https://arxiv.org/abs/2602.07729 https://mastoxiv.page/@arXiv_csLG_bot/116046377539155485
- AceGRPO: Adaptive Curriculum Enhanced Group Relative Policy Optimization for Autonomous Machine L...
Yuzhu Cai, Zexi Liu, Xinyu Zhu, Cheng Wang, Siheng Chen
https://arxiv.org/abs/2602.07906 https://mastoxiv.page/@arXiv_csLG_bot/116046423413650658
- VESPO: Variational Sequence-Level Soft Policy Optimization for Stable Off-Policy LLM Training
Guobin Shen, Chenxiao Zhao, Xiang Cheng, Lei Huang, Xing Yu
https://arxiv.org/abs/2602.10693 https://mastoxiv.page/@arXiv_csLG_bot/116057229834947730
- KBVQ-MoE: KLT-guided SVD with Bias-Corrected Vector Quantization for MoE Large Language Models
Zukang Xu, Zhixiong Zhao, Xing Hu, Zhixuan Chen, Dawei Yang
https://arxiv.org/abs/2602.11184 https://mastoxiv.page/@arXiv_csLG_bot/116062537528208461
- MUSE: Multi-Tenant Model Serving With Seamless Model Updates
Correia, Ferreira, Martins, Bento, Guerreiro, Pereira, Gomes, Bono, Ferreira, Bizarro
https://arxiv.org/abs/2602.11776 https://mastoxiv.page/@arXiv_csLG_bot/116062952355379801
- Pawsterior: Variational Flow Matching for Structured Simulation-Based Inference
Jorge Carrasco-Pollo, Floor Eijkelboom, Jan-Willem van de Meent
https://arxiv.org/abs/2602.13813 https://mastoxiv.page/@arXiv_csLG_bot/116085828112928218
- Silent Inconsistency in Data-Parallel Full Fine-Tuning: Diagnosing Worker-Level Optimization Misa...
Hong Li, Zhen Zhou, Honggang Zhang, Yuping Luo, Xinyue Wang, Han Gong, Zhiyuan Liu
https://arxiv.org/abs/2602.14462 https://mastoxiv.page/@arXiv_csLG_bot/116085997857526328
- Divine Benevolence is an $x^2$: GLUs scale asymptotically faster than MLPs
Alejandro Francisco Queiruga
https://arxiv.org/abs/2602.14495 https://mastoxiv.page/@arXiv_csLG_bot/116086011618741857
- \"UberWeb: Insights from Multilingual Curation for a 20-Trillion-Token Dataset
DatologyAI, et al.
https://arxiv.org/abs/2602.15210 https://mastoxiv.page/@arXiv_csLG_bot/116090912256712568
- GLM-5: from Vibe Coding to Agentic Engineering
GLM-5-Team, et al.
https://arxiv.org/abs/2602.15763 https://mastoxiv.page/@arXiv_csLG_bot/116091080686771018
- Anatomy of Capability Emergence: Scale-Invariant Representation Collapse and Top-Down Reorganizat...
Jayadev Billa
https://arxiv.org/abs/2602.15997 https://mastoxiv.page/@arXiv_csLG_bot/116096541546306333
- AI-CARE: Carbon-Aware Reporting Evaluation Metric for AI Models
KC Santosh, Srikanth Baride, Rodrigue Rizk
https://arxiv.org/abs/2602.16042 https://mastoxiv.page/@arXiv_csLG_bot/116096581524696028
- Beyond Message Passing: A Symbolic Alternative for Expressive and Interpretable Graph Learning
Chuqin Geng, Li Zhang, Haolin Ye, Ziyu Zhao, Yuhe Jiang, Tara Saba, Xinyu Wang, Xujie Si
https://arxiv.org/abs/2602.16947 https://mastoxiv.page/@arXiv_csLG_bot/116102426238903124
toXiv_bot_toot

[2026-02-04 Wed (UTC), 5 new articles found for cs.GR Graphics]
toXiv_bot_toot

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

[2026-02-04 Wed (UTC), 1 new article found for cs.OS Operating Systems]
toXiv_bot_toot

An algebraic approach to the existence of valuative interpolation
Shijie Bao, Qi'an Guan, Zhitong Mi, Zheng Yuan
https://arxiv.org/abs/2602.03179 https://arxiv.org/pdf/2602.03179 https://arxiv.org/html/2602.03179
arXiv:2602.03179v1 Announce Type: new
Abstract: An algebraic approach is presented for the valuative interpolation problem, which recovers and generalizes prior characterizations known in the complex analytic setting by the authors. We use the asymptotic Samuel function to give the characterization of the existence of valuative interpolation. We also give a characterization of the existence in the infinite valuative interpolation problem.
toXiv_bot_toot

Replaced article(s) found for physics.atom-ph. https://arxiv.org/list/physics.atom-ph/new
[1/1]:
- Driven-Dissipative Landau Polaritons: Two Highly Nonlinearly-Coupled Quantum Harmonic Oscillators
Farokh Mivehvar

edit_wiktionary: Wiktionary edits (2010)
Three bipartite user-page networks extracted from Wiktionary, for French, German, and English. 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 140902 nodes and 1026100 edges.
Tags: Informational, Web graph, Multigraph, Timestamps

Fundamental linewidth limit of electromagnetically induced transparency in a thermal Rydberg ladder
Noah Schlossberger, Nikunjkumar Prajapati, Alexandra B. Artusio-Glimpse, Samuel Berweger, Christopher L. Holloway
https://arxiv.org/abs/2603.04596

Big non-love for 10-page whitepapers that contain multiple megabytes of images that could have been a few hundred kilobytes.

Gravitational confinement of ghost scalar fields in neutron stars
Argelia Bernal, V\'ictor Jaramillo, N\'estor A. Montiel-Hern\'andez, Dar\'io N\'u\~nez, Nicolas Sanchis-Gual
https://arxiv.org/abs/2603.04400

Full-dimensional quantum scattering calculations of rovibrationally excited HD HD collisions
Bikramaditya Mandal, Hubert J\'o\'zwiak, Piotr Wcis{\l}o, Naduvalath Balakrishnan
https://arxiv.org/abs/2603.04465

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

Fast Sparse Matrix Permutation for Mesh-Based Direct Solvers
Behrooz Zarebavami, Ahmed H. Mahmoud, Ana Dodik, Changcheng Yuan, Serban D. Porumbescu, John D. Owens, Maryam Mehri Dehnavi, Justin Solomon
https://arxiv.org/abs/2602.00898 https://arxiv.org/pdf/2602.00898 https://arxiv.org/html/2602.00898
arXiv:2602.00898v1 Announce Type: new
Abstract: We present a fast sparse matrix permutation algorithm tailored to linear systems arising from triangle meshes. Our approach produces nested-dissection-style permutations while significantly reducing permutation runtime overhead. Rather than enforcing strict balance and separator optimality, the algorithm deliberately relaxes these design decisions to favor fast partitioning and efficient elimination-tree construction. Our method decomposes permutation into patch-level local orderings and a compact quotient-graph ordering of separators, preserving the essential structure required by sparse Cholesky factorization while avoiding its most expensive components. We integrate our algorithm into vendor-maintained sparse Cholesky solvers on both CPUs and GPUs. Across a range of graphics applications, including single factorizations, repeated factorizations, our method reduces permutation time and improves the sparse Cholesky solve performance by up to 6.27x.
toXiv_bot_toot

[2026-02-04 Wed (UTC), 2 new articles found for math.AC Commutative Algebra]
toXiv_bot_toot

[2026-03-06 Fri (UTC), 2 new articles found for physics.atom-ph Atomic Physics]
toXiv_bot_toot

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

Non-Hermitian Quantum Mechanics with Applications to Gravity
Oem Trivedi, Alfredo Gurrola, Robert J. Scherrer
https://arxiv.org/abs/2603.04375 https://arxi…

📰 Einem US-amerikanischen Konzern Geld aus der Tasche zu leiern, um damit Hosting-Rechnungen für Gratis-Angebote zu bezahlen, kann man machen. Aber schön ist es nicht. Ich würde meine Amazon-Partnerlinks gern loswerden, doch es reicht noch nicht. 😭
Bitte unterstütze meine Arbeit mit einer Steady-Mitgliedschaft: https://steady.page/klimacrew…

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

Non-minimally coupled loop quantum inflation with inverse-volume corrections
Rudranil Roy, Giovanni Otalora, Joel Saavedra, Salvatore Capozziello
https://arxiv.org/abs/2603.04182

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

[2026-02-03 Tue (UTC), no new articles found for cs.OS Operating Systems]
toXiv_bot_toot

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

Stationary axisymmetric systems that allow for a separability structure
Hyeong-Chan Kim, Wonwoo Lee
https://arxiv.org/abs/2603.04047 https://arxiv.org/pdf/…

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

Observational Constraints on the Structure-Induced Dark Energy Model
A. Kaz{\i}m \c{C}aml{\i}bel
https://arxiv.org/abs/2603.03999 https://arxiv.org/pdf/260…

Genus-0 Surface Parameterization using Spherical Beltrami Differentials
Zhehao Xu, Lok Ming Lui
https://arxiv.org/abs/2602.01589 https://arxiv.org/pdf/2602.01589 https://arxiv.org/html/2602.01589
arXiv:2602.01589v1 Announce Type: new
Abstract: Spherical surface parameterization is a fundamental tool in geometry processing and imaging science. For a genus-0 closed surface, many efficient algorithms can map the surface to the sphere; consequently, a broad class of task-driven genus-0 mapping problems can be reduced to constructing a high-quality spherical self-map. However, existing approaches often face a trade-off between satisfying task objectives (e.g., landmark or feature alignment), maintaining bijectivity, and controlling geometric distortion. We introduce the Spherical Beltrami Differential (SBD), a two-chart representation of quasiconformal self-maps of the sphere, and establish its correspondence with spherical homeomorphisms up to conformal automorphisms. Building on the Spectral Beltrami Network (SBN), we propose a neural optimization framework BOOST that optimizes two Beltrami fields on hemispherical stereographic charts and enforces global consistency through explicit seam-aware constraints. Experiments on large-deformation landmark matching and intensity-based spherical registration demonstrate the effectiveness of our proposed framework. We further apply the method to brain cortical surface registration, aligning sulcal landmarks and jointly matching cortical sulci depth maps, showing improved task fidelity with controlled distortion and robust bijective behavior.
toXiv_bot_toot

Lengths of irreducible decompositions of numerical semigroups
Pedro Garcia-Sanchez, Christopher O'Neill
https://arxiv.org/abs/2602.00404 https://arxiv.org/pdf/2602.00404 https://arxiv.org/html/2602.00404
arXiv:2602.00404v1 Announce Type: new
Abstract: A numerical semigroup is an additive subsemigroup of the natural numbers that contains zero and has finite complement. A numerical semigroup is irreducible if it cannot be written as an intersection of numerical semigroups properly containing it. It is known that every numerical semigroup can be decomposed as an intersection of irreducible numerical semigroups, but there can be multiple such decompositions, even when irredundancy is required. In this paper, we study the set of all decomposition lengths of a given numerical semigroup. It is conjectured that the set of decomposition lengths is always an interval; we prove this conjecture for numerical semigroups whose smallest positive element is at most six. Additionally, we examine a class of numerical semigroups that was recently shown to achieve arbitrarily large minimum decomposition length, and construct a family of irreducible decompositions whose lengths form a large interval.
toXiv_bot_toot

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)

inploid: Inploid: an online social Q&A platform
Inploid is a social question & answer website in Turkish. Users can follow others and see their questions and answers on the main page. Each user is associated with a reputability score which is influenced by feedback of others about questions and answers of the user. Each user can also specify interest in topics. The data is crawled in June 2017 and consist of 39,749 nodes and 57,276 directed links between them. In addition, for …

Lorentzian-Euclidean singularity-free solutions to gravitational collapse
Sune Rastad Bahn, Michael Cramer Andersen
https://arxiv.org/abs/2603.03934 https://

Local observers in stationary axisymmetric dust spacetimes
Matteo Fontana, Sergio Luigi Cacciatori, Roberto Peron
https://arxiv.org/abs/2603.03924 https://…

[2026-02-03 Tue (UTC), 3 new articles found for cs.GR Graphics]
toXiv_bot_toot

[2026-02-03 Tue (UTC), 3 new articles found for math.AC Commutative Algebra]
toXiv_bot_toot

[2026-01-05 Mon (UTC), no new articles found for physics.atom-ph Atomic Physics]
toXiv_bot_toot

Scalar quasinormal modes of rotating black holes in parity-violating gravity
Hiroaki W. H. Tahara, Hayato Motohashi, Kazufumi Takahashi, Vicharit Yingcharoenrat
https://arxiv.org/abs/2603.03722

Purely optical macroscopic trap for alkaline-earth and similar atoms
O. N. Prudnikov, V. I. Yudin, R. Ya. Ilenkov, A. V. Taichenachev
https://arxiv.org/abs/2603.03653 https://…

Photon Spheres and shadow of Schwarzschild black hole on the EUP framework
Hai-Long Zhen, Jian-Hua Shi, Huai-Fan Li, Yu-Bo Ma
https://arxiv.org/abs/2603.03660 https://

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

[2026-03-05 Thu (UTC), 3 new articles found for physics.atom-ph Atomic Physics]
toXiv_bot_toot

Analogue Hawking radiation in nonlinear quantum optics
Isaac Bernal (ESFM-IPN), Miguel A. Cort\'es-Ortiz (Cinvestav), David Bermudez (Cinvestav)
https://arxiv.org/abs/2603.03525

Accelerating Bertotti-Robinson Black Holes in a Uniform Magnetic Field
Ahmad Al-Badawi, Faizuddin Ahmed, Edilberto O. Silva
https://arxiv.org/abs/2603.03494 https://

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

Slowly rotating charged BTZ black hole solutions in Palatini Chern-Simons gravity
Flavio Bombacigno, Gonzalo J. Olmo, Emanuele Orazi, Paulo J. Porf\'irio
https://arxiv.org/abs/2603.03436

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://

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

Replaced article(s) found for physics.atom-ph. https://arxiv.org/list/physics.atom-ph/new
[1/1]:
- Precision measurement of the ground-state hyperfine constant for $^9Be^ $ in a linear Paul trap v...
Zhi-yuan Ao, Wen-li Bai, Qian-yu Zhang, Wen-cui Peng, Xin Tong

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

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://

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

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

[2026-03-04 Wed (UTC), 5 new articles found for physics.atom-ph Atomic Physics]
toXiv_bot_toot

Crosslisted article(s) found for physics.atom-ph. https://arxiv.org/list/physics.atom-ph/new
[1/1]:
- Fingerprint Recognition of Partial Discharge Signals in Deep Learning Enhanced Rydberg Atomic Sen...
Yi-Ming Yin, et al.