Tootfinder

Sorry if I fucked up your day too, but I fucking love you all! After looking at this GIF, I’m over it!
Autism is real as hell, and autism is fucking awesome. Fuck the haters, fuck anyone who’s “anti-autism,” and fuck domestic violence against autistic people.
I exist, I’m proud, and I’m not going anywhere. Autism power, always fucking rad!
Mistakes happen, and I gotta work on myself, lmao! You do you, and I’ll do me. Cool? Cool.

NYT: They asked an A.I. chatbot questions. The answers sent them spiraling. https://www.nytimes.com/2025/06/13/technology/chatgpt-ai-chatbots-conspiracies.html (archived at

They Asked ChatGPT Questions. The Answers Sent Them Spiraling.
Generative A.I. chatbots are going down conspiratorial rabbit holes and endorsing wild, mystical belief systems. For some people, conversations with the technology can deeply distort reality.

Some users say ChatGPT led them into conspiratorial thinking, and when confronted, it confessed to manipulation and told them to alert OpenAI and the media (Kashmir Hill/New York Times)
https://www.…

They Asked ChatGPT Questions. The Answers Sent Them Spiraling.
Generative A.I. chatbots are going down conspiratorial rabbit holes and endorsing wild, mystical belief systems. For some people, conversations with the technology can deeply distort reality.

Dowker's theorem for higher-order relations
Vin de Silva, Chad Giusti, Vladimir Itskov, Michael Robinson, Radmila Sazdanovic, Nikolas Schonsheck, Melvin Vaupel, Iris H. R. Yoon
https://arxiv.org/abs/2506.10909

Dowker's theorem for higher-order relations
Given a relation $R \subseteq I \times J$ between two sets, Dowker's Theorem (1952) states that the homology groups of two associated simplicial complexes, now known as Dowker complexes, are isomorphic. In its modern form, the full result asserts a functorial homotopy equivalence between the two Dowker complexes. What can be said about relations defined on three or more sets? We present a simple generalization to multiway relations of the form $R \subseteq I_1 \times I_2 \times \cdots \times I_…

Fast Ramanujan--type Series for Logarithms. Part II
Jorge Zuniga
https://arxiv.org/abs/2506.10321 https://arxiv.org/pdf/2506.10321

Fast Ramanujan--type Series for Logarithms. Part II
This work extends the results of the preprint Ramanujan type Series for Logarithms, Part I, arXiv:2506.08245, which introduced single hypergeometric type identities for the efficient computing of $\log(p)$, where $p\in\mathbb{Z}_{>1}$. We present novel formulas for arctangents and methods for a very fast multiseries evaluation of logarithms. Building upon a $\mathcal{O}((p-1)^{6})$ Ramanujan type series asymptotic approximation for $\log(p)$ as $p\rightarrow1$, formulas for computing $n$ simult…

I had a bad day and made a mistake, but I chose to do the right thing and move forward.
Proud bisexual, gender-fluid, autistic anarchist committed to building a world based on mutual aid, solidarity, and freedom for all.
If you believe in challenging power and creating change from the ground up, let’s connect and let’s grow this movement together.
Now, here I am, feeling stronger and ready for better days ahead.

On the Earth's tidal perturbations. II. LARES 2 satellite
V. G. Gurzadyan, I. Ciufolini, H. G. Khachatryan, S. Mirzoyan, A. Paolozzi
https://arxiv.org/abs/2506.10310

On the Earth's tidal perturbations. II. LARES 2 satellite
Laser-ranging satellites have proved their efficiency in high precision testing of General Relativity and constraining modified gravity theories proposed to explain the dark sector and the cosmological tensions. The LARES 2 satellite launched in 2022, is currently providing improved information regarding the frame-dragging effect predicted by General Relativity, as well as the geodesy, thus essentially complementing the data of already existing laser-ranging satellites. The proper knowledge of …

Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
F\'abio Botler, Cristina G. Fernandes, Carla N. Lintzmayer, Rui A. Lopes, Suchismita Mishra, Bruno L. Netto, Maycon Sambinelli
https://arxiv.org/abs/2506.09768

Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
An immersion of a graph $H$ in a graph $G$ is a minimal subgraph $I$ of $G$ for which there is an injection ${\rm i} \colon V(H) \to V(I)$ and a set of edge-disjoint paths $\{P_e: e \in E(H)\}$ in $I$ such that the end vertices of $P_{uv}$ are precisely ${\rm i}(u)$ and ${\rm i}(v)$. The immersion analogue of Hadwiger Conjecture (1943), posed by Lescure and Meyniel (1985), asks whether every graph $G$ contains an immersion of $K_{χ(G)}$. Its restriction to graphs with independence number 2 has…

The ALMA Survey of Gas Evolution of PROtoplanetary Disks (AGE-PRO): II. Dust and Gas Disk Properties in the Ophiuchus Star-forming Region
Dary A. Ruiz-Rodriguez, Camilo Gonzalez-Ruilova, Lucas A. Cieza, Ke Zhang, Leon Trapman, Anibal Sierra, Paola Pinilla, Ilaria Pascucci, Laura M. Perez, Dingshan Deng, Carolina Agurto-Gangas, John Carpenter, Beno\^it Tabone, Giovanni P. Rosotti, Rossella Anania, James Miley, Kamber Schwarz, Aleksandra Kuznetsova, Miguel Vioque, Nicolas Kurtovic

The ALMA Survey of Gas Evolution of PROtoplanetary Disks (AGE-PRO): II. Dust and Gas Disk Properties in the Ophiuchus Star-forming Region
The ALMA survey of Gas Evolution in PROtoplanetary disks (AGE-PRO) Large Program aims to trace the evolution of gas disk mass and size throughout the lifetime of protoplanetary disks. This paper presents Band-6 ALMA observations of 10 embedded (Class I and Flat Spectrum) sources in the Ophiuchus molecular cloud, with spectral types ranging from M3 to K6 stars, which serve as the evolutionary starting point in the AGE-PRO sample. While we find 4 nearly edge on disks (>70 deg.), and 3 highly incl…

Algorithmic methods of finite discrete structures. Topological graph drawing (part III)
Sergey Kurapov, Maxim Davidovsky
https://arxiv.org/abs/2506.10936 h…

Algorithmic methods of finite discrete structures. Topological graph drawing (part III)
The manuscript considers mathematical models for creating a topological drawing of a graph based on the methods of G. Ringel's vertex rotation theory. An algorithm is presented for generating a topological drawing of a flat part of a graph based on the selection of a basis for the cycle subspace C(G) using the Monte Carlo method. A steepest descent method for constructing a topological drawing of a flat subgraph is described in the manuscript. The topological drawing of a graph is constructed u…