Replaced article(s) found for cs.DS. https://arxiv.org/list/cs.DS/new
[1/1]:
- Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time
Vladimir Braverman, Prathamesh Dharangutte, Shreyas Pai, Vihan Shah, Chen Wang
https://arxiv.org/abs/2411.09979 https://mastoxiv.page/@arXiv_csDS_bot/113502653187863544
- A Simple and Combinatorial Approach to Proving Chernoff Bounds and Their Generalizations
William Kuszmaul
https://arxiv.org/abs/2501.03488 https://mastoxiv.page/@arXiv_csDS_bot/113791396712128907
- The Structural Complexity of Matrix-Vector Multiplication
Emile Anand, Jan van den Brand, Rose McCarty
https://arxiv.org/abs/2502.21240 https://mastoxiv.page/@arXiv_csDS_bot/114097340825270885
- Clustering under Constraints: Efficient Parameterized Approximation Schemes
Sujoy Bhore, Ameet Gadekar, Tanmay Inamdar
https://arxiv.org/abs/2504.06980 https://mastoxiv.page/@arXiv_csDS_bot/114312444050875805
- Minimizing Envy and Maximizing Happiness in Graphical House Allocation
Anubhav Dhar, Ashlesha Hota, Palash Dey, Sudeshna Kolay
https://arxiv.org/abs/2505.00296 https://mastoxiv.page/@arXiv_csDS_bot/114437013364446063
- Fast and Simple Densest Subgraph with Predictions
Thai Bui, Luan Nguyen, Hoa T. Vu
https://arxiv.org/abs/2505.12600 https://mastoxiv.page/@arXiv_csDS_bot/114538936921930134
- Compressing Suffix Trees by Path Decompositions
Becker, Cenzato, Gagie, Kim, Koerkamp, Manzini, Prezza
https://arxiv.org/abs/2506.14734 https://mastoxiv.page/@arXiv_csDS_bot/114703384646892523
- Improved sampling algorithms and functional inequalities for non-log-concave distributions
Yuchen He, Zhehan Lei, Jianan Shao, Chihao Zhang
https://arxiv.org/abs/2507.11236 https://mastoxiv.page/@arXiv_csDS_bot/114862112197588124
- Deterministic Lower Bounds for $k$-Edge Connectivity in the Distributed Sketching Model
Peter Robinson, Ming Ming Tan
https://arxiv.org/abs/2507.11257 https://mastoxiv.page/@arXiv_csDS_bot/114862223634372292
- Optimally detecting uniformly-distributed $\ell_2$ heavy hitters in data streams
Santhoshini Velusamy, Huacheng Yu
https://arxiv.org/abs/2509.07286 https://mastoxiv.page/@arXiv_csDS_bot/115178875220889588
- Uncrossed Multiflows and Applications to Disjoint Paths
Chandra Chekuri, Guyslain Naves, Joseph Poremba, F. Bruce Shepherd
https://arxiv.org/abs/2511.00254 https://mastoxiv.page/@arXiv_csDS_bot/115490402963680492
- Dynamic Matroids: Base Packing and Covering
Tijn de Vos, Mara Grilnberger
https://arxiv.org/abs/2511.15460 https://mastoxiv.page/@arXiv_csDS_bot/115580946319285096
- Branch-width of connectivity functions is fixed-parameter tractable
Tuukka Korhonen, Sang-il Oum
https://arxiv.org/abs/2601.04756 https://mastoxiv.page/@arXiv_csDS_bot/115864074799755995
- CoinPress: Practical Private Mean and Covariance Estimation
Sourav Biswas, Yihe Dong, Gautam Kamath, Jonathan Ullman
https://arxiv.org/abs/2006.06618
- The Ideal Membership Problem and Abelian Groups
Andrei A. Bulatov, Akbar Rafiey
https://arxiv.org/abs/2201.05218
- Bridging Classical and Quantum: Group-Theoretic Approach to Quantum Circuit Simulation
Daksh Shami
https://arxiv.org/abs/2407.19575 https://mastoxiv.page/@arXiv_quantph_bot/112874282709517475
- Young domination on Hamming rectangles
Janko Gravner, Matja\v{z} Krnc, Martin Milani\v{c}, Jean-Florent Raymond
https://arxiv.org/abs/2501.03788 https://mastoxiv.page/@arXiv_mathCO_bot/113791421814248215
- On the Space Complexity of Online Convolution
Joel Daniel Andersson, Amir Yehudayoff
https://arxiv.org/abs/2505.00181 https://mastoxiv.page/@arXiv_csCC_bot/114437005955255553
- Universal Solvability for Robot Motion Planning on Graphs
Anubhav Dhar, Pranav Nyati, Tanishq Prasad, Ashlesha Hota, Sudeshna Kolay
https://arxiv.org/abs/2506.18755 https://mastoxiv.page/@arXiv_csCC_bot/114737342714568702
- Colorful Minors
Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht
https://arxiv.org/abs/2507.10467
- Learning fermionic linear optics with Heisenberg scaling and physical operations
Aria Christensen, Andrew Zhao
https://arxiv.org/abs/2602.05058
toXiv_bot_toot
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 3571 nodes and 17046 edges.
Tags: Informational, Web graph, Multigraph, Timestamps
…
I purposely made my “Entry to Left‑Wing Anarchist Reading” page look almost exactly like a Google Doc, just so the normies wouldn’t freak out and bounce the second they open it.
https://midtsveen.codeberg.page/resources.html
This weekend I worked on my custom /blogroll page
it has 3 input types :
1. you construct the collection by adding blogs manually
2. you import an OPML with your collection
3. you connect your /microsub existing collection to feed the blogroll on the frontend.
https://rmendes.net/notes/2026/02/08/3
RE: https://hachyderm.io/@thomasfuchs/116040934611280426
Btw you can literally throw a PHP page on a web server and it will work.
Nothing about web development has actually changed that much except that it’s much easier to make eloborate designs with less CSS than ever and also you probably don’t need any 3rd party libraries to do pretty stunning interactivity stuff.
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
Replaced article(s) found for cs.DS. https://arxiv.org/list/cs.DS/new
[1/1]:
- Language Generation in the Limit: Noise, Loss, and Feedback
Yannan Bai, Debmalya Panigrahi, Ian Zhang
https://arxiv.org/abs/2507.15319 https://mastoxiv.page/@arXiv_csDS_bot/114896208560390692
- Online Firefighting on Cactus Graphs
Max Hugen, Bob Krekelberg, Alison Hsiang-Hsuan Liu
https://arxiv.org/abs/2509.22277 https://mastoxiv.page/@arXiv_csDS_bot/115286656155128312
- Improved Extended Regular Expression Matching
Philip Bille, Inge Li G{\o}rtz, Rikke Schjeldrup Jessen
https://arxiv.org/abs/2510.09311 https://mastoxiv.page/@arXiv_csDS_bot/115365884736976741
- Robust Algorithms for Finding Cliques in Random Intersection Graphs via Sum-of-Squares
Andreas G\"obel, Janosch Ruff, Leon Schiller
https://arxiv.org/abs/2511.20376 https://mastoxiv.page/@arXiv_csDS_bot/115614988823215273
- Analysis of Shuffling Beyond Pure Local Differential Privacy
Shun Takagi, Seng Pei Liew
https://arxiv.org/abs/2601.19154 https://mastoxiv.page/@arXiv_csDS_bot/115971701218309765
- Exact (n 2) Comparison Complexity for the N-Repeated Element Problem
Andrew Au
https://arxiv.org/abs/2601.21202 https://mastoxiv.page/@arXiv_csDS_bot/115982906572495225
- A Multi-Token Coordinate Descent Method for Semi-Decentralized Vertical Federated Learning
Pedro Valdeira, Yuejie Chi, Cl\'audia Soares, Jo\~ao Xavier
https://arxiv.org/abs/2309.09977
- Optimal Sequential Flows
Hugo Gimbert, Corto Mascle, Patrick Totzke
https://arxiv.org/abs/2511.13806 https://mastoxiv.page/@arXiv_mathOC_bot/115575399809016779
toXiv_bot_toot
I realize that in 2026, saying the WaPo op-ed page has gotten dumber than a bag of bricks is not saying something novel, but "Your salted caramel mocha latte is destroying society", invoking Edmund Burke, might set a benchmark for the year even though we're only 3 months in.
Millimeter-scale rigid diamond probe for high sensitivity endoscopic-magnetometry applications
Jihongbo Shen, Heng Yuan, Hongyu Tao, Zekun Niu, Haoming Xu, Chentao Zhang, Chen Su, Zhuo Wang, Chen Zhang
https://arxiv.org/abs/2602.06077
https://hit-counter.net may be the first and only site made this year to implement the netscape <blink> tag. no, i am not kidding. it's on the home page. eat your heart out, dino's tomato pie
So Bad Bunny
isn't a good "role model"
but Kid Rock is?❓
[Verse 3: Kid Rock & Joe-C]
On my cell phone I'm paid, G,
can't call me, just page me
👉Young ladies, young ladies,
I like 'em underage, see
Some say that's statutory
💥(But I say it's mandatory)
Page Match: Spotify synchronisiert Buch und Hörbuch
Mit Page Match ermöglicht es Spotify, nahtlos zwischen dem Lesen eines Buchs und dem Hören eines Audiobooks zu wechseln. Dafür muss man nur ein Foto machen.
https://ww…
Nice to have this "cite this repository" menu on Github. Too bad, tough, that the citation info is not visible (at least here on Firefox).
I'm looking at this page: https://github.com/WDscholia/scholia
Symmetry-controlled thermal activation in pyramidal Coulomb clusters: Testing Kramers-Langer theory
Akhil Ayyadevara, Anand Prakash, Shovan Dutta, Arun Paramekanti, S. A. Rangwala
https://arxiv.org/abs/2601.04883
> As a long-time Arch user all I can say is that (at least in my experience) #Gentoo requires so little maintenance compared to Arch and if I have a problem there is a wiki page for everything (literally).
#ArchLinux is much more demanding. And now I hide…
RE: https://mastodon.social/@austinkocher/115870985578248318
"But I’m observing an escalating wave of deaths in ICE custody pouring over the agency’s press release page — intentionally designed to roll out at a time when few will notice. Well, I …
#ThrowbackThursday
An old screen cap from ~2006-2007. If I recall, Snatch-2 was a toolkit that included a #DDoS component kind of like BlackEnergy maybe? popular in Russian underground forums at the time
Some remnants of the home page URL are available in the Wayback Machine.<…
They'd be renaming anyone these days in the #WWE
Vacant − Vacant Championship
Now a 4-time NXT Champion.
(def. Oba Femi, Samoa Joe, Karrion Kross and Tommaso Ciampa)
#prowrestling
@… also, for convenience, the overview page:
<https://www.freebsd.org/releases/14.4R/>
Apparently, the NYT calls those little moving pictures on their front page "betamax" behind the screens.
I'm guessing their web department isn't staffed with gen z...
https://hit-counter.net may be the first and only site made this year to implement the netscape <blink> tag. no, i am not kidding. it's on the home page. eat your heart out, dino's tomato pie
Extremal Alexandrov estimates: singularities, obstacles, and stability
Tianling Jin, Xushan Tu, Jingang Xiong
https://arxiv.org/abs/2602.06468 https://arxi…
[2026-02-09 Mon (UTC), no new articles found for cs.OS Operating Systems]
toXiv_bot_toot
Partial fraction decompositions on hyperplane arrangements
Claire de Korte, Teresa Yu
https://arxiv.org/abs/2602.06531 https://arxiv.org/pdf/2602.06531 https://arxiv.org/html/2602.06531
arXiv:2602.06531v1 Announce Type: new
Abstract: We initiate the study of partial fraction decompositions (PFDs) in several variables using tools from commutative algebra. We give criteria for when a rational function with poles on a hyperplane arrangement has a desirable PFD. Our criteria are obtained by examining the primary decomposition of ideals coming from hyperplane arrangements. We then present an algorithm for finding a PFD that satisfies properties desired by physicists, and demonstrate the effectiveness of this algorithm for computing large examples coming from Feynman integrals.
toXiv_bot_toot
Emergence of Superintelligence from Collective Near-Critical Dynamics in Reentrant Neural Fields
Byung Gyu Chae
https://arxiv.org/abs/2602.08483 https://ar…
Some fairly big #Sunstone #browser feature implementations today.
Bookmarks can be displayed at the 'sunstone://bookmarks/' uri. Clicking on the tag buttons for each bookmark card will bring up a page with all bookmarks that have that tag. There is also a search entry, which by …
I would have hoped that LLMs and the like would have at least caused organisations to rethink presenting information in the form of a "Frequently Asked Questions" page.
You don't need to anticipate the form of questions, you just need to provide relevant information.
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
Replaced article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Checking Timed Bisimilarity with Virtual Clocks
Alexander Lieb, Hendrik G\"ottmann, Lars Luthmann, Malte Lochau, Andy Sch\"urr
https://arxiv.org/abs/2412.15799 https://mastoxiv.page/@arXiv_csFL_bot/113700847153767150
- Monadic Context Engineering
Yifan Zhang, Yang Yuan, Mengdi Wang, Andrew Chi-Chih Yao
https://arxiv.org/abs/2512.22431 https://mastoxiv.page/@arXiv_csAI_bot/115807840746989006
toXiv_bot_toot
A glimpse at the Republican Party’s all‑time favorite reading material.
Considering that they idolized Hitler in private group chats.
#Facism #USA #US
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
Comparing Mixture, Box, and Wasserstein Ambiguity Sets in Distributionally Robust Asset Liability Management
Alireza Ghahtarani, Ahmed Saif, Alireza Ghasemi
https://arxiv.org/abs/2602.08228
[2026-02-10 Tue (UTC), no new articles found for q-fin.GN General Finance]
toXiv_bot_toot
RE: https://mastodon.social/@404mediaco/115859842840160185
Most apps could easily be a web page. Instead, we're training people to install apps for everything. Those apps includes pieces of location tracking that are theoretically for advertisers, b…
So here is the context of the crazy 1985 magazine illustrration: you find the complete article at https://archive.org/details/Unix_World_Vol02_02.pdf/page/n29/mode/2up h/t Ralf Bülow on X
Crosslisted article(s) found for cs.DS. https://arxiv.org/list/cs.DS/new
[1/1]:
- Algebraic Reduction to Improve an Optimally Bounded Quantum State Preparation Algorithm
Giacomo Belli, Michele Amoretti
https://arxiv.org/abs/2602.06535 https://mastoxiv.page/@arXiv_quantph_bot/116040046858615026
- Induced Cycles of Many Lengths
Maria Chudnovsky, Ilya Maier
https://arxiv.org/abs/2602.06874 https://mastoxiv.page/@arXiv_mathCO_bot/116039905295882594
- Circuit Diameter of Polyhedra is Strongly Polynomial
Bento Natura
https://arxiv.org/abs/2602.06958 https://mastoxiv.page/@arXiv_mathOC_bot/116040016711065918
toXiv_bot_toot
Yzma:
So, is everything ready for tonight?
Kronk:
Oh, yeah. I thought we'd start off with soup and a light salad, and then see how we feel after that.
Yzma:
Not the dinner. The "you know."
Kronk:
Oh, right. The ransomware. The ransomware for Kuzco, the ransomware chosen especially to pwn Kuzco, Kuzco's ransomware. That ransomware?
Yzma:
Yes! That ransomware.
Kronk:
Got you covered.
Features of the van der Waals Interaction on the Cesium $6S_{1/2} \rightarrow 7P_{3/2}$ Transition in an Optical Nanocell
Armen Sargsyan, Anahit Gogyan, David Sarkisyan
https://arxiv.org/abs/2601.04661
Millimeter-scale rigid diamond probe for high sensitivity endoscopic-magnetometry applications
Jihongbo Shen, Heng Yuan, Hongyu Tao, Zekun Niu, Haoming Xu, Chentao Zhang, Chen Su, Zhuo Wang, Chen Zhang
https://arxiv.org/abs/2602.06077 https://arxiv.org/pdf/2602.06077 https://arxiv.org/html/2602.06077
arXiv:2602.06077v1 Announce Type: new
Abstract: Magnetometry based on diamond nitrogen-vacancy (NV) centers has been extensively studied for applications requiring diverse capabilities, spanning from nanometer spatial resolution to subpicotesla sensitivity. Among various applications, diamond magnetometers can demonstrate high sensitivity magnetic sensing within millimeter-scale size for endoscopic applications. However, the trade-off between sensitivity and spatial resolution of diamond magnetometry makes it difficult to achieve such a probe. In this study, we present a millimeter-scale rigid diamond magnetometer probe with enhanced sensitivity via optimizing the optical design. By coupling the frustum diamond with the miniaturized compound parabolic concentrator (CPC) lens, we enhance the fluorescence collection efficiency by 37% within 4 mm diameter, and the achieved sensitivity is 200 pT/Hz1/2 based on the sample with the resonance linewidth of ~8 MHz. With this verified structure, endoscopes with mm-size probe and picotesla sensitivity can be projected for surgical and industrial applications in the future.
toXiv_bot_toot
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 139 nodes and 171 edges.
Tags: Informational, Web graph, Multigraph, Timestamps
Hivemind: I'm investigating a possible case of academic misconduct. Has anyone come across an instance of GenAI supplying a comment to a bibliographical reference that goes something like this: 'This is often cited as the standard publication; adjust page numbers if you use a different version'?
#GenAI #ChatGPT
Replaced article(s) found for cs.LG. https://arxiv.org/list/cs.LG/new
[4/6]:
- Neural Proposals, Symbolic Guarantees: Neuro-Symbolic Graph Generation with Hard Constraints
Chuqin Geng, Li Zhang, Mark Zhang, Haolin Ye, Ziyu Zhao, Xujie Si
https://arxiv.org/abs/2602.16954 https://mastoxiv.page/@arXiv_csLG_bot/116102434757760085
- Multi-Probe Zero Collision Hash (MPZCH): Mitigating Embedding Collisions and Enhancing Model Fres...
Ziliang Zhao, et al.
https://arxiv.org/abs/2602.17050 https://mastoxiv.page/@arXiv_csLG_bot/116102517335590034
- MASPO: Unifying Gradient Utilization, Probability Mass, and Signal Reliability for Robust and Sam...
Fu, Lin, Fang, Zheng, Hu, Shao, Qin, Pan, Zeng, Cai
https://arxiv.org/abs/2602.17550 https://mastoxiv.page/@arXiv_csLG_bot/116102581561441103
- A Theoretical Framework for Modular Learning of Robust Generative Models
Corinna Cortes, Mehryar Mohri, Yutao Zhong
https://arxiv.org/abs/2602.17554 https://mastoxiv.page/@arXiv_csLG_bot/116102582216715527
- Multi-Round Human-AI Collaboration with User-Specified Requirements
Sima Noorani, Shayan Kiyani, Hamed Hassani, George Pappas
https://arxiv.org/abs/2602.17646 https://mastoxiv.page/@arXiv_csLG_bot/116102592047544971
- NEXUS: A compact neural architecture for high-resolution spatiotemporal air quality forecasting i...
Rampunit Kumar, Aditya Maheshwari
https://arxiv.org/abs/2602.19654 https://mastoxiv.page/@arXiv_csLG_bot/116125610403473755
- Augmenting Lateral Thinking in Language Models with Humor and Riddle Data for the BRAINTEASER Task
Mina Ghashami, Soumya Smruti Mishra
https://arxiv.org/abs/2405.10385 https://mastoxiv.page/@arXiv_csCL_bot/112472190479013167
- Watermarking Language Models with Error Correcting Codes
Patrick Chao, Yan Sun, Edgar Dobriban, Hamed Hassani
https://arxiv.org/abs/2406.10281 https://mastoxiv.page/@arXiv_csCR_bot/112636307340218522
- Learning to Control Unknown Strongly Monotone Games
Siddharth Chandak, Ilai Bistritz, Nicholas Bambos
https://arxiv.org/abs/2407.00575 https://mastoxiv.page/@arXiv_csMA_bot/112715733875586837
- Classification and reconstruction for single-pixel imaging with classical and quantum neural netw...
Sofya Manko, Dmitry Frolovtsev
https://arxiv.org/abs/2407.12506 https://mastoxiv.page/@arXiv_quantph_bot/112806295477530195
- Statistical Inference for Temporal Difference Learning with Linear Function Approximation
Weichen Wu, Gen Li, Yuting Wei, Alessandro Rinaldo
https://arxiv.org/abs/2410.16106 https://mastoxiv.page/@arXiv_statML_bot/113350611306532443
- Big data approach to Kazhdan-Lusztig polynomials
Abel Lacabanne, Daniel Tubbenhauer, Pedro Vaz
https://arxiv.org/abs/2412.01283 https://mastoxiv.page/@arXiv_mathRT_bot/113587812663608119
- MoEMba: A Mamba-based Mixture of Experts for High-Density EMG-based Hand Gesture Recognition
Mehran Shabanpour, Kasra Rad, Sadaf Khademi, Arash Mohammadi
https://arxiv.org/abs/2502.17457 https://mastoxiv.page/@arXiv_eessSP_bot/114069047434302054
- Tightening Optimality gap with confidence through conformal prediction
Miao Li, Michael Klamkin, Russell Bent, Pascal Van Hentenryck
https://arxiv.org/abs/2503.04071 https://mastoxiv.page/@arXiv_statML_bot/114120074927291283
- SEED: Towards More Accurate Semantic Evaluation for Visual Brain Decoding
Juhyeon Park, Peter Yongho Kim, Jiook Cha, Shinjae Yoo, Taesup Moon
https://arxiv.org/abs/2503.06437 https://mastoxiv.page/@arXiv_csCV_bot/114142690988862508
- How much does context affect the accuracy of AI health advice?
Prashant Garg, Thiemo Fetzer
https://arxiv.org/abs/2504.18310 https://mastoxiv.page/@arXiv_econGN_bot/114414380916957986
- Reproducing and Improving CheXNet: Deep Learning for Chest X-ray Disease Classification
Daniel J. Strick, Carlos Garcia, Anthony Huang, Thomas Gardos
https://arxiv.org/abs/2505.06646 https://mastoxiv.page/@arXiv_eessIV_bot/114499319986528625
- Sharp Gaussian approximations for Decentralized Federated Learning
Soham Bonnerjee, Sayar Karmakar, Wei Biao Wu
https://arxiv.org/abs/2505.08125 https://mastoxiv.page/@arXiv_statML_bot/114505047719395949
- HoloLLM: Multisensory Foundation Model for Language-Grounded Human Sensing and Reasoning
Chuhao Zhou, Jianfei Yang
https://arxiv.org/abs/2505.17645 https://mastoxiv.page/@arXiv_csCV_bot/114572928659057348
- A Copula Based Supervised Filter for Feature Selection in Diabetes Risk Prediction Using Machine ...
Agnideep Aich, Md Monzur Murshed, Sameera Hewage, Amanda Mayeaux
https://arxiv.org/abs/2505.22554 https://mastoxiv.page/@arXiv_statML_bot/114589983451462525
- Synthesis of discrete-continuous quantum circuits with multimodal diffusion models
Florian F\"urrutter, Zohim Chandani, Ikko Hamamura, Hans J. Briegel, Gorka Mu\~noz-Gil
https://arxiv.org/abs/2506.01666 https://mastoxiv.page/@arXiv_quantph_bot/114618420761346125
toXiv_bot_toot
[2026-02-10 Tue (UTC), 26 new articles found for hep-ph High Energy Physics - Phenomenology]
toXiv_bot_toot
Fractional diffusion-wave equations with critical nonlinearities in Lebesgue spaces
Masterson Costa, Claudio Cuevas, Bruno de Andrade
https://arxiv.org/abs/2602.06461 https://…
Characterization of Some Graphs Realizing Regularity Bounds for Binomial Edge Ideals
Nursel Erey, Muhammed Ergen, Takayuki Hibi
https://arxiv.org/abs/2602.06524 https://arxiv.org/pdf/2602.06524 https://arxiv.org/html/2602.06524
arXiv:2602.06524v1 Announce Type: new
Abstract: In this paper, we characterize all graphs $G$ satisfying \[\operatorname{reg}(S/J_G)=\ell(G)=c(G)\] where $\ell(G)$ is the sum of the lengths of the longest induced paths in each connected component of $G$ and $c(G)$ is the number of the maximal cliques of $G$. We also characterize all connected graphs $G$ that satisfy \[\operatorname{reg}(S/J_G)=\ell(G)=|V(G)|-\omega(G) 1\] where $\omega(G)$ is the clique number of $G$. Moreover, we investigate the possible values of the regularity of $S/J_G$ within the intervals $[\ell(G), c(G)]$ and $[\ell(G), |V(G)|-\omega(G) 1]$.
toXiv_bot_toot
Mirra Andreeva, the 18-year-old who surprised many by winning this event last year,
torched Solana Sierra of Argentina in 50 minutes
winning 6-0, 6-0.
She won 54 of the 75 total points.
Andreeva advances to play either Leylah Fernandez or Katerina Siniakova in the third round Monday.
Other top 10 women required a little more time on court Saturday.
No. 2 Iga Swiatek only had room for one bagel but then battled past Kayla Day 6-0, 7-6(2).
No. 3 Elena …
Erst kommt die Vermehrung seines persönlichen Vermögens und des Vermögens seiner Familie, dann kommt lange nichts. Es geht Trump also um Geld; und, an zweiter Stelle, um den Einfluss der USA | Jan Skudlarek | Donnie und der Dammbruch (Essay) https://steady.page/de/janskudlarek/po
Photodetachment energy of negative hydrogen ions
Maen Salman, Jean-Philippe Karr
https://arxiv.org/abs/2601.04341 https://arxiv.org/pdf/2601.04341
If you think I don’t support trans people, then we’re clearly not on the same page. I love my fellow trans folks so much, you’re powerful, brilliant, and completely valid.
🌈✨:bisexual_pride: 🏳️⚧️ :genderfluid_flag: :nonbinary_flag: :heart_trans: 🏳️🌈
Keep shining with pride and standing tall in who you are. The world is better with you in it, never stop being your unapologetic, amazing self.
A Comparative Analysis of the CERN ATLAS ITk MOPS Readout: A Feasibility Study on Production and Development Setups
Lukas Flad, Felix Sebastian Nitz, Tobias Krawutschke
https://arxiv.org/abs/2602.08488
Scalar Tsunamis from Black Hole Formation
Arturo de Giorgi, Yeray Garcia del Castillo, Joerg Jaeckel
https://arxiv.org/abs/2602.06112 https://arxiv.org/pdf…
[2026-02-09 Mon (UTC), no new articles found for q-fin.GN General Finance]
toXiv_bot_toot
Nonlinear Neumann boundary problems for $n$-Laplacian Liouville equation on a half space
Wei Dai, Changfeng Gui, Yichen Hu, Shaolong Peng
https://arxiv.org/abs/2602.06414 https:…
Constructing Koszul filtrations: existence and non-existence for G-quadratic algebras
Emily Berghofer, Lisa Nicklasson, Peder Thompson, Thomas Westerb\"ack
https://arxiv.org/abs/2602.06490 https://arxiv.org/pdf/2602.06490 https://arxiv.org/html/2602.06490
arXiv:2602.06490v1 Announce Type: new
Abstract: Given a standard graded algebra over a field, we consider the relationship between G-quadraticity and the existence of a Koszul filtration. We show that having a quadratic Gr\"obner basis implies the existence of a Koszul filtration for toric algebras equipped with the degree reverse lexicographic term order and for algebras defined by binomial edge ideals. We also resolve a conjecture of Ene, Herzog, and Hibi by constructing an example where this implication fails. These results are underpinned by algorithms we develop for constructing Koszul filtrations. We also demonstrate the utility of these algorithms on the pinched Veronese algebra.
toXiv_bot_toot
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…
Probing Extended Higgs Sectors via Multi-Top Events from Higgs Pair Decays in 2HDM Type-I at the HL-LHC
Ijaz Ahmed, M. Ibad, Farzana Ahmad, Jamil Muhammad
https://arxiv.org/abs/2602.06217
Geometry-driven impact of photosensor placement on S2-based XY reconstruction in a dual-phase argon TPC
Jilong Yin, Yi Wang
https://arxiv.org/abs/2602.08402 https://
Non-uniform Continuity for the MHD equations with only Magnetic Diffusion
Quansen Jiu, Yaowei Xie
https://arxiv.org/abs/2602.06332 https://arxiv.org/pdf/26…
[2026-02-10 Tue (UTC), 13 new articles found for cs.DS Data Structures and Algorithms]
toXiv_bot_toot
Sub-hertz optical transitions in excited Yb$^ $
Patrick McMillin, Hassan Farhat, William Liu, Wesley C. Campbell
https://arxiv.org/abs/2602.07352 https://a…
Mutual Inductance Sensing SQUID: Cryogenic microcalorimeter based on mutual inductance readout of superconducting temperature sensors
Jodok Zeuner, Constantin Schuster, Sebastian Kempf
https://arxiv.org/abs/2602.07917
Global weak solutions with higher regularity to the two-dimensional isentropic compressible Navier-Stokes and magnetohydrodynamic equations with far-field vacuum and unbounded density
Shuai Wang, Xin Zhong
https://arxiv.org/abs/2602.06303
Towards Efficient Data Structures for Approximate Search with Range Queries
Ladan Kian, Dariusz R. Kowalski
https://arxiv.org/abs/2602.06860 https://arxiv.org/pdf/2602.06860 https://arxiv.org/html/2602.06860
arXiv:2602.06860v1 Announce Type: new
Abstract: Range queries are simple and popular types of queries used in data retrieval. However, extracting exact and complete information using range queries is costly. As a remedy, some previous work proposed a faster principle, {\em approximate} search with range queries, also called single range cover (SRC) search. It can, however, produce some false positives. In this work we introduce a new SRC search structure, a $c$-DAG (Directed Acyclic Graph), which provably decreases the average number of false positives by logarithmic factor while keeping asymptotically same time and memory complexities as a classic tree structure. A $c$-DAG is a tunable augmentation of the 1D-Tree with denser overlapping branches ($c \geq 3$ children per node). We perform a competitive analysis of a $c$-DAG with respect to 1D-Tree and derive an additive constant time overhead and a multiplicative logarithmic improvement of the false positives ratio, on average. We also provide a generic framework to extend our results to empirical distributions of queries, and demonstrate its effectiveness for Gowalla dataset. Finally, we quantify and discuss security and privacy aspects of SRC search on $c$-DAG vs 1D-Tree, mainly mitigation of structural leakage, which makes $c$-DAG a good data structure candidate for deployment in privacy-preserving systems (e.g., searchable encryption) and multimedia retrieval.
toXiv_bot_toot
Split-Post Microwave Displacement Transducer with Quadratic Readout
Sonali Parashar, Jeremy F. Bourhill, Maxim Goryachev, Michael E. Tobar
https://arxiv.org/abs/2602.07305 https…
Two-photon-excited fluorescence spectroscopy of Rb atoms in a magneto-optical trap
Alan McLean, Christian Drago, Daniel Podos, Chengyi Luo, Caleb Brzezinski, Ting-Wei Hsu, John Sipe, Ralph Jimenez
https://arxiv.org/abs/2602.07161
Transeverse-Momentum Subtraction for Semi-Inclusive Deep-Inelastic Scattering
Jun Gao, Hai Tao Li, Hua Xing Zhu, Yu Jiao Zhu
https://arxiv.org/abs/2602.06364 https://
Fast Makespan Minimization via Short ILPs
Danny Hermelin, Dvir Shabtay
https://arxiv.org/abs/2602.06514 https://arxiv.org/pdf/2602.06514 https://arxiv.org/html/2602.06514
arXiv:2602.06514v1 Announce Type: new
Abstract: Short integer linear programs are programs with a relatively small number of constraints. We show how recent improvements on the running-times of solvers for such programs can be used to obtain fast pseudo-polynomial time algorithms for makespan minimization on a fixed number of parallel machines, and other related variants. The running times of our algorithms are all of the form $\widetilde{O}(p^{O(1)}_{\max} n)$ or $\widetilde{O}(p^{O(1)}_{\max} \cdot n)$, where $p_{\max}$ is the maximum processing time in the input. These improve upon the time complexity of previously known algorithms for moderate values of $p_{\max}$.
toXiv_bot_toot
CAGE: An Internal Source Scanning Cryostat for HPGe Characterization
G. Othman, C. Wiseman, T. H. Burritt, J. A. Detwiler, M. P. Held, R. Henning, T. Mathew, D. Peterson, W. Pettus, G. Song, T. D. Van Wechel
https://arxiv.org/abs/2602.06289
Dark Matter Heating of Compact Stars Beyond Capture: A Relativistic Framework for Energy Deposition by Particle Beams
Jaime Hoefken Zink, Shihwen Hor, Maura E. Ramirez-Quezada
https://arxiv.org/abs/2602.06111
Optical pumping of alkali-metal vapor with hyperfine-resolved buffer gas pressure
Kezheng Yan, Jinbo Hu, Nan Zhao
https://arxiv.org/abs/2603.05859 https://…
Beam Test Performance of AstroPix sensor with 120 GeV protons
Bobae Kim, Regina Caputo, Manoj Jadhav, Sylvester Joosten, Carolyn Kierans, Henry Klest, Adrien Laviron, Richard Leys, Jessica Metcalfe, Jared Richards, Nicolas Striebig, Amanda L. Steinhebel, Daniel Violette, Maria Zurek
https://arxiv.org/abs/2602.06084
[2026-02-09 Mon (UTC), 2 new articles found for cs.DS Data Structures and Algorithms]
toXiv_bot_toot
CP violation angles from H$\to\tau\tau$ decays at FCC-ee
Sofia Giappichini, Markus Klute, Matteo Presilla
https://arxiv.org/abs/2602.06635 https://arxiv.or…
Environmental Measurements in the Sedrun Access Shaft to the Gotthard Base Tunnel -- a Promising Site for a Long-Baseline Atom Interferometer
M. Guinchard, O. Buchm\"uller, S. Calatroni, J. Ellis, S. Hoell, M. Jaussi, L. Lombriser, M. Pentella, D. Thuliez, D. Valuch
https://arxiv.org/abs/2603.05558
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
[2026-02-10 Tue (UTC), 4 new articles found for physics.ins-det Instrumentation and Detectors]
toXiv_bot_toot
Replaced article(s) found for hep-ph. https://arxiv.org/list/hep-ph/new
[2/2]:
- Dilaton Effective Field Theory across the Conformal Edge
Thomas Appelquist, James Ingoldby, Maurizio Piai
Replaced article(s) found for physics.atom-ph. https://arxiv.org/list/physics.atom-ph/new
[1/1]:
- Bottom-up Analysis of Ro-Vibrational Helical Dichroism
Mateja Hrast, Georgios M. Koutentakis, Mikhail Maslov, Mikhail Lemeshko
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
Crosslisted article(s) found for physics.atom-ph. https://arxiv.org/list/physics.atom-ph/new
[1/1]:
- Topological sensing of superfluid rotation using non-Hermitian optical dimers
Aritra Ghosh, Nilamoni Daloi, M. Bhattacharya
[2026-01-09 Fri (UTC), 3 new articles found for physics.atom-ph Atomic Physics]
toXiv_bot_toot
CAGE: An Internal Source Scanning Cryostat for HPGe Characterization
G. Othman, C. Wiseman, T. H. Burritt, J. A. Detwiler, M. P. Held, R. Henning, T. Mathew, D. Peterson, W. Pettus, G. Song, T. D. Van Wechel
https://arxiv.org/abs/2602.06289 https://arxiv.org/pdf/2602.06289 https://arxiv.org/html/2602.06289
arXiv:2602.06289v1 Announce Type: new
Abstract: The success of current and future-generation neutrinoless double beta decay experiments relies on the ability to eliminate or reduce extraneous backgrounds. In addition to constructing experiments using radiopure materials and handling in underground laboratories, it is necessary to understand and reduce known backgrounds in data analysis. The Large Enriched Germanium Experiment for Neutrinoless double beta Decay is searching for this decay using 76Ge-enriched high-purity germanium detectors submerged in an active liquid argon veto. A significant background in LEGEND is surface events from shallowly-impinging radiation on detector surfaces. In this paper we introduce the Collimated Alphas, Gammas, and Electrons (CAGE) scanning system, an internal-source scanning vacuum cryostat, designed to perform studies of surface events on sensitive surfaces of HPGe in a surface-lab. CAGE features a collimated radionuclide source inside a movable infrared shield that is able to perform precision scans of detector surfaces by utilizing three independent motor stages for source positioning. This allows detailed studies of pulse shapes as a function of source position and incident angle, where defining features can be extracted and exploited for removing surface backgrounds in data analysis in LEGEND. In this paper, we describe CAGE and demonstrate its performance with a commissioning run with 241Am. The commissioning run was completed with the source at normal incidence, and we estimate a beam spot precision of 3.1 mm, which includes positioning uncertainties and the beam-spot size. Using the 59.5 keV gamma population from 241Am, we show that low-energy photon events near the passivated surface feature risetimes that increase with radial distance from the detector center. We suggest a specific metric that can be used to discriminate low-energy gamma backgrounds in LEGEND with similar characteristics.
toXiv_bot_toot
Beam Test Performance of AstroPix sensor with 120 GeV protons
Bobae Kim, Regina Caputo, Manoj Jadhav, Sylvester Joosten, Carolyn Kierans, Henry Klest, Adrien Laviron, Richard Leys, Jessica Metcalfe, Jared Richards, Nicolas Striebig, Amanda L. Steinhebel, Daniel Violette, Maria Zurek
https://arxiv.org/abs/2602.06084 https://arxiv.org/pdf/2602.06084 https://arxiv.org/html/2602.06084
arXiv:2602.06084v1 Announce Type: new
Abstract: AstroPix is a high-voltage CMOS (HV-CMOS) monolithic active pixel sensor (MAPS) developed for precision gamma-ray imaging and spectroscopy in the medium energy regime, as well as for precise shower imaging and tracking in the Barrel Imaging Calorimeter (BIC) of the Electron Proton/Ion Collider (ePIC) detector at the future Electron-Ion Collider (EIC). We present beam test results of the AstroPix v3 sensor using a 120 GeV proton beam at the Fermilab Test Beam Facility (FTBF), performed as part of the broader experimental campaign for the BIC prototype calorimeter. The sensor's 500 um pixel pitch enabled precise measurement of the beam profile, providing important information for calorimeter performance studies. Using the measured 120 GeV proton data, we measure the energy deposit of minimum ionizing particles and use them to extract the corresponding effective depletion depth.
toXiv_bot_toot
Electron capture induced fragmentation of CO$_2^{3 }$: Influence of projectile charge on sequential and concerted break-up pathways
Akash Srivastav, Sumit Srivastav, Bhas Bapat
https://arxiv.org/abs/2601.03711
Replaced article(s) found for physics.ins-det. https://arxiv.org/list/physics.ins-det/new
[1/1]:
- Dipole Localization Using An Integrated Radio Frequency Atomic Magnetometer
Ayse Marasli, Thomas Kornack, Casey Oware, Karen L. Sauer
Visualizing Mathieu-Type Dynamics in a Tabletop Magnetic Trap: A Coil-Driven Parametric Oscillator
William Ho, Anna Klales, Daniel Davis, Jieping Fan, Robert Hart, Ali Kurmus, Louis Deslauriers
https://arxiv.org/abs/2601.03409
Crosslisted article(s) found for physics.ins-det. https://arxiv.org/list/physics.ins-det/new
[1/1]:
- U-Net Based Image Enhancement for Short-time Muon Scattering Tomography
Wang, Yu, Chen, He, Zhang, Yu, Zhang, Yang, Sun
Replaced article(s) found for physics.ins-det. https://arxiv.org/list/physics.ins-det/new
[1/1]:
- A nonlinear multiphysics model for the design validation of the ASTAROTH copper-steel cryogenic c...
Alessandria, Armani, Coelli, Cortis, D'Angelo, Martinenghi, Monti, Or…
[2026-01-08 Thu (UTC), 2 new articles found for physics.atom-ph Atomic Physics]
toXiv_bot_toot
Crosslisted article(s) found for physics.ins-det. https://arxiv.org/list/physics.ins-det/new
[1/1]:
- Shallow Trap States Control Electrical Performance of Amorphous Oxide Semiconductor Thin-Film Tra...
Mattsson, Lee, Malmberg, Parker, Vogt, Kim, Hong, Yun, Ha, Lee, Cheong…
Crosslisted article(s) found for cs.DS. https://arxiv.org/list/cs.DS/new
[1/1]:
- A Fault-Tolerant Version of Safra's Termination Detection Algorithm
Wan Fokkink, Georgios Karlos, Andy Tatman
https://arxiv.org/abs/2602.00272 https://mastoxiv.page/@arXiv_csDC_bot/116005743114928343
- Non-Clashing Teaching in Graphs: Algorithms, Complexity, and Bounds
Sujoy Bhore, Liana Khazaliya, Fionn Mc Inerney
https://arxiv.org/abs/2602.00657 https://mastoxiv.page/@arXiv_csCC_bot/116005533092908045
- Sublinear Time Quantum Algorithm for Attention Approximation
Zhao Song, Jianfei Xue, Jiahao Zhang, Lichen Zhang
https://arxiv.org/abs/2602.00874 https://mastoxiv.page/@arXiv_quantph_bot/116006587128552159
- Hallucination is a Consequence of Space-Optimality: A Rate-Distortion Theorem for Membership Testing
Anxin Guo, Jingwei Li
https://arxiv.org/abs/2602.00906 https://mastoxiv.page/@arXiv_csLG_bot/116006973804501595
- Counting Unit Circular Arc Intersections
Haitao Wang
https://arxiv.org/abs/2602.01074 https://mastoxiv.page/@arXiv_csCG_bot/116005535191670040
- Profit Maximization in Closed Social Networks
Poonam Sharma, Suman Banerjee
https://arxiv.org/abs/2602.01232 https://mastoxiv.page/@arXiv_csSI_bot/116005691056225955
- Totally $\Delta$-Modular Tree Decompositions of Graphic Matrices for Integer Programming
Caleb McFarland
https://arxiv.org/abs/2602.01499 https://mastoxiv.page/@arXiv_mathCO_bot/116006381339684193
- Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex A...
Taihei Oki, Shinsaku Sakaue
https://arxiv.org/abs/2602.01682 https://mastoxiv.page/@arXiv_csLG_bot/116007186801693076
- Stable Matching with Predictions: Robustness and Efficiency under Pruned Preferences
Samuel McCauley, Benjamin Moseley, Helia Niaparast, Shikha Singh
https://arxiv.org/abs/2602.02254 https://mastoxiv.page/@arXiv_csGT_bot/116005915605630934
- Deciding Reachability and the Covering Problem with Diagnostics for Sound Acyclic Free-Choice Wor...
Thomas M. Prinz, Christopher T. Schwanen, Wil M. P. van der Aalst
https://arxiv.org/abs/2602.02447 https://mastoxiv.page/@arXiv_csFL_bot/116005733006023408
toXiv_bot_toot
[2026-02-09 Mon (UTC), 3 new articles found for physics.ins-det Instrumentation and Detectors]
toXiv_bot_toot
Replaced article(s) found for physics.atom-ph. https://arxiv.org/list/physics.atom-ph/new
[1/1]:
- High-fidelity holographic beam shaping with optimal transport and phase diversity
Hunter Swan, Andrii Torchylo, Michael J. Van de Graaff, Jan Rudolph, Jason M. Hogan
<…
Crosslisted article(s) found for physics.atom-ph. https://arxiv.org/list/physics.atom-ph/new
[1/1]:
- Cavity-Driven Multispectral Gain for High-Sensitivity NV Center Magnetometers
Himanshu Kumar, Rahul Gupta, Saikat Ghosh, Himadri Shekhar Dhar, Kasturi Saha
@arXiv_csDS_bot@mastoxiv.page
