{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:52DXACACADFTIWPKCFYZ7AG4BF","short_pith_number":"pith:52DXACAC","schema_version":"1.0","canonical_sha256":"ee8770080200cb3459ea11719f80dc09789d2e5a038014083efd19a57b3ea9f6","source":{"kind":"arxiv","id":"1312.0274","version":1},"attestation_state":"computed","paper":{"title":"Minimal Pancyclicity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sean Griffin","submitted_at":"2013-12-01T21:01:09Z","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."},"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":"1312.0274","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-01T21:01:09Z","cross_cats_sorted":[],"title_canon_sha256":"9b9276237c0f6b1917da35e86d0497013e76661ddc027f0ed03a74b81fa480d4","abstract_canon_sha256":"1c50582123f43d389b9ee507c4d4f7b28819ef098b01732e4e637a257aa64a45"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:46.220431Z","signature_b64":"fFZT4CFnwiBywtWo6BRTAvBOWO4OGpOzJQN0XgCovNF7yU3O6Mrp2EgpzcysE9t5LglSvve669tWs48Kd9KsCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee8770080200cb3459ea11719f80dc09789d2e5a038014083efd19a57b3ea9f6","last_reissued_at":"2026-05-18T03:05:46.219768Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:46.219768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimal Pancyclicity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sean Griffin","submitted_at":"2013-12-01T21:01:09Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0274","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.0274","created_at":"2026-05-18T03:05:46.219857+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.0274v1","created_at":"2026-05-18T03:05:46.219857+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0274","created_at":"2026-05-18T03:05:46.219857+00:00"},{"alias_kind":"pith_short_12","alias_value":"52DXACACADFT","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"52DXACACADFTIWPK","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"52DXACAC","created_at":"2026-05-18T12:27:34.582898+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/52DXACACADFTIWPKCFYZ7AG4BF","json":"https://pith.science/pith/52DXACACADFTIWPKCFYZ7AG4BF.json","graph_json":"https://pith.science/api/pith-number/52DXACACADFTIWPKCFYZ7AG4BF/graph.json","events_json":"https://pith.science/api/pith-number/52DXACACADFTIWPKCFYZ7AG4BF/events.json","paper":"https://pith.science/paper/52DXACAC"},"agent_actions":{"view_html":"https://pith.science/pith/52DXACACADFTIWPKCFYZ7AG4BF","download_json":"https://pith.science/pith/52DXACACADFTIWPKCFYZ7AG4BF.json","view_paper":"https://pith.science/paper/52DXACAC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.0274&json=true","fetch_graph":"https://pith.science/api/pith-number/52DXACACADFTIWPKCFYZ7AG4BF/graph.json","fetch_events":"https://pith.science/api/pith-number/52DXACACADFTIWPKCFYZ7AG4BF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/52DXACACADFTIWPKCFYZ7AG4BF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/52DXACACADFTIWPKCFYZ7AG4BF/action/storage_attestation","attest_author":"https://pith.science/pith/52DXACACADFTIWPKCFYZ7AG4BF/action/author_attestation","sign_citation":"https://pith.science/pith/52DXACACADFTIWPKCFYZ7AG4BF/action/citation_signature","submit_replication":"https://pith.science/pith/52DXACACADFTIWPKCFYZ7AG4BF/action/replication_record"}},"created_at":"2026-05-18T03:05:46.219857+00:00","updated_at":"2026-05-18T03:05:46.219857+00:00"}