{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:BNN66V65CW3CC4LXRC3USDI6XB","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":"4220568011b9ee61513eb67cf52f3bd75470d60ef6bab78fab767321ff38ba5f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-02-01T16:38:43Z","title_canon_sha256":"cbc60a9ec6a368ea197be37de85e490620ca2cb6c3bafb7122ef03efcd8dd56a"},"schema_version":"1.0","source":{"id":"2502.00489","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.00489","created_at":"2026-07-05T10:08:34Z"},{"alias_kind":"arxiv_version","alias_value":"2502.00489v1","created_at":"2026-07-05T10:08:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.00489","created_at":"2026-07-05T10:08:34Z"},{"alias_kind":"pith_short_12","alias_value":"BNN66V65CW3C","created_at":"2026-07-05T10:08:34Z"},{"alias_kind":"pith_short_16","alias_value":"BNN66V65CW3CC4LX","created_at":"2026-07-05T10:08:34Z"},{"alias_kind":"pith_short_8","alias_value":"BNN66V65","created_at":"2026-07-05T10:08:34Z"}],"graph_snapshots":[{"event_id":"sha256:c073b4bafab5c950c1a159b5b407eb3a32b48ff87d4af8212a00213f9ac0f2e2","target":"graph","created_at":"2026-07-05T10:08:34Z","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/2502.00489/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"What minimum degree of a graph $G$ on $n$ vertices guarantees that the union of $G$ and a random $2$-factor (or permutation) is with high probability Hamiltonian? Gir\\~ao and Espuny D{\\'\\i}az showed that the answer lies in the interval $[\\tfrac15 \\log n, n^{3/4+o(1)}]$. We improve both the upper and lower bounds to resolve this problem asymptotically, showing that the answer is $(1+o(1))\\sqrt{n\\log n/2}$. Furthermore, if $G$ is assumed to be (nearly) regular then we obtain the much stronger bound that any degree growing at least polylogarithmically in $n$ is sufficient for Hamiltonicity. Our p","authors_text":"Nemanja Dragani\\'c, Peter Keevash","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-02-01T16:38:43Z","title":"P\\'osa rotation through a random permutation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.00489","kind":"arxiv","version":1},"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:e35a0f7ae0093aa634fd99bf3f9f03a508a1d07ea361d89ca3f630a757839e30","target":"record","created_at":"2026-07-05T10:08:34Z","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":"4220568011b9ee61513eb67cf52f3bd75470d60ef6bab78fab767321ff38ba5f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-02-01T16:38:43Z","title_canon_sha256":"cbc60a9ec6a368ea197be37de85e490620ca2cb6c3bafb7122ef03efcd8dd56a"},"schema_version":"1.0","source":{"id":"2502.00489","kind":"arxiv","version":1}},"canonical_sha256":"0b5bef57dd15b621717788b7490d1eb8529be7d36ccd057928fee3c9e05932af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b5bef57dd15b621717788b7490d1eb8529be7d36ccd057928fee3c9e05932af","first_computed_at":"2026-07-05T10:08:34.433535Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:08:34.433535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X7+Zug3x1+nYOBOYw2ufdDze5u1DbQzvTA9UUsIJguyaDxY8JTdTTOwlZUuBhOJcNPargN+vOicSAVH6Td4ZAA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:08:34.434031Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.00489","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e35a0f7ae0093aa634fd99bf3f9f03a508a1d07ea361d89ca3f630a757839e30","sha256:c073b4bafab5c950c1a159b5b407eb3a32b48ff87d4af8212a00213f9ac0f2e2"],"state_sha256":"84b95b9efeeb6d1fc02e780bb5ddaed914bda7b24c18e2560bbfba750d7539ab"}