{
  "counts": {
    "adjacent": 20,
    "core": 3,
    "errors": 0,
    "negative": 65,
    "total": 88
  },
  "date": "2026-09-27",
  "errors": [],
  "fresh_content_days": 21,
  "generated_at": "2026-09-27T19:12:37Z",
  "items": [
    {
      "age_days": 3,
      "arxiv_id": "2609.29870",
      "authors": [
        "Hongshu Wang",
        "Xinyue Zuo",
        "Yufan Cai",
        "Neeraj Kumar Singh",
        "Yamine Ait Ameur",
        "Jin Song Dong"
      ],
      "content_date": "2026-09-24",
      "freshness": "fresh",
      "id": "arxiv:2609.29870",
      "kind": "paper",
      "label": "core",
      "matched_signals": [
        "autoformalization",
        "verifier_guided_reasoning"
      ],
      "published": "2026-09-24",
      "score": 6.5,
      "source": "arxiv-ai4math-core",
      "summary": "Formal modeling provides strong guarantees about system correctness, but developing and repairing formal models remains labor-intensive and requires substantial expertise in logic and formal reasoning. Recent LLM-based autoformalization agents seek to reduce this burden by generating candidate formal models and revising them using feedback from formal tools. However, the existing approaches follow a generate-and-repair paradigm, in which repairs are driven by verification failures of the generated model and therefore depend heavily on both the granularity of the feedback and the LLM's repair capability. As a consequence, a repair targeting one level of verification may invalidate properties at another level, which requires reasoning over the complete set of event guards. To address these limitations, we propose Proof-Sketch-Guided Formal Model Synthesis (ProGS), an autoformalization method centered on model-based proof sketches. A model-based proof sketch represents the proof structure of the target formal system as a tree. Internal nodes capture case splits and inductive reasoning steps, while leaf nodes correspond to concrete state-transition events that realize individual subgoals. ProGS uses LLMs to generate and repair these sketches, with verification failures mapped back to specific nodes and subtrees to provide structured guidance for iterative repair. Our evaluation on a benchmark of 27 formal systems shows that ProGS improves over state-of-the-art agentic formal modeling approaches in syntactic validity, deductive verifiability, and behavioral correctness, demonstrating the benefit of organizing formal model construction around hierarchical proof sketches.",
      "title": "Formal Model Construction Guided by Model-Based Proof Sketches",
      "updated": "2026-09-24",
      "url": "https://arxiv.org/abs/2609.29870"
    },
    {
      "age_days": 4,
      "arxiv_id": "2609.27495",
      "authors": [
        "Gyeongwon Jeong",
        "Seonghun Park",
        "Seonghyuk Im",
        "Joonkyung Lee",
        "Hongseok Yang"
      ],
      "content_date": "2026-09-23",
      "freshness": "fresh",
      "id": "arxiv:2609.27495",
      "kind": "paper",
      "label": "core",
      "matched_signals": [
        "lean_formal_proving_agents"
      ],
      "published": "2026-09-23",
      "score": 6.5,
      "source": "arxiv-ai4math-core",
      "summary": "We prove that the Turán density of the tetrahedron $K_4^{(3)}$ satisfies $π(K_4^{(3)}) \\le 312372062889819/560000000000000 < 0.557808$, improving Baber's upper bound of $0.5615$ and closing about $62\\%$ of the gap to the conjectured value $5/9$. The proof uses an exact seven-vertex flag-algebra certificate incorporating degree-stationarity from Razborov's differential method. To find the certificate, we combine the established techniques of cutting planes and column generation to optimize jointly over flag families whose types have at most five vertices. We give a complete formal proof of this Turán density bound in Lean 4.",
      "title": "A New Upper Bound for the Turán Density of the Tetrahedron",
      "updated": "2026-09-23",
      "url": "https://arxiv.org/abs/2609.27495"
    },
    {
      "age_days": 5,
      "arxiv_id": "2609.26546",
      "authors": [
        "Chris Dzoba"
      ],
      "content_date": "2026-09-22",
      "freshness": "fresh",
      "id": "arxiv:2609.26546",
      "kind": "paper",
      "label": "core",
      "matched_signals": [
        "lean_formal_proving_agents"
      ],
      "published": "2026-09-22",
      "score": 6.5,
      "source": "arxiv-ai4math-core",
      "summary": "We exhibit simple, rotationally symmetric Venn diagrams with 17 curves and with 19 curves: n Jordan curves carried to one another by rotation through 2π/n, with every one of the 2^n regions present and connected and, since the diagrams are simple, every crossing on exactly two curves. Symmetric Venn diagrams exist for every prime number of curves (Griggs, Killian and Savage, 2004), but those diagrams have many curves through a point; simple ones were known only up to 13 curves (Mamakani and Ruskey, 2014). Four 17-curve and nine 19-curve diagrams were found by a Metropolis walk on rotation-invariant quadrangulations of the sphere in which regions may temporarily be duplicated, started from the Griggs-Killian-Savage diagram with its multiple crossings resolved. Every diagram is given by a machine-checkable certificate; one certificate of each size has been verified by a formal proof in Lean 4. All of the diagrams are non-monotone, which is why the crossing-sequence searches that found the 11- and 13-curve diagrams could not have found them.",
      "title": "Simple symmetric Venn diagrams with 17 and 19 curves",
      "updated": "2026-09-22",
      "url": "https://arxiv.org/abs/2609.26546"
    },
    {
      "age_days": 4,
      "arxiv_id": "2609.27991",
      "authors": [
        "Georg Pichler"
      ],
      "content_date": "2026-09-23",
      "freshness": "fresh",
      "id": "arxiv:2609.27991",
      "kind": "paper",
      "label": "adjacent",
      "matched_signals": [
        "general_ai_math_reasoning",
        "lean_formal_proving_agents"
      ],
      "published": "2026-09-23",
      "score": 4.9,
      "source": "arxiv-ai4math-core",
      "summary": "We settle three conjectures concerning a doubly symmetric binary source $(X,Y)$ with crossover $p$. Consider Markov chains $U - X - Y - V$ with $U,V$ binary, and let $\\mathcal{A}$ be the set of rate triples $(I(U;V),I(U;X),I(Y;V))$ attainable with arbitrary binary channels $X\\to U$, $Y\\to V$, and $\\mathcal{B}$ the subset attainable with binary symmetric channels. The averaged BSC conjecture, Conjecture 5.2 of Pichler, Piantanida and Matz (2022), asserts $\\operatorname{conv}\\mathcal{A}=\\operatorname{conv}\\mathcal{B}$. We prove this for every $p\\in[0,1]$. Two conjectures of Dikshtein, Ordentlich and Shamai (2022) concern the double-sided information bottleneck at $p=0$, where $Y=X$ and the two channels see the same source: their Conjecture 1 identifies the exact maximum of $I(U;V)$ at prescribed rates $I(U;X)$ and $I(Y;V)$, and their Conjecture 2 the exact minimum. We prove both for binary $U,V$: the two extrema are attained by the same pair of Z/S-channels, in opposite orientation for the maximum and in the same orientation for the minimum. The proofs were found with substantial AI assistance, and all three theorems are formalised in Lean 4 with Mathlib, depending only on the standard axioms. The development is available at https://github.com/g-pichler/bsc-averaging . The proof of Conjecture 1 of Dikshtein, Ordentlich and Shamai (2022) contains three certified computations, a polynomial bound, an interval sweep and a polynomial positivity certificate, all of which are checked in Lean.",
      "title": "Three Conjectures on Binary Channels for the Doubly Symmetric Binary Source",
      "updated": "2026-09-23",
      "url": "https://arxiv.org/abs/2609.27991"
    },
    {
      "age_days": 4,
      "arxiv_id": "2609.28603",
      "authors": [
        "Niket Patel",
        "Ahmad Rammal",
        "Amaury Hayat",
        "Remi Munos",
        "Julia Kempe"
      ],
      "content_date": "2026-09-23",
      "freshness": "fresh",
      "id": "arxiv:2609.28603",
      "kind": "paper",
      "label": "adjacent",
      "matched_signals": [
        "general_ai_math_reasoning",
        "lean_formal_proving_agents"
      ],
      "published": "2026-09-23",
      "score": 4.9,
      "source": "arxiv-ai4math-core",
      "summary": "Recently, Large Language Models (LLMs) have been increasingly able to solve advanced mathematical problems, including many that have been open for decades. This opens the door to expansion of mathematical knowledge at unprecedented scale. Yet, while LLMs may be able to conjecture and prove more and more theorems, it remains open whether this new mathematical knowledge is interesting or useful. We define intrinsic interestingness of a theorem as the ratio between the length of its proof and the length of its statement. We show that this correlates strongly with an extrinsic measure of the downstream utility of a theorem. We identify the difficulty of a proof conditioned on a set of premises as a useful primitive for computing these metrics, and train a 27B model that predicts proof difficulty more accurately than frontier general-purpose models. Optimizing for our metric creates a model capable of producing more interesting theorems, while also reducing substantial or full overlap with Mathlib from 91.9% to 30.6%, showcasing the creation of more out-of-distribution math. We show that our system can generate candidate theorems, select the most interesting among them, and iteratively build on a self-expanding mathematical library. These metrics provide a practical and quantifiable signal for ranking conjectures and guiding proof search within formal mathematical libraries. Our framework provides a path towards self-expanding, machine-verified mathematical libraries that can choose worthwhile statements without relying on human-supplied targets.",
      "title": "Learning to Discover Interesting Mathematics",
      "updated": "2026-09-23",
      "url": "https://arxiv.org/abs/2609.28603"
    },
    {
      "age_days": 4,
      "arxiv_id": "2609.28447",
      "authors": [
        "Zhou Longfei",
        "Haijun Zou",
        "Tianhao Liu"
      ],
      "content_date": "2026-09-23",
      "freshness": "fresh",
      "id": "arxiv:2609.28447",
      "kind": "paper",
      "label": "adjacent",
      "matched_signals": [
        "general_ai_math_reasoning",
        "lean_formal_proving_agents"
      ],
      "published": "2026-09-23",
      "score": 4.9,
      "source": "arxiv-ai4math-core",
      "summary": "For a convex body $K\\subset\\mathbb{R}^n$, let $w(K)$ denote the volume of its maximum-volume inscribed ellipsoid. We prove that every closed halfspace $H$ whose boundary passes through the center of the maximizing ellipsoid satisfies \\[ w(K\\cap H)\\le\\frac{\\sqrt e}{2}\\,w(K). \\] The constant is optimal uniformly over all dimensions, as witnessed by a family of circular cones, thereby establishing Khachiyan's conjecture. The proof converts containment, maximality, and the central-cut condition into algebraic constraints on positive definite matrices. Two complementary spectral bounds from a diagonal model extend to arbitrary center displacements through a directional rank-one estimate for fractional trace powers. Concavity determines their joint optimum. We also derive finite-dimensional bounds and a necessary condition for near equality, with self-contained supporting proofs and an alternative resolvent argument. An AI language model discovered the proof in a human-directed research process. Lean 4 with mathlib verifies the main theorem, sharpness, and supporting results.",
      "title": "A Spectral Proof of Khachiyan's Ellipsoid Conjecture",
      "updated": "2026-09-23",
      "url": "https://arxiv.org/abs/2609.28447"
    },
    {
      "age_days": 5,
      "arxiv_id": "2609.28534",
      "authors": [
        "Polona Durcik",
        "Marco Fraccaroli",
        "Joris Roos"
      ],
      "content_date": "2026-09-22",
      "freshness": "fresh",
      "id": "arxiv:2609.28534",
      "kind": "paper",
      "label": "adjacent",
      "matched_signals": [
        "general_ai_math_reasoning",
        "lean_formal_proving_agents"
      ],
      "published": "2026-09-22",
      "score": 4.9,
      "source": "arxiv-ai4math-core",
      "summary": "A weak form of the Hellinger conjecture of Anantharam, Bogdanov, Chakrabarti, Jayram, and Nair for the binary symmetric channel is proved: dictator functions maximize Hellinger $Φ$-entropy among all Boolean functions of the input and all one-bit statistics of the output of a noisy channel. The technical heart of the matter is an explicit inequality in three real parameters, which is proved using explicit polynomial approximations and computer-assisted positivity checks. The results are also formally verified in Lean 4.",
      "title": "A weak Hellinger inequality for noisy Boolean channels",
      "updated": "2026-09-22",
      "url": "https://arxiv.org/abs/2609.28534"
    },
    {
      "age_days": 3,
      "arxiv_id": "2609.30163",
      "authors": [
        "George Danezis",
        "Zeno De Angeli",
        "Philipp Jovanovic",
        "Lefteris Kokoris-Kogias",
        "Markus Legner",
        "Alberto Sonnino"
      ],
      "content_date": "2026-09-24",
      "freshness": "fresh",
      "id": "arxiv:2609.30163",
      "kind": "paper",
      "label": "adjacent",
      "matched_signals": [
        "lean_formal_proving_agents"
      ],
      "published": "2026-09-24",
      "score": 3.5,
      "source": "arxiv-ai4math-core",
      "summary": "Dual-mode consensus protocols are fast when the network is partially synchronous and remain live under asynchrony. We introduce Steelhead, a dual-mode mechanism that composes a partially synchronous and an asynchronous commit rule over one DAG: every k-th round is decided by the asynchronous rule, whose leader a common coin reveals after the votes, and all other rounds by the partially synchronous rule. Every interval, validators replay the committed DAG under each candidate period, adopt the one with the fewest expected message delays, and fall back to k = 1 when the output stalls; the asynchronous rule applied to the coin rounds alone keeps the protocol live. Steelhead sends no message beyond the DAG's blocks, not even to agree on the period, and opens a coin only on the rounds that need a hidden leader. It is generic over pairs of DAG commit rules that share a committee; we instantiate it with Mysticeti and Mahi-Mahi at n >= 3f+1 and with the two variants of BlueBottle at n >= 5f+1. We prove it safe and live, and provide mechanized proofs in Lean 4. In simulation, Steelhead matches the partially synchronous protocol in a healthy network, stays close to the asynchronous one when network conditions stall the partially synchronous one, and adapts quickly in both directions.",
      "title": "Steelhead: Interleaving Partially Synchronous and Asynchronous Commit Rules on a Shared DAG",
      "updated": "2026-09-24",
      "url": "https://arxiv.org/abs/2609.30163"
    },
    {
      "age_days": 3,
      "arxiv_id": "2609.29296",
      "authors": [
        "Lihan Xie",
        "Zhicheng Hui",
        "Yingjun Lan",
        "Zhehao Li",
        "Xingzhi Qi",
        "Siyue Huang",
        "Jirui Liu",
        "Chuxiao Zeng",
        "Bohan Zhao",
        "Qinxiang Cao"
      ],
      "content_date": "2026-09-24",
      "freshness": "fresh",
      "id": "arxiv:2609.29296",
      "kind": "paper",
      "label": "adjacent",
      "matched_signals": [
        "lean_formal_proving_agents"
      ],
      "published": "2026-09-24",
      "score": 3.5,
      "source": "arxiv-ai4math-core",
      "summary": "Existing formal mathematics benchmarks, such as miniF2F, ProofNet, and PutnamBench, primarily evaluate models on constructing complete formal proofs for challenging problems. Because success is measured at the theorem level, these benchmarks offer limited insight into models' step-level formal reasoning. Evaluating this capability separately enables finer-grained diagnosis of model limitations than theorem-level evaluation alone. To fill this evaluation gap, we introduce ProofGap, a fine-grained benchmark for step-level formal reasoning. ProofGap is constructed through a natural-language proof-processing pipeline that decomposes each reasoning step into one or more aligned proof gaps. Applying this pipeline to natural-language solutions to 3,015 exercises in B. P. Demidovich's Problems in Mathematical Analysis yields 26,116 gaps. The benchmark focuses on mathematical analysis, a domain that remains challenging for current models. By supplying the local context and target explicitly, gap completion isolates local formal proof construction from end-to-end proof composition, enabling more precise localization of model failures. Natural-language solutions serve as the provenance of these obligations, while the benchmark task itself starts from an already formalized local context and goal. Beyond benchmarking, the same pipeline may support future proof-verification systems, provided that semantic translation and sequential proof composition are handled reliably.",
      "title": "ProofGap: Benchmarking Step-Level Formal Reasoning with Local Obligations Derived from Natural-Language Solutions",
      "updated": "2026-09-24",
      "url": "https://arxiv.org/abs/2609.29296"
    },
    {
      "age_days": 4,
      "arxiv_id": "2609.28341",
      "authors": [
        "Jaume de Dios Pont",
        "Josef Greilhuber",
        "Lukas Liehr",
        "Mitchell A. Taylor"
      ],
      "content_date": "2026-09-23",
      "freshness": "fresh",
      "id": "arxiv:2609.28341",
      "kind": "paper",
      "label": "adjacent",
      "matched_signals": [
        "lean_formal_proving_agents"
      ],
      "published": "2026-09-23",
      "score": 3.5,
      "source": "arxiv-ai4math-core",
      "summary": "We prove that for every window $w$ of the form $w(x) = e^{-π|x|^2} h(x)$, where $h$ is a polynomial, there exists a uniformly discrete set of points $\\mathcal{S} \\subset \\mathbb R^{2d}$ such that the magnitude of the short-time Fourier transform $V_w f$ on $\\mathcal{S}$ determines every $f \\in L^2(\\mathbb R^d)$ up to a constant phase factor. The separation distance can be chosen independent of the degree of $h$ and proportional to the square root of the dimension. The proof combines a discrete norming inequality, based on a multidimensional Remez inequality and VC-dimension bounds, with tail estimates for the reproducing kernel. A formalization of our main result in Lean 4 is also provided.",
      "title": "Phase retrieval from a uniformly discrete point set",
      "updated": "2026-09-23",
      "url": "https://arxiv.org/abs/2609.28341"
    },
    {
      "age_days": 4,
      "arxiv_id": "2609.28791",
      "authors": [
        "Yu Jiang"
      ],
      "content_date": "2026-09-23",
      "freshness": "fresh",
      "id": "arxiv:2609.28791",
      "kind": "paper",
      "label": "adjacent",
      "matched_signals": [
        "lean_formal_proving_agents"
      ],
      "published": "2026-09-23",
      "score": 3.5,
      "source": "arxiv-ai4math-core",
      "summary": "The Meir--Moser rectangle-packing problem asks whether all rectangles with side lengths \\(1/n\\) and \\(1/(n+1)\\), for \\(n\\ge1\\), can be packed into the unit square with pairwise disjoint interiors. We establish a tail version of this problem. Let \\(R_n\\) denote the rectangle with these side lengths. We prove that there exists an integer \\(m_0\\) such that, for every \\(m\\ge m_0\\), the family \\(\\{R_n:n\\ge m\\}\\) admits a packing, by translations and right-angle rotations, into a square of side length \\(m^{-1/2}\\), with pairwise disjoint interiors. The area of the square equals the sum of the areas of all the rectangles. The geometric construction recursively decomposes rectangular gaps, while local randomized quotas and random permutations assign subsequent integer indices. We separately control the total area of waiting gaps and the assignment load at each index. The proof is organized in six steps: a finite-prefix reduction, geometric row decompositions, an area bootstrap, a sharp source-load estimate, control of the actual adaptive construction, and a compactness limit. For every finite time horizon, the probability of failure has a bound that is independent of the horizon and can be made arbitrarily small. The adaptive step uses a permanent load ledger, actual fresh height queries, and a one-sided comparison with a frozen source experiment. Compactness then yields an infinite packing. The final packing statements have been checked in Lean 4. A sufficient threshold is \\(m_0=10^{1000}\\). This result applies only to sufficiently late tails and does not resolve the original Meir--Moser rectangle-packing problem for the full sequence starting at \\(n=1\\), which remains open.",
      "title": "Packing Tails of Reciprocal Rectangles into Squares of Equal Area",
      "updated": "2026-09-23",
      "url": "https://arxiv.org/abs/2609.28791"
    },
    {
      "age_days": 4,
      "arxiv_id": "2609.28102",
      "authors": [
        "Stefan Szeider"
      ],
      "content_date": "2026-09-23",
      "freshness": "fresh",
      "id": "arxiv:2609.28102",
      "kind": "paper",
      "label": "adjacent",
      "matched_signals": [
        "lean_formal_proving_agents"
      ],
      "published": "2026-09-23",
      "score": 3.5,
      "source": "arxiv-ai4math-core",
      "summary": "A graph is biplanar if it is the union of two planar graphs on the same vertex set. The largest chromatic number of a biplanar graph is known to lie between 9 and 12. The lower bound comes from Sulanke's graph, which has independence number 2, and a biplanar graph on 19 vertices with independence number 2 would have chromatic number at least 10. Gethner and Sulanke asked in 2009 whether such a graph exists. We show that it does not, and more generally that every biplanar graph with independence number at most 2 is 9-colorable. The proof embeds a hypothetical counterexample in the union of two sphere triangulations, enumerates with SAT modulo symmetries the 3271 graphs that pass a necessary filter for the complement of such a union, and shows with a SAT solver that none of them is such a complement; a matching argument reduces the general statement to this computation and one further case on 18 vertices. The computational part of the proof, including the completeness of the enumeration and every refutation, is checked in Lean 4, assuming three classical facts about planar graphs. The Lean development, the SAT instances, and the enumeration certificates are available on Zenodo.",
      "title": "Biplanar graphs with independence number two are 9-colorable",
      "updated": "2026-09-23",
      "url": "https://arxiv.org/abs/2609.28102"
    },
    {
      "age_days": 5,
      "arxiv_id": "2609.27105",
      "authors": [
        "Katharina Stein",
        "Chaahat Jain",
        "Jörg Hoffmann",
        "Alexander Koller"
      ],
      "content_date": "2026-09-22",
      "freshness": "fresh",
      "id": "arxiv:2609.27105",
      "kind": "paper",
      "label": "adjacent",
      "matched_signals": [
        "lean_formal_proving_agents"
      ],
      "published": "2026-09-22",
      "score": 3.5,
      "source": "arxiv-ai4math-core",
      "summary": "Generalized planning aims to compute a plan that solves all instances of a planning domain. Recent work has used LLMs to automatically generate and debug such generalized plans in the form of Python programs and achieved perfect test data coverage for several domains. However, whether these generalized plans are actually complete, i.e. solve all instances of the domain, could only be determined by manual evaluation. Here, we present an approach for automatically generating generalized plans in Lean together with proofs of their completeness relative to a specification of the domain constraints provided as input. We introduce a semantic-preserving PDDL-to-Lean conversion, and use an LLM to generate both the generalized plan and the formal proof that it solves every instance satisfying the domain constraints. The correctness of the completeness proof is determined by Lean's kernel. We evaluate our approach on 13 commonly used benchmark domains, using GPT-5.6-Sol as the LLM. For 12 of the domains we obtain generalized plans together with valid completeness proofs. This is a major advancement of the state of the art in automatic generalized-plan completeness proofs.",
      "title": "Provably Complete Generalized Planning with LLMs",
      "updated": "2026-09-22",
      "url": "https://arxiv.org/abs/2609.27105"
    },
    {
      "age_days": 5,
      "arxiv_id": "2609.25918",
      "authors": [
        "Qianyu Yu",
        "Lefteris Kokoris-Kogias",
        "Alberto Sonnino"
      ],
      "content_date": "2026-09-22",
      "freshness": "fresh",
      "id": "arxiv:2609.25918",
      "kind": "paper",
      "label": "adjacent",
      "matched_signals": [
        "lean_formal_proving_agents"
      ],
      "published": "2026-09-22",
      "score": 3.5,
      "source": "arxiv-ai4math-core",
      "summary": "DAG-based consensus protocols can achieve great throughput and the optimal three-message-delay limit for n = 3f+1 consensus. While two-delay protocols exist, they pay with reduced resilience (requiring 5f+1-style committees) or rely on fallbacks that sacrifice the DAG's high throughput. This paper introduces Hydrozoan, the first DAG protocol with a dual commit path under a hybrid fault model of f Byzantine and c crashed validators, on n = 3f+c+2p+1 validators. Leaders commit in two message delays whenever at most p validators are faulty, and in three otherwise, with no extra messages, no view changes, and multiple leaders per round. Both paths are evaluated on the same DAG, using a novel graded indirect rule to reconcile them so that every honest validator reaches the same decision. We show that under geo-distributed conditions, which path is faster is a property of geography rather than the protocol, as rounds reaching a remote region cost far more than those that do not. The (f, c, p) knobs place the fast quorum where the deployment requires it, allowing a commit in two message delays. If misconfigured, Hydrozoan can still commit in three message delays: Hydrozoan commits on whichever path fires first. We also present Optimal-Hydrozoan, a variant that tolerates one more fault on the fast path, the first construction to match the known lower bound. The safety and liveness of both protocols are machine-checked in Lean 4. Our geo-distributed evaluation shows that Hydrozoan matches Mysticeti's throughput, commits ~25% faster when the fast quorum fits fast regions, and falls back to three message delays when it does not or past p faults, where existing two-delay protocols stall.",
      "title": "Hydrozoan: Latency-Adaptive DAG Consensus under Mixed Byzantine and Crash Faults",
      "updated": "2026-09-22",
      "url": "https://arxiv.org/abs/2609.25918"
    },
    {
      "age_days": 5,
      "arxiv_id": "2609.25575",
      "authors": [
        "Adam Ousherovitch",
        "Ambuj Tewari"
      ],
      "content_date": "2026-09-22",
      "freshness": "fresh",
      "id": "arxiv:2609.25575",
      "kind": "paper",
      "label": "adjacent",
      "matched_signals": [
        "lean_formal_proving_agents"
      ],
      "published": "2026-09-22",
      "score": 3.5,
      "source": "arxiv-ai4math-core",
      "summary": "Fine-tuned Large Language Models (LLMs) significantly advance Automated Theorem Proving (ATP), but are often deployed as guiding policies within tree search rather than for single-attempt generation. Recent work shows cross entropy is suboptimal for an LLM used in flat search strategies such as aggregation or filtering and that work has developed new loss functions to correct this misalignment. Extending this alignment to tree search is more challenging: proof discovery depends on exploration and recovery through off-trace states that supervised demonstrations do not reveal. We extend Compute-Aligned Training (CAT) to this setting through an abstraction of policy-guided search, deriving tractable, trace-supported losses. Alongside these search-aware losses, we introduce a search-agnostic uniform-allocation (UA) loss that accounts for the budget without specifying the specific search. Both induce scalar weights on per-tactic cross-entropy gradients. We characterize how off-trace behavior affects the search-aware weights, including conditions for vanishing approximation error at large budgets. On a Lean benchmark, both approaches achieve higher observed proof-success rates than cross-entropy across six search strategies, with strong results from a single shared UA adapter. Budget sweeps show larger gains over cross-entropy at 16 than at 256 expansions, implying CAT scales with test time compute.",
      "title": "Direct Optimization of Generators for Search in Automated Theorem Proving",
      "updated": "2026-09-22",
      "url": "https://arxiv.org/abs/2609.25575"
    },
    {
      "age_days": 6,
      "arxiv_id": "2609.25498",
      "authors": [
        "Volkan Dağlı",
        "Zerrin Dağlı",
        "Dağhan Dağlı"
      ],
      "content_date": "2026-09-21",
      "freshness": "fresh",
      "id": "arxiv:2609.25498",
      "kind": "paper",
      "label": "adjacent",
      "matched_signals": [
        "lean_formal_proving_agents"
      ],
      "published": "2026-09-21",
      "score": 3.5,
      "source": "arxiv-ai4math-core",
      "summary": "Deploying Large Language Models for runtime operational triage incurs prohibitive latency (>100-500 ms), high VRAM requirements (>4-8 GB), and excessive energy dissipation. Extending Mandelbrot Fractal Neural Synthesis (Dagli et al., 2026), this paper presents the Universal Fractal Natural Language Decision Map, realized via the werr machine-native edge reflex runtime and the production answerr platform (https://answerr.me). Operating entirely without stored weight tensors (0 Bytes VRAM), the engine synthesizes deterministic decisions---noul (Boolean), choice (categorical), and score (ordinal)---by dynamically modulating 24-byte coordinate seeds along the chaotic boundary of the Mandelbrot set and evaluating multi-scale escape dynamics. Drawing inspiration from biological System-One reflex arcs, the engine introduces: (i) an Auto-Seed Router with domain projector Phi_D yielding a +28.8% accuracy gain over linear baselines; (ii) an Information-Theoretic Semantic Token Damping Filter (T_desc = 0.045) insulating against prompt injections (0.0% empirical bypass; 95% Wilson CI: [0.0%, 27.8%]) while pruning iterations by 45.8% (accelerating throughput 2.5x to 3.31 ms latency); (iii) a Multi-Scale Harmonic Tripod Fusion; (iv) a Coupled Margin Expansion Operator (Pitchfork Bifurcation Offset); and (v) a Cyclic Z/9Z Modular Resonant Grid Discretization based on the closed sub-ideal {0,3,6} (Lean 4 Mathlib ZMod 9), reducing FLOPs by 68.4%. Evaluated on JevBench (N=231), werr achieves 100.00% TypeSafe compliance and 81.65% calibrated accuracy with 7.08 ms median latency. We provide an OpenAI-compatible API and demonstrate deployment on 32-byte EVM smart contracts via the open-source werracle on-chain oracle (21,438 gas).",
      "title": "Universal Fractal Natural Language Decision Map: Real-Time Edge Triage Across Heterogeneous Domains",
      "updated": "2026-09-24",
      "url": "https://arxiv.org/abs/2609.25498"
    },
    {
      "age_days": 6,
      "arxiv_id": "2609.25421",
      "authors": [
        "Yifeng He",
        "Jiachen Liu"
      ],
      "content_date": "2026-09-21",
      "freshness": "fresh",
      "id": "arxiv:2609.25421",
      "kind": "paper",
      "label": "adjacent",
      "matched_signals": [
        "lean_formal_proving_agents"
      ],
      "published": "2026-09-21",
      "score": 3.5,
      "source": "arxiv-ai4math-core",
      "summary": "As autonomous AI agents take on every stage of scientific inquiry, research output is expanding far beyond human review capacity. Yet scientific communication still relies on natural-language prose: an informal medium prone to ambiguity, hidden assumptions, and untracked limitations that machines cannot reliably audit. We introduce Lara, a machine-checkable language and protocol for checking and revising support for research claims. By turning research arguments into executable artifacts, Lara provides an epistemic kernel for autonomous science: it enables automated validation pipelines for research agents, lets declared bridges connect arguments across papers into an auditable network, and allows both humans and machines to recheck the standing of an encoded claim in milliseconds. In a Lara program, authors explicitly declare their claims, supporting evidence and assumptions, and known objections or limitations. A lightweight, deterministic checker adjudicates these interactions, assigning each claim a reproducible status: \"justified\", \"defeated\", \"contested\", or \"gap\", which marks a claim whose support is incomplete and locates the unanswered question. Case studies cover empirical review, a philosophical debate without measurements, and the loss of support when an assumed axiom is withdrawn. We establish the metatheory of claim checking and cross-context argument transport, and mechanize the semantic guarantees in Lean 4 (roughly 117,000 lines), leaving three arguments on paper. The audited public metatheory is \"sorry\"-free and uses only Lean's three standard axioms; some executable examples additionally trust native evaluation.",
      "title": "Beyond Natural Language: An Agent-Native Language for Autonomous Science",
      "updated": "2026-09-21",
      "url": "https://arxiv.org/abs/2609.25421"
    },
    {
      "age_days": 4,
      "arxiv_id": "2609.28465",
      "authors": [
        "Bin Dong",
        "Guoxiong Gao",
        "Bin Guo",
        "Zeming Sun",
        "Bin Wu",
        "Song-Yan Xie"
      ],
      "content_date": "2026-09-23",
      "freshness": "fresh",
      "id": "arxiv:2609.28465",
      "kind": "paper",
      "label": "adjacent",
      "matched_signals": [
        "seed_author:Bin Dong",
        "seed_author:Guoxiong Gao"
      ],
      "published": "2026-09-23",
      "score": 2.9,
      "source": "arxiv-ai4math-core",
      "summary": "We give an algebraic proof in characteristic zero of the Miyaoka--Mori criterion: every point of a curve of negative canonical degree on a smooth projective variety lies on a rational curve. Our jet technique gives, in addition, an effective numerical decomposition of the original curve class. For each prescribed point, the decomposition contains a rational curve through that point, with a positive coefficient independent of the point and with anticanonical degree at most $\\dim X+1$. Together with BDPP cone duality, this recovers the projective uniruledness criterion over $\\mathbb C$. The main result of this paper was obtained using the Pharos system. A detailed report on the use of Pharos and on the Lean~4 formalization of the main arguments is given in the Appendix B, written by Bin Dong, Guoxiong Gao, Zeming Sun, and Bin Wu.",
      "title": "Constructing Rational Curves via Jets on Projective Varieties with Non-Nef Canonical Bundle",
      "updated": "2026-09-23",
      "url": "https://arxiv.org/abs/2609.28465"
    },
    {
      "age_days": 2,
      "authors": [
        "Jiedong Jiang"
      ],
      "content_date": "2026-09-25",
      "freshness": "fresh",
      "id": "github:leanprover-community/mathlib4:e8a0dfd3631d",
      "kind": "github_update",
      "label": "adjacent",
      "matched_signals": [
        "seed_author:Jiedong Jiang"
      ],
      "published": "2026-09-25",
      "repo": "leanprover-community/mathlib4",
      "score": 2.0,
      "source": "mathlib4-github",
      "summary": "Recent commit on leanprover-community/mathlib4.",
      "title": "leanprover-community/mathlib4: feat(Valued/ValuationTopology): creating instances of `IsValuativeTopology` on completion (#36769)",
      "updated": "2026-09-25",
      "url": "https://github.com/leanprover-community/mathlib4/commit/e8a0dfd3631d6c84480d13514e68a7272e710ad2"
    },
    {
      "age_days": 2,
      "authors": [
        "Jiedong Jiang"
      ],
      "content_date": "2026-09-25",
      "freshness": "fresh",
      "id": "github:leanprover-community/mathlib4:d11a0f468e80",
      "kind": "github_update",
      "label": "adjacent",
      "matched_signals": [
        "seed_author:Jiedong Jiang"
      ],
      "published": "2026-09-25",
      "repo": "leanprover-community/mathlib4",
      "score": 2.0,
      "source": "mathlib4-github",
      "summary": "Recent commit on leanprover-community/mathlib4.",
      "title": "leanprover-community/mathlib4: chore(NumberTheory/Padic): modify definition of `ℤ_[p]` to remove `set_option`s (#44192)",
      "updated": "2026-09-25",
      "url": "https://github.com/leanprover-community/mathlib4/commit/d11a0f468e80dbefaf47a5d477f273085560665a"
    },
    {
      "age_days": 3,
      "arxiv_id": "2609.30235",
      "authors": [
        "Ziyu Neroli"
      ],
      "content_date": "2026-09-24",
      "freshness": "fresh",
      "id": "arxiv:2609.30235",
      "kind": "paper",
      "label": "adjacent",
      "matched_signals": [
        "general_ai_math_reasoning"
      ],
      "published": "2026-09-24",
      "score": 1.9,
      "source": "arxiv-ai4math-core",
      "summary": "We study the moiré pattern formed by the intersection of a planar Sierpiński gasket and a copy rotated about its centre. At every resonant angle, we prove that the intersection is of finite type and compute its Hausdorff and Minkowski dimensions from an explicit finite matrix; for Lebesgue-almost every angle, we bound its upper Minkowski dimension by $\\overline{\\dim}_{\\mathrm B}(\\mathcal S_θ)\\le 2\\dim_{\\mathrm H}(S)-2$. Finally, we conjecture that both dimensions equal this bound at every non-resonant angle. Sections 2 and 3 are formalised in Lean.",
      "title": "Moiré Pattern of Rotated Sierpiński Gaskets",
      "updated": "2026-09-24",
      "url": "https://arxiv.org/abs/2609.30235"
    },
    {
      "age_days": 4,
      "arxiv_id": "2609.28452",
      "authors": [
        "Abhijeet Mulgund"
      ],
      "content_date": "2026-09-23",
      "freshness": "fresh",
      "id": "arxiv:2609.28452",
      "kind": "paper",
      "label": "adjacent",
      "matched_signals": [
        "general_ai_math_reasoning"
      ],
      "published": "2026-09-23",
      "score": 1.9,
      "source": "arxiv-ai4math-core",
      "summary": "Let $n\\ge2$, and let $X=(X_1,\\ldots,X_n)$ be a centered Gaussian vector with $\\mathrm{Var}(X_i)=1$ for every $i$. Let $Z_1,\\ldots,Z_n$ be independent standard Gaussians, and put $\\overline{Z}=(Z_1+\\cdots+Z_n)/n$. We prove $\\mathbb{P}\\{\\max_i X_i\\le t\\}\\ge\\mathbb{P}\\{\\sqrt{n/(n-1)}\\,\\max_i(Z_i-\\overline{Z})\\le t\\}$ for every $t\\in\\mathbb{R}$, and for each fixed $t>0$ equality holds only when $\\mathrm{Cov}(X_i,X_j)=-1/(n-1)$ for all $i\\ne j$. The right side is the distribution function of the maximum of the regular simplex vector. Equivalently, among all simplices containing a given centered ball, the regular simplex circumscribed about the ball has the least standard Gaussian measure, as conjectured by Balitskiy, Karasev, and Tsigler. In our preceding paper we proved this comparison after both maxima are smoothed by independent Gaussian noise of variance $1/(n-1)$, which suffices for the Weak Simplex Conjecture; here we remove the smoothing, which is what probabilities at a single threshold require. As an application we consider $n$ equally likely signals of equal energy in Gaussian noise, where the transmitter may also send nothing. At every positive false-alarm level, and for every law of a common nonnegative random amplitude not concentrated at zero, the regular simplex uniquely maximizes the average probability of correct identification whenever the signal dimension is at least $n-1$. A Lean formalization is available at https://github.com/abhmul/full-simplex-conjecture-lean.",
      "title": "Stochastic Domination of Gaussian Maxima by the Regular Simplex",
      "updated": "2026-09-23",
      "url": "https://arxiv.org/abs/2609.28452"
    },
    {
      "age_days": 4,
      "arxiv_id": "2609.27384",
      "authors": [
        "Jiarui Qi"
      ],
      "content_date": "2026-09-23",
      "freshness": "fresh",
      "id": "arxiv:2609.27384",
      "kind": "paper",
      "label": "adjacent",
      "matched_signals": [
        "general_ai_math_reasoning"
      ],
      "published": "2026-09-23",
      "score": 1.9,
      "source": "arxiv-ai4math-core",
      "summary": "A latent severity has a bounded lower tail with density of shape alpha and scale L. It is observed only through a fixed Markov kernel K that is biased and non-additive. The relative conditional spread of K diverges at the endpoint. Our sample is i.i.d. from the marginal Q alone, with no anchoring covariate or instrument. We prove a dichotomy. The shape index alpha is identifiable: for every admissible choice of the class constants, any two observationally equivalent members of a lean class share alpha, determined by a near-endpoint expansion of Q. The rate, namely L and the fixed-scale exceedance p_tau, does not survive. There exist admissible shared class constants and two members of a smaller regularity class whose observed laws coincide exactly. Across the pair alpha agrees, whereas L and p_tau move. A degenerate Le Cam two-point bound excludes any uniformly consistent estimator of either, and pointwise consistency fails at one member. Only the rate needs an anchor. We conjecture that a known kernel family with known edge map identifies the rate fiber by fiber if and only if the family satisfies a fixed-scale injectivity clause, and we prove the sufficiency direction. In surrogate safety, uncalibrated conflict data give the shape of near-crash risk, not its absolute rate.",
      "title": "Shape without scale: an identifiability dichotomy for a bounded tail observed through a non-additive measurement kernel",
      "updated": "2026-09-23",
      "url": "https://arxiv.org/abs/2609.27384"
    },
    {
      "age_days": 0,
      "authors": [
        "Leonardo de Moura"
      ],
      "content_date": "2026-09-27",
      "freshness": "fresh",
      "id": "github:leanprover/lean4:a23e3ce89704",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-27",
      "repo": "leanprover/lean4",
      "score": 0.8,
      "source": "lean4-github",
      "summary": "Recent commit on leanprover/lean4.",
      "title": "leanprover/lean4: test: enable the subtraction-with-borrow `grind` example (#15349)",
      "updated": "2026-09-27",
      "url": "https://github.com/leanprover/lean4/commit/a23e3ce897045c8a86914dc0088692314be2df30"
    },
    {
      "age_days": 0,
      "authors": [
        "Henrik Böving"
      ],
      "content_date": "2026-09-27",
      "freshness": "fresh",
      "id": "github:leanprover/lean4:2830e0d9675e",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-27",
      "repo": "leanprover/lean4",
      "score": 0.8,
      "source": "lean4-github",
      "summary": "Recent commit on leanprover/lean4.",
      "title": "leanprover/lean4: perf: make USize folding more aggressive (#15277)",
      "updated": "2026-09-27",
      "url": "https://github.com/leanprover/lean4/commit/2830e0d9675ea420b5ab9cb55a1e0a0eae3e39cc"
    },
    {
      "age_days": 0,
      "authors": [
        "Leonardo de Moura"
      ],
      "content_date": "2026-09-27",
      "freshness": "fresh",
      "id": "github:leanprover/lean4:aee6d42280de",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-27",
      "repo": "leanprover/lean4",
      "score": 0.8,
      "source": "lean4-github",
      "summary": "Recent commit on leanprover/lean4.",
      "title": "leanprover/lean4: fix: normalize `-0 : Int` to `0` (#15363)",
      "updated": "2026-09-27",
      "url": "https://github.com/leanprover/lean4/commit/aee6d42280defdf84888844e1ac16f3fc804ee7c"
    },
    {
      "age_days": 0,
      "authors": [
        "Sebastian Ullrich"
      ],
      "content_date": "2026-09-27",
      "freshness": "fresh",
      "id": "github:leanprover/lean4:48bfd58f952d",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-27",
      "repo": "leanprover/lean4",
      "score": 0.8,
      "source": "lean4-github",
      "summary": "Recent commit on leanprover/lean4.",
      "title": "leanprover/lean4: fix: invalidate type class resolution cache entries when instances or unification hints change (#15354)",
      "updated": "2026-09-27",
      "url": "https://github.com/leanprover/lean4/commit/48bfd58f952d46dbb554be55261e34f67596d48f"
    },
    {
      "age_days": 0,
      "authors": [
        "Sebastian Ullrich"
      ],
      "content_date": "2026-09-27",
      "freshness": "fresh",
      "id": "github:leanprover/lean4:d0c575dc701e",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-27",
      "repo": "leanprover/lean4",
      "score": 0.8,
      "source": "lean4-github",
      "summary": "Recent commit on leanprover/lean4.",
      "title": "leanprover/lean4: fix: drop type class resolution cache entries recorded in rolled-back environment changes (#15355)",
      "updated": "2026-09-27",
      "url": "https://github.com/leanprover/lean4/commit/d0c575dc701ef33a51d337b8166c336ef06656b6"
    },
    {
      "age_days": 0,
      "authors": [
        "Leonardo de Moura"
      ],
      "content_date": "2026-09-27",
      "freshness": "fresh",
      "id": "github:leanprover/lean4:e39e715e5018",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-27",
      "repo": "leanprover/lean4",
      "score": 0.8,
      "source": "lean4-github",
      "summary": "Recent commit on leanprover/lean4.",
      "title": "leanprover/lean4: fix: `Sym.DSimp.zetaDelta` should unfold let-bound variables in head position (#15362)",
      "updated": "2026-09-27",
      "url": "https://github.com/leanprover/lean4/commit/e39e715e5018b4b923ea9bf59271cdb45fc745bd"
    },
    {
      "age_days": 0,
      "authors": [
        "Leonardo de Moura"
      ],
      "content_date": "2026-09-27",
      "freshness": "fresh",
      "id": "github:leanprover/lean4:1e92f02237ce",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-27",
      "repo": "leanprover/lean4",
      "score": 0.8,
      "source": "lean4-github",
      "summary": "Recent commit on leanprover/lean4.",
      "title": "leanprover/lean4: feat: support the unsigned value of `sshiftRight` in `grind`'s bit-vector homomorphism rules (#15365)",
      "updated": "2026-09-27",
      "url": "https://github.com/leanprover/lean4/commit/1e92f02237ce2f4910cfe5ed9c6b6f8dbf15575e"
    },
    {
      "age_days": 0,
      "authors": [
        "Leonardo de Moura"
      ],
      "content_date": "2026-09-27",
      "freshness": "fresh",
      "id": "github:leanprover/lean4:32ac62681efe",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-27",
      "repo": "leanprover/lean4",
      "score": 0.8,
      "source": "lean4-github",
      "summary": "Recent commit on leanprover/lean4.",
      "title": "leanprover/lean4: feat: support `rotateLeft` and `rotateRight` in `grind`'s bit-vector homomorphism rules (#15364)",
      "updated": "2026-09-27",
      "url": "https://github.com/leanprover/lean4/commit/32ac62681efed8ec10fd1eabea3f11c5a94762ee"
    },
    {
      "age_days": 0,
      "authors": [
        "Leonardo de Moura"
      ],
      "content_date": "2026-09-27",
      "freshness": "fresh",
      "id": "github:leanprover/lean4:0518648ae888",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-27",
      "repo": "leanprover/lean4",
      "score": 0.8,
      "source": "lean4-github",
      "summary": "Recent commit on leanprover/lean4.",
      "title": "leanprover/lean4: feat: support `BitVec.pow` in `grind`'s homomorphism rules (#15350)",
      "updated": "2026-09-27",
      "url": "https://github.com/leanprover/lean4/commit/0518648ae8883a689da564b7bb0c9db7e4e706c7"
    },
    {
      "age_days": 0,
      "authors": [
        "Leonardo de Moura"
      ],
      "content_date": "2026-09-27",
      "freshness": "fresh",
      "id": "github:leanprover/lean4:1f38be1b144b",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-27",
      "repo": "leanprover/lean4",
      "score": 0.8,
      "source": "lean4-github",
      "summary": "Recent commit on leanprover/lean4.",
      "title": "leanprover/lean4: feat: support `++` in `grind`'s bit-vector homomorphism rules (#15348)",
      "updated": "2026-09-27",
      "url": "https://github.com/leanprover/lean4/commit/1f38be1b144b8f6e2a450d526c9c5617d81d425a"
    },
    {
      "age_days": 0,
      "authors": [
        "Sebastian Ullrich"
      ],
      "content_date": "2026-09-27",
      "freshness": "fresh",
      "id": "github:leanprover/lean4:b12696a4958f",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-27",
      "repo": "leanprover/lean4",
      "score": 0.8,
      "source": "lean4-github",
      "summary": "Recent commit on leanprover/lean4.",
      "title": "leanprover/lean4: feat: generation-tracked scoped environment extensions (#15353)",
      "updated": "2026-09-27",
      "url": "https://github.com/leanprover/lean4/commit/b12696a4958f94c05429e36b3d8e4f53de350d42"
    },
    {
      "age_days": 0,
      "authors": [
        "Sebastian Ullrich"
      ],
      "content_date": "2026-09-27",
      "freshness": "fresh",
      "id": "github:leanprover/lean4:7cf0f85ef700",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-27",
      "repo": "leanprover/lean4",
      "score": 0.8,
      "source": "lean4-github",
      "summary": "Recent commit on leanprover/lean4.",
      "title": "leanprover/lean4: feat: generation-tracked environment extensions (#15352)",
      "updated": "2026-09-27",
      "url": "https://github.com/leanprover/lean4/commit/7cf0f85ef7002e62d3f5e652ab8fc9219e81575a"
    },
    {
      "age_days": 0,
      "authors": [
        "Leonardo de Moura"
      ],
      "content_date": "2026-09-27",
      "freshness": "fresh",
      "id": "github:leanprover/lean4:6350ba58abe7",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-27",
      "repo": "leanprover/lean4",
      "score": 0.8,
      "source": "lean4-github",
      "summary": "Recent commit on leanprover/lean4.",
      "title": "leanprover/lean4: feat: dynamic variable reordering in `cutsat` (#15347)",
      "updated": "2026-09-27",
      "url": "https://github.com/leanprover/lean4/commit/6350ba58abe7244b6eda938dc7cc63de10aaeb59"
    },
    {
      "age_days": 0,
      "authors": [
        "Lean stage0 autoupdater"
      ],
      "content_date": "2026-09-27",
      "freshness": "fresh",
      "id": "github:leanprover/lean4:e21c2cfba3ba",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-27",
      "repo": "leanprover/lean4",
      "score": 0.8,
      "source": "lean4-github",
      "summary": "Recent commit on leanprover/lean4.",
      "title": "leanprover/lean4: chore: update stage0",
      "updated": "2026-09-27",
      "url": "https://github.com/leanprover/lean4/commit/e21c2cfba3ba9be1e81cf970d10c613dda436e51"
    },
    {
      "age_days": 0,
      "authors": [
        "Snir Broshi"
      ],
      "content_date": "2026-09-27",
      "freshness": "fresh",
      "id": "github:leanprover-community/mathlib4:c3f56bbeb998",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-27",
      "repo": "leanprover-community/mathlib4",
      "score": 0.8,
      "source": "mathlib4-github",
      "summary": "Recent commit on leanprover-community/mathlib4.",
      "title": "leanprover-community/mathlib4: doc(undergrad-yaml): `Holder` -> `Hölder` (#44233)",
      "updated": "2026-09-27",
      "url": "https://github.com/leanprover-community/mathlib4/commit/c3f56bbeb99803b7af1ede060190ba65c7cc5e8f"
    },
    {
      "age_days": 0,
      "authors": [
        "mathlib-nolints[bot]"
      ],
      "content_date": "2026-09-27",
      "freshness": "fresh",
      "id": "github:leanprover-community/mathlib4:3cb72cfd416d",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-27",
      "repo": "leanprover-community/mathlib4",
      "score": 0.8,
      "source": "mathlib4-github",
      "summary": "Recent commit on leanprover-community/mathlib4.",
      "title": "leanprover-community/mathlib4: chore(scripts): update nolints.json (#44238)",
      "updated": "2026-09-27",
      "url": "https://github.com/leanprover-community/mathlib4/commit/3cb72cfd416d1b5ec4b930d67648ef036a5df24f"
    },
    {
      "age_days": 0,
      "authors": [
        "TJHeeringa"
      ],
      "content_date": "2026-09-27",
      "freshness": "fresh",
      "id": "github:leanprover-community/mathlib4:b63f6e8a68d2",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-27",
      "repo": "leanprover-community/mathlib4",
      "score": 0.8,
      "source": "mathlib4-github",
      "summary": "Recent commit on leanprover-community/mathlib4.",
      "title": "leanprover-community/mathlib4: chore(Analysis/Calculus): rename ApproximatesLinearOn.(anti)lipschitz (#44231)",
      "updated": "2026-09-27",
      "url": "https://github.com/leanprover-community/mathlib4/commit/b63f6e8a68d220e3b3bc4f3792bb53650d375f24"
    },
    {
      "age_days": 1,
      "authors": [
        "Leonardo de Moura"
      ],
      "content_date": "2026-09-26",
      "freshness": "fresh",
      "id": "github:leanprover/lean4:6562e9dfa09e",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-26",
      "repo": "leanprover/lean4",
      "score": 0.8,
      "source": "lean4-github",
      "summary": "Recent commit on leanprover/lean4.",
      "title": "leanprover/lean4: test: add `[grind hom]` tests ported from the intblasting test suite (#15338)",
      "updated": "2026-09-26",
      "url": "https://github.com/leanprover/lean4/commit/6562e9dfa09e4e9b1839dbabbdca26dcea1b91f9"
    },
    {
      "age_days": 1,
      "authors": [
        "Leonardo de Moura"
      ],
      "content_date": "2026-09-26",
      "freshness": "fresh",
      "id": "github:leanprover/lean4:946e8911157c",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-26",
      "repo": "leanprover/lean4",
      "score": 0.8,
      "source": "lean4-github",
      "summary": "Recent commit on leanprover/lean4.",
      "title": "leanprover/lean4: feat: support `&&&` with a constant mask in `grind` (#15345)",
      "updated": "2026-09-26",
      "url": "https://github.com/leanprover/lean4/commit/946e8911157c19545c2fa44b53a0d5ef2ee2c4a6"
    },
    {
      "age_days": 1,
      "authors": [
        "Andres Erbsen"
      ],
      "content_date": "2026-09-26",
      "freshness": "fresh",
      "id": "github:leanprover/lean4:51a24c3ee484",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-26",
      "repo": "leanprover/lean4",
      "score": 0.8,
      "source": "lean4-github",
      "summary": "Recent commit on leanprover/lean4.",
      "title": "leanprover/lean4: feat: register `BitVec.toNat_ofInt` as a `[grind hom]` rule (#15259)",
      "updated": "2026-09-26",
      "url": "https://github.com/leanprover/lean4/commit/51a24c3ee4841ae347872f96aeff78bee08c6236"
    },
    {
      "age_days": 1,
      "authors": [
        "Andres Erbsen"
      ],
      "content_date": "2026-09-26",
      "freshness": "fresh",
      "id": "github:leanprover/lean4:a0e569690a5e",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-26",
      "repo": "leanprover/lean4",
      "score": 0.8,
      "source": "lean4-github",
      "summary": "Recent commit on leanprover/lean4.",
      "title": "leanprover/lean4: feat: register `BitVec.toInt_signExtend` as a `[grind hom]` rule (#15262)",
      "updated": "2026-09-26",
      "url": "https://github.com/leanprover/lean4/commit/a0e569690a5e2daedb0615241f631b742bc56ab7"
    },
    {
      "age_days": 1,
      "authors": [
        "Leonardo de Moura"
      ],
      "content_date": "2026-09-26",
      "freshness": "fresh",
      "id": "github:leanprover/lean4:51e162cdd6fa",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-26",
      "repo": "leanprover/lean4",
      "score": 0.8,
      "source": "lean4-github",
      "summary": "Recent commit on leanprover/lean4.",
      "title": "leanprover/lean4: feat: rational coefficients in the `Sym.Arith` normalizer (#15343)",
      "updated": "2026-09-26",
      "url": "https://github.com/leanprover/lean4/commit/51e162cdd6fa22825089f2b518101f702a9f66eb"
    },
    {
      "age_days": 1,
      "authors": [
        "Leonardo de Moura"
      ],
      "content_date": "2026-09-26",
      "freshness": "fresh",
      "id": "github:leanprover/lean4:443f650dcd07",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-26",
      "repo": "leanprover/lean4",
      "score": 0.8,
      "source": "lean4-github",
      "summary": "Recent commit on leanprover/lean4.",
      "title": "leanprover/lean4: feat: cancel `x * x⁻¹` in the `Sym.Arith` normalizer (#15344)",
      "updated": "2026-09-26",
      "url": "https://github.com/leanprover/lean4/commit/443f650dcd079a68a33d223bea5aaec86f395b18"
    },
    {
      "age_days": 1,
      "authors": [
        "María Inés de Frutos-Fernández"
      ],
      "content_date": "2026-09-26",
      "freshness": "fresh",
      "id": "github:leanprover-community/mathlib4:664781fc63e3",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-26",
      "repo": "leanprover-community/mathlib4",
      "score": 0.8,
      "source": "mathlib4-github",
      "summary": "Recent commit on leanprover-community/mathlib4.",
      "title": "leanprover-community/mathlib4: feat(Topology/Algebra/Valued/NormedValued): add Valuation.absoluteValue (#43659)",
      "updated": "2026-09-26",
      "url": "https://github.com/leanprover-community/mathlib4/commit/664781fc63e386242aa8a2faada4be9d5bffed75"
    },
    {
      "age_days": 1,
      "authors": [
        "Xavier Roblot"
      ],
      "content_date": "2026-09-26",
      "freshness": "fresh",
      "id": "github:leanprover-community/mathlib4:8accc04827c3",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-26",
      "repo": "leanprover-community/mathlib4",
      "score": 0.8,
      "source": "mathlib4-github",
      "summary": "Recent commit on leanprover-community/mathlib4.",
      "title": "leanprover-community/mathlib4: feat(RingTheory/Ideal): the `⊥` and `⊤` cases of the pointwise action on ideals (#44070)",
      "updated": "2026-09-26",
      "url": "https://github.com/leanprover-community/mathlib4/commit/8accc04827c389e678c3ef83e623b402e7480394"
    },
    {
      "age_days": 1,
      "authors": [
        "Xavier Roblot"
      ],
      "content_date": "2026-09-26",
      "freshness": "fresh",
      "id": "github:leanprover-community/mathlib4:8de4fb727265",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-26",
      "repo": "leanprover-community/mathlib4",
      "score": 0.8,
      "source": "mathlib4-github",
      "summary": "Recent commit on leanprover-community/mathlib4.",
      "title": "leanprover-community/mathlib4: feat(RingTheory): multiplicity of ideals in the top ideal (#44134)",
      "updated": "2026-09-26",
      "url": "https://github.com/leanprover-community/mathlib4/commit/8de4fb727265e0653bf04ad2c363ffb1ba07f6aa"
    },
    {
      "age_days": 1,
      "authors": [
        "María Inés de Frutos-Fernández"
      ],
      "content_date": "2026-09-26",
      "freshness": "fresh",
      "id": "github:leanprover-community/mathlib4:bd832fb878a2",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-26",
      "repo": "leanprover-community/mathlib4",
      "score": 0.8,
      "source": "mathlib4-github",
      "summary": "Recent commit on leanprover-community/mathlib4.",
      "title": "leanprover-community/mathlib4: feat(LinearAlgebra/Isomorphisms): add LinearMap.liftOfSurjective (#40417)",
      "updated": "2026-09-26",
      "url": "https://github.com/leanprover-community/mathlib4/commit/bd832fb878a2f36aaa3414f5a5bbb46d1d7cda45"
    },
    {
      "age_days": 1,
      "authors": [
        "Yaël Dillies"
      ],
      "content_date": "2026-09-26",
      "freshness": "fresh",
      "id": "github:leanprover-community/mathlib4:a98628e16c11",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-26",
      "repo": "leanprover-community/mathlib4",
      "score": 0.8,
      "source": "mathlib4-github",
      "summary": "Recent commit on leanprover-community/mathlib4.",
      "title": "leanprover-community/mathlib4: chore: use `congr()` much more widely (#43408)",
      "updated": "2026-09-26",
      "url": "https://github.com/leanprover-community/mathlib4/commit/a98628e16c11f5167f16124105ddce53efa9bfe5"
    },
    {
      "age_days": 1,
      "authors": [
        "mathlib-update-dependencies[bot]"
      ],
      "content_date": "2026-09-26",
      "freshness": "fresh",
      "id": "github:leanprover-community/mathlib4:99f56c0c71dc",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-26",
      "repo": "leanprover-community/mathlib4",
      "score": 0.8,
      "source": "mathlib4-github",
      "summary": "Recent commit on leanprover-community/mathlib4.",
      "title": "leanprover-community/mathlib4: chore: update Mathlib dependencies 2026-09-25 (#44210)",
      "updated": "2026-09-26",
      "url": "https://github.com/leanprover-community/mathlib4/commit/99f56c0c71dc987159c015bd29e766e547e0c761"
    },
    {
      "age_days": 1,
      "authors": [
        "David Kurniadi Angdinata"
      ],
      "content_date": "2026-09-26",
      "freshness": "fresh",
      "id": "github:leanprover-community/mathlib4:516d31250e96",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-26",
      "repo": "leanprover-community/mathlib4",
      "score": 0.8,
      "source": "mathlib4-github",
      "summary": "Recent commit on leanprover-community/mathlib4.",
      "title": "leanprover-community/mathlib4: chore: fix misspellings in declaration names (#44049)",
      "updated": "2026-09-26",
      "url": "https://github.com/leanprover-community/mathlib4/commit/516d31250e96c4e8e76888c3d8e2e43a9642b9ee"
    },
    {
      "age_days": 1,
      "authors": [
        "Edison Xie"
      ],
      "content_date": "2026-09-26",
      "freshness": "fresh",
      "id": "github:leanprover-community/mathlib4:159df8fb1777",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-26",
      "repo": "leanprover-community/mathlib4",
      "score": 0.8,
      "source": "mathlib4-github",
      "summary": "Recent commit on leanprover-community/mathlib4.",
      "title": "leanprover-community/mathlib4: chore(RepresentationTheory/Rep/Basic): increase the priority of instance projection of Rep (#44219)",
      "updated": "2026-09-26",
      "url": "https://github.com/leanprover-community/mathlib4/commit/159df8fb17773d80f548b65a74fecbe90283eb19"
    },
    {
      "age_days": 1,
      "authors": [
        "Aaron Liu"
      ],
      "content_date": "2026-09-26",
      "freshness": "fresh",
      "id": "github:leanprover-community/mathlib4:30852d3b6dd1",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-26",
      "repo": "leanprover-community/mathlib4",
      "score": 0.8,
      "source": "mathlib4-github",
      "summary": "Recent commit on leanprover-community/mathlib4.",
      "title": "leanprover-community/mathlib4: chore(FieldTheory/Galois/Basic): API for `fixingSubgroupEquiv` and `subgroupEquivAlgEquiv` (#42141)",
      "updated": "2026-09-26",
      "url": "https://github.com/leanprover-community/mathlib4/commit/30852d3b6dd1c6daaa3d3c90ccb7e12ae6dbf59d"
    },
    {
      "age_days": 2,
      "authors": [
        "Sebastian Ullrich"
      ],
      "content_date": "2026-09-25",
      "freshness": "fresh",
      "id": "github:leanprover/lean4:78cb841b42a3",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-25",
      "repo": "leanprover/lean4",
      "score": 0.8,
      "source": "lean4-github",
      "summary": "Recent commit on leanprover/lean4.",
      "title": "leanprover/lean4: test: avoid order-dependent `grind` call in `cbv_system_f` (#15314)",
      "updated": "2026-09-25",
      "url": "https://github.com/leanprover/lean4/commit/78cb841b42a30c81303a4e01056b1f39bfaacb71"
    },
    {
      "age_days": 2,
      "authors": [
        "Joachim Breitner"
      ],
      "content_date": "2026-09-25",
      "freshness": "fresh",
      "id": "github:leanprover/lean4:13b1c7a72497",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-25",
      "repo": "leanprover/lean4",
      "score": 0.8,
      "source": "lean4-github",
      "summary": "Recent commit on leanprover/lean4.",
      "title": "leanprover/lean4: perf: derive `partial_fixpoint` unfold theorems from a shared fixpoint equation (#15313)",
      "updated": "2026-09-25",
      "url": "https://github.com/leanprover/lean4/commit/13b1c7a72497c708cbda82e21bb2cc3b46dc2a16"
    },
    {
      "age_days": 2,
      "authors": [
        "Sebastian Ullrich"
      ],
      "content_date": "2026-09-25",
      "freshness": "fresh",
      "id": "github:leanprover/lean4:3018bdcbc62d",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-25",
      "repo": "leanprover/lean4",
      "score": 0.8,
      "source": "lean4-github",
      "summary": "Recent commit on leanprover/lean4.",
      "title": "leanprover/lean4: fix: show goal state after empty `grind =>`, `sym =>` and `impossible by` (#15331)",
      "updated": "2026-09-25",
      "url": "https://github.com/leanprover/lean4/commit/3018bdcbc62d40b413697dc6e4de8ff17d8b2b2c"
    },
    {
      "age_days": 2,
      "authors": [
        "Sebastian Ullrich"
      ],
      "content_date": "2026-09-25",
      "freshness": "fresh",
      "id": "github:leanprover/lean4:67bea2ff26d3",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-25",
      "repo": "leanprover/lean4",
      "score": 0.8,
      "source": "lean4-github",
      "summary": "Recent commit on leanprover/lean4.",
      "title": "leanprover/lean4: fix: cache type class resolution results based on options values they used (#15325)",
      "updated": "2026-09-25",
      "url": "https://github.com/leanprover/lean4/commit/67bea2ff26d36852aecc4944ae2290f47a0d773a"
    },
    {
      "age_days": 2,
      "authors": [
        "Emilio Jesús Gallego Arias"
      ],
      "content_date": "2026-09-25",
      "freshness": "fresh",
      "id": "github:leanprover/lean4:feec14b616e5",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-25",
      "repo": "leanprover/lean4",
      "score": 0.8,
      "source": "lean4-github",
      "summary": "Recent commit on leanprover/lean4.",
      "title": "leanprover/lean4: fix: allow nested Verso metadata blocks (#15324)",
      "updated": "2026-09-25",
      "url": "https://github.com/leanprover/lean4/commit/feec14b616e56ba9bfef4bd12223cae321f47e57"
    },
    {
      "age_days": 2,
      "authors": [
        "Sebastian Ullrich"
      ],
      "content_date": "2026-09-25",
      "freshness": "fresh",
      "id": "github:leanprover/lean4:904eaf47172c",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-25",
      "repo": "leanprover/lean4",
      "score": 0.8,
      "source": "lean4-github",
      "summary": "Recent commit on leanprover/lean4.",
      "title": "leanprover/lean4: feat: record option dependencies during typeclass synthesis (#15278)",
      "updated": "2026-09-25",
      "url": "https://github.com/leanprover/lean4/commit/904eaf47172cef9a77ab9c18878c2ff63f9672ae"
    },
    {
      "age_days": 2,
      "authors": [
        "Jason"
      ],
      "content_date": "2026-09-25",
      "freshness": "fresh",
      "id": "github:leanprover/lean4:0530ceceb9b2",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-25",
      "repo": "leanprover/lean4",
      "score": 0.8,
      "source": "lean4-github",
      "summary": "Recent commit on leanprover/lean4.",
      "title": "leanprover/lean4: feat: add wf_preprocess theorems for List.any (#11386)",
      "updated": "2026-09-25",
      "url": "https://github.com/leanprover/lean4/commit/0530ceceb9b2d719ccd1497a8088557ff477d5b2"
    },
    {
      "age_days": 2,
      "authors": [
        "Sebastian Ullrich"
      ],
      "content_date": "2026-09-25",
      "freshness": "fresh",
      "id": "github:leanprover/lean4:fcecee37514b",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-25",
      "repo": "leanprover/lean4",
      "score": 0.8,
      "source": "lean4-github",
      "summary": "Recent commit on leanprover/lean4.",
      "title": "leanprover/lean4: chore: add `debug.synthInstance.checkCacheHits` (#15333)",
      "updated": "2026-09-25",
      "url": "https://github.com/leanprover/lean4/commit/fcecee37514b02c8dbddc2b8d90e5ae186946476"
    },
    {
      "age_days": 2,
      "authors": [
        "Jon Eugster"
      ],
      "content_date": "2026-09-25",
      "freshness": "fresh",
      "id": "github:leanprover-community/mathlib4:9d3d856d01a0",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-25",
      "repo": "leanprover-community/mathlib4",
      "score": 0.8,
      "source": "mathlib4-github",
      "summary": "Recent commit on leanprover-community/mathlib4.",
      "title": "leanprover-community/mathlib4: fix(scripts/autolabel): do not fail CI-step (#43998)",
      "updated": "2026-09-25",
      "url": "https://github.com/leanprover-community/mathlib4/commit/9d3d856d01a0dfb911a729cff5ebc211bffe006f"
    },
    {
      "age_days": 2,
      "authors": [
        "Marcelo Lynch"
      ],
      "content_date": "2026-09-25",
      "freshness": "fresh",
      "id": "github:leanprover-community/mathlib4:f35c415953ee",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-25",
      "repo": "leanprover-community/mathlib4",
      "score": 0.8,
      "source": "mathlib4-github",
      "summary": "Recent commit on leanprover-community/mathlib4.",
      "title": "leanprover-community/mathlib4: feat(cache): retire the legacy container (#44174)",
      "updated": "2026-09-25",
      "url": "https://github.com/leanprover-community/mathlib4/commit/f35c415953ee34a1ad5b022fe2ed97c3c77c4093"
    },
    {
      "age_days": 2,
      "authors": [
        "Jack McKoen"
      ],
      "content_date": "2026-09-25",
      "freshness": "fresh",
      "id": "github:leanprover-community/mathlib4:c35749ff50d4",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-25",
      "repo": "leanprover-community/mathlib4",
      "score": 0.8,
      "source": "mathlib4-github",
      "summary": "Recent commit on leanprover-community/mathlib4.",
      "title": "leanprover-community/mathlib4: feat(CategoryTheory/Subobject): extend image subobject API (#42759)",
      "updated": "2026-09-25",
      "url": "https://github.com/leanprover-community/mathlib4/commit/c35749ff50d442321703e9b8423951ba719ca6ac"
    },
    {
      "age_days": 2,
      "authors": [
        "Raphael Douglas Giles"
      ],
      "content_date": "2026-09-25",
      "freshness": "fresh",
      "id": "github:leanprover-community/mathlib4:459d0ae92af3",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-25",
      "repo": "leanprover-community/mathlib4",
      "score": 0.8,
      "source": "mathlib4-github",
      "summary": "Recent commit on leanprover-community/mathlib4.",
      "title": "leanprover-community/mathlib4: feat(AlgebraicGeometry): degree of a zero-cycle (#41198)",
      "updated": "2026-09-25",
      "url": "https://github.com/leanprover-community/mathlib4/commit/459d0ae92af32252408b589b9a147814610e8934"
    },
    {
      "age_days": 2,
      "authors": [
        "Jesse Alama"
      ],
      "content_date": "2026-09-25",
      "freshness": "fresh",
      "id": "github:leanprover-community/mathlib4:c8682614490e",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-25",
      "repo": "leanprover-community/mathlib4",
      "score": 0.8,
      "source": "mathlib4-github",
      "summary": "Recent commit on leanprover-community/mathlib4.",
      "title": "leanprover-community/mathlib4: ci(nightly_detect_failure): throw `Error`, not `Exception` (#44116)",
      "updated": "2026-09-25",
      "url": "https://github.com/leanprover-community/mathlib4/commit/c8682614490eec5d454a5bdc8e35463bd2aec02b"
    },
    {
      "age_days": 2,
      "authors": [
        "mathlib-update-dependencies[bot]"
      ],
      "content_date": "2026-09-25",
      "freshness": "fresh",
      "id": "github:leanprover-community/mathlib4:476540cbf596",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-25",
      "repo": "leanprover-community/mathlib4",
      "score": 0.8,
      "source": "mathlib4-github",
      "summary": "Recent commit on leanprover-community/mathlib4.",
      "title": "leanprover-community/mathlib4: chore: update Mathlib dependencies 2026-09-25 (#44182)",
      "updated": "2026-09-25",
      "url": "https://github.com/leanprover-community/mathlib4/commit/476540cbf596d23cc2ba2ad89539efed7b9b99fc"
    },
    {
      "age_days": 2,
      "authors": [
        "Michael Rothgang"
      ],
      "content_date": "2026-09-25",
      "freshness": "fresh",
      "id": "github:leanprover-community/mathlib4:0770cc908695",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-25",
      "repo": "leanprover-community/mathlib4",
      "score": 0.8,
      "source": "mathlib4-github",
      "summary": "Recent commit on leanprover-community/mathlib4.",
      "title": "leanprover-community/mathlib4: chore: remove lint-style.py and associated linting infrastructure (#43994)",
      "updated": "2026-09-25",
      "url": "https://github.com/leanprover-community/mathlib4/commit/0770cc908695e32053a911d22b560b577bb3d888"
    },
    {
      "age_days": 2,
      "authors": [
        "mathlib-splicebot[bot]"
      ],
      "content_date": "2026-09-25",
      "freshness": "fresh",
      "id": "github:leanprover-community/mathlib4:ecc6857feafa",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-25",
      "repo": "leanprover-community/mathlib4",
      "score": 0.8,
      "source": "mathlib4-github",
      "summary": "Recent commit on leanprover-community/mathlib4.",
      "title": "leanprover-community/mathlib4: chore(Topology/Instances/ENNReal/Lemmas): automated extraction from #43834 (#44181)",
      "updated": "2026-09-25",
      "url": "https://github.com/leanprover-community/mathlib4/commit/ecc6857feafa73f468a82fd479137126ec48fe41"
    },
    {
      "age_days": 2,
      "authors": [
        "D-Thomine"
      ],
      "content_date": "2026-09-25",
      "freshness": "fresh",
      "id": "github:leanprover-community/mathlib4:b2bf051988bf",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-25",
      "repo": "leanprover-community/mathlib4",
      "score": 0.8,
      "source": "mathlib4-github",
      "summary": "Recent commit on leanprover-community/mathlib4.",
      "title": "leanprover-community/mathlib4: chore(MeasureTheory): generalize hypotheses to `NullMeasurableSet` (#42924)",
      "updated": "2026-09-25",
      "url": "https://github.com/leanprover-community/mathlib4/commit/b2bf051988bf69448bce88722cc09a05fea31662"
    },
    {
      "age_days": 2,
      "authors": [
        "Robin Carlier"
      ],
      "content_date": "2026-09-25",
      "freshness": "fresh",
      "id": "github:leanprover-community/mathlib4:2f6ab8594728",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-25",
      "repo": "leanprover-community/mathlib4",
      "score": 0.8,
      "source": "mathlib4-github",
      "summary": "Recent commit on leanprover-community/mathlib4.",
      "title": "leanprover-community/mathlib4: chore(CategoryTheory/Monoidal/Closed/Types): deprecate duplicate instance (#44195)",
      "updated": "2026-09-25",
      "url": "https://github.com/leanprover-community/mathlib4/commit/2f6ab85947289c79c86d3cd741583029b7629144"
    },
    {
      "age_days": 2,
      "authors": [
        "Robin Carlier"
      ],
      "content_date": "2026-09-25",
      "freshness": "fresh",
      "id": "github:leanprover-community/mathlib4:77d8557cb435",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-25",
      "repo": "leanprover-community/mathlib4",
      "score": 0.8,
      "source": "mathlib4-github",
      "summary": "Recent commit on leanprover-community/mathlib4.",
      "title": "leanprover-community/mathlib4: chore(CategoryTheory/Action): make the action category implicit-reducible (#44198)",
      "updated": "2026-09-25",
      "url": "https://github.com/leanprover-community/mathlib4/commit/77d8557cb435e0dd1d9a6de7748c70194cb92c95"
    },
    {
      "age_days": 2,
      "authors": [
        "Joël Riou"
      ],
      "content_date": "2026-09-25",
      "freshness": "fresh",
      "id": "github:leanprover-community/mathlib4:c9fef2b06eb6",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-25",
      "repo": "leanprover-community/mathlib4",
      "score": 0.8,
      "source": "mathlib4-github",
      "summary": "Recent commit on leanprover-community/mathlib4.",
      "title": "leanprover-community/mathlib4: chore(CategoryTheory): make asIso implicit_reducible to fix diamonds (#44191)",
      "updated": "2026-09-25",
      "url": "https://github.com/leanprover-community/mathlib4/commit/c9fef2b06eb649565c37ffb0bc4721ea99a8d30c"
    },
    {
      "age_days": 2,
      "authors": [
        "Robin Carlier"
      ],
      "content_date": "2026-09-25",
      "freshness": "fresh",
      "id": "github:leanprover-community/mathlib4:86569a801347",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-25",
      "repo": "leanprover-community/mathlib4",
      "score": 0.8,
      "source": "mathlib4-github",
      "summary": "Recent commit on leanprover-community/mathlib4.",
      "title": "leanprover-community/mathlib4: chore(CategoryTheory): delete duplicate inhabited instance on `WalkingParallelPair` (#44196)",
      "updated": "2026-09-25",
      "url": "https://github.com/leanprover-community/mathlib4/commit/86569a8013470a5ec8d1bbbf3c958c3a2e7c355d"
    },
    {
      "age_days": 2,
      "authors": [
        "mathlib-splicebot[bot]"
      ],
      "content_date": "2026-09-25",
      "freshness": "fresh",
      "id": "github:leanprover-community/mathlib4:045dc8d783b3",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-25",
      "repo": "leanprover-community/mathlib4",
      "score": 0.8,
      "source": "mathlib4-github",
      "summary": "Recent commit on leanprover-community/mathlib4.",
      "title": "leanprover-community/mathlib4: chore(Analysis/Normed/MulAction): automated extraction from #43834 (#44180)",
      "updated": "2026-09-25",
      "url": "https://github.com/leanprover-community/mathlib4/commit/045dc8d783b3a64d537e892faf393cbf3f14aa7e"
    },
    {
      "age_days": 2,
      "authors": [
        "TJHeeringa"
      ],
      "content_date": "2026-09-25",
      "freshness": "fresh",
      "id": "github:leanprover-community/mathlib4:789aa6709897",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-25",
      "repo": "leanprover-community/mathlib4",
      "score": 0.8,
      "source": "mathlib4-github",
      "summary": "Recent commit on leanprover-community/mathlib4.",
      "title": "leanprover-community/mathlib4: chore(Algebra/Module/Equiv): split Equiv into Basic, Pi, Prod and Submodule (#42818)",
      "updated": "2026-09-25",
      "url": "https://github.com/leanprover-community/mathlib4/commit/789aa6709897004604b3cf9ae8395a1c81c22bd8"
    },
    {
      "age_days": 2,
      "authors": [
        "TJHeeringa"
      ],
      "content_date": "2026-09-25",
      "freshness": "fresh",
      "id": "github:leanprover-community/mathlib4:d870b9068518",
      "kind": "github_update",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-25",
      "repo": "leanprover-community/mathlib4",
      "score": 0.8,
      "source": "mathlib4-github",
      "summary": "Recent commit on leanprover-community/mathlib4.",
      "title": "leanprover-community/mathlib4: chore(Algebra/Module/Equiv): add deprecated module for `/Equiv.lean` (#42822)",
      "updated": "2026-09-25",
      "url": "https://github.com/leanprover-community/mathlib4/commit/d870b9068518a0870842d15a0cd42637ec30b587"
    },
    {
      "age_days": 3,
      "arxiv_id": "2609.29201",
      "authors": [
        "Filippo Fruzza",
        "Sofiane Al Kassar",
        "Rachele Lamioni",
        "Chiara Galletti",
        "Antonio Attili"
      ],
      "content_date": "2026-09-24",
      "freshness": "fresh",
      "id": "arxiv:2609.29201",
      "kind": "paper",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-24",
      "score": 0.5,
      "source": "arxiv-ai4math-core",
      "summary": "Lean premixed hydrogen flames are highly susceptible to thermodiffusive instabilities, which generate cellular structures and enhance propagation speed. In practical combustors, incomplete premixing can introduce spatial variations in local equivalence ratio upstream of the flame. This work investigates how the characteristic length scale of inlet fuel stratification affects the structure and propagation of lean laminar hydrogen flames using direct numerical simulations with detailed chemistry and transport. Controlled sinusoidal perturbations of the fuel mass fraction are imposed while maintaining a constant density-weighted global equivalence ratio, and a passive tracer tracks the imposed stratification independently of combustion chemistry and differential diffusion. The results reveal a strongly scale-dependent response. When the stratification wavelength becomes comparable to the spacing of large thermodiffusive structures ($λ\\approx 20 δ_f$), transverse composition gradients disrupt thermodiffusive fingers, reducing flame surface area and propagation speed relative to the perfectly premixed reference. For larger wavelengths ($λ\\gtrsim 40 δ_f$), stratification organises the flame into alternating fuel-rich and fuel-lean channels, with thermodiffusive cells developing preferentially in richer regions and cusp-like structures forming in lean zones. This increases flame surface area and global propagation speed. The stretch factor remains nearly constant across all cases, indicating that the dominant mechanism is geometric: the scale-dependent creation or suppression of large flame structures rather than significant changes in local burning behaviour. These findings highlight the key role of stratification length scale in controlling thermodiffusively unstable hydrogen flames, with implications for modelling and design of partially premixed hydrogen combustors.",
      "title": "Effect of fuel stratification length scale on thermodiffusively unstable lean hydrogen flames",
      "updated": "2026-09-24",
      "url": "https://arxiv.org/abs/2609.29201"
    },
    {
      "age_days": 4,
      "arxiv_id": "2609.28591",
      "authors": [
        "Alexander Gamburd"
      ],
      "content_date": "2026-09-23",
      "freshness": "fresh",
      "id": "arxiv:2609.28591",
      "kind": "paper",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-23",
      "score": 0.5,
      "source": "arxiv-ai4math-core",
      "summary": "On 8 September 2026 OpenAI announced a proof of finite-time blowup for the three-dimensional Navier-Stokes equations with smooth data and forcing: 166 pages produced in 88 hours by ten thousand agents, certified by 616,000 lines of Lean, and read in full, at the moment of this writing (20 September 2026), by no human being. This essay asks what such an artifact -- text, certificate and announcement -- is, and what follows from accepting it as a proof. Mathematics was the Enlightenment's existence proof of autonomous reason: for three centuries every certified theorem could be understood by anyone who followed its demonstration, and the distance between the two was zero by construction. A certified proof no one can follow reopens that distance, and a community that accepts it adopts, without a vote, the constitution Hobbes drafted for the Leviathan, in which authority and not truth makes the law. The essay distinguishes the demonstrated from the revealed (certified); names, in Panofsky's terms, the coming age a Middle Ages in reverse and its authority a subhuman superintelligence; and locates the turning point not in what the machine produces but in what we accept. Since acceptance is the one sovereign sanction the companies cannot manufacture, it proposes a covenant in place of either boycott or capitulation: the community's cooperation given to that producer which strictly observes its practices of legibility, disclosure and responsibility, withheld from any that does not, and the covenant kept plural, with the history of the Indigenous nations among rival empires as its guide. The Sirens of the title promise knowledge, not understanding. Daemmerung is the light at both ends of the day, and whether this Aufklaerungsdaemmerung is a dusk or a dawn depends on what is done at the moment of acceptance, which is not yet past.",
      "title": "The Siren Call of Silicon Leviathan: Reflections on blowup and Aufklärungsdämmerung",
      "updated": "2026-09-23",
      "url": "https://arxiv.org/abs/2609.28591"
    },
    {
      "age_days": 4,
      "arxiv_id": "2609.27647",
      "authors": [
        "Scott Armstrong",
        "Tuomo Kuusi",
        "Amélie Loher"
      ],
      "content_date": "2026-09-23",
      "freshness": "fresh",
      "id": "arxiv:2609.27647",
      "kind": "paper",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-23",
      "score": 0.5,
      "source": "arxiv-ai4math-core",
      "summary": "We prove an upper bound on the homogenization length scale which is a fixed power of the coarse ellipticity ratio for coefficient fields that satisfy a finite range of dependence assumption.",
      "title": "Homogenization at a polynomial scale in high contrast",
      "updated": "2026-09-23",
      "url": "https://arxiv.org/abs/2609.27647"
    },
    {
      "age_days": 4,
      "arxiv_id": "2609.27638",
      "authors": [
        "Hiroyuki Nakahata"
      ],
      "content_date": "2026-09-23",
      "freshness": "fresh",
      "id": "arxiv:2609.27638",
      "kind": "paper",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-23",
      "score": 0.5,
      "source": "arxiv-ai4math-core",
      "summary": "AI-generated software changes make it increasingly important to determine what a change preserves, where local consistency fails to extend globally, and which alternatives remain. We develop the foundations of Algebraic Architecture Theory (AAT) from Atoms, typed primitive facts, and Laws, equations that objects must satisfy. A reading specifies what counts as structure and which operations and laws to preserve. The main reconstruction theorem identifies the category of full geometries and all their structure-preserving morphisms with an independently defined category of local models, up to equivalence. Objects are recovered up to isomorphism and morphisms between fixed endpoints uniquely. The theory addresses gluing, diagnosis, transport, classification of changes, and reconstruction. From finite Atom families we construct cores closed under operations and geometries with sites and coefficients. We give conditions under which a Cech obstruction detects the existence of a global state and, through comparison with repair semantics, a global repair. We compare diagnoses and give a finite criterion for uniform invariance given computable finite data. Transport along exact changes has a universal property and commutes with base change on exact pointed pullback squares. Comparisons of routes generated from the same square, finite comparison diagram, and geometry factor into an invertible comparison and an idempotent normalization. We characterize when observations determine comparison preservation and classify compatible lifts. Encodings of lens and protocol semantics preserve and reflect laws and recover semantics-preserving morphisms. Applications classify and count operation-preserving changes and extend morphisms uniquely from finite tables. Corresponding Lean declarations are listed in the appendix.",
      "title": "Foundations of Algebraic Architecture Theory: A Rising Sea of Geometry, Transport, Comparison, and Reconstruction",
      "updated": "2026-09-23",
      "url": "https://arxiv.org/abs/2609.27638"
    },
    {
      "age_days": 5,
      "arxiv_id": "2609.25933",
      "authors": [
        "Yuwei Chuai",
        "Thomas Renault",
        "David Rand",
        "Mohsen Mosleh"
      ],
      "content_date": "2026-09-22",
      "freshness": "fresh",
      "id": "arxiv:2609.25933",
      "kind": "paper",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-22",
      "score": 0.5,
      "source": "arxiv-ai4math-core",
      "summary": "Concerns about inauthentic accounts, including foreign actors posing as domestic voices, are central to debates about online discourse. Yet, little is known about accounts with inaccurate location claims and how they behave when discrepancies between their claimed and actual locations become publicly visible. In November 2025, X introduced an \"About this account\" feature that discloses each account's platform-inferred location of operation. We leverage this intervention in a large-scale quasi-experimental study of 8,200 politically engaged accounts claiming a U.S. location, comparing accounts whose disclosed locations matched versus contradicted their claims across 1.3 million posts and 3.6 million replies over 21 weeks. Before disclosure, location-mismatched accounts posted more misleading, scam-related, and cryptocurrency-related content, but showed no distinctive partisan leaning. Difference-in-differences estimates show that disclosure reduced the posting activity of location-mismatched accounts by 13.1% with the largest declines among accounts revealed to be in Africa (29.2%) and Asia (24.4%), and among accounts with VPN flags, username changes, or scam- and crypto-heavy content. Additionally, the decline in their replies was concentrated in interactions with U.S.-based recipients (10.3%), whereas replies to non-U.S.-based recipients showed no statistically significant change. Conversely, there was no significant change in average audience engagement with their posts. Location transparency thus works primarily by inducing restraint among the disclosed accounts rather than by shifting audience behaviour, and the accounts it constrains look at least as much like cross-border fraud as foreign political influence.",
      "title": "Location transparency reduces activity by accounts misrepresenting their location on X",
      "updated": "2026-09-22",
      "url": "https://arxiv.org/abs/2609.25933"
    },
    {
      "age_days": 5,
      "arxiv_id": "2609.26776",
      "authors": [
        "Jaime Enrique Lincovil Curivil",
        "Alexandre Galvão Patriota"
      ],
      "content_date": "2026-09-22",
      "freshness": "fresh",
      "id": "arxiv:2609.26776",
      "kind": "paper",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-22",
      "score": 0.5,
      "source": "arxiv-ai4math-core",
      "summary": "Birnbaum's theorem states that the sufficiency and conditionality principles jointly imply, and are implied by, the likelihood principle. To enable formal certification of the results in Lean, we make the conditionality relation explicit through a finite-sample formulation based on \\cite{Evans2013}. We reformulate the theorem as a statement about classes of statistical procedures that preserve statistical relations, and show that the proof reduces to the propagation of evidential equality along chains of conditionality-related inference bases (experiment--observation pairs). The main results are illustrated by Venn diagrams, and a worked finite example exhibits two pairs of inference bases: one related by conditionality but not by sufficiency, and the other related by sufficiency but not by conditionality. For finite parameter spaces with at least two points, the class of likelihood-invariant procedures with codomain $[0,1]$ is strictly contained in the class of sufficiency-invariant procedures.",
      "title": "Birnbaum's principles in Venn diagrams: Extended version with Lean verification",
      "updated": "2026-09-22",
      "url": "https://arxiv.org/abs/2609.26776"
    },
    {
      "age_days": 5,
      "arxiv_id": "2609.25541",
      "authors": [
        "Mingyu Jeon",
        "Suwan Cho",
        "Jae Young Suh"
      ],
      "content_date": "2026-09-22",
      "freshness": "fresh",
      "id": "arxiv:2609.25541",
      "kind": "paper",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-22",
      "score": 0.5,
      "source": "arxiv-ai4math-core",
      "summary": "Tabular foundation models learn to predict cell values in context, whereas world-model self-supervision asks for prediction in representation space (LeCun, 2022; Assran et al., 2023). On a tabular foundation-model prior, the latent term of a joint-embedding predictive architecture (JEPA) collapsed in our earlier runs and took the encoder with it to a constant map. We report a recipe under which the latent term survives to convergence beside the value objective: the value head reads the encoder field rather than the predictor, and the target is an exponential moving average (EMA) difference. To bound its cost against the value-only arm, both arms train until a plateau rule stops them, with no fixed step budget. A fixed horizon had confounded a slowdown with a ceiling, since the value-only arm was still improving well past the usual budget. At convergence, in one run per arm, the JEPA arm trails the value-only arm across 147 real datasets, 32:70 wins to losses on classification (29:63 with one entry per dataset name) and 8:24 on regression, the margin small on classification and wider on regression, and the count leans the same way in each stratum and each benchmark. The JEPA arm (jepa) needs 1.42 times as many steps as the value-only arm (ds), and 1.66 times its wall-clock, to reach its plateau.",
      "title": "A JEPA Recipe for Tabular Foundation Models",
      "updated": "2026-09-22",
      "url": "https://arxiv.org/abs/2609.25541"
    },
    {
      "age_days": 6,
      "arxiv_id": "2609.25427",
      "authors": [
        "Ramy Shahin"
      ],
      "content_date": "2026-09-21",
      "freshness": "fresh",
      "id": "arxiv:2609.25427",
      "kind": "paper",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-21",
      "score": 0.5,
      "source": "arxiv-ai4math-core",
      "summary": "Inductive types are ubiquitous building blocks in many programming and theorem proving languages. An inductive type is a closed set of constructors from which values of the type can be created. That set cannot be extended though once a type is defined. This limits extensibility, reuse, and modular separation of concerns when defining types and functions operating over their values. This limitation is manifested in the expression problem, where extending an expression language with new syntactic constructors without having to modify or re-compile existing ones is a challenge in almost all programming languages. This paper presents inductive type and function implementation composition algorithms based on meta-programming. In addition, a set of syntactic extensions to the Lean proof assistant implementing those algorithms are presented. This framework allows for modular reuse, composition, and extension of a subset of Lean type and function definitions. In addition, semantic subtyping relations between component and composite types are discussed both at the type theoretic and implementation levels. The framework is demonstrated on a case study, involving the composition of syntactic and semantic artifacts of three sublanguages into one language. The case study highlights both the features and limitations of the composition framework.",
      "title": "Modular Composition of Inductive Types Using Lean Meta-programming",
      "updated": "2026-09-21",
      "url": "https://arxiv.org/abs/2609.25427"
    },
    {
      "age_days": 6,
      "arxiv_id": "2609.25199",
      "authors": [
        "Vasily Ilin"
      ],
      "content_date": "2026-09-21",
      "freshness": "fresh",
      "id": "arxiv:2609.25199",
      "kind": "paper",
      "label": "negative",
      "matched_signals": [],
      "published": "2026-09-21",
      "score": 0.5,
      "source": "arxiv-ai4math-core",
      "summary": "Lean Pool is a repository of formalized mathematics. It is grown, maintained and optimized by AI agents.",
      "title": "Lean Pool: An AI-Maintained Archive of Formalized Mathematics",
      "updated": "2026-09-21",
      "url": "https://arxiv.org/abs/2609.25199"
    }
  ],
  "lookback_days": 21,
  "schema": "ai4math-radar-run-v1",
  "timezone": "America/Los_Angeles"
}