{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:OBEZ2OKI2QLA7X4SQFCG4PVSXV","short_pith_number":"pith:OBEZ2OKI","schema_version":"1.0","canonical_sha256":"70499d3948d4160fdf9281446e3eb2bd446ceccd09f781b36391df959f95a7ab","source":{"kind":"arxiv","id":"2007.02891","version":2},"attestation_state":"computed","paper":{"title":"Hamiltonicity of random subgraphs of the hypercube","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alberto Espuny D\\'iaz, Ant\\'onio Gir\\~ao, Daniela K\\\"uhn, Deryk Osthus, Padraig Condon","submitted_at":"2020-07-06T17:07:05Z","abstract_excerpt":"We study Hamiltonicity in random subgraphs of the hypercube $\\mathcal{Q}^n$. Our first main theorem is an optimal hitting time result. Consider the random process which includes the edges of $\\mathcal{Q}^n$ according to a uniformly chosen random ordering. Then, with high probability, as soon as the graph produced by this process has minimum degree $2k$, it contains $k$ edge-disjoint Hamilton cycles, for any fixed $k\\in\\mathbb{N}$. Secondly, we obtain a perturbation result: if $H\\subseteq\\mathcal{Q}^n$ satisfies $\\delta(H)\\geq\\alpha n$ with $\\alpha>0$ fixed and we consider a random binomial sub"},"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":"2007.02891","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2020-07-06T17:07:05Z","cross_cats_sorted":[],"title_canon_sha256":"a24ac0f1f668422c2c0c18167cce6867d94c3613883fd1888ba35c66f359342b","abstract_canon_sha256":"e0e7535f0c13bf4ada4f59795b5e8bf3de847570cad57b95a4a8ecb20c4d4b90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:48:05.910479Z","signature_b64":"xXCzRxwH9ZJNmMy3k98hPoU7ToxcbULjRtixNdY3vKy6J+jTCtKr4iaC7MZ/wqEcIHUhGWadvmBnFkWanF0ABg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70499d3948d4160fdf9281446e3eb2bd446ceccd09f781b36391df959f95a7ab","last_reissued_at":"2026-07-05T04:48:05.910072Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:48:05.910072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hamiltonicity of random subgraphs of the hypercube","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alberto Espuny D\\'iaz, Ant\\'onio Gir\\~ao, Daniela K\\\"uhn, Deryk Osthus, Padraig Condon","submitted_at":"2020-07-06T17:07:05Z","abstract_excerpt":"We study Hamiltonicity in random subgraphs of the hypercube $\\mathcal{Q}^n$. Our first main theorem is an optimal hitting time result. Consider the random process which includes the edges of $\\mathcal{Q}^n$ according to a uniformly chosen random ordering. Then, with high probability, as soon as the graph produced by this process has minimum degree $2k$, it contains $k$ edge-disjoint Hamilton cycles, for any fixed $k\\in\\mathbb{N}$. Secondly, we obtain a perturbation result: if $H\\subseteq\\mathcal{Q}^n$ satisfies $\\delta(H)\\geq\\alpha n$ with $\\alpha>0$ fixed and we consider a random binomial sub"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.02891","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/2007.02891/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":"2007.02891","created_at":"2026-07-05T04:48:05.910136+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.02891v2","created_at":"2026-07-05T04:48:05.910136+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.02891","created_at":"2026-07-05T04:48:05.910136+00:00"},{"alias_kind":"pith_short_12","alias_value":"OBEZ2OKI2QLA","created_at":"2026-07-05T04:48:05.910136+00:00"},{"alias_kind":"pith_short_16","alias_value":"OBEZ2OKI2QLA7X4S","created_at":"2026-07-05T04:48:05.910136+00:00"},{"alias_kind":"pith_short_8","alias_value":"OBEZ2OKI","created_at":"2026-07-05T04:48:05.910136+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/OBEZ2OKI2QLA7X4SQFCG4PVSXV","json":"https://pith.science/pith/OBEZ2OKI2QLA7X4SQFCG4PVSXV.json","graph_json":"https://pith.science/api/pith-number/OBEZ2OKI2QLA7X4SQFCG4PVSXV/graph.json","events_json":"https://pith.science/api/pith-number/OBEZ2OKI2QLA7X4SQFCG4PVSXV/events.json","paper":"https://pith.science/paper/OBEZ2OKI"},"agent_actions":{"view_html":"https://pith.science/pith/OBEZ2OKI2QLA7X4SQFCG4PVSXV","download_json":"https://pith.science/pith/OBEZ2OKI2QLA7X4SQFCG4PVSXV.json","view_paper":"https://pith.science/paper/OBEZ2OKI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.02891&json=true","fetch_graph":"https://pith.science/api/pith-number/OBEZ2OKI2QLA7X4SQFCG4PVSXV/graph.json","fetch_events":"https://pith.science/api/pith-number/OBEZ2OKI2QLA7X4SQFCG4PVSXV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OBEZ2OKI2QLA7X4SQFCG4PVSXV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OBEZ2OKI2QLA7X4SQFCG4PVSXV/action/storage_attestation","attest_author":"https://pith.science/pith/OBEZ2OKI2QLA7X4SQFCG4PVSXV/action/author_attestation","sign_citation":"https://pith.science/pith/OBEZ2OKI2QLA7X4SQFCG4PVSXV/action/citation_signature","submit_replication":"https://pith.science/pith/OBEZ2OKI2QLA7X4SQFCG4PVSXV/action/replication_record"}},"created_at":"2026-07-05T04:48:05.910136+00:00","updated_at":"2026-07-05T04:48:05.910136+00:00"}