Generative Structural Theory v1.115 — Witness Choice and Complete-Chain Continuation from S8 at M4

This version establishes two complete chains through the recorded start witness S8 of the fixed eighteen-node input M4, for which the construction used in v1.114 found no complete chain. A complete chain runs from the initial relation h to the bidirected target tree P_S through inclusion-minimal strongly connected relations contained in h ∪ P_S, with at most two ordered pairs deleted at each transition. The investigation fixes the one-sided move at leaf 6, side 1, with D = {(2,4)} at the saved reduced state 47 of S8. Exhaustive evaluation of condition (E) over all 4096 subsets of twelve candidate pairs yields exactly three legal witnesses: {(4,17),(17,4)}, {(10,16),(16,10)}, and {(14,15),(15,14)}. A local lemma identifies the boundary pairs of W = {0,10,15} after three prescribed reductions. With the recorded witness {(4,17),(17,4)}, deleting leaf 4 leaves W disconnected from its complement. Each alternative witness avoids this obstruction, makes the remaining relation strongly connected, and permits case (i) at leaf 4. The modified construction m4alt_v1115_01 replays the saved prefix, substitutes one of the two alternative witnesses, performs the prescribed local operations, and then continues with the search order and witness rule of v1.114. Each alternative yields a complete chain of eleven relations and ten transitions on the original eighteen nodes. Both chains pass four verification checks, including confirmation that they pass through the saved start step of S8. The eight verification commands for these two saved chains were also rerun successfully from the distributed ZIP. The two chains share their first five relations, differ at indices 5–8, and coincide again at index 9 before reaching P_S. Complete chains are therefore confirmed through four of the seven recorded start witnesses: S3, S4, S6, and S8. These results concern the specified input, move, witnesses, and continuation procedure. Failure of the recorded witness along the prescribed local path does not establish the absence of another complete continuation from it. S5, S7, and S9 remain without a chain found by the construction of v1.114, and the general two-deletion chain question (Q1) remains open. The distribution includes the paper in PDF and plain text, supplementary records, a verification ZIP containing inputs, chains, code, and verification instructions, a distribution README, and a SHA-256 manifest.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-13
DOI
https://doi.org/10.5281/zenodo.24164098
Primary Topic
Advanced Graph Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Generative Structural Theory v1.115 — Witness Choice and Complete-Chain Continuation from S8 at M4

Koji Okino
10 links
Zenodo (CERN European Organization for Nuclear Research)
Advanced Graph Theory Research
preprint

Generative Structural Theory v1.115 — Witness Choice and Complete-Chain Continuation from S8 at M4

Koji Okino
preprint en

Abstract

This version establishes two complete chains through the recorded start witness S8 of the fixed eighteen-node input M4, for which the construction used in v1.114 found no complete chain. A complete chain runs from the initial relation h to the bidirected target tree P_S through inclusion-minimal strongly connected relations contained in h ∪ P_S, with at most two ordered pairs deleted at each transition. The investigation fixes the one-sided move at leaf 6, side 1, with D = {(2,4)} at the saved reduced state 47 of S8. Exhaustive evaluation of condition (E) over all 4096 subsets of twelve candidate pairs yields exactly three legal witnesses: {(4,17),(17,4)}, {(10,16),(16,10)}, and {(14,15),(15,14)}. A local lemma identifies the boundary pairs of W = {0,10,15} after three prescribed reductions. With the recorded witness {(4,17),(17,4)}, deleting leaf 4 leaves W disconnected from its complement. Each alternative witness avoids this obstruction, makes the remaining relation strongly connected, and permits case (i) at leaf 4. The modified construction m4alt_v1115_01 replays the saved prefix, substitutes one of the two alternative witnesses, performs the prescribed local operations, and then continues with the search order and witness rule of v1.114. Each alternative yields a complete chain of eleven relations and ten transitions on the original eighteen nodes. Both chains pass four verification checks, including confirmation that they pass through the saved start step of S8. The eight verification commands for these two saved chains were also rerun successfully from the distributed ZIP. The two chains share their first five relations, differ at indices 5–8, and coincide again at index 9 before reaching P_S. Complete chains are therefore confirmed through four of the seven recorded start witnesses: S3, S4, S6, and S8. These results concern the specified input, move, witnesses, and continuation procedure. Failure of the recorded witness along the prescribed local path does not establish the absence of another complete continuation from it. S5, S7, and S9 remain without a chain found by the construction of v1.114, and the general two-deletion chain question (Q1) remains open. The distribution includes the paper in PDF and plain text, supplementary records, a verification ZIP containing inputs, chains, code, and verification instructions, a distribution README, and a SHA-256 manifest.

Zenodo (CERN European Organization for Nuclear Research)
Advanced Graph Theory Research
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.

Laika access coming soon