{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:HAQQ24KSJJYHVOL7CG2V3MUDRN","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":"d847bb9fe0e577feaf80e238fa668297bd30dda7d14e5c84a67f012ba7e6ebe3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-09-02T15:24:29Z","title_canon_sha256":"f70fe1ef7d4c15b4bb205e4dc8817bcab5331bc405a5ef88cf739bcad20f2edf"},"schema_version":"1.0","source":{"id":"2209.01116","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.01116","created_at":"2026-06-23T03:13:42Z"},{"alias_kind":"arxiv_version","alias_value":"2209.01116v2","created_at":"2026-06-23T03:13:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.01116","created_at":"2026-06-23T03:13:42Z"},{"alias_kind":"pith_short_12","alias_value":"HAQQ24KSJJYH","created_at":"2026-06-23T03:13:42Z"},{"alias_kind":"pith_short_16","alias_value":"HAQQ24KSJJYHVOL7","created_at":"2026-06-23T03:13:42Z"},{"alias_kind":"pith_short_8","alias_value":"HAQQ24KS","created_at":"2026-06-23T03:13:42Z"}],"graph_snapshots":[{"event_id":"sha256:379a19bfaa41207a60965db11bfc7099f48f24e831d9169f436f30e463da3b2c","target":"graph","created_at":"2026-06-23T03:13:42Z","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/2209.01116/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Barnaby Roberts, Ewan Davies, Jan Corsten, Jozef Skokan, Julia B\\\"ottcher, Matthew Jenssen, Patrick Morris, Peter Allen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-09-02T15:24:29Z","title":"A robust Corr\\'adi--Hajnal Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.01116","kind":"arxiv","version":2},"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:dfb155a93e0ff164533f1a9a96cd2a38163731499fbef7ebadcef27e7833cdf4","target":"record","created_at":"2026-06-23T03:13:42Z","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":"d847bb9fe0e577feaf80e238fa668297bd30dda7d14e5c84a67f012ba7e6ebe3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-09-02T15:24:29Z","title_canon_sha256":"f70fe1ef7d4c15b4bb205e4dc8817bcab5331bc405a5ef88cf739bcad20f2edf"},"schema_version":"1.0","source":{"id":"2209.01116","kind":"arxiv","version":2}},"canonical_sha256":"38210d71524a707ab97f11b55db2838b578833e38489c789ec0914e179e4b187","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38210d71524a707ab97f11b55db2838b578833e38489c789ec0914e179e4b187","first_computed_at":"2026-06-23T03:13:42.301089Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T03:13:42.301089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lsNlKg3i4E8P4Pb9ix71W16YyTch/eU0SlFErgZxXC4ELdRjAThtiljGD5MsRgP6VHC5kZUnK8tCOBule+67DA==","signature_status":"signed_v1","signed_at":"2026-06-23T03:13:42.301636Z","signed_message":"canonical_sha256_bytes"},"source_id":"2209.01116","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dfb155a93e0ff164533f1a9a96cd2a38163731499fbef7ebadcef27e7833cdf4","sha256:379a19bfaa41207a60965db11bfc7099f48f24e831d9169f436f30e463da3b2c"],"state_sha256":"b89804328807e54b34a8c19693ef546ff8cf0146387b688d374c7741fa7719d7"}