An Information-Theoretic One-Erasure Coefficient for Gravity: Finite Counting, Empirical Comparison, and Limits

An Information-Theoretic One-Erasure Coefficient for Gravity: Finite Counting, Empirical Comparison, and Limits. Derives the dimensionless coefficient of a horizon-fed gravity relation from a finite record census rather than fitting it. Direct enumeration shows the leading virtual-gravity process contains exactly one non-unitary service-event slot; billed as one erasure under a named monitoring identification, and combined with an independently derived walk support, this gives C_loop = 3/2 and K_LO = 205.554 with no continuous parameter adjusted. A second-order calculation, its candidate map and decision bar frozen before comparison, adds one counted term to give K_NLO = 206.554. The comparison value K_data = 206.49 is assembled from the QCD anchor, the Hubble rate and the dark-energy fraction, each soft enough to move it by more than the residual, so the leading and second-order coefficients cannot be separated by the data: the result is graded consistent-with, not a derivation of Newton's constant or an intrinsic Planck scale. Includes the full premise ledger, competing readings of the same ledger, registered falsifiers, previously failed claims, and a reproduction script pinning four physics gates. This record is part of the finite-QEC substrate / It-from-Bit publication refresh.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-12
DOI
https://doi.org/10.5281/zenodo.22727972
Primary Topic
Particle physics theoretical and experimental studies
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

An Information-Theoretic One-Erasure Coefficient for Gravity: Finite Counting, Empirical Comparison, and Limits

David Elliman
Zenodo (CERN European Organization for Nuclear Research)
Particle physics theoretical and experimental studies
preprint

An Information-Theoretic One-Erasure Coefficient for Gravity: Finite Counting, Empirical Comparison, and Limits

David Elliman
preprint en

Abstract

An Information-Theoretic One-Erasure Coefficient for Gravity: Finite Counting, Empirical Comparison, and Limits. Derives the dimensionless coefficient of a horizon-fed gravity relation from a finite record census rather than fitting it. Direct enumeration shows the leading virtual-gravity process contains exactly one non-unitary service-event slot; billed as one erasure under a named monitoring identification, and combined with an independently derived walk support, this gives C_loop = 3/2 and K_LO = 205.554 with no continuous parameter adjusted. A second-order calculation, its candidate map and decision bar frozen before comparison, adds one counted term to give K_NLO = 206.554. The comparison value K_data = 206.49 is assembled from the QCD anchor, the Hubble rate and the dark-energy fraction, each soft enough to move it by more than the residual, so the leading and second-order coefficients cannot be separated by the data: the result is graded consistent-with, not a derivation of Newton's constant or an intrinsic Planck scale. Includes the full premise ledger, competing readings of the same ledger, registered falsifiers, previously failed claims, and a reproduction script pinning four physics gates. This record is part of the finite-QEC substrate / It-from-Bit publication refresh.

Zenodo (CERN European Organization for Nuclear Research)
Catholic University of Mozambique (MZ)
Peace, Justice and strong institutions
Particle physics theoretical and experimental studies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.