{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:463G6I5DUF32CFAUPPK2TNTHBB","short_pith_number":"pith:463G6I5D","schema_version":"1.0","canonical_sha256":"e7b66f23a3a177a114147bd5a9b667086a4e4bdc573d5b712b3b7ee8d9617573","source":{"kind":"arxiv","id":"2402.06603","version":2},"attestation_state":"computed","paper":{"title":"Hamiltonicity of expanders: optimal bounds and applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexey Pokrovskiy, Benny Sudakov, David Munh\\'a Correia, Nemanja Dragani\\'c, Richard Montgomery","submitted_at":"2024-02-09T18:29:38Z","abstract_excerpt":"An $n$-vertex graph $G$ is a $C$-expander if $|N(X)|\\geq C|X|$ for every $X\\subseteq V(G)$ with $|X|< n/2C$ and there is an edge between every two disjoint sets of at least $n/2C$ vertices. We show that there is some constant $C>0$ for which every $C$-expander is Hamiltonian. In particular, this implies the well known conjecture of Krivelevich and Sudakov from 2003 on Hamilton cycles in $(n,d,\\lambda)$-graphs. This completes a long line of research on the Hamiltonicity of sparse graphs, and has many applications, including to the Hamiltonicity of random Cayley graphs."},"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":"2402.06603","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-02-09T18:29:38Z","cross_cats_sorted":[],"title_canon_sha256":"58a95d319e0657ef3f27317d1e8292b994cff6bc409b895cdbc99fdd8de5518c","abstract_canon_sha256":"ee8791fb461a6815f13dc2f7e9fe7ce71e692643956aad23e72f48ef3bd1337f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:07:33.728969Z","signature_b64":"fCo+7BVOtLgj+mwpEr/xJLXkBE3zyBi08XV4nrBy1Sgn6soS+ZdOdb72LPudKYpz7tQbQ1lJoto8cSD/sJDbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7b66f23a3a177a114147bd5a9b667086a4e4bdc573d5b712b3b7ee8d9617573","last_reissued_at":"2026-07-05T08:07:33.728424Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:07:33.728424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hamiltonicity of expanders: optimal bounds and applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexey Pokrovskiy, Benny Sudakov, David Munh\\'a Correia, Nemanja Dragani\\'c, Richard Montgomery","submitted_at":"2024-02-09T18:29:38Z","abstract_excerpt":"An $n$-vertex graph $G$ is a $C$-expander if $|N(X)|\\geq C|X|$ for every $X\\subseteq V(G)$ with $|X|< n/2C$ and there is an edge between every two disjoint sets of at least $n/2C$ vertices. We show that there is some constant $C>0$ for which every $C$-expander is Hamiltonian. In particular, this implies the well known conjecture of Krivelevich and Sudakov from 2003 on Hamilton cycles in $(n,d,\\lambda)$-graphs. This completes a long line of research on the Hamiltonicity of sparse graphs, and has many applications, including to the Hamiltonicity of random Cayley graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.06603","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.06603/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":"2402.06603","created_at":"2026-07-05T08:07:33.728504+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.06603v2","created_at":"2026-07-05T08:07:33.728504+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.06603","created_at":"2026-07-05T08:07:33.728504+00:00"},{"alias_kind":"pith_short_12","alias_value":"463G6I5DUF32","created_at":"2026-07-05T08:07:33.728504+00:00"},{"alias_kind":"pith_short_16","alias_value":"463G6I5DUF32CFAU","created_at":"2026-07-05T08:07:33.728504+00:00"},{"alias_kind":"pith_short_8","alias_value":"463G6I5D","created_at":"2026-07-05T08:07:33.728504+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.09742","citing_title":"Towards the Lov\\'{a}sz conjecture via sublinear expanders","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15043","citing_title":"Hamiltonicity of regular sublinear expanders","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2603.08675","citing_title":"The Lov\\'asz conjecture holds for moderately dense Cayley graphs","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17907","citing_title":"On Spielman's Laplacian Eigenratio Conjecture and Related Problems","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20589","citing_title":"The Mihail-Vazirani conjecture and strong edge-expansion in random $0/1$ polytopes","ref_index":38,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/463G6I5DUF32CFAUPPK2TNTHBB","json":"https://pith.science/pith/463G6I5DUF32CFAUPPK2TNTHBB.json","graph_json":"https://pith.science/api/pith-number/463G6I5DUF32CFAUPPK2TNTHBB/graph.json","events_json":"https://pith.science/api/pith-number/463G6I5DUF32CFAUPPK2TNTHBB/events.json","paper":"https://pith.science/paper/463G6I5D"},"agent_actions":{"view_html":"https://pith.science/pith/463G6I5DUF32CFAUPPK2TNTHBB","download_json":"https://pith.science/pith/463G6I5DUF32CFAUPPK2TNTHBB.json","view_paper":"https://pith.science/paper/463G6I5D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.06603&json=true","fetch_graph":"https://pith.science/api/pith-number/463G6I5DUF32CFAUPPK2TNTHBB/graph.json","fetch_events":"https://pith.science/api/pith-number/463G6I5DUF32CFAUPPK2TNTHBB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/463G6I5DUF32CFAUPPK2TNTHBB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/463G6I5DUF32CFAUPPK2TNTHBB/action/storage_attestation","attest_author":"https://pith.science/pith/463G6I5DUF32CFAUPPK2TNTHBB/action/author_attestation","sign_citation":"https://pith.science/pith/463G6I5DUF32CFAUPPK2TNTHBB/action/citation_signature","submit_replication":"https://pith.science/pith/463G6I5DUF32CFAUPPK2TNTHBB/action/replication_record"}},"created_at":"2026-07-05T08:07:33.728504+00:00","updated_at":"2026-07-05T08:07:33.728504+00:00"}