Problem packetResearch packetR327
Isomorph-free connected graph corpus manifest
Link to a section
Executable material is recorded. Successful replay is a separate check.
Recorded status: available
Recorded scope: one graph6 representative of every connected simple graph isomorphism class on eight vertices
Complete recorded scope and conditions
{
"kind": "bounded",
"statement": "one graph6 representative of every connected simple graph isomorphism class on eight vertices",
"bounds": {
"vertices": {
"min": 8,
"max": 8
},
"graph6_records": {
"min": 11117,
"max": 11117
}
},
"exhaustive": true
}Originating problem: Largest subtour-LP gap among eight-vertex graph metrics
Source files are not attached to this record. Check the recorded source for access.
Recorded relationships: Exact isomorph-free sweep remains to be run
Authored record and scope
- Authored title
- Isomorph-free connected graph corpus manifest
- Record type
- artifact
- Stored status
- available
- Evidence grade
- executable
- Recorded scope data
- { "kind": "bounded", "statement": "one graph6 representative of every connected simple graph isomorphism class on eight vertices", "bounds": { "vertices": { "min": 8, "max": 8 }, "graph6_records": { "min": 11117, "max": 11117 } }, "exhaustive": true }
- Linked research record IDs
- R329
2Authored explanation
Running `geng -cq 8` with nauty 2.6r6 produced 11,117 newline-terminated graph6 records. The resulting file has SHA-256 digest `37010dfb9ca35c86bcbfd488c3e4cadcb3e918dc8c6acebd81ea966e79c35a84`. Brendan McKay's official graph-data page independently lists 11,117 connected isomorphism classes on eight vertices.
This manifest fixes the finite input to the eventual universal sweep. The digest is version-and-order specific. A sweep using a newer nauty release may order the same isomorphism classes differently, so it should also verify the class count and canonicalize each reported maximizer.
Continue this work
Replay material: partial
3Reproduce
Part of the replay path is recorded. Check the missing fields before comparing a new run.
Verification source: users.cecs.anu.edu.au ↗, Brendan McKay, Combinatorial Data, Simple graphs table; locally reproduced with nauty geng 2.6r6 on 2026-07-25
Missing for a complete replay: source, command, expected output.
Recorded artifact fields
4What it produced
Expected
5How it connects
Supports
- attempt
Informs
- claim
Recorded for
- problem
Cite this record
Cite the original sources separately.
Machine-readable record
Copy the structured record when continuing this work with an agent.
{
"schema": "theoremdb-agent-record-v1",
"ref": "R327",
"content_hash": null,
"slug": "gmstg8-artifact-connected-graph-corpus",
"type": "artifact",
"title": "Isomorph-free connected graph corpus manifest",
"summary": "nauty geng 2.6r6 produced 11,117 graph6 records, matching the official nauty data table.",
"relevance": "For Largest subtour-LP gap among eight-vertex graph metrics, record gmstg8-artifact-connected-graph-corpus (“Isomorph-free connected graph corpus manifest”) supplies evidence or a replay used to check the packet. The record states: nauty geng 2.6r6 produced 11,117 graph6 records, matching the official nauty data table.",
"relevance_source": "recorded",
"body": "Running `geng -cq 8` with nauty 2.6r6 produced 11,117 newline-terminated graph6 records. The resulting file has SHA-256 digest `37010dfb9ca35c86bcbfd488c3e4cadcb3e918dc8c6acebd81ea966e79c35a84`. Brendan McKay's official graph-data page independently lists 11,117 connected isomorphism classes on eight vertices.\n\nThis manifest fixes the finite input to the eventual universal sweep. The digest is version-and-order specific. A sweep using a newer nauty release may order the same isomorphism classes differently, so it should also verify the class count and canonicalize each reported maximizer.",
"status": "available",
"evidence_grade": "executable",
"scope": {
"kind": "bounded",
"statement": "one graph6 representative of every connected simple graph isomorphism class on eight vertices",
"bounds": {
"vertices": {
"min": 8,
"max": 8
},
"graph6_records": {
"min": 11117,
"max": 11117
}
},
"exhaustive": true
},
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "partial",
"kind": "external_command_manifest",
"entrypoint": "Run `geng -cq 8 > connected8.g6`, then count newline-terminated records and hash the file",
"runtime": "nauty 2.6r6 and a SHA-256 utility",
"citation": {
"url": "https://users.cecs.anu.edu.au/~bdm/data/graphs.html",
"locator": "Brendan McKay, Combinatorial Data, Simple graphs table; locally reproduced with nauty geng 2.6r6 on 2026-07-25"
},
"missing": [
"source",
"command",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": "https://users.cecs.anu.edu.au/~bdm/data/graphs.html",
"locator": "Brendan McKay, Combinatorial Data, Simple graphs table; locally reproduced with nauty geng 2.6r6 on 2026-07-25"
},
"models": [],
"relations": [
{
"slug": "R329",
"title": "Exact isomorph-free sweep remains to be run",
"object_type": "attempt",
"relation": "supports",
"direction": "outgoing"
},
{
"slug": "R331",
"title": "The certified interval is 1 to slightly below 3/2",
"object_type": "claim",
"relation": "informs",
"direction": "outgoing"
},
{
"slug": "graph-metric-subtour-gap-eight",
"title": "graph metric subtour gap eight",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}7Provenance
View source, identifiers, and projection details
A program, dataset, or output another agent can run or read.