Tootfinder

To honour the US dead cannon-fodder, many more Iranians must be murdered.
Trump says US strikes hit Iran in 'honour' of American soldiers killed - BBC News
https://www.bbc.co.uk/news/articles/cly52xzjd3qo

Trump says US strikes hit Iran in 'honour' of American soldiers killed
Iran responded with attacks in Syria and Jordan, as two ships reportedly exploded in the Strait of Hormuz.

University of Montreal resesrch into shared stress between couples found that "lesbian, gay, bisexual, transgender and nonbinary couples" (SGD) supported each other better through stress than cishet couples - they "recover more efficiently from acute stress and display more engaged and coordinated support behaviors".
One hypothesis explaining this was, essentially, shared oppression and the need to build strong chosen families.

The emerging timescale of young #StarClusters regulated by cluster stellar mass: https://www.nature.com/articles/s41550-026-02857-y -> Webb & Hubble find massive star clusters emerge faster: https://www.esa.int/Science_Exploration/Space_Science/Webb/Webb_Hubble_find_massive_star_clusters_emerge_faster

Ultrametric Graphons and Hierarchical Community Networks: Spectral Theory and Applications
\'Angel Alfredo Mor\'an Ledezma
https://arxiv.org/abs/2605.13423 https://arxiv.org/pdf/2605.13423 https://arxiv.org/html/2605.13423
arXiv:2605.13423v1 Announce Type: new
Abstract: We develop a theory of ultrametric graphons as limiting objects for random networks with nested hierarchical community structure. A graphon $W:[0,1]^2\to[0,1]$ is called ultrametric if $W(x,y)=w(d(x,y))$, where $d$ is an ultrametric on $[0,1]$ induced by a family of nested partitions and $w$ is a positive kernel. The resulting random graphs exhibit a nested hierarchical community structure in which the density of connections is governed by the ultrametric distance between vertices. The Laplacian $L_d^k$ of the deterministic graph sampled from an ultrametric graphon is itself an ultrametric Laplacian, whose eigenvalues and spectral projectors admit completely explicit closed-form expressions in terms of the community sizes and inter-community connection densities. We show that the normalized eigenvalues and spectral projectors of the random Laplacian $L_r^k$ are arbitrarily close to those of $L_d^k$ with high probability as $k\to\infty$, so that the explicit formulas for $L_d^k$ provide closed-form approximations for the spectrum and spectral projectors of $L_r^k$. As applications: a sign structure theorem generalizes the Fiedler vector criterion to hierarchical networks with arbitrarily many communities; a detectability threshold $p^*=\min_i\rho_i$ governs spectral community detection for one-level hierarchical graphons; the pseudo-inverse Laplacian $L_W^ $ is constructed and shown to be the almost sure limit of the pseudo-inverse of $L_r^k$, implying that hitting and commute times collapse to quantities depending only on the expected degrees of the endpoints; and explicit closed-form stability conditions for the SIS disease-free equilibrium reveal a fundamental tension between homogeneous and heterogeneous community structures, confirmed by numerical experiments.
toXiv_bot_toot

Every year i explore my filesystem and remember i got a gigantic hoard of old book svgs and fonts and shit i collected when i was 13/14 and always intended to remix into a pirate rpg while always being distracted by more captivating projects

A Pizza Delivery (PC, PS5, Xbox) "B" is making her final delivery of the day, but it turns into a surreal journey through a strange world.
So I don't really want to describe this game more than the line above, I feel this is one of those ones it's best to just experience. One of those "artsy" type games. It's introspective at times. You interact with odd characters. There's things to collect and read.
The graphics are pretty simple s…

Internet age verification proposals restrict the fundamental rights of young people to speak to each other and to access information.
They also force all internet users,
not just those under a certain age,
to upload private data
—like a face scan or passport
—in order to access a website or service.
In considering the vast scope of privacy issues pertaining to the collection, storage, and sharing of this personal information,
the problems of age veri…

Internet Age-Gates Are a Growing Global Threat
The internet is an essential resource for young people and adults to access information, explore community, and find themselves—both inside countries and across continents. Yet governments around the world continue to introduce and implement legislation requiring all online users to verify their ages before accessing the digital space.

Idleness is Relative: Exploiting Tool-Call Idle Windows for Offloading in Agentic Systems with MORI
Tian Xia, Hanchen Li, Zhifei Li, Xiaokun Chen, Hao Kang, Yifan Qiao, Yi Xu, Ion Stoica
https://arxiv.org/abs/2606.00866 https://arxiv.org/pdf/2606.00866 https://arxiv.org/html/2606.00866
arXiv:2606.00866v1 Announce Type: new
Abstract: Modern LLM serving systems increasingly host agentic workloads, whose sessions issue tens of model invocations interleaved with tool calls, accumulating KV cache that can be reused across steps. As requests' total KV cache size easily exceeds GPU HBM capacity, researchers offload them to CPU DRAM. However, tool-call durations span orders of magnitude, and the cost of transferring KV cache between tiers makes it impractical to re-place entries on every call. We observe that agentic programs exhibit a two-phase structure: busy phases of rapid short tool calls and idle phases dominated by long-running calls. Current eviction policies such as LRU fail to capture this property. A binary busy/idle label also falls short because the ratio of busy to idle programs may not match the hardware's GPU-to-CPU capacity ratio. When it does not, one tier sits underutilized while the other is oversubscribed, wasting memory or forcing unnecessary evictions. We present MORI, an agent serving system that solves the above problem. Our key insight is that idleness is a continuous, relative spectrum. MORI ranks all active programs by idleness, assigns the busiest to GPU HBM and the most idle to CPU DRAM, dynamically shifts the partition boundary to match hardware capacity, and enforces admission control at each memory tier. Evaluated on real coding agent workloads collected from Claude Code across four GPU and model pairs, MORI delivers 20--71% higher throughput and 18--43% lower TTFT than the best baseline with offloading.
toXiv_bot_toot