Tootfinder

German police identify TrickBot and Conti ransomware leader "Stern" as Vitaly Nikolaevich Kovalev, believed to be in Russia and shielded from extradition (Wired)
https://www.wired.com/story/stern-trickbot-identified-germany-bka/

Cops in Germany Claim They've ID'd the Mysterious Trickbot Ransomware Kingpin
The elusive boss of the Trickbot and Conti cybercriminal groups has been known only as “Stern.” Now, German law enforcement has published his alleged identity—and it’s a familiar face.

Duitse onrust over nationale goudstaven in VS. ‘Het is ons geld, het moet worden teruggebracht’ - NRC
https://www.nrc.nl/nieuws/2025/…

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

Morpheus Consensus: Excelling on trails and autobahns
Recent research in consensus has often focussed on protocols for State-Machine-Replication (SMR) that can handle high throughputs. Such state-of-the-art protocols (generally DAG-based) induce undue overhead when the needed throughput is low, or else exhibit unnecessarily-poor latency and communication complexity during periods of low throughput. Here we present Morpheus Consensus, which naturally morphs from a quiescent low-throughput leaderless blockchain protocol to a high-throughput leader…

Density of Traceable Graphs
Michal Dvo\v{r}\'ak, Du\v{s}an Knop, Michal Opler, Jan Pokorn\'y, Ond\v{r}ej Such\'y, Krisztina Szil\'agyi
https://arxiv.org/abs/2506.22269

Density of Traceable Graphs
We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show that the bound is: - quadratic for the class of graphs of bounded neighborhood diversity, bounded size of maximum induced matching or bounded cluster vertex deletion number; - n log n for the class of cographs or, more generaly, bounded modular-width, and for the class of bounded distance to cograph; and - sligthly su…

Quantum Circuit Caches and Compressors for Low Latency, High Throughput Computing
Ioana Moflic, Alan Robertson, Simon J. Devitt, Alexandru Paler
https://arxiv.org/abs/2507.20677

Quantum Circuit Caches and Compressors for Low Latency, High Throughput Computing
Utility-scale quantum programs contain operations on the order of $>10^{15}$ which must be prepared and piped from a classical co-processor to the control unit of the quantum device. The latency of this process significantly increases with the size of the program: existing high-level classical representations of quantum programs are typically memory intensive and do not naïvely efficiently scale to the degree required to execute utility-scale programs in real-time. To combat this limitation, w…

collins_yeast: Collins yeast interactome (2007)
Network of protein-protein interactions in Saccharomyces cerevisiae (budding yeast), measured by co-complex associations identified by high-throughput affinity purification and mass spectrometry (AP/MS).
This network has 1622 nodes and 9070 edges.
Tags: Biological, Protein interactions, Unweighted

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

Searching for Inflationary Physics with the CMB Trispectrum: 2. Code & Validation
To unlock the vast potential of the CMB trispectrum, we require both robust estimators and efficient computational tools. In this work, we introduce the public code PolySpec: a suite of quartic estimators designed to measure the amplitudes of a wide variety of inflationary templates, including local non-Gaussianity, effective field theory models, direction-dependent trispectra, spinning massive particle exchange, and weak gravitational lensing. PolySpec includes a python/cython implementation o…

Nieudany poranek z nowymi wersjami paczek Pythona dla #Gentoo:
1. Projekt, który zwlekał z wydaniem nowej wersji z poprawkami bezpieczeństwa 4 lata, w końcu wydał nową wersję. Oczywiście, jak się robi jedno wydanie na 7 lat, to definitywnie trzeba w tym czasie zmienić system budowania na zepsutą hybrydę #PythonPoetry

collins_yeast: Collins yeast interactome (2007)
Network of protein-protein interactions in Saccharomyces cerevisiae (budding yeast), measured by co-complex associations identified by high-throughput affinity purification and mass spectrometry (AP/MS).
This network has 1622 nodes and 9070 edges.
Tags: Biological, Protein interactions, Unweighted

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

Searching for Inflationary Physics with the CMB Trispectrum: 3. Constraints from Planck
Is there new physics hidden in the four-point function of the cosmic microwave background (CMB)? We conduct a detailed analysis of the Planck PR4 temperature and polarization trispectrum for $\ell\in[2,2048]$. Using the theoretical and computational tools developed in Paper 1 and Paper 2, we search for 33 template amplitudes, encoding a variety of effects from inflationary self-interactions to particle exchange. We find no evidence for primordial non-Gaussianity and set stringent constraints on…