Tootfinder

🇺🇦 #NowPlaying on KEXP's #SeekAndDestroy
Mar:
🎵 Not Afraid To Die
#Mar
https://m-a-r.bandcamp.com/track/not-afraid-to-die-feat-lex-santiago

'Petty and unserious': Padilla blasts Vance for calling him 'Jose Padilla' (Giselle Ruhiyyih Ewing/Politico)
https://www.politico.com/news/2025/06/21/alex-padilla-jd-vance-fight-00416393
http://www.memeorandum.com/250621/p36#a250621p36

Investigating silicate, carbon, and water in the diffuse interstellar medium: the first shots from WISCI
S. T. Zeegers, Jonathan P. Marshall, Karl D. Gordon, Karl A. Misselt, G. P. P. L. Otten, Jeroen Bouwman, Jean Chiar, Marjorie Decleir, Thavisha Dharmawardena, F. Kemper, Aigen Li, Mayank Narang, Alexey Potapov, Manoj Puravankara, Peter Scicluna, Himanshu Tyagi, Eleonora Zari, ChuanYu Wei, Lex Kaper, Frank Backs, Stefan T. Bromley, Laurie Chu, Elisa Costantini, T. R. Geballe, Joel D.…

Investigating silicate, carbon, and water in the diffuse interstellar medium: the first shots from WISCI
The dusty interstellar medium (ISM) of the Milky Way is distributed in a complex, cloudy structure. It is fundamental to the radiation balance within the Milky Way, provides a reaction surface to form complex molecules, and is the feedstock for future generations of stars and planets. The life cycle of interstellar dust is not completely understood, and neither are its structure nor composition. The abundance, composition, and structure of dust in the diffuse ISM can be determined by combining …

IT'S PRIDE MONTH, SSR!! We will be riding slow as usual, meeting new people, and enjoying an educational tour of some historical queer sites between the Castro, Mission, and SOMA.
Start Location: Dolores Park, 19th Street
Meetup: 10:30am Saturday, June 28th
Rollout: 11:00am

Parallel Complexity of Depth-First-Search and Maximal path
Archit Chauhan, Samir Datta, M. Praveen
https://arxiv.org/abs/2506.14974 https://

Parallel Complexity of Depth-First-Search and Maximal path
Constructing a Depth First Search (DFS) tree is a fundamental graph problem, whose parallel complexity is still not settled. Reif showed parallel intractability of lex-first DFS. In contrast, randomized parallel algorithms (and more recently, deterministic quasipolynomial parallel algorithms) are known for constructing a DFS tree in general (di)graphs. However a deterministic parallel algorithm for DFS in general graphs remains an elusive goal. Working towards this, a series of works gave deter…

Should the Raiders Add a Right Tackle? https://www.si.com/nfl/raiders/las-vegas-alex-cappa-george-fant-dallas-cowboys-pete-carroll

Breaking Symmetries with Involutions
Michael Codish, Mikol\'a\v{s} Janota
https://arxiv.org/abs/2506.02903 https://arxiv.org/pdf/…

Breaking Symmetries with Involutions
Symmetry breaking for graphs and other combinatorial objects is notoriously hard. On the one hand, complete symmetry breaks are exponential in size. On the other hand, current, state-of-the-art, partial symmetry breaks are often considered too weak to be of practical use. Recently, the concept of graph patterns has been introduced and provides a concise representation for (large) sets of non-canonical graphs, i.e.\ graphs that are not lex-leaders and can be excluded from search. In particular…

What is Happening With the Raiders' Offensive Line in OTAs? https://www.si.com/nfl/raiders/las-vegas-alex-cappa-jackson-powers-johnson-dj-glaze-pete-carroll