Tootfinder

from my link log —
Bringing runtime index checks to compile time in Rust.
https://ktkaufman03.github.io/blog/2023/04/20/rust-compile-time-checks/
saved 2023-04-27

Quand on oublie on n'apprend pas
Antisémitisme de Vichy : un conflit entre historiens porté au tribunal
https://www.lemonde.fr/idees/article/2025/07/17/antisemitisme-de-vichy-un-conflit-entre-histo…

Antisémitisme de Vichy : un conflit entre historiens porté au tribunal
Quatre-vingt-trois ans après la rafle du Vél’d’Hiv, des historiens insistant sur la dimension xénophobe plus qu’antisémite de l’Etat français s’estiment diffamés et ont intenté plusieurs actions en justice contre des universitaires et des journalistes.

Exact solutions to complex Type IIB supergravity for complex superalgebra $F(4)$ and its real forms
Eric D'Hoker, Michael Gutperle, Christoph F. Uhlemann
https://arxiv.org/abs/2508.14959

Exact solutions to complex Type IIB supergravity for complex superalgebra $F(4)$ and its real forms
We construct the general local solutions to complexified Type IIB supergravity which are invariant under the complexified Lie superalgebra $F(4)$. The geometry is a product of complexified maximally symmetric spaces $\mathcal M_{6 {\mathbb C}}$ and $\mathcal M_{2 {\mathbb C}}$ warped over a complexified surface $Σ_{\mathbb C}$. We classify the reality conditions that may be imposed consistently to obtain real form solutions within real forms of complex Type IIB supergravity. The latter compris…

Completions of Restricted Complexity I, Weak Arithmetical Theories
Ali Enayat, Mateusz {\L}e{\l}yk, Albert Visser
https://arxiv.org/abs/2508.14758 https://…

Completions of Restricted Complexity I, Weak Arithmetical Theories
Given a first-order theory $T$ formulated in the usual language of first-order arithmetic, we say that $T$ is of *restricted complexity* if there is some natural number $n$ and some set $\mathcal A$ of $Σ_n$-sentences such that $T$ can be axiomatized by $\mathcal A$. Motivated by the fact that no consistent arithmetical theory extending $\mathrm{I}Δ_{0}+\mathsf{Exp}$ has a consistent completion that is of restricted complexity, we construct models of arithmetic whose complete theories are of …

🇺🇦 #NowPlaying on KEXP's #SonicReducer
Conflict:
🎵 The Ungovernable Force
#Conflict
https://conflictpunk.bandcamp.com/album/the-ungovernable-force
https://open.spotify.com/track/7twu6Giq0LbZwpVcGxceGQ

BREAKTHROUGH: Belgian Authorities Arrest and Interrogate Israeli War Crimes Suspects Following Complaint by Hind Rajab Foundation and GLAN - THE HIND RAJAB FOUNDATION
https://www.hindr…

HERAKLES: Hierarchical Skill Compilation for Open-ended LLM Agents
Thomas Carta, Cl\'ement Romac, Loris Gaven, Pierre-Yves Oudeyer, Olivier Sigaud, Sylvain Lamprier
https://arxiv.org/abs/2508.14751

HERAKLES: Hierarchical Skill Compilation for Open-ended LLM Agents
Open-ended AI agents need to be able to learn efficiently goals of increasing complexity, abstraction and heterogeneity over their lifetime. Beyond sampling efficiently their own goals, autotelic agents specifically need to be able to keep the growing complexity of goals under control, limiting the associated growth in sample and computational complexity. To adress this challenge, recent approaches have leveraged hierarchical reinforcement learning (HRL) and language, capitalizing on its compos…

A SHACL-based Data Consistency Solution for Contract Compliance Verification
Robert David, Albin Ahmeti, Geni Bushati, Amar Tauqeer, Anna Fensel
https://arxiv.org/abs/2507.15420

A SHACL-based Data Consistency Solution for Contract Compliance Verification
In recent years, there have been many developments for GDPR-compliant data access and sharing based on consent. For more complex data sharing scenarios, where consent might not be sufficient, many parties rely on contracts. Before a contract is signed, it must undergo the process of contract negotiation within the contract lifecycle, which consists of negotiating the obligations associated with the contract. Contract compliance verification (CCV) provides a means to verify whether a contract is…

Conflict-Aware Soft Prompting for Retrieval-Augmented Generation
Eunseong Choi, June Park, Hyeri Lee, Jongwuk Lee
https://arxiv.org/abs/2508.15253 https://…

Conflict-Aware Soft Prompting for Retrieval-Augmented Generation
Retrieval-augmented generation (RAG) enhances the capabilities of large language models (LLMs) by incorporating external knowledge into their input prompts. However, when the retrieved context contradicts the LLM's parametric knowledge, it often fails to resolve the conflict between incorrect external context and correct parametric knowledge, known as context-memory conflict. To tackle this problem, we introduce Conflict-Aware REtrieval-Augmented Generation (CARE), consisting of a context asses…

from my link log —
RE#: high performance derivative-based regex matching with intersection, complement, and lookarounds.
https://arxiv.org/abs/2407.20479
saved 2025-04-17

RE#: High Performance Derivative-Based Regex Matching with Intersection, Complement and Lookarounds
We present a tool and theory RE# for regular expression matching that is built on symbolic derivatives, does not use backtracking, and, in addition to the classical operators, also supports complement, intersection and lookarounds. We develop the theory formally and show that the main matching algorithm has input-linear complexity both in theory as well as experimentally. We apply thorough evaluation on popular benchmarks that show that RE# is over 71% faster than the next fastest regex engine …