Tootfinder

Fair Data Exchange with Constant-Time Proofs
Majid Khabbazian
https://arxiv.org/abs/2506.14944 https://arxiv.org/pdf/2506.14944

Fair Data Exchange with Constant-Time Proofs
The Fair Data Exchange (FDE) protocol introduced at CCS 2024 offers atomic pay-per-file transfers with constant-size proofs, but its prover and verifier runtimes still scale linearly with the file length n. We collapse these costs to essentially constant by viewing the file as a rate-1 Reed-Solomon (RS) codeword, extending it to a lower-rate RS code with constant redundancy, encrypting this extended vector, and then proving correctness for only a small random subset of the resulting ciphertexts…

The Orbit of WASP-4 b is in Decay
\"O. Ba\c{s}t\"urk, A. C. Kutluay, A. Barker, S. Yal\c{c}{\i}nkaya, J. Southworth, K. Barkaoui, A. W\"unsche, M. J. Burgdorf, M. Timmermans, E. Jehin, J. Tregloan-Reed, R. Figuera Jaimes, T. C. Hinse, B. Duru, J. Hitchcock, P. Longa-Pe\~na, S. Rahvar, S. Sajadian, M. Bretton, S. O. Selam, M. Gillon, M. Bonavita, G. D'Ago, M. Dominik, U. G. J{\o}rgensen, C. Snodgrass, P. Spyrato

The Orbit of WASP-4 b is in Decay
WASP-4 b is a hot Jupiter exhibiting a decreasing orbital period, prompting investigations into potential mechanisms driving its evolution. We analyzed 173 transit light curves, including 37 new observations, and derived mid-transit timings with EXOFAST, forming the most extensive TTV dataset for this system. Adding 58 literature timings and removing unreliable data, we constructed a TTV diagram with 216 points. Our analysis considered linear, quadratic, and apsidal motion models, with the quad…

Reed-Muller Codes for Quantum Pauli and Multiple Access Channels
Dina Abdelhadi, Colin Sandon, Emmanuel Abbe, Ruediger Urbanke
https://arxiv.org/abs/2506.08651

Reed-Muller Codes for Quantum Pauli and Multiple Access Channels
Reed-Muller (RM) codes have undergone significant analytical advancements over the past decade, particularly for binary memoryless symmetric (BMS) channels. We extend the scope of RM codes development and analysis to multiple-access channels (MACs) and quantum Pauli channels, leveraging a unified approach. Specifically, we first derive the achievable rate region for RM codes on so-called Q-MACs, a class of MACs with additive correlated noise. This is achieved via a generalization of the bending…

eLog analysis for accelerators: status and future outlook
Antonin Sulc, Thorsten Hellert, Aaron Reed, Adam Carpenter, Alex Bien, Chris Tennant, Claudio Bisegni, Daniel Lersch, Daniel Ratner, David Lawrence, Diana McSpadden, Hayden Hoschouer, Jason St. John, Thomas Britton
https://arxiv.org/abs/2506.12949

eLog analysis for accelerators: status and future outlook
This work demonstrates electronic logbook (eLog) systems leveraging modern AI-driven information retrieval capabilities at the accelerator facilities of Fermilab, Jefferson Lab, Lawrence Berkeley National Laboratory (LBNL), SLAC National Accelerator Laboratory. We evaluate contemporary tools and methodologies for information retrieval with Retrieval Augmented Generation (RAGs), focusing on operational insights and integration with existing accelerator control systems. The study addresses chal…

Lions' D.J. Reed noticed immediate energy difference with Detroit after three years with Jets

https://www.cbssports.com/nfl/news/lions-d

Antidirected paths in oriented graphs
Andrzej Grzesik, Marek Skrzypczyk
https://arxiv.org/abs/2506.11866 https://arxiv.org/pdf/2506.1…

Antidirected paths in oriented graphs
We show that for any integer $k \ge 4$, every oriented graph with minimum semidegree bigger than $\frac{1}{2}(k-1+\sqrt{k-3})$ contains an antidirected path of length $k$. Consequently, every oriented graph on $n$ vertices with more than $(k-1+\sqrt{k-3})n$ edges contains an antidirected path of length $k$. This asymptotically proves the antidirected path version of a conjecture of Stein and of a conjecture of Addario-Berry, Havet, Linhares Sales, Reed and Thomassé, respectively.

Memo: Google appoints a new chief AI architect, DeepMind CTO Koray Kavukcuoglu, who will coordinate future AI-powered product development (Reed Albergotti/Semafor)
https://www.semafor.com/article/06/11/2025/google-names-new-ch…

Google names new chief AI architect to advance developments
DeepMind’s tech chief, Koray Kavukcuoglu, was named to the newly created position, where he will work alongside Sundar Pichai to help speed up production.

Harper Reed on coding with AI: https://avatar42.social/2025/05/01/harper-reed-on-coding-with.html

This https://arxiv.org/abs/2504.10399 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csIT_…

Unique Decoding of Reed-Solomon and Related Codes for Semi-Adversarial Errors
For over a quarter century, the Guruswami--Sudan algorithm has served as the state-of-the-art for list-decoding Reed--Solomon (RS) codes up to the Johnson bound against adversarial errors. However, some recent structural results on the combinatorial list decoding of randomly punctured Reed--Solomon codes suggest that Johnson bound can likely be broken for some subclasses of RS codes. Motivated by these results, we seek to make traction on understanding adversarial decoding by considering a new …

Measuring optical force with a torsion pendulum: a platform for independent student experimentation
Leland Russell (Dept. of Physics, Reed College, Portland OR USA), Ezekiel A. Rein (Dept. of Physics, Reed College, Portland OR USA), Anatalya Piatigorsky (Dept. of Physics, Reed College, Portland OR USA), Jennifer T. Heath (Dept. of Physics, Reed College, Portland OR USA)

Measuring optical force with a torsion pendulum: a platform for independent student experimentation
In this work, the force due to radiation pressure is measured with sub-10 pN sensitivity, corresponding to less than 2 mW of optical power. The apparatus adds homemade reflectors to a commercial Cavendish balance, which consists of a torsion pendulum with a built-in capacitance position sensor. When driven by four 5 mW laser diodes, with square-wave modulation at the pendulum's natural frequency, the response is strong enough to easily discern in a short time series. The discrete Fourier transf…

the 5th annual bobsday soiree on @…, feat. dylan from every decade 1950s-2020s, from the earliest tapes to the most recent, plus reed, garcia, young, verlaine, welch/rawlings, wood/richards, alvarius b, tina turner, david lynch, the wilburys, burritos, chipmunks, & oodles more.

Linear exact repair schemes for free MDS and Reed-Solomon codes over Galois rings
Daniel P. Bossaller, Hiram H. L\'opez
https://arxiv.org/abs/2506.09017

Linear exact repair schemes for free MDS and Reed-Solomon codes over Galois rings
Codes over rings, especially over Galois rings, have been extensively studied for nearly three decades due to their similarity to linear codes over finite fields. A distributed storage system uses a linear code to encode a large file across several nodes. If one of the nodes fails, a linear exact repair scheme efficiently recovers the failed node by accessing and downloading data from the rest of the servers of the storage system. In this article, we develop a linear repair scheme for free maxi…

This https://arxiv.org/abs/2410.11968 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Codes on Weighted Projective Planes
We comprehensively study weighted projective Reed-Muller (WPRM) codes on weighted projective planes $\mathbb{P}(1,a,b)$. We provide the universal Gröbner basis for the vanishing ideal of the set $Y$ of $\mathbb{F}_q$--rational points of $\mathbb{P}(1,a,b)$ to get the dimension of the code. We determine the regularity set of $Y$ using a novel combinatorial approach. We employ footprint techniques to compute the minimum distance.

K2 observations of five pulsating subdwarf B stars with white dwarf companions
M. D. Reed, A. S. Baran, J. H. Telting, R. H. Ostensen, C. S. Jeffery, Y. Gaibor
https://arxiv.org/abs/2506.05033

K2 observations of five pulsating subdwarf B stars with white dwarf companions
We report seismic analyses of five pulsating subdwarf B (sdBV) stars observed during Kepler's K2 mission, each with a white dwarf companion. We find three of the five to be g-mode-dominated hybrid pulsators. For the other two, we only detect g modes. We determine rotation periods from frequency multiplets for four stars and each rotates subsynchronously to its binary period, including PG 0101+039 and PG 0902+124 both with binary periods near 0.57 days and spin periods near 9 days. We detect fre…

🇺🇦 #NowPlaying on #BBC6Music's #LaurenLaverne
Lou Reed:
🎵 Satellite Of Love
#LouReed
https://cantautorepsicopatico.bandcamp.com/track/lou-reed-satellite-of-love-oncoming-martian-version
https://open.spotify.com/track/5WyuRWUcOOhAic0tj9Pl28

Sources: Anthropic has been lobbying Congress to oppose a bill banning states from regulating AI, and pushed against the recent US AI deal with Gulf states (Reed Albergotti/Semafor)
https://www.semafor.com/article/05/30/2025/anthropi…

Anthropic emerges as an adversary to Trump’s big bill
Sources familiar say the White House, angered by Anthropic’s lobbying against its chief piece of legislation, have come to view the AI company as an obstacle.

Graphene Electro-Absorption Modulators for Energy-Efficient and High-Speed Optical Transceivers
M. Tiberi, A. Montanaro, C. Wen, J. Zhang, O. Balci, S. M. Shinde, S. Sharma, A. Meersha, H. Shekhar, J. E. Muench, B. R. Conran, K. B. K. Teo, M. Ebert, X. Yan, Y. Tran, M. Banakar, C. Littlejohns, G. T. Reed, M. Romagnoli, A. Ruocco, V. Sorianello, A. C. Ferrari

Graphene Electro-Absorption Modulators for Energy-Efficient and High-Speed Optical Transceivers
The increasing demand for energy-efficient hardware for artificial intelligence (AI) and data centres requires integrated photonic solutions delivering optical transceivers with Tbit/s data rates and energy consumption$<$1pJ/bit. Here, we report double single-layer graphene electro-absorption modulators on Si optimized for energy-efficient and ultra-fast operation, demonstrating 67GHz bandwidth and 80Gbit/s data rate, in both O and C bands, using a fabrication tailored for wafer-scale integrati…

This https://arxiv.org/abs/2310.12888 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csIT_…

Generalized GM-MDS: Polynomial Codes are Higher Order MDS
The GM-MDS theorem, conjectured by Dau-Song-Dong-Yuen and proved by Lovett and Yildiz-Hassibi, shows that the generator matrices of Reed-Solomon codes can attain every possible configuration of zeros for an MDS code. The recently emerging theory of higher order MDS codes has connected the GM-MDS theorem to other important properties of Reed-Solomon codes, including showing that Reed-Solomon codes can achieve list decoding capacity, even over fields of size linear in the message length. A few …

Natura Urbana 🏡
城市自然 🏡
📷 Pentax MX
🎞️Ilford FP4 Plus, expired 1995
buy me ☕️ ?/请我喝杯☕️？
#filmphotography

Yiding Cao Geld mit PayPal.Me senden
Folgen Sie dem Link PayPal.Me/dingsterdingster und geben Sie den Betrag ein. Es ist bequem und sicher. Sie haben noch kein PayPal-Konto? Kein Problem.

A Replit employee details a critical security flaw in web apps created using AI-powered app builder Lovable that exposes API keys and personal info of app users (Reed Albergotti/Semafor)
https://www.semafor.com/article/05/29/2025

The hottest new vibe coding startup may be a sitting duck for hackers
Lovable is accused of failing to fix security flaws that exposed information about users, a growing vulnerability as vibe coding’s popularity surges.

Typical $T$-free graphs
Bruce Reed, Yelena Yuditsky
https://arxiv.org/abs/2506.01067 https://arxiv.org/pdf/2506.01067

Typical $T$-free graphs
We prove that for every tree $T$ which is not an edge, for almost every graph $G$ which does not contain $T$ as an induced subgraph, $V(G)$ has a partition into $α(T)-1$ parts certifying this fact. Each part induces a graph which is $P_4$-free and has further properties which depend on $T$. As a consequence we obtain good bounds (often tight up to a constant factor) on the number of $T$-free graphs and show in a follow-up paper~\cite{RY} that almost every $T$-free graph $G$ has chromatic numbe…

🇺🇦 #NowPlaying on #BBC6Music's #LaurenLaverne
Lou Reed:
🎵 Satellite Of Love
#LouReed
https://cantautorepsicopatico.bandcamp.com/track/lou-reed-satellite-of-love-oncoming-martian-version
https://open.spotify.com/track/5WyuRWUcOOhAic0tj9Pl28

This https://arxiv.org/abs/2403.11436 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csIT_…

Deep Holes of Twisted Reed-Solomon Codes
The deep holes of a linear code are the vectors that achieve the maximum error distance (covering radius) to the code. {Determining the covering radius and deep holes of linear codes is a fundamental problem in coding theory. In this paper, we investigate the problem of deep holes of twisted Reed-Solomon codes.} The covering radius and a standard class of deep holes of twisted Reed-Solomon codes ${\rm TRS}_k(\mathcal{A}, θ)$ are obtained for a general evaluation set $\mathcal{A} \subseteq \mat…

Time-tagging data acquisition system for testing superconducting electronics based on an RFSoC and custom analog frontend
Reed A. Foster, Stephen Kandeh, Owen Medeiros, Alejandro Simon, Matteo Castellani, Karl K. Berggren
https://arxiv.org/abs/2505.21714

Time-tagging data acquisition system for testing superconducting electronics based on an RFSoC and custom analog frontend
Novel electronic devices can often be operated in a plethora of ways, which makes testing circuits comprised of them difficult. Often, no single tool can simultaneously analyze the operating margins, maximum speed, and failure modes of a circuit, particularly when the intended behavior of subcomponents of the circuit is not standardized. This work demonstrates a cost-effective data acquisition system for electronic circuits that enables more intricate verification techniques than are practical …

HiKO: A Hierarchical Framework for Beyond-Second-Order KO Codes
Shubham Srivastava, Adrish Banerjee
https://arxiv.org/abs/2506.10121 https://

HiKO: A Hierarchical Framework for Beyond-Second-Order KO Codes
This paper introduces HiKO (Hierarchical Kronecker Operation), a novel framework for training high-rate neural error-correcting codes that enables KO codes to outperform Reed-Muller codes beyond second order. To our knowledge, this is the first attempt to extend KO codes beyond second order. While conventional KO codes show promising results for low-rate regimes ($r < 2$), they degrade at higher rates -- a critical limitation for practical deployment. Our framework incorporates three key innova…

🇺🇦 #NowPlaying on BBCRadio3's #SaturdayMorning
Samuel Barber, Jelte Althuis & Calefax Reed Quintet:
🎵 Excursions Op. 20 (Arr. for Wind Quintet by Jelte Althuis): I. Un poco allegro
#SamuelBarber #JelteAlthuis
https://open.spotify.com/track/430mQC9PspwpcOJcKpf0Iu

Natura Urbana 🏡
城市自然 🏡
📷 Pentax MX
🎞️Ilford FP4 Plus, expired 1995
buy me ☕️ ?/请我喝杯☕️？
#filmphotography

Yiding Cao Geld mit PayPal.Me senden
Folgen Sie dem Link PayPal.Me/dingsterdingster und geben Sie den Betrag ein. Es ist bequem und sicher. Sie haben noch kein PayPal-Konto? Kein Problem.

The asymptotic $\chi$-boundedness of hereditary families
Bruce Reed, Yelena Yuditsky
https://arxiv.org/abs/2506.01070 https://arxiv.o…

The asymptotic $χ$-boundedness of hereditary families
A family ${\cal F}$ of graphs is asymptotically $χ$-bounded with bounding function $f$ if almost every graph $G$ in the family satisfies $χ(G) \le f(ω(G))$. A graph is $H$-free if it does not contain $H$ as an induced subgraph. We ask which hereditary families are asymptotically $χ$-bounded, and discuss some related questions. We show that for every tree $T$, almost all $T$-free graphs $G$ satisfy $χ(G)=ω(G)$. We show that for every cycle $C_k$ except $C_6$, almost every $C_k$-free graph …

Search for millicharged particles in proton-proton collisions at $\sqrt{s} = 13.6$ TeV
S. Alcott, Z. Bhatti, J. Brooke, C. Campagnari, M. Carrigan, M. Citron, R. De Los Santos, A. De Roeck, C. Dorofeev, T. Du, J. Goldstein, F. Golf, N. Gonzalez, A. Haas, J. Heymann, C. S. Hill, D. Imani, M. Joyce, K. Larina, R. Loos, S. Lowette, H. Mei, D. W. Miller, B. Peng, S. N. Santpu, I. Reed, E. Schaffer, R. Schmitz, J. Steenis, D. Stuart, J. S. Tafoya Vargas, D. Vannerom, T. Wybouw, Z. Xiao, H. …

Search for millicharged particles in proton-proton collisions at $\sqrt{s} = 13.6$ TeV
We report on a search for elementary particles with charges much smaller than the electron charge using a data sample of proton-proton collisions provided by the CERN Large Hadron Collider in 2023--24, corresponding to an integrated luminosity of 124.7~fb$^{-1}$ at a center-of-mass energy of 13.6~TeV. The analysis presented uses the completed Run 3 milliQan bar detector to set the most stringent constraints to date for particles with charges $\leq0.24~\rm{e}$ and masses $\geq0.45~\rm{GeV}$.

Some constructions of non-generalized Reed-Solomon MDS Codes
Kanat Abdukhalikov, Cunsheng Ding, Gyanendra K. Verma
https://arxiv.org/abs/2506.04080 https:/…

Some constructions of non-generalized Reed-Solomon MDS Codes
We investigate two classes of extended codes and provide necessary and sufficient conditions for these codes to be non-GRS MDS codes. We also determine the parity check matrices for these codes. Using the connection of MDS codes with arcs in finite projective spaces, we give a new characterization of o-monomials.

What Lives? A meta-analysis of diverse opinions on the definition of life
Reed Bender, Karina Kofman, Blaise Ag\"uera y Arcas, Michael Levin
https://arxiv.org/abs/2505.15849 …

What Lives? A meta-analysis of diverse opinions on the definition of life
The question of "what is life?" has challenged scientists and philosophers for centuries, producing an array of definitions that reflect both the mystery of its emergence and the diversity of disciplinary perspectives brought to bear on the question. Despite significant progress in our understanding of biological systems, psychology, computation, and information theory, no single definition for life has yet achieved universal acceptance. This challenge becomes increasingly urgent as advances in…

This https://arxiv.org/abs/2310.12898 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csIT_…

AG Codes Achieve List-decoding Capacity over Constant-sized Fields
The recently-emerging field of higher order MDS codes has sought to unify a number of concepts in coding theory. Such areas captured by higher order MDS codes include maximally recoverable (MR) tensor codes, codes with optimal list-decoding guarantees, and codes with constrained generator matrices (as in the GM-MDS theorem). By proving these equivalences, Brakensiek-Gopi-Makam showed the existence of optimally list-decodable Reed-Solomon codes over exponential sized fields. Building on this, …