Tootfinder

I love international #rugby. Still, every time I watch a match between a heavyweight and a 2nd- or 3rd-tier country, I can't help but be disgusted by the vast gulf, created solely by money and the refusal of those with it to share the wealth, separating the teams. I want to see Samoa or Spain or Uruguay play England or New Zealand or France with the realistic goal of doing more than scoring a try or a …

🇺🇦 #NowPlaying on KEXP's #MiddayShow
Dry Bread:
🎵 Yamar
#DryBread
https://eccentricsoul45s.bandcamp.com/track/yamar
https://open.spotify.com/track/0Rx9XoPyj5WmDa4EtppsAZ

MUTE-DSS: A Digital-Twin-Based Decision Support System for Minimizing Underwater Radiated Noise in Ship Voyage Planning
Akash Venkateshwaran, Indu Kant Deo, Rajeev K. Jaiman
https://arxiv.org/abs/2508.01907

MUTE-DSS: A Digital-Twin-Based Decision Support System for Minimizing Underwater Radiated Noise in Ship Voyage Planning
We present a novel MUTE-DSS, a digital-twin-based decision support system for minimizing underwater radiated noise (URN) during ship voyage planning. It is a ROS2-centric framework that integrates state-of-the-art acoustic models combining a semi-empirical reference spectrum for near-field modeling with 3D ray tracing for propagation losses for far-field modeling, offering real-time computation of the ship noise signature, alongside a data-driven Southern resident killer whale distribution mode…

A sufficient condition for planar graphs with maximum degree eight to be totally 9-colorable
Zakir Deniz, Hakan Guler
https://arxiv.org/abs/2509.04044 https://

A sufficient condition for planar graphs with maximum degree eight to be totally 9-colorable
A total coloring of a graph $G$ is a coloring of the vertices and edges such that two adjacent or incident elements receive different colors. The minimum number of colors required for a total coloring of a graph $G$ is called the total chromatic number, denoted by $χ''(G)$. Let $G$ be a planar graph of maximum degree eight. It is known that $9\leq χ''(G) \leq 10$. We here prove that $χ''(G)=9$ when the graph does not contain any subgraph isomorphic to a $4$-fan.

Reporters sans frontières met en cause CNews pour sa couverture de l’affaire de Crépol et saisit l’Arcom
https://www.lemonde.fr/actualite-medias/article/2025/…

Reporters sans frontières met en cause CNews pour sa couverture de l’affaire de Crépol et saisit l’Arcom
RSF dénonce une « campagne de dénigrement » orchestrée par CNews et alerte sur les conséquences du harcèlement subi par les auteurs de « Une nuit en France ».

Ilmaston lämpeneminen muuttaa perhoslajistoa – etelään uusia lajeja, pohjoisen perhoset kärsivät https://www.maaseuduntulevaisuus.fi/metsa/dac88bd8-c8d1-4562-9a89-db4c7e422a87

Ilmaston lämpeneminen muuttaa perhoslajistoa – etelään uusia lajeja, pohjoisen perhoset kärsivät
Osa perhosista hyötyy lämpenevästä ilmastosta. Toisaalta lämpeneminen pienentää arktisen alueen lajien elinympäristöjä.

The Basic B*** Effect: The Use of LLM-based Agents Reduces the Distinctiveness and Diversity of People's Choices
Sandra C. Matz, C. Blaine Horton, Sofie Goethals
https://arxiv.org/abs/2509.02910

The Basic B*** Effect: The Use of LLM-based Agents Reduces the Distinctiveness and Diversity of People's Choices
Large language models (LLMs) increasingly act on people's behalf: they write emails, buy groceries, and book restaurants. While the outsourcing of human decision-making to AI can be both efficient and effective, it raises a fundamental question: how does delegating identity-defining choices to AI reshape who people become? We study the impact of agentic LLMs on two identity-relevant outcomes: interpersonal distinctiveness - how unique a person's choices are relative to others - and intrapersona…

Ornamentation lattices and intreeval hypergraphic lattices
Antoine Abram, Jose Bastidas, F\'elix G\'elinas, Vincent Pilaud, Andrew Sack
https://arxiv.org/abs/2508.01606 …

Ornamentation lattices and intreeval hypergraphic lattices
Given a directed graph $D$ with transitive closure $\operatorname{tc}(D)$ and path hypergraph $\mathbb{P}(D)$, we study the connections between the (acyclic) reorientation poset of $\operatorname{tc}(D)$, the (acyclic) sourcing poset of $\mathbb{P}(D)$, and the (acyclic) ornamentation poset of $D$. Geometrically, the acyclic reorientation poset of $\operatorname{tc}(D)$ (resp. the acyclic sourcing poset of $\mathbb{P}(D)$) is the transitive closure of the skeleton of the graphical zonotope of $…

Gravitational memory meets astrophysical environments: exploring a new frontier through osculations
Rishabh Kumar Singh, Shailesh Kumar, Abhishek Chowdhuri, Arpan Bhattacharyya
https://arxiv.org/abs/2509.01676

Gravitational memory meets astrophysical environments: exploring a new frontier through osculations
We present the first study of how dark matter environments influence nonlinear gravitational memory from intermediate-mass-ratio binaries. Incorporating dark matter effects-gravitational potential, dynamical friction, and accretion-we compute nonlinear memory for both bound and unbound orbits under dark matter minispikes and Navarro-Frenk-White profiles. For quasi-circular orbits within a minispike profile, we further account empirically for the evolution of the dark matter density. Our finding…

Sparsity, Stress-Independence and Globally Linked Pairs in Graph Rigidity Theory
D\'aniel Garamv\"olgyi, Bill Jackson, Tibor Jord\'an
https://arxiv.org/abs/2509.03150

Sparsity, Stress-Independence and Globally Linked Pairs in Graph Rigidity Theory
A graph is $\mathcal{R}_d$-independent (resp. $\mathcal{R}_d$-connected) if its $d$-dimensional generic rigidity matroid is free (resp. connected). A result of Maxwell from 1867 implies that every $\mathcal{R}_d$-independent graph satisfies the sparsity condition $|E(H)|\leq d|V(H)|-\binom{d+1}{2}$ for all subgraphs $H$ with at least $d+1$ vertices. Several other families of graphs $G$ arising naturally in rigidity theory, such as minimally globally $d$-rigid graphs, are kno…