{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:UWKQ52IIWZBCP7GL2P62UXJN67","short_pith_number":"pith:UWKQ52II","schema_version":"1.0","canonical_sha256":"a5950ee908b64227fccbd3fdaa5d2df7c6045da0c19acc57e1e8d5d55aed4f46","source":{"kind":"arxiv","id":"2410.14447","version":1},"attestation_state":"computed","paper":{"title":"How many random edges make an almost-Dirac graph Hamiltonian?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alberto Espuny D\\'iaz, Richarlotte Val\\'er\\`a Razafindravola","submitted_at":"2024-10-18T13:07:11Z","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"},"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":"2410.14447","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-18T13:07:11Z","cross_cats_sorted":[],"title_canon_sha256":"102088e2a966e536dfd14f6c8fa99b7b4769b3a1fb5b70b7d5921639da8d9560","abstract_canon_sha256":"b51b37af129dc253fbfa0ed9af16dbe5200de6332e77b61e0b015a137e0b954d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:22:32.671688Z","signature_b64":"LHK5STbeomnfMat77aihAh1T+cDBHpfQfJD91+nO2F0IYfCpRcd2B5mWFUXxU3OeDaVYg4Hn5CSOka6Sd/QkBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5950ee908b64227fccbd3fdaa5d2df7c6045da0c19acc57e1e8d5d55aed4f46","last_reissued_at":"2026-07-05T09:22:32.671221Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:22:32.671221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How many random edges make an almost-Dirac graph Hamiltonian?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alberto Espuny D\\'iaz, Richarlotte Val\\'er\\`a Razafindravola","submitted_at":"2024-10-18T13:07:11Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.14447","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.14447/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":"2410.14447","created_at":"2026-07-05T09:22:32.671274+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.14447v1","created_at":"2026-07-05T09:22:32.671274+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.14447","created_at":"2026-07-05T09:22:32.671274+00:00"},{"alias_kind":"pith_short_12","alias_value":"UWKQ52IIWZBC","created_at":"2026-07-05T09:22:32.671274+00:00"},{"alias_kind":"pith_short_16","alias_value":"UWKQ52IIWZBCP7GL","created_at":"2026-07-05T09:22:32.671274+00:00"},{"alias_kind":"pith_short_8","alias_value":"UWKQ52II","created_at":"2026-07-05T09:22:32.671274+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.31398","citing_title":"Universality for rainbow oriented cycles in perturbed digraphs","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UWKQ52IIWZBCP7GL2P62UXJN67","json":"https://pith.science/pith/UWKQ52IIWZBCP7GL2P62UXJN67.json","graph_json":"https://pith.science/api/pith-number/UWKQ52IIWZBCP7GL2P62UXJN67/graph.json","events_json":"https://pith.science/api/pith-number/UWKQ52IIWZBCP7GL2P62UXJN67/events.json","paper":"https://pith.science/paper/UWKQ52II"},"agent_actions":{"view_html":"https://pith.science/pith/UWKQ52IIWZBCP7GL2P62UXJN67","download_json":"https://pith.science/pith/UWKQ52IIWZBCP7GL2P62UXJN67.json","view_paper":"https://pith.science/paper/UWKQ52II","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.14447&json=true","fetch_graph":"https://pith.science/api/pith-number/UWKQ52IIWZBCP7GL2P62UXJN67/graph.json","fetch_events":"https://pith.science/api/pith-number/UWKQ52IIWZBCP7GL2P62UXJN67/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UWKQ52IIWZBCP7GL2P62UXJN67/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UWKQ52IIWZBCP7GL2P62UXJN67/action/storage_attestation","attest_author":"https://pith.science/pith/UWKQ52IIWZBCP7GL2P62UXJN67/action/author_attestation","sign_citation":"https://pith.science/pith/UWKQ52IIWZBCP7GL2P62UXJN67/action/citation_signature","submit_replication":"https://pith.science/pith/UWKQ52IIWZBCP7GL2P62UXJN67/action/replication_record"}},"created_at":"2026-07-05T09:22:32.671274+00:00","updated_at":"2026-07-05T09:22:32.671274+00:00"}