{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AMUQPNTEPEYLOWUFXNBJY33AF7","short_pith_number":"pith:AMUQPNTE","schema_version":"1.0","canonical_sha256":"032907b6647930b75a85bb429c6f602ffcc82c7370b697f232edd84c63893d54","source":{"kind":"arxiv","id":"2411.19023","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2411.19023","created_at":"2026-07-05T11:45:30.149024+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.19023v2","created_at":"2026-07-05T11:45:30.149024+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.19023","created_at":"2026-07-05T11:45:30.149024+00:00"},{"alias_kind":"pith_short_12","alias_value":"AMUQPNTEPEYL","created_at":"2026-07-05T11:45:30.149024+00:00"},{"alias_kind":"pith_short_16","alias_value":"AMUQPNTEPEYLOWUF","created_at":"2026-07-05T11:45:30.149024+00:00"},{"alias_kind":"pith_short_8","alias_value":"AMUQPNTE","created_at":"2026-07-05T11:45:30.149024+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2504.12095","citing_title":"The Gray graph is pseudo 2-factor isomorphic","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AMUQPNTEPEYLOWUFXNBJY33AF7","json":"https://pith.science/pith/AMUQPNTEPEYLOWUFXNBJY33AF7.json","graph_json":"https://pith.science/api/pith-number/AMUQPNTEPEYLOWUFXNBJY33AF7/graph.json","events_json":"https://pith.science/api/pith-number/AMUQPNTEPEYLOWUFXNBJY33AF7/events.json","paper":"https://pith.science/paper/AMUQPNTE"},"agent_actions":{"view_html":"https://pith.science/pith/AMUQPNTEPEYLOWUFXNBJY33AF7","download_json":"https://pith.science/pith/AMUQPNTEPEYLOWUFXNBJY33AF7.json","view_paper":"https://pith.science/paper/AMUQPNTE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.19023&json=true","fetch_graph":"https://pith.science/api/pith-number/AMUQPNTEPEYLOWUFXNBJY33AF7/graph.json","fetch_events":"https://pith.science/api/pith-number/AMUQPNTEPEYLOWUFXNBJY33AF7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AMUQPNTEPEYLOWUFXNBJY33AF7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AMUQPNTEPEYLOWUFXNBJY33AF7/action/storage_attestation","attest_author":"https://pith.science/pith/AMUQPNTEPEYLOWUFXNBJY33AF7/action/author_attestation","sign_citation":"https://pith.science/pith/AMUQPNTEPEYLOWUFXNBJY33AF7/action/citation_signature","submit_replication":"https://pith.science/pith/AMUQPNTEPEYLOWUFXNBJY33AF7/action/replication_record"}},"created_at":"2026-07-05T11:45:30.149024+00:00","updated_at":"2026-07-05T11:45:30.149024+00:00"}