Tootfinder

arxiv_authors: Arxiv authors (1993-2003)
Scientific collaborations between authors of papers submitted to arxiv.org, under 5 categories: gr-qc, astro-ph, cond-mat, hep-ph, and hep-th categories, spanning January 1993 to April 2003. If an author i co-authored a paper with author j, the graph contains a undirected edge from i to j. If the paper is co-authored by k authors this generates a completely connected (sub)graph on k nodes.
This network has 26197 nodes and 28980 edges.

Has anyone done a test implementation of https://www.ietf.org/archive/id/draft-meow-mrrp-00.html yet? Is there any open example code?
I'm wondering how many Kbity of flash space I might need

Failed Companies Are Selling Old Slack Chats and Email Archives to Train AI
https://gizmodo.com/failed-companies-are-selling-old-slack-chats-and-email-archives-to-train-ai-2000747916

Discrete Mixed Quantization
Qiaochu Ma
https://arxiv.org/abs/2605.16203 https://arxiv.org/pdf/2605.16203 https://arxiv.org/html/2605.16203
arXiv:2605.16203v1 Announce Type: new
Abstract: In this paper, we develop a mixed quantization technique for graph vector bundles and apply it to several asymptotic spectral problems, including the Alon-Boppana bound, the Kesten-McKay law, quantum ergodicity, zero divisor convergence, and Ramanujan vector bundles.
toXiv_bot_toot

Measuring the Computational Power of Finite Patches of Cellular Automata
Attila Egri-Nagy, Chrystopher L. Nehaniv
https://arxiv.org/abs/2604.14966 https://arxiv.org/pdf/2604.14966 https://arxiv.org/html/2604.14966
arXiv:2604.14966v1 Announce Type: new
Abstract: Computational power can be measured by assigning an algebraic structure to a computational device. Here, we convert a small patch of Conway's Game of Life into a transformation semigroup. The conversion captures not only time evolution but also interactive operations. In this way, the cellular automaton becomes directly programmable. Once this measurement is made, we apply hierarchical decompositions to the resulting algebraic object as a way of understanding it. These decompositions are based on a macro/micro-state division inspired by statistical mechanics. However, cellular automata have a large number of global states. Therefore, we focus on partitioning the state space and creating morphic images approximations that can serve as macro-level descriptions. The methods developed here are not limited to cellular automata; they apply more generally to discrete dynamical systems.
toXiv_bot_toot

In Abwesenheit: Spotify gewinnt vor Gericht gegen Anna's Archive
Spotify soll 300 Millionen US-Dollar von der Schattenbibliothek Anna's Archive bekommen, entschied ein Gericht. Die Betreiber erschienen nicht zur Verhandlung.

🇺🇦 #NowPlaying on KEXP's #MiddayShow
Archie Bronson Outfit:
🎵 Cherry Lips
#ArchieBronsonOutfit
https://archiebronsonoutfit.bandcamp.com/track/cherry-lips
https://open.spotify.com/track/7Dg4LyZxXZ7yKPTRZXmaBj

arxiv_authors: Arxiv authors (1993-2003)
Scientific collaborations between authors of papers submitted to arxiv.org, under 5 categories: gr-qc, astro-ph, cond-mat, hep-ph, and hep-th categories, spanning January 1993 to April 2003. If an author i co-authored a paper with author j, the graph contains a undirected edge from i to j. If the paper is co-authored by k authors this generates a completely connected (sub)graph on k nodes.
This network has 68746 nodes and 51971 edges.

KI-Papers bei arXiv: Sperre bei erstem Verstoß
Die Wissenschaftsplattform verschärft erneut ihre Regeln: Wer KI-Müll als Wissenschaft ausgibt, wird gesperrt – und danach genauer geprüft.
https://www.

KI-Papers bei arXiv: Sperre bei erstem Verstoß
Die Wissenschaftsplattform verschärft erneut ihre Regeln: Wer KI-Müll als Wissenschaft ausgibt, wird gesperrt – und danach genauer geprüft.

arxiv_authors: Arxiv authors (1993-2003)
Scientific collaborations between authors of papers submitted to arxiv.org, under 5 categories: gr-qc, astro-ph, cond-mat, hep-ph, and hep-th categories, spanning January 1993 to April 2003. If an author i co-authored a paper with author j, the graph contains a undirected edge from i to j. If the paper is co-authored by k authors this generates a completely connected (sub)graph on k nodes.
This network has 68746 nodes and 51971 edges.