{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:YLCUA6ITPDZ22TMBJFCWSLODZ7","short_pith_number":"pith:YLCUA6IT","schema_version":"1.0","canonical_sha256":"c2c540791378f3ad4d814945692dc3cffe10a67207aa4a44a41074c86b051d53","source":{"kind":"arxiv","id":"2306.12579","version":3},"attestation_state":"computed","paper":{"title":"Pancyclicity of highly connected graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shoham Letzter","submitted_at":"2023-06-21T21:32:02Z","abstract_excerpt":"A well-known result due to Chvat\\'al and Erd\\H{o}s (1972) asserts that, if a graph $G$ satisfies $\\kappa(G) \\ge \\alpha(G)$, where $\\kappa(G)$ is the vertex-connectivity of $G$, then $G$ has a Hamilton cycle. We prove a similar result implying that a graph $G$ is pancyclic, namely it contains cycles of all lengths between $3$ and $|G|$: if $|G|$ is large and $\\kappa(G) > \\alpha(G)$, then $G$ is pancyclic. This confirms a conjecture of Jackson and Ordaz (1990) for large graphs, and improves upon a very recent result of Dragani\\'c, Munh\\'a-Correia, and Sudakov."},"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":"2306.12579","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-06-21T21:32:02Z","cross_cats_sorted":[],"title_canon_sha256":"3825a3490c648a90cf8a71d2da04626ed6122532c157e89cfef2dcddd75ec35a","abstract_canon_sha256":"c5547f30c68eca12fa433e32383450d0450bcc2eb226f355d0fdf4b2b6a85522"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T02:18:03.163260Z","signature_b64":"Wb9CbzWe688rdU4JDd0mOcGLtZLaGkCunz1Z86rK4AHKsWbPVkYAI2/UlbRHxaZNxrNIxGAUkaiMyN+sl+FBBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2c540791378f3ad4d814945692dc3cffe10a67207aa4a44a41074c86b051d53","last_reissued_at":"2026-06-30T02:18:03.162616Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T02:18:03.162616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pancyclicity of highly connected graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shoham Letzter","submitted_at":"2023-06-21T21:32:02Z","abstract_excerpt":"A well-known result due to Chvat\\'al and Erd\\H{o}s (1972) asserts that, if a graph $G$ satisfies $\\kappa(G) \\ge \\alpha(G)$, where $\\kappa(G)$ is the vertex-connectivity of $G$, then $G$ has a Hamilton cycle. We prove a similar result implying that a graph $G$ is pancyclic, namely it contains cycles of all lengths between $3$ and $|G|$: if $|G|$ is large and $\\kappa(G) > \\alpha(G)$, then $G$ is pancyclic. This confirms a conjecture of Jackson and Ordaz (1990) for large graphs, and improves upon a very recent result of Dragani\\'c, Munh\\'a-Correia, and Sudakov."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.12579","kind":"arxiv","version":3},"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/2306.12579/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":"2306.12579","created_at":"2026-06-30T02:18:03.162698+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.12579v3","created_at":"2026-06-30T02:18:03.162698+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.12579","created_at":"2026-06-30T02:18:03.162698+00:00"},{"alias_kind":"pith_short_12","alias_value":"YLCUA6ITPDZ2","created_at":"2026-06-30T02:18:03.162698+00:00"},{"alias_kind":"pith_short_16","alias_value":"YLCUA6ITPDZ22TMB","created_at":"2026-06-30T02:18:03.162698+00:00"},{"alias_kind":"pith_short_8","alias_value":"YLCUA6IT","created_at":"2026-06-30T02:18:03.162698+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.05835","citing_title":"On graphs whose cycle space is spanned by their Hamilton cycles","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YLCUA6ITPDZ22TMBJFCWSLODZ7","json":"https://pith.science/pith/YLCUA6ITPDZ22TMBJFCWSLODZ7.json","graph_json":"https://pith.science/api/pith-number/YLCUA6ITPDZ22TMBJFCWSLODZ7/graph.json","events_json":"https://pith.science/api/pith-number/YLCUA6ITPDZ22TMBJFCWSLODZ7/events.json","paper":"https://pith.science/paper/YLCUA6IT"},"agent_actions":{"view_html":"https://pith.science/pith/YLCUA6ITPDZ22TMBJFCWSLODZ7","download_json":"https://pith.science/pith/YLCUA6ITPDZ22TMBJFCWSLODZ7.json","view_paper":"https://pith.science/paper/YLCUA6IT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.12579&json=true","fetch_graph":"https://pith.science/api/pith-number/YLCUA6ITPDZ22TMBJFCWSLODZ7/graph.json","fetch_events":"https://pith.science/api/pith-number/YLCUA6ITPDZ22TMBJFCWSLODZ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YLCUA6ITPDZ22TMBJFCWSLODZ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YLCUA6ITPDZ22TMBJFCWSLODZ7/action/storage_attestation","attest_author":"https://pith.science/pith/YLCUA6ITPDZ22TMBJFCWSLODZ7/action/author_attestation","sign_citation":"https://pith.science/pith/YLCUA6ITPDZ22TMBJFCWSLODZ7/action/citation_signature","submit_replication":"https://pith.science/pith/YLCUA6ITPDZ22TMBJFCWSLODZ7/action/replication_record"}},"created_at":"2026-06-30T02:18:03.162698+00:00","updated_at":"2026-06-30T02:18:03.162698+00:00"}