Tootfinder

Apologies for the BSky link, but it's too long to screenshot easily and it's quite an eye-opener.
https://bsky.app/profile/sanho.bsky.social/post/3m46kqdds2k2y

Sanho Tree (@sanho.bsky.social)
Read this classic quote by my friend the late journalist Dan Baum: [contains quote post or other embedded content]

Selective Retrieval-Augmentation for Long-Tail Legal Text Classification
Boheng Mao
https://arxiv.org/abs/2508.19997 https://arxiv.org/pdf/2508.19997

Selective Retrieval-Augmentation for Long-Tail Legal Text Classification
Legal text classification is a fundamental NLP task in the legal domain. Benchmark datasets in this area often exhibit a long-tail label distribution, where many labels are underrepresented, leading to poor model performance on rare classes. This paper proposes Selective Retrieval-Augmentation (SRA) as a solution to this problem. SRA focuses on augmenting samples belonging to low-frequency labels in the training set, preventing the introduction of noise for well-represented classes, and require…

Hoje o relógio despertou para eu ir ao Pilates, mas eu estava com sono demais para levantar. Mas aí meu gato percebeu que eu estava acordado e começou a morder minha perna para que eu levantasse e colocasse mais ração pra ele. Ou seja, graças ao #gato estou aqui tomando café e me preparando para ir ao #Pilates

Classical fractional time series from quantum XXZ spin chains
Zolt\'an Udvarnoki, G\'abor F\'ath, Mikl\'os Werner, \"Ors Legeza
https://arxiv.org/abs/2508.20974

Classical fractional time series from quantum XXZ spin chains
Entangled quantum mechanical states in one dimension can be used to represent and simulate classical stochastic processes with nontrivial statistical properties. Long-range quantum correlations translate into fractional processes with their asymptotic Hurst exponents characterizing roughness and persistence. We explore this analogy in the case of the spin-1/2 XXZ chain and investigate properties of four different classical two-state processes that this quantum system can generate. These process…

Leveraging LLMs for Automated Translation of Legacy Code: A Case Study on PL/SQL to Java Transformation
Lola Solovyeva, Eduardo Carneiro Oliveira, Shiyu Fan, Alper Tuncay, Shamil Gareev, Andrea Capiluppi
https://arxiv.org/abs/2508.19663

Leveraging LLMs for Automated Translation of Legacy Code: A Case Study on PL/SQL to Java Transformation
The VT legacy system, comprising approximately 2.5 million lines of PL/SQL code, lacks consistent documentation and automated tests, posing significant challenges for refactoring and modernisation. This study investigates the feasibility of leveraging large language models (LLMs) to assist in translating PL/SQL code into Java for the modernised "VTF3" system. By leveraging a dataset comprising 10 PL/SQL-to-Java code pairs and 15 Java classes, which collectively established a domain model for th…

London Heathrow T2 yesterday, United still checking bags by hand for all passengers in one long line (all classes together) due to the ARINC/Collins/RTX cyber failure @… has been documenting.

"This paper presents a comprehensive scientometric analysis of the long-term impact of [event] on the nation scientific development."
*oh, interesting!*
"Using Scopus-indexed data..."
*closes tab*

NFL overreaction Monday: Fishy betting lines and 4 early picks for Week 5 https://www.nytimes.com/athletic/6673734/2025/09/29/nfl-overreaction-monday-week-5/

Vegan Banh Mi #plantbased #food

Vegan Banh Mi
Try this vegan banh mi made with soy curls and plant-based ingredients based on the classic Vietnamese baguette.

QIP $ \subseteq $ AM(2QCFA)
Abuzer Yakary{\i}lmaz
https://arxiv.org/abs/2508.21020 https://arxiv.org/pdf/2508.21020…

QIP $ \subseteq $ AM(2QCFA)
The class of languages having polynomial-time classical or quantum interactive proof systems ($\mathsf{IP}$ or $\mathsf{QIP}$, respectively) is identical to $\mathsf{PSPACE}$. We show that $\mathsf{PSPACE}$ (and so $\mathsf{QIP}$) is subset of $\mathsf{AM(2QCFA)}$, the class of languages having Arthur-Merlin proof systems where the verifiers are two-way finite automata with quantum and classical states (2QCFAs) communicating with the provers classically. Our protocols use only rational-valued q…