Tootfinder

If you hate that largely pointless LinkedIn sidebar:
```
.scaffold-layout__aside {
display: none;
}
.scaffold-layout--reflow .scaffold-layout__content--sidebar-main-aside {
grid-template-areas: "sidebar main main";
}
```
Because I was forced to use LinkedIn today.

Ah... what better way to start a Saturday morning at 5:20am then getting into a discussion of the capitalization of "Internet" on a #Wikipedia Talk page! 🤣
https://en.wik…

I don't care how long that Wikipedia page is, one Wikipedia pages does not make a rabbit hole.

Reconstructing resonant phase oscillator interactions from noisy time series
Bengi D\"onmez, Bob Rink
https://arxiv.org/abs/2605.08993 https://arxiv.o…

Trump and Netanyahu Are No Longer on the Same Page (W.J. Hennigan/New York Times)
https://www.nytimes.com/2026/03/11/opinion/iran-trump-netanyahu-israel.html
http://www.memeorandum.com/260312/p6#a260312p6

Bumsrakete Exploit.
And Comic Sans Cruelty
#freebsd #exploit

Axios' total Q1 content output was down 22% YoY, but page views rose 30% and page views per visitor rose 22%, as the outlet shifts away from chasing traffic (Charlotte Tobitt/Press Gazette)
https://pressgazette.co.uk/north-america/axios-page-views-…

Output down, page views up: Axios shifts from volume to value
Axios cut its output by almost a quarter to concentrate on adding "real value" and stop chasing traffic - but page views grew anyway.

Segment-Wise Soft Robotics Inspired Flexible Antenna Arrays: Design and Optimization
Shuaishuai Han, Konstantinos Ntougias, Elio Faddoul, Ioannis Krikidis
https://arxiv.org/abs/2606.11771 https://arxiv.org/pdf/2606.11771 https://arxiv.org/html/2606.11771
arXiv:2606.11771v1 Announce Type: new
Abstract: In this paper, we propose a segment-wise soft robotic antenna (SRA) system, where each soft robotic arm referred to as a tentacle, comprises multiple independently controllable segments with bending, elongation-retraction, and sweeping motions. By adjusting segment motion parameters, the positions of surface-mounted antennas are reconfigured, distinguishing it from conventional reconfigurable antenna (RA) systems. Based on this model, we propose two antenna deployment schemes: the segmented end-antenna configuration (SEAC), where fixed antennas are mounted at the segment ends and reconfigured via segment motions; and the hybrid end-and-intermediate antenna configuration (HEIAC), where RAs are further integrated as intra-segment antennas. In HEIAC, soft-robot segment deformation provides large-scale spatial reconfiguration, while RAs enable fine-grained adjustment. For SEAC, we formulate a sum-rate maximization problem accounting for inter-segment connectivity and the nonlinear mapping from segment deformation parameters to antenna coordinates, and develop a penalty dual decomposition-projected gradient ascent (PDD-PGA) algorithm. For HEIAC, we jointly optimize segment deformation, intra-segment antenna positions, and antenna activation using a block coordinate descent (BCD)-PDD-PGA algorithm with greedy backward antenna selection. Simulation results demonstrate that the proposed schemes substantially outperform fixed-position antenna arrays and conventional RA baselines. In particular, SEAC and HEIAC achieve 37.9% and 32.1% sum-rate gains over conventional 3D reconfigurable arrays, respectively, while SEAC provides up to a 49.3% gain in compact array deployments.
toXiv_bot_toot

Berry's phase under topology change
Pavel Kurasov, Vladislav Shubin, Axel Tibbling
https://arxiv.org/abs/2605.10798 https://arxiv.org/pdf/2605.10798 https://arxiv.org/html/2605.10798
arXiv:2605.10798v1 Announce Type: new
Abstract: Laplacians on metric graphs are used to construct continuous families of Hamiltonians with different topological structure. One such family is used to demonstrate that Hamiltonians with real-valued eigenfunctions may possess non-trivial geometric Berry's phase. Connections between non-trivial Berry's phase and topology change are discussed.
toXiv_bot_toot

Photon Cycling and Laser Cooling of an Asymmetric Top Molecule
Grace K. Li, Giseok Lee, Jack Mango, Hana Lampson, YongWoong Lee, Winston Wang, Avikar Periwal, Nathaniel B. Vilas, Alexander Frenett, Lo\"ic Anderegg, John M. Doyle
https://arxiv.org/abs/2606.12323

“You opened this page. It already knows the following.”
https://sinceyouarrived.world/taken

taken.
A web page that tells you what your browser gave away the moment you arrived. No login, no form, no permission. Most pages do this. None of them tell you.

Every side is claiming compliance with the ceasefire while accusing the other of escalation
And it is impossible to determine which complaints are valid without a written, mutually-agreed-upon ceasefire document.
https://skywriter.blue/@thestudyofwar.bsky.social/3mj5sd5…

[2026-05-11 Mon (UTC), no new articles found for math.KT K-Theory and Homology]
toXiv_bot_toot

271 Years Before #Pantone, an Artist Mixed and Described Every #Color Imaginable in an 800-Page #Book:

271 Years Before Pantone, an Artist Mixed and Described Every Color Imaginable in an 800-Page Book
In 1692 an artist known only as “A. Boogert” sat down to write a book in Dutch about mixing watercolors. Not only would he begin the book with a bit about the use of color in painting, but would go on to explain how to create certain hues and change the tone by adding one,Continue reading "271 Years Before Pantone, an Artist Mixed and Described Every Color Imaginable in an 800-Page Book"

My CSS skills will always let me make a recipe I found on some random web site print to a single page, and nobody can take that away from me.

[2026-05-12 Tue (UTC), 1 new article found for nlin.CD Chaotic Dynamics]
toXiv_bot_toot

For 9 years I have had a monthly membership (read: "donation") to The Guardian online. Despite its flaws it has been better than most and I do think journalists should be paid. One day some months back they blocked the entire site on me attempting to load it (even though I was logged in) with a page complaining that I had an ad [actually tracker] blocker on and I should purchase something called "Guardian Ad-Lite", priced €5.00 (which was less than my membership) to pay f…

The intellectual coherence of the Veep:
https://www.theguardian.com/world/live/202

Latent Secret Spin: Keyed Orthogonal Rotations for Blind Speech Watermarking in Anisotropic Latent Spaces
Emma Coletta, Massimiliano Todisco, Michele Panariello, Antonio Faonio, Nicholas Evans
https://arxiv.org/abs/2605.08431 https://arxiv.org/pdf/2605.08431 https://arxiv.org/html/2605.08431
arXiv:2605.08431v1 Announce Type: new
Abstract: We introduce Latent Secret Spin (LSS), a blind speech watermarking method based on geometric operations in codec latent space. Based upon orthogonal rotations to principal components, LSS induces imperceptible but detectable covariance signatures according to a pseudo-random watermarking schedule. The scheme generalises across datasets, preserves perceptual quality and, unlike some learned, neural watermarking schemes, it does not require neural network training, is resistant to common signal manipulations and is flexible to payload size. Analyses show that structured latent-space watermarking is a promising and interpretable alternative to existing approaches.
toXiv_bot_toot

Omics Data Discovery Agents
Alexandre Hutton, Jesse G. Meyer
https://arxiv.org/abs/2603.10161 https://arxiv.org/pdf/2603.10161

Trump Cuts Off Interview With 'Meet The Press' Host Kristen Welker
https://deadline.com/2026/06/trump-storms-off-meet-the-press-kristen-welker-1236949183/comment-page-2/#comments

This book cover design drives me nuts.
It looks great but the cover is cut off to let the first page be visible at the edge. That is disturbingly annoying to flip through.

Verschwörungstheorien sind kein Randphänomen mehr – Prof. Jan Skudlarek zeigt im Interview, wie sie bis ins konservativ-bürgerliche Milieu reichen. Das Erschreckende: Radikalisierung beginnt oft mit echten, legitimen Bedürfnissen. Einsamkeit und Orientierungslosigkeit als Einstiegspunkte. #Verschwörungstheorien

📰 Einem US-amerikanischen Konzern Geld aus der Tasche zu leiern, um damit Hosting-Rechnungen zu bezahlen, kann man machen.
Aber viel schöner und besser ist die Unterstützung durch die Community.
Dank Euch kann ich die Amazon-Affiliate-Links jetzt schrittweise löschen. Dauert, aber das Jahr ist noch jung. 😁
Bitte unterstütze meine Arbeit weiterhin mit einer #Steady-Fördermitglied…

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

Quite happy with how the page/component lifecycle log messages are coming along as part of my push to get the new stateful components over the line in Kitten¹.
This should make it very easy to ensure that things are happening as you think they are and to conceptualise the behaviour of your stateful component hierarchies. (You can also use stateless components, of course, as is the currently documented workflow.)
¹

The intellectual coherence of the Veep:
https://www.theguardian.com/world/live/202

Non-special Divisors, LCPs of Codes, and LCD Codes on Kummer Extensions
Huachao Zhang, Chang-An Zhao
https://arxiv.org/abs/2606.11764 https://arxiv.org/pdf/2606.11764 https://arxiv.org/html/2606.11764
arXiv:2606.11764v1 Announce Type: new
Abstract: Recently, constructions of linear complementary pairs (LCPs) of codes and linear complementary dual (LCD) codes on function fields have attracted considerable attention due to the wide range of applications of these codes. Such constructions rely on non-special divisors of degrees $g$ and $g-1$. In this work, we investigate Kummer extensions defined by $y^m = f(x)$ with $f(x)\in\mathbb{F}_q(x)$ and establish an arithmetic characterization of non-special divisors whose support can contain non-totally ramified places. Based on this characterization, we explicitly construct non-special divisors of degree $g-1$ on the GK curve. Moreover, utilizing pure gaps, we explicitly provide several families of effective non-special divisors of degree $g$ on Kummer extensions with the same multiplicities. We then develop a general framework for constructing LCPs of algebraic geometry (AG) codes on Kummer extensions. By virtue of canonical divisors, we show that the security parameters of LCPs of AG codes can be determined within this framework, which also enables the construction of LCD AG codes. Finally, we illustrate our results with representative examples, including LCPs of codes on the GK curve and LCD codes on quotients of the Hermitian curve.
toXiv_bot_toot

[2026-05-12 Tue (UTC), 1 new article found for math.SP Spectral Theory]
toXiv_bot_toot

Limit on the nuclear Schiff moment of europium-153
Bassam Nima, Mingyu Fan, Xubo Wang, Sen Wang, En Fu Zhou, Andrew M. Jayich, Jiang Ming Yao, Lan Cheng, Amar Vutha
https://arxiv.org/abs/2606.12084

Um …. ACME Supermarkets? Why are Hebrew National hot dogs in Personal Care / Health? Am I using them wrong?
#ACME #Albertsons #HebrewNational

[2026-05-11 Mon (UTC), no new articles found for nlin.CD Chaotic Dynamics]
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 286 nodes and 1002 edges.
Tags: Informational, Web gra…

Crosslisted article(s) found for cs.GT. https://arxiv.org/list/cs.GT/new
[1/1]:
- Insurance of Agentic AI
Quanyan Zhu
https://arxiv.org/abs/2606.05449 https://mastoxiv.page/@arXiv_csAI_bot/116696535801623005
- Bitcoin After Block Rewards
Junhyuk Lee
https://arxiv.org/abs/2606.05503 https://mastoxiv.page/@arXiv_csCR_bot/116696457548098249
- Online Min-Cost Matching with General Arrivals
Josh Ascher, Eric Balkanski, Jason Chatzitheodorou, Vasilis Gkatzelis
https://arxiv.org/abs/2606.05546 https://mastoxiv.page/@arXiv_csDS_bot/116696483136717005
- Measuring Concentration of Power in Approval Voting Games
Takaaki Abe
https://arxiv.org/abs/2606.05655 https://mastoxiv.page/@arXiv_econTH_bot/116696378312014137
- Learning to Contest: Decentralized Robust Fairness in Cooperative MARL via Cross-Attention
Can Savc{\i}
https://arxiv.org/abs/2606.06162 https://mastoxiv.page/@arXiv_csMA_bot/116696376542763270
- Regret Minimization with Adaptive Opponents in Repeated Games
Mingyang Liu, Asuman Ozdaglar, Tiancheng Yu, Kaiqing Zhang
https://arxiv.org/abs/2606.06486
toXiv_bot_toot

yep

There's a statistical test called Page's trend test, for testing whether a predicted *ordering* holds — so it would be funny if it were to get renamed to "Page's rank".
https://en.wikipedia.org/wiki/Page's_trend_test

Vision-Language-Action Models Meet World Models: Embodied Agentic AI for Low-Altitude Wireless Networks
Feibo Jiang, Li Dong, Lei Mao, Kezhi Wang, Cunhua Pan, Dong In Kim, Naofal Al-Dhahir
https://arxiv.org/abs/2606.11618 https://arxiv.org/pdf/2606.11618 https://arxiv.org/html/2606.11618
arXiv:2606.11618v1 Announce Type: new
Abstract: Low-Altitude Wireless Networks (LAWNs), composed of Unmanned Aerial Vehicles (UAVs) and other aerial platforms, provide integrated perception, communication, and computation services in low-altitude airspace. However, deploying large generative models in this domain faces three major challenges: 1) Limited embodied action mapping; 2) Inadequate physical environment modeling; 3) Insufficient closed-loop optimization. To address these challenges, this study proposes an Embodied Agentic UAV framework. Centered on a Vision-Language-Action (VLA) model as the execution core, the framework establishes an end-to-end embodied decision-making pipeline from multimodal environmental perception to continuous control generation. In addition, a World Model (WM) is introduced to capture the coupling between UAV actions and environmental state evolution, thereby supporting environment prediction, policy verification, and dynamic optimization. Furthermore, memory and reflection mechanisms are incorporated to form an adaptive closed-loop optimization paradigm of decision, execution, evaluation, and update, thereby enhancing the system's autonomous decision-making capability and continual evolution ability in complex dynamic environments. Experimental results validate its effectiveness in enabling robust, predictive, and sustainable autonomous control in LAWNs.
toXiv_bot_toot

Quantum Ergodicity on large hyperbolic surfaces for local and pseudolocal operators
Nalini Anantharaman, Soumyajit Saha
https://arxiv.org/abs/2605.07696 https://arxiv.org/pdf/2605.07696 https://arxiv.org/html/2605.07696
arXiv:2605.07696v1 Announce Type: new
Abstract: We prove a quantum ergodicity theorem for sequences of closed hyperbolic surfaces converging to the Poincar\'e disc in the Benjamini-Schramm sense. Assuming a uniform lower bound on the injectivity radius and a spectral gap, we establish vanishing of quantum variance on fixed spectral windows for a class of observables that contains differential operators and finite-propagation smooth operators. This generalises a result of Le Masson and Sahlsten from scalar observables to both local and 'pseudolocal' operator settings.
toXiv_bot_toot

Ambiguity-Free Inertial Measurement with Multi-Wavelength Atom Interferometry
Wei-Chen Jia, Yue Xin, Ke Shen, Yan-Ying Feng
https://arxiv.org/abs/2606.11747 https://

[2026-06-05 Fri (UTC), no new articles found for math.AT Algebraic Topology]
toXiv_bot_toot

"Do you need a liberal education? We say that it is unpatriotic not to read these books."
""The death of democracy is not likely to be an assassination from ambush. It will be a slow extinction from apathy, indifference, and undernourishment."
Robert M Hutchins (of Great Books fame)

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

Latent Secret Spin: Keyed Orthogonal Rotations for Blind Speech Watermarking in Anisotropic Latent Spaces
Emma Coletta, Massimiliano Todisco, Michele Panariello, Antonio Faonio, Nicholas Evans
https://arxiv.org/abs/2605.08431

[2026-03-12 Thu (UTC), 1 new article found for q-bio.GN Genomics]
toXiv_bot_toot

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

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

Maximizing Connectivity of Uplink RIS-Assisted UAV Networks
Mohammed Saif, Shahrokh Valaee
https://arxiv.org/abs/2606.11523 https://arxiv.org/pdf/2606.11523 https://arxiv.org/html/2606.11523
arXiv:2606.11523v1 Announce Type: new
Abstract: In this paper, we present a new approach for unmanned aerial vehicle (UAV) positioning and reconfigurable intelligent surface (RIS) partitioning to enhance connectivity of uplink RIS-assisted UAV networks. To achieve this, our approach optimizes RIS-aided link selection, RIS partitioning, and UAV positions to maximize network connectivity characterized by its Fiedler value. Meanwhile, it maintains a specific signal-to-interference plus noise ratio (SINR) constraint for user equipment (UE), which is influenced by RIS partitioning and UAV reliability. The network connectivity optimization problem is formulated using the Fiedler value subject to RIS elements allocation and SINR constraints. This problem is a computationally expensive combinatorial optimization, necessitating an efficient iterative approach. In particular, we propose a perturbation method for RIS-aided link selection, and derive a closed-form solution for RIS partitioning, with each partition tailored to optimize SINR for individual UAV. For the given RIS-aided links and RIS partitioning, we then show that the problem of UAV positioning can be formulated as a low complexity semi-definite programming (SDP) optimization problem, which can be solved using off-the-shelf CVX solvers. Our simulations show the potential gain of UAV positioning and RIS partitioning compared to the benchmark schemes from the literature.
toXiv_bot_toot

Crosslisted article(s) found for nlin.CD. https://arxiv.org/list/nlin.CD/new
[1/1]:
- Growth of small localized perturbations in Surface Quasi-Geostrophic turbulence
V. J. Valad\~ao, M. Cencini, F. De Lillo, S. Musacchio, G. Boffetta

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

Manuela Hoelterhoff, who won a 1983 Pulitzer for arts criticism at the WSJ and later wrote a book about the backstage world of opera, died on Wednesday at 77 (Tim Page/New York Times)
https://www.nytimes.com/2026/05/07/arts/music/manuela-hoelterhoff-dead.html

Manuela Hoelterhoff, Pulitzer-Winning Arts Critic, Dies at 77
She won the top journalism honor for criticism while with The Wall Street Journal. She later wrote a wry, perceptive book about the backstage world of opera.

The Roberts Court Takes a Page from Plessy v. Ferguson (Pema Levy/Mother Jones)
https://www.motherjones.com/politics/2026/05/supreme-court-callais-louisiana-plessy-ferguson/
http://www.memeorandum.com/260507/p50#a260507p50

Joint Movable Antenna Positioning and RIS Partitioning for Sum-Rate Maximization
Mohammed Saif
https://arxiv.org/abs/2606.11519 https://arxiv.org/pdf/2606.11519 https://arxiv.org/html/2606.11519
arXiv:2606.11519v1 Announce Type: new
Abstract: This paper investigates the utility of the movable antenna (MA) and reconfigurable intelligent surface (RIS) framework for downlink wireless communications. In the considered scenario, a base station (BS) is equipped with two sub-arrays of MAs transmits signals to the users via the RIS. By jointly exploiting the antenna-positioning flexibility of MAs and the RIS element selection capability, the proposed joint MA-RIS framework introduces additional design degrees of freedom to enhance desired signals and mitigate inter-user interference, thereby maximizing the network sum-rate. To this end, we formulate a joint optimization problem involving MA positioning, sub-array beamforming, and RIS element selection, subject to the minimum antenna separation and transmit power constraints. The resulting problem is highly non-convex and challenging to solve directly. To address this issue, an alternating optimization framework is developed that decomposes the problem into three tractable subproblems. Specifically, zero-forcing beamforming is employed for transmit beamformer design, a low-complexity one-dimensional search is derived for RIS element selection, and the MA positioning problem is solved using block coordinate descent (BCD) and convex optimization techniques implemented via CVX. Simulation results demonstrate that the proposed joint MA-RIS framework significantly improves the achievable sum-rate compared with conventional fixed MAs and benchmark schemes with random configurations.
toXiv_bot_toot

Crosslisted article(s) found for nlin.CD. https://arxiv.org/list/nlin.CD/new
[1/1]:
- Breakdown of Adiabatic Scaling and Noise-Induced Functional Synchronization in Deeply Quiescent E...
Yefan Wu

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

Replaced article(s) found for cs.GT. https://arxiv.org/list/cs.GT/new
[1/1]:
- Best-of-Both-Worlds Fairness of the Envy-Cycle-Elimination Algorithm
Jugal Garg, Eklavya Sharma
https://arxiv.org/abs/2410.08986 https://mastoxiv.page/@arXiv_csGT_bot/113304502509503455
- Deterministic-Allocation and Anonymous Joint Advertising in E-commerce Platforms
Zhen Zhang, Luowen Liu, Wanzhi Zhang, Zitian Guo, Kun Huang, Qi Qi, Qianlong Xie, Xingxing Wang
https://arxiv.org/abs/2506.02435 https://mastoxiv.page/@arXiv_csGT_bot/114623889823025585
- Chance-Constrained Correlated Equilibria for Robust Noncooperative Coordination
Jaehan Im, Ufuk Topcu, David Fridovich-Keil
https://arxiv.org/abs/2603.14141 https://mastoxiv.page/@arXiv_csGT_bot/116243473506703974
- The Stability of Online Algorithms in Performative Prediction
Gabriele Farina, Juan Carlos Perdomo
https://arxiv.org/abs/2602.24207 https://mastoxiv.page/@arXiv_csLG_bot/116159080059392879
toXiv_bot_toot

Lifted Gabidulin Construction for LDPC Representations of Finite Geometry Codes
Yifei Shen, Andreas Burg
https://arxiv.org/abs/2606.11454 https://arxiv.org/pdf/2606.11454 https://arxiv.org/html/2606.11454
arXiv:2606.11454v1 Announce Type: new
Abstract: Finite geometry (FG) codes combine the algebraic properties of classical block codes with the iterative belief propagation (BP) decoding ability of low-density parity-check~(LDPC) codes. However, exploiting both advantages in practice is hindered by the fact that the standard incidence matrix between $(\mu 1)$-flats and points is dense and contains many short cycles for any flat dimension $\mu\geq 1$. In this work, we propose to sparsify the decoding matrix based on pencil selection, formulated as a constant-dimension subspace packing problem and solved explicitly using lifted Gabidulin codes. For both affine and projective geometries, sparse parity-check matrices are constructed and verified for FG codes of lengths up to $1024$. Simulations on four FG codes show no visible error floor and around $0.5$~dB gain over corresponding 5G LDPC codes at a block error rate of $10^{-7}$.
toXiv_bot_toot

Carrier Revival in Long Trapped-Ion Chains
Florian Egli, Chris Shanks, James Bounds, Jorge Moreno, Muhammad Thariq, Erdem Yilmaz, Theodor W. H\"ansch, Thomas Udem, Akira Ozawa
https://arxiv.org/abs/2605.07942

edit_wikiquote: Wikiquote edits (2010)
A bipartite user-page network extracted from Wikiquotes. 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 5046 nodes and 42321 edges.
Tags: Informational, Web graph, Multigraph, Timestamps

Maximum Coverage Chase Decoder for Optical Interconnects
Alessandro Cardinale, Wenqing Song, Bin Chen, Alex Alvarado, Andreas Burg, Yifei Shen
https://arxiv.org/abs/2606.11401 https://arxiv.org/pdf/2606.11401 https://arxiv.org/html/2606.11401
arXiv:2606.11401v1 Announce Type: new
Abstract: We propose a low-complexity Chase decoder for optical interconnects that formulates test pattern selection as a generalized maximum coverage problem. For concatenated RS-BCH and oFEC codes, our decoder achieves the standard Chase decoding performance with 25% and 61.3% fewer test patterns, respectively.
toXiv_bot_toot

$J=0$ metastable state of $\mathrm{Th}^{2 }$ for a hyperfine-free nuclear clock
S. Sagar Maurya, V. Lal, J. Tiedau, M. V. Okhapkin, E. Peik
https://arxiv.org/abs/2605.07802 http…

Color-Rule-Function Encoding for Combinatorial Memory
Alexander Khitun
https://arxiv.org/abs/2606.11365 https://arxiv.org/pdf/2606.11365 https://arxiv.org/html/2606.11365
arXiv:2606.11365v1 Announce Type: new
Abstract: Combinatorial memory is a class of memory in which information is encoded in the set of paths through a structured mesh. In this work, we introduce a systematic encoding framework, referred to as the Color-Rule-Function (CRF) approach, for representing information in combinatorial memory. The method consists of four key steps: selecting a sequence of paths in the mesh, assigning values (e.g., colors) to each cell, defining a set of rules based on the values encountered along each path, and constructing a Boolean function that determines the state of each path. . The coding procedure is illustrated by several examples. The design space scales of the CRF scale fundamentally faster compared to conventional memory. This apparent advantage arises from the use of rule-based and functional representations but is accompanied by increased hardware complexity. A possible hardware realization of the CRF framework is discussed. Importantly, the hardware overhead can be substantially reduced through the use of customized modules. The examples of the customized design are described in the text. The combination of CRF coding with customized module design may lead to a practical advantage in data storage density. According to the estimates, the data storage density may exceed Exabit per centimeter squared. A key problem that requires further investigation is related to the minimum Hamming distance between an arbitrary target bit sequence and the closest sequence realizable within the CRF framework under fixed hardware constraints.
toXiv_bot_toot

Quadratic Zeeman effect in light boron-like ions
V. A. Agababaev, A. V. Volotka, D. A. Glazov, A. V. Malyshev, M. M. Osiptsov, V. M. Shabaev
https://arxiv.org/abs/2605.07732 htt…

Replaced article(s) found for cs.GT. https://arxiv.org/list/cs.GT/new
[1/1]:
- Breaking $1/\epsilon$ Barrier in Quantum Zero-Sum Games: Generalizing Metric Subregularity for Sp...
Yiheng Su, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Pucheng Xiong
https://arxiv.org/abs/2509.21570 https://mastoxiv.page/@arXiv_csGT_bot/115286473303032501
- Shift Bribery over Social Networks
Ashlesha Hota, Susobhan Bandopadhyay, Palash Dey
https://arxiv.org/abs/2510.21200 https://mastoxiv.page/@arXiv_csGT_bot/115445182046770469
- Mechanism Design Without Disclosure: Committing to and Running Hidden Mechanisms
Ran Canetti, Amos Fiat, Yannai A. Gonczarowski
https://arxiv.org/abs/2302.05590 https://mastoxiv.page/@arXiv_econTH_bot/109861924561524056
- Explaining a probabilistic prediction on the simplex with Shapley compositions
Paul-Gauthier No\'e, Miquel Perell\'o-Nieto, Jean-Fran\c{c}ois Bonastre, Peter Flach
https://arxiv.org/abs/2408.01382 https://mastoxiv.page/@arXiv_csLG_bot/112908172291910591
- Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs
Caner Gocmen, Thodoris Lykouris, Deeksha Sinha, Wentao Weng
https://arxiv.org/abs/2505.21331 https://mastoxiv.page/@arXiv_csDS_bot/114584234235188224
toXiv_bot_toot

An Information-Theoretic Analysis of Threshold Group Testing
Remco van der Hofstad, Noela M\"uller, Connor Riddlesden
https://arxiv.org/abs/2606.11353 https://arxiv.org/pdf/2606.11353 https://arxiv.org/html/2606.11353
arXiv:2606.11353v1 Announce Type: new
Abstract: We study the Threshold Group Testing (TGT) problem in the noiseless and non-adaptive setting, where the objective is to exactly recover a sparse binary vector from pooled tests, using as few tests as possible. In TGT, each test applied to a subset of items returns a positive outcome if the number of 1's (defective items) in that subset meets or exceeds a specified threshold, and has a negative outcome otherwise. We investigate how the complexity of TGT compares to that of Classical Group Testing (CGT), corresponding to the special case of the threshold equal to one, and analyse the impact of increasing the threshold on the required number of tests.
Our main contribution is the derivation of a sharp information-theoretic phase transition at $c_{\mathrm{inf}}^{\mathrm{TGT}}k\log(n/k)$ (non-adaptive) tests for TGT within the constant-column test design. The threshold constant $c_{\mathrm{inf}}^{\mathrm{TGT}}$ is expressed as a function of the prevalence of defectives and the threshold value. Our upper bound is derived under an analytic assumption, and we verify that this assumption is satisfied for a threshold value of 2.
The value of $c_{\mathrm{inf}}^{\mathrm{TGT}}$ reveals that TGT on the constant-column design has the same information-theoretic behaviour as CGT in the low-prevalence regime. Yet, strikingly, at higher prevalences, the threshold leads to a significant reduction in the number of tests.
On the other hand, we provide evidence that when the asymptotic proportion of defective items is positive, TGT actually becomes strictly harder than CGT (excluding trivial reductions).
toXiv_bot_toot

State-resolved electron capture in low-energy Ar2 -Ar/N2 collisions
Shucheng Cui, Dadi Xing, Xiaolong Zhu, Dongmei Zhao, Dalong Guo, Yong Gao, Shaofeng Zhang, Chenzhong Dong, Xinwen Ma
https://arxiv.org/abs/2605.07197

MJSAC: McCormick Relaxation-based Waveform Design for Joint Sensing and Communication
Bodhibrata Mukhopadhyay, Sajid Ahmed, Mohamed-Slim Alouini
https://arxiv.org/abs/2606.11351 https://arxiv.org/pdf/2606.11351 https://arxiv.org/html/2606.11351
arXiv:2606.11351v1 Announce Type: new
Abstract: In the upcoming 5G Advanced and 6G technologies, joint sensing and communication (JSAC) will play a pivotal role in enabling the simultaneous utilization of hardware and spectrum resources for communication and sensing tasks. While current algorithms primarily focus on designing beampattern invariant covariance matrices for transmitting various symbols for communication, they often overlook the distances among these symbols. While these covariance matrices effectively facilitate ranging operations, they have adverse effects on communication performance. Designing beampattern invariance covariance matrices with maximal distances among themselves poses a challenging non-convex problem. In this paper, we introduce a novel waveform design method based on McCormick relaxation called McCormick-based JSAC (MJSAC). MJSAC sequentially solves an optimization problem to generate a set of covariance matrices by maximizing the distances (Frobenius norm) among themselves while ensuring a consistent beam pattern. Also, MJSAC eliminates the requirement for channel information to generate the covariance matrices. Through simulations, we demonstrate that MJSAC outperforms conventional algorithms, even those utilizing channel information at the transmitter.
toXiv_bot_toot

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

Designed-Source Reductions and a Dual-Purpose Feasibility Band for Semantic Rate-Distortion
Joss Armstrong
https://arxiv.org/abs/2606.11280 https://arxiv.org/pdf/2606.11280 https://arxiv.org/html/2606.11280
arXiv:2606.11280v1 Announce Type: new
Abstract: The joint rate-distortion framework of Stavrou and Kountouris (IEEE Transactions on Communications 2023) characterises dual-fidelity tradeoffs for semantic communication on stochastic semantic sources. Many task-oriented communication systems instead use designed sources, where the semantic object is a deterministic oracle allocation $\phi^(t)$ rather than a stochastic quantity given by nature. We isolate the subclass of designed sources under smooth concave utility with assumptions A1, A2 and Euclidean allocation codomain, and restrict the encoder class to deterministic common-category mappings. Within this subclass the SK exponential-tilting decoder and generalised Blahut--Arimoto iteration specialise to conditional-mean decoding and Lloyd--Max stationarity on $\phi^(t)$. When the second fidelity is a monotone single-letter distortion, the joint problem stays inside the SK admissible class; the common-category SK rate is lower-bounded by the max of the corresponding Shannon rate-distortion functions, with equality only when the common-category reconstruction is compatible and RDF-optimal. When the second fidelity is aggregate verification, the joint problem leaves the SK single-letter class and admits a constrained-design feasibility band $R_{\min}(\varepsilon^) \leq R \leq R_{\max}(\beta^)$ of width $\log_2(K_{\max}/K_{\min})$ bits in partition cardinality. The reduction and the band are scope statements on the SK apparatus, not modifications to it. A smart-grid economic-dispatch example with a non-technical-loss-detection contrast illustrates the band.
toXiv_bot_toot

Electron loss and target excitation in keV-energy proton collisions with B and C$^{ }$
N. W. Antonio, I. B. Abdurakhmanov, A. E. Gayosso, A. S. Kadyrov
https://arxiv.org/abs/2605.10669

[2026-06-11 Thu (UTC), 14 new articles found for cs.IT Information Theory]
toXiv_bot_toot

Amplitude Modulation Noise Suppression of Dynamic Atom Gravimeters
Wen-Zhang Wang, Jin-Ting Li, Dan-Fang Zhang, Wei-Hao Xu, Jia-Yi Wei, Jia-Qi Zhong, Biao Tang, Lin Zhou, Run-Bing Li, Xi Chen, Jin-Wang, Ming-Sheng Zhan
https://arxiv.org/abs/2605.10324

Segment-Wise Soft Robotics Inspired Flexible Antenna Arrays: Design and Optimization
Shuaishuai Han, Konstantinos Ntougias, Elio Faddoul, Ioannis Krikidis
https://arxiv.org/abs/2606.11771

Finite Nuclear Size Corrections on Hyperfine Structure in Muonic Atoms
Do\u{g}a Ya\c{s}ar, Bastian Sikora
https://arxiv.org/abs/2605.09596 https://arxiv.or…

Non-special Divisors, LCPs of Codes, and LCD Codes on Kummer Extensions
Huachao Zhang, Chang-An Zhao
https://arxiv.org/abs/2606.11764 https://arxiv.org/pdf…

Design and fabrication of a micro-ion trap with a 3D-printed loading zone for improved hot-ion capture
Sayan Patra, Abhinav Parakh, Xiaoxing Xia, Juergen Biener, Hartmut H\"affner, Kristin M. Beck
https://arxiv.org/abs/2605.08502

Vision-Language-Action Models Meet World Models: Embodied Agentic AI for Low-Altitude Wireless Networks
Feibo Jiang, Li Dong, Lei Mao, Kezhi Wang, Cunhua Pan, Dong In Kim, Naofal Al-Dhahir
https://arxiv.org/abs/2606.11618

[2026-05-07 Thu (UTC), no new articles found for nlin.CD Chaotic Dynamics]
toXiv_bot_toot

[2026-05-12 Tue (UTC), 4 new articles found for physics.atom-ph Atomic Physics]
toXiv_bot_toot

Maximizing Connectivity of Uplink RIS-Assisted UAV Networks
Mohammed Saif, Shahrokh Valaee
https://arxiv.org/abs/2606.11523 https://arxiv.org/pdf/2606.1152…

Joint Movable Antenna Positioning and RIS Partitioning for Sum-Rate Maximization
Mohammed Saif
https://arxiv.org/abs/2606.11519 https://arxiv.org/pdf/2606.…

Lifted Gabidulin Construction for LDPC Representations of Finite Geometry Codes
Yifei Shen, Andreas Burg
https://arxiv.org/abs/2606.11454 https://arxiv.org…

Maximum Coverage Chase Decoder for Optical Interconnects
Alessandro Cardinale, Wenqing Song, Bin Chen, Alex Alvarado, Andreas Burg, Yifei Shen
https://arxiv.org/abs/2606.11401 h…

Color-Rule-Function Encoding for Combinatorial Memory
Alexander Khitun
https://arxiv.org/abs/2606.11365 https://arxiv.org/pdf/2606.11365

[2026-05-08 Fri (UTC), no new articles found for nlin.CD Chaotic Dynamics]
toXiv_bot_toot

An Information-Theoretic Analysis of Threshold Group Testing
Remco van der Hofstad, Noela M\"uller, Connor Riddlesden
https://arxiv.org/abs/2606.11353 https://

MJSAC: McCormick Relaxation-based Waveform Design for Joint Sensing and Communication
Bodhibrata Mukhopadhyay, Sajid Ahmed, Mohamed-Slim Alouini
https://arxiv.org/abs/2606.11351

Designed-Source Reductions and a Dual-Purpose Feasibility Band for Semantic Rate-Distortion
Joss Armstrong
https://arxiv.org/abs/2606.11280 https://arxiv.o…

[2026-06-11 Thu (UTC), 14 new articles found for cs.IT Information Theory]
toXiv_bot_toot

Reconfigurable Antennas for Next-generation Mobile Communication Networks: A Comprehensive Survey and Tutorial
Yizhe Zhao, Long Zhang, Halvin Yang, Kun Yang, Rui Zhang, Lingyang Song, Yuanwei Liu
https://arxiv.org/abs/2606.12139 https://arxiv.org/pdf/2606.12139 https://arxiv.org/html/2606.12139
arXiv:2606.12139v1 Announce Type: new
Abstract: The transition to next-generation mobile communication networks, particularly 6G, demands advanced technologies to meet the requirements for ultra-reliable, low-latency communication, massive connectivity, and intelligent applications. Reconfigurable antennas (RAs) play a crucial role in achieving these objectives by enabling dynamic adjustments to the radio frequency (RF) characteristics of antennas, such as gain, radiation pattern, impedance, and polarization. Unlike traditional fixed-position antennas, RAs can alter both their radiation patterns and positions, offering flexibility in response to varying communication environments. This paper presents a comprehensive survey and tutorial on RAs, with a focus on fluid antennas (FAs), movable antennas (MAs), pinching antennas (PAs), and reconfigurable holographic antennas (RHAs), examining their potential in next-generation mobile networks. We explore the channel modelling and estimation, performance analysis, resource allocation strategies, and their synergy with other emerging wireless technologies for each type of RA. Finally, we provide a comparative analysis of different RAs and discuss the open challenges and future research directions, offering insights and guidance for future investigations in the exciting research area.
toXiv_bot_toot

Reconfigurable Antennas for Next-generation Mobile Communication Networks: A Comprehensive Survey and Tutorial
Yizhe Zhao, Long Zhang, Halvin Yang, Kun Yang, Rui Zhang, Lingyang Song, Yuanwei Liu
https://arxiv.org/abs/2606.12139

[2026-04-10 Fri (UTC), 3 new articles found for physics.atom-ph Atomic Physics]
toXiv_bot_toot

Nuclear forward scattering of Bessel beams in $^{229}$Th:CaF$_2$
Alexander Franz, Tobias Kirschbaum, Adriana P\'alffy
https://arxiv.org/abs/2604.08433 https://

A spectropolarimeter for vacuum-ultraviolet emission lines
Nobuyuki Nakamura, Ryohko Ishikawa, Motoshi Goto
https://arxiv.org/abs/2604.08191 https://arxiv.…

A New Invariant for Prime Alternating Knots From Error-Correcting Codes
Altan B. Kilic, Ruud Pellikaan, Alberto Ravagnan
https://arxiv.org/abs/2606.10871 https://arxiv.org/pdf/2606.10871 https://arxiv.org/html/2606.10871
arXiv:2606.10871v1 Announce Type: new
Abstract: This paper shows that the Alexander-Briggs code of a knot gives rise to a new invariant that distinguishes prime alternating knots. The restriction to prime alternating knots precisely follows from the fact that our approach relies on Tait s flyping theorem. We also provide examples where the new invariant succeeds in separating knots that the well known invariants, such as some knot polynomials, fail.
toXiv_bot_toot

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

A New Invariant for Prime Alternating Knots From Error-Correcting Codes
Altan B. Kilic, Ruud Pellikaan, Alberto Ravagnan
https://arxiv.org/abs/2606.10871 https://

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

Topological quantum hodographs
Nikolay Rosanov (Ioffe Institute), Sergey Fedorov (Ioffe Institute), Mikhail Arkhipov (Ioffe Institute)
https://arxiv.org/abs/2606.08528 https://

[2026-06-09 Tue (UTC), 4 new articles found for physics.atom-ph Atomic Physics]
toXiv_bot_toot

Recoil corrections to $\mu$H hyperfine splitting
Andrzej Maro\'n, Mateusz Pa\'ntak, Krzysztof Pachucki
https://arxiv.org/abs/2604.06930 https://arx…

Strong-field ionization of atoms with bright squeezed vacuum light
Haodong Liu, Xiaoxiao Long, Peizeng Li, Zijian Lyu, Yunquan Liu
https://arxiv.org/abs/2604.06703 https://

[2026-04-09 Thu (UTC), 4 new articles found for physics.atom-ph Atomic Physics]
toXiv_bot_toot