Tootfinder

'Let me see the videotapes': Mark Epstein wants Steve Bannon's 15 hours of unseen footage of his brother (Vaughn Hillyard/NBC News)
https://www.nbcnews.com/politics/trump-administration/mark-epstein-steve-bannon-15-hours-brother-jeffrey-epstein-rcna219630
http://www.memeorandum.com/250719/p21#a250719p21

De afdeling klimaat van CEO, Corporate Europe Observatory, heeft lezenwaardige stukken. Het eerste stuk gaat over de Europese plannen voor groene waterstof en de lobby van Big Oil om daar met hun vuile handen aan te zitten en zo bakken subsidie binnen te harken.
https://corporateeurope.org/en/climate

Alle media blaten weer na dat Trump ‘binnen twee weken’ gaat beslissen of de VS meedoet aan de oorlog van Israël tegen Iran.
Zucht.
“Over twee weken” is de standaard formule als Trump geen idee heeft. Hij herhaalt die even gemakkelijk twee of drie weken later opnieuw. En opnieuw. Sancties tegen Rusland zouden twee maanden geleden ook ‘binnen twee weken’ ingesteld worden.

'Let me see the videotapes': Mark Epstein wants Steve Bannon's 15 hours of unseen footage of his brother
https://www.nbcnews.com/politics/trump-administration/mark-epstein-steve-bannon-15-hours-brother-jeffrey-epstein-rcna219630

Replaced article(s) found for cs.LG. https://arxiv.org/list/cs.LG/new
[6/7]:
- Resolving UnderEdit & OverEdit with Iterative & Neighbor-Assisted Model Editing
Bhiman Kumar Baghel, Scott M. Jordan, Zheyuan Ryan Shi, Xiang Lorraine Li

Ich hatte einen Aufguss von 22 Bahnen erwartet. Aber das ist es nicht geworden. Zwischendurch war mir ein bisschen viel Drama, aber das Ende schafft Zuversicht und versöhnt einiges. #büchernase #lesen #büchergildegutenberg

Stich in Oberschenkel - Favoriten: Zwei blutige Attacken binnen Stunden! #News #Nachrichten

Transversal packings in families of percolated hypergraphs
Jie Han, Jie Hu, Shunan Wei, Donglei Yang
https://arxiv.org/abs/2507.12740 https://

Transversal packings in families of percolated hypergraphs
Let $F$ be a strictly $1$-balanced $k$-graph on $s$ vertices with $t$ edges and $δ_{F,d}^T$ be the infimum of $δ>0$ such that for every $α>0$ and sufficiently large $n\in \mathbb{N}$, every $k$-graph system $\mathbf H=\{H_{1}, H_{2}, \dots ,H_{tn}\}$ on the same $sn$ vertices with $δ_d(H_i)\ge (δ+α)\binom{sn-d}{k-d}$, $i\in [tn]$ contains a transversal $F$-factor, that is, an $F$-factor consisting of exactly one edge from each $H_i$. In this paper we prove the following result. Let $\math…

Der
International Day for Women in Maritime wurde auch in Douala, Kamerun 🇨🇲 gefeiert.
Im Foyer du Marin traf sich die örtliche WISTA* Gruppe und unsere dortige Mitarbeiterin Ina Bammann ist jetzt Mitglied.
*Women in shipping trade association - für Frauen in maritimen Berufen
Das Foto zeigt die Kameruner WISTA Frauen mit dem Leitungspaar unseres Foyer, Ina und Klaus Bammann

A group-theoretic approach to Shannon capacity of graphs and a limit theorem from lattice packings
Pjotr Buys, Sven Polak, Jeroen Zuiddam
https://arxiv.org/abs/2506.14654

A group-theoretic approach to Shannon capacity of graphs and a limit theorem from lattice packings
We develop a group-theoretic approach to the Shannon capacity problem. Using this approach we extend and recover, in a structured and unified manner, various families of previously known lower bounds on the Shannon capacity. Bohman (2003) proved that, in the limit $p\to\infty$, the Shannon capacity of cycle graphs $Θ(C_p)$ converges to the fractional clique covering number, that is, $\lim_{p \to \infty} p/2 - Θ(C_p) = 0$. We strengthen this result by proving that the same is true for all frac…