CURRENT PUBLICATION VERSION 1.0 - 9 NOVEMBER 2026 (r24)

The main paper and supplement are main-paper.tex and technical-supplement.tex;
final PDFs are in output/pdf/. DOI: 10.5281/zenodo.24051030. Both documents are
Version 1.0 and use the same six approved keywords in print and PDF metadata.
The author selected CC BY 4.0 for the papers and Apache 2.0 for Lean/code.
See LICENSES.txt and licenses/ for the terms and precise scope.

The Zenodo release is the small package only. It includes both papers,
this manuscript/checker archive and the complete Lean source compendium.
The three large historical/offline archives are retained locally and are NOT
included in the deposit. They are not prerequisites for the direct identity,
network and geometry checks or complete Lean source reconstruction. They are
required for their respective historical Python reruns and offline Lean replay.
Compiling the Lean sources requires separately installed pinned dependencies.

This revision changes availability/licensing prose and packaging. All theorem
statements, hypotheses, proofs, labels and abstracts are preserved. The accepted
Lean verification is unchanged. No new kernel replay or full source rebuild
is claimed by these release checks. See verification/*r24.json.

Consistency revision r21 corrected evidence-index section routes and two truncated Lean
theorem headers, clarifies coefficient-field wording, and checks the current
manuscripts, bibliography and proof correspondence. All 26,200 accepted
project source hashes and both import closures were rechecked; Lean was not
executed again. The audit and its limits are in
verification/consistency-report-r21.txt and verification/consistency-audit-r21.json.

The preceding publication revision states the fixed-PM2 arity ceiling and complete width sequence,
adds the exact (10,8) MAX5 network (18 hidden neurons), shortens the main
introduction, moves comparison details to Supplement S12.9, strengthens the
proof references and eight-edge equality explanation, and polishes the figures
and supplement. Existing proof cases and hypotheses are preserved. Both
accepted Lean proof developments and their verification status are unchanged.
The arity ceiling uses the cited geometric obstruction; it is not newly
attributed to the saved Lean roots. The network conversions are exact checked
constructions, not unrestricted neuron-optimality theorems.

FROM AN EXTRACTED paper-source.zip (Python 3.10+, standard library only)

  python3 code/verify_release.py
  python3 code/check_consistency.py
  python3 code/check_upper.py
  python3 code/check_network.py
  python3 code/check_network.py --input evidence/max5-network-10-8.json
  python3 code/check_outer_geometry.py

The first command checks the lightweight release files and source index.
It reports separately whether the optional historical archives are present.
The second command checks current document/evidence navigation and the recorded
formal correspondence. The remaining commands execute exact mathematical checks.
The 9 November construction receipts remain in verification/*r20.json; the
consistency and reference audits are in verification/*r21.json.

HISTORICAL ARCHIVES (retained locally; excluded from the Zenodo deposit)

If these retained archives are separately available, place pm2-source.tar.gz
and max5-project.tar.gz in evidence/, then run:

  python3 code/verify_release.py --archives

The flag requires both archives and checks every archived member. These
archives are deliberately omitted from paper-source.zip. Manifest checks do
not execute Lean or the lower-bound computations. To rerun historical
computational stages, extract the PM2 archive to a new directory and consult:

  python3 code/reproduce_lower.py --help
  python3 code/check_baselines.py --help

LEAN DISTRIBUTIONS (unchanged 8 November editions; only the compendium deposited)

MAX5-MAX6-Lean-Compendium-2026-11-08.zip is the 17.3 MB complete project-source
edition. From its extracted root:

  python3 -I -B tools/compendium.py audit
  python3 -I -B tools/compendium.py expand ../expanded

The expansion destination must not exist. Install Lean 4.32.2 and the pinned
external dependencies separately for Lean execution; the compact ZIP excludes
compiler binaries, libraries and compiled objects. Audit and expansion are
file/source checks, not proof replay. Keep the MAX5 and MAX6 projects separate.

MAX5-MAX6-Lean-Verification-2026-11-08.zip is the locally retained macOS arm64
offline package, excluded from Zenodo. If separately available, use its extracted
root and choose a new work directory:

  python3 -I -B verify.py audit
  python3 -I -B verify.py verify --work ../proof-check

Its README also gives the full MAX6 source-rebuild command and resource limits.
The accepted full MAX6 rebuild is the 31 October checkpoint; the 8 November
standalone package tests and this editorial revision do not relabel a partial
build, source audit, or hash check as a new full proof rebuild.

REBUILDING THE PUBLICATION

The editor documents are assembled in place from sections/ and the native
rational certificates by python3 code/build_documents.py. The current detailed
S13-S15 texts are authored files; do not rerun the historical proof importer to
regenerate them. After final PDF export, update the inventory and lightweight
ZIP with python3 code/make_release.py --edition 2026-11-09, then run both release
integrity modes on the appropriate distributions. The manifest excludes itself,
its ZIP and the final release-integrity and handover receipts to avoid circular hashes.

Current deposit scope: evidence/distributions-r24.json. Historical evidence locators:
evidence/distributions-r21.json,
verification/manuscript-audit-r21.json and verification/reference-audit-r21.json. Historical revision audits below refer
to their frozen editions; they are not commands for checking later prose.

For an additional source-identity/import check against the original project:

  python3 code/check_consistency.py --project-root /path/to/Max5-and-Max6

This optional mode checks all accepted project sources and mapped theorem
types. It does not execute Lean or replace the accepted verification records.

PRESERVED EDITORIAL HISTORY

PREVIOUS SUPPLEMENT UPDATE — 4 NOVEMBER 2026 (r14 prose and worked examples)

S13.5 and S15.7–S15.8 now explain the cost budgets, class counts, source
positions and resulting contradictions in full prose. Broken mathematical
fragments and ambiguous shorthand are repaired. Two worked examples show:
- Page 188: a sole Z=2 cancels an array, but private cost forces five F5
  inactive centers and an impossible active glue sum.
- Page 196: two physical Z columns pass the six-coordinate projection, but
  their full matching-edge content would require 6<=3.
Both examples retain signed rational coefficients and balanced N classes.
They illustrate proved local obstructions; no proof depends on an example.

The frozen r13 baseline contains 213 files. Exact replay checks all 325
recorded edits in the three requested components and reconstructs the complete
standalone source. All 295 original labels, all pre-existing budget-table
rows, and all 26 formal statement/proof environments are preserved; the latter
remain byte-identical. The 38 other authored components, 10 evidence JSONs,
and 18 existing checkers/generators are unchanged. All 297 labels are unique
and all references resolve. The dependency graph is acyclic and retains the
27–31 order and the independent H32 proof before the final retained-29 cases.

The review explicitly retains private25 at R<=29, SZ6 only at C=6, all B11
hypotheses, the h=3 common-block condition, balanced-class cases, physical
star ownership, the full D21 scope and the 68+16 affine/cost split. Seven
intentional manuscript/dependency errors and two example transcription errors
were rejected. Exact rational arithmetic checks both examples. These are
editorial and arithmetic checks, not a new Lean rebuild or kernel replay;
the accepted 31 October formalization checkpoint is unchanged.

The final saved source passed the desktop editor compiler. The PDF has 201
pages, 28 embedded fonts and 84 bookmarks. All pages were rendered; overview
and enlarged checks found no clipping or layout collisions. All 21 case
headings stay with their scope guides, the example setups stay together, and
there are no overfull boxes, missing glyphs or unresolved links/references.
Seven minor underfull-line notices are nonblocking; six were already present.

Current supplement: output/pdf/technical-supplement.pdf (r14).
The main source remains r12; its PDF and the existing two-PDF ZIP remain the
r11 export. The author continues to handle the public artifact deposit.

Records: verification/manuscript-audit-r14.json, dependency-audit-r14.json,
worked-examples-r14.json, editor-compile-r14.json, pdf-layout-r14.json and
pdf-export-r14.json. The baseline, exact edits and scoped equivalence review
are in revision-2026-11-04-r14-prose/.
Re-run current checks with:
  python3 code/audit_prose_revision.py
  python3 code/check_worked_examples.py

PRIOR SUPPLEMENT UPDATE — 4 NOVEMBER 2026 (r13 readability revision)

All five agreed improvements are implemented in the existing supplement:
1. The reading guide precedes the local lemma index. Printed contents give
   a compact section route; all 84 subsection bookmarks remain available.
2. Reusable equations and the pure-helper functional proof have a definitive
   home in S4. S10.1–S10.2 give linked case tables; their complete derivations
   and all specialized hypotheses remain in S15.7–S15.8.
3. All 21 detailed components use Scope / Obstruction / Conclusion guides.
   Repetitive active-cost alternatives are tabulated without changing their
   arguments, and repeated cross-references are shorter.
4. A notation table and vector incidence diagram explain source arrays versus
   physical blocks, physical Z versus endpoint classes, actual versus effective
   stars, the two uses of q, and the coefficient-scaling convention.
5. S12.8 collects implementation paths and execution locators; the mathematical
   input families, predicates and hypotheses remain beside the proofs.

Preservation and dependency checks passed. All 26 pre-existing supplement
statement/proof environments are byte-identical, every old label remains,
and all 295 labels are unique with every reference resolved. The 25 changed
proof-body files reconstruct exactly from 150 recorded edits. The preserved
139-file baseline passed its manifest check. All original mathematical checkers
and evidence JSONs remain unchanged. The complete functional proof was moved,
not shortened. Case coverage is recorded explicitly for the condensed routes.

The dependency audit preserves the order 27,28,29,30,31, the independent
nonmatching branches and H32 before the final retained-29 exclusions. It checks
private25 at R<=29, SZ6 only at C=6, the complete B11 hypotheses, source-array
ownership, the 403-column D21 scope, and the 68+16 affine/cost split. Four
intentional errors were rejected. Graph acyclicity is a structural check;
the scoped replacements were reviewed separately. No new Lean execution or
mathematical certificate execution is claimed. The accepted 31 October
formalization checkpoint is unchanged.

The saved source passed the desktop editor compiler. The new supplement PDF
has 196 pages, compared with 200 in the freshly compiled r12 source baseline.
All pages were rendered and reviewed at overview scale, with enlarged checks
of the changed material. All 28 fonts are embedded, internal links resolve,
and text remains within the page and body bounds. There are no overfull boxes,
missing glyphs or unresolved-reference diagnostics. Six minor underfull-line
notices were visually checked. All 21 case headings stay with their scope guides.

Current supplement: output/pdf/technical-supplement.pdf (r13).
The main-paper source remains the r12 source byte-for-byte. Its PDF and the
existing two-PDF ZIP remain the r11 export; this supplement revision does not
replace them. The author is handling the public artifact deposit separately.

Records: verification/manuscript-audit-r13.json, dependency-audit-r13.json,
editor-compile-r13.json, pdf-layout-r13.json and pdf-export-r13.json.
The baseline, exact edits, scope cards and case-coverage map are preserved in
revision-2026-11-04-r13-readability/. Re-run the preservation audit from this
workspace with: python3 code/audit_readability_revision.py.

PRIOR WORKING-SOURCE UPDATE — 3 NOVEMBER 2026 (r12 referee revisions)

Items 2–4 are implemented in the existing paper and supplement. The author
is handling the public artifact deposit separately.

The MAX5 circuit argument now explicitly invokes a finite, normalized
five-input PM2 profile lemma. S2 gives its histogram rule, complete enumeration
procedure and Lean justification. Independent integer recomputation covered
all 50,625 ordered slot choices, 5,565 projective directions and 120 chambers
per direction. It recovered 91 coordinate/sign orbits and confirmed both
zero/equal-profile top-content facts. This also corrected a count: the 2,626
profiles include zero; there are 2,625 nonzero profiles.

S12.3 prints both MAX5 theorem types and unfolds Attainable, IsOptimal, WStar
and admissibility. It distinguishes rational coefficients from all-real inputs
and preserves the original saved-proof replay scope. The main paper and S4.2
now work through the common-Omega row cancellation. All thirty comparisons
passed exact full-row multiplication; the printed example was checked on
all 1,545 columns. S13–S15 now have 21 case-opening scope/route guides. The
new S12.7 map identifies 25 declarations in 18 modules, plus the two fidelity checks and four final
assembly declarations. Its source files match the accepted preservation
records and its module membership matches the closed theorem import closures.

The approved abstract, all 53 pre-existing statement/proof blocks and every
old label are preserved. The only existing detail-body wording changed is
the completion of an unfinished final scope sentence in the four-center
physical-helper case. Two deliberate transcription errors were rejected by
the new audit. See verification/max5-profile-facts-r12.json,
array-example-r12.json and manuscript-audit-r12.json; the correspondence is
in evidence/lean-correspondence-r12.json. No Lean source was edited and no
new Lean execution is claimed. The accepted 31 October MAX6 checkpoint stands.

Both saved sources passed the desktop editor compiler. The previous PDFs and
the two-PDF ZIP below remain the r11 export; this source revision does not
replace them or claim a new visual PDF review. Sources before this revision
are preserved in revision-2026-11-03-r12-referee/before/.

PRIOR PDF EXPORT — 3 NOVEMBER 2026 (r11)

The updated paper and supplement have been exported, visually reviewed and
packaged in Max5-Max6-Paper-and-Supplement-2026-11-03-r11.zip. It contains
exactly main-paper.pdf (25 pages) and technical-supplement.pdf (192 pages).
The exports include the selected restored abstract and the 51-neuron network
construction. Sources and the previous r7 PDFs are preserved in
revision-2026-11-03-r11-network/pdf-export/before/.

The unchanged MAX6 construction table now precedes its network corollary,
removing an avoidable half-page gap. A missing space in "L_3 support" on
supplement page 54 is corrected. All formal statement/proof blocks and labels
are preserved. Neither mathematical proof execution nor Lean was rerun.

Both final saved sources passed the desktop compiler. All 217 PDF pages were
rendered for overview inspection, with 20 enlarged page checks. Font embedding,
internal destinations, text bounds and compiler diagnostics passed. Six minor
underfull-line notices were visually checked. ZIP member bytes and CRCs passed.
See verification/pdf-export-r11.json, pdf-layout-r11.json,
editor-compile-export-r11.json and manuscript-export-audit-r11.json.

The dated working-source entries below document earlier stages of this edition.

PRIOR WORKING-SOURCE UPDATE — 3 NOVEMBER 2026 (r11 network construction)

The main paper now includes an explicit corollary constructing a zero-bias,
rational MAX6 ReLU network of widths (16,35), totaling 51 hidden neurons.
It gives a short feature-sharing proof and compares the counts 62, 58 and 51
for our generic conversion, the published hexagon implementation and our
shared-feature implementation. The common-conversion directional-width table
retains its original convention. No unrestricted neuron minimum is claimed.

Supplement S12.1 specifies the ordered gates, all feature readouts and the
weight-matrix construction. The full rational matrices are in
evidence/max6-network-16-35.json. The new standard-library checker
code/check_network.py verifies the matrices directly on all real inputs:
1,440 cones, 8,640 generating-ray checks and 3,928 canceled kink groups.
It passed, and three deliberately damaged matrix copies were rejected.
The printed feature readouts and free-term formula match the exported matrices.
See verification/network-16-35-r11.json and network-stress-r11.json.

At the working-source stage, both saved standalone sources passed the
desktop editor's built-in compiler. Explicit project-root compilation was
rejected because this archival folder is too large; standalone compilation
succeeded. The Codex preview was inaccessible to computer use, so that stage
did not include visual review or PDF export. The subsequent PDF export recorded
above completes visual review using Poppler renders and supersedes the r7 PDFs.

The author's selected abstract is unchanged. All 51 pre-existing formal
statement/proof blocks and all old labels are preserved; only the new
network corollary and its proof were added. Both native upper identities
passed fresh exact checks. No Lean compilation or lower-bound replay was
required or claimed for this construction corollary. The accepted PM2
optimality checkpoint remains the completed 31 October 2026 verification.
See verification/manuscript-audit-r11.json and editor-compile-r11.json.
Previous sources and metadata are preserved in
revision-2026-11-03-r11-network/before/.

PRIOR WORKING-SOURCE UPDATE — 2 NOVEMBER 2026 (r10 abstract restored)

At the author's request, the main-paper abstract is restored to the previous
r8 wording, beginning "The maximum function offers a concrete benchmark".
Only the abstract changed; sections/main-front.tex is synchronized with the
open main-paper.tex. The saved source passed the desktop editor's built-in
compiler. The preceding r9 wording and metadata remain preserved.

At that source revision, the exported PDFs and two-PDF ZIP were still the
r7 edition; no PDF export was requested for the abstract edit.
See verification/abstract-revision-r10.json. Previous sources and metadata
are preserved in revision-2026-11-02-r10-abstract-restored/before/.

MAX5 AND MAX6 — MAIN PAPER AND INTEGRAL TECHNICAL SUPPLEMENT
Current sources: supplement r13 (4 November 2026); main paper r12 (3 November 2026)
Current PDF exports: supplement r13 (196 pages); main paper r11 (25 pages)

CURRENT MANUSCRIPTS

main-paper.tex
technical-supplement.tex

Title: Neural Computation: Optimal Pairwise-Max ReLU Representations.
The two documents form one article with an integral technical supplement.
The main paper leads with the exact optima 6 and 33, gives both identities,
and explains the chamber test, canonical transfer and global lower bound.
The abstract and introduction foreground exact neural computation and
distinguish directional optimality from unrestricted neuron minimization.
The sixth edition adds seven focused references, including the October 2026
general two-layer theorem, the hexagon MAX6 identity and the formalized
caterpillar construction. It also adds the normalized 39-direction hexagon
baseline, verified independently on all 720 chambers, and distinguishes its
common (27,41) conversion from the source's tailored (17,41) network.
Transitions through the reduction, local geometry and global lower bound
have been tightened. The 33-term construction is presented in two panels
beside its verification, before the MAX5 lower-bound argument begins.
Three vector illustrations show the representation model, proof dependencies,
and the sixteen private-25 equality cores. A simple three-hinge example explains
why agreement on every Boolean input does not imply an all-real identity.

The seventh edition matches the formatting of the author's Erdős Problem 7
rank-eight, rank-nine and three-prime-divisor papers: native 11-point amsart,
T1 Latin Modern with microtype, AMS margins and running heads, an inset
abstract, centered small-cap section headings, and black hyperlinks. Both
documents use this style. The proof map, long displays, identifiers and tables
were fitted to the narrower column. A duplicate contents entry and an obsolete
forced closing page break were removed; the bibliography was balanced.

The sixth-edition sources, code and PDFs are preserved in
revision-2026-11-02-r7/before/, with their hashes. The mathematical content is
retained. The sole copy-edit beyond layout removes an unmatched closing
parenthesis after S13.1's Ubeta summation; its index and summand are unchanged.
Earlier revisions and verification records remain preserved.

FORMAL STATUS AND SCOPE

Both rational PM2 optima are kernel verified. The original-scope MAX6 theorem
was accepted on 31 October 2026 after a complete 16,057-module PM2 source rebuild,
fresh independent replay of the closed theorem and its all-real projections,
and all eight machine/manual completion audits. See evidence/max6-formalization.json.
Copies of accepted records and the inspected definition/root sources are in
evidence/formalization-2026-10-31/; these compact copies are not the full Lean project.
The full verified project remains at ../../formalization/max6-continuation-2026-10-16/.

The exact formal type is PM2.IsOptimal6 33. It concerns rational coefficients,
all-real input identities, integer InD2 directions, pairwise nonparallel nonzero
hinges, and a rational free feature-linear term. Only propext, Classical.choice,
and Quot.sound occur as axioms. The real-coefficient extension is the written
fixed-support rationalization lemma, not an extra claim about the Lean root.
The external packages' identities and pinned revisions were audited; no independent
external-package source rebuild is claimed. No Lean worker was started for this
manuscript revision. The accepted 31 October verification is cited precisely.

MATHEMATICAL VERIFICATION RETAINED FROM 31 OCTOBER 2026

All 68 stages of code/reproduce_lower.py passed in the fourth edition's new output directory,
including the 16,008,595-node retained-cap-21 search with zero closed supports.
The exact comparison identities were reexpanded and checked on every chamber.
Their directional counts are 105/85, 495/465, 240/180/810, 56, 6 and 33 under
the conventions stated in the paper. Network counts use the same (27,W+2)
conversion for each MAX6 row; they are construction bounds, not network optima.

Both displayed upper identities passed exact chamber, Boolean-ray, translation,
PM2 membership and projective-distinctness checks. Independent slot enumeration
recovered all 5,565 and 22,155 primitive directions. Fourteen deliberately damaged
certificates were rejected. A further impostor passed all Boolean values and the
translation constraint but was rejected for an interior kink. The private-25
figure's histogram (2,12,2) was checked against the reexecuted exact census.

The dated receipts are:
  verification/upper-identity-checks-2026-10-31.json
  verification/baseline-checks-2026-10-31.json
  verification/lower-replay-2026-10-31.json
  verification/manuscript-stress-2026-10-31.json
Full fresh outputs are in revision-2026-10-31-r4/.

CHECKS RETAINED FROM THE FIFTH EDITION

Both displayed identities were checked again on 2 November over all 120 and
720 chambers. The statement/proof environments, displayed equations, source
labels, bibliography and all 39 construction terms were compared with the
preserved fourth edition. The finite lower-bound evidence and accepted Lean
checkpoint are reused; neither the 68-stage lower replay nor Lean was rerun.
See verification/manuscript-audit-r5.json and
revision-2026-11-02-r5/checks/upper-identities.json.

CHECKS FOR THE SIXTH EDITION

All seven new references were checked against primary papers or proceedings.
The Bakaev entry now also identifies its STOC 2026 publication. The three
October papers are explicitly identified as preprints. The cited external
Lean project was not independently rebuilt or audited. Source locators and
scope distinctions are in verification/reference-audit-2026-11-02.json.

The hexagon identity was reconstructed from Definition 3.1 and equation (2)
of arXiv:2610.04256v1. After primitive normalization and orientation adjustment,
it has 39 distinct directions (six mass one, 33 mass two). The unchanged exact
checker passed all 720 chambers, 1,536 interior groups and 64 Boolean inputs.
The (17,41) implementation is attributed to that paper's Corollary 4.2;
this execution verifies the identity and the common (27,W+2) conversion.
Its source forms, normalized certificate and execution receipt are preserved in
evidence/hexagon-2026-11-02/ and verification/hexagon-checks-2026-11-02.json.
Reproduce independently into a new directory:

  python3 code/check_hexagon.py --output new-hexagon-check

Both of our identities passed fresh all-chamber checks in the sixth edition;
see verification/upper-identity-checks-2026-11-02-r6.json. All original formal
statements, proof environments, displayed equations, construction terms and
labels remain unchanged. The supplement adds S12.1's comparison record, updates
the upper-check receipt, and renders S12.2's literal --archives option correctly. The main lower-bound sections
and all 17 pre-existing evidence files are unchanged. Neither Lean nor the
global lower-bound checks were rerun. The accepted 31 October evidence remains
the proof checkpoint. See verification/manuscript-audit-r6.json.

CHECKS FOR THE SEVENTH EDITION

Both saved sources passed the editor's built-in compiler. The PDFs contain
24 main-paper pages and 190 supplement pages. All pages were rendered for
layout review, with enlarged inspection of the title pages, contents, changed
displays, tables, identifiers and closing references. Fonts are embedded,
internal links resolve, and there are no overfull boxes, unresolved references
or missing characters. Five minor underfull-line notices were visually checked.

The complete document bodies were compared against the sixth edition after
explicit layout normalization and the one documented punctuation correction.
All 51 formal statement/proof environments, 344 labels, 39 construction terms,
and 15 bibliographic entries are preserved. All 21 existing evidence files
and mathematical checker sources remain byte-identical. No Lean rebuild,
kernel replay or mathematical certificate execution was run for this revision.
The accepted proof checkpoint and earlier receipts retain their original dates.
The historical proof-integration map retains its original output hashes; the
r7 audit and release inventory record the current formatted sources.

See verification/manuscript-audit-r7.json, verification/editor-compile-r7.json,
verification/pdf-layout-r7.json, and
revision-2026-11-02-r7/reference/style-source.json.

EDITING AND EXPORT

The editor's existing standalone sources are maintained in place. Authored
components live in sections/, including four TikZ figures. Reassemble with:

  python3 code/build_documents.py

The 21 detailed component files in sections/details/ and their assembled copy
in sections/supp-details.tex must stay synchronized; the r13 audit checks this.
Do not rerun code/build_proof_details.py on this edition: it is an archival
importer and would replace subsequent reviewed proof and scope edits.

The generated construction tables use evidence/max5-upper.json and max6-upper.json.
The two standalone TeX files contain every figure and need no external images.
Use the desktop editor's built-in compiler to check saved sources. To export:

  tectonic --outdir output/pdf main-paper.tex
  tectonic --outdir output/pdf technical-supplement.tex

The final PDFs are output/pdf/main-paper.pdf and output/pdf/technical-supplement.pdf.
The existing two-PDF ZIP is Max5-Max6-Paper-and-Supplement-2026-11-03-r11.zip;
it still contains the r11 paper and supplement. The current r13 supplement PDF
is newer. Its exact source/PDF hashes and layout checks are recorded in
verification/pdf-export-r13.json and verification/pdf-layout-r13.json.
The r11 export records continue to describe the unchanged older ZIP.

REPRODUCTION AND PRESERVATION

Python 3.10+ and its standard library suffice for the direct checkers; the lower
replay additionally needs a C++17 compiler and the preserved PM2 source snapshot.
Always use a new output directory and retain earlier receipts:

  python3 code/check_upper.py
  python3 code/check_baselines.py --source-root unpacked/pm2-source --output new-baselines
  python3 code/reproduce_lower.py --source-root unpacked/pm2-source --output new-lower

The two historical archives in evidence/ and their member manifests are unchanged.
The historical source index and proof-integration map retain original identifiers.
A file hash is evidence of identity; it is not a mathematical execution.
Refresh the local inventory after intentional edits with:

  python3 code/make_release.py --inventory-only
  python3 code/verify_release.py --archives

The public deposit is still the author's outstanding submission step. It must
include the executable evidence and complete formal development, with usable
instructions and pinned dependencies. Its persistent identifier must then be
added to both manuscripts. The two-PDF ZIP contains only the paper and supplement.
