{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IXUJYVWLSETKD26UTGXELER472","short_pith_number":"pith:IXUJYVWL","canonical_record":{"source":{"id":"1510.03052","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-11T13:41:47Z","cross_cats_sorted":[],"title_canon_sha256":"58b5b5f1551b83caee10a066c34468422c8e2b35d6d61e116360167d2a9811b1","abstract_canon_sha256":"9e3503539f6b0c24917ec04428ccc86d4a5dd6e2e03667a81bdb1bd300383db6"},"schema_version":"1.0"},"canonical_sha256":"45e89c56cb9126a1ebd499ae45923cfe872a5f260c4ec6c0c9b215e9e0839a98","source":{"kind":"arxiv","id":"1510.03052","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03052","created_at":"2026-05-18T01:30:32Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03052v1","created_at":"2026-05-18T01:30:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03052","created_at":"2026-05-18T01:30:32Z"},{"alias_kind":"pith_short_12","alias_value":"IXUJYVWLSETK","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"IXUJYVWLSETKD26U","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"IXUJYVWL","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IXUJYVWLSETKD26UTGXELER472","target":"record","payload":{"canonical_record":{"source":{"id":"1510.03052","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-11T13:41:47Z","cross_cats_sorted":[],"title_canon_sha256":"58b5b5f1551b83caee10a066c34468422c8e2b35d6d61e116360167d2a9811b1","abstract_canon_sha256":"9e3503539f6b0c24917ec04428ccc86d4a5dd6e2e03667a81bdb1bd300383db6"},"schema_version":"1.0"},"canonical_sha256":"45e89c56cb9126a1ebd499ae45923cfe872a5f260c4ec6c0c9b215e9e0839a98","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:32.849842Z","signature_b64":"RNcTYhRHbJv1ttOMh2B5j+VNO+MzUGjRyNTXIP2wBaK8hrJAfzQkCzNAyrCaqqVFvVtSN83LHOnBfViQD/JKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45e89c56cb9126a1ebd499ae45923cfe872a5f260c4ec6c0c9b215e9e0839a98","last_reissued_at":"2026-05-18T01:30:32.849201Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:32.849201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.03052","source_version":1,"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-05-18T01:30:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/xhtzUpvv2TdAxtWyC1BYLNXvSBgm0QKHIkOmkMlaiMWS0cfj01by1b1SPyOB4vHMaZ9kbr3WX3Ce7uiM9QkDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:26:01.676658Z"},"content_sha256":"54b9e660ed285f1c10c1509a964660d76fde25e338eedc1ba176125219e7d9fd","schema_version":"1.0","event_id":"sha256:54b9e660ed285f1c10c1509a964660d76fde25e338eedc1ba176125219e7d9fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IXUJYVWLSETKD26UTGXELER472","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"$(r)$-Pancyclic, $(r)$-Bipancyclic and Oddly $(r)$-Bipancyclic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abdollah Khodkar, Lisa Mueller, Oliver Sawin, WonHyuk Choi","submitted_at":"2015-10-11T13:41:47Z","abstract_excerpt":"A graph with $v$ vertices is $(r)$-pancyclic if it contains precisely $r$ cycles of every length from 3 to $v$. A bipartite graph with even number of vertices $v$ is said to be $(r)$-bipancyclic if it contains precisely $r$ cycles of each even length from 4 to $v$. A bipartite graph with odd number of vertices $v$ and minimum degree at least 2 is said to be oddly $(r)$-bipancyclic if it contains precisely $r$ cycles of each even length from 4 to $v-1$. In this paper, using computer search, we classify all $(r)$-pancyclic and $(r)$-bipancyclic graphs with $v$ vertices and at most $v+5$ edges. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03052","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"},"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-05-18T01:30:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KmaZtxCs4YTy5KFJMznbQ8UkeJHmMxrBusxpRUp5JfYyDp0ho+JJE0kLXYINTvJHAC1FV1Bsci06VMx2X10BBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:26:01.677010Z"},"content_sha256":"82dd4405898b8cb11cdc74002448566a02e15dfb38bc1215f9c15dadcf82d75a","schema_version":"1.0","event_id":"sha256:82dd4405898b8cb11cdc74002448566a02e15dfb38bc1215f9c15dadcf82d75a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IXUJYVWLSETKD26UTGXELER472/bundle.json","state_url":"https://pith.science/pith/IXUJYVWLSETKD26UTGXELER472/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IXUJYVWLSETKD26UTGXELER472/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-05-28T07:26:01Z","links":{"resolver":"https://pith.science/pith/IXUJYVWLSETKD26UTGXELER472","bundle":"https://pith.science/pith/IXUJYVWLSETKD26UTGXELER472/bundle.json","state":"https://pith.science/pith/IXUJYVWLSETKD26UTGXELER472/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IXUJYVWLSETKD26UTGXELER472/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IXUJYVWLSETKD26UTGXELER472","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":"9e3503539f6b0c24917ec04428ccc86d4a5dd6e2e03667a81bdb1bd300383db6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-11T13:41:47Z","title_canon_sha256":"58b5b5f1551b83caee10a066c34468422c8e2b35d6d61e116360167d2a9811b1"},"schema_version":"1.0","source":{"id":"1510.03052","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03052","created_at":"2026-05-18T01:30:32Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03052v1","created_at":"2026-05-18T01:30:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03052","created_at":"2026-05-18T01:30:32Z"},{"alias_kind":"pith_short_12","alias_value":"IXUJYVWLSETK","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"IXUJYVWLSETKD26U","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"IXUJYVWL","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:82dd4405898b8cb11cdc74002448566a02e15dfb38bc1215f9c15dadcf82d75a","target":"graph","created_at":"2026-05-18T01:30:32Z","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"},"paper":{"abstract_excerpt":"A graph with $v$ vertices is $(r)$-pancyclic if it contains precisely $r$ cycles of every length from 3 to $v$. A bipartite graph with even number of vertices $v$ is said to be $(r)$-bipancyclic if it contains precisely $r$ cycles of each even length from 4 to $v$. A bipartite graph with odd number of vertices $v$ and minimum degree at least 2 is said to be oddly $(r)$-bipancyclic if it contains precisely $r$ cycles of each even length from 4 to $v-1$. In this paper, using computer search, we classify all $(r)$-pancyclic and $(r)$-bipancyclic graphs with $v$ vertices and at most $v+5$ edges. W","authors_text":"Abdollah Khodkar, Lisa Mueller, Oliver Sawin, WonHyuk Choi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-11T13:41:47Z","title":"$(r)$-Pancyclic, $(r)$-Bipancyclic and Oddly $(r)$-Bipancyclic Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03052","kind":"arxiv","version":1},"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:54b9e660ed285f1c10c1509a964660d76fde25e338eedc1ba176125219e7d9fd","target":"record","created_at":"2026-05-18T01:30:32Z","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":"9e3503539f6b0c24917ec04428ccc86d4a5dd6e2e03667a81bdb1bd300383db6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-11T13:41:47Z","title_canon_sha256":"58b5b5f1551b83caee10a066c34468422c8e2b35d6d61e116360167d2a9811b1"},"schema_version":"1.0","source":{"id":"1510.03052","kind":"arxiv","version":1}},"canonical_sha256":"45e89c56cb9126a1ebd499ae45923cfe872a5f260c4ec6c0c9b215e9e0839a98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45e89c56cb9126a1ebd499ae45923cfe872a5f260c4ec6c0c9b215e9e0839a98","first_computed_at":"2026-05-18T01:30:32.849201Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:32.849201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RNcTYhRHbJv1ttOMh2B5j+VNO+MzUGjRyNTXIP2wBaK8hrJAfzQkCzNAyrCaqqVFvVtSN83LHOnBfViQD/JKBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:32.849842Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.03052","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54b9e660ed285f1c10c1509a964660d76fde25e338eedc1ba176125219e7d9fd","sha256:82dd4405898b8cb11cdc74002448566a02e15dfb38bc1215f9c15dadcf82d75a"],"state_sha256":"5a71521403f3c72141050257890a4e7941756dcce4f9edbb47788e1b2234ee2f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5YqptlGwo/Dm7vJv1EJVUbnFfXHpWpLXBa8zk2VC4Lo4Tpiv9v66V0dKeNGiL2oVDQTb+CDuEYWPpqp6cWtXCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:26:01.679078Z","bundle_sha256":"d83c478dd38d70b497a6b06cd29b020bd5458445d7b2f717ba1e97b1759d9402"}}