{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:B7J7P2PCOWCCHLZ3LDAZRHRV2Y","short_pith_number":"pith:B7J7P2PC","schema_version":"1.0","canonical_sha256":"0fd3f7e9e2758423af3b58c1989e35d619d1b7821682bd57aca82f270a7207f0","source":{"kind":"arxiv","id":"2506.21756","version":2},"attestation_state":"computed","paper":{"title":"Hamilton cycles in regular graphs perturbed by a random 2-factor","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cicely (Cece) Henderson, Dingjia Mao, Patryk Morawski, Sean Longbrake","submitted_at":"2025-06-26T20:25:01Z","abstract_excerpt":"In this paper, we prove that for each $d \\geq 2$, the union of a $d$-regular graph with a uniformly random $2$-factor on the same vertex set is Hamiltonian with high probability. This resolves a conjecture by Dragani\\'c and Keevash for all values of $d$."},"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":"2506.21756","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-26T20:25:01Z","cross_cats_sorted":[],"title_canon_sha256":"825fc343561cee03f8b29a49c28d967d614ae59efffe9d41b2c271dae3b572cf","abstract_canon_sha256":"6015274ffd889aeb5fa1ea676757c379a460a4d341b52ba04761dbdbf39c8ff2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:58:31.826135Z","signature_b64":"qthrIcGA9idZKb0BM/PEDlA/yHwaZu46gOq32S+SZo18PJCisq41wqJGxY17O7WjmiwxU9TOkphrIa+3M/u2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fd3f7e9e2758423af3b58c1989e35d619d1b7821682bd57aca82f270a7207f0","last_reissued_at":"2026-07-05T11:58:31.825669Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:58:31.825669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hamilton cycles in regular graphs perturbed by a random 2-factor","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cicely (Cece) Henderson, Dingjia Mao, Patryk Morawski, Sean Longbrake","submitted_at":"2025-06-26T20:25:01Z","abstract_excerpt":"In this paper, we prove that for each $d \\geq 2$, the union of a $d$-regular graph with a uniformly random $2$-factor on the same vertex set is Hamiltonian with high probability. This resolves a conjecture by Dragani\\'c and Keevash for all values of $d$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.21756","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/2506.21756/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":"2506.21756","created_at":"2026-07-05T11:58:31.825729+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.21756v2","created_at":"2026-07-05T11:58:31.825729+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.21756","created_at":"2026-07-05T11:58:31.825729+00:00"},{"alias_kind":"pith_short_12","alias_value":"B7J7P2PCOWCC","created_at":"2026-07-05T11:58:31.825729+00:00"},{"alias_kind":"pith_short_16","alias_value":"B7J7P2PCOWCCHLZ3","created_at":"2026-07-05T11:58:31.825729+00:00"},{"alias_kind":"pith_short_8","alias_value":"B7J7P2PC","created_at":"2026-07-05T11:58:31.825729+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.02160","citing_title":"Pancyclicity of graphs perturbed by a random $F$-factor","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B7J7P2PCOWCCHLZ3LDAZRHRV2Y","json":"https://pith.science/pith/B7J7P2PCOWCCHLZ3LDAZRHRV2Y.json","graph_json":"https://pith.science/api/pith-number/B7J7P2PCOWCCHLZ3LDAZRHRV2Y/graph.json","events_json":"https://pith.science/api/pith-number/B7J7P2PCOWCCHLZ3LDAZRHRV2Y/events.json","paper":"https://pith.science/paper/B7J7P2PC"},"agent_actions":{"view_html":"https://pith.science/pith/B7J7P2PCOWCCHLZ3LDAZRHRV2Y","download_json":"https://pith.science/pith/B7J7P2PCOWCCHLZ3LDAZRHRV2Y.json","view_paper":"https://pith.science/paper/B7J7P2PC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.21756&json=true","fetch_graph":"https://pith.science/api/pith-number/B7J7P2PCOWCCHLZ3LDAZRHRV2Y/graph.json","fetch_events":"https://pith.science/api/pith-number/B7J7P2PCOWCCHLZ3LDAZRHRV2Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B7J7P2PCOWCCHLZ3LDAZRHRV2Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B7J7P2PCOWCCHLZ3LDAZRHRV2Y/action/storage_attestation","attest_author":"https://pith.science/pith/B7J7P2PCOWCCHLZ3LDAZRHRV2Y/action/author_attestation","sign_citation":"https://pith.science/pith/B7J7P2PCOWCCHLZ3LDAZRHRV2Y/action/citation_signature","submit_replication":"https://pith.science/pith/B7J7P2PCOWCCHLZ3LDAZRHRV2Y/action/replication_record"}},"created_at":"2026-07-05T11:58:31.825729+00:00","updated_at":"2026-07-05T11:58:31.825729+00:00"}