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

This version establishes three pairwise distinct complete chains through the recorded start witness S7 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 pairs deleted at each transition. The present construction preserves the recorded start witness S7 and the saved path to state 55, then changes the witness of a one-sided move at leaf 6, side 1, with D = {(2,4)}. Exhaustive evaluation of all 8,192 subsets of the thirteen candidate pairs under condition (E) of Lemma ϗ1 of v1.88 yields exactly four legal witnesses: the recorded witness B0 = {(4,17),(17,4)} and three alternatives, {(5,14),(14,5)}, {(9,16),(14,5)}, and {(9,16),(16,9)}. All three alternatives pass the next three fixed operations: case (i) at leaves 2 and 6, followed by case (ii) at leaf 8. At the resulting states, removing leaf 4 leaves two internally strongly connected parts. The recorded witness B0 supplies no pair between these parts, whereas each alternative supplies a pair in each direction. Consequently, case (i) at leaf 4 is available for all three alternatives. This is a local statement about the specified relations; it does not by itself guarantee a complete chain. After these fixed operations and case (i) at leaf 4, continuation under the unchanged search rules yields complete chains with 11, 12, and 11 relations, respectively, corresponding to 10, 11, and 10 transitions. Each chain passes all four existing checks, including verification that it passes through the recorded start witness S7. The three chains are pairwise distinct and are compared with the five previously recorded chains through S3, S4, S6, and S8. Complete chains are therefore confirmed for five of the seven saved start witnesses S3–S9: S3, S4, S6, S7, and S8. No new complete chain is constructed for S5 or S9 in this version. Failure of the earlier construction to find a chain does not establish nonexistence, no shortest-chain claim is made, and the general question (Q1) remains open. The accompanying supplement and verification archive provide the inputs, code, chains, checks, comparisons, and provenance records. All twelve checks of the three S7 chains were also successfully rerun from a fresh extraction of the distributed archive. These are computational checks performed on the author's side, not independent verification by a third party.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-13
DOI
https://doi.org/10.5281/zenodo.24165284
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.116 — Witness Choice and Complete-Chain Continuation from S7 at M4

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

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

Koji Okino
preprint en

Abstract

This version establishes three pairwise distinct complete chains through the recorded start witness S7 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 pairs deleted at each transition. The present construction preserves the recorded start witness S7 and the saved path to state 55, then changes the witness of a one-sided move at leaf 6, side 1, with D = {(2,4)}. Exhaustive evaluation of all 8,192 subsets of the thirteen candidate pairs under condition (E) of Lemma ϗ1 of v1.88 yields exactly four legal witnesses: the recorded witness B0 = {(4,17),(17,4)} and three alternatives, {(5,14),(14,5)}, {(9,16),(14,5)}, and {(9,16),(16,9)}. All three alternatives pass the next three fixed operations: case (i) at leaves 2 and 6, followed by case (ii) at leaf 8. At the resulting states, removing leaf 4 leaves two internally strongly connected parts. The recorded witness B0 supplies no pair between these parts, whereas each alternative supplies a pair in each direction. Consequently, case (i) at leaf 4 is available for all three alternatives. This is a local statement about the specified relations; it does not by itself guarantee a complete chain. After these fixed operations and case (i) at leaf 4, continuation under the unchanged search rules yields complete chains with 11, 12, and 11 relations, respectively, corresponding to 10, 11, and 10 transitions. Each chain passes all four existing checks, including verification that it passes through the recorded start witness S7. The three chains are pairwise distinct and are compared with the five previously recorded chains through S3, S4, S6, and S8. Complete chains are therefore confirmed for five of the seven saved start witnesses S3–S9: S3, S4, S6, S7, and S8. No new complete chain is constructed for S5 or S9 in this version. Failure of the earlier construction to find a chain does not establish nonexistence, no shortest-chain claim is made, and the general question (Q1) remains open. The accompanying supplement and verification archive provide the inputs, code, chains, checks, comparisons, and provenance records. All twelve checks of the three S7 chains were also successfully rerun from a fresh extraction of the distributed archive. These are computational checks performed on the author's side, not independent verification by a third party.

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