{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:HAQQ24KSJJYHVOL7CG2V3MUDRN","short_pith_number":"pith:HAQQ24KS","schema_version":"1.0","canonical_sha256":"38210d71524a707ab97f11b55db2838b578833e38489c789ec0914e179e4b187","source":{"kind":"arxiv","id":"2209.01116","version":2},"attestation_state":"computed","paper":{"title":"A robust Corr\\'adi--Hajnal Theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Barnaby Roberts, Ewan Davies, Jan Corsten, Jozef Skokan, Julia B\\\"ottcher, Matthew Jenssen, Patrick Morris, Peter Allen","submitted_at":"2022-09-02T15:24:29Z","abstract_excerpt":"For a graph $G$ and $p\\in[0,1]$, we denote by $G_p$ the random sparsification of $G$ obtained by keeping each edge of $G$ independently, with probability $p$. We show that there exists a $C>0$ such that if $p\\geq C(\\log n)^{1/3}n^{-2/3}$ and $G$ is an $n$-vertex graph with $n\\in 3\\mathbb{N}$ and $\\delta(G)\\geq \\tfrac{2n}{3}$, then with high probability $G_p$ contains a triangle factor. Both the minimum degree condition and the probability condition, up to the choice of $C$, are tight. Our result can be viewed as a common strengthening of the seminal theorems of Corr\\'adi and Hajnal, which deal"},"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":"2209.01116","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-09-02T15:24:29Z","cross_cats_sorted":[],"title_canon_sha256":"f70fe1ef7d4c15b4bb205e4dc8817bcab5331bc405a5ef88cf739bcad20f2edf","abstract_canon_sha256":"d847bb9fe0e577feaf80e238fa668297bd30dda7d14e5c84a67f012ba7e6ebe3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T03:13:42.301636Z","signature_b64":"lsNlKg3i4E8P4Pb9ix71W16YyTch/eU0SlFErgZxXC4ELdRjAThtiljGD5MsRgP6VHC5kZUnK8tCOBule+67DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38210d71524a707ab97f11b55db2838b578833e38489c789ec0914e179e4b187","last_reissued_at":"2026-06-23T03:13:42.301089Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T03:13:42.301089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A robust Corr\\'adi--Hajnal Theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Barnaby Roberts, Ewan Davies, Jan Corsten, Jozef Skokan, Julia B\\\"ottcher, Matthew Jenssen, Patrick Morris, Peter Allen","submitted_at":"2022-09-02T15:24:29Z","abstract_excerpt":"For a graph $G$ and $p\\in[0,1]$, we denote by $G_p$ the random sparsification of $G$ obtained by keeping each edge of $G$ independently, with probability $p$. We show that there exists a $C>0$ such that if $p\\geq C(\\log n)^{1/3}n^{-2/3}$ and $G$ is an $n$-vertex graph with $n\\in 3\\mathbb{N}$ and $\\delta(G)\\geq \\tfrac{2n}{3}$, then with high probability $G_p$ contains a triangle factor. Both the minimum degree condition and the probability condition, up to the choice of $C$, are tight. Our result can be viewed as a common strengthening of the seminal theorems of Corr\\'adi and Hajnal, which deal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.01116","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/2209.01116/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":"2209.01116","created_at":"2026-06-23T03:13:42.301148+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.01116v2","created_at":"2026-06-23T03:13:42.301148+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.01116","created_at":"2026-06-23T03:13:42.301148+00:00"},{"alias_kind":"pith_short_12","alias_value":"HAQQ24KSJJYH","created_at":"2026-06-23T03:13:42.301148+00:00"},{"alias_kind":"pith_short_16","alias_value":"HAQQ24KSJJYHVOL7","created_at":"2026-06-23T03:13:42.301148+00:00"},{"alias_kind":"pith_short_8","alias_value":"HAQQ24KS","created_at":"2026-06-23T03:13:42.301148+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/HAQQ24KSJJYHVOL7CG2V3MUDRN","json":"https://pith.science/pith/HAQQ24KSJJYHVOL7CG2V3MUDRN.json","graph_json":"https://pith.science/api/pith-number/HAQQ24KSJJYHVOL7CG2V3MUDRN/graph.json","events_json":"https://pith.science/api/pith-number/HAQQ24KSJJYHVOL7CG2V3MUDRN/events.json","paper":"https://pith.science/paper/HAQQ24KS"},"agent_actions":{"view_html":"https://pith.science/pith/HAQQ24KSJJYHVOL7CG2V3MUDRN","download_json":"https://pith.science/pith/HAQQ24KSJJYHVOL7CG2V3MUDRN.json","view_paper":"https://pith.science/paper/HAQQ24KS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.01116&json=true","fetch_graph":"https://pith.science/api/pith-number/HAQQ24KSJJYHVOL7CG2V3MUDRN/graph.json","fetch_events":"https://pith.science/api/pith-number/HAQQ24KSJJYHVOL7CG2V3MUDRN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HAQQ24KSJJYHVOL7CG2V3MUDRN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HAQQ24KSJJYHVOL7CG2V3MUDRN/action/storage_attestation","attest_author":"https://pith.science/pith/HAQQ24KSJJYHVOL7CG2V3MUDRN/action/author_attestation","sign_citation":"https://pith.science/pith/HAQQ24KSJJYHVOL7CG2V3MUDRN/action/citation_signature","submit_replication":"https://pith.science/pith/HAQQ24KSJJYHVOL7CG2V3MUDRN/action/replication_record"}},"created_at":"2026-06-23T03:13:42.301148+00:00","updated_at":"2026-06-23T03:13:42.301148+00:00"}