{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:YLCUA6ITPDZ22TMBJFCWSLODZ7","short_pith_number":"pith:YLCUA6IT","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"},"canonical_sha256":"c2c540791378f3ad4d814945692dc3cffe10a67207aa4a44a41074c86b051d53","source":{"kind":"arxiv","id":"2306.12579","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.12579","created_at":"2026-06-30T02:18:03Z"},{"alias_kind":"arxiv_version","alias_value":"2306.12579v3","created_at":"2026-06-30T02:18:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.12579","created_at":"2026-06-30T02:18:03Z"},{"alias_kind":"pith_short_12","alias_value":"YLCUA6ITPDZ2","created_at":"2026-06-30T02:18:03Z"},{"alias_kind":"pith_short_16","alias_value":"YLCUA6ITPDZ22TMB","created_at":"2026-06-30T02:18:03Z"},{"alias_kind":"pith_short_8","alias_value":"YLCUA6IT","created_at":"2026-06-30T02:18:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:YLCUA6ITPDZ22TMBJFCWSLODZ7","target":"record","payload":{"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"},"canonical_sha256":"c2c540791378f3ad4d814945692dc3cffe10a67207aa4a44a41074c86b051d53","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"},"source_kind":"arxiv","source_id":"2306.12579","source_version":3,"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-06-30T02:18:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rvHoRZv0XUiMKhqJLLYz86n2w84vpvVosvXcWjAtfqDs6GMvvel1NTfIYft2Rwli2DAFCQ851gKPF43Wb5PSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T10:07:22.243452Z"},"content_sha256":"4965a73da54afc233564607772503ad3f4f02d55ea659587a7de4c91e075f754","schema_version":"1.0","event_id":"sha256:4965a73da54afc233564607772503ad3f4f02d55ea659587a7de4c91e075f754"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:YLCUA6ITPDZ22TMBJFCWSLODZ7","target":"graph","payload":{"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"},"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-06-30T02:18:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e4YdLUzuZtpbAmqxonY6FbS2GEErk+AgDZj0QU0Jlp6H8QgNVR/6wcNXYwITeDEmI4WNYQF2JLkHFPTowxFGAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T10:07:22.243949Z"},"content_sha256":"4341bb13638d634f7d50602aa499733393e1f5453639d4758b367f4f97ab5a79","schema_version":"1.0","event_id":"sha256:4341bb13638d634f7d50602aa499733393e1f5453639d4758b367f4f97ab5a79"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YLCUA6ITPDZ22TMBJFCWSLODZ7/bundle.json","state_url":"https://pith.science/pith/YLCUA6ITPDZ22TMBJFCWSLODZ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YLCUA6ITPDZ22TMBJFCWSLODZ7/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-08-09T10:07:22Z","links":{"resolver":"https://pith.science/pith/YLCUA6ITPDZ22TMBJFCWSLODZ7","bundle":"https://pith.science/pith/YLCUA6ITPDZ22TMBJFCWSLODZ7/bundle.json","state":"https://pith.science/pith/YLCUA6ITPDZ22TMBJFCWSLODZ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YLCUA6ITPDZ22TMBJFCWSLODZ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:YLCUA6ITPDZ22TMBJFCWSLODZ7","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":"c5547f30c68eca12fa433e32383450d0450bcc2eb226f355d0fdf4b2b6a85522","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-06-21T21:32:02Z","title_canon_sha256":"3825a3490c648a90cf8a71d2da04626ed6122532c157e89cfef2dcddd75ec35a"},"schema_version":"1.0","source":{"id":"2306.12579","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.12579","created_at":"2026-06-30T02:18:03Z"},{"alias_kind":"arxiv_version","alias_value":"2306.12579v3","created_at":"2026-06-30T02:18:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.12579","created_at":"2026-06-30T02:18:03Z"},{"alias_kind":"pith_short_12","alias_value":"YLCUA6ITPDZ2","created_at":"2026-06-30T02:18:03Z"},{"alias_kind":"pith_short_16","alias_value":"YLCUA6ITPDZ22TMB","created_at":"2026-06-30T02:18:03Z"},{"alias_kind":"pith_short_8","alias_value":"YLCUA6IT","created_at":"2026-06-30T02:18:03Z"}],"graph_snapshots":[{"event_id":"sha256:4341bb13638d634f7d50602aa499733393e1f5453639d4758b367f4f97ab5a79","target":"graph","created_at":"2026-06-30T02:18:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2306.12579/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Shoham Letzter","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-06-21T21:32:02Z","title":"Pancyclicity of highly connected graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.12579","kind":"arxiv","version":3},"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:4965a73da54afc233564607772503ad3f4f02d55ea659587a7de4c91e075f754","target":"record","created_at":"2026-06-30T02:18:03Z","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":"c5547f30c68eca12fa433e32383450d0450bcc2eb226f355d0fdf4b2b6a85522","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-06-21T21:32:02Z","title_canon_sha256":"3825a3490c648a90cf8a71d2da04626ed6122532c157e89cfef2dcddd75ec35a"},"schema_version":"1.0","source":{"id":"2306.12579","kind":"arxiv","version":3}},"canonical_sha256":"c2c540791378f3ad4d814945692dc3cffe10a67207aa4a44a41074c86b051d53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2c540791378f3ad4d814945692dc3cffe10a67207aa4a44a41074c86b051d53","first_computed_at":"2026-06-30T02:18:03.162616Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-30T02:18:03.162616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wb9CbzWe688rdU4JDd0mOcGLtZLaGkCunz1Z86rK4AHKsWbPVkYAI2/UlbRHxaZNxrNIxGAUkaiMyN+sl+FBBA==","signature_status":"signed_v1","signed_at":"2026-06-30T02:18:03.163260Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.12579","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4965a73da54afc233564607772503ad3f4f02d55ea659587a7de4c91e075f754","sha256:4341bb13638d634f7d50602aa499733393e1f5453639d4758b367f4f97ab5a79"],"state_sha256":"c1db9d5ffb881e2cebafb73a7cc09bc878ec970575ff1aaa9009dcd0c1ee205d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bdHSZqNeo+YrzxNJHM8LGlfrBIuPTxZo0HEaELX273CK/oV5cv7BlG8cZUokTCgj/Os3GDzPMwmK5cYYpvajAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T10:07:22.249370Z","bundle_sha256":"83894a4ed1479b97f62636f83df639a496e2e86aa0a78fd6725f70b002cb0f01"}}