{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:GJYSDDLVW3B6W5XQUEBOZH76VB","short_pith_number":"pith:GJYSDDLV","schema_version":"1.0","canonical_sha256":"3271218d75b6c3eb76f0a102ec9ffea8575bda93ef81f5b3dbb600747101709d","source":{"kind":"arxiv","id":"2605.15043","version":1},"attestation_state":"computed","paper":{"title":"Hamiltonicity of regular sublinear expanders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Domagoj Brada\\v{c}, Oliver Janzer","submitted_at":"2026-05-14T16:36:41Z","abstract_excerpt":"We say that a $d$-regular graph is a $\\gamma$-expander if for every not too large set of vertices $S$, there are at least $\\gamma d |S|$ edges leaving $S$, and we say that a graph $G$ is $\\gamma$-far from bipartite if at least $\\gamma e(G)$ edges need to be removed to make it bipartite. We prove that there exists an absolute constant $K$ such that any $n$-vertex $d$-regular $\\gamma$-expander with $d \\ge (\\gamma^{-1} \\log n)^K$ is Hamiltonian, provided that it is bipartite or $\\gamma$-far from bipartite. As applications, we obtain highly robust versions of recent important results on the Hamilt"},"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":"2605.15043","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T16:36:41Z","cross_cats_sorted":[],"title_canon_sha256":"c9323a9e098ad612052075ed98b7b17dd9d00ee25911a259a02b8e00311c8e1c","abstract_canon_sha256":"ddbfee41754dddaa83584eb5f5a1f8f74ced5b2206ef766f3f1c6dcc30fc3d87"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:38:54.464653Z","signature_b64":"3Vb8VSlIrI2Lv0lFeCvI4wvxgUnA2kwXOigpujjWD+BuxHSQZRlF80pZMblyobAJ2AzQOzyo2ousK+PiyH7yCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3271218d75b6c3eb76f0a102ec9ffea8575bda93ef81f5b3dbb600747101709d","last_reissued_at":"2026-05-17T23:38:54.464077Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:38:54.464077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hamiltonicity of regular sublinear expanders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Domagoj Brada\\v{c}, Oliver Janzer","submitted_at":"2026-05-14T16:36:41Z","abstract_excerpt":"We say that a $d$-regular graph is a $\\gamma$-expander if for every not too large set of vertices $S$, there are at least $\\gamma d |S|$ edges leaving $S$, and we say that a graph $G$ is $\\gamma$-far from bipartite if at least $\\gamma e(G)$ edges need to be removed to make it bipartite. We prove that there exists an absolute constant $K$ such that any $n$-vertex $d$-regular $\\gamma$-expander with $d \\ge (\\gamma^{-1} \\log n)^K$ is Hamiltonian, provided that it is bipartite or $\\gamma$-far from bipartite. As applications, we obtain highly robust versions of recent important results on the Hamilt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.15043","kind":"arxiv","version":1},"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":"2605.15043","created_at":"2026-05-17T23:38:54.464175+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.15043v1","created_at":"2026-05-17T23:38:54.464175+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15043","created_at":"2026-05-17T23:38:54.464175+00:00"},{"alias_kind":"pith_short_12","alias_value":"GJYSDDLVW3B6","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"GJYSDDLVW3B6W5XQ","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"GJYSDDLV","created_at":"2026-05-18T12:33:37.589309+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/GJYSDDLVW3B6W5XQUEBOZH76VB","json":"https://pith.science/pith/GJYSDDLVW3B6W5XQUEBOZH76VB.json","graph_json":"https://pith.science/api/pith-number/GJYSDDLVW3B6W5XQUEBOZH76VB/graph.json","events_json":"https://pith.science/api/pith-number/GJYSDDLVW3B6W5XQUEBOZH76VB/events.json","paper":"https://pith.science/paper/GJYSDDLV"},"agent_actions":{"view_html":"https://pith.science/pith/GJYSDDLVW3B6W5XQUEBOZH76VB","download_json":"https://pith.science/pith/GJYSDDLVW3B6W5XQUEBOZH76VB.json","view_paper":"https://pith.science/paper/GJYSDDLV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.15043&json=true","fetch_graph":"https://pith.science/api/pith-number/GJYSDDLVW3B6W5XQUEBOZH76VB/graph.json","fetch_events":"https://pith.science/api/pith-number/GJYSDDLVW3B6W5XQUEBOZH76VB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GJYSDDLVW3B6W5XQUEBOZH76VB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GJYSDDLVW3B6W5XQUEBOZH76VB/action/storage_attestation","attest_author":"https://pith.science/pith/GJYSDDLVW3B6W5XQUEBOZH76VB/action/author_attestation","sign_citation":"https://pith.science/pith/GJYSDDLVW3B6W5XQUEBOZH76VB/action/citation_signature","submit_replication":"https://pith.science/pith/GJYSDDLVW3B6W5XQUEBOZH76VB/action/replication_record"}},"created_at":"2026-05-17T23:38:54.464175+00:00","updated_at":"2026-05-17T23:38:54.464175+00:00"}