<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
<channel>
<title>Paperlane: Lean build results</title>
<link>https://pragyaangaur.dev/Paperlane/lean.html</link>
<atom:link href="https://pragyaangaur.dev/Paperlane/lean/feed.xml" rel="self" type="application/rss+xml"/>
<description>Build results for Lean projects linked from new arXiv mathematics papers, newest check first.</description>
<language>en</language>
<lastBuildDate>Sat, 21 Nov 2026 15:23:00 +0000</lastBuildDate>
<item><title>could not be checked: A Theory of Information Architecture for Networked Decisions: Freshness, Locality, and Coordination</title><link>https://pragyaangaur.dev/Paperlane/lean/ANRGUSC/TINA.html</link><guid isPermaLink="false">lean:2609.06351:ANRGUSC/TINA:2026-11-21T15:23:14Z</guid><pubDate>Sat, 21 Nov 2026 15:23:14 +0000</pubDate><description>&lt;p&gt;A Theory of Information Architecture for Networked Decisions: Freshness, Locality, and Coordination (arXiv:2609.06351)&lt;/p&gt;&lt;p&gt;ANRGUSC/TINA: could not be checked&lt;/p&gt;&lt;p&gt;Code licence: BSD 3-Clause &amp;quot;New&amp;quot; or &amp;quot;Revised&amp;quot; License&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2609.06351&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/ANRGUSC/TINA&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/ANRGUSC/TINA.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: Sharp dimension bounds for right-angled hyperbolic polytopes</title><link>https://pragyaangaur.dev/Paperlane/lean/sashakolpakov/CoxeterPolytopes.html</link><guid isPermaLink="false">lean:2610.38900:sashakolpakov/CoxeterPolytopes:2026-11-21T15:23:14Z</guid><pubDate>Sat, 21 Nov 2026 15:23:14 +0000</pubDate><description>&lt;p&gt;Sharp dimension bounds for right-angled hyperbolic polytopes (arXiv:2610.38900)&lt;/p&gt;&lt;p&gt;sashakolpakov/CoxeterPolytopes: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: no licence file, so the code is not licensed for reuse&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2610.38900&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/sashakolpakov/CoxeterPolytopes&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/sashakolpakov/CoxeterPolytopes.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: On the second smallest ideal right-angled hyperbolic four-polytope</title><link>https://pragyaangaur.dev/Paperlane/lean/sashakolpakov/CoxeterPolytopes.html</link><guid isPermaLink="false">lean:2611.00118:sashakolpakov/CoxeterPolytopes:2026-11-21T15:23:14Z</guid><pubDate>Sat, 21 Nov 2026 15:23:14 +0000</pubDate><description>&lt;p&gt;On the second smallest ideal right-angled hyperbolic four-polytope (arXiv:2611.00118)&lt;/p&gt;&lt;p&gt;sashakolpakov/CoxeterPolytopes: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: no licence file, so the code is not licensed for reuse&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.00118&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/sashakolpakov/CoxeterPolytopes&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/sashakolpakov/CoxeterPolytopes.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: The bias interval of the elephant random walk</title><link>https://pragyaangaur.dev/Paperlane/lean/apemm/elephant-bias-interval.html</link><guid isPermaLink="false">lean:2611.14576:apemm/elephant-bias-interval:2026-11-21T15:23:14Z</guid><pubDate>Sat, 21 Nov 2026 15:23:14 +0000</pubDate><description>&lt;p&gt;The bias interval of the elephant random walk (arXiv:2611.14576)&lt;/p&gt;&lt;p&gt;apemm/elephant-bias-interval: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: MIT License&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.14576&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/apemm/elephant-bias-interval&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/apemm/elephant-bias-interval.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: Paper2Lean: Agentic Autoformalization of Mathematical Research Papers at Scale</title><link>https://pragyaangaur.dev/Paperlane/lean/TTony2019/OptPaper.html</link><guid isPermaLink="false">lean:2611.26272:TTony2019/OptPaper:2026-11-20T15:12:41Z</guid><pubDate>Fri, 20 Nov 2026 15:12:41 +0000</pubDate><description>&lt;p&gt;Paper2Lean: Agentic Autoformalization of Mathematical Research Papers at Scale (arXiv:2611.26272)&lt;/p&gt;&lt;p&gt;TTony2019/OptPaper: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: no licence file, so the code is not licensed for reuse&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.26272&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/TTony2019/OptPaper&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/TTony2019/OptPaper.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: Spectral Moments of the Projected Hubbard Configuration Graph: Connectivity, Exchange, and Virtual Doublons</title><link>https://pragyaangaur.dev/Paperlane/lean/zhineos/hubbard-spectral-moments.html</link><guid isPermaLink="false">lean:2611.19929:zhineos/hubbard-spectral-moments:2026-11-20T15:07:09Z</guid><pubDate>Fri, 20 Nov 2026 15:07:09 +0000</pubDate><description>&lt;p&gt;Spectral Moments of the Projected Hubbard Configuration Graph: Connectivity, Exchange, and Virtual Doublons (arXiv:2611.19929)&lt;/p&gt;&lt;p&gt;zhineos/hubbard-spectral-moments: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: Apache License 2.0&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.19929&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/zhineos/hubbard-spectral-moments&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/zhineos/hubbard-spectral-moments.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: Sharp High-Dimensional Gaussian Approximations over Rectangles without Covariance Restrictions</title><link>https://pragyaangaur.dev/Paperlane/lean/VC2015/rectangle-clt-singular.html</link><guid isPermaLink="false">lean:2611.21474:VC2015/rectangle-clt-singular:2026-11-20T15:07:09Z</guid><pubDate>Fri, 20 Nov 2026 15:07:09 +0000</pubDate><description>&lt;p&gt;Sharp High-Dimensional Gaussian Approximations over Rectangles without Covariance Restrictions (arXiv:2611.21474)&lt;/p&gt;&lt;p&gt;VC2015/rectangle-clt-singular: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: no licence file, so the code is not licensed for reuse&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21474&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/VC2015/rectangle-clt-singular&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/VC2015/rectangle-clt-singular.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: Stratonovich Waves Driven by Space-Time Gaussian Noise</title><link>https://pragyaangaur.dev/Paperlane/lean/chenle02/stratonovich-ham-second-moment-lean.html</link><guid isPermaLink="false">lean:2611.23014:chenle02/stratonovich-ham-second-moment-lean:2026-11-20T15:07:09Z</guid><pubDate>Fri, 20 Nov 2026 15:07:09 +0000</pubDate><description>&lt;p&gt;Stratonovich Waves Driven by Space-Time Gaussian Noise (arXiv:2611.23014)&lt;/p&gt;&lt;p&gt;chenle02/stratonovich-ham-second-moment-lean: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: Apache License 2.0&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23014&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/chenle02/stratonovich-ham-second-moment-lean&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/chenle02/stratonovich-ham-second-moment-lean.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: Higher-order estimates for $p$-harmonic functions in the plane</title><link>https://pragyaangaur.dev/Paperlane/lean/na0b/phigherorder-lean.html</link><guid isPermaLink="false">lean:2611.24842:na0b/phigherorder-lean:2026-11-20T15:07:09Z</guid><pubDate>Fri, 20 Nov 2026 15:07:09 +0000</pubDate><description>&lt;p&gt;Higher-order estimates for $p$-harmonic functions in the plane (arXiv:2611.24842)&lt;/p&gt;&lt;p&gt;na0b/phigherorder-lean: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: Apache License 2.0&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.24842&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/na0b/phigherorder-lean&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/na0b/phigherorder-lean.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: On the Distribution of Prime Squares and Its Applications</title><link>https://pragyaangaur.dev/Paperlane/lean/HamedMousaviMath/lean4-paper-On-Distribution-of-Prime-Squares-formalization.html</link><guid isPermaLink="false">lean:2611.00485:HamedMousaviMath/lean4-paper-On-Distribution-of-Prime-Squares-formalization:2026-11-19T18:50:20Z</guid><pubDate>Thu, 19 Nov 2026 18:50:20 +0000</pubDate><description>&lt;p&gt;On the Distribution of Prime Squares and Its Applications (arXiv:2611.00485)&lt;/p&gt;&lt;p&gt;HamedMousaviMath/lean4-paper-On-Distribution-of-Prime-Squares-formalization: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: Apache License 2.0&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.00485&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/HamedMousaviMath/lean4-paper-On-Distribution-of-Prime-Squares-formalization&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/HamedMousaviMath/lean4-paper-On-Distribution-of-Prime-Squares-formalization.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>does not build: lake build failed for another reason: Annular Obstructions and Skew-Shape Block Identities</title><link>https://pragyaangaur.dev/Paperlane/lean/adamtilepe/Annular_Counterexamples_and_Skew-Shape_Block_Identities.html</link><guid isPermaLink="false">lean:2611.14506:adamtilepe/Annular_Counterexamples_and_Skew-Shape_Block_Identities:2026-11-19T18:50:20Z</guid><pubDate>Thu, 19 Nov 2026 18:50:20 +0000</pubDate><description>&lt;p&gt;Annular Obstructions and Skew-Shape Block Identities (arXiv:2611.14506)&lt;/p&gt;&lt;p&gt;adamtilepe/Annular_Counterexamples_and_Skew-Shape_Block_Identities: does not build: lake build failed for another reason&lt;/p&gt;&lt;p&gt;Code licence: no licence file, so the code is not licensed for reuse&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.14506&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/adamtilepe/Annular_Counterexamples_and_Skew-Shape_Block_Identities&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/adamtilepe/Annular_Counterexamples_and_Skew-Shape_Block_Identities.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: Stability of equilibria in discrete-time modified-gradient systems and the multivariate breeder&#x27;s equation</title><link>https://pragyaangaur.dev/Paperlane/lean/magbenji/discrete-modified-gradient-lean.html</link><guid isPermaLink="false">lean:2611.14756:magbenji/discrete-modified-gradient-lean:2026-11-19T18:50:20Z</guid><pubDate>Thu, 19 Nov 2026 18:50:20 +0000</pubDate><description>&lt;p&gt;Stability of equilibria in discrete-time modified-gradient systems and the multivariate breeder&amp;#x27;s equation (arXiv:2611.14756)&lt;/p&gt;&lt;p&gt;magbenji/discrete-modified-gradient-lean: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: Apache License 2.0&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.14756&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/magbenji/discrete-modified-gradient-lean&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/magbenji/discrete-modified-gradient-lean.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: The multiplicative complexity of the three-bit low-half multiplier</title><link>https://pragyaangaur.dev/Paperlane/lean/bishara74/lowhalf-mul3.html</link><guid isPermaLink="false">lean:2611.15992:bishara74/lowhalf-mul3:2026-11-19T18:50:20Z</guid><pubDate>Thu, 19 Nov 2026 18:50:20 +0000</pubDate><description>&lt;p&gt;The multiplicative complexity of the three-bit low-half multiplier (arXiv:2611.15992)&lt;/p&gt;&lt;p&gt;bishara74/lowhalf-mul3: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: MIT License&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.15992&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/bishara74/lowhalf-mul3&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/bishara74/lowhalf-mul3.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: Smale&#x27;s mean value constant (1981) equals 4</title><link>https://pragyaangaur.dev/Paperlane/lean/david44hello/paper_smale-mean-value-constant-equals-4.html</link><guid isPermaLink="false">lean:2611.17373:david44hello/paper_smale-mean-value-constant-equals-4:2026-11-19T18:50:20Z</guid><pubDate>Thu, 19 Nov 2026 18:50:20 +0000</pubDate><description>&lt;p&gt;Smale&amp;#x27;s mean value constant (1981) equals 4 (arXiv:2611.17373)&lt;/p&gt;&lt;p&gt;david44hello/paper_smale-mean-value-constant-equals-4: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: Apache License 2.0&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.17373&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/david44hello/paper_smale-mean-value-constant-equals-4&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/david44hello/paper_smale-mean-value-constant-equals-4.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: BFGS can converge to non-Clarke-stationary points with positive probability</title><link>https://pragyaangaur.dev/Paperlane/lean/LexiaoLai/Nonsmooth-BFGS-Nonstationary.html</link><guid isPermaLink="false">lean:2610.34087:LexiaoLai/Nonsmooth-BFGS-Nonstationary:2026-11-19T18:20:03Z</guid><pubDate>Thu, 19 Nov 2026 18:20:03 +0000</pubDate><description>&lt;p&gt;BFGS can converge to non-Clarke-stationary points with positive probability (arXiv:2610.34087)&lt;/p&gt;&lt;p&gt;LexiaoLai/Nonsmooth-BFGS-Nonstationary: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: MIT License&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2610.34087&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/LexiaoLai/Nonsmooth-BFGS-Nonstationary&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/LexiaoLai/Nonsmooth-BFGS-Nonstationary.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: Polynomial configurations and pointwise averages along Piatetski--Shapiro primes</title><link>https://pragyaangaur.dev/Paperlane/lean/HamedMousaviMath/Lean-Formalization-Polynomial-Configurations-and-Pointwise-Averages-Along-Piatetski--Shapiro-Primes.html</link><guid isPermaLink="false">lean:2611.04575:HamedMousaviMath/Lean-Formalization-Polynomial-Configurations-and-Pointwise-Averages-Along-Piatetski--Shapiro-Primes:2026-11-19T18:20:03Z</guid><pubDate>Thu, 19 Nov 2026 18:20:03 +0000</pubDate><description>&lt;p&gt;Polynomial configurations and pointwise averages along Piatetski--Shapiro primes (arXiv:2611.04575)&lt;/p&gt;&lt;p&gt;HamedMousaviMath/Lean-Formalization-Polynomial-Configurations-and-Pointwise-Averages-Along-Piatetski--Shapiro-Primes: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: no licence file, so the code is not licensed for reuse&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.04575&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/HamedMousaviMath/Lean-Formalization-Polynomial-Configurations-and-Pointwise-Averages-Along-Piatetski--Shapiro-Primes&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/HamedMousaviMath/Lean-Formalization-Polynomial-Configurations-and-Pointwise-Averages-Along-Piatetski--Shapiro-Primes.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: Representation embeddings and the third Brauer--Thrall conjecture</title><link>https://pragyaangaur.dev/Paperlane/lean/haruhisa-enomoto/third-brauer-thrall-conjecture.html</link><guid isPermaLink="false">lean:2611.06325:haruhisa-enomoto/third-brauer-thrall-conjecture:2026-11-19T18:20:03Z</guid><pubDate>Thu, 19 Nov 2026 18:20:03 +0000</pubDate><description>&lt;p&gt;Representation embeddings and the third Brauer--Thrall conjecture (arXiv:2611.06325)&lt;/p&gt;&lt;p&gt;haruhisa-enomoto/third-brauer-thrall-conjecture: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: Apache License 2.0&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.06325&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/haruhisa-enomoto/third-brauer-thrall-conjecture&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/haruhisa-enomoto/third-brauer-thrall-conjecture.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: The Localization Scale of the Block Anderson Model in One Dimension at Arbitrary Coupling and Volume</title><link>https://pragyaangaur.dev/Paperlane/lean/JYin80/Lean-LSBA1d.html</link><guid isPermaLink="false">lean:2611.09776:JYin80/Lean-LSBA1d:2026-11-19T18:20:03Z</guid><pubDate>Thu, 19 Nov 2026 18:20:03 +0000</pubDate><description>&lt;p&gt;The Localization Scale of the Block Anderson Model in One Dimension at Arbitrary Coupling and Volume (arXiv:2611.09776)&lt;/p&gt;&lt;p&gt;JYin80/Lean-LSBA1d: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: Apache License 2.0&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.09776&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/JYin80/Lean-LSBA1d&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/JYin80/Lean-LSBA1d.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: A trace costs one quantifier: the exact complexity of perfect play in nonlocal games</title><link>https://pragyaangaur.dev/Paperlane/lean/Apsiape/perfect-play-arithmetical-hierarchy.html</link><guid isPermaLink="false">lean:2611.10481:Apsiape/perfect-play-arithmetical-hierarchy:2026-11-19T18:20:03Z</guid><pubDate>Thu, 19 Nov 2026 18:20:03 +0000</pubDate><description>&lt;p&gt;A trace costs one quantifier: the exact complexity of perfect play in nonlocal games (arXiv:2611.10481)&lt;/p&gt;&lt;p&gt;Apsiape/perfect-play-arithmetical-hierarchy: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: MIT License&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.10481&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/Apsiape/perfect-play-arithmetical-hierarchy&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/Apsiape/perfect-play-arithmetical-hierarchy.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: Inhomogeneous deformations of $\mathfrak{osp}(N|2n)$: triviality for any number of odd parameters</title><link>https://pragyaangaur.dev/Paperlane/lean/ritsumei-aoi/osp-odd-deformations.html</link><guid isPermaLink="false">lean:2611.11153:ritsumei-aoi/osp-odd-deformations:2026-11-19T18:20:03Z</guid><pubDate>Thu, 19 Nov 2026 18:20:03 +0000</pubDate><description>&lt;p&gt;Inhomogeneous deformations of $\mathfrak{osp}(N|2n)$: triviality for any number of odd parameters (arXiv:2611.11153)&lt;/p&gt;&lt;p&gt;ritsumei-aoi/osp-odd-deformations: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: MIT License&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.11153&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/ritsumei-aoi/osp-odd-deformations&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/ritsumei-aoi/osp-odd-deformations.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds with 1 sorry warning: Reasonable bounds for Restricted Polynomial Progressions in $\mathbb F^n_p$</title><link>https://pragyaangaur.dev/Paperlane/lean/lacey-gatech/restricted-polynomials-lean.html</link><guid isPermaLink="false">lean:2610.12831:lacey-gatech/restricted-polynomials-lean:2026-11-19T17:14:05Z</guid><pubDate>Thu, 19 Nov 2026 17:14:05 +0000</pubDate><description>&lt;p&gt;Reasonable bounds for Restricted Polynomial Progressions in $\mathbb F^n_p$ (arXiv:2610.12831)&lt;/p&gt;&lt;p&gt;lacey-gatech/restricted-polynomials-lean: builds with 1 sorry warning&lt;/p&gt;&lt;p&gt;Code licence: Apache License 2.0&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2610.12831&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/lacey-gatech/restricted-polynomials-lean&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/lacey-gatech/restricted-polynomials-lean.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: A direct obstacle proof of a dimension-free weak-type $(1,1)$ bound for the Gaussian Riesz transforms</title><link>https://pragyaangaur.dev/Paperlane/lean/na0b/gaussianriesz-lean.html</link><guid isPermaLink="false">lean:2610.26478:na0b/gaussianriesz-lean:2026-11-19T17:14:05Z</guid><pubDate>Thu, 19 Nov 2026 17:14:05 +0000</pubDate><description>&lt;p&gt;A direct obstacle proof of a dimension-free weak-type $(1,1)$ bound for the Gaussian Riesz transforms (arXiv:2610.26478)&lt;/p&gt;&lt;p&gt;na0b/gaussianriesz-lean: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: Apache License 2.0&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2610.26478&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/na0b/gaussianriesz-lean&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/na0b/gaussianriesz-lean.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>does not build: lake build failed for another reason: Researcher-in-the-Loop Evolutionary Discovery of Entanglement-Assisted Quantum Code Families</title><link>https://pragyaangaur.dev/Paperlane/lean/LeGenAI/llm_guided_EAQECC_search.html</link><guid isPermaLink="false">lean:2610.41183:LeGenAI/llm_guided_EAQECC_search:2026-11-19T17:14:05Z</guid><pubDate>Thu, 19 Nov 2026 17:14:05 +0000</pubDate><description>&lt;p&gt;Researcher-in-the-Loop Evolutionary Discovery of Entanglement-Assisted Quantum Code Families (arXiv:2610.41183)&lt;/p&gt;&lt;p&gt;LeGenAI/llm_guided_EAQECC_search: does not build: lake build failed for another reason&lt;/p&gt;&lt;p&gt;Code licence: MIT License&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2610.41183&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/LeGenAI/llm_guided_EAQECC_search&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/LeGenAI/llm_guided_EAQECC_search.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: A log-concavity criterion for finite nonnegative linearization</title><link>https://pragyaangaur.dev/Paperlane/lean/skypher/szkraw.html</link><guid isPermaLink="false">lean:2611.01561:skypher/szkraw:2026-11-19T17:14:05Z</guid><pubDate>Thu, 19 Nov 2026 17:14:05 +0000</pubDate><description>&lt;p&gt;A log-concavity criterion for finite nonnegative linearization (arXiv:2611.01561)&lt;/p&gt;&lt;p&gt;skypher/szkraw: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: no licence file, so the code is not licensed for reuse&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.01561&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/skypher/szkraw&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/skypher/szkraw.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds with 3 sorry warnings: Kaplansky&#x27;s conjectures fail for torsion-free hyperbolic groups in positive characteristic</title><link>https://pragyaangaur.dev/Paperlane/lean/Apsiape/kaplansky-conjectures-hyperbolic-groups.html</link><guid isPermaLink="false">lean:2611.04599:Apsiape/kaplansky-conjectures-hyperbolic-groups:2026-11-19T17:14:05Z</guid><pubDate>Thu, 19 Nov 2026 17:14:05 +0000</pubDate><description>&lt;p&gt;Kaplansky&amp;#x27;s conjectures fail for torsion-free hyperbolic groups in positive characteristic (arXiv:2611.04599)&lt;/p&gt;&lt;p&gt;Apsiape/kaplansky-conjectures-hyperbolic-groups: builds with 3 sorry warnings&lt;/p&gt;&lt;p&gt;Code licence: a licence file GitHub could not identify&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.04599&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/Apsiape/kaplansky-conjectures-hyperbolic-groups&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/Apsiape/kaplansky-conjectures-hyperbolic-groups.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: Multipliers and weighted d-bar estimates</title><link>https://pragyaangaur.dev/Paperlane/lean/joaquimortega/MR1949832.html</link><guid isPermaLink="false">lean:math/9912139:joaquimortega/MR1949832:2026-11-19T17:14:05Z</guid><pubDate>Thu, 19 Nov 2026 17:14:05 +0000</pubDate><description>&lt;p&gt;Multipliers and weighted d-bar estimates (arXiv:math/9912139)&lt;/p&gt;&lt;p&gt;joaquimortega/MR1949832: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: Apache License 2.0&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/math/9912139&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/joaquimortega/MR1949832&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/joaquimortega/MR1949832.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: Rational structures on quivers and a generalization of Gelfand&#x27;s equivalence</title><link>https://pragyaangaur.dev/Paperlane/lean/drjanosch42/rational_quivers.html</link><guid isPermaLink="false">lean:2506.23251:drjanosch42/rational_quivers:2026-11-19T16:54:03Z</guid><pubDate>Thu, 19 Nov 2026 16:54:03 +0000</pubDate><description>&lt;p&gt;Rational structures on quivers and a generalization of Gelfand&amp;#x27;s equivalence (arXiv:2506.23251)&lt;/p&gt;&lt;p&gt;drjanosch42/rational_quivers: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: Apache License 2.0&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2506.23251&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/drjanosch42/rational_quivers&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/drjanosch42/rational_quivers.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: Szemerédi&#x27;s Theorem Along Cantor Sets of Integers</title><link>https://pragyaangaur.dev/Paperlane/lean/lacey-gatech/CantorSzemeredi.html</link><guid isPermaLink="false">lean:2602.15299:lacey-gatech/CantorSzemeredi:2026-11-19T16:54:03Z</guid><pubDate>Thu, 19 Nov 2026 16:54:03 +0000</pubDate><description>&lt;p&gt;Szemerédi&amp;#x27;s Theorem Along Cantor Sets of Integers (arXiv:2602.15299)&lt;/p&gt;&lt;p&gt;lacey-gatech/CantorSzemeredi: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: Apache License 2.0&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2602.15299&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/lacey-gatech/CantorSzemeredi&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/lacey-gatech/CantorSzemeredi.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: Limit shapes for centrally excited walks</title><link>https://pragyaangaur.dev/Paperlane/lean/nitromannitol/Centrally-Excited-Random-Walk.html</link><guid isPermaLink="false">lean:2610.10162:nitromannitol/Centrally-Excited-Random-Walk:2026-11-19T16:54:03Z</guid><pubDate>Thu, 19 Nov 2026 16:54:03 +0000</pubDate><description>&lt;p&gt;Limit shapes for centrally excited walks (arXiv:2610.10162)&lt;/p&gt;&lt;p&gt;nitromannitol/Centrally-Excited-Random-Walk: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: Apache License 2.0&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2610.10162&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/nitromannitol/Centrally-Excited-Random-Walk&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/nitromannitol/Centrally-Excited-Random-Walk.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: Non-Uniqueness of Weak Solutions to the Unforced Two-Dimensional Euler Equations with Vorticity in $L^1\cap L^p$, Part I: A Compactness Criterion and the Linear Analysis</title><link>https://pragyaangaur.dev/Paperlane/lean/mcoiculescu/NonUniqueEuler.html</link><guid isPermaLink="false">lean:2610.30655:mcoiculescu/NonUniqueEuler:2026-11-19T16:54:03Z</guid><pubDate>Thu, 19 Nov 2026 16:54:03 +0000</pubDate><description>&lt;p&gt;Non-Uniqueness of Weak Solutions to the Unforced Two-Dimensional Euler Equations with Vorticity in $L^1\cap L^p$, Part I: A Compactness Criterion and the Linear Analysis (arXiv:2610.30655)&lt;/p&gt;&lt;p&gt;mcoiculescu/NonUniqueEuler: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: Apache License 2.0&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2610.30655&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/mcoiculescu/NonUniqueEuler&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/mcoiculescu/NonUniqueEuler.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>does not build: a dependency could not be downloaded or resolved: Persistence Pays: Square-root condition-number dependence for Metropolis-adjusted kinetic Langevin Monte Carlo with a non-reversibly updated accept/reject uniform</title><link>https://pragyaangaur.dev/Paperlane/lean/nawafbourabee/persistence-pays-lean.html</link><guid isPermaLink="false">lean:2610.35781:nawafbourabee/persistence-pays-lean:2026-11-19T16:54:03Z</guid><pubDate>Thu, 19 Nov 2026 16:54:03 +0000</pubDate><description>&lt;p&gt;Persistence Pays: Square-root condition-number dependence for Metropolis-adjusted kinetic Langevin Monte Carlo with a non-reversibly updated accept/reject uniform (arXiv:2610.35781)&lt;/p&gt;&lt;p&gt;nawafbourabee/persistence-pays-lean: does not build: a dependency could not be downloaded or resolved&lt;/p&gt;&lt;p&gt;Code licence: Apache License 2.0&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2610.35781&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/nawafbourabee/persistence-pays-lean&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/nawafbourabee/persistence-pays-lean.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: Non-Uniqueness of Weak Solutions to the Unforced Two-Dimensional Euler Equations with Vorticity in $L^1\cap L^p$, Part II: The Nonlinear Construction</title><link>https://pragyaangaur.dev/Paperlane/lean/mcoiculescu/NonUniqueEuler.html</link><guid isPermaLink="false">lean:2611.10211:mcoiculescu/NonUniqueEuler:2026-11-19T16:54:03Z</guid><pubDate>Thu, 19 Nov 2026 16:54:03 +0000</pubDate><description>&lt;p&gt;Non-Uniqueness of Weak Solutions to the Unforced Two-Dimensional Euler Equations with Vorticity in $L^1\cap L^p$, Part II: The Nonlinear Construction (arXiv:2611.10211)&lt;/p&gt;&lt;p&gt;mcoiculescu/NonUniqueEuler: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: Apache License 2.0&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.10211&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/mcoiculescu/NonUniqueEuler&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/mcoiculescu/NonUniqueEuler.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: Unique continuation for the Pauli-Fierz Hamiltonian</title><link>https://pragyaangaur.dev/Paperlane/lean/xyzw/pf_ucp.html</link><guid isPermaLink="false">lean:2611.23062:xyzw/pf_ucp:2026-11-18T15:41:09Z</guid><pubDate>Wed, 18 Nov 2026 15:41:09 +0000</pubDate><description>&lt;p&gt;Unique continuation for the Pauli-Fierz Hamiltonian (arXiv:2611.23062)&lt;/p&gt;&lt;p&gt;xyzw/pf_ucp: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: no licence file, so the code is not licensed for reuse&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23062&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/xyzw/pf_ucp&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/xyzw/pf_ucp.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: $p$-harmonic polynomials</title><link>https://pragyaangaur.dev/Paperlane/lean/na0b/pharmonicpoly-lean.html</link><guid isPermaLink="false">lean:2611.23136:na0b/pharmonicpoly-lean:2026-11-18T15:41:09Z</guid><pubDate>Wed, 18 Nov 2026 15:41:09 +0000</pubDate><description>&lt;p&gt;$p$-harmonic polynomials (arXiv:2611.23136)&lt;/p&gt;&lt;p&gt;na0b/pharmonicpoly-lean: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: Apache License 2.0&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23136&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/na0b/pharmonicpoly-lean&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/na0b/pharmonicpoly-lean.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds with 2 sorry warnings: A Variation Norm Carleson Theorem Along the Primes</title><link>https://pragyaangaur.dev/Paperlane/lean/anastasiosfragkosmath/Variation-Norm-Carleson-Along-the-Primes-Palomar-Submission.html</link><guid isPermaLink="false">lean:2607.05560:anastasiosfragkosmath/Variation-Norm-Carleson-Along-the-Primes-Palomar-Submission:2026-11-17T11:58:57Z</guid><pubDate>Tue, 17 Nov 2026 11:58:57 +0000</pubDate><description>&lt;p&gt;A Variation Norm Carleson Theorem Along the Primes (arXiv:2607.05560)&lt;/p&gt;&lt;p&gt;anastasiosfragkosmath/Variation-Norm-Carleson-Along-the-Primes-Palomar-Submission: builds with 2 sorry warnings&lt;/p&gt;&lt;p&gt;Code licence: Apache License 2.0&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2607.05560&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/anastasiosfragkosmath/Variation-Norm-Carleson-Along-the-Primes-Palomar-Submission&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/anastasiosfragkosmath/Variation-Norm-Carleson-Along-the-Primes-Palomar-Submission.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: A fast dynamo with zero topological entropy</title><link>https://pragyaangaur.dev/Paperlane/lean/lukasniebel/fast_dynamo_lean.html</link><guid isPermaLink="false">lean:2608.02586:lukasniebel/fast_dynamo_lean:2026-11-17T11:58:57Z</guid><pubDate>Tue, 17 Nov 2026 11:58:57 +0000</pubDate><description>&lt;p&gt;A fast dynamo with zero topological entropy (arXiv:2608.02586)&lt;/p&gt;&lt;p&gt;lukasniebel/fast_dynamo_lean: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: Apache License 2.0&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2608.02586&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/lukasniebel/fast_dynamo_lean&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/lukasniebel/fast_dynamo_lean.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: ProofLoom: Proof-Obligation-Driven Theory Construction for Autoformalizing Research-Level Stochastic Optimization</title><link>https://pragyaangaur.dev/Paperlane/lean/Trace231/ProofLoom.html</link><guid isPermaLink="false">lean:2609.34960:Trace231/ProofLoom:2026-11-17T11:58:57Z</guid><pubDate>Tue, 17 Nov 2026 11:58:57 +0000</pubDate><description>&lt;p&gt;ProofLoom: Proof-Obligation-Driven Theory Construction for Autoformalizing Research-Level Stochastic Optimization (arXiv:2609.34960)&lt;/p&gt;&lt;p&gt;Trace231/ProofLoom: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: MIT License&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2609.34960&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/Trace231/ProofLoom&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/Trace231/ProofLoom.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: Rounded Clocks and Finite Precision: A Transfer Principle Between Continuous and Discrete Quantum Dynamics</title><link>https://pragyaangaur.dev/Paperlane/lean/mjarret/products-of-unitaries-lean.html</link><guid isPermaLink="false">lean:2610.06541:mjarret/products-of-unitaries-lean:2026-11-17T11:58:57Z</guid><pubDate>Tue, 17 Nov 2026 11:58:57 +0000</pubDate><description>&lt;p&gt;Rounded Clocks and Finite Precision: A Transfer Principle Between Continuous and Discrete Quantum Dynamics (arXiv:2610.06541)&lt;/p&gt;&lt;p&gt;mjarret/products-of-unitaries-lean: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: Apache License 2.0&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2610.06541&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/mjarret/products-of-unitaries-lean&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/mjarret/products-of-unitaries-lean.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: Beyond Nine Gates: Classification of Full-Sided Mahjong Waits with $3n$ Ranks</title><link>https://pragyaangaur.dev/Paperlane/lean/sun123zxy/ninegates-lean4.html</link><guid isPermaLink="false">lean:2611.06944:sun123zxy/ninegates-lean4:2026-11-17T11:58:57Z</guid><pubDate>Tue, 17 Nov 2026 11:58:57 +0000</pubDate><description>&lt;p&gt;Beyond Nine Gates: Classification of Full-Sided Mahjong Waits with $3n$ Ranks (arXiv:2611.06944)&lt;/p&gt;&lt;p&gt;sun123zxy/ninegates-lean4: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: Apache License 2.0&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.06944&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/sun123zxy/ninegates-lean4&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/sun123zxy/ninegates-lean4.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds with 1 sorry warning: The Bilinear Hilbert Transform Along the Primes</title><link>https://pragyaangaur.dev/Paperlane/lean/anastasiosfragkosmath/Prime_BHT_Palomar_Submission.html</link><guid isPermaLink="false">lean:2611.19335:anastasiosfragkosmath/Prime_BHT_Palomar_Submission:2026-11-17T11:58:57Z</guid><pubDate>Tue, 17 Nov 2026 11:58:57 +0000</pubDate><description>&lt;p&gt;The Bilinear Hilbert Transform Along the Primes (arXiv:2611.19335)&lt;/p&gt;&lt;p&gt;anastasiosfragkosmath/Prime_BHT_Palomar_Submission: builds with 1 sorry warning&lt;/p&gt;&lt;p&gt;Code licence: Apache License 2.0&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.19335&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/anastasiosfragkosmath/Prime_BHT_Palomar_Submission&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/anastasiosfragkosmath/Prime_BHT_Palomar_Submission.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: A formally verified convergence theorem for the tug-of-war scheme of the normalized $p$-Laplacian</title><link>https://pragyaangaur.dev/Paperlane/lean/BehroozMoosavi/tugofwar_formalization.html</link><guid isPermaLink="false">lean:2611.20169:BehroozMoosavi/tugofwar_formalization:2026-11-17T11:58:57Z</guid><pubDate>Tue, 17 Nov 2026 11:58:57 +0000</pubDate><description>&lt;p&gt;A formally verified convergence theorem for the tug-of-war scheme of the normalized $p$-Laplacian (arXiv:2611.20169)&lt;/p&gt;&lt;p&gt;BehroozMoosavi/tugofwar_formalization: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: Apache License 2.0&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.20169&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/BehroozMoosavi/tugofwar_formalization&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/BehroozMoosavi/tugofwar_formalization.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: Banded Totally Positive Matrices and Positive Bidiagonal Factorizations: Existence, Stability, and Toeplitz Orthogonality</title><link>https://pragyaangaur.dev/Paperlane/lean/ManuelManas/btp-pbf-verification.html</link><guid isPermaLink="false">lean:2610.08568:ManuelManas/btp-pbf-verification:2026-11-16T17:18:21Z</guid><pubDate>Mon, 16 Nov 2026 17:18:21 +0000</pubDate><description>&lt;p&gt;Banded Totally Positive Matrices and Positive Bidiagonal Factorizations: Existence, Stability, and Toeplitz Orthogonality (arXiv:2610.08568)&lt;/p&gt;&lt;p&gt;ManuelManas/btp-pbf-verification: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: no licence file, so the code is not licensed for reuse&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2610.08568&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/ManuelManas/btp-pbf-verification&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/ManuelManas/btp-pbf-verification.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: Directed distances in bipolar-oriented triangulations: exact exponents and scaling limits</title><link>https://pragyaangaur.dev/Paperlane/lean/jacopoborga/DLQG1-bipolar-triangulations-Lean.html</link><guid isPermaLink="false">lean:2510.26123:jacopoborga/DLQG1-bipolar-triangulations-Lean:2026-11-16T17:09:00Z</guid><pubDate>Mon, 16 Nov 2026 17:09:00 +0000</pubDate><description>&lt;p&gt;Directed distances in bipolar-oriented triangulations: exact exponents and scaling limits (arXiv:2510.26123)&lt;/p&gt;&lt;p&gt;jacopoborga/DLQG1-bipolar-triangulations-Lean: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: Apache License 2.0&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2510.26123&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/jacopoborga/DLQG1-bipolar-triangulations-Lean&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/jacopoborga/DLQG1-bipolar-triangulations-Lean.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: A Computer-Assisted Proof of Speed Monotonicity for the Biased Random Walk on a Galton-Watson Tree Beyond the Known Range</title><link>https://pragyaangaur.dev/Paperlane/lean/samyama-ai/gw-speed-certificate.html</link><guid isPermaLink="false">lean:2609.29894:samyama-ai/gw-speed-certificate:2026-11-13T08:09:51Z</guid><pubDate>Fri, 13 Nov 2026 08:09:51 +0000</pubDate><description>&lt;p&gt;A Computer-Assisted Proof of Speed Monotonicity for the Biased Random Walk on a Galton-Watson Tree Beyond the Known Range (arXiv:2609.29894)&lt;/p&gt;&lt;p&gt;samyama-ai/gw-speed-certificate: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: a licence file GitHub could not identify&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2609.29894&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/samyama-ai/gw-speed-certificate&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/samyama-ai/gw-speed-certificate.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: Gluons and Knots</title><link>https://pragyaangaur.dev/Paperlane/lean/aguevara22/gluon-knot-lean.html</link><guid isPermaLink="false">lean:2610.10673:aguevara22/gluon-knot-lean:2026-11-13T08:09:51Z</guid><pubDate>Fri, 13 Nov 2026 08:09:51 +0000</pubDate><description>&lt;p&gt;Gluons and Knots (arXiv:2610.10673)&lt;/p&gt;&lt;p&gt;aguevara22/gluon-knot-lean: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: no licence file, so the code is not licensed for reuse&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2610.10673&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/aguevara22/gluon-knot-lean&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/aguevara22/gluon-knot-lean.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: The Hibi--Li (2016) conjecture is fully resolved</title><link>https://pragyaangaur.dev/Paperlane/lean/david44hello/papers_supporting_materials.html</link><guid isPermaLink="false">lean:2610.40703:david44hello/papers_supporting_materials:2026-11-13T08:09:51Z</guid><pubDate>Fri, 13 Nov 2026 08:09:51 +0000</pubDate><description>&lt;p&gt;The Hibi--Li (2016) conjecture is fully resolved (arXiv:2610.40703)&lt;/p&gt;&lt;p&gt;david44hello/papers_supporting_materials: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: Apache License 2.0&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2610.40703&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/david44hello/papers_supporting_materials&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/david44hello/papers_supporting_materials.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: The Cranston--Li--Su--Wang--Xu (2026) conjecture is true</title><link>https://pragyaangaur.dev/Paperlane/lean/david44hello/papers_supporting_materials.html</link><guid isPermaLink="false">lean:2610.40863:david44hello/papers_supporting_materials:2026-11-13T08:09:51Z</guid><pubDate>Fri, 13 Nov 2026 08:09:51 +0000</pubDate><description>&lt;p&gt;The Cranston--Li--Su--Wang--Xu (2026) conjecture is true (arXiv:2610.40863)&lt;/p&gt;&lt;p&gt;david44hello/papers_supporting_materials: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: Apache License 2.0&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2610.40863&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/david44hello/papers_supporting_materials&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/david44hello/papers_supporting_materials.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>does not build: Annular Obstructions and Skew-Shape Block Identities</title><link>https://pragyaangaur.dev/Paperlane/lean/adamtilepe/Annular_Obstructions_and_Skew-Shape_Block_Identities.html</link><guid isPermaLink="false">lean:2611.14506:adamtilepe/Annular_Obstructions_and_Skew-Shape_Block_Identities:2026-11-13T08:09:51Z</guid><pubDate>Fri, 13 Nov 2026 08:09:51 +0000</pubDate><description>&lt;p&gt;Annular Obstructions and Skew-Shape Block Identities (arXiv:2611.14506)&lt;/p&gt;&lt;p&gt;adamtilepe/Annular_Obstructions_and_Skew-Shape_Block_Identities: does not build&lt;/p&gt;&lt;p&gt;Code licence: no licence file, so the code is not licensed for reuse&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.14506&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/adamtilepe/Annular_Obstructions_and_Skew-Shape_Block_Identities&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/adamtilepe/Annular_Obstructions_and_Skew-Shape_Block_Identities.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: On Fourier frames</title><link>https://pragyaangaur.dev/Paperlane/lean/joaquimortega/MR1923965.html</link><guid isPermaLink="false">lean:math/0005092:joaquimortega/MR1923965:2026-11-13T08:09:51Z</guid><pubDate>Fri, 13 Nov 2026 08:09:51 +0000</pubDate><description>&lt;p&gt;On Fourier frames (arXiv:math/0005092)&lt;/p&gt;&lt;p&gt;joaquimortega/MR1923965: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: Apache License 2.0&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/math/0005092&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/joaquimortega/MR1923965&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/joaquimortega/MR1923965.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>is too large to build within the check&#x27;s time limit: Vertex Operator Algebras in Lean: a formal library and its companion book</title><link>https://pragyaangaur.dev/Paperlane/lean/Fedor-Popov/Lean_VOA.html</link><guid isPermaLink="false">lean:2611.06616:Fedor-Popov/Lean_VOA:2026-11-12T19:47:53Z</guid><pubDate>Thu, 12 Nov 2026 19:47:53 +0000</pubDate><description>&lt;p&gt;Vertex Operator Algebras in Lean: a formal library and its companion book (arXiv:2611.06616)&lt;/p&gt;&lt;p&gt;Fedor-Popov/Lean_VOA: is too large to build within the check&amp;#x27;s time limit&lt;/p&gt;&lt;p&gt;Code licence: Apache License 2.0&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.06616&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/Fedor-Popov/Lean_VOA&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/Fedor-Popov/Lean_VOA.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds with 3 sorry warnings: Pointwise Ergodic Theorems Along $\lfloor p^c\rfloor$ for Every $c&gt;1$</title><link>https://pragyaangaur.dev/Paperlane/lean/anastasiosfragkosmath/Pointwise-Ergodic-Theorems-Along-floor-p-c-Palomar-Submission.html</link><guid isPermaLink="false">lean:2611.02465:anastasiosfragkosmath/Pointwise-Ergodic-Theorems-Along-floor-p-c-Palomar-Submission:2026-11-10T15:47:17Z</guid><pubDate>Tue, 10 Nov 2026 15:47:17 +0000</pubDate><description>&lt;p&gt;Pointwise Ergodic Theorems Along $\lfloor p^c\rfloor$ for Every $c&amp;gt;1$ (arXiv:2611.02465)&lt;/p&gt;&lt;p&gt;anastasiosfragkosmath/Pointwise-Ergodic-Theorems-Along-floor-p-c-Palomar-Submission: builds with 3 sorry warnings&lt;/p&gt;&lt;p&gt;Code licence: Apache License 2.0&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.02465&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/anastasiosfragkosmath/Pointwise-Ergodic-Theorems-Along-floor-p-c-Palomar-Submission&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/anastasiosfragkosmath/Pointwise-Ergodic-Theorems-Along-floor-p-c-Palomar-Submission.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>could not be checked: No regular icosahedron has a rational point on every face: a proof checked in Lean</title><link>https://pragyaangaur.dev/Paperlane/lean/MikhailLevit1987/icosahedron-rational-faces.html</link><guid isPermaLink="false">lean:2611.11577:MikhailLevit1987/icosahedron-rational-faces:2026-11-10T15:13:15Z</guid><pubDate>Tue, 10 Nov 2026 15:13:15 +0000</pubDate><description>&lt;p&gt;No regular icosahedron has a rational point on every face: a proof checked in Lean (arXiv:2611.11577)&lt;/p&gt;&lt;p&gt;MikhailLevit1987/icosahedron-rational-faces: could not be checked&lt;/p&gt;&lt;p&gt;Code licence: Apache License 2.0&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.11577&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/MikhailLevit1987/icosahedron-rational-faces&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/MikhailLevit1987/icosahedron-rational-faces.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: Monotonicity of Erdős sums</title><link>https://pragyaangaur.dev/Paperlane/lean/jaideepsaipadhi/erdos-sums-almost-primes.html</link><guid isPermaLink="false">lean:2611.11418:jaideepsaipadhi/erdos-sums-almost-primes:2026-11-10T13:24:22Z</guid><pubDate>Tue, 10 Nov 2026 13:24:22 +0000</pubDate><description>&lt;p&gt;Monotonicity of Erdős sums (arXiv:2611.11418)&lt;/p&gt;&lt;p&gt;jaideepsaipadhi/erdos-sums-almost-primes: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: no licence file, so the code is not licensed for reuse&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.11418&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/jaideepsaipadhi/erdos-sums-almost-primes&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/jaideepsaipadhi/erdos-sums-almost-primes.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds with 3 sorry warnings: A software infrastructure proposal for mathematical research with AI agents</title><link>https://pragyaangaur.dev/Paperlane/lean/stemma-math/stemma-exedra.html</link><guid isPermaLink="false">lean:2611.11645:stemma-math/stemma-exedra:2026-11-10T13:24:22Z</guid><pubDate>Tue, 10 Nov 2026 13:24:22 +0000</pubDate><description>&lt;p&gt;A software infrastructure proposal for mathematical research with AI agents (arXiv:2611.11645)&lt;/p&gt;&lt;p&gt;stemma-math/stemma-exedra: builds with 3 sorry warnings&lt;/p&gt;&lt;p&gt;Code licence: MIT License&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.11645&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/stemma-math/stemma-exedra&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/stemma-math/stemma-exedra.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: Binary Belief Propagation Fixed Points: Finiteness, Rigidity, and Topological Complexity</title><link>https://pragyaangaur.dev/Paperlane/lean/ywatanabex/bp-response-geometry-lean.html</link><guid isPermaLink="false">lean:2611.11713:ywatanabex/bp-response-geometry-lean:2026-11-10T13:24:22Z</guid><pubDate>Tue, 10 Nov 2026 13:24:22 +0000</pubDate><description>&lt;p&gt;Binary Belief Propagation Fixed Points: Finiteness, Rigidity, and Topological Complexity (arXiv:2611.11713)&lt;/p&gt;&lt;p&gt;ywatanabex/bp-response-geometry-lean: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: MIT License&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.11713&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/ywatanabex/bp-response-geometry-lean&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/ywatanabex/bp-response-geometry-lean.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: Conley index theory for asymptotically autonomous systems and UV-to-IR connections</title><link>https://pragyaangaur.dev/Paperlane/lean/stacks-ai/papers.html</link><guid isPermaLink="false">lean:2611.08591:stacks-ai/papers:2026-11-09T05:45:50Z</guid><pubDate>Mon, 09 Nov 2026 05:45:50 +0000</pubDate><description>&lt;p&gt;Conley index theory for asymptotically autonomous systems and UV-to-IR connections (arXiv:2611.08591)&lt;/p&gt;&lt;p&gt;stacks-ai/papers: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: no licence file, so the code is not licensed for reuse&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.08591&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/stacks-ai/papers&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/stacks-ai/papers.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>is too large to build within the check&#x27;s time limit: Uniqueness of the critical and supercritical Liouville quantum gravity metrics</title><link>https://pragyaangaur.dev/Paperlane/lean/leobon12/lean-formalizations.html</link><guid isPermaLink="false">lean:2110.00177:leobon12/lean-formalizations:2026-11-06T08:56:56Z</guid><pubDate>Fri, 06 Nov 2026 08:56:56 +0000</pubDate><description>&lt;p&gt;Uniqueness of the critical and supercritical Liouville quantum gravity metrics (arXiv:2110.00177)&lt;/p&gt;&lt;p&gt;leobon12/lean-formalizations: is too large to build within the check&amp;#x27;s time limit&lt;/p&gt;&lt;p&gt;Code licence: no licence file, so the code is not licensed for reuse&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2110.00177&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/leobon12/lean-formalizations&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/leobon12/lean-formalizations.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: Inverting the operation of conditioning a branching process on extinction</title><link>https://pragyaangaur.dev/Paperlane/lean/ewaingwynne/conjugate-branching-lean.html</link><guid isPermaLink="false">lean:2411.06301:ewaingwynne/conjugate-branching-lean:2026-11-06T08:56:56Z</guid><pubDate>Fri, 06 Nov 2026 08:56:56 +0000</pubDate><description>&lt;p&gt;Inverting the operation of conditioning a branching process on extinction (arXiv:2411.06301)&lt;/p&gt;&lt;p&gt;ewaingwynne/conjugate-branching-lean: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: no licence file, so the code is not licensed for reuse&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2411.06301&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/ewaingwynne/conjugate-branching-lean&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/ewaingwynne/conjugate-branching-lean.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>is too large to build within the check&#x27;s time limit: Weak uniqueness for the stochastic heat equation with nondegenerate diffusion: the full Hölder regime</title><link>https://pragyaangaur.dev/Paperlane/lean/hanyi162013-Yihan/scalar-she-lean.html</link><guid isPermaLink="false">lean:2611.07310:hanyi162013-Yihan/scalar-she-lean:2026-11-06T08:56:56Z</guid><pubDate>Fri, 06 Nov 2026 08:56:56 +0000</pubDate><description>&lt;p&gt;Weak uniqueness for the stochastic heat equation with nondegenerate diffusion: the full Hölder regime (arXiv:2611.07310)&lt;/p&gt;&lt;p&gt;hanyi162013-Yihan/scalar-she-lean: is too large to build within the check&amp;#x27;s time limit&lt;/p&gt;&lt;p&gt;Code licence: no licence file, so the code is not licensed for reuse&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.07310&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/hanyi162013-Yihan/scalar-she-lean&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/hanyi162013-Yihan/scalar-she-lean.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>builds, no sorry: Loewner evolution driven by complex Brownian motion (with simulations by Minjae Park)</title><link>https://pragyaangaur.dev/Paperlane/lean/ewaingwynne/complex-sle.html</link><guid isPermaLink="false">lean:2203.07313:ewaingwynne/complex-sle:2026-11-05T07:06:21Z</guid><pubDate>Thu, 05 Nov 2026 07:06:21 +0000</pubDate><description>&lt;p&gt;Loewner evolution driven by complex Brownian motion (with simulations by Minjae Park) (arXiv:2203.07313)&lt;/p&gt;&lt;p&gt;ewaingwynne/complex-sle: builds, no sorry&lt;/p&gt;&lt;p&gt;Code licence: no licence file, so the code is not licensed for reuse&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2203.07313&quot;&gt;arXiv&lt;/a&gt; · &lt;a href=&quot;https://github.com/ewaingwynne/complex-sle&quot;&gt;code&lt;/a&gt; · &lt;a href=&quot;https://pragyaangaur.dev/Paperlane/lean/ewaingwynne/complex-sle.html&quot;&gt;evidence&lt;/a&gt;&lt;/p&gt;</description></item>
</channel>
</rss>
