Generative Structural Theory v1.114 — Complete-Chain Continuation from Recorded One-Step Witnesses at M4

This version studies complete-chain continuation from seven recorded one-step witnesses at leaf 12, side 1, of the reduced state following the first step #4 of the fixed eighteen-node input M4. A complete chain is a sequence from the initial relation h to the bidirected target tree P_S, consisting of inclusion-minimal strongly connected relations contained in h ∪ P_S, with at most two pairs deleted at each transition. The deletion budget applies to transitions of the complete chain on the original eighteen vertices. Version v1.112 established such a chain through the saved witness with additional deletion D = {(0, 7)}. The present version combines that existing record with continuation runs from the six remaining saved witnesses under the same fixed construction, allowing one additional deleted pair in each subsequent one-sided move. Two further complete chains are obtained, through the witnesses with D = {(0, 10)} and D = {(10, 15)}. Each new chain has eleven relations and ten transitions, compared with thirteen relations and twelve transitions in the previously recorded chain. No claim of shortestness is made. For the other four saved witnesses, the construction terminates below its resource limits without finding a chain. These outcomes are reported as NOT_FOUND_WITHIN_OPERATIONS; they do not establish the absence of complete chains. Comparison of the three explicit chains shows that the set of pairs outside P_S strictly decreases at every transition, while the number of missing target pairs also decreases. One chain temporarily deletes the target pair (0, 10) before restoring it. These are properties of the recorded chains, not general continuation guarantees. A local comparison identifies a specific obstruction in a recorded state of S8. Removing leaf 4 isolates W = {0, 10, 15} in both directions, and neither remaining target-tree leaf satisfies the conditions of any move allowed by the fixed construction. Proposition 1 establishes this local obstruction. It does not exclude all legal transitions under deletion budget two or all complete chains from the starting witness. The distribution includes the paper in PDF and TXT formats, a supplementary text, and a verification archive containing inputs, saved witnesses, complete chains, checking programs, construction code, execution instructions, and SHA-256 checksums. Rechecking the packaged chains and controls produced the expected outcomes. The general question (Q1) remains open.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-12
DOI
https://doi.org/10.5281/zenodo.24161032
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.114 — Complete-Chain Continuation from Recorded One-Step Witnesses at M4

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

Generative Structural Theory v1.114 — Complete-Chain Continuation from Recorded One-Step Witnesses at M4

Koji Okino
preprint en

Abstract

This version studies complete-chain continuation from seven recorded one-step witnesses at leaf 12, side 1, of the reduced state following the first step #4 of the fixed eighteen-node input M4. A complete chain is a sequence from the initial relation h to the bidirected target tree P_S, consisting of inclusion-minimal strongly connected relations contained in h ∪ P_S, with at most two pairs deleted at each transition. The deletion budget applies to transitions of the complete chain on the original eighteen vertices. Version v1.112 established such a chain through the saved witness with additional deletion D = {(0, 7)}. The present version combines that existing record with continuation runs from the six remaining saved witnesses under the same fixed construction, allowing one additional deleted pair in each subsequent one-sided move. Two further complete chains are obtained, through the witnesses with D = {(0, 10)} and D = {(10, 15)}. Each new chain has eleven relations and ten transitions, compared with thirteen relations and twelve transitions in the previously recorded chain. No claim of shortestness is made. For the other four saved witnesses, the construction terminates below its resource limits without finding a chain. These outcomes are reported as NOT_FOUND_WITHIN_OPERATIONS; they do not establish the absence of complete chains. Comparison of the three explicit chains shows that the set of pairs outside P_S strictly decreases at every transition, while the number of missing target pairs also decreases. One chain temporarily deletes the target pair (0, 10) before restoring it. These are properties of the recorded chains, not general continuation guarantees. A local comparison identifies a specific obstruction in a recorded state of S8. Removing leaf 4 isolates W = {0, 10, 15} in both directions, and neither remaining target-tree leaf satisfies the conditions of any move allowed by the fixed construction. Proposition 1 establishes this local obstruction. It does not exclude all legal transitions under deletion budget two or all complete chains from the starting witness. The distribution includes the paper in PDF and TXT formats, a supplementary text, and a verification archive containing inputs, saved witnesses, complete chains, checking programs, construction code, execution instructions, and SHA-256 checksums. Rechecking the packaged chains and controls produced the expected outcomes. The general question (Q1) remains open.

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