Tootfinder

Viele haben es vorausgesagt: Ende einer "Männerfreundschaft": Trump distanziert sich öffentlich von Musk – der kontert prompt und wirft dem Präsidenten Undankbarkeit vor. Streitpunkt: Trumps Steuergesetz, das Subventionen für E-Autos kürzt. Teslas Aktie bricht ein, Musk poltert: „Ohne mich hätte Trump die Wahl verloren.“ #Tagesschau

US-Präsident Trump geht auf Distanz zu Tech-Milliardär Musk
Es ist wohl das Ende einer Männerfreundschaft: US-Präsident Trump geht öffentlich auf Distanz zu Musk. Der Tech-Unternehmer reagiert umgehend - und spricht von Undankbarkeit.

foldoc: FOLDOC entries (2002)
A network of hyperlinks among entries in the Free On-line Dictionary of Computing (FOLDOC, www.foldoc.org), an online dictionary of acronyms and technical terms for computers. An edge points from i to j if the term j is referred to in the entry for term i. Edge weight denotes number of uses of the same term.
This network has 13356 nodes and 120238 edges.
Tags: Informational, Web graph, Weighted

Geodesic transitive graphs of small valency
Jun-Jie Huang
https://arxiv.org/abs/2506.04670 https://arxiv.org/pdf/2506.04670

Geodesic transitive graphs of small valency
For a graph $Γ$, the {\em distance} $d_Γ(u,v)$ between two distinct vertices $u$ and $v$ in $Γ$ is defined as the length of the shortest path from $u$ to $v$, and the {\em diameter} $\mathrm{diam}(Γ)$ of $Γ$ is the maximum distance between $u$ and $v$ for all vertices $u$ and $v$ in the vertex set of $Γ$. For a positive integer $s$, a path $(u_0,u_1,\ldots,u_{s})$ is called an {\em $s$-geodesic} if the distance of $u_0$ and $u_s$ is $s$. The graph $Γ$ is said to be {\em distance transiti…

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

Improved Belief Propagation Decoding Algorithms for Surface Codes
Quantum error correction is crucial for universal fault-tolerant quantum computing. Highly accurate and low-time-complexity decoding algorithms play an indispensable role in ensuring quantum error correction works effectively. Among existing decoding algorithms, belief propagation (BP) is notable for its nearly linear time complexity and general applicability to stabilizer codes. However, BP's decoding accuracy without post-processing is unsatisfactory in most situations. This article focuses o…

Dustin Lance Black, Sean Penn Hit Back as Navy Ship Is Stripped of Harvey Milk's Name: "These Guys Are Idiots" (Exclusive) (Seth Abramovitch/The Hollywood Reporter)
https://www.hollywoodreporter.com/movies/movie-news/dustin-lance-black-sean-penn-pete-hegseth-navy-harvey-milk-1236255648/
http://www.memeorandum.com/250604/p127#a250604p127

On the construction of a gradient method of quadratic optimization, optimal from the point of view of minimizing the distance to the exact solution
N. V. Pletnev
https://arxiv.org/abs/2506.04866

On the construction of a gradient method of quadratic optimization, optimal from the point of view of minimizing the distance to the exact solution
Problems of quadratic optimization in Hilbert space often arise when solving ill-posed problems for differential equations. In this case, the target value of the functional is known. In addition, the structure of the functional allows calculating the gradient by solving well-posed problems, which allows applying first-order methods. This article is devoted to the construction of the $m$-moment minimum error method -- an effective method that minimizes the distance to the exact solution. The con…

Iterative Neural Rollback Chase-Pyndiah Decoding
Dmitry Artemasov, Oleg Nesterenkov, Kirill Andreev, Pavel Rybin, Alexey Frolov
https://arxiv.org/abs/2506.04839

Iterative Neural Rollback Chase-Pyndiah Decoding
Iterative decoding is essential in modern communication systems, especially optical communications, where error-correcting codes such as turbo product codes (TPC) and staircase codes are widely employed. A key factor in achieving high error correction performance is the use of soft-decision decoding for component codes. However, implementing optimal maximum a posteriori (MAP) probability decoding for commonly used component codes, such as BCH and Polar codes, is computationally prohibitive. Ins…

Stable recovery of complex dictionary-sparse signals from phaseless measurements
Lianxing Xia, Haiye Huo
https://arxiv.org/abs/2506.03961 https://

Stable recovery of complex dictionary-sparse signals from phaseless measurements
Dictionary-sparse phase retrieval, which is also known as phase retrieval with redundant dictionary, aims to reconstruct an original dictionary-sparse signal from its measurements without phase information. It is proved that if the measurement matrix $A$ satisfies null space property (NSP)/strong dictionary restricted isometry property (S-DRIP), then the dictionary-sparse signal can be exactly/stably recovered from its magnitude-only measurements up to a global phase. However, the S-DRIP holds …

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

Simultaneous Rational Number Codes: Decoding Beyond Half the Minimum Distance with Multiplicities and Bad Primes
In this paper, we extend the work of (Abbondati et al., 2024) on decoding simultaneous rational number codes by addressing two important scenarios: multiplicities and the presence of bad primes (divisors of denominators). First, we generalize previous results to multiplicity rational codes by considering modular reductions with respect to prime power moduli. Then, using hybrid analysis techniques, we extend our approach to vectors of fractions that may present bad primes. Our contributions incl…