Adjudication as Decoding: Semantic Error-Correction under PSC Closure Paper 43 of the NEMS Suite

Internal adjudication (IIb/PT layer) is reinterpreted as decoding/repair of semantic inconsistency in distributed records. We formalize record fragments as codeword-like constraints and a uniform decoder-claim predicate on encoded instances. Under the SelectorStrength barrier schema (Paper 29), no total-effective decider exists for this predicate over encoded instances when anti-decider closure and a fixed-point premise hold. Stratified decoding is possible; societies improve decoding coverage, and diversity is necessary for strict improvement (Paper 40). A minimal toy (two instance types: consistent / ambiguous) witnesses nontriviality; the barrier applies under the usual strength premises. The development is mechanized in Lean 4 as the ErrorCorrectingClosure library in nems-lean, with zero sorry and no custom axioms. Trust boundary. Decoder-claim barriers assume the Paper 29 package on the encoded domain; stratified decoding and institutional coverage improvements carry their own hypotheses (Paper 40). Mechanization is nems-lean . See .

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-13
DOI
https://doi.org/10.5281/zenodo.22733222
Primary Topic
Distributed systems and fault tolerance
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
preprint

Adjudication as Decoding: Semantic Error-Correction under PSC Closure Paper 43 of the NEMS Suite

Nova Spivack
Zenodo (CERN European Organization for Nuclear Research)
Distributed systems and fault tolerance
preprint

Adjudication as Decoding: Semantic Error-Correction under PSC Closure Paper 43 of the NEMS Suite

Nova Spivack
preprint en

Abstract

Internal adjudication (IIb/PT layer) is reinterpreted as decoding/repair of semantic inconsistency in distributed records. We formalize record fragments as codeword-like constraints and a uniform decoder-claim predicate on encoded instances. Under the SelectorStrength barrier schema (Paper 29), no total-effective decider exists for this predicate over encoded instances when anti-decider closure and a fixed-point premise hold. Stratified decoding is possible; societies improve decoding coverage, and diversity is necessary for strict improvement (Paper 40). A minimal toy (two instance types: consistent / ambiguous) witnesses nontriviality; the barrier applies under the usual strength premises. The development is mechanized in Lean 4 as the ErrorCorrectingClosure library in nems-lean, with zero sorry and no custom axioms. Trust boundary. Decoder-claim barriers assume the Paper 29 package on the encoded domain; stratified decoding and institutional coverage improvements carry their own hypotheses (Paper 40). Mechanization is nems-lean . See .

Zenodo (CERN European Organization for Nuclear Research)
Peace, Justice and strong institutions
Distributed systems and fault tolerance
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.

Adjudication as Decoding: Semantic Error-Correction under PSC Closure Paper 43 of the NEMS Suite — Nova Spivack · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS