Tootfinder

Cowboys' $13 million All-Pro return specialist named among Dallas' most tradable assets https://www.sportingnews.com/us/nfl/dallas-cowboys/news/cowboys-13-million-all-pro-r…

It’s great to see a publication say “Naw, Fuck AI.” Support them if you can.
#noAI

No AI: This is Why Your Radavist Membership Matters
 Kyle Klain and John were having a conversation yesterday, when Kyle shared some AI-generated slop from Women's Health magazine with John. Women's Health is owned by parent company Hearst Corporation. This entity made $13 billion in 2024, yet they have to use AI to generate imagery for a clickbait article claiming cycling is better for weight loss and fitness than walking... TL;DR: PLEASE SUPPORT OUR HUMAN-BEING-GENERATED CONTENT Kyle began his text with "You should fucking highlight this shit…

💩 Understanding ammonia energy's tradeoffs around the world
#energy

Understanding ammonia energy's tradeoffs around the world
Many people are optimistic about ammonia's potential as an energy source and carrier of hydrogen, and though large-scale adoption would require major changes to the way it is currently manufactured, ammonia does have a number of advantages. For one thing, ammonia is energy-dense and carbon-free. It is also already produced at scale and shipped around the world, primarily for use in fertilizer.

Hansen’s disease (leprosy)
is treatable today in large part because of the work of Alice Ball,
a 23-year-old chemist whose breakthrough turned a toxic folk remedy into the world’s first effective treatment.

A young Black scientist discovered a pivotal leprosy treatment in the 1920s − but an older colleague took the credit
Historians are working to shine a light on Alice Ball’s legacy and contributions to an early treatment of a dangerous and stigmatizing disease.

@… a different word would be so much better with the Norwegian accent:
turdification

Thermodynamic cost-controllability tradeoff in metabolic currency coupling
Jumpei F. Yamagishi, Tetsuhiro S. Hatakeyama
https://arxiv.org/abs/2602.01604 https://

#CoronaDischarges Glow on Trees Under Thunderstorms: https://agupubs.onlinelibrary.wiley.com/doi/10.1029/2025GL119591 -> Thunderstorms conjure ghostly coronae in treetops, observed outdoors for the first time: https://news.agu.org/press-release/thunderstorms-conjure-ghostly-coronae-in-treetops-observed-outdoors-for-the-first-time/ - the weak electric discharges may set off ultraviolet sparkles over large swaths of forest under storms, potentially impacting canopy health (this is fringe geophysics but some amateur astronomers are going after corona discharges - esp. in webcam images from mountain sites - with a vengeance, so here goes).

🇺🇦 #NowPlaying on #BBC6Music's #RileyAndCoe
The Heartbreakers:
🎵 One Track Mind
#TheHeartbreakers
https://johnnythunderstheheartbreakers.bandcamp.com/track/one-track-mind
https://open.spotify.com/track/2TLhF4o5uO3AxmocmswuZj

Hardness and Tractability of T_{h 1}-Free Edge Deletion
Ajinkya Gaikwad, Soumen Maity, Leeja R
https://arxiv.org/abs/2602.00644 https://arxiv.org/pdf/2602.00644 https://arxiv.org/html/2602.00644
arXiv:2602.00644v1 Announce Type: new
Abstract: We study the parameterized complexity of the T(h 1)-Free Edge Deletion problem. Given a graph G and integers k and h, the task is to delete at most k edges so that every connected component of the resulting graph has size at most h. The problem is NP-complete for every fixed h at least 3, while it is solvable in polynomial time for h at most 2.
Recent work showed strong hardness barriers: the problem is W[1]-hard when parameterized by the solution size together with the size of a feedback edge set, ruling out fixed-parameter tractability for many classical structural parameters. We significantly strengthen these negative results by proving W[1]-hardness when parameterized by the vertex deletion distance to a disjoint union of paths, the vertex deletion distance to a disjoint union of stars, or the twin cover number. These results unify and extend known hardness results for treewidth, pathwidth, and feedback vertex set, and show that several restrictive parameters, including treedepth, cluster vertex deletion number, and modular width, do not yield fixed-parameter tractability when h is unbounded.
On the positive side, we identify parameterizations that restore tractability. We show that the problem is fixed-parameter tractable when parameterized by cluster vertex deletion together with h, and also when parameterized by neighborhood diversity together with h via an integer linear programming formulation. We further present a fixed-parameter tractable bicriteria approximation algorithm parameterized by k. Finally, we show that the problem admits fixed-parameter tractable algorithms on split graphs and interval graphs, and we establish hardness for a directed generalization even on directed acyclic graphs.
toXiv_bot_toot

🇺🇦 #NowPlaying on #BBC6Music's #RileyAndCoe
The Heartbreakers:
🎵 One Track Mind
#TheHeartbreakers
https://johnnythunderstheheartbreakers.bandcamp.com/track/one-track-mind
https://open.spotify.com/track/2TLhF4o5uO3AxmocmswuZj