{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:VX6K2XPJUSI3JX5DWXGEU5HMKD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"85d36363525c86318571122d05d05c4e29b58cee591fe74ad44c61090b8c8fef","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-11-10T16:00:38Z","title_canon_sha256":"0c3b712a5c4bf58e7b9b6df4bea88810d9fc2d505ee8618d025b88ab9502cf81"},"schema_version":"1.0","source":{"id":"2511.07247","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.07247","created_at":"2026-07-23T01:23:30Z"},{"alias_kind":"arxiv_version","alias_value":"2511.07247v2","created_at":"2026-07-23T01:23:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.07247","created_at":"2026-07-23T01:23:30Z"},{"alias_kind":"pith_short_12","alias_value":"VX6K2XPJUSI3","created_at":"2026-07-23T01:23:30Z"},{"alias_kind":"pith_short_16","alias_value":"VX6K2XPJUSI3JX5D","created_at":"2026-07-23T01:23:30Z"},{"alias_kind":"pith_short_8","alias_value":"VX6K2XPJ","created_at":"2026-07-23T01:23:30Z"}],"graph_snapshots":[{"event_id":"sha256:ba0400f535b1882eda6d9888d0d9080c19f5c33a1ae889401961cd8573ac33ee","target":"graph","created_at":"2026-07-23T01:23:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2511.07247/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Geoffrey Exoo, Jan Goedgebeur, Jorik Jooken, Louis Stubbe, Tibo Van den Eede","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-11-10T16:00:38Z","title":"New small regular graphs of given girth: the cage problem and beyond"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.07247","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:86e34cb930e65563cd5b1e86080f20fc2c1975c63f3f8971b3ce11ebce2df164","target":"record","created_at":"2026-07-23T01:23:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"85d36363525c86318571122d05d05c4e29b58cee591fe74ad44c61090b8c8fef","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-11-10T16:00:38Z","title_canon_sha256":"0c3b712a5c4bf58e7b9b6df4bea88810d9fc2d505ee8618d025b88ab9502cf81"},"schema_version":"1.0","source":{"id":"2511.07247","kind":"arxiv","version":2}},"canonical_sha256":"adfcad5de9a491b4dfa3b5cc4a74ec50d006a84b530094ad0d5c3e1fa04e591e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"adfcad5de9a491b4dfa3b5cc4a74ec50d006a84b530094ad0d5c3e1fa04e591e","first_computed_at":"2026-07-23T01:23:30.087158Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-23T01:23:30.087158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NfLLIxIoZlAxYgE5hJ61tDOw0uo8qPBrrfHcQeqwT7WRDd9w+35gR4b9VFWYVmmHns9Zmoo1HC8X/22ua70aDw==","signature_status":"signed_v1","signed_at":"2026-07-23T01:23:30.088183Z","signed_message":"canonical_sha256_bytes"},"source_id":"2511.07247","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86e34cb930e65563cd5b1e86080f20fc2c1975c63f3f8971b3ce11ebce2df164","sha256:ba0400f535b1882eda6d9888d0d9080c19f5c33a1ae889401961cd8573ac33ee"],"state_sha256":"6aef519b0f038c69e71f0d9210fe0d391604e18ed3ebe6bafaa37d0e25857416"}