Tootfinder

@… https://darkforcesswing.substack.com/

Dark Forces Swing Blind Punches | Hank Shteamer | Substack
Hank Shteamer writes about music. Click to read Dark Forces Swing Blind Punches, by Hank Shteamer, a Substack publication with thousands of subscribers.

Wie wichtig ist Deutschland eigentlich (Schul-)Bildung?
Berlin und Brandenburg: „Nein“
https://Pertsch.social/@Sebastian/115167492688001099

Evaluating Multiple Instance Learning Strategies for Automated Sebocyte Droplet Counting
Maryam Adelipour, Gustavo Carneiro, Jeongkwon Kim
https://arxiv.org/abs/2509.04895 https…

Evaluating Multiple Instance Learning Strategies for Automated Sebocyte Droplet Counting
Sebocytes are lipid-secreting cells whose differentiation is marked by the accumulation of intracellular lipid droplets, making their quantification a key readout in sebocyte biology. Manual counting is labor-intensive and subjective, motivating automated solutions. Here, we introduce a simple attention-based multiple instance learning (MIL) framework for sebocyte image analysis. Nile Red-stained sebocyte images were annotated into 14 classes according to droplet counts, expanded via data augme…

Q&A with Anthropic CEO Dario Amodei on Anthropic's growth to ~$5B in ARR, focusing on B2B, AI talent wars, open-source models, safety regulations, and more (John Collison/Cheeky Pint)
https://cheekypint.substack.com/p/a-cheeky-pint-with-anthropic-ceo

A Cheeky Pint with Anthropic CEO Dario Amodei
Dario Amodei joins John Collison to talk about Anthropic's growth to almost $5 billion in ARR, how AI models show capitalistic impulses, predictions for an agentic future, the economics of model businesses, and the 19th-century concept of vitalism.

Spectral Tur\'{a}n problem for $\mathcal{{K}}_{3,3}^{-}$-free signed graphs
Mingsong Qin, Dan Li
https://arxiv.org/abs/2508.05500 https://arxiv.org/pdf…

Spectral Turán problem for $\mathcal{K}_{3,3}^{-}$-free signed graphs
The classical spectral Turán problem is to determine the maximum spectral radius of an $\mathcal{F}$-free graph of order $n$. Zhai and Wang [Linear Algebra Appl, 437 (2012) 1641-1647] determined the maximum spectral radius of ${C}_{4}$-free graphs of given order. Additionally, Nikiforov obtained spectral strengthenings of the Kővari-Sós-Turán theorem [Linear Algebra Appl, 432 (2010) 1405-1411] when the forbidden graphs are complete bipartite. The spectral Turán problem concerning forbidden…

RamPINN: Recovering Raman Spectra From Coherent Anti-Stokes Spectra Using Embedded Physics
Sai Karthikeya Vemuri, Adithya Ashok Chalain Valapil, Tim B\"uchner, Joachim Denzler
https://arxiv.org/abs/2510.06020

RamPINN: Recovering Raman Spectra From Coherent Anti-Stokes Spectra Using Embedded Physics
Transferring the recent advancements in deep learning into scientific disciplines is hindered by the lack of the required large-scale datasets for training. We argue that in these knowledge-rich domains, the established body of scientific theory provides reliable inductive biases in the form of governing physical laws. We address the ill-posed inverse problem of recovering Raman spectra from noisy Coherent Anti-Stokes Raman Scattering (CARS) measurements, as the true Raman signal here is suppre…

What can we do now?
"7. Urge friends, relatives, and acquaintances to avoid Trump propaganda outlets such as Fox News, Newsmax, X, and, increasingly, Facebook and Instagram."
https://robertreich.substack.com/p/what-you-can-do-f3d
via

What you can do now
A baker’s dozen of important steps to fight Trump fascism

@… https://collectedephemera.substack.com

Collected Ephemera | Jay Hinman | Substack
A deep dive into the paper, magazines and marginal collectables I've accumulated over the years, especially 60s & 70s political rabble-rousing, underground music, smut, hippy/biker stuff, postcards and much else. Click to read Collected Ephemera, by Jay Hinman, a Substack publication. Launched 2 hours ago.

A spectral condition for Hamilton cycles in tough bipartite graphs
Lianyang Ai, Wenqian Zhang
https://arxiv.org/abs/2508.03778 https://arxiv.org/pdf/2508.0…

A spectral condition for Hamilton cycles in tough bipartite graphs
Let $G$ be a graph. The {\em spectral radius} of $G$ is the largest eigenvalue of its adjacency matrix. For a non-complete bipartite graph $G$ with parts $X$ and $Y$, the {\em bipartite toughness} of $G$ is defined as $t^{B}(G)=\min\left\{\frac{|S|}{c(G-S)}\right\}$, where the minimum is taken over all proper subsets $S\subset X$ (or $S\subset Y$) such that $c(G-S)>1$. In this paper, we give a sharp spectral radius condition for balanced bipartite graphs $G$ with $t^{B}(G)\geq1$ to gu…

Neuro-Spectral Architectures for Causal Physics-Informed Networks
Arthur Bizzi, Leonardo M. Moreira, M\'arcio Marques, Leonardo Mendon\c{c}a, Christian J\'unior de Oliveira, Vitor Balestro, Lucas dos Santos Fernandez, Daniel Yukimura, Pavel Petrov, Jo\~ao M. Pereira, Tiago Novello, Lucas Nissenbaum
https://arxiv.org/abs/2509.04966

Neuro-Spectral Architectures for Causal Physics-Informed Networks
Physics-Informed Neural Networks (PINNs) have emerged as a powerful neural framework for solving partial differential equations (PDEs). However, standard MLP-based PINNs often fail to converge when dealing with complex initial-value problems, leading to solutions that violate causality and suffer from a spectral bias towards low-frequency components. To address these issues, we introduce NeuSA (Neuro-Spectral Architectures), a novel class of PINNs inspired by classical spectral methods, designe…