Tootfinder

BALD IST WEIHNACHTEN! 😃
Mohn-Orangen-Plätzchen
Bei diesem Rezept leistet eine Gebäckpresse mit Strang-Formscheibe sehr gute Dienste. Eine dritte Hand zum Abschneiden mit einem Messer ist hilfreich.
Werbung: Rezept ist aus meinem Weihnachtsplätzchenbuch, ISBN: 9783756855209

Oh great, new issue spam attack on @…. People really have too much time on their hands. This time posting random images from 4chan, etc., as well as AI-generated bogus issues.
Sorry you guys have to deal with such crap.

#Reichsdeppen #Germaniten #Covid Ärztin muss wegen falscher #Corona-Atteste in Haft

Bundesgerichtshof: Ärztin muss wegen falscher Corona-Atteste in Haft
Während der Corona-Pandemie hat eine Hausärztin aus Moritzburg Hunderte falsche Atteste ausgestellt. Dafür kassierte sie Geld. Teilweise fuhr sie quer durch Deutschland, um ihren illegallen Geschäften nachzugehen. Vergangenes Jahr verurteilte das Landgericht Dresden die Ärztin zu einer Haft- sowie Geldstrafe sowie einem Berufsverbot. Der Bundesgerichtshof hat nun das Urteil bestätigt.

Just finished "Kirby's Lessons for Falling (In Love)" by Laura Gao. I'd previously read her autobiographical graphic novel "Messy Roots" which was excellent, and this book continues that trend. Yet another complicated look at a Chinese-American immigrant experience, wrapped into a queer romance with a dose of spirituality in there as well. I think the background metaphor of falling is really strong, and gets used in so many senses it's beautiful.
#AmReading #ReadingNow

Accelerating LLM Inference with Precomputed Query Storage
Jay H. Park, Youngju Cho, Choungsol Lee, Moonwook Oh, Euiseong Seo
https://arxiv.org/abs/2509.25919 https://

Accelerating LLM Inference with Precomputed Query Storage
Large language model (LLM) inference often suffers from high latency, particularly in resource-constrained environments such as on-device or edge deployments. To address this challenge, we present StorInfer, a novel storage-assisted LLM inference system that accelerates response time by precomputing and storing predictable query-response pairs offline. When a user query semantically matches a precomputed query, StorInfer bypasses expensive GPU inference and instantly returns the stored response…

ZeroCard: Cardinality Estimation with Zero Dependence on Target Databases -- No Data, No Query, No Retraining
Xianghong Xu, Rong Kang, Xiao He, Lei Zhang, Jianjun Chen, Tieying Zhang
https://arxiv.org/abs/2510.07983

ZeroCard: Cardinality Estimation with Zero Dependence on Target Databases -- No Data, No Query, No Retraining
Cardinality estimation is a fundamental task in database systems and plays a critical role in query optimization. Despite significant advances in learning-based cardinality estimation methods, most existing approaches remain difficult to generalize to new datasets due to their strong dependence on raw data or queries, thus limiting their practicality in real scenarios. To overcome these challenges, we argue that semantics in the schema may benefit cardinality estimation, and leveraging such sem…

Bag of Tricks for Subverting Reasoning-based Safety Guardrails
Shuo Chen, Zhen Han, Haokun Chen, Bailan He, Shengyun Si, Jingpei Wu, Philip Torr, Volker Tresp, Jindong Gu
https://arxiv.org/abs/2510.11570

Bag of Tricks for Subverting Reasoning-based Safety Guardrails
Recent reasoning-based safety guardrails for Large Reasoning Models (LRMs), such as deliberative alignment, have shown strong defense against jailbreak attacks. By leveraging LRMs' reasoning ability, these guardrails help the models to assess the safety of user inputs before generating final responses. The powerful reasoning ability can analyze the intention of the input query and will refuse to assist once it detects the harmful intent hidden by the jailbreak methods. Such guardrails have show…

Robust forecast aggregation via additional queries
Rafael Frongillo, Mary Monroe, Eric Neyman, Bo Waggoner
https://arxiv.org/abs/2512.05271 https://arxiv.org/pdf/2512.05271 https://arxiv.org/html/2512.05271
arXiv:2512.05271v1 Announce Type: new
Abstract: We study the problem of robust forecast aggregation: combining expert forecasts with provable accuracy guarantees compared to the best possible aggregation of the underlying information. Prior work shows strong impossibility results, e.g. that even under natural assumptions, no aggregation of the experts' individual forecasts can outperform simply following a random expert (Neyman and Roughgarden, 2022).
In this paper, we introduce a more general framework that allows the principal to elicit richer information from experts through structured queries. Our framework ensures that experts will truthfully report their underlying beliefs, and also enables us to define notions of complexity over the difficulty of asking these queries. Under a general model of independent but overlapping expert signals, we show that optimal aggregation is achievable in the worst case with each complexity measure bounded above by the number of agents $n$. We further establish tight tradeoffs between accuracy and query complexity: aggregation error decreases linearly with the number of queries, and vanishes when the "order of reasoning" and number of agents relevant to a query is $\omega(\sqrt{n})$. These results demonstrate that modest extensions to the space of expert queries dramatically strengthen the power of robust forecast aggregation. We therefore expect that our new query framework will open up a fruitful line of research in this area.
toXiv_bot_toot

Enhancing TreePIR for a Single-Server Setting via Resampling
Elian Morel
https://arxiv.org/abs/2510.04882 https://arxiv.org/pdf/2510.04882

Enhancing TreePIR for a Single-Server Setting via Resampling
Private Information Retrieval (PIR) allows a client to retrieve an entry $\text{DB}[i]$ from a public database $\text{DB}$ held by one or more servers, without revealing the queried index $i$. Traditional PIR schemes achieve sublinear server computation only under strong assumptions, such as the presence of multiple non-colluding servers or the use of public-key cryptography. To overcome these limitations, \textit{preprocessing PIR} schemes introduce a query-independent offline phase where the …

Okay, here's the promised follow-up with more authors I respect who didn't make it onto this list. I won't do deep dives but I'll list at least one work per author:
YA novelists:
- Randi Pink ("Girls Like Us")
- Louisa Onomé ("Twice as Perfect")
- Emery Lee ("Meet Cute Diary")
- Robin Benway ("Far from the Tree")
- Angela Velez ("Lulu and Milagro's Search for Clarity")
Children's book authors:
- Jacqueline Davies ("Bubbles Up")
- Freya Hartas ("Slow Down in the Park")
Novelists:
- Rimma Onoseta ("How You Grow Wings")
Graphic novelists:
- Linda Medley ("Castle Waiting")
- 🖋️Magsalene Visaggio 🖌️Paulina Ganucheau ("Girlmode")
- Ursula Vernon ("Digger")
- SJ Sindu ("Tall Water" w/ Dion MBD)
- Hope Larson ("Be That Way"; "Salt Magic" w/ Rebecca Mock)
- Lily Williams Karen Schneemann ("Go With the Flow")
- Maia Kobabe ("Gender Queer")
- Kay O'Neill ("Tea Dragon Society")
- Marjane Satrapi ("Persepolis")
Mangaka:
- Kaoru Mori ("Young Bride's Stories")
- Ryoko Kui ("Delicious in Dungeon")
- Natsuki Takaya ("Fruits Basket")
Anime writers/directors and/or Japanese light/fantasy/SF novelists:
- Nahoko Uehashi ("Moribito")
- Sayo Yamamoto ("Michiko & Hatchin"; "Yuri!!! On Ice")
- Mari Okada ("Ano Hana: The Flower we Saw That Day"; "Toradora!")
Game designers/programmers:
(Upon review I was pretty remiss in skipping over a few of these people, some of whom I wasn't aware of but most of whom I just didn't remember when writing my short list. Subconscious misogyny in action. Short & Thorson probably would have squeezed out some of the YA authors I included, although I have no real regrets.)
- Junko Kawano ("Suikoden")
- Elizabeth LaPensée ("When Rivers Were Trails")
- Momo Pixel ("Hair Nah")
- Zoë Quinn ("Depression Quest"; narrative designer on "Solar Ash")
- Kellee Santiago ("Cloud"; "Flower")
- Tanya X. Short ("Moon Hunters")
- Kim Swift ("Portal")
- Maddy Thorson ("Celeste")
- Andi McClure @… ("Jumpman")
Note: I haven't included composers or artists here, but there's a deep bench.
Games journalists/steamers:
- Tanya DePass @… (#/INeedDiverseGames; twitch streams)
- Anita Sarkeesian (Feminist Frequency)
Game/play scholars:
- Mary Flanagan ("Critical Play")
- Tracy Fullerton ("Game Design Workshop")
- Brenda Laurel ("Toward the Design of a Computer-Based Interactive Fantasy System")
- Janet Murray ("Hamlet on the Holodeck"l
- Susana Tosca ("A Pragmatics of Links")
- Jichen Zhu ("Agency Play: Dimensions of Agency for Interactive Narrative Design")
- Magy Seif El Nasr ("Design patterns to guide player movement in 3D games")
- Kate Compton ("Causal Creators"; also "Spore")
P.S. upon consideration I've decided not to include any authors who are men in this coda.
There are definitely others who probably deserve to be here that I'm forgetting...
#GsmeDesign #Authors