{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:Y6PEVE7R4I54ESRUQPVVYV4SHI","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":"fcd5bd1a56a16e2b936ad33bb99d791c1de3c3098a08a17a85acd8e571681a07","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-09-07T17:33:21Z","title_canon_sha256":"2580011d2bf823fce3ec2102540c0605b18c80e3fc5d08fe3a6d8631c6c4db2e"},"schema_version":"1.0","source":{"id":"2209.03325","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.03325","created_at":"2026-07-05T06:33:02Z"},{"alias_kind":"arxiv_version","alias_value":"2209.03325v2","created_at":"2026-07-05T06:33:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.03325","created_at":"2026-07-05T06:33:02Z"},{"alias_kind":"pith_short_12","alias_value":"Y6PEVE7R4I54","created_at":"2026-07-05T06:33:02Z"},{"alias_kind":"pith_short_16","alias_value":"Y6PEVE7R4I54ESRU","created_at":"2026-07-05T06:33:02Z"},{"alias_kind":"pith_short_8","alias_value":"Y6PEVE7R","created_at":"2026-07-05T06:33:02Z"}],"graph_snapshots":[{"event_id":"sha256:5f428ab3bc84300d88ecde0ff84f5480fe3fdc68a4aec02810fa64c719e1088a","target":"graph","created_at":"2026-07-05T06:33:02Z","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/2209.03325/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An $n$-vertex graph is Hamiltonian if it contains a cycle that covers all of its vertices, and it is pancyclic if it contains cycles of all lengths from $3$ up to $n$. In 1972, Erd\\H{o}s conjectured that every Hamiltonian graph with independence number at most $k$ and at least $n = \\Omega(k^2)$ vertices is pancyclic. In this paper we prove this old conjecture in a strong form by showing that if such a graph has $n = (2+o(1))k^2$ vertices, it is already pancyclic, and this bound is asymptotically best possible.","authors_text":"Benny Sudakov, David Munh\\'a Correia, Nemanja Dragani\\'c","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-09-07T17:33:21Z","title":"Pancyclicity of Hamiltonian graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.03325","kind":"arxiv","version":2},"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:ce3349b90237279cbee8bd335da44a3b62eef9b9148692bf25d3ce70fb318cc3","target":"record","created_at":"2026-07-05T06:33:02Z","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":"fcd5bd1a56a16e2b936ad33bb99d791c1de3c3098a08a17a85acd8e571681a07","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-09-07T17:33:21Z","title_canon_sha256":"2580011d2bf823fce3ec2102540c0605b18c80e3fc5d08fe3a6d8631c6c4db2e"},"schema_version":"1.0","source":{"id":"2209.03325","kind":"arxiv","version":2}},"canonical_sha256":"c79e4a93f1e23bc24a3483eb5c57923a0547ddedfeac0596fd7b8bb585bee3f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c79e4a93f1e23bc24a3483eb5c57923a0547ddedfeac0596fd7b8bb585bee3f4","first_computed_at":"2026-07-05T06:33:02.711613Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:33:02.711613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uLT2S78sicTPqEzzi5OASRg3tIYrnJuHj/jMP2GlaMH8cuwzs5Xl2NzVeY9rb7O9H3DBkh34vqEjr+Zw6cjbCA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:33:02.712159Z","signed_message":"canonical_sha256_bytes"},"source_id":"2209.03325","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce3349b90237279cbee8bd335da44a3b62eef9b9148692bf25d3ce70fb318cc3","sha256:5f428ab3bc84300d88ecde0ff84f5480fe3fdc68a4aec02810fa64c719e1088a"],"state_sha256":"8a8af99507b7e9f0968412a4d6ab74d044833fbaca5c171dabf695a9b9951973"}