{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:52DXACACADFTIWPKCFYZ7AG4BF","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":"1c50582123f43d389b9ee507c4d4f7b28819ef098b01732e4e637a257aa64a45","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-01T21:01:09Z","title_canon_sha256":"9b9276237c0f6b1917da35e86d0497013e76661ddc027f0ed03a74b81fa480d4"},"schema_version":"1.0","source":{"id":"1312.0274","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0274","created_at":"2026-05-18T03:05:46Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0274v1","created_at":"2026-05-18T03:05:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0274","created_at":"2026-05-18T03:05:46Z"},{"alias_kind":"pith_short_12","alias_value":"52DXACACADFT","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"52DXACACADFTIWPK","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"52DXACAC","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:a42a940cda26cf0f00770f4afdeda76675488c9b0f09d59d75d8bf815c7c75f9","target":"graph","created_at":"2026-05-18T03:05:46Z","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 pancyclic graph is a simple graph containing a cycle of length $k$ for all $3\\leq k\\leq n$. Let $m(n)$ be the minimum number of edges of all pancyclic graphs on $n$ vertices. Exact values are given for $m(n)$ for $n\\leq 37$, combining calculations from an exhaustive search on graphs with up to 29 vertices with a construction that works for up to 37 vertices. The behavior of $m(n)$ in general is also explored, including a proof of the conjecture that $m(n+1)>m(n)$ for all $n$ in some special cases.","authors_text":"Sean Griffin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-01T21:01:09Z","title":"Minimal Pancyclicity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0274","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:6ef41e63dfa3e9b47ebad96c25b03bc9a173467ff3c4800a8db6e9ab55f7c495","target":"record","created_at":"2026-05-18T03:05:46Z","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":"1c50582123f43d389b9ee507c4d4f7b28819ef098b01732e4e637a257aa64a45","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-01T21:01:09Z","title_canon_sha256":"9b9276237c0f6b1917da35e86d0497013e76661ddc027f0ed03a74b81fa480d4"},"schema_version":"1.0","source":{"id":"1312.0274","kind":"arxiv","version":1}},"canonical_sha256":"ee8770080200cb3459ea11719f80dc09789d2e5a038014083efd19a57b3ea9f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee8770080200cb3459ea11719f80dc09789d2e5a038014083efd19a57b3ea9f6","first_computed_at":"2026-05-18T03:05:46.219768Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:46.219768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fFZT4CFnwiBywtWo6BRTAvBOWO4OGpOzJQN0XgCovNF7yU3O6Mrp2EgpzcysE9t5LglSvve669tWs48Kd9KsCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:46.220431Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.0274","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ef41e63dfa3e9b47ebad96c25b03bc9a173467ff3c4800a8db6e9ab55f7c495","sha256:a42a940cda26cf0f00770f4afdeda76675488c9b0f09d59d75d8bf815c7c75f9"],"state_sha256":"e040a6fe8bc4cf83c564f4412dfdf34707c5d859cb99f12df2293622223ec466"}