{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:AMUQPNTEPEYLOWUFXNBJY33AF7","short_pith_number":"pith:AMUQPNTE","canonical_record":{"source":{"id":"2411.19023","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-28T09:53:40Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"926e772b213d0bd1015e22f0c3cfeab9848940825d1ef6a4fbee6e7110bfd768","abstract_canon_sha256":"b297f7cc66fc5222fa029848226c7098f8290de834b43e8b298973a489c1007b"},"schema_version":"1.0"},"canonical_sha256":"032907b6647930b75a85bb429c6f602ffcc82c7370b697f232edd84c63893d54","source":{"kind":"arxiv","id":"2411.19023","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.19023","created_at":"2026-07-05T11:45:30Z"},{"alias_kind":"arxiv_version","alias_value":"2411.19023v2","created_at":"2026-07-05T11:45:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.19023","created_at":"2026-07-05T11:45:30Z"},{"alias_kind":"pith_short_12","alias_value":"AMUQPNTEPEYL","created_at":"2026-07-05T11:45:30Z"},{"alias_kind":"pith_short_16","alias_value":"AMUQPNTEPEYLOWUF","created_at":"2026-07-05T11:45:30Z"},{"alias_kind":"pith_short_8","alias_value":"AMUQPNTE","created_at":"2026-07-05T11:45:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:AMUQPNTEPEYLOWUFXNBJY33AF7","target":"record","payload":{"canonical_record":{"source":{"id":"2411.19023","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-28T09:53:40Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"926e772b213d0bd1015e22f0c3cfeab9848940825d1ef6a4fbee6e7110bfd768","abstract_canon_sha256":"b297f7cc66fc5222fa029848226c7098f8290de834b43e8b298973a489c1007b"},"schema_version":"1.0"},"canonical_sha256":"032907b6647930b75a85bb429c6f602ffcc82c7370b697f232edd84c63893d54","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:45:30.149469Z","signature_b64":"Lo6MoOTzt/RlQ5sN2YujppA7NeXPtFWxy7+d1Har1ABpwK+VVXZAmQoyds7OU63exzfnYHzKTda+2WDfkzIwDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"032907b6647930b75a85bb429c6f602ffcc82c7370b697f232edd84c63893d54","last_reissued_at":"2026-07-05T11:45:30.148965Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:45:30.148965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.19023","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:45:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fgjaG2s0wfQLTOfzMpYc3RIiFnqDoh6KwH2EwvMdBS31xfMZzi5hquG2soVTclFAJwut0ckMko+z3APDhrkWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:52:41.729674Z"},"content_sha256":"fed5f3eed5ce75729d2a0f0a19da17438d7046223d4e10627a329469c1bf3f89","schema_version":"1.0","event_id":"sha256:fed5f3eed5ce75729d2a0f0a19da17438d7046223d4e10627a329469c1bf3f89"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:AMUQPNTEPEYLOWUFXNBJY33AF7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On $(k,g)$-Graphs without $(g+1)$-Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jorik Jooken, Leonard Chidiebere Eze, Robert Jajcay","submitted_at":"2024-11-28T09:53:40Z","abstract_excerpt":"A $(k,g,\\underline{g+1})$-graph is a $k$-regular graph of girth $g$ which does not contain cycles of length $g+1$. Such graphs are known to exist for all parameter pairs $k \\geq 3, g \\geq 3 $, and we focus on determining the orders $n(k,g,\\underline{g+1})$ of the smallest $(k,g,\\underline{g+1})$-graphs. This problem can be viewed as a special case of the previously studied Girth Pair Problem, the problem of finding the order of a smallest $k$-regular graph in which the length of a smallest even length cycle and the length of a smallest odd length cycle are prescribed. When considering the case"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.19023","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/2411.19023/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:45:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WyqQXMgg0tH39/goOQ9OrGFXKvqXMklSdLr24wTDvBfW8pJoQcNzrC95MtVQmZNmv5/dc3SWcF+by4AH+EyECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:52:41.730211Z"},"content_sha256":"e6929866ee2550663ba361ded94f90ee2ae387dc57c0a073f81906dd76a6a12e","schema_version":"1.0","event_id":"sha256:e6929866ee2550663ba361ded94f90ee2ae387dc57c0a073f81906dd76a6a12e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AMUQPNTEPEYLOWUFXNBJY33AF7/bundle.json","state_url":"https://pith.science/pith/AMUQPNTEPEYLOWUFXNBJY33AF7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AMUQPNTEPEYLOWUFXNBJY33AF7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-08T20:52:41Z","links":{"resolver":"https://pith.science/pith/AMUQPNTEPEYLOWUFXNBJY33AF7","bundle":"https://pith.science/pith/AMUQPNTEPEYLOWUFXNBJY33AF7/bundle.json","state":"https://pith.science/pith/AMUQPNTEPEYLOWUFXNBJY33AF7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AMUQPNTEPEYLOWUFXNBJY33AF7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:AMUQPNTEPEYLOWUFXNBJY33AF7","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":"b297f7cc66fc5222fa029848226c7098f8290de834b43e8b298973a489c1007b","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-28T09:53:40Z","title_canon_sha256":"926e772b213d0bd1015e22f0c3cfeab9848940825d1ef6a4fbee6e7110bfd768"},"schema_version":"1.0","source":{"id":"2411.19023","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.19023","created_at":"2026-07-05T11:45:30Z"},{"alias_kind":"arxiv_version","alias_value":"2411.19023v2","created_at":"2026-07-05T11:45:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.19023","created_at":"2026-07-05T11:45:30Z"},{"alias_kind":"pith_short_12","alias_value":"AMUQPNTEPEYL","created_at":"2026-07-05T11:45:30Z"},{"alias_kind":"pith_short_16","alias_value":"AMUQPNTEPEYLOWUF","created_at":"2026-07-05T11:45:30Z"},{"alias_kind":"pith_short_8","alias_value":"AMUQPNTE","created_at":"2026-07-05T11:45:30Z"}],"graph_snapshots":[{"event_id":"sha256:e6929866ee2550663ba361ded94f90ee2ae387dc57c0a073f81906dd76a6a12e","target":"graph","created_at":"2026-07-05T11:45: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/2411.19023/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A $(k,g,\\underline{g+1})$-graph is a $k$-regular graph of girth $g$ which does not contain cycles of length $g+1$. Such graphs are known to exist for all parameter pairs $k \\geq 3, g \\geq 3 $, and we focus on determining the orders $n(k,g,\\underline{g+1})$ of the smallest $(k,g,\\underline{g+1})$-graphs. This problem can be viewed as a special case of the previously studied Girth Pair Problem, the problem of finding the order of a smallest $k$-regular graph in which the length of a smallest even length cycle and the length of a smallest odd length cycle are prescribed. When considering the case","authors_text":"Jorik Jooken, Leonard Chidiebere Eze, Robert Jajcay","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-28T09:53:40Z","title":"On $(k,g)$-Graphs without $(g+1)$-Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.19023","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:fed5f3eed5ce75729d2a0f0a19da17438d7046223d4e10627a329469c1bf3f89","target":"record","created_at":"2026-07-05T11:45: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":"b297f7cc66fc5222fa029848226c7098f8290de834b43e8b298973a489c1007b","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-28T09:53:40Z","title_canon_sha256":"926e772b213d0bd1015e22f0c3cfeab9848940825d1ef6a4fbee6e7110bfd768"},"schema_version":"1.0","source":{"id":"2411.19023","kind":"arxiv","version":2}},"canonical_sha256":"032907b6647930b75a85bb429c6f602ffcc82c7370b697f232edd84c63893d54","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"032907b6647930b75a85bb429c6f602ffcc82c7370b697f232edd84c63893d54","first_computed_at":"2026-07-05T11:45:30.148965Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:45:30.148965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Lo6MoOTzt/RlQ5sN2YujppA7NeXPtFWxy7+d1Har1ABpwK+VVXZAmQoyds7OU63exzfnYHzKTda+2WDfkzIwDg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:45:30.149469Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.19023","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fed5f3eed5ce75729d2a0f0a19da17438d7046223d4e10627a329469c1bf3f89","sha256:e6929866ee2550663ba361ded94f90ee2ae387dc57c0a073f81906dd76a6a12e"],"state_sha256":"c29afa3e8efe2fad53fec05e70c4742374c314526f6d1d86482c5e6796d51c39"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dgqKipYZ+BNtUSRVQngGlK1G6wRN3wwHRFokGbkF370mB91Vk0JcnsOOYzWDOhc70rrzSQ4SdUmorhP2U/5DDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T20:52:41.735929Z","bundle_sha256":"2d70e94a0b5bcde0822b9a272c92624b8f8c8a5f4d6c027e18f2e162d0daaa98"}}