Tootfinder

#Wordle 1,584 5/6*
⬜⬜⬜⬜🟨 <1% of 213,807 (150)
🟨🟨🟨⬜⬜ 0 of 29 (3)
⬜🟨🟨🟨⬜ 0 of 0 (1)
⬜🟩🟨🟩🟩 0 of 0 (1)
🟩🟩🟩🟩🟩
WordleBot
Skill 63/99
Luck 59/99
Killer wordle for me today. 1st user error on guess 3, then I could not think of ANY word for guess 4, was trying things at random, and it took what I would have thought was a proper name, and that got me the answer in guess 5!
Looked up guess 4 found other meanings, still not a wordle word.

Ok, yeah, I'm not done processing my anger over liberals doing shit like this. So this historian sees a rise in right wing violence, sees the US government carrying out ethnic cleansing, sees a rise in white supremacist terrorism, and then says, "oh yeah... this reminds me of a time right around the 1920s. Hum... yeah, ANARCHISTS fighting the government! Yeah, that's the same thing."
FFS, IT'S THE RED SUMMER! If you want a parallel between today and some horrible time in US history, TALK ABOUT THE RED SUMMER. The point of the language of dehumanization that the right uses, the point of all the anti-black and anti-emigrant rhetoric, is that it leads to genocide. Trump already carried out an act of genocide (#USPol

I used to link to sections of webpages using anchor links, or have jump links pointing to id tags.
I went back to a page where I've done this in the past, and the page has been entirely rewritten with non-semantic HTML. Class descriptors have random suffixes for CSS rather than providing semantic IDs that can be used as jump links as well as, uhhh, semantic organization of a web page.
There's a lot of bad things from the 1980s and 1990s that I am glad to leave behind, but…

The most probable order of a random permutation
Adrian Beker
https://arxiv.org/abs/2510.11698 https://arxiv.org/pdf/2510.11698

The most probable order of a random permutation
Given positive integers $n$ and $m$, let $p_n(m)$ be the probability that a uniform random permutation of $[n]$ has order exactly $m$. We show that, as $n \to \infty$, the maximum of $p_n(m)$ over all $m$ is asymptotic to $1/n$, the probability of an $n$-cycle. Furthermore, for sufficiently large $n$, we show that the maximum is attained precisely if $m$ is the least positive integer divisible by all positive integers less than or equal to $n-m$. This answers a question of Acan, Burnette, Eberh…

Selenskyj: Mehr als 20 Tote nach russischem Angriff
Bei einem russischen Angriff in der Region Donezk sind nach Behördenangaben aus Kiew mehr als 20 Zivilisten im Osten der Ukraine ums Leben gekommen. Die Menschen hätten für ihre Rentenzahlung angestanden, als die gelenkte Fliegerbombe eingeschlagen sei, schrieb der ukrainische Präsident Wolodymyr Selenskyj auf Telegram. "Brutaler russischer Luftangriff auf die ländliche Sied…
📑

Ukraine-Liveblog: ++ Selenskyj fordert Reaktion der G20-Staaten ++
Der ukrainische Präsident Selenskyj hat nach dem russischen Luftangriff in der Ostukraine eine Reaktion der G20-Staaten gefordert. Deutschland und Frankreich schlagen in einem Positionspapier neue EU-Sanktionen gegen Russland vor.

Bond percolation in distorted square and triangular lattices
Bishnu Bhowmik, Sayantan Mitra, Robert M Ziff, Ankur Sensharma
https://arxiv.org/abs/2509.09999 https://

Bond percolation in distorted square and triangular lattices
This article presents a Monte Carlo study on bond percolation in distorted square and triangular lattices. The distorted lattices are generated by dislocating the sites from their regular positions. The amount and direction of the dislocations are random, but can be tuned by the distortion parameter $α$. Once the sites are dislocated, the bond lengths $δ$ between the nearest neighbors change. A bond can only be occupied if its bond length is less than a threshold value called the connection t…

fev-bench: A Realistic Benchmark for Time Series Forecasting
Oleksandr Shchur, Abdul Fatir Ansari, Caner Turkmen, Lorenzo Stella, Nick Erickson, Pablo Guerron, Michael Bohlke-Schneider, Yuyang Wang
https://arxiv.org/abs/2509.26468

fev-bench: A Realistic Benchmark for Time Series Forecasting
Benchmark quality is critical for meaningful evaluation and sustained progress in time series forecasting, particularly given the recent rise of pretrained models. Existing benchmarks often have narrow domain coverage or overlook important real-world settings, such as tasks with covariates. Additionally, their aggregation procedures often lack statistical rigor, making it unclear whether observed performance differences reflect true improvements or random variation. Many benchmarks also fail to…

Lower Bounds for Linear Operators
Young Kun Ko
https://arxiv.org/abs/2509.02730 https://arxiv.org/pdf/2509.02730 …

Lower Bounds for Linear Operators
We consider a static data structure problem of computing a linear operator under cell-probe model. Given a linear operator $M \in \mathbb{F}_2^{m \times n}$, the goal is to pre-process a vector $X \in \mathbb{F}_2^n$ into a data structure of size $s$ to answer any query $\langle M_i , X \rangle$ in time $t$. We prove that for a random operator $M$, any such data structure requires: $$ t \geq Ω( \min \{ \log (m/s) , n / \log s \} ).$$ This result overcomes the well-known logarithmic barrier i…