{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:HAQQ24KSJJYHVOL7CG2V3MUDRN","short_pith_number":"pith:HAQQ24KS","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"},"canonical_sha256":"38210d71524a707ab97f11b55db2838b578833e38489c789ec0914e179e4b187","source":{"kind":"arxiv","id":"2209.01116","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:HAQQ24KSJJYHVOL7CG2V3MUDRN","target":"record","payload":{"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"},"canonical_sha256":"38210d71524a707ab97f11b55db2838b578833e38489c789ec0914e179e4b187","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"},"source_kind":"arxiv","source_id":"2209.01116","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-23T03:13:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t+gi6KQdd4McRIduUrUCBkkFVdZ7aas2EMtkhd3nfKgu63m17th8OFDRZJdkyILJ0Igake4n2TEEhNOKEzNZCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T05:13:18.272476Z"},"content_sha256":"dfb155a93e0ff164533f1a9a96cd2a38163731499fbef7ebadcef27e7833cdf4","schema_version":"1.0","event_id":"sha256:dfb155a93e0ff164533f1a9a96cd2a38163731499fbef7ebadcef27e7833cdf4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:HAQQ24KSJJYHVOL7CG2V3MUDRN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-23T03:13:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wzOfxaOhrU1DyRpDuJGlSTlEjjilL260Ed6pfe8LviPoMX4B8rhuXLrZ+cblSnH3lyaKZE47JA9pBwrl9V48BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T05:13:18.272856Z"},"content_sha256":"379a19bfaa41207a60965db11bfc7099f48f24e831d9169f436f30e463da3b2c","schema_version":"1.0","event_id":"sha256:379a19bfaa41207a60965db11bfc7099f48f24e831d9169f436f30e463da3b2c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HAQQ24KSJJYHVOL7CG2V3MUDRN/bundle.json","state_url":"https://pith.science/pith/HAQQ24KSJJYHVOL7CG2V3MUDRN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HAQQ24KSJJYHVOL7CG2V3MUDRN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T05:13:18Z","links":{"resolver":"https://pith.science/pith/HAQQ24KSJJYHVOL7CG2V3MUDRN","bundle":"https://pith.science/pith/HAQQ24KSJJYHVOL7CG2V3MUDRN/bundle.json","state":"https://pith.science/pith/HAQQ24KSJJYHVOL7CG2V3MUDRN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HAQQ24KSJJYHVOL7CG2V3MUDRN/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lpQZKHKxIOtwTNYoH+r04iwtz9bWArC/2wGJw+aoBrp43P9zr3ktfC1MGCHZvRAotCbTe0j6jFhVyHjRj5qQAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T05:13:18.274946Z","bundle_sha256":"2832b50eccf3a1e0982edf1e505e1b9a02301780b62a276cee980d8317299541"}}