Imagen de Portada

erdos-ant-verification: An Executable Verification Artifact for the Sawin et al. Lower Bound on the Erdős Unit-Distance Exponent

Fuente: Zenodo

Guardado en:

Detalles Bibliográficos
Autor principal:	Flamehaven Labs
Formato:	Recurso digital
Publicado:	Zenodo 2026
Materias:	erdos-unit-distance algebraic-number-theory golod-shafarevich class-field-tower discrete-geometry combinatorics reproducibility executable-verification mathematical-verification mpmath openai-research sawin-construction
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

erdos-ant-verification: An Executable Verification Artifact for the Sawin et al. Lower Bound on the Erdős Unit-Distance Exponent
por: Yun, Kwansub, et al.
Publicado: (2026)

erdos-ant-verification: An Executable Reproduction Artifact for Equation (2.2) of the Erdős Unit-Distance Disproof Remarks Paper
por: Yun, Kwansub, et al.
Publicado: (2026)

Advances in Combinatorics
Publicado: (2021)

Ars Mathematica Contemporanea
Publicado: (2025)

Combinatorial Theory
Publicado: (2023)

Jurnal Diferensial
Publicado: (2025)

Computer Aided Verification of Relational Models by Strategic Rewriting
por: Claudia M. Necco
Publicado: (2017)

Discrete Mathematics Letters
Publicado: (2019)

Algebraic Combinatorics
Publicado: (2021)

The American Journal of Combinatorics
Publicado: (2023)

Discussiones Mathematicae - General Algebra and Applications
Publicado: (2018)

Commit-Gated Execution for Regulated Artificial Intelligence
por: Pinnock, Lee
Publicado: (2026)

Comptes Rendus. Mathématique
Publicado: (2022)

Claim Verification: "The binary operator eml is defined by the expression \(\text{eml}(a, b) = \exp(a) - \ln(b)\) (where exp is the exponential function and ln is the principal branch of the natural logarithm). For every real \(x > 0\), the nested expression \(\text{eml}(1, \text{eml}(\text{eml}(1, x), 1))\) equals the natural logarithm \(\ln(x)\)." — Proved
por: Proof Engine
Publicado: (2026)

Claim Verification: "The binary operator eml is defined by the expression \(\text{eml}(a, b) = \exp(a) - \ln(b)\). There exists a finite binary tree consisting solely of eml operations, whose 9 leaves are drawn from \(\{1, x, y\}\), such that the tree evaluates exactly to \(x \times y\). The tree has K = 17 tokens (8 eml operations and 9 leaves), and the identity holds for all complex \(x\) and \(y\) (in the algebraic setting where \(\ln \circ \exp\) is the identity)." — Proved
por: Proof Engine
Publicado: (2026)

A Timestamped Priority Note on Thermodynamic Verification Budgets and Mutual-Information Geometry in Relational Physics
por: Panasenko, Alexander
Publicado: (2026)

Transactions on Combinatorics
Publicado: (2013)

SAFIRL: Shielded RL with CBF/MPC on Franka-MuJoCo (v0.1.1)
por: Ozoglu, Nihan
Publicado: (2025)

Jambura Journal of Mathematics
Publicado: (2022)

Welche Beziehung besteht zwischen Durchmesser und Rtex-Wert eines Netzgarns?
por: Dahm, Erdmann
Publicado: (1974)

The Trinity Triangle Proof Paper
por: Needham, Eric
Publicado: (2025)

Enumerative Combinatorics and Applications
Publicado: (2021)

Contemporary Mathematics and Applications (ConMathA)
Publicado: (2024)

Reproducible Replication of the Canonical Bicycle Self-Stability (Meijaard 2007)
por: Peter, Bradley
Publicado: (2025)

Selfie Verification: A Comprehensive Guide to Secure Identity Authentication in the Digital Age
por: Crypto Education Research Lab
Publicado: (2025)

Notes on Number Theory and Discrete Mathematics
Publicado: (2024)

Pracì Mìžnarodnogo Geometričnogo Centru
Publicado: (2015)

EOV Chain Attestation Benchmark: Multi-Hop Delegation Receipt Verification with Linear Scaling
por: Morrow
Publicado: (2026)

Journal of Combinatorial Algebra
Publicado: (2022)

(Technical Note) What the Ceiling Means: Constructive Schools, Physical Actualisation, and the Fine Structure of BISH+LPO (Paper 43, Constructive Reverse Mathematics Series)
por: Lee, Paul Chun-Kit
Publicado: (2026)

Automated contrast painting for position verification in radiotherapy
por: PM Putora
Publicado: (2009)

Journal of Algebraic Systems
Publicado: (2019)

Cauchy: Jurnal Matematika Murni dan Aplikasi
Publicado: (2022)

The Secrets Must Not Flow: Scaling Security Verification to Large Codebases (artifact)
por: Arquint, Linard, et al.
Publicado: (2025)

Lean Aps Recursion Uniformization (Lean formalization)
por: Spivack, Nova
Publicado: (2026)

Lean Observer Non Exhaustability (Lean formalization)
por: Spivack, Nova
Publicado: (2026)

Lean Observer Non Exhaustability (Lean formalization)
por: Spivack, Nova
Publicado: (2026)

Lean Representational Incompleteness (Lean formalization)
por: Spivack, Nova
Publicado: (2026)

Lean Representational Incompleteness (Lean formalization)
por: Spivack, Nova
Publicado: (2026)

Lean Reflexive Closure (Lean formalization)
por: Spivack, Nova
Publicado: (2026)