{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:UWKQ52IIWZBCP7GL2P62UXJN67","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":"b51b37af129dc253fbfa0ed9af16dbe5200de6332e77b61e0b015a137e0b954d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-18T13:07:11Z","title_canon_sha256":"102088e2a966e536dfd14f6c8fa99b7b4769b3a1fb5b70b7d5921639da8d9560"},"schema_version":"1.0","source":{"id":"2410.14447","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.14447","created_at":"2026-07-05T09:22:32Z"},{"alias_kind":"arxiv_version","alias_value":"2410.14447v1","created_at":"2026-07-05T09:22:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.14447","created_at":"2026-07-05T09:22:32Z"},{"alias_kind":"pith_short_12","alias_value":"UWKQ52IIWZBC","created_at":"2026-07-05T09:22:32Z"},{"alias_kind":"pith_short_16","alias_value":"UWKQ52IIWZBCP7GL","created_at":"2026-07-05T09:22:32Z"},{"alias_kind":"pith_short_8","alias_value":"UWKQ52II","created_at":"2026-07-05T09:22:32Z"}],"graph_snapshots":[{"event_id":"sha256:99c6e5e3d3bd5c21fe286e48e81c7f7cc99ab6bb7860cfd33762ff3d62afb8c3","target":"graph","created_at":"2026-07-05T09:22:32Z","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/2410.14447/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study Hamiltonicity in the union of an $n$-vertex graph $H$ with high minimum degree and a binomial random graph on the same vertex set. In particular, we consider the case when $H$ has minimum degree close to $n/2$. We determine the perturbed threshold for Hamiltonicity in this setting.\n  To be precise, let $\\eta:= n/2-\\delta(H)$. For $\\eta=\\omega(1)$, we show that it suffices to add $\\Theta(\\eta)$ random edges to $H$ to a.a.s. obtain a Hamiltonian graph; for $\\eta=\\Theta(1)$, we show that $\\omega(1)$ edges suffice. In fact, when $\\eta=o(n)$ and $\\eta=\\omega(1)$, we show that $(8+o(1))\\eta","authors_text":"Alberto Espuny D\\'iaz, Richarlotte Val\\'er\\`a Razafindravola","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-18T13:07:11Z","title":"How many random edges make an almost-Dirac graph Hamiltonian?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.14447","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:827906e0fb1ba5ce946b1a6d737081dba7deb2e09713ff5a781ec2b7ac856a20","target":"record","created_at":"2026-07-05T09:22:32Z","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":"b51b37af129dc253fbfa0ed9af16dbe5200de6332e77b61e0b015a137e0b954d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-18T13:07:11Z","title_canon_sha256":"102088e2a966e536dfd14f6c8fa99b7b4769b3a1fb5b70b7d5921639da8d9560"},"schema_version":"1.0","source":{"id":"2410.14447","kind":"arxiv","version":1}},"canonical_sha256":"a5950ee908b64227fccbd3fdaa5d2df7c6045da0c19acc57e1e8d5d55aed4f46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5950ee908b64227fccbd3fdaa5d2df7c6045da0c19acc57e1e8d5d55aed4f46","first_computed_at":"2026-07-05T09:22:32.671221Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:22:32.671221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LHK5STbeomnfMat77aihAh1T+cDBHpfQfJD91+nO2F0IYfCpRcd2B5mWFUXxU3OeDaVYg4Hn5CSOka6Sd/QkBA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:22:32.671688Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.14447","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:827906e0fb1ba5ce946b1a6d737081dba7deb2e09713ff5a781ec2b7ac856a20","sha256:99c6e5e3d3bd5c21fe286e48e81c7f7cc99ab6bb7860cfd33762ff3d62afb8c3"],"state_sha256":"7aced159090b00ce4184a4470f7be1bbbc7c5d43d28b479d5a0f6837e17fc92d"}