Tootfinder

I have a dual-boot setup with Debian and Elementary on my laptop, because Elementary was my very first Linux distro, so it’s got a place in my heart.
Anyway, here are some shirts I own, along with two logos and a tux I made at work using the Plasma CNC!
#ElementaryOS #Elementary

#running slow is hard but my fitness is such that it requires a rebuild of the foundation. Trying to stay in HR2 means a decent amount of walking interspersed. I don’t love it, but it’s necessary.
I have a much more open schedule now, so I should be able to get out and run regularly. The trick will be staying patient and trusting the process.

GRAFT: GRaPH and Table Reasoning for Textual Alignment -- A Benchmark for Structured Instruction Following and Visual Reasoning
Abhigya Verma, Sriram Puttagunta, Seganrasan Subramanian, Sravan Ramachandran
https://arxiv.org/abs/2508.15690

GRAFT: GRaPH and Table Reasoning for Textual Alignment -- A Benchmark for Structured Instruction Following and Visual Reasoning
GRAFT is a structured multimodal benchmark for evaluating models on instruction-following, visual reasoning, and visual-textual alignment tasks. It features programmatically generated charts and synthetically rendered tables, created with Python visualization libraries to ensure control over data semantics, structure, and clarity. Each GRAFT instance pairs a chart or table image with a systematically generated, multi-step analytical question based solely on visual content. Answers are provided …

Generalized DP-colorings of digraphs
Lucas Picasarri-Arrieta, Michael Stiebitz
https://arxiv.org/abs/2509.17471 https://arxiv.org/pdf/2509.17471

Generalized DP-colorings of digraphs
In this paper we consider the following three coloring concepts for digraphs. First of all, the generalized coloring concept, in which the same colored vertices of a digraph induce a subdigraph that satisfies a given digraph property. Second, the concept of variable degeneracy, introduced for graphs by Borodin, Kostochka and Toft in 2000; this allows to give a common generalization of the point partition number and the list dichromatic number. Finally, the DP-coloring concept as introduced for …

one of the great leaders of the Internets!
KUMBAYA.18 FEBRUARY 05
#airbag

Precoloring extension with demands on paths
Arun Kumar Das, Michal Opler, Tom\'a\v{s} Valla
https://arxiv.org/abs/2509.18936 https://arxiv.org/pdf/2509…

Precoloring extension with demands on paths
Let $G$ be a graph with a set of precolored vertices, and let us be given an integer distance parameter $d$ and a set of integer demands $d_1,\dots,d_c$. The Distance Precoloring Extension with Demands (DPED) problem is to compute a vertex $c$-coloring of $G$ such that the following three conditions hold: (i) the resulting coloring respects the colors of the precolored vertices, (ii) the distance of two vertices of the same color is at least $d$, and (iii) the number of vertices colored by colo…

CAD model of the #tricycle subframe. The chain ring is very nearly as big as the front wheel (80 teeth!). It drives an epicyclic gearbox mounted in the nose of the vehicle, which also has a disc brake. The epicyclic will drive a secondary chain via a sprocket mounted to the left hand spoke flange, but this is not yet shown. There will be no ratchet on the secondary chain, so the disk brake on the…

Uniform and Tunable Structural Colors based on Ultrathin Lignin Optical Coatings
Bang An, Anran Mao, Torbjorn Pettersson, Wei Li, Shouxin Liu, Anna J. Svagan, Ravi Shanker
https://arxiv.org/abs/2508.12902

Uniform and Tunable Structural Colors based on Ultrathin Lignin Optical Coatings
Structural coloration offers a sustainable and non-fading alternative to conventional pigment- and dye-based colorants. In this study, we present a scalable strategy for generating vivid, tunable structural colors using ultrathin films of industrial kraft lignin. By employing solvent fractionation to isolate a methanol-soluble lignin fraction, followed by spin-coating onto silicon substrates, we achieve highly uniform films with controllable thickness. The observed colors originate from thin-fi…

Late February in my (first) freshman year and I am literally flunking out of the University of Michigan’s Residential College because I hated it so I set up a cot in some high school friends' dorm room across campus and didn’t attend any classes so why not hitchhike to Boulder and back over the week-long winter break. Here we are with our thumbs out, beginning our trip on State St. in front of the Michigan Union.
People, Nebraska is fucking cold in February.

Binomiality of colored Gaussian models
Benjamin Biaggi, Jan Draisma, Magdal\'ena Mi\v{s}inov\'a
https://arxiv.org/abs/2507.06437 https://

Binomiality of colored Gaussian models
Following earlier work by Coons-Maraj-Misra-Sorea and Misra-Sullivant, we study colored, undirected Gaussian graphical models, and present a necessary and sufficient condition for such a model to have binomial vanishing ideal. These conditions involve Jordan schemes, a variant of association schemes, well-known structures in algebraic combinatorics. Using association schemes without transitive group action, we refute the conjecture by Coons-Maraj-Misra-Sorea that binomiality implies that the co…