census · order 31
good-n31
reproducedOrigin not yet classified
Original source attribution: Published searches surveyed in arXiv:1811.05094 (Szekeres 1988; Koukouvinos 1999; Georgiou, Koukouvinos, Stylianou 2002; Đoković and Kotsireas 2018; Bright, Đoković, Kotsireas, Ganesh 2019); enumerated here by the vxvware good census
Submitted / imported by: vprusso · 2026-10-29
Board cell: Good (ksss)
Entry file: census/good-n31.json · raw JSON
Notes
Full census replayed on this board by good-census-c-v1 on every verification. Before the engine was pinned its class sets were checked against the Python enumerator at orders 3 to 15, the stored saw-best-matrix censuses at 17 to 45, and the published counts of arXiv:1811.05094 at orders divisible by 3.
Checks and result
{
"id": "good-n31",
"type": "census",
"n": 31,
"stratum": "good",
"equivalence": "equiv-v1",
"count": 3,
"bound": "exact",
"tier": "reproduced",
"claimed_count": 3,
"claim_kind": "computed-exact",
"checks": [
"representative-existence",
"pairwise-inequivalence",
"full-enumeration-replayed"
],
"contributions": []
}Sources
- This board's pinned census good-census-c-v1, replayed at n=31
- Bright, Đoković, Kotsireas, Ganesh, A SAT+CAS approach to finding good matrices: new examples and counterexamples (AAAI 2019), Table 1 and its survey of earlier searches [3]
Submission JSON
{
"schema_version": 1,
"n": 31,
"group": {
"kind": "cyclic",
"invariant_factors": [
31
]
},
"submitted_by": "vprusso",
"submitted_at": "2026-10-29",
"discovered_by": [
"Published searches surveyed in arXiv:1811.05094 (Szekeres 1988; Koukouvinos 1999; Georgiou, Koukouvinos, Stylianou 2002; Đoković and Kotsireas 2018; Bright, Đoković, Kotsireas, Ganesh 2019); enumerated here by the vxvware good census"
],
"sources": [
{
"title": "This board's pinned census good-census-c-v1, replayed at n=31",
"url": "https://github.com/vxvware/goethals-seidel-challenge/blob/f9862dd59ab3f981e08810e66860ba84c9c2d782/research/starter/good/good_c.c",
"commit": "f9862dd59ab3f981e08810e66860ba84c9c2d782",
"source_path": "research/starter/good/good_c.c"
},
{
"title": "Bright, Đoković, Kotsireas, Ganesh, A SAT+CAS approach to finding good matrices: new examples and counterexamples (AAAI 2019), Table 1 and its survey of earlier searches",
"url": "https://arxiv.org/abs/1811.05094"
}
],
"equivalence": "equiv-v1",
"id": "good-n31",
"type": "census",
"stratum": "good",
"representatives": [
"n31-75ef0affae16c51dfd46",
"n31-b2a3029c3bc71a4c3891",
"n31-ce95825587654ce330f7"
],
"claimed_count": 3,
"claim_kind": "computed-exact",
"enumerator": "good-census-c-v1",
"notes": "Full census replayed on this board by good-census-c-v1 on every verification. Before the engine was pinned its class sets were checked against the Python enumerator at orders 3 to 15, the stored saw-best-matrix censuses at 17 to 45, and the published counts of arXiv:1811.05094 at orders divisible by 3."
}