arxiv: 2601.12194 · v1 · submitted 2026-01-17 · 💻 cs.IT

Recognition: 3 theorem links

· Lean Theorem

Coherent Comparison as Information Cost: A Cost-First Ledger Framework for Discrete Dynamics

Sebastian Pardo-Guerra , Megan Simons , Anil Thapa , Jonathan Washburn

Authors on Pith 2 claimed

Megan Simons ORCID verified
Jonathan Washburn ORCID verified

Pith reviewed 2026-05-14 22:04 UTC · model grok-4.3

classification 💻 cs.IT

keywords ratio costreciprocal functionaldiscrete ledgerdouble-entryscalar potentialcycle closurediscrete dynamics

0 comments

The pith

Requiring coherent multiplicative chaining on ratio costs plus quadratic calibration at unity forces a unique reciprocal functional that produces balanced double-entry ledgers and unique scalar potentials on graphs.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper constructs an information cost on ratios x = a/b that must compose coherently when ratios multiply. Normalization at equilibrium together with quadratic calibration at x=1 selects the single functional J(x) = ½(x + x⁻¹) – 1. This cost is inserted into a minimal discrete ledger on directed graphs; deterministic update rules and the absence of intra-tick ordering then require atomic ticks and balanced double-entry postings. Imposing cycle closure over finite time windows converts cumulative flows into path-independent quantities, so each connected component admits a scalar potential defined up to an additive constant.

Core claim

The functional J(x) = ½(x + x⁻¹) – 1 is the unique reciprocal cost satisfying coherent composition under multiplication, vanishing only at unity, and diverging at the boundaries. When used to record recognition events on graphs, the same structural constraints force every posting to be balanced; time-aggregated clearing over cycles then yields a unique scalar potential on each connected component via a discrete Poincaré lemma.

What carries the argument

The reciprocal cost functional J(x) = ½(x + x⁻¹) – 1, which measures deviation from ratio equilibrium and enforces multiplicative coherence, balanced postings, and path-independent potentials under cycle closure.

If this is right

Every atomic update must post equal and opposite ledger entries.
Scalar potentials exist and are unique up to constants on each connected component once cycles are cleared.
On the d-dimensional hypercube the minimal closed schedule requires exactly 2^d ticks.
No sources or sinks are admissible; total quantity is conserved on every component.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same cost structure may supply an explicit divergence for ratio-based statistical models outside graph dynamics.
Economic or physical systems whose observed flows remain path-dependent after finite clearing would falsify the cycle-closure hypothesis.
Gray-code realizations on hypercubes suggest efficient synchronous update schedules for distributed ledgers.

Load-bearing premise

That the cost must be exactly reciprocal, quadratically calibrated at unity, and cleared over finite windows without intra-tick ordering information.

What would settle it

A concrete discrete dynamical system obeying the stated conservation and locality rules yet exhibiting either non-reciprocal costs or cycle flows that remain path-dependent after finite-window clearing.

read the original abstract

We develop an information-theoretic framework for discrete dynamics grounded in a comparison-cost functional on ratios. Given two quantities compared via their ratio \(x=a/b\), we assign a cost \(F(x)\) measuring deviation from equilibrium (\(x=1\)). Requiring coherent composition under multiplicative chaining imposes a d'Alembert functional equation; together with normalization (\(F(1)=0\)) and quadratic calibration at unity, this yields a unique reciprocal cost functional (proved in a companion paper): \[ J(x) = \tfrac{1}{2}\bigl(x + x^{-1}\bigr) - 1. \] This cost exhibits reciprocity \(J(x)=J(x^{-1})\), vanishes only at \(x=1\), and diverges at boundary regimes \(x\to 0^+\) and \(x\to\infty\), excluding ``nothingness'' configurations. Using \(J\) as input, we introduce a discrete ledger as a minimal lossless encoding of recognition events on directed graphs. Under deterministic update semantics and minimality (no intra-tick ordering metadata), we derive atomic ticks (at most one event per tick). Explicit structural assumptions (conservation, no sources/sinks, pairwise locality, quantization in \(δ\mathbb{Z}\)) force balanced double-entry postings and discrete ledger units. To obtain scalar potentials on graphs with cycles while retaining single-edge impulses per tick, we impose time-aggregated cycle closure (no-arbitrage/clearing over finite windows). Under this hypothesis, cycle closure is equivalent to path-independence, and the cleared cumulative flow admits a unique scalar potential on each connected component (up to additive constant), via a discrete Poincaré lemma. On hypercube graphs \(Q_d\), atomicity imposes a \(2^d\)-tick minimal period, with explicit Gray-code realization at \(d=3\). The framework connects ratio-based divergences, conservative graph flows, and discrete potential theory through a coherence-forced cost structure.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper sketches a cost-first ledger that turns a reciprocal ratio functional into balanced flows and scalar potentials on graphs, but the uniqueness of J(x) is deferred to a companion and the rest follows from structural axioms that are not checked quantitatively here.

read the letter

The central move is to start from coherent multiplicative composition on ratios, add normalization and quadratic calibration at 1, and obtain J(x) = ½(x + x⁻¹) − 1. That functional is then used to define atomic ledger ticks whose cumulative cleared flows admit a scalar potential via a discrete Poincaré argument. The ledger construction and the cycle-closure step are the parts that feel fresh; they give a concrete bookkeeping interpretation to what would otherwise be just another divergence. The abstract is clear about the assumptions (conservation, no intra-tick ordering, time-aggregated clearing) and states where the uniqueness proof lives, so the reader is not misled. What is missing is any derivation or even a sketch of how the functional equation plus calibration forces exactly that J; without the companion the forcing claim cannot be assessed. The quadratic calibration itself is presented as a modeling choice rather than derived, and there is no indication of how sensitive the later results are if that scale is relaxed or if the no-arbitrage window is altered. Because the work is still at the level of an abstract plus outline, it is hard to judge whether the graph-theoretic consequences are robust or mainly artifacts of the chosen axioms. The paper is aimed at readers already working on ratio-based divergences, conservative flows on graphs, or discrete potential theory; those groups will find the ledger translation useful to think about even if they ultimately reject some of the assumptions. It is worth sending to referees provided the companion is supplied and the authors are asked to quantify how much the conclusions depend on the calibration and the clearing window.

Referee Report

2 major / 1 minor

Summary. The manuscript proposes an information-theoretic framework for discrete dynamics in which a comparison cost on ratios x = a/b is derived from a d'Alembert functional equation together with normalization F(1)=0 and quadratic calibration at unity. The resulting unique reciprocal cost J(x) = ½(x + x⁻¹) − 1 is asserted to force balanced double-entry postings on directed graphs, atomic ticks, and, under time-aggregated cycle closure, a unique scalar potential on each connected component via a discrete Poincaré lemma. The uniqueness step is deferred to a companion paper; the ledger constructions and potential existence are presented as consequences of this cost together with structural axioms (conservation, no sources/sinks, pairwise locality, quantization). Explicit realizations are given on hypercube graphs Q_d.

Significance. If the uniqueness claim and the forcing arguments hold, the work supplies a cost-first derivation that links ratio-based divergences to conservative flows and discrete potentials, offering a principled route from multiplicative coherence to double-entry accounting and potential theory on graphs. The explicit Gray-code construction on Q_3 and the 2^d-periodic atomicity result on hypercubes constitute concrete, falsifiable predictions.

major comments (2)

[Abstract] Abstract, paragraph 1: the uniqueness of J(x) under the d'Alembert equation, F(1)=0 and quadratic calibration is stated as proved in a companion paper but is not derived or even sketched here. Because every subsequent structural claim (balanced postings, atomic ticks, existence of the scalar potential) rests on this uniqueness, the central forcing argument cannot be verified from the present text.
[Abstract] Abstract, paragraph 2: the equivalence between time-aggregated cycle closure and path-independence (discrete Poincaré lemma) is asserted under the additional hypotheses of deterministic updates, minimality, and no intra-tick ordering. No quantitative check is supplied showing that these hypotheses are necessary rather than sufficient; relaxing any one of them is said to destroy uniqueness, yet no counter-example or sensitivity statement appears.

minor comments (1)

[Abstract] Notation: the symbol J is introduced after F; a single consistent symbol throughout would reduce reader load.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and for identifying the two points that most affect verifiability. We address each comment below and will revise the manuscript to incorporate the requested material.

read point-by-point responses

Referee: [Abstract] Abstract, paragraph 1: the uniqueness of J(x) under the d'Alembert equation, F(1)=0 and quadratic calibration is stated as proved in a companion paper but is not derived or even sketched here. Because every subsequent structural claim (balanced postings, atomic ticks, existence of the scalar potential) rests on this uniqueness, the central forcing argument cannot be verified from the present text.

Authors: We agree that a self-contained sketch is necessary. The revised manuscript will contain a compact derivation of the uniqueness result (the functional equation, normalization, and quadratic calibration steps) together with a forward reference to the companion paper for the complete proof. revision: yes
Referee: [Abstract] Abstract, paragraph 2: the equivalence between time-aggregated cycle closure and path-independence (discrete Poincaré lemma) is asserted under the additional hypotheses of deterministic updates, minimality, and no intra-tick ordering. No quantitative check is supplied showing that these hypotheses are necessary rather than sufficient; relaxing any one of them is said to destroy uniqueness, yet no counter-example or sensitivity statement appears.

Authors: We will add a short sensitivity paragraph that states the necessity of each hypothesis and supplies one explicit counter-example (a non-minimal intra-tick ordering on a 4-cycle that permits a non-zero cleared potential) to demonstrate loss of uniqueness when minimality is dropped. revision: yes

Circularity Check

1 steps flagged

Uniqueness of J(x) asserted solely via companion paper; all ledger claims rest on it

specific steps

self citation load bearing [Abstract, paragraph 1]
"Requiring coherent composition under multiplicative chaining imposes a d'Alembert functional equation; together with normalization (F(1)=0) and quadratic calibration at unity, this yields a unique reciprocal cost functional (proved in a companion paper): J(x)=½(x+x⁻¹)−1."

The paper presents J as the forced unique outcome of its axioms, yet supplies no proof and defers entirely to a companion paper. All downstream ledger constructions are declared to follow from this uniqueness; without an independent derivation the chain is load-bearing self-citation.

full rationale

The derivation chain begins with the d'Alembert equation plus normalization and quadratic calibration, then immediately invokes a companion paper for the claim that these axioms force the unique solution J(x)=½(x+x⁻¹)−1. No derivation or sketch appears in the present text. Every subsequent step—balanced double-entry, atomic ticks, time-aggregated cycle closure, and the discrete Poincaré lemma yielding a scalar potential—is stated to follow from this J. Because the uniqueness step is external and self-cited, the entire forcing argument reduces to that citation.

Axiom & Free-Parameter Ledger

1 free parameters · 2 axioms · 0 invented entities

The framework rests on four explicit structural assumptions (conservation, no sources/sinks, pairwise locality, quantization in δℤ) plus the quadratic calibration that fixes the scale of J; these are introduced to obtain uniqueness and are not derived from more primitive principles within the paper.

free parameters (1)

quadratic calibration scale at unity
The demand that J be quadratic near x=1 fixes the leading coefficient and thereby sets the overall scale of the cost; this choice is not forced by the functional equation alone.

axioms (2)

domain assumption Coherent composition under multiplicative chaining implies the d'Alembert functional equation
Invoked to obtain uniqueness of J; stated in the abstract as the central modeling step.
domain assumption Time-aggregated cycle closure (no-arbitrage) over finite windows
Required to guarantee path-independence and the existence of a scalar potential.

pith-pipeline@v0.9.0 · 5644 in / 1585 out tokens · 26395 ms · 2026-05-14T22:04:28.776765+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith.Foundation.LogicAsFunctionalEquation RCL_is_unique_functional_form_of_logic matches

?

matches
MATCHES: this paper passage directly uses, restates, or depends on the cited Recognition theorem or module.

Requiring coherent composition under multiplicative chaining together with normalization (F(1)=0) and quadratic calibration at unity yields the unique reciprocal cost J(x)=½(x+x⁻¹)−1
IndisputableMonolith.Foundation.LawOfExistence defect_zero_iff_one; nothing_cannot_exist matches

?

matches
MATCHES: this paper passage directly uses, restates, or depends on the cited Recognition theorem or module.

This cost exhibits reciprocity J(x)=J(x⁻¹), vanishes only at x=1, and diverges at boundary regimes x→0⁺ and x→∞
IndisputableMonolith.Foundation.LedgerForcing conservation_from_balance; add_event_balanced_list matches

?

matches
MATCHES: this paper passage directly uses, restates, or depends on the cited Recognition theorem or module.

Under deterministic update semantics and minimality (no intra-tick ordering metadata), we derive atomic ticks (at most one event per tick). Explicit structural assumptions (conservation, no sources/sinks, pairwise locality, quantization in δℤ) force balanced double-entry postings

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

The Cactus Criterion: When Nonlinear Hodge Theory Reduces to Linear on Graphs
math.CO 2026-04 unverdicted novelty 7.0

The nonlinear selector Picc coincides with the linear Hodge projector PiH on all cochains precisely when the graph is a cactus.