A Verified Witness Corpus of 2,404 Rooted Permutation Tables of Order 56

This release contains 2,404 explicit finite witnesses encoded as rooted permutation tables of order 56, together with an exact SHA-256 inventory and two independent deterministic verification programs. For every witness, exhaustive verification confirms the required component-table conditions, all 56 root-star tests, all 3,080 rooted route rows, zero matches among 1,552,320 triangle tests, and exactly 110 complete directed pairs among 3,080. Both verifiers recompute every stated predicate directly from the raw witness bytes. Complete per-witness verification records are included. The archive contains exactly 2,404 pairwise byte-distinct encodings. Pairwise nonisomorphism and exhaustive classification are not claimed.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-19
DOI
https://doi.org/10.5281/zenodo.22847321
Primary Topic
Natural Language Processing Techniques
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
preprint

A Verified Witness Corpus of 2,404 Rooted Permutation Tables of Order 56

Nicholas Coleman
Zenodo (CERN European Organization for Nuclear Research)
Natural Language Processing Techniques
preprint

A Verified Witness Corpus of 2,404 Rooted Permutation Tables of Order 56

Nicholas Coleman
preprint en

Abstract

This release contains 2,404 explicit finite witnesses encoded as rooted permutation tables of order 56, together with an exact SHA-256 inventory and two independent deterministic verification programs. For every witness, exhaustive verification confirms the required component-table conditions, all 56 root-star tests, all 3,080 rooted route rows, zero matches among 1,552,320 triangle tests, and exactly 110 complete directed pairs among 3,080. Both verifiers recompute every stated predicate directly from the raw witness bytes. Complete per-witness verification records are included. The archive contains exactly 2,404 pairwise byte-distinct encodings. Pairwise nonisomorphism and exhaustive classification are not claimed.

Zenodo (CERN European Organization for Nuclear Research)
Peace, Justice and strong institutions
Natural Language Processing Techniques
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.