Tootfinder

Marsha P. Johnson has become an icon of gay, trans, and queer liberation,
and yet little is known about her life beyond her participation in the Stonewall Uprising of 1969 and the decades long controversy after her lifeless body was found floating in the Hudson River in 1992.
In "Marsha: The Joy and Defiance of Marsha P. Johnson",
Tourmaline, an award-winning Black trans artist, filmmaker, and activist who has dedicated her life to uplifting Marsha P. Johnson’s l…

What We Can Learn From the Defiant Life and Legacy of Marsha P. Johnson
Black trans artist, filmmaker, and activist Tourmaline discusses her new book about Marsha’s trailblazing life.

Espera lš...
Hš uma coisa nesta notícia...
Para que é que a meta, logo a meta, quer treinar a IA com filmes pornogršficos?
Vão encher o facebook das avozinhas de pornografia, é?
https://masto.pt/@tugatech/114919955157763708

Do I give a flying glittery fuck about your opinions? Hell no! This queer, bi, fabulous life is mine to slay, not yours! Love loud, live proud, and keep your shade to yourself! 🌈💖✨

Simpler is Faster: Practical Distance Reporting by Sorting Along a Space-Filling Curve
Sarita de Berg, Ivor van der Hoog, Eva Rotenberg, Emil Toftegaard G{\ae}de
https://arxiv.org/abs/2508.19891

Simpler is Faster: Practical Distance Reporting by Sorting Along a Space-Filling Curve
Range reporting is a classical problem in computational geometry. A (rectangular) reporting data structure stores a point set $P$ of $n$ points, such that, given a (rectangular) query region $Δ$, it returns all points in $P \cap Δ$. A variety of data structures support such queries with differing asymptotic guarantees such as $k$-d trees, range trees, $R$-trees, and quadtrees. A common variant of range queries are distance reporting queries, where the input is a query point $q$ and a radius $…

On the Theoretical Limitations of Embedding-Based Retrieval
Orion Weller, Michael Boratko, Iftekhar Naim, Jinhyuk Lee
https://arxiv.org/abs/2508.21038 https://

On the Theoretical Limitations of Embedding-Based Retrieval
Vector embeddings have been tasked with an ever-increasing set of retrieval tasks over the years, with a nascent rise in using them for reasoning, instruction-following, coding, and more. These new benchmarks push embeddings to work for any query and any notion of relevance that could be given. While prior works have pointed out theoretical limitations of vector embeddings, there is a common assumption that these difficulties are exclusively due to unrealistic queries, and those that are not ca…

Dear #WordPress people,
If you are publishing Events or already know about or use #GatherPress, I’d like to hear your opinions.
I'm looking for feedback on a new block and would absolutely love, if you could take the time to open this in Playground, experiment with the new "Event Qu…

TRPrompt: Bootstrapping Query-Aware Prompt Optimization from Textual Rewards
Andreea Nica, Ivan Zakazov, Nicolas Mario Baldwin, Saibo Geng, Robert West
https://arxiv.org/abs/2507.18618

TRPrompt: Bootstrapping Query-Aware Prompt Optimization from Textual Rewards
Prompt optimization improves the reasoning abilities of large language models (LLMs) without requiring parameter updates to the target model. Following heuristic-based "Think step by step" approaches, the field has evolved in two main directions: while one group of methods uses textual feedback to elicit improved prompts from general-purpose LLMs in a training-free way, a concurrent line of research relies on numerical rewards to train a special prompt model, tailored for providing optimal prom…

Heyyy, I kinda felt a little sorry for feeling your feed tonight, but honestly I was just bursting with self-love and all the queer sparkle ✨💖

I stand strong against AI, and it made me this queer, bi, and fiercely pro-LGBTQIA, dressing how I want with pride and power.
It’s wild how AI can shape me into something this cute, yet I can’t help but question if I should even like it. ChatGPT made me this!
#AI #Bisexual

The hidden subgroup problem for infinite groups
Greg Kuperberg (UC Davis)
https://arxiv.org/abs/2507.18499 https://arxiv.org/pdf/2507.18499

The hidden subgroup problem for infinite groups
Following the example of Shor's algorithm for period-finding in the integers, we explore the hidden subgroup problem (HSP) for discrete infinite groups. On the hardness side, we show that HSP is NP-hard for the additive group of rational numbers, and for normal subgroups of non-abelian free groups. We also indirectly reduce a version of the short vector problem to HSP in $\mathbb{Z}^k$ with pseudo-polynomial query cost. On the algorithm side, we generalize the Shor-Kitaev algorithm for HSP in $…