Tootfinder

Vollständig gefälschte CPUs jetzt auch als "Ryzen 9800X3D"
In den USA ist ein Fake von AMDs Topseller aufgetaucht, der nach bekanntem Muster hergestellt wurde und mangels Dies funktionslos ist.

Normal and Dynamical Typicality in a Random Matrix Model
L\'aszl\'o Erd\H{o}s, Joscha Henheik, Cornelia Vogel
https://arxiv.org/abs/2506.17177 http…

Normal and Dynamical Typicality in a Random Matrix Model
We prove normal typicality and dynamical typicality for a (centered) random block-band matrix model with block-dependent variances. A key feature of our model is that we achieve intermediate equilibration times, an aspect that has not been proven rigorously in any model before. Our proof builds on recently established concentration estimates for products of resolvents of Wigner type random matrices [arXiv:2403.10359] and an intricate analysis of the deterministic approximation.

Good Morning #Canada
Next week is Beaver Week, a look at Canada's most loved wild creature. Consider today's post as a teaser or commercial for this important event.
#CanadaIsAwesome #BeaverWeek
https://youtube.com/shorts/tGQ1KBJPdDk?si=TBHCsLO63SAtHx-7

🇺🇦 #NowPlaying on KEXP's #VarietyMix
The Bug Club:
🎵 Jealous Boy
#TheBugClub
https://thebugclub.bandcamp.com/track/jealous-boy
https://open.spotify.com/track/3geXvdkUWdzqvnGxhOX71J

Cycle lengths in the percolated hypercube
Michael Anastos, Sahar Diskin, Joshua Erde, Mihyun Kang, Michael Krivelevich, Lyuben Lichev
https://arxiv.org/abs/2506.16858

Cycle lengths in the percolated hypercube
Let $Q^d_p$ be the random subgraph of the $d$-dimensional binary hypercube obtained after edge-percolation with probability $p$. It was shown recently by the authors that, for every $\varepsilon > 0$, there is some $c = c(\varepsilon)>0$ such that, if $pd\ge c$, then typically $Q^d_p$ contains a cycle of length at least $(1-\varepsilon)2^d$. We strengthen this result to show that, under the same assumptions, typically $Q^d_p$ contains cycles of all even lengths between $4$ and $(1-\varepsilon)2…

Hierarchical Graph Information Bottleneck for Multi-Behavior Recommendation
Hengyu Zhang, Chunxu Shen, Xiangguo Sun, Jie Tan, Yanchao Tan, Yu Rong, Hong Cheng, Lingling Yi
https://arxiv.org/abs/2507.15395

Hierarchical Graph Information Bottleneck for Multi-Behavior Recommendation
In real-world recommendation scenarios, users typically engage with platforms through multiple types of behavioral interactions. Multi-behavior recommendation algorithms aim to leverage various auxiliary user behaviors to enhance prediction for target behaviors of primary interest (e.g., buy), thereby overcoming performance limitations caused by data sparsity in target behavior records. Current state-of-the-art approaches typically employ hierarchical design following either cascading (e.g., vi…

On Setting Up a Raspberry Pi Off-grid PV-Powered Server (2014) - How I set up a Raspberry Pi (Model B then B ) after the SheevaPlug. ~1.6W consumption typical, 400x less than my original server rack! #RPi #frugal #offGrid

On Setting Up a Raspberry Pi Off-grid PV-Powered Server (2014)
How I set up a Raspberry Pi (Model B then B+) after the SheevaPlug. 1.6W consumption typical, 400x less than my original server rack! #RPi #frugal #offGrid

On Quad Mesh Extraction From Messy Grid Preserving Maps
Nicolas Ray (PIXEL)
https://arxiv.org/abs/2507.15404 https://arxiv.org/pdf/25…

On Quad Mesh Extraction From Messy Grid Preserving Maps
Extracting a quad mesh from a grid preserving map is straightforward in theory, but typical inputs are not exactly grid preserving maps. Previous works can manage minor deviations from grid preserving maps, but without a clear specification of what is acceptable. This work clarifies how typical inputs differ from a grid preserving map, and shows how the differences with a grid preserving map can be reflected by a sequence of operations acting on a discrete structure. It opens research opportuni…

The New Druids.
Thousands celebrate summer solstice at Stonehenge,
#stonehedge