Tootfinder

Opt-in global Mastodon full text search. Join the index!

@EarthOrgUK@mastodon.energy
2025-12-15 03:23:04

Wren Loud and Bold Ambient (2021-06) - Ambient soundscape from 16WW back garden birdlife; small bird makes big noise! #wren #soundscape #fieldRecording -

Wren Loud and Bold Ambient (2021-06)
Ambient soundscape from 16WW back garden birdlife; small bird makes big noise! #wren #soundscape #fieldRecording

@emd@cosocial.ca
2025-12-10 01:55:10

My 2018 Nissan Leaf has had no maintenance needed in 7 years (besides the usual tire rotation, brake check, etc).
Love it so much we bought a 2024 as well. mas.to/@carnage4life/115691608

Dare Obasanjo (@carnage4life@mas.to)
Consumer Reports ranking Teslas as the least reliable used car is a surprise. I've heard so much about the low total cost of ownership of EVs, I assumed that they didn't need much maintenance. It seems they are a lot less reliable after the five year mark. They looked at problems reported on cars from the 2016 to 2021 model years across 140,000 vehicles to get these results. https://www.thedrive.com/news/tesla-barely-beats-jeep-for-least-reliable-used-car-owner-survey-says

@Mediagazer@mstdn.social
2025-10-29 23:05:59

Crypto media company Blockworks is closing its newsroom, launched in 2021, and will focus on software and data, continuing its main newsletters and podcasts (Pooja Rajkumari/TheStreet)
thestreet.com/crypto/jobs/bloc

@NFL@darktundra.xyz
2025-09-23 12:19:17

Return of the Mac? Five things we've learned about QB Mac Jones after latest starting stint espn.com/nfl/story/_/id/463477

Five things we've learned about 49ers QB Mac Jones in 2025 - ESPN
The 2021 No. 15 pick started the 49ers' past two games after a Brock Purdy toe injury.

@arXiv_mathCO_bot@mastoxiv.page
2025-10-01 09:23:17

Optimally building spanning graphs in semirandom graph processes
Michael Anastos, Maur\'icio Collares, Joshua Erde, Mihyun Kang, Dominik Schmid, Gregory B. Sorkin
arxiv.org/abs/2509.26028

Optimally building spanning graphs in semirandom graph processes
The semirandom graph process constructs a graph $G$ in a series of rounds, starting with the empty graph on $n$ vertices. In each round, a player is offered a vertex $v$ chosen uniformly at random, and chooses an edge on $v$ to add to $G$. The player's aim is to make $G$ satisfy some property as quickly as possible. Our interest is in the property that $G$ contain a given $n$-vertex graph $H$ with maximum degree $Δ$. In 2021, Ben-Eliezer, Gishboliner, Hefetz and Krivelevich showed that there i…