{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:OSKHVLNWXBMNNMLHRFFYF5GWPB","short_pith_number":"pith:OSKHVLNW","schema_version":"1.0","canonical_sha256":"74947aadb6b858d6b167894b82f4d6784f1134756ee5c463d086816bd3f8fa13","source":{"kind":"arxiv","id":"1009.3608","version":1},"attestation_state":"computed","paper":{"title":"Computational determination of (3,11) and (4,7) cages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brendan D. McKay, Geoffrey Exoo, Jacqueline Nadon, Wendy Myrvold","submitted_at":"2010-09-19T05:02:42Z","abstract_excerpt":"A (k,g)-graph is a k-regular graph of girth g, and a (k,g)-cage is a (k,g)-graph of minimum order. We show that a (3,11)-graph of order 112 found by Balaban in 1973 is minimal and unique. We also show that the order of a (4,7)-cage is 67 and find one example. Finally, we improve the lower bounds on the orders of (3,13)-cages and (3,14)-cages to 202 and 260, respectively. The methods used were a combination of heuristic hill-climbing and an innovative backtrack search."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1009.3608","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-19T05:02:42Z","cross_cats_sorted":[],"title_canon_sha256":"affe1d08b380a36c6f1c0db1734defcc80bb07eadbd13bed0f4b0f17e3bee212","abstract_canon_sha256":"57e10f8803efddabc6265c3c4e008de8e8bd7f877354ae25add465426c5aeb24"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:44.422624Z","signature_b64":"4HTQIcJGI/6QTstHWLwCQvIl380UysOVV780igW300iR8nmHhh/YYhTfmKQ1SA8VScyOx8OPTZiRjdxYIobDAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74947aadb6b858d6b167894b82f4d6784f1134756ee5c463d086816bd3f8fa13","last_reissued_at":"2026-05-18T04:40:44.421932Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:44.421932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational determination of (3,11) and (4,7) cages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brendan D. McKay, Geoffrey Exoo, Jacqueline Nadon, Wendy Myrvold","submitted_at":"2010-09-19T05:02:42Z","abstract_excerpt":"A (k,g)-graph is a k-regular graph of girth g, and a (k,g)-cage is a (k,g)-graph of minimum order. We show that a (3,11)-graph of order 112 found by Balaban in 1973 is minimal and unique. We also show that the order of a (4,7)-cage is 67 and find one example. Finally, we improve the lower bounds on the orders of (3,13)-cages and (3,14)-cages to 202 and 260, respectively. The methods used were a combination of heuristic hill-climbing and an innovative backtrack search."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3608","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1009.3608","created_at":"2026-05-18T04:40:44.422034+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.3608v1","created_at":"2026-05-18T04:40:44.422034+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3608","created_at":"2026-05-18T04:40:44.422034+00:00"},{"alias_kind":"pith_short_12","alias_value":"OSKHVLNWXBMN","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"OSKHVLNWXBMNNMLH","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"OSKHVLNW","created_at":"2026-05-18T12:26:12.377268+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OSKHVLNWXBMNNMLHRFFYF5GWPB","json":"https://pith.science/pith/OSKHVLNWXBMNNMLHRFFYF5GWPB.json","graph_json":"https://pith.science/api/pith-number/OSKHVLNWXBMNNMLHRFFYF5GWPB/graph.json","events_json":"https://pith.science/api/pith-number/OSKHVLNWXBMNNMLHRFFYF5GWPB/events.json","paper":"https://pith.science/paper/OSKHVLNW"},"agent_actions":{"view_html":"https://pith.science/pith/OSKHVLNWXBMNNMLHRFFYF5GWPB","download_json":"https://pith.science/pith/OSKHVLNWXBMNNMLHRFFYF5GWPB.json","view_paper":"https://pith.science/paper/OSKHVLNW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.3608&json=true","fetch_graph":"https://pith.science/api/pith-number/OSKHVLNWXBMNNMLHRFFYF5GWPB/graph.json","fetch_events":"https://pith.science/api/pith-number/OSKHVLNWXBMNNMLHRFFYF5GWPB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OSKHVLNWXBMNNMLHRFFYF5GWPB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OSKHVLNWXBMNNMLHRFFYF5GWPB/action/storage_attestation","attest_author":"https://pith.science/pith/OSKHVLNWXBMNNMLHRFFYF5GWPB/action/author_attestation","sign_citation":"https://pith.science/pith/OSKHVLNWXBMNNMLHRFFYF5GWPB/action/citation_signature","submit_replication":"https://pith.science/pith/OSKHVLNWXBMNNMLHRFFYF5GWPB/action/replication_record"}},"created_at":"2026-05-18T04:40:44.422034+00:00","updated_at":"2026-05-18T04:40:44.422034+00:00"}