{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:OET2LBCMEQK2KD6UMJL45EB5YM","short_pith_number":"pith:OET2LBCM","schema_version":"1.0","canonical_sha256":"7127a5844c2415a50fd46257ce903dc33965599d847682a451b67bc494ebaa0b","source":{"kind":"arxiv","id":"1212.3633","version":2},"attestation_state":"computed","paper":{"title":"Pancyclicity when each cycle must pass exactly $k$ Hamilton cycle chords","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Carrie Rutherford, Fatima Affif Chaouche, Robin Whitty","submitted_at":"2012-12-14T23:27:36Z","abstract_excerpt":"It is known that $\\Theta(\\log n)$ chords must be added to an $n$-cycle to produce a pancyclic graph; for vertex pancyclicity, where every vertex belongs to a cycle of every length, $\\Theta(n)$ chords are required. A possibly `intermediate' variation is the following: given $k$, $1\\leq k\\leq n$, how many chords must be added to ensure that there exist cycles of every length each of which passes exactly $k$ chords? For fixed $k$, we establish a lower bound of $\\Omega\\big(n^{1/k}\\big)$ on the growth rate."},"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":"1212.3633","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-14T23:27:36Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"28d692e9a44af2d5cf536603ac2399ae9b138e2f755695396a82772b28c3a352","abstract_canon_sha256":"8f7ca1b825337257f24b5b27c1f90338fb48ba94bc500fc7f446d84c63168781"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:21.651863Z","signature_b64":"3zkqOKiDXwvJP+Q69Q3GEXh2DOEZOSHGbx3VFCoe01UHrfHTZL9XbUTitaLapWDz73plPV/b87ulIZ0Ad8urBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7127a5844c2415a50fd46257ce903dc33965599d847682a451b67bc494ebaa0b","last_reissued_at":"2026-05-18T02:54:21.651465Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:21.651465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pancyclicity when each cycle must pass exactly $k$ Hamilton cycle chords","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Carrie Rutherford, Fatima Affif Chaouche, Robin Whitty","submitted_at":"2012-12-14T23:27:36Z","abstract_excerpt":"It is known that $\\Theta(\\log n)$ chords must be added to an $n$-cycle to produce a pancyclic graph; for vertex pancyclicity, where every vertex belongs to a cycle of every length, $\\Theta(n)$ chords are required. A possibly `intermediate' variation is the following: given $k$, $1\\leq k\\leq n$, how many chords must be added to ensure that there exist cycles of every length each of which passes exactly $k$ chords? For fixed $k$, we establish a lower bound of $\\Omega\\big(n^{1/k}\\big)$ on the growth rate."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3633","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":""},"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":"1212.3633","created_at":"2026-05-18T02:54:21.651526+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.3633v2","created_at":"2026-05-18T02:54:21.651526+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3633","created_at":"2026-05-18T02:54:21.651526+00:00"},{"alias_kind":"pith_short_12","alias_value":"OET2LBCMEQK2","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"OET2LBCMEQK2KD6U","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"OET2LBCM","created_at":"2026-05-18T12:27:16.716162+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/OET2LBCMEQK2KD6UMJL45EB5YM","json":"https://pith.science/pith/OET2LBCMEQK2KD6UMJL45EB5YM.json","graph_json":"https://pith.science/api/pith-number/OET2LBCMEQK2KD6UMJL45EB5YM/graph.json","events_json":"https://pith.science/api/pith-number/OET2LBCMEQK2KD6UMJL45EB5YM/events.json","paper":"https://pith.science/paper/OET2LBCM"},"agent_actions":{"view_html":"https://pith.science/pith/OET2LBCMEQK2KD6UMJL45EB5YM","download_json":"https://pith.science/pith/OET2LBCMEQK2KD6UMJL45EB5YM.json","view_paper":"https://pith.science/paper/OET2LBCM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.3633&json=true","fetch_graph":"https://pith.science/api/pith-number/OET2LBCMEQK2KD6UMJL45EB5YM/graph.json","fetch_events":"https://pith.science/api/pith-number/OET2LBCMEQK2KD6UMJL45EB5YM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OET2LBCMEQK2KD6UMJL45EB5YM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OET2LBCMEQK2KD6UMJL45EB5YM/action/storage_attestation","attest_author":"https://pith.science/pith/OET2LBCMEQK2KD6UMJL45EB5YM/action/author_attestation","sign_citation":"https://pith.science/pith/OET2LBCMEQK2KD6UMJL45EB5YM/action/citation_signature","submit_replication":"https://pith.science/pith/OET2LBCMEQK2KD6UMJL45EB5YM/action/replication_record"}},"created_at":"2026-05-18T02:54:21.651526+00:00","updated_at":"2026-05-18T02:54:21.651526+00:00"}