{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VX6K2XPJUSI3JX5DWXGEU5HMKD","short_pith_number":"pith:VX6K2XPJ","schema_version":"1.0","canonical_sha256":"adfcad5de9a491b4dfa3b5cc4a74ec50d006a84b530094ad0d5c3e1fa04e591e","source":{"kind":"arxiv","id":"2511.07247","version":2},"attestation_state":"computed","paper":{"title":"New small regular graphs of given girth: the cage problem and beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Geoffrey Exoo, Jan Goedgebeur, Jorik Jooken, Louis Stubbe, Tibo Van den Eede","submitted_at":"2025-11-10T16:00:38Z","abstract_excerpt":"The cage problem concerns finding $(k,g)$-graphs, which are $k$-regular graphs with girth $g$, of the smallest possible number of vertices. The central goal is to determine $n(k,g)$, the minimum order of such a graph, and to identify corresponding extremal graphs. In this paper, we study the cage problem and several of its variants from a computational perspective. Four complementary graph generation algorithms are developed based on exhaustive generation of lifts, a tabu search heuristic, a hill climbing heuristic and excision techniques. Using these methods, we establish new upper bounds for"},"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":"2511.07247","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-11-10T16:00:38Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0c3b712a5c4bf58e7b9b6df4bea88810d9fc2d505ee8618d025b88ab9502cf81","abstract_canon_sha256":"85d36363525c86318571122d05d05c4e29b58cee591fe74ad44c61090b8c8fef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-23T01:23:30.088183Z","signature_b64":"NfLLIxIoZlAxYgE5hJ61tDOw0uo8qPBrrfHcQeqwT7WRDd9w+35gR4b9VFWYVmmHns9Zmoo1HC8X/22ua70aDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"adfcad5de9a491b4dfa3b5cc4a74ec50d006a84b530094ad0d5c3e1fa04e591e","last_reissued_at":"2026-07-23T01:23:30.087158Z","signature_status":"signed_v1","first_computed_at":"2026-07-23T01:23:30.087158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New small regular graphs of given girth: the cage problem and beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Geoffrey Exoo, Jan Goedgebeur, Jorik Jooken, Louis Stubbe, Tibo Van den Eede","submitted_at":"2025-11-10T16:00:38Z","abstract_excerpt":"The cage problem concerns finding $(k,g)$-graphs, which are $k$-regular graphs with girth $g$, of the smallest possible number of vertices. The central goal is to determine $n(k,g)$, the minimum order of such a graph, and to identify corresponding extremal graphs. In this paper, we study the cage problem and several of its variants from a computational perspective. Four complementary graph generation algorithms are developed based on exhaustive generation of lifts, a tabu search heuristic, a hill climbing heuristic and excision techniques. Using these methods, we establish new upper bounds for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.07247","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2511.07247/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2511.07247","created_at":"2026-07-23T01:23:30.087631+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.07247v2","created_at":"2026-07-23T01:23:30.087631+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.07247","created_at":"2026-07-23T01:23:30.087631+00:00"},{"alias_kind":"pith_short_12","alias_value":"VX6K2XPJUSI3","created_at":"2026-07-23T01:23:30.087631+00:00"},{"alias_kind":"pith_short_16","alias_value":"VX6K2XPJUSI3JX5D","created_at":"2026-07-23T01:23:30.087631+00:00"},{"alias_kind":"pith_short_8","alias_value":"VX6K2XPJ","created_at":"2026-07-23T01:23:30.087631+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.21486","citing_title":"A non-existence result for vertex-girth-regular graphs","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VX6K2XPJUSI3JX5DWXGEU5HMKD","json":"https://pith.science/pith/VX6K2XPJUSI3JX5DWXGEU5HMKD.json","graph_json":"https://pith.science/api/pith-number/VX6K2XPJUSI3JX5DWXGEU5HMKD/graph.json","events_json":"https://pith.science/api/pith-number/VX6K2XPJUSI3JX5DWXGEU5HMKD/events.json","paper":"https://pith.science/paper/VX6K2XPJ"},"agent_actions":{"view_html":"https://pith.science/pith/VX6K2XPJUSI3JX5DWXGEU5HMKD","download_json":"https://pith.science/pith/VX6K2XPJUSI3JX5DWXGEU5HMKD.json","view_paper":"https://pith.science/paper/VX6K2XPJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.07247&json=true","fetch_graph":"https://pith.science/api/pith-number/VX6K2XPJUSI3JX5DWXGEU5HMKD/graph.json","fetch_events":"https://pith.science/api/pith-number/VX6K2XPJUSI3JX5DWXGEU5HMKD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VX6K2XPJUSI3JX5DWXGEU5HMKD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VX6K2XPJUSI3JX5DWXGEU5HMKD/action/storage_attestation","attest_author":"https://pith.science/pith/VX6K2XPJUSI3JX5DWXGEU5HMKD/action/author_attestation","sign_citation":"https://pith.science/pith/VX6K2XPJUSI3JX5DWXGEU5HMKD/action/citation_signature","submit_replication":"https://pith.science/pith/VX6K2XPJUSI3JX5DWXGEU5HMKD/action/replication_record"}},"created_at":"2026-07-23T01:23:30.087631+00:00","updated_at":"2026-07-23T01:23:30.087631+00:00"}