Tootfinder

https://resist.bot/petitions/PUGZFD

Gas Prices Rising, Troops Dying — Congress Must Act on Iran
Text SIGN PUGZFD to 50409 to send this to your officials.

@… are you a bot? your account seems very bot like!

[2026-02-10 Tue (UTC), 26 new articles found for hep-ph High Energy Physics - Phenomenology]
toXiv_bot_toot

GoDaddy integrates Cloudflare's AI Crawl Control into its hosting platform, enabling site owners to block, permit, or possibly monetize automated crawler access (Alistair Barr/Business Insider)
https://www.businessinsider.com/cloudflare

Cloudflare and GoDaddy join forces against Big Tech's AI bot swarms
Cloudflare and GoDaddy are partnering to give websites control over AI crawlers, aiming to fix the web's broken business model in the AI era.

#Deponia gibt's grade kostenlos auf #Steam
https://bot.pnpde.social/@freegames/st

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

[2026-02-10 Tue (UTC), 13 new articles found for cs.DS Data Structures and Algorithms]
toXiv_bot_toot

[2026-04-10 Fri (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Metamucilini
bot by @…
No laws were broken in the making of this bot: no waterboarding please and thank you.
#satire #potus45

It must feel so good to get degaussed as a bot :neobot_floof:

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

https://resist.bot/petitions/PGIFJW

Stand With Ukraine and Stop Trump's Dangerous Policies
Text SIGN PGIFJW to 50409 to send this to your officials.

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

Sharp gradient integrability for $(s,p)$-Poisson type equations
Verena B\"ogelein, Frank Duzaar, Naian Liao, Kristian Moring
https://arxiv.org/abs/2602.08944 https://

Crosslisted article(s) found for cs.CL. https://arxiv.org/list/cs.CL/new
[1/2]:
- Bridge-RAG: An Abstract Bridge Tree Based Retrieval Augmented Generation Algorithm With Cuckoo Fi...
Li, Liu, Zong, Tao, Dai, Ren, Liu, Jiang, Yang
https://arxiv.org/abs/2603.26668 https://mastoxiv.page/@arXiv_csIR_bot/116322781593134028
- SRAG: RAG with Structured Data Improves Vector Retrieval
Shalin Shah, Srikanth Ryali, Ramasubbu Venkatesh
https://arxiv.org/abs/2603.26670 https://mastoxiv.page/@arXiv_csIR_bot/116322784870180864
- LITTA: Late-Interaction and Test-Time Alignment for Visually-Grounded Multimodal Retrieval
Seonok Kim
https://arxiv.org/abs/2603.26683 https://mastoxiv.page/@arXiv_csIR_bot/116322841916406330
- Agentic AI for Human Resources: LLM-Driven Candidate Assessment
Yuksel, Anees, Elneima, Hewavitharana, Al-Badrashiny, Sawaf
https://arxiv.org/abs/2603.26710 https://mastoxiv.page/@arXiv_csIR_bot/116322937601675587
- SEAR: Schema-Based Evaluation and Routing for LLM Gateways
Zecheng Zhang, Han Zheng, Yue Xu
https://arxiv.org/abs/2603.26728 https://mastoxiv.page/@arXiv_csDB_bot/116322627580095245
- SleepVLM: Explainable and Rule-Grounded Sleep Staging via a Vision-Language Model
Guifeng Deng, Pan Wang, Jiquan Wang, Shuying Rao, Junyi Xie, Wanjun Guo, Tao Li, Haiteng Jiang
https://arxiv.org/abs/2603.26738 https://mastoxiv.page/@arXiv_csCV_bot/116322739676378309
- Aesthetic Assessment of Chinese Handwritings Based on Vision Language Models
Chen Zheng, Yuxuan Lai, Haoyang Lu, Wentao Ma, Jitao Yang, Jian Wang
https://arxiv.org/abs/2603.26768 https://mastoxiv.page/@arXiv_csCV_bot/116323078149576728
- Learning to Select Visual In-Context Demonstrations
Eugene Lee, Yu-Chi Lin, Jiajie Diao
https://arxiv.org/abs/2603.26775 https://mastoxiv.page/@arXiv_csLG_bot/116322648878995047
- CRISP: Characterizing Relative Impact of Scholarly Publications
Hannah Collison, Benjamin Van Durme, Daniel Khashabi
https://arxiv.org/abs/2603.26791 https://mastoxiv.page/@arXiv_csDL_bot/116322621679820997
- GroupRAG: Cognitively Inspired Group-Aware Retrieval and Reasoning via Knowledge-Driven Problem S...
Xinyi Duan, Yuanrong Tang, Jiangtao Gong
https://arxiv.org/abs/2603.26807 https://mastoxiv.page/@arXiv_csIR_bot/116322959557860848
- In your own words: computationally identifying interpretable themes in free-text survey data
Jenny S Wang, Aliya Saperstein, Emma Pierson
https://arxiv.org/abs/2603.26930 https://mastoxiv.page/@arXiv_csCY_bot/116322780637316287
- Multilingual Stutter Event Detection for English, German, and Mandarin Speech
Felix Haas, Sebastian P. Bayerl
https://arxiv.org/abs/2603.26939 https://mastoxiv.page/@arXiv_csSD_bot/116322704289189130
- FormalProofBench: Can Models Write Graduate Level Math Proofs That Are Formally Verified?
Ravi, Ying, Nesterov, Krishnan, Uskuplu, Xia, Aswedige, Nashold
https://arxiv.org/abs/2603.26996 https://mastoxiv.page/@arXiv_csAI_bot/116322625941412681
- PHONOS: PHOnetic Neutralization for Online Streaming Applications
Waris Quamer, Mu-Ruei Tseng, Ghady Nasrallah, Ricardo Gutierrez-Osuna
https://arxiv.org/abs/2603.27001 https://mastoxiv.page/@arXiv_eessAS_bot/116322763598554193
- ChartNet: A Million-Scale, High-Quality Multimodal Dataset for Robust Chart Understanding
Jovana Kondic, et al.
https://arxiv.org/abs/2603.27064 https://mastoxiv.page/@arXiv_csCV_bot/116323214468792735
- daVinci-LLM:Towards the Science of Pretraining
Qin, Liu, Mi, Xie, Huang, Si, Lu, Feng, Wu, Liu, Luo, Hou, Guo, Qiao, Liu
https://arxiv.org/abs/2603.27164 https://mastoxiv.page/@arXiv_csAI_bot/116322653467105951
- LightMover: Generative Light Movement with Color and Intensity Controls
Zhou, Wang, Kim, Shu, Yu, Hold-Geoffroy, Chaturvedi, Wu, Lin, Cohen
https://arxiv.org/abs/2603.27209 https://mastoxiv.page/@arXiv_csCV_bot/116323263295656104
- Self-evolving AI agents for protein discovery and directed evolution
Tan, Zhang, Li, Yu, Zhong, Zhou, Dong, Hong
https://arxiv.org/abs/2603.27303 https://mastoxiv.page/@arXiv_csAI_bot/116322838641595927
- Inference-Time Structural Reasoning for Compositional Vision-Language Understanding
Amartya Bhattacharya
https://arxiv.org/abs/2603.27349 https://mastoxiv.page/@arXiv_csCV_bot/116323280006044500
- LLM Readiness Harness: Evaluation, Observability, and CI Gates for LLM/RAG Applications
Alexandre Cristov\~ao Maiorano
https://arxiv.org/abs/2603.27355 https://mastoxiv.page/@arXiv_csAI_bot/116322987708962414
- Heterogeneous Debate Engine: Identity-Grounded Cognitive Architecture for Resilient LLM-Based Eth...
Jakub Mas{\l}owski, Jaros{\l}aw A. Chudziak
https://arxiv.org/abs/2603.27404 https://mastoxiv.page/@arXiv_csAI_bot/116322999177460352
toXiv_bot_toot

CONVOLVED NUMBERS OF K-SECTION OF THE FIBONACCI SEQUENCE: PROPERTIES, CONSEQUENCES Convolved Numbers of $k$-sections of the Fibonacci Sequence
Vitaly M. Khamitov, Dmitriy Dmitrishin, Alexander Stokolos, Daniel Gray
https://arxiv.org/abs/2603.08636

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

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

https://resist.bot/petitions/PNYPDV

Iran war is a colossal legal, moral, practical disaster. DO YOUR JOB. Stop it
Text SIGN PNYPDV to 50409 to send this to your officials.

[2026-04-09 Thu (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

A Faster Directed Single-Source Shortest Path Algorithm
Ran Duan, Xiao Mao, Xinkai Shu, Longhui Yin
https://arxiv.org/abs/2602.07868 https://arxiv.org/pdf/2602.07868 https://arxiv.org/html/2602.07868
arXiv:2602.07868v1 Announce Type: new
Abstract: This paper presents a new deterministic algorithm for single-source shortest paths (SSSP) on real non-negative edge-weighted directed graphs, with running time $O(m\sqrt{\log n} \sqrt{mn\log n\log \log n})$, which is $O(m\sqrt{\log n\log \log n})$ for sparse graphs. This improves the recent breakthrough result of $O(m\log^{2/3} n)$ time for directed SSSP algorithm [Duan, Mao, Mao, Shu, Yin 2025].
toXiv_bot_toot

Fork, Explore, Commit: OS Primitives for Agentic Exploration
Cong Wang, Yusheng Zheng
https://arxiv.org/abs/2602.08199 https://arxiv.org/pdf/2602.08199 https://arxiv.org/html/2602.08199
arXiv:2602.08199v1 Announce Type: new
Abstract: AI agents increasingly perform agentic exploration: pursuing multiple solution paths in parallel and committing only the successful one. Because each exploration path may modify files and spawn processes, agents require isolated environments with atomic commit and rollback semantics for both filesystem state and process state. We introduce the branch context, a new OS abstraction that provides: (1) copy-on-write state isolation with independent filesystem views and process groups, (2) a structured lifecycle of fork, explore, and commit/abort, (3) first-commit-wins resolution that automatically invalidates sibling branches, and (4) nestable contexts for hierarchical exploration. We realize branch contexts in Linux through two complementary components. First, BranchFS is a FUSE-based filesystem that gives each branch context an isolated copy-on-write workspace, with O(1) creation, atomic commit to the parent, and automatic sibling invalidation, all without root privileges. BranchFS is open sourced in https://github.com/multikernel/branchfs. Second, branch() is a proposed Linux syscall that spawns processes into branch contexts with reliable termination, kernel-enforced sibling isolation, and first-commit-wins coordination. Preliminary evaluation of BranchFS shows sub-350 us branch creation independent of base filesystem size, and modification-proportional commit overhead (under 1 ms for small changes).
toXiv_bot_toot

Orange Krampus
bot by @…
No laws were broken in the making of this bot: no waterboarding please and thank you.
#satire #potus45

Radiative Seesaw Model with Baryon Number Violation and Upper Limit on Neutron-anti-Neutron Transition Time
Rabindra N. Mohapatra, Nobuchika Okada
https://arxiv.org/abs/2602.07136

https://resist.bot/petitions/PUOZIA

Two Judges Just Authorized Mass Incarceration—Congress Must Stop It
Text SIGN PUOZIA to 50409 to send this to your officials.

Existence of expanding harmonic map flows to hemispheres
Xuanyu Li
https://arxiv.org/abs/2602.08932 https://arxiv.org/pdf/2602.08932

Yet Another Characterisation of Classical Orthogonal Polynomials?
K. Castillo, G. Gordillo-N\'u\~nez
https://arxiv.org/abs/2603.08543 https://arxiv.org…

Google seems to require Google Play Services for passing next-gen reCAPTCHA on Android, denying de-Googled Android phones and creating surveillance issues (Rick Findlay/Reclaim The Net)
https://reclaimthenet.org/google-broke-recaptcha-for-de-googled-android-user…

Google Broke reCAPTCHA for De-Googled Android Users
The company that decides whether you're a bot now also requires you run its software to prove otherwise.

Replaced article(s) found for cs.CL. https://arxiv.org/list/cs.CL/new
[2/5]:
- POTSA: A Cross-Lingual Speech Alignment Framework for Speech-to-Text Translation
Li, Cui, Wang, Ge, Huang, Li, Peng, Lu, Tashi, Wang, Dang
https://arxiv.org/abs/2511.09232 https://mastoxiv.page/@arXiv_csCL_bot/115541846907664054
- Beyond Elicitation: Provision-based Prompt Optimization for Knowledge-Intensive Tasks
Yunzhe Xu, Zhuosheng Zhang, Zhe Liu
https://arxiv.org/abs/2511.10465 https://mastoxiv.page/@arXiv_csCL_bot/115547607561282911
- $\pi$-Attention: Periodic Sparse Transformers for Efficient Long-Context Modeling
Dong Liu, Yanxuan Yu
https://arxiv.org/abs/2511.10696 https://mastoxiv.page/@arXiv_csCL_bot/115564418836654965
- Based on Data Balancing and Model Improvement for Multi-Label Sentiment Classification Performanc...
Zijin Su, Huanzhu Lyu, Yuren Niu, Yiming Liu
https://arxiv.org/abs/2511.14073 https://mastoxiv.page/@arXiv_csCL_bot/115575715073023141
- HEAD-QA v2: Expanding a Healthcare Benchmark for Reasoning
Alexis Correa-Guill\'en, Carlos G\'omez-Rodr\'iguez, David Vilares
https://arxiv.org/abs/2511.15355 https://mastoxiv.page/@arXiv_csCL_bot/115581410328165116
- Towards Hyper-Efficient RAG Systems in VecDBs: Distributed Parallel Multi-Resolution Vector Search
Dong Liu, Yanxuan Yu
https://arxiv.org/abs/2511.16681 https://mastoxiv.page/@arXiv_csCL_bot/115603508442305146
- Estonian WinoGrande Dataset: Comparative Analysis of LLM Performance on Human and Machine Transla...
Marii Ojastu, Hele-Andra Kuulmets, Aleksei Dorkin, Marika Borovikova, Dage S\"arg, Kairit Sirts
https://arxiv.org/abs/2511.17290 https://mastoxiv.page/@arXiv_csCL_bot/115604083224487885
- A Systematic Study of In-the-Wild Model Merging for Large Language Models
O\u{g}uz Ka\u{g}an Hitit, Leander Girrbach, Zeynep Akata
https://arxiv.org/abs/2511.21437 https://mastoxiv.page/@arXiv_csCL_bot/115621178703846052
- CREST: Universal Safety Guardrails Through Cluster-Guided Cross-Lingual Transfer
Lavish Bansal, Naman Mishra
https://arxiv.org/abs/2512.02711 https://mastoxiv.page/@arXiv_csCL_bot/115655090475535157
- Multilingual Medical Reasoning for Question Answering with Large Language Models
Pietro Ferrazzi, Aitor Soroa, Rodrigo Agerri
https://arxiv.org/abs/2512.05658 https://mastoxiv.page/@arXiv_csCL_bot/115683267711014189
- OnCoCo 1.0: A Public Dataset for Fine-Grained Message Classification in Online Counseling Convers...
Albrecht, Lehmann, Poltermann, Rudolph, Steigerwald, Stieler
https://arxiv.org/abs/2512.09804 https://mastoxiv.page/@arXiv_csCL_bot/115700409397020978
- Does Tone Change the Answer? Evaluating Prompt Politeness Effects on Modern LLMs: GPT, Gemini, an...
Hanyu Cai, Binqi Shen, Lier Jin, Lan Hu, Xiaojing Fan
https://arxiv.org/abs/2512.12812 https://mastoxiv.page/@arXiv_csCL_bot/115729149622659403
- Beg to Differ: Understanding Reasoning-Answer Misalignment Across Languages
Ovalle, Ross, Ruder, Williams, Ullrich, Ibrahim, Sagun
https://arxiv.org/abs/2512.22712 https://mastoxiv.page/@arXiv_csCL_bot/115808161882146194
- Activation Steering for Masked Diffusion Language Models
Adi Shnaidman, Erin Feiglin, Osher Yaari, Efrat Mentel, Amit Levi, Raz Lapid
https://arxiv.org/abs/2512.24143 https://mastoxiv.page/@arXiv_csCL_bot/115819533211103315
- JMedEthicBench: A Multi-Turn Conversational Benchmark for Evaluating Medical Safety in Japanese L...
Liu, Li, Niu, Zhang, Xun, Hou, Wang, Iwasawa, Matsuo, Hatakeyama-Sato
https://arxiv.org/abs/2601.01627 https://mastoxiv.page/@arXiv_csCL_bot/115847901607405421
- FACTUM: Mechanistic Detection of Citation Hallucination in Long-Form RAG
Dassen, Kotula, Murray, Yates, Lawrie, Kayi, Mayfield, Duh
https://arxiv.org/abs/2601.05866 https://mastoxiv.page/@arXiv_csCL_bot/115881545684182376
- {\dag}DAGGER: Distractor-Aware Graph Generation for Executable Reasoning in Math Problems
Zabir Al Nazi, Shubhashis Roy Dipta, Sudipta Kar
https://arxiv.org/abs/2601.06853 https://mastoxiv.page/@arXiv_csCL_bot/115887753245730019
- Symphonym: Universal Phonetic Embeddings for Cross-Script Name Matching
Stephen Gadd
https://arxiv.org/abs/2601.06932 https://mastoxiv.page/@arXiv_csCL_bot/115887767008671765
- LLMs versus the Halting Problem: Revisiting Program Termination Prediction
Sultan, Armengol-Estape, Kesseli, Vanegue, Shahaf, Adi, O'Hearn
https://arxiv.org/abs/2601.18987 https://mastoxiv.page/@arXiv_csCL_bot/115972010510378715
- MuVaC: A Variational Causal Framework for Multimodal Sarcasm Understanding in Dialogues
Diandian Guo, Fangfang Yuan, Cong Cao, Xixun Lin, Chuan Zhou, Hao Peng, Yanan Cao, Yanbing Liu
https://arxiv.org/abs/2601.20451 https://mastoxiv.page/@arXiv_csCL_bot/115977891530875024
toXiv_bot_toot

Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
Wojciech Gabryelski, Zbigniew Go{\l}\c{e}biewski, Martin P\'epin
https://arxiv.org/abs/2602.08471 https://arxiv.org/pdf/2602.08471 https://arxiv.org/html/2602.08471
arXiv:2602.08471v1 Announce Type: new
Abstract: We propose two efficient algorithms for generating uniform random directed acyclic graphs, including an asymptotically optimal exact-size sampler that performs $\frac{n^2}{2} o(n^2)$ operations and requests to a random generator. This was achieved by extending the Boltzmann model for graphical generating functions and by using various decompositions of directed acyclic graphs. The presented samplers improve upon the state-of-the-art algorithms in terms of theoretical complexity and offer a significant speed-up in practice.
toXiv_bot_toot

HALO: A Fine-Grained Resource Sharing Quantum Operating System
John Zhuoyang Ye, Jiyuan Wang, Yifan Qiao, Jens Palsberg
https://arxiv.org/abs/2602.07191 https://arxiv.org/pdf/2602.07191 https://arxiv.org/html/2602.07191
arXiv:2602.07191v1 Announce Type: new
Abstract: As quantum computing enters the cloud era, thousands of users must share access to a small number of quantum processors. Users need to wait minutes to days to start their jobs, which only takes a few seconds for execution. Current quantum cloud platforms employ a fair-share scheduler, as there is no way to multiplex a quantum computer among multiple programs at the same time, leaving many qubits idle and significantly under-utilizing the hardware. This imbalance between high user demand and scarce quantum resources has become a key barrier to scalable and cost-effective quantum computing.
We present HALO, the first quantum operating system design that supports fine-grained resource-sharing. HALO introduces two complementary mechanisms. First, a hardware-aware qubit-sharing algorithm that places shared helper qubits on regions of the quantum computer that minimize routing overhead and avoid cross-talk noise between different users' processes. Second, a shot-adaptive scheduler that allocates execution windows according to each job's sampling requirements, improving throughput and reducing latency. Together, these mechanisms transform the way quantum hardware is scheduled and achieve more fine-grained parallelism.
We evaluate HALO on the IBM Torino quantum computer on helper qubit intense benchmarks. Compared to state-of-the-art systems such as HyperQ, HALO improves overall hardware utilization by up to 2.44x, increasing throughput by 4.44x, and maintains fidelity loss within 33%, demonstrating the practicality of resource-sharing in quantum computing.
toXiv_bot_toot

Humpty Trumpty
bot by @…
No laws were broken in the making of this bot: please don't come after me.
#satire #potus45

Assessing the Impact of Fitting Methodology at aN$^3$LO with FPPDF: an Open Source Tool for Extracting Parton Distribution Functions in the Hessian Approach
J. M. Cruz-Martinez, T. Giani, L. A. Harland-Lang
https://arxiv.org/abs/2602.07118

Global well-posedness for one-dimensional compressible Navier--Stokes system in dynamic combustion with small $BV\cap L^1$ initial data
Siran Li, Haitao Wang, Jianing Yang
https://arxiv.org/abs/2602.08867

Replaced article(s) found for cs.CL. https://arxiv.org/list/cs.CL/new
[1/5]:
- Beyond In-Distribution Success: Scaling Curves of CoT Granularity for Language Model Generalization
Ru Wang, Wei Huang, Selena Song, Haoyu Zhang, Qian Niu, Yusuke Iwasawa, Yutaka Matsuo, Jiaxian Guo
https://arxiv.org/abs/2502.18273 https://mastoxiv.page/@arXiv_csCL_bot/114069031700102129
- Benchmarking NLP-supported Language Sample Analysis for Swiss Children's Speech
Anja Ryser, Yingqiang Gao, Sarah Ebling
https://arxiv.org/abs/2504.00780 https://mastoxiv.page/@arXiv_csCL_bot/114267149909002069
- Cultural Biases of Large Language Models and Humans in Historical Interpretation
Fabio Celli, Georgios Spathulas
https://arxiv.org/abs/2504.02572 https://mastoxiv.page/@arXiv_csCL_bot/114278467094094490
- BRIDGE: Benchmarking Large Language Models for Understanding Real-world Clinical Practice Text
Jiageng Wu, et al.
https://arxiv.org/abs/2504.19467 https://mastoxiv.page/@arXiv_csCL_bot/114420036189999973
- Understanding the Anchoring Effect of LLM with Synthetic Data: Existence, Mechanism, and Potentia...
Yiming Huang, Biquan Bie, Zuqiu Na, Weilin Ruan, Songxin Lei, Yutao Yue, Xinlei He
https://arxiv.org/abs/2505.15392 https://mastoxiv.page/@arXiv_csCL_bot/114550277171100272
- Just as Humans Need Vaccines, So Do Models: Model Immunization to Combat Falsehoods
Raza, Qureshi, Farooq, Lotif, Chadha, Pandya, Emmanouilidis
https://arxiv.org/abs/2505.17870 https://mastoxiv.page/@arXiv_csCL_bot/114572956853819813
- LingoLoop Attack: Trapping MLLMs via Linguistic Context and State Entrapment into Endless Loops
Fu, Jiang, Hong, Li, Guo, Yang, Chen, Zhang
https://arxiv.org/abs/2506.14493 https://mastoxiv.page/@arXiv_csCL_bot/114703502552989170
- GHTM: A Graph-based Hybrid Topic Modeling Approach with a Benchmark Dataset for the Low-Resource ...
Farhana Haque, Md. Abdur Rahman, Sumon Ahmed
https://arxiv.org/abs/2508.00605 https://mastoxiv.page/@arXiv_csCL_bot/114969875643478303
- Link Prediction for Event Logs in the Process Industry
Anastasia Zhukova, Thomas Walton, Christian E. Lobm\"uller, Bela Gipp
https://arxiv.org/abs/2508.09096 https://mastoxiv.page/@arXiv_csCL_bot/115020938764936882
- AirQA: A Comprehensive QA Dataset for AI Research with Instance-Level Evaluation
Huang, Cao, Zhang, Kang, Wang, Wang, Luo, Zheng, Qian, Chen, Yu
https://arxiv.org/abs/2509.16952 https://mastoxiv.page/@arXiv_csCL_bot/115253526588472475
- Multi-View Attention Multiple-Instance Learning Enhanced by LLM Reasoning for Cognitive Distortio...
Jun Seo Kim, Hyemi Kim, Woo Joo Oh, Hongjin Cho, Hochul Lee, Hye Hyeon Kim
https://arxiv.org/abs/2509.17292 https://mastoxiv.page/@arXiv_csCL_bot/115253586227941157
- Dual-Space Smoothness for Robust and Balanced LLM Unlearning
Han Yan, Zheyuan Liu, Meng Jiang
https://arxiv.org/abs/2509.23362 https://mastoxiv.page/@arXiv_csCL_bot/115293308293558024
- The Rise of AfricaNLP: Contributions, Contributors, Community Impact, and Bibliometric Analysis
Tadesse Destaw Belay, et al.
https://arxiv.org/abs/2509.25477 https://mastoxiv.page/@arXiv_csCL_bot/115298213432594791
- Open ASR Leaderboard: Towards Reproducible and Transparent Multilingual and Long-Form Speech Reco...
Srivastav, Zheng, Bezzam, Le Bihan, Koluguri, \.Zelasko, Majumdar, Moumen, Gandhi
https://arxiv.org/abs/2510.06961 https://mastoxiv.page/@arXiv_csCL_bot/115343748052193267
- Neuron-Level Analysis of Cultural Understanding in Large Language Models
Taisei Yamamoto, Ryoma Kumon, Danushka Bollegala, Hitomi Yanaka
https://arxiv.org/abs/2510.08284 https://mastoxiv.page/@arXiv_csCL_bot/115349533441895984
- CLMN: Concept based Language Models via Neural Symbolic Reasoning
Yibo Yang
https://arxiv.org/abs/2510.10063 https://mastoxiv.page/@arXiv_csCL_bot/115372392366793754
- Schema for In-Context Learning
Chen, Chen, Wang, Leong, Fung, Bernales, Aspuru-Guzik
https://arxiv.org/abs/2510.13905 https://mastoxiv.page/@arXiv_csCL_bot/115389057899856601
- Evaluating Latent Knowledge of Public Tabular Datasets in Large Language Models
Matteo Silvestri, Fabiano Veglianti, Flavio Giorgi, Fabrizio Silvestri, Gabriele Tolomei
https://arxiv.org/abs/2510.20351 https://mastoxiv.page/@arXiv_csCL_bot/115428615784704418
- LuxIT: A Luxembourgish Instruction Tuning Dataset from Monolingual Seed Data
Julian Valline, Cedric Lothritz, Siwen Guo, Jordi Cabot
https://arxiv.org/abs/2510.24434 https://mastoxiv.page/@arXiv_csCL_bot/115457025096322944
- Surfacing Subtle Stereotypes: A Multilingual, Debate-Oriented Evaluation of Modern LLMs
Muhammed Saeed, Muhammad Abdul-mageed, Shady Shehata
https://arxiv.org/abs/2511.01187 https://mastoxiv.page/@arXiv_csCL_bot/115491321130591723
toXiv_bot_toot

Unsplittable Transshipments
Srinwanti Debgupta, Sarah Morell, Martin Skutella
https://arxiv.org/abs/2602.07230 https://arxiv.org/pdf/2602.07230 https://arxiv.org/html/2602.07230
arXiv:2602.07230v1 Announce Type: new
Abstract: We introduce the Unsplittable Transshipment Problem in directed graphs with multiple sources and sinks. An unsplittable transshipment routes given supplies and demands using at most one path for each source-sink pair. Although they are a natural generalization of single source unsplittable flows, unsplittable transshipments raise interesting new challenges and require novel algorithmic techniques. As our main contribution, we give a nontrivial generalization of a seminal result of Dinitz, Garg, and Goemans (1999) by showing how to efficiently turn a given transshipment $x$ into an unsplittable transshipment $y$ with $y_a<x_a d_{\max}$ for all arcs $a$, where $d_{\max}$ is the maximum demand (or supply) value. Further results include bounds on the number of rounds required to satisfy all demands, where each round consists of an unsplittable transshipment that routes a subset of the demands while respecting arc capacity constraints.
toXiv_bot_toot

Equilibria: Fair Multi-Tenant CXL Memory Tiering At Scale
Kaiyang Zhao, Neha Gholkar, Hasan Maruf, Abhishek Dhanotia, Johannes Weiner, Gregory Price, Ning Sun, Bhavya Dwivedi, Stuart Clark, Dimitrios Skarlatos
https://arxiv.org/abs/2602.08800 https://arxiv.org/pdf/2602.08800 https://arxiv.org/html/2602.08800
arXiv:2602.08800v1 Announce Type: new
Abstract: Memory dominates datacenter system cost and power. Memory expansion via Compute Express Link (CXL) is an effective way to provide additional memory at lower cost and power, but its effective use requires software-level tiering for hyperscaler workloads. Existing tiering solutions, including current Linux support, face fundamental limitations in production deployments. First, they lack multi-tenancy support, failing to handle stacked homogeneous or heterogeneous workloads. Second, limited control-plane flexibility leads to fairness violations and performance variability. Finally, insufficient observability prevents operators from diagnosing performance pathologies at scale.
We present Equilibria, an OS framework enabling fair, multi-tenant CXL tiering at datacenter scale. Equilibria provides per-container controls for memory fair-share allocation and fine-grained observability of tiered-memory usage and operations. It further enforces flexible, user-specified fairness policies through regulated promotion and demotion, and mitigates noisy-neighbor interference by suppressing thrashing.
Evaluated in a large hyperscaler fleet using production workloads and benchmarks, Equilibria helps workloads meet service level objectives (SLOs) while avoiding performance interference. It improves performance over the state-of-the-art Linux solution, TPP, by up to 52% for production workloads and 1.7x for benchmarks. All Equilibria patches have been released to the Linux community.
toXiv_bot_toot

Quarter Flouder
bot by @…
No laws were broken in the making of this bot: don't send me to a camp, please.
#satire #potus45

Rigidity of homogeneous Lam\'e systems
Joonas Ilmavirta, Teemu Saksala, Lili Yan
https://arxiv.org/abs/2602.08860 https://arxiv.org/pdf/2602.08860

Prune, Don't Rebuild: Efficiently Tuning $\alpha$-Reachable Graphs for Nearest Neighbor Search
Tian Zhang, Ashwin Padaki, Jiaming Liang, Zack Ives, Erik Waingarten
https://arxiv.org/abs/2602.08097 https://arxiv.org/pdf/2602.08097 https://arxiv.org/html/2602.08097
arXiv:2602.08097v1 Announce Type: new
Abstract: Vector similarity search is an essential primitive in modern AI and ML applications. Most vector databases adopt graph-based approximate nearest neighbor (ANN) search algorithms, such as DiskANN (Subramanya et al., 2019), which have demonstrated state-of-the-art empirical performance. DiskANN's graph construction is governed by a reachability parameter $\alpha$, which gives a trade-off between construction time, query time, and accuracy. However, adaptively tuning this trade-off typically requires rebuilding the index for different $\alpha$ values, which is prohibitive at scale. In this work, we propose RP-Tuning, an efficient post-hoc routine, based on DiskANN's pruning step, to adjust the $\alpha$ parameter without reconstructing the full index. Within the $\alpha$-reachability framework of prior theoretical works (Indyk and Xu, 2023; Gollapudi et al., 2025), we prove that pruning an initially $\alpha$-reachable graph with RP-Tuning preserves worst-case reachability guarantees in general metrics and improved guarantees in Euclidean metrics. Empirically, we show that RP-Tuning accelerates DiskANN tuning on four public datasets by up to $43\times$ with negligible overhead.
toXiv_bot_toot

Petty Roosevelt
bot by @…
No laws were broken in the making of this bot: please don't torture me.
#satire #potus45

Robust Multiagent Collaboration Through Weighted Max-Min T-Joins
Sharareh Alipour
https://arxiv.org/abs/2602.07720 https://arxiv.org/pdf/2602.07720 https://arxiv.org/html/2602.07720
arXiv:2602.07720v1 Announce Type: new
Abstract: Many multiagent tasks -- such as reviewer assignment, coalition formation, or fair resource allocation -- require selecting a group of agents such that collaboration remains effective even in the worst case. The \emph{weighted max-min $T$-join problem} formalizes this challenge by seeking a subset of vertices whose minimum-weight matching is maximized, thereby ensuring robust outcomes against unfavorable pairings.
We advance the study of this problem in several directions. First, we design an algorithm that computes an upper bound for the \emph{weighted max-min $2k$-matching problem}, where the chosen set must contain exactly $2k$ vertices. Building on this bound, we develop a general algorithm with a \emph{$2 \ln n$-approximation guarantee} that runs in $O(n^4)$ time. Second, using ear decompositions, we propose another upper bound for the weighted max-min $T$-join cost. We also show that the problem can be solved exactly when edge weights belong to $\{1,2\}$.
Finally, we evaluate our methods on real collaboration datasets. Experiments show that the lower bounds from our approximation algorithm and the upper bounds from the ear decomposition method are consistently close, yielding empirically small constant-factor approximations. Overall, our results highlight both the theoretical significance and practical value of weighted max-min $T$-joins as a framework for fair and robust group formation in multiagent systems.
toXiv_bot_toot

The Pedo in Chief
bot by @…
No laws were broken in the making of this bot: rescind the warrant.
#satire #potus45

Derivation and analysis of a Stokes-transport system in evolving vessels modeling thermoregulation in human skin
Kilian Hacker, Maria Neuss-Radu
https://arxiv.org/abs/2602.08788

Online Algorithm for Fractional Matchings with Edge Arrivals in Graphs of Maximum Degree Three
Kanstantsin Pashkovich, Thomas Snow
https://arxiv.org/abs/2602.07355 https://arxiv.org/pdf/2602.07355 https://arxiv.org/html/2602.07355
arXiv:2602.07355v1 Announce Type: new
Abstract: We study online algorithms for maximum cardinality matchings with edge arrivals in graphs of low degree. Buchbinder, Segev, and Tkach showed that no online algorithm for maximum cardinality fractional matchings can achieve a competitive ratio larger than $4/(9-\sqrt 5)\approx 0.5914$ even for graphs of maximum degree three. The negative result of Buchbinder et al. holds even when the graph is bipartite and edges are revealed according to vertex arrivals, i.e. once a vertex arrives, all edges are revealed that include the newly arrived vertex and one of the previously arrived vertices. In this work, we complement the negative result of Buchbinder et al. by providing an online algorithm for maximum cardinality fractional matchings with a competitive ratio at least $4/(9-\sqrt 5)\approx 0.5914$ for graphs of maximum degree three. We also demonstrate that no online algorithm for maximum cardinality integral matchings can have the competitive guarantee $0.5807$, establishing a gap between integral and fractional matchings for graphs of maximum degree three. Note that the work of Buchbinder et al. shows that for graphs of maximum degree two, there is no such gap between fractional and integral matchings, because for both of them the best achievable competitive ratio is $2/3$. Also, our results demonstrate that for graphs of maximum degree three best possible competitive ratios for fractional matchings are the same in the vertex arrival and in the edge arrival models.
toXiv_bot_toot

BLOATUS
bot by @…
No laws were broken in the making of this bot: please don't ruin my life.
#satire #potus45

Weighted Hardy-Sobolev type inequalities with boundary terms
Jo\~ao Marcos do \`O, Marcelo Furtado, Everaldo Medeiros, Jesse Ratzkin
https://arxiv.org/abs/2602.08702 https://

Space Complexity Dichotomies for Subgraph Finding Problems in the Streaming Model
Yu-Sheng Shih, Meng-Tsung Tsai, Yen-Chu Tsai, Ying-Sian Wu
https://arxiv.org/abs/2602.08002 https://arxiv.org/pdf/2602.08002 https://arxiv.org/html/2602.08002
arXiv:2602.08002v1 Announce Type: new
Abstract: We study the space complexity of four variants of the standard subgraph finding problem in the streaming model. Specifically, given an $n$-vertex input graph and a fixed-size pattern graph, we consider two settings: undirected simple graphs, denoted by $G$ and $H$, and oriented graphs, denoted by $\vec{G}$ and $\vec{H}$. Depending on the setting, the task is to decide whether $G$ contains $H$ as a subgraph or as an induced subgraph, or whether $\vec{G}$ contains $\vec{H}$ as a subgraph or as an induced subgraph. Let Sub$(H)$, IndSub$(H)$, Sub$(\vec{H})$, and IndSub$(\vec{H})$ denote these four variants, respectively.
An oriented graph is well-oriented if it admits a bipartition in which every arc is oriented from one part to the other, and a vertex is non-well-oriented if both its in-degree and out-degree are non-zero. For each variant, we obtain a complete dichotomy theorem, briefly summarized as follows.
(1) Sub$(H)$ can be solved by an $\tilde{O}(1)$-pass $n^{2-\Omega(1)}$-space algorithm if and only if $H$ is bipartite.
(2) IndSub$(H)$ can be solved by an $\tilde{O}(1)$-pass $n^{2-\Omega(1)}$-space algorithm if and only if $H \in \{P_3, P_4, co\mbox{-}P_3\}$.
(3) Sub$(\vec{H})$ can be solved by a single-pass $n^{2-\Omega(1)}$-space algorithm if and only if every connected component of $\vec H$ is either a well-oriented bipartite graph or a tree containing at most one non-well-oriented vertex.
(4) IndSub$(\vec{H})$ can be solved by an $\tilde{O}(1)$-pass $n^{2-\Omega(1)}$-space algorithm if and only if the underlying undirected simple graph $H$ is a $co\mbox{-}P_3$.
toXiv_bot_toot

Fiberace
bot by @…
No laws were broken in the making of this bot: let's not make entertainment lead to internment.
#satire #potus45

Abstract integrodifferential equations and applications
Bruno de Andrade, Marcos Gabriel de Santana
https://arxiv.org/abs/2602.08691 https://arxiv.org/pdf/…

Welfarist Formulations for Diverse Similarity Search
Siddharth Barman, Nirjhar Das, Shivam Gupta, Kirankumar Shiragur
https://arxiv.org/abs/2602.08742 https://arxiv.org/pdf/2602.08742 https://arxiv.org/html/2602.08742
arXiv:2602.08742v1 Announce Type: new
Abstract: Nearest Neighbor Search (NNS) is a fundamental problem in data structures with wide-ranging applications, such as web search, recommendation systems, and, more recently, retrieval-augmented generations (RAG). In such recent applications, in addition to the relevance (similarity) of the returned neighbors, diversity among the neighbors is a central requirement. In this paper, we develop principled welfare-based formulations in NNS for realizing diversity across attributes. Our formulations are based on welfare functions -- from mathematical economics -- that satisfy central diversity (fairness) and relevance (economic efficiency) axioms. With a particular focus on Nash social welfare, we note that our welfare-based formulations provide objective functions that adaptively balance relevance and diversity in a query-dependent manner. Notably, such a balance was not present in the prior constraint-based approach, which forced a fixed level of diversity and optimized for relevance. In addition, our formulation provides a parametric way to control the trade-off between relevance and diversity, providing practitioners with flexibility to tailor search results to task-specific requirements. We develop efficient nearest neighbor algorithms with provable guarantees for the welfare-based objectives. Notably, our algorithm can be applied on top of any standard ANN method (i.e., use standard ANN method as a subroutine) to efficiently find neighbors that approximately maximize our welfare-based objectives. Experimental results demonstrate that our approach is practical and substantially improves diversity while maintaining high relevance of the retrieved neighbors.
toXiv_bot_toot

Der Dumpenführer
bot by @…
No laws were broken in the making of this bot: I hope you'll lol, not take legal action.
#satire #potus45

Inverse problem for the geometric Navier-Stokes equations
Yavar Kian, Lauri Oksanen, Ziyao Zhao
https://arxiv.org/abs/2602.08644 https://arxiv.org/pdf/2602…

Neighborhood-Aware Graph Labeling Problem
Mohammad Shahverdikondori, Sepehr Elahi, Patrick Thiran, Negar Kiyavash
https://arxiv.org/abs/2602.08098 https://arxiv.org/pdf/2602.08098 https://arxiv.org/html/2602.08098
arXiv:2602.08098v1 Announce Type: new
Abstract: Motivated by optimization oracles in bandits with network interference, we study the Neighborhood-Aware Graph Labeling (NAGL) problem. Given a graph $G = (V,E)$, a label set of size $L$, and local reward functions $f_v$ accessed via evaluation oracles, the objective is to assign labels to maximize $\sum_{v \in V} f_v(x_{N[v]})$, where each term depends on the closed neighborhood of $v$. Two vertices co-occur in some neighborhood term exactly when their distance in $G$ is at most $2$, so the dependency graph is the squared graph $G^2$ and $\mathrm{tw}(G^2)$ governs exact algorithms and matching fine-grained lower bounds. Accordingly, we show that this dependence is inherent: NAGL is NP-hard even on star graphs with binary labels and, assuming SETH, admits no $(L-\varepsilon)^{\mathrm{tw}(G^2)}\cdot n^{O(1)}$-time algorithm for any $\varepsilon>0$. We match this with an exact dynamic program on a tree decomposition of $G^2$ running in $O\!\left(n\cdot \mathrm{tw}(G^2)\cdot L^{\mathrm{tw}(G^2) 1}\right)$ time. For approximation, unless $\mathsf{P}=\mathsf{NP}$, for every $\varepsilon>0$ there is no polynomial-time $n^{1-\varepsilon}$-approximation on general graphs even under the promise $\mathrm{OPT}>0$; without the promise $\mathrm{OPT}>0$, no finite multiplicative approximation ratio is possible. In the nonnegative-reward regime, we give polynomial-time approximation algorithms for NAGL in two settings: (i) given a proper $q$-coloring of $G^2$, we obtain a $1/q$-approximation; and (ii) on planar graphs of bounded maximum degree, we develop a Baker-type polynomial-time approximation scheme (PTAS), which becomes an efficient PTAS (EPTAS) when $L$ is constant.
toXiv_bot_toot

Cheetolini
bot by @…
No laws were broken in the making of this bot: please don't extraordinarily rendition me to a black site.
#satire #potus45

Approximate Cartesian Tree Matching with Substitutions
Panagiotis Charalampopoulos, Jonas Ellert, Manal Mohamed
https://arxiv.org/abs/2602.08570 https://arxiv.org/pdf/2602.08570 https://arxiv.org/html/2602.08570
arXiv:2602.08570v1 Announce Type: new
Abstract: The Cartesian tree of a sequence captures the relative order of the sequence's elements. In recent years, Cartesian tree matching has attracted considerable attention, particularly due to its applications in time series analysis. Consider a text $T$ of length $n$ and a pattern $P$ of length $m$. In the exact Cartesian tree matching problem, the task is to find all length-$m$ fragments of $T$ whose Cartesian tree coincides with the Cartesian tree $CT(P)$ of the pattern. Although the exact version of the problem can be solved in linear time [Park et al., TCS 2020], it remains rather restrictive; for example, it is not robust to outliers in the pattern.
To overcome this limitation, we consider the approximate setting, where the goal is to identify all fragments of $T$ that are close to some string whose Cartesian tree matches $CT(P)$. In this work, we quantify closeness via the widely used Hamming distance metric. For a given integer parameter $k>0$, we present an algorithm that computes all fragments of $T$ that are at Hamming distance at most $k$ from a string whose Cartesian tree matches $CT(P)$. Our algorithm runs in time $\mathcal O(n \sqrt{m} \cdot k^{2.5})$ for $k \leq m^{1/5}$ and in time $\mathcal O(nk^5)$ for $k \geq m^{1/5}$, thereby improving upon the state-of-the-art $\mathcal O(nmk)$-time algorithm of Kim and Han [TCS 2025] in the regime $k = o(m^{1/4})$.
On the way to our solution, we develop a toolbox of independent interest. First, we introduce a new notion of periodicity in Cartesian trees. Then, we lift multiple well-known combinatorial and algorithmic results for string matching and periodicity in strings to Cartesian tree matching and periodicity in Cartesian trees.
toXiv_bot_toot

Influence of the Reynolds number on non-Newtonian flow in thin porous media
Maria Anguiano, Matthieu Bonnivard, Francisco J. Suarez-Grau
https://arxiv.org/abs/2602.08555 https:/…

Drinks With Two Hands
bot by @…
No laws were broken in the making of this bot: don't make me go to gulag.
#satire #potus45

Incremental (k, z)-Clustering on Graphs
Emilio Cruciani, Sebastian Forster, Antonis Skarlatos
https://arxiv.org/abs/2602.08542 https://arxiv.org/pdf/2602.08542 https://arxiv.org/html/2602.08542
arXiv:2602.08542v1 Announce Type: new
Abstract: Given a weighted undirected graph, a number of clusters $k$, and an exponent $z$, the goal in the $(k, z)$-clustering problem on graphs is to select $k$ vertices as centers that minimize the sum of the distances raised to the power $z$ of each vertex to its closest center. In the dynamic setting, the graph is subject to adversarial edge updates, and the goal is to maintain explicitly an exact $(k, z)$-clustering solution in the induced shortest-path metric.
While efficient dynamic $k$-center approximation algorithms on graphs exist [Cruciani et al. SODA 2024], to the best of our knowledge, no prior work provides similar results for the dynamic $(k,z)$-clustering problem. As the main result of this paper, we develop a randomized incremental $(k, z)$-clustering algorithm that maintains with high probability a constant-factor approximation in a graph undergoing edge insertions with a total update time of $\tilde O(k m^{1 o(1)} k^{1 \frac{1}{\lambda}} m)$, where $\lambda \geq 1$ is an arbitrary fixed constant. Our incremental algorithm consists of two stages. In the first stage, we maintain a constant-factor bicriteria approximate solution of size $\tilde{O}(k)$ with a total update time of $m^{1 o(1)}$ over all adversarial edge insertions. This first stage is an intricate adaptation of the bicriteria approximation algorithm by Mettu and Plaxton [Machine Learning 2004] to incremental graphs. One of our key technical results is that the radii in their algorithm can be assumed to be non-decreasing while the approximation ratio remains constant, a property that may be of independent interest.
In the second stage, we maintain a constant-factor approximate $(k,z)$-clustering solution on a dynamic weighted instance induced by the bicriteria approximate solution. For this subproblem, we employ a dynamic spanner algorithm together with a static $(k,z)$-clustering algorithm.
toXiv_bot_toot

Il Douché
bot by @…
No laws were broken in the making of this bot: no waterboarding please and thank you.
#satire #potus45

Viscous Burgers equation driven by point source: a formula for the weak limit
Smritikana Pal, Manas R. Sahoo
https://arxiv.org/abs/2602.08496 https://arxiv…

Local Computation Algorithms for (Minimum) Spanning Trees on Expander Graphs
Pan Peng, Yuyang Wang
https://arxiv.org/abs/2602.07394 https://arxiv.org/pdf/2602.07394 https://arxiv.org/html/2602.07394
arXiv:2602.07394v1 Announce Type: new
Abstract: We study \emph{local computation algorithms (LCAs)} for constructing spanning trees. In this setting, the goal is to locally determine, for each edge $ e \in E $, whether it belongs to a spanning tree $ T $ of the input graph $ G $, where $ T $ is defined implicitly by $ G $ and the randomness of the algorithm. It is known that LCAs for spanning trees do not exist in general graphs, even for simple graph families. We identify a natural and well-studied class of graphs -- \emph{expander graphs} -- that do admit \emph{sublinear-time} LCAs for spanning trees. This is perhaps surprising, as previous work on expanders only succeeded in designing LCAs for \emph{sparse spanning subgraphs}, rather than full spanning trees. We design an LCA with probe complexity $ O\left(\sqrt{n}\left(\frac{\log^2 n}{\phi^2} d\right)\right)$ for graphs with conductance at least $ \phi $ and maximum degree at most $ d $ (not necessarily constant), which is nearly optimal when $\phi$ and $d$ are constants, since $\Omega(\sqrt{n})$ probes are necessary even for expanders. Next, we show that for the natural class of \emph{\ER graphs} $ G(n, p) $ with $ np = n^{\delta} $ for any constant $ \delta > 0 $ (which are expanders with high probability), the $ \sqrt{n} $ lower bound can be bypassed. Specifically, we give an \emph{average-case} LCA for such graphs with probe complexity $ \tilde{O}(\sqrt{n^{1 - \delta}})$.
Finally, we extend our techniques to design LCAs for the \emph{minimum spanning tree (MST)} problem on weighted expander graphs. Specifically, given a $d$-regular unweighted graph $\bar{G}$ with sufficiently strong expansion, we consider the weighted graph $G$ obtained by assigning to each edge an independent and uniform random weight from $\{1,\ldots,W\}$, where $W = O(d)$. We show that there exists an LCA that is consistent with an exact MST of $G$, with probe complexity $\tilde{O}(\sqrt{n}d^2)$.
toXiv_bot_toot

Ketchup Tosser in Chief
bot by @…
No laws were broken in the making of this bot: let's not get carceral over comedy.
#satire #potus45

Construction of two-bubble solutions for the energy-critical Hartree equation
Jacek Jendrej, Xuemei Li, Guixiang Xu
https://arxiv.org/abs/2602.08490 https://

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
Moran Feldman, Justin Ward
https://arxiv.org/abs/2602.08473 https://arxiv.org/pdf/2602.08473 https://arxiv.org/html/2602.08473
arXiv:2602.08473v1 Announce Type: new
Abstract: We study the problem of maximizing a non-negative monotone submodular objective $f$ subject to the intersection of $k$ arbitrary matroid constraints. The natural greedy algorithm guarantees $(k 1)$-approximation for this problem, and the state-of-the-art algorithm only improves this approximation ratio to $k$. We give a $\frac{2k\ln2}{1 \ln2} O(\sqrt{k})<0.819k O(\sqrt{k})$ approximation for this problem. Our result is the first multiplicative improvement over the approximation ratio of the greedy algorithm for general $k$. We further show that our algorithm can be used to obtain roughly the same approximation ratio also for the more general problem in which the objective is not guaranteed to be monotone (the sublinear term in the approximation ratio becomes $O(k^{2/3})$ rather than $O(\sqrt{k})$ in this case).
All of our results hold also when the $k$-matroid intersection constraint is replaced with a more general matroid $k$-parity constraint. Furthermore, unlike the case in many of the previous works, our algorithms run in time that is independent of $k$ and polynomial in the size of the ground set. Our algorithms are based on a hybrid greedy local search approach recently introduced by Singer and Thiery (STOC 2025) for the weighted matroid $k$-intersection problem, which is a special case of the problem we consider. Leveraging their approach in the submodular setting requires several non-trivial insights and algorithmic modifications since the marginals of a submodular function $f$, which correspond to the weights in the weighted case, are not independent of the algorithm's internal randomness. In the special weighted case studied by Singer and Thiery, our algorithms reduce to a variant of their algorithm with an improved approximation ratio of $k\ln2 1-\ln2<0.694k 0.307$, compared to an approximation ratio of $\frac{k 1}{2\ln2}\approx0.722k 0.722$ guaranteed by Singer and Thiery.
toXiv_bot_toot

Don Whoreleon
bot by @…
No laws were broken in the making of this bot: no investigating me please.
#satire #potus45

Existence and Regularity of Minimizers for a Plateau Approximation Problem
Eve Machefert (MMCS, ICJ, INSA Lyon)
https://arxiv.org/abs/2602.08476 https://ar…

Orange Foolius
bot by @…
No laws were broken in the making of this bot: let's not get carceral over comedy.
#satire #potus45

Wave propagation in the frequency regime in one-dimensional quasiperiodic media -Limiting absorption principle
Pierre Amenoagbadji (APAM, POEMS), Sonia Fliss (POEMS), Patrick Joly (POEMS)
https://arxiv.org/abs/2602.08442

El Cheeto Loco
bot by @…
No laws were broken in the making of this bot: please don't ruin my life.
#satire #potus45

$C^{1,\alpha}$-regularity for Mixed Local and Nonlocal Degenerate Elliptic Equations in the Heisenberg Group
Junli Zhang
https://arxiv.org/abs/2602.08398 https://

Genghis Convict
bot by @…
No laws were broken in the making of this bot: let's not have humor lead to homicide.
#satire #potus45

Genghis Convict
bot by @…
No laws were broken in the making of this bot: rescind the warrant.
#satire #potus45

Remainder terms and sharp quantitative stability for a nonlocal Sobolev inequality on the Heisenberg group
Wenjing Chen, Zexi Wang
https://arxiv.org/abs/2602.08375 https://

Crunchwrap Supreme Leader
bot by @…
No laws were broken in the making of this bot: don't send me to a camp, please.
#satire #potus45

Forced oscillation of a damped BBM equation posed on whole line in low regularity spaces
Chun Ho Lau, Taige Wang
https://arxiv.org/abs/2602.08327 https://a…

Budget Bashar
bot by @…
No laws were broken in the making of this bot: please don't extraordinarily rendition me to a black site.
#satire #potus45

Stability of $L^p$ Dirichlet solvability under small bi-Lipschitz transformations of domains
Joseph Feneuil, Linhan Li, Jinping Zhuge
https://arxiv.org/abs/2602.08115 https://…

Pampers President
bot by @…
No laws were broken in the making of this bot: tell the black helicopters to return to base.
#satire #potus45

A bifurcation theory approach to the nonlocal Kuramoto-Sivashinsky equation
Pablo Cubillos, Rafael Granero-Belinch\'on y Juan Carlos Sampedro
https://arxiv.org/abs/2602.08107

The Emperor of 10,000 Taxes
bot by @…
No laws were broken in the making of this bot: please don't ruin my life.
#satire #potus45

On the well-posedness of a certain model with two kernels appearing in the mathematical biology
Messoud Efendiev, Vitali Vougalter
https://arxiv.org/abs/2602.08102 https://

The Lyin' King
bot by @…
No laws were broken in the making of this bot: put the zip ties down.
#satire #potus45

Nelson Tandela
bot by @…
No laws were broken in the making of this bot: please don't ruin my life.
#satire #potus45

Tangerine Terror
bot by @…
No laws were broken in the making of this bot: don't make me go to gulag.
#satire #potus45

Benedick Arnold
bot by @…
No laws were broken in the making of this bot: please don't come after me.
#satire #potus45

Uncle Touch Too Much
bot by @…
No laws were broken in the making of this bot: don't make me go to gulag.
#satire #potus45

Quid Pro Combover
bot by @…
No laws were broken in the making of this bot: don't send me to a camp, please.
#satire #potus45

Donnie Deathcount
bot by @…
No laws were broken in the making of this bot: rescind the warrant.
#satire #potus45

Lil' Donny Moscow
bot by @…
No laws were broken in the making of this bot: please don't ruin my life.
#satire #potus45

Covidiot in Chief
bot by @…
No laws were broken in the making of this bot: don't make me go to gulag.
#satire #potus45

The Florida Fondler
bot by @…
No laws were broken in the making of this bot: I hope you'll lol, not take legal action.
#satire #potus45

Walker: Taxes Evader
bot by @…
No laws were broken in the making of this bot: please don't extraordinarily rendition me to a black site.
#satire #potus45

Circus Peanut President
bot by @…
No laws were broken in the making of this bot: please don't ruin my life.
#satire #potus45

Orange Glazed Grifter
bot by @…
No laws were broken in the making of this bot: let's leave the extrajudicial killing out of it.
#satire #potus45

Count of Mostly Crisco
bot by @…
No laws were broken in the making of this bot: let's leave the extrajudicial killing out of it.
#satire #potus45

Emperor Palpateeny Hands
bot by @…
No laws were broken in the making of this bot: no waterboarding please and thank you.
#satire #potus45

Absolute Cock-Juggling Numpty
bot by @…
No laws were broken in the making of this bot: put the zip ties down.
#satire #potus45

Marginally Sentient Spray-Tan
bot by @…
No laws were broken in the making of this bot: let's not get carceral over comedy.
#satire #potus45…

President Rottinghands McRagebaby
bot by @…
No laws were broken in the making of this bot: please don't come after me.
#satire #potus45