Tootfinder

Two easy questions to keep in mind when considering using an LLM for anything, if you’re going to do that:
1. Does it matter if it’s wrong?
2. Is it useful to have examples of what’s typical?
Those two cut through a lot of noise.
/end

Counter Examples in Non-Archimedean Locally Convex Spaces
M. E. Egwe, J. A Braimah
https://arxiv.org/abs/2510.09626 https://arxiv.org/pdf/2510.09626…

Counter Examples in Non-Archimedean Locally Convex Spaces
In this paper, we shall consider some counter examples in non-archimedean locally convex spaces with special closed subspaces and Schauder basis in non-archimedean Fréchet spaces as well as closed subspaces \emph{without} Schauder basis in non-archimedean Fréchet spaces.

Checking out WebSocketStream in #dotnet 10. It definitely makes writing and reading WebSocket messages a bit simpler, giving you an experience similar to all other stream abstractions in #dotnet.

Again I'm confused at the human urge to pretend something is way more automated than it really is. Examples:
- Robot 'chef' that only automates the very least time-consuming part of cooking, serving no purpose but to slow things down: https://post.lurk.org/@jonty@chaos.soc

Fisher Matrix for Beginners
David Wittman (UC Davis)
https://arxiv.org/abs/2510.09683 https://arxiv.org/pdf/2510.09683

Fisher Matrix for Beginners
The Fisher information matrix is used widely in astronomy (and presumably other fields) to forecast the precision of future experiments while they are still in the design phase. Although many sources describe the mathematics of the formalism, few sources offer simple examples to help the beginner. This pedagogical document works through a few simple examples to develop conceptual understanding of the applications.

Advancing credibility and transparency in brain-to-image reconstruction research: Reanalysis of Koide-Majima, Nishimoto, and Majima https://arxiv.org/abs/2511.07960 by @… et al.;

Advancing credibility and transparency in brain-to-image reconstruction research: Reanalysis of Koide-Majima, Nishimoto, and Majima (Neural Networks, 2024)
A recent high-profile study by Koide-Majima et al. (2024) claimed a major advance in reconstructing visual imagery from brain activity using a novel variant of a generative AI-based method. However, our independent reanalysis reveals multiple methodological concerns that raise questions about the validity of their conclusions. Specifically, our evaluation demonstrates that: (1) the reconstruction results are biased by selective reporting of only the best-performing examples at multiple levels; …

Adversarial Attacks Leverage Interference Between Features in Superposition
Edward Stevinson, Lucas Prieto, Melih Barsbey, Tolga Birdal
https://arxiv.org/abs/2510.11709 https://…

Adversarial Attacks Leverage Interference Between Features in Superposition
Fundamental questions remain about when and why adversarial examples arise in neural networks, with competing views characterising them either as artifacts of the irregularities in the decision landscape or as products of sensitivity to non-robust input features. In this paper, we instead argue that adversarial vulnerability can stem from efficient information encoding in neural networks. Specifically, we show how superposition - where networks represent more features than they have dimensions …

Prompting Test-Time Scaling Is A Strong LLM Reasoning Data Augmentation
Sondos Mahmoud Bsharat, Zhiqiang Shen
https://arxiv.org/abs/2510.09599 https://arxi…

Prompting Test-Time Scaling Is A Strong LLM Reasoning Data Augmentation
Large language models (LLMs) have demonstrated impressive reasoning capabilities when provided with chain-of-thought exemplars, but curating large reasoning datasets remains laborious and resource-intensive. In this work, we introduce Prompting Test-Time Scaling (P-TTS), a simple yet effective inference-time data augmentation strategy for enhancing LLM reasoning through finetuning. Rather than collecting thousands or even millions of examples, P-TTS leverages a small pool of only 90 manually se…

Mira Murati's Thinking Machines Lab makes Tinker, its API for fine-tuning language models, generally available, adds support for Kimi K2 Thinking, and more (Thinking Machines Lab)
https://thinkingmachines.ai/blog/tinker-general-availability/

Tinker: General Availability and Vision Input
Today we are announcing four updates to Tinker: No more waitlist New reasoning model: Kimi K2 Thinking New inference interface that is compatible with the OpenAI API Vision input support with Qwen3-VL General availability The waitlist is over! Everybody can use Tinker now; sign up here to get started. See the Tinker homepage for available models and pricing, and check out the Tinker cookbook for code examples. More reasoning with Kimi K2 Thinking Users can now fine-tune Kimi K2 Thinking on Ti…

Again I'm confused at the human urge to pretend something is way more automated than it really is. Examples:
- Robot 'chef' that only automates the very least time-consuming part of cooking, serving no purpose but to slow things down: https://post.lurk.org/@jonty@chaos.soc

The poset of maximal tubings of the cycle graph is a lattice
Ben Adenbaum, Emily Barnard, Max Hlavacek, Bryson Kagy, Nathan R. T. Lesnevich, George D. Nasr, Katie Waddle
https://arxiv.org/abs/2510.09429

The poset of maximal tubings of the cycle graph is a lattice
The poset of maximal tubings of a graph generalizes several well-known and remarkable partial orders. Notable examples include the weak Bruhat order and the Tamari lattice, posets of maximal tubings for the complete graph and the path graph, respectively. It is an open problem to characterize graphs for which the poset of maximal tubings is a lattice. In this paper, we prove that the poset of maximal tubings for the cycle graph is a lattice, and moreover that it is semidistributive and congruen…

Equivariant deformation of minimally elliptic singularities
Dagnik Das, Yunfeng Jiang
https://arxiv.org/abs/2510.10253 https://arxiv.org/pdf/2510.10253

Equivariant deformation of minimally elliptic singularities
We study certain equivariant deformation components of minimally elliptic surface singularities under finite group actions. Interesting examples include cyclic quotients of simple elliptic singularities and finite group quotients of cusp singularities, where the resulting quotients remain simple elliptic and cusp singularities, respectively. In cases where the minimally elliptic singularities are locally complete intersection (lci) singularities, we identify equivariant deformation components o…

List of Streisand effect examples
https://en.wikipedia.org/wiki/List_of_Streisand_effect_examples?wprov=sfti1

Appell Functions for General Lattices
Aradhita Chattopadhyaya, Jan Manschot
https://arxiv.org/abs/2510.10204 https://arxiv.org/pdf/2510.10204

Appell Functions for General Lattices
We study Appell functions associated to an arbitrary positive definite lattice $Λ$ and a choice of $M\leq {\rm dim}(Λ)$ linearly independent vectors $d_r\in Λ$, $r=1,\dots,M$. These functions are instances of multi-variable quasi-elliptic functions, and specific examples have appeared at various places in mathematics and theoretical physics. For example, if $Λ$ is chosen to be one-dimensional, these functions reduce to the classical Appell function, which is a prominent example in the theor…

Geoffrion's theorem beyond finiteness and rationality
Santanu S. Dey, Fr\'ed\'eric Meunier, Diego Moran Ramirez
https://arxiv.org/abs/2510.10966 https://

Geoffrion's theorem beyond finiteness and rationality
Geoffrion's theorem is a fundamental result from mathematical programming assessing the quality of Lagrangian relaxation, a standard technique to get bounds for integer programs. An often implicit condition is that the set of feasible solutions is finite or described by rational linear constraints. However, we show through concrete examples that the conclusion of Geoffrion's theorem does not necessarily hold when this condition is dropped. We then provide sufficient conditions ensuring the vali…

A geometric obstruction to self-simulation for groups
Sebasti\'an Barbieri, Kan\'eda Blot, Mathieu Sablik, Ville Salo
https://arxiv.org/abs/2510.10291 https://

A geometric obstruction to self-simulation for groups
We introduce a new quasi-isometry invariant for finitely generated groups and show that every group with this property admits a subshift which is effectively closed by patterns and that cannot be realized as the topological factor of any subshift of finite type. We provide several examples of groups with the property, such as amenable groups, multi-ended groups, generalized Baumslag-Solitar groups, fundamental groups of surfaces, and cocompact Fuchsian groups.

Good examples in that article for why a prompt-based system for system administration seems odd: You type a hundred-word question and are told by the AI to use apt when the Fedora system doesn’t use that package manager at all. https://mstdn.social/@osnews/115702679695335298

Universal Analog Computation: Fra\"iss\'e limits of dynamical systems
Levin Hornischer
https://arxiv.org/abs/2510.10184 https://arxiv.org/pdf/2510…

Universal Analog Computation: Fraïssé limits of dynamical systems
Analog computation is an alternative to digital computation, that has recently re-gained prominence, since it includes neural networks. Further important examples are cellular automata and differential analyzers. While analog computers offer many advantages, they lack a notion of universality akin to universal digital computers. Since analog computers are best formalized as dynamical systems, we review scattered results on universal dynamical systems, identifying four senses of universality and…

Convergence Analysis of Galerkin Approximations for the Lindblad Master Equation
R\'emi Robin, Pierre Rouchon
https://arxiv.org/abs/2510.11416 https://…

Convergence Analysis of Galerkin Approximations for the Lindblad Master Equation
This paper analyzes the numerical approximation of the Lindblad master equation on infinite-dimensional Hilbert spaces. We employ a classical Galerkin approach for spatial discretization and investigate the convergence of the discretized solution to the exact solution. Using \textit{a priori} estimates, we derive explicit convergence rates and demonstrate the effectiveness of our method through examples motivated by autonomous quantum error correction.

Semitoric Families on Pentagon Spaces
Yichen Liu, Aerim Si
https://arxiv.org/abs/2510.11624 https://arxiv.org/pdf/2510.11624…

Semitoric Families on Pentagon Spaces
Semitoric systems are a special type of 4-dimensional integrable system where one of the functions is the moment map of a Hamiltonian $S^1$-action. These systems were classified by Pelayo and V{ũ} Ng\d{o}c, but there are not many explicit examples. Recently, Le Floch and Palmer introduced semitoric transition families in which a singular point transitions between elliptic-elliptic type and focus-focus type as the parameter varies. In this paper, we construct semitoric transition families on pe…

4 post updates last night:
• W3C vid on `lang`: https://adrianroselli.com/2015/01/on-use-of-lang-attribute.html#Update09
• More confirmation automated tests are crap:

On Use of the Lang Attribute
Way back in October I noticed this WHATWG HTML bug (26942) where someone asked why do these examples of lack the lang attribute? I thought the answer from Hixie was a bit dismissive and not based on any data or real-world benefits of use, particularly in the context of…

Geodesic Calculus on Latent Spaces
Florine Hartwig, Josua Sassen, Juliane Braunsmann, Martin Rumpf, Benedikt Wirth
https://arxiv.org/abs/2510.09468 https://

Geodesic Calculus on Latent Spaces
Latent manifolds of autoencoders provide low-dimensional representations of data, which can be studied from a geometric perspective. We propose to describe these latent manifolds as implicit submanifolds of some ambient latent space. Based on this, we develop tools for a discrete Riemannian calculus approximating classical geometric operators. These tools are robust against inaccuracies of the implicit representation often occurring in practical examples. To obtain a suitable implicit represent…

This is content that I came to the fediverse for.
https://transfem.social/notes/ag5hdnqxdvi30a0f

Amber :neodog_box: (@puppygirlhornypost2)
@TheBreadmonkey@beige.party @javascript@app.wafrn.net @link@meowing.men What's worse? Donald Duck with his lisp talking dirty to you or Goofy's moans? (📊) RE: @javascript@app.wafrn.net @TheBreadmonkey@beige.party @link@meowing.men My mind is cursing me with various examples of what this would sound like with Goofy's stutter. I mean, it could be worse. I could have brought Donald Duck into this with the corkscrew peni- fuck RE: ...

Mirror symmetric polynomials orthogonal on the unit circle
Alexei Zhedanov
https://arxiv.org/abs/2510.10447 https://arxiv.org/pdf/2510.10447

Mirror symmetric polynomials orthogonal on the unit circle
We introduce and study a special family of polynomials orthogonal on the unit circle (OPUC). These OPUC satisfy a mirror symmetry property of their Verblunsky coefficients. Several equivalent conditions for the OPUC to be mirror symmetric are presented. Corresponding unitary CMV matrices satisfy simple algebraic relations similar to relations for persymmetric tridiagonal matrices. We present three explicit examples of mirror symmetric OPUC.

Bayes Meets Riemann Again: Large Prime Discovery and Re-emergence of the Bone of Contention
Durba Bhattacharya, Sucharita Roy, Sourabh Bhattacharya
https://arxiv.org/abs/2510.09651

Bayes Meets Riemann Again: Large Prime Discovery and Re-emergence of the Bone of Contention
Prime numbers have fascinated mathematicians since antiquity, with ongoing efforts to uncover both their properties and ever-larger examples. While giant primes rarely aid cryptography, they find use in areas such as locally decodable codes. Large prime-hunting, often brute-force in nature, is conceptually linked to the Riemann Hypothesis and the prime number theorem, which portrays prime distribution as essentially random. This motivates a statistical perspective, with Bayesian methodology pro…

Vandermonde Cells Through the Lens of Positive Geometry
Fatemeh Mohammadi, Sebastian Seemann
https://arxiv.org/abs/2510.11614 https://arxiv.org/pdf/2510.11…

Vandermonde Cells Through the Lens of Positive Geometry
We study the geometric and algebraic structure of Vandermonde cells, defined as images of the standard probability simplex under the Vandermonde map given by consecutive power sum polynomials. Motivated by their combinatorial equivalence to cyclic polytopes, which are well-known examples of positive geometries and tree amplituhedra, we investigate whether Vandermonde cells admit the structure of positive geometries. We derive explicit parametrizations and algebraic equations for their boundary …

The Inner Workings of JavaScript Source Maps
A deep dive into how JavaScript source maps work under the hood, with examples showing how all the pieces fit together.
🧑‍💻 https://www.polarsignals.com/blog/posts/2025/11/04/javascript-source-maps-interna…

The Inner Workings of JavaScript Source Maps
A deep dive into how JavaScript source maps work under the hood, with examples showing how all the pieces fit together.

Clarifying Semantics of In-Context Examples for Unit Test Generation
Chen Yang, Lin Yang, Ziqi Wang, Dong Wang, Jianyi Zhou, Junjie Chen
https://arxiv.org/abs/2510.01994 https:/…

Clarifying Semantics of In-Context Examples for Unit Test Generation
Recent advances in large language models (LLMs) have enabled promising performance in unit test generation through in-context learning (ICL). However, the quality of in-context examples significantly influences the effectiveness of generated tests-poorly structured or semantically unclear test examples often lead to suboptimal outputs. In this paper, we propose CLAST, a novel technique that systematically refines unit tests to improve their semantic clarity, thereby enhancing their utility as i…

Psi-Turing Machines: Bounded Introspection for Complexity Barriers and Oracle Separations
Rafig Huseynzade
https://arxiv.org/abs/2510.08577 https://arxiv.o…

Psi-Turing Machines: Bounded Introspection for Complexity Barriers and Oracle Separations
We introduce Psi-Turing Machines (Psi-TM): classical Turing machines equipped with a constant-depth introspection interface $ ι$ and an explicit per-step information budget $ B(d,n)=c\,d\log_2 n $. With the interface frozen, we develop an information-theoretic lower-bound toolkit: Budget counting, $ Ψ$-Fooling, and $ Ψ$-Fano, with worked examples $ L_k $ and $ L_k^{\mathrm{phase}} $. We prove an oracle-relative separation $ P^Ψ \neq NP^Ψ $ and a strict depth hierarchy, reinforced by an Ant…

Split Conformal Classification with Unsupervised Calibration
Santiago Mazuelas
https://arxiv.org/abs/2510.07185 https://arxiv.org/pdf/2510.07185

Split Conformal Classification with Unsupervised Calibration
Methods for split conformal prediction leverage calibration samples to transform any prediction rule into a set-prediction rule that complies with a target coverage probability. Existing methods provide remarkably strong performance guarantees with minimal computational costs. However, they require to use calibration samples composed by labeled examples different to those used for training. This requirement can be highly inconvenient, as it prevents the use of all labeled examples for training …

Learning to Make MISTAKEs: Modeling Incorrect Student Thinking And Key Errors
Alexis Ross, Jacob Andreas
https://arxiv.org/abs/2510.11502 https://arxiv.org…

Learning to Make MISTAKEs: Modeling Incorrect Student Thinking And Key Errors
Research on reasoning in language models (LMs) predominantly focuses on improving the correctness of their outputs. But some important applications require modeling reasoning patterns that are incorrect. For example, automated systems that can reason about and simulate student errors are useful for providing real-time feedback in the classroom or offline practice for educators-in-training. This paper presents a new method, MISTAKE, that (1) constructs high-quality synthetic examples of reasonin…

Extreme events and impact statistics for unipotent actions on the space of lattices
Jens Marklof, Andreas Str\"ombergsson, Shucheng Yu
https://arxiv.org/abs/2510.11371 http…

Extreme events and impact statistics for unipotent actions on the space of lattices
This paper extends a recent extreme value law for horocycle flows on the space of two-dimensional lattices, due to Kirsebom and Mallahi-Karai, to the simplest examples of rank-$k$ unipotent actions on the space of $n$-dimensional lattices. We analyse the problem in terms of the hitting time and impact statistics for the unipotent action with respect to a shrinking surface of section, following the strategy of Pollicott and the first named author in the case of hyperbolic surfaces. If $k=n-1$, t…

Wow, if you have a friend who is curious about programming, send them this video! Professor Chasins is charismatic and answers some common questions with great analogies and examples. I wish more of my profs were this engaging.
Professor Answers Coding Questions | Tech Support | WIRED - YouTube
https://m.youtube.com/watch?…

Encoding Numeric Computations and Infusing Heuristic Knowledge Using Integrity Constraints in stableKanren
Xiangyu Guo, Ajay Bansal
https://arxiv.org/abs/2510.04049 https://

Encoding Numeric Computations and Infusing Heuristic Knowledge Using Integrity Constraints in stableKanren
This paper presents examples of using integrity constraints in stableKanren to encode numeric computations for problem solving. Then, we use one of the examples to introduce multiple ways to infuse heuristic knowledge and reduce solving time. stableKanren is an extension of miniKanren that supports normal logic programs under stable model semantics. stableKanren further supports numeric computation by constructing a constraint store for integrity constraints. There are three ways to extend a re…

Explicitly Computing with Fukaya Categories of Surfaces with Boundary
Chris Grossack
https://arxiv.org/abs/2510.10867 https://arxiv.org/pdf/2510.10867

Explicitly Computing with Fukaya Categories of Surfaces with Boundary
Fukaya categories are deep and rich invariants of symplectic manifolds which are notoriously difficult to compute explicitly. In the case of surfaces, however, the situation is simple, combinatorial,and is very well understood (at least by experts). In this expository paper we will give an introduction with many examples to welcome newcomers to the area and hopefully equip them with the tools to independently compute Fukaya categories of surfaces.

While politicians often avoid answering questions,
Speaker Mike Johnson’s habit of doing so is particularly noteworthy
because of the prominent place the speaker occupies in government.
“Very few officers are mentioned specifically in the constitution;
the speakership is one of them,”
“I would say it’s absolutely the responsibility of the speaker to keep up with what the president is saying and doing.”
But there are at least 14 examples of Johnson saying he…

Topological Structure of Infrared QCD
J. Gamboa
https://arxiv.org/abs/2511.07455 https://arxiv.org/pdf/2511.07455 https://arxiv.org/html/2511.07455
arXiv:2511.07455v1 Announce Type: new
Abstract: We investigate the infrared structure of QCD within the adiabatic approximation, where soft gluon configurations evolve slowly compared to the fermionic modes. In this formulation, the functional space of gauge connections replaces spacetime as the natural arena for the theory, and the long-distance behavior is encoded in quantized Berry phases associated with the infrared clouds. Our results suggest that the infrared sector of QCD exhibits features reminiscent of a \emph{topological phase}, similar to those encountered in condensed-matter systems, where topological protection replaces dynamical confinement at low energies. In this geometric framework, color-neutral composites such as quark--gluon and gluon--gluon clouds arise as topological bound states described by functional holonomies. Illustrative applications to hadronic excitations are discussed within this approach, including mesonic and baryonic examples. This perspective provides a unified picture of infrared dressing and topological quantization, establishing a natural bridge between non-Abelian gauge theory, adiabatic Berry phases, and the topology of the space of gauge configurations.
toXiv_bot_toot

Weekend #Plankton Factoid 🦠🦐
Most plankton are tiny, making it very difficult to visualize their internal structures. Enter "expansion microscopy" a technique that embeds the organism in a gel which absorbs water and expands up to 16x, yet retains all of the internal cell details. This means you can view structures normally too small to see with light

Safe and Efficient In-Context Learning via Risk Control
Andrea Wynn, Metod Jazbec, Charith Peris, Rinat Khaziev, Anqi Liu, Daniel Khashabi, Eric Nalisnick
https://arxiv.org/abs/2510.02480

Safe and Efficient In-Context Learning via Risk Control
Large language models (LLMs) demonstrate a remarkable ability to learn new tasks from a few in-context examples. However, this flexibility introduces safety concerns: LLMs can be influenced by incorrect or malicious demonstrations -- for example, if an adversary tampers with or injects harmful examples without a human supervisor noticing. This motivates principled designs in which the system itself includes built-in mechanisms to guard against such attacks. We propose a novel approach to limit …

Bifurcation Curves in Semipositone Problems with Geometrically Concave and Concave Nonlinearities
Shao-Yuan Huang
https://arxiv.org/abs/2510.10412 https://…

Bifurcation Curves in Semipositone Problems with Geometrically Concave and Concave Nonlinearities
In this paper, we study the exact multiplicity and bifurcation curves of positive solutions for the semipositone problem defined on the interval from minus one to one, with zero boundary conditions at both ends. The function f is twice continuously differentiable on the positive real line, and there exist two positive numbers such that f is positive between them and negative outside this range. We allow f at zero from the right to be negative infinity and provide many examples to illustrate the…

Imagine ChatGPT but instead of predicting text it just linked you to the to 3 documents most-influential on the probabilities that would have been used to predict that text.
Could even generate some info about which parts of each would have been combined how.
There would still be issues with how training data is sourced and filtered, but these could be solved by crawling normally respecting robots.txt and by paying filterers a fair wage with a more relaxed work schedule and mental health support.
The energy issues are mainly about wild future investment and wasteful query spam, not optimized present-day per-query usage.
Is this "just search?"
Yes, but it would have some advantages for a lot of use cases, mainly in synthesizing results across multiple documents and in leveraging a language model more fully to find relevant stuff.
When we talk about the harms of current corporate LLMs, the opportunity cost of NOT building things like this is part of that.
The equivalent for art would have been so amazing too! "Here are some artists that can do what you want, with examples pulled from their portfolios."
It would be a really cool coding assistant that I'd actually encourage my students to use (with some guidelines).
#AI #GenAI #LLMs

I regularly warn that content on Forbes is pay-for-play.
Here an overlay vendor shares prompts to feed an LLM for testing code, demonstrating LLMs on their own can’t do it without extensive coaching _and_ that coaching needs to be correct (the examples have issues):
https://www.

AI Prompts For Web Accessibility Testing
Accessibility should never be treated as just a compliance checkbox; it should be about creating digital experiences that work for everyone.

I cannot stress enough how effective economic attacks have been as a tool throughout US history. They're basically *the thing that works* historically.
Edit:
Someone else pointed out that the American Revolution started with a big economic blockade. The Civil Rights movement involved a boycott of Woolworths and there was the bus boycott. Yeah... lots of examples, and a lot of them ended with their demands being met.

Great expectations: Unifying Statistical Theory and Programming
Bradley Saul
https://arxiv.org/abs/2510.09853 https://arxiv.org/pdf/2510.09853

Great expectations: Unifying Statistical Theory and Programming
Beginning in the 1970s, statistician-cum-logician Per Martin-Löf wrote a series of papers developing what became Martin-Löf type theory, realizing a system where the distinction between mathematics and programming disappears. Inspired by this vision, this paper introduces dependent type theory (of which Martin-Löf type theory is an example) to a statistical audience. Examples from statistics and probability theory demonstrate how dependent type theory and an algebraic perspective can unify t…

Does everyone have a price? Understanding people's attitude towards online and offline price discrimination
Joost Poort, Frederik J. Zuiderveen Borgesius
https://arxiv.org/abs/2510.08246

Does everyone have a price? Understanding people's attitude towards online and offline price discrimination
Online stores can present a different price to each customer. Such algorithmic personalised pricing can lead to advanced forms of price discrimination based on the characteristics and behaviour of individual consumers. We conducted two consumer surveys among a representative sample of the Dutch population (N=1233 and N=1202), to analyse consumer attitudes towards a list of examples of price discrimination and dynamic pricing. A vast majority finds online price discrimination unfair and unaccept…

Quantum Measurement Trees, I: Two Preliminary Examples of Induced Contextual Boolean Algebras
Peter J Hammond
https://arxiv.org/abs/2509.22594 https://arxi…

Quantum Measurement Trees, I: Two Preliminary Examples of Induced Contextual Boolean Algebras
Quantum randomness evidently transcends the classical framework of random variables defined on a single comprehensive Kolmogorov probability space. One prominent example is the quantum double-slit experiment due to Feynman (1951, 1966). A related non-quantum example, inspired by Boole (1862) and Vorob$'$ev (1962), has three two-valued random variables $X$, $Y$ and $Z$, where the pairs $X, Y$ and $X, Z$ are perfectly correlated, yet $Y, Z$ are perfectly anti-correlated. Such examples can be acco…

There and Back Again: Bulk-to-Defect via Ward Identities
Jake Belton, Ziwen Kong
https://arxiv.org/abs/2510.08519 https://arxiv.org/pdf/2510.08519

There and Back Again: Bulk-to-Defect via Ward Identities
In conformal field theory, the presence of a defect partially breaks the global symmetry, giving rise to defect operators such as the tilts. In this work, we derive integral identities that relate correlation functions involving bulk and defect operators -- including tilts -- to lower-point bulk-defect correlators, based on a detailed analysis of the Lie algebra of the symmetry group before and after the defect-induced symmetry breaking. As explicit examples, we illustrate these identities for …

The Geometry of Loop Spaces V: Fundamental Groups of Geometric Transformation Groups
Yoshiaki Maeda, Steven Rosenberg
https://arxiv.org/abs/2510.01566 https://

The Geometry of Loop Spaces V: Fundamental Groups of Geometric Transformation Groups
We use differential forms on loop spaces to prove that the fundamental group of certain geometric transformation groups is infinite. Examples include both finite and infinite dimensional Lie groups. The finite dimensional examples are the conformal group of $S^{4k+1}$ for a family of nonstandard metrics, and the group of pseudo-Hermitian transformations of a compact CR manifold. Infinite dimensional examples include the group of strict contact diffeomorphisms of a regular contact manifold, and …

Archaeologists Uncover 5,500-year-old ‘Ritual Landscape’ in Jordan https://www.goodnewsnetwork.org/archaeologists-uncover-5500-year-old-ritual-landscape-in-jordan/

Archaeologists Uncover 5,500-year-old 'Ritual Landscape' in Jordan
Many of these monuments were surveyed for the first time in a modern context, and they include stunning examples of ancient stone work.

Lecture notes on the symplectic geometry of graded manifolds and higher Lie groupoids
Miquel Cueca, Antonio Maglio, Fabricio Valencia
https://arxiv.org/abs/2510.09448 https://…

Lecture notes on the symplectic geometry of graded manifolds and higher Lie groupoids
In this work, we study symplectic structures on graded manifolds and their global counterparts, higher Lie groupoids. We begin by introducing the concept of graded manifold, starting with the degree 1 case, and translating key geometric structures into classical differential geometry terms. We then extend our discussion to the degree 2 case, presenting several illustrative examples with a particular emphasis on equivariant cohomology and Lie bialgebroids. Next, we define symplectic Q-manifolds …

On defining astronomically meaningful Reference Frames in General Relativity
L. Filipe O. Costa, Francisco Frutos-Alfaro, Jos\'e Nat\'ario, Michael Soffel
https://arxiv.org/abs/2510.07400

On defining astronomically meaningful Reference Frames in General Relativity
In a recent paper we discussed when it is possible to define reference frames nonrotating with respect to distant inertial reference objects (extension of the IAU reference systems to exact general relativity), and how to construct them. We briefly review the construction, illustrating it with further examples, and caution against the recent misuse of zero angular momentum observers (ZAMOs).

And now I need to learn wtf a "DMX Universe" is because that's what the Pico-DMX library uses and the examples are pretty terrible and I am lost.

Some Reflections on Sliding Mode Designs in Control Systems: An Example of Adaptive Tracking Control for Simple Mechanical Systems With Friction Without Measurement of Velocity
Romeo Ortega, Leyan Fang, Jose Guadalupe Romero
https://arxiv.org/abs/2510.07675

Some Reflections on Sliding Mode Designs in Control Systems: An Example of Adaptive Tracking Control for Simple Mechanical Systems With Friction Without Measurement of Velocity
The objective of this note is to share some reflections of the authors regarding the use of sliding mode designs in control systems. We believe the abundant, and ever increasing, appearance of this kind of works on our scientific publications deserves some critical evaluation of their actual role, relevance and pertinence. First, we discuss the procedure followed by most of these designs -- illustrated with examples from the literature. Second, we bring to the readers attention several aspects …

On a class of (non)local superposition operators of arbitrary order
Serena Dipierro, Sven Jarohs, Enrico Valdinoci
https://arxiv.org/abs/2510.08345 https://

On a class of (non)local superposition operators of arbitrary order
In this paper we introduce a very general setting dealing with the superposition of operators of any positive order and provide a systematic study of them. We also provide examples and counterexamples, as well as characterizing properties of the measures and the functional spaces under consideration. Moreover, we present some applications regarding the existence theory for a class of nonlinear problems involving superposition operators of arbitrary (possibly fractional) order.

One rig to control them all
Chris Heunen, Robin Kaarsgaard, Louis Lemonnier
https://arxiv.org/abs/2510.05032 https://arxiv.org/pdf/2510.05032

One rig to control them all
We introduce a theory for computational control, consisting of seven naturally interpretable equations. Adding these to a prop of base circuits constructs controlled circuits, borne out in examples of reversible Boolean circuits and quantum circuits. We prove that this syntactic construction semantically corresponds to taking the free rig category on the base prop.

from my link log —
Search and replace tricks with ripgrep.
https://learnbyexample.github.io/substitution-with-ripgrep/
saved 2020-09-17 ht…

Training-Free Synthetic Data Generation with Dual IP-Adapter Guidance
Luc Boudier, Loris Manganelli, Eleftherios Tsonis, Nicolas Dufour, Vicky Kalogeiton
https://arxiv.org/abs/2509.22635

Training-Free Synthetic Data Generation with Dual IP-Adapter Guidance
Few-shot image classification remains challenging due to the limited availability of labeled examples. Recent approaches have explored generating synthetic training data using text-to-image diffusion models, but often require extensive model fine-tuning or external information sources. We present a novel training-free approach, called DIPSY, that leverages IP-Adapter for image-to-image translation to generate highly discriminative synthetic images using only the available few-shot examples. DIP…

Does anyone know of any examples of #Pandoc Lua filters that implement some kind of inheritance of attributes?
Specifically, I’d like to take the language possibly set by enclosing blocks into account when processing inline elements.

Does anyone know of any examples of #Pandoc Lua filters that implement some kind of inheritance of attributes?
Specifically, I’d like to take the language possibly set by enclosing blocks into account when processing inline elements.

Does anyone know of any examples of #Pandoc Lua filters that implement some kind of inheritance of attributes?
Specifically, I’d like to take the language possibly set by enclosing blocks into account when processing inline elements.

For shell examples in documents such as the FreeBSD Handbook:
― the copy icon is bugged.
It wrongly includes the command prompt.
#FreeBSD #documentation

Homotopy rigidity of nearby Lagrangian cocores
Johan Asplund, Yash Deshmukh, Alex Pieloch
https://arxiv.org/abs/2511.09548 https://arxiv.org/pdf/2511.09548 https://arxiv.org/html/2511.09548
arXiv:2511.09548v1 Announce Type: new
Abstract: An exact Lagrangian submanifold $L \subset X^{2n}$ in a Weinstein sector is called a nearby Lagrangian cocore if it avoids all Lagrangian cocores and is equal to a shifted Lagrangian cocore at infinity. Let $k$ be the dimension of the core of the subcritical part of $X$. For $n \geq 2k 2$ we prove that that the inclusion of $L$ followed by the retract to the Lagrangian core of $X$ and the quotient by the $(n-k-1)$-skeleton of the core, is null-homotopic. As a consequence, in many examples, a nearby Lagrangian cocore is smoothly isotopic (rel boundary) to a Lagrangian cocore in the complement of the missed Lagrangian cocores. The proof uses the spectral wrapped Donaldson-Fukaya category with coefficients in the ring spectrum representing the bordism group of higher connective covers of the orthogonal group.
toXiv_bot_toot

An LLM generates a statistically typical response.
If you ask an LLM whether the world is round, it generates what would be a typical response to the question of whether the world is round. (It will probably be correct, because the typical answer to that question is the correct one.)
If you ask an LLM to provide examples of its own bias, it will generate what would be a typical response to a request to provide examples of bias.
In neither case is the LLM sharing any knowledge or insight other than what is typical.
2/

Searching for Difficult-to-Translate Test Examples at Scale
Wenda Xu, Vil\'em Zouhar, Parker Riley, Mara Finkelstein, Markus Freitag, Daniel Deutsch
https://arxiv.org/abs/2509.26619

Searching for Difficult-to-Translate Test Examples at Scale
NLP models require test data that are sufficiently challenging. The difficulty of an example is linked to the topic it originates from (''seed topic''). The relationship between the topic and the difficulty of its instances is stochastic in nature: an example about a difficult topic can happen to be easy, and vice versa. At the scale of the Internet, there are tens of thousands of potential topics, and finding the most difficult one by drawing and evaluating a large number of examples across al…

New examples in the study of selectively separable spaces
Alan Dow, Hayden Pecoraro
https://arxiv.org/abs/2509.22590 https://arxiv.org/pdf/2509.22590

New examples in the study of selectively separable spaces
The property of being selectively separable is well-studied and generalizations such as H-separable and wH-separable have also generated much interest. Bardyla, Maesano, and Zdomskyy proved from Martin's Axiom that there are countable regular wH-separable spaces that are not H-separable. We prove there is a ZFC example. Their example was also Fréchet-Urysohn, and we produce two additional examples from weaker assumptions.

nnSAM2: nnUNet-Enhanced One-Prompt SAM2 for Few-shot Multi-Modality Segmentation and Composition Analysis of Lumbar Paraspinal Muscles
Zhongyi Zhang, Julie A. Hides, Enrico De Martino, Abdul Joseph Fofanah, Gervase Tuxworth
https://arxiv.org/abs/2510.05555

nnSAM2: nnUNet-Enhanced One-Prompt SAM2 for Few-shot Multi-Modality Segmentation and Composition Analysis of Lumbar Paraspinal Muscles
Purpose: To develop and validate No-New SAM2 (nnsam2) for few-shot segmentation of lumbar paraspinal muscles using only a single annotated slice per dataset, and to assess its statistical comparability with expert measurements across multi-sequence MRI and multi-protocol CT. Methods: We retrospectively analyzed 1,219 scans (19,439 slices) from 762 participants across six datasets. Six slices (one per dataset) served as labeled examples, while the remaining 19,433 slices were used for testing.…

Representations and characters of quantum affine algebras at the crossroads between cluster categorification and quantum integrable models
David Hernandez
https://arxiv.org/abs/2510.06437

Representations and characters of quantum affine algebras at the crossroads between cluster categorification and quantum integrable models
In this lecture, we survey a number of recent results and developments regarding the representation theory of infinite-dimensional quantum groups (quantum affine algebras and related algebras), as well as their connections with cluster categorification and quantum integrable models. We will also give new examples and conjectures.

Symfony: Be careful with eventClass vs. eventName.
If an eventName is set, symfony uses this name to dispatch the event ;-)
https://winkelwagen.de/2025/10/02/symfony-be-careful-with-eventclass-vs-eventname/

Testing the equality of estimable parameters across many populations
Marcos Romero-Madro\~nal, Mar\'ia de los Remedios Sillero-Denamiel, Mar\'ia Dolores Jim\'enez-Gamero
https://arxiv.org/abs/2510.06763

Testing the equality of estimable parameters across many populations
The comparison of a parameter in $k$ populations is a classical problem in statistics. Testing for the equality of means or variances are typical examples. Most procedures designed to deal with this problem assume that $k$ is fixed and that samples with increasing sample sizes are available from each population. This paper introduces and studies a test for the comparison of an estimable parameter across $k$ populations, when $k$ is large and the sample sizes from each population are small when …

Anybody have a good picture of research posters hung up in a department building at a university that I can link somebody?
I'm specifically NOT looking for pictures of posters on display at a conference poster session, or examples of a good/bad poster, which is all I can find on google images.
I'm talking about posters hung up in front of department offices or labs in a random university building.

I don’t really watch sports (I’m glad y’all enjoy tho).
I used to routinely say that I really didn’t understand the difference between just playing a video game; you’d see the same thing.
The last couple of World Series games have been great examples of why I was wrong to say that 😂

Efficient Decomposition Identification of Deterministic Finite Automata from Examples
Junjie Meng, Jie An, Yong Li, Andrea Turrini, Fanjiang Xu, Naijun Zhan, Miaomiao Zhang
https://arxiv.org/abs/2509.24347

Efficient Decomposition Identification of Deterministic Finite Automata from Examples
The identification of deterministic finite automata (DFAs) from labeled examples is a cornerstone of automata learning, yet traditional methods focus on learning monolithic DFAs, which often yield a large DFA lacking simplicity and interoperability. Recent work addresses these limitations by exploring DFA decomposition identification problems (DFA-DIPs), which model system behavior as intersections of multiple DFAs, offering modularity for complex tasks. However, existing DFA-DIP approaches dep…

Fine-Grained Emotion Recognition via In-Context Learning
Zhaochun Ren, Zhou Yang, Chenglong Ye, Haizhou Sun, Chao Chen, Xiaofei Zhu, Xiangwen Liao
https://arxiv.org/abs/2510.06600

Fine-Grained Emotion Recognition via In-Context Learning
Fine-grained emotion recognition aims to identify the emotional type in queries through reasoning and decision-making processes, playing a crucial role in various systems. Recent methods use In-Context Learning (ICL), enhancing the representation of queries in the reasoning process through semantically similar examples, while further improving emotion recognition by explaining the reasoning mechanisms. However, these methods enhance the reasoning process but overlook the decision-making process…

It’s been 36 years since a mass femicide occurred at École Polytechnique in Montréal.
A man shot and killed 14 women because of their sex.
Described as “violent misogyny” by the federal government,
the killings have nonetheless never officially been called femicide in Canada
despite its global recognition as one of the most vivid examples of femicide in the western world.
Women and girls continue to be killed every two days somewhere in Canada, mostly by men. …

Too True Crime
True Crime Podcast · Since 2020, there have been at least 580 women and girls killed by men in acts of gender-related violence across the country. This is called femicide. Too True Crime is a podcast series designed to sh…

There tends to be this implicit assumption that only the state can provide services to the people. It's endemic to liberals. If authoritarians seize power, the thinking goes, there's nothing we can do.
But we have ample examples of the opposite. Trumpism is a specific type of authoritarianism where the state withdraws to allow corporations to control most things. They get a degree of autonomy and, in exchange, bow to the sovereign.
This is common in South American dictatorships (often those backed and supported by the US). So it can be helpful to look to these as examples of how to deal with that type of regime.
#USPol

Rost nilpotence for twisted Milnor hypersurfaces
Charles De Clercq, Evan Marth, Kirill Zainoulline
https://arxiv.org/abs/2510.07095 https://arxiv.org/pdf/2…

Rost nilpotence for twisted Milnor hypersurfaces
We show that the strong Rost nilpotence holds for motives of generic hyperplane sections of twisted Milnor hypersurfaces. Hence, we provide a new family of examples of smooth projective algebraic varieties which satisfy the strong Rost nilpotence principle. As an application, we compute the $p$-canonical dimension for such varieties.

The City of Wauwatosa is looking for new branding/logo design and floated running a "contest" and even posted what appears to be AI art examples.
People are not having it. Many comments were negative of the AI slop and many said "Hire actual designers!" so that's a bright spot this week.
#tosa

Asymptotically flat black holes with a singular Cauchy horizon and a spacelike singularity
Maxime Van de Moortel
https://arxiv.org/abs/2510.07431 https://a…

Asymptotically flat black holes with a singular Cauchy horizon and a spacelike singularity
In our recent work [Van de Moortel, The coexistence of null and spacelike singularities inside spherically symmetric black holes], we analyzed the transition between null and spacelike singularities in spherically symmetric dynamical black holes and demonstrated that the spacelike portion is described by a Kasner metric with positive varying exponents that degenerate to $(1,0,0)$ near the null-spacelike transition. In the present paper, we provide examples of global spacetimes satisfying the as…

A look at Live Translation on AirPods Pro, one of the strongest examples yet of how AI can be used in a seamless, practical way to improve people's lives (Brian X. Chen/New York Times)
https://www.nytimes.com/2025/09/18/technology/…

Apple’s New AirPods Offer Impressive Language Translation
The technology is one of the strongest examples yet of how artificial intelligence can be used in a seamless, practical way to improve people’s lives.

Neologism Learning for Controllability and Self-Verbalization
John Hewitt, Oyvind Tafjord, Robert Geirhos, Been Kim
https://arxiv.org/abs/2510.08506 https://

Neologism Learning for Controllability and Self-Verbalization
Humans invent new words when there is a rising demand for a new useful concept (e.g., doomscrolling). We explore and validate a similar idea in our communication with LLMs: introducing new words to better understand and control the models, expanding on the recently introduced neologism learning. This method introduces a new word by adding a new word embedding and training with examples that exhibit the concept with no other changes in model parameters. We show that adding a new word allows for …

Tensor Network Loop Cluster Expansions for Quantum Many-Body Problems
Johnnie Gray, Gunhee Park, Glen Evenbly, Nicola Pancotti, Garnet Kin-Lic Chan
https://arxiv.org/abs/2510.05647

Tensor Network Loop Cluster Expansions for Quantum Many-Body Problems
We analyze the tensor network loop cluster expansion, introduced in arXiv:2504.07344 as a systematic correction to belief propagation, in the context of general quantum many-body problems. We provide numerical examples of the accuracy and practical applicability of the approach for the computation of ground-state observables for high bond dimension tensor networks, in two- and three-dimensions, with open and periodic boundary conditions, and for spin and fermion problems.

Despite all the talk of 'algoraves' etc, over the past couple of decades there has been a distinct lack of videos showing 1/ code projected 2/ person writing that code live 3/ people dancing to said code .. it's definitely happened but there hasn't been a lot of documentary evidence. Seems to be changing at the moment ! (feel free to reply with recent examples/historical counter-examples)

Inductive Learning for Possibilistic Logic Programs Under Stable Models
Hongbo Hu, Yisong Wang, Yi Huang, Kewen Wang
https://arxiv.org/abs/2510.07069 https://

Inductive Learning for Possibilistic Logic Programs Under Stable Models
Possibilistic logic programs (poss-programs) under stable models are a major variant of answer set programming (ASP). While its semantics (possibilistic stable models) and properties have been well investigated, the problem of inductive reasoning has not been investigated yet. This paper presents an approach to extracting poss-programs from a background program and examples (parts of intended possibilistic stable models). To this end, the notion of induction tasks is first formally defined, its…

T-duality and bosonization as examples of continuum gauging and disentangling
Gertian Roose, Erez Zohar
https://arxiv.org/abs/2509.24630 https://arxiv.org/…

T-duality and bosonization as examples of continuum gauging and disentangling
Dualities and duality transformations form a well established methodology in various aspects of quantum many body physics and quantum field theories, allowing one to exploit equivalence between models which may naively seem completely different in order to gain access to further physical regimes, either analytically, numerically or experimentally. Recently, in the context of condensed matter physics and quantum information, it was shown that dualities can be understood very well through a gaugi…

Curiosity-Driven Co-Development of Action and Language in Robots Through Self-Exploration
Theodore Jerome Tinker, Kenji Doya, Jun Tani
https://arxiv.org/abs/2510.05013 https://

Curiosity-Driven Co-Development of Action and Language in Robots Through Self-Exploration
Human infants acquire language and action co-developmentally, achieving remarkable generalization capabilities from only a minimal number of learning examples. In contrast, recent large language models require exposure to billions of training tokens to achieve such generalization. What mechanisms underlie such efficient developmental learning in humans? This study addresses this question through simulation experiments in which robots learn to perform various actions corresponding to imperative …

Zero-Shot Robustness of Vision Language Models Via Confidence-Aware Weighting
Nikoo Naghavian, Mostafa Tavassolipour
https://arxiv.org/abs/2510.02913 https://

Zero-Shot Robustness of Vision Language Models Via Confidence-Aware Weighting
Vision-language models like CLIP demonstrate impressive zero-shot generalization but remain highly vulnerable to adversarial attacks. In this work, we propose Confidence-Aware Weighting (CAW) to enhance zero-shot robustness in vision-language models. CAW consists of two components: (1) a Confidence-Aware loss that prioritizes uncertain adversarial examples by scaling the KL divergence between clean and adversarial predictions, and (2) a feature alignment regularization that preserves semantic c…

Quasi-Ergodic Control of Multi-Periodic Autoregressive Processes: Formulation and Examples
Vyacheslav Kungurtsev
https://arxiv.org/abs/2509.24729 https://a…

Quasi-Ergodic Control of Multi-Periodic Autoregressive Processes: Formulation and Examples
This work considers state dynamics driven by Periodic Autoregressive Moving Average noise, and control of the system over time. Such processes appear frequently in applications involving the environment, such as energy and agriculture. Managing these systems applying forecasts to make decisions that exhibit foresight and risk aversion while maximizing profits is a challenging control problem that can be computationally difficult for standard scenario- based methods. This paper presents a formul…

Accelerated and fast magnetic reconnection through enhanced resistive dissipation for MHD equations
Gennaro Ciampa, Renato Luc\`a
https://arxiv.org/abs/2510.06801 https://

Accelerated and fast magnetic reconnection through enhanced resistive dissipation for MHD equations
We consider the phenomenon of magnetic reconnection, namely a change in the topology of magnetic lines, for sufficiently regular solutions of the three-dimensional periodic magnetohydrodynamic (MHD) equations. We provide examples where magnetic reconnection occurs on time scales shorter than the resistive one, due to enhanced dissipation emerging from advective effects. This is the first analytical result where the advection term plays an active role in the reconnection process. A key aspect of…

from my link log —
Determination of the fifth Busy Beaver value.
https://arxiv.org/abs/2509.12337
saved 2025-09-17 https://dotat.at/:/7EVGI.html…

Determination of the fifth Busy Beaver value
We prove that $S(5) = 47,176,870$ using the Coq proof assistant. The Busy Beaver value $S(n)$ is the maximum number of steps that an $n$-state 2-symbol Turing machine can perform from the all-zero tape before halting, and $S$ was historically introduced by Tibor Radó in 1962 as one of the simplest examples of an uncomputable function. The proof enumerates $181,385,789$ Turing machines with 5 states and, for each machine, decides whether it halts or not. Our result marks the first determination…

Prompt, Synthesize, Fine-Tune: A Secure Code Generation Recipe
Junjie Li, Fazle Rabbi, Bo Yang, Song Wang, Jinqiu Yang
https://arxiv.org/abs/2510.07189 https://

Prompt, Synthesize, Fine-Tune: A Secure Code Generation Recipe
Although Large Language Models (LLMs) show promising solutions to automated code generation, they often produce insecure code that threatens software security. Current approaches (e.g., SafeCoder) to improve secure code generation suffer from limited and imbalanced datasets, reducing their effectiveness and generalizability. In this work, we present Secure-Instruct, a novel framework that automatically synthesizes high-quality vulnerable and secure code examples, generates fine-tuning instructi…

In addition to <https://mastodon.bsd.cafe/@lw/115658547866818342>:
― a bug in the Examples section of the manual page for freebsd-base(7) in FreeBSD-RELEASE
<

Bridged Clustering for Representation Learning: Semi-Supervised Sparse Bridging
Patrick Peixuan Ye, Chen Shani, Ellen Vitercik
https://arxiv.org/abs/2510.07182 https://

Bridged Clustering for Representation Learning: Semi-Supervised Sparse Bridging
We introduce Bridged Clustering, a semi-supervised framework to learn predictors from any unpaired input $X$ and output $Y$ dataset. Our method first clusters $X$ and $Y$ independently, then learns a sparse, interpretable bridge between clusters using only a few paired examples. At inference, a new input $x$ is assigned to its nearest input cluster, and the centroid of the linked output cluster is returned as the prediction $\hat{y}$. Unlike traditional SSL, Bridged Clustering explicitly levera…

Pragyaan: Designing and Curating High-Quality Cultural Post-Training Datasets for Indian Languages
Neel Prabhanjan Rachamalla, Aravind Konakalla, Gautam Rajeev, Ashish Kulkarni, Chandra Khatri, Shubham Agarwal
https://arxiv.org/abs/2510.07000

Pragyaan: Designing and Curating High-Quality Cultural Post-Training Datasets for Indian Languages
The effectiveness of Large Language Models (LLMs) depends heavily on the availability of high-quality post-training data, particularly instruction-tuning and preference-based examples. Existing open-source datasets, however, often lack multilingual coverage, cultural grounding, and suffer from task diversity gaps that are especially pronounced for Indian languages. We introduce a human-in-the-loop pipeline that combines translations with synthetic expansion to produce reliable and diverse Indic…

$(P,\phi)$-Tamari lattices
Adrien Segovia
https://arxiv.org/abs/2510.06088 https://arxiv.org/pdf/2510.06088

$(P,ϕ)$-Tamari lattices
Given any poset $P$ and chain $ϕ$ in $P$, we define the $(P,ϕ)$-Tamari lattice. We study in depth these lattices and prove in particular that they are join-semidistributive, join-congruence uniform and left modular. We prove that the lattices of higher torsion classes of the higher Auslander and Nakayama algebras of type $\mathbb{A}$ are examples of $(P,ϕ)$-Tamari lattices and thus they inherit their properties. We also give general results related to left modular, extremal and congruence no…

Folks demanding political / ideological purity
fail to see that this is no longer a movement belonging to the left / liberals.
This is an opposition against fascism.
By definition it must be big tent.
Failure to grasp this: see divided oppositions in Eastern Europe as your failed examples.
https://

Melissa Chan (@melissakchan.bsky.social)
Folks demanding political / ideological purity fail to see that this is no longer a movement belonging to the left / liberals. This is an opposition against fascism. By definition it must be big tent. Failure to grasp this: see divided oppositions in Eastern Europe as your failed examples.

Shifted Symplectic Geometry by Examples
Damien Calaque, Stefano Ronchi
https://arxiv.org/abs/2510.04625 https://arxiv.org/pdf/2510.04625

Shifted Symplectic Geometry by Examples
These notes are intended to be an introduction to shifted symplectic geometry, targeted to Poisson geometers with a serious background in homological algebra. They are extracted from a mini-course given by the first author at the Poisson 2024 summer school that took place at the Accademia Pontaniana in Napoli.

Learning from Failures: Understanding LLM Alignment through Failure-Aware Inverse RL
Nyal Patel, Matthieu Bou, Arjun Jagota, Satyapriya Krishna, Sonali Parbhoo
https://arxiv.org/abs/2510.06092

Learning from Failures: Understanding LLM Alignment through Failure-Aware Inverse RL
Reinforcement Learning from Human Feedback (RLHF) aligns Large Language Models (LLMs) with human preferences, yet the underlying reward signals they internalize remain hidden, posing a critical challenge for interpretability and safety. Existing approaches attempt to extract these latent incentives using Inverse Reinforcement Learning (IRL), but treat all preference pairs equally, often overlooking the most informative signals: those examples the extracted reward model misclassifies or assigns …

Generating Difficult-to-Translate Texts
Vil\'em Zouhar, Wenda Xu, Parker Riley, Juraj Juraska, Mara Finkelstein, Markus Freitag, Dan Deutsch
https://arxiv.org/abs/2509.26592

Generating Difficult-to-Translate Texts
Machine translation benchmarks sourced from the real world are quickly obsoleted, due to most examples being easy for state-of-the-art translation models. This limits the benchmark's ability to distinguish which model is better or to reveal models' weaknesses. Current methods for creating difficult test cases, such as subsampling or from-scratch synthesis, either fall short of identifying difficult examples or suffer from a lack of diversity and naturalness. Inspired by the iterative process of…

Low-dimensional topology and symplectic dynamics
Dan Cristofaro-Gardiner
https://arxiv.org/abs/2510.07680 https://arxiv.org/pdf/2510.07680

Low-dimensional topology and symplectic dynamics
These are notes to accompany my lectures at the $2024$ "Current Developments in Mathematics" conference hosted by Harvard/MIT. The lectures were about some recent progress in our understanding of two and three dimensional dynamical systems, using in part some tools from low-dimensional topology. In these notes, I try to give a sense for how this works by discussing a few examples from problems I have worked on and surveying some related developments. Some symplectic variants of Weyl's law play …