{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:UHZBSM25CBJFDD72PIXTODNR6L","short_pith_number":"pith:UHZBSM25","canonical_record":{"source":{"id":"1011.5443","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2010-11-24T17:52:10Z","cross_cats_sorted":[],"title_canon_sha256":"be89f19185fbefc2a37a87f39f16a8e9b5ce0940799f50fad2cece11bc8225e2","abstract_canon_sha256":"12a248cc742eb3eaab4f5d7aeaabf43ddf64f0d66283e3bef61216c3bd109bd3"},"schema_version":"1.0"},"canonical_sha256":"a1f219335d1052518ffa7a2f370db1f2eaf76c775eaeaaafdd679e8c9d24c514","source":{"kind":"arxiv","id":"1011.5443","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5443","created_at":"2026-05-18T04:09:53Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5443v2","created_at":"2026-05-18T04:09:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5443","created_at":"2026-05-18T04:09:53Z"},{"alias_kind":"pith_short_12","alias_value":"UHZBSM25CBJF","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UHZBSM25CBJFDD72","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UHZBSM25","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:UHZBSM25CBJFDD72PIXTODNR6L","target":"record","payload":{"canonical_record":{"source":{"id":"1011.5443","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2010-11-24T17:52:10Z","cross_cats_sorted":[],"title_canon_sha256":"be89f19185fbefc2a37a87f39f16a8e9b5ce0940799f50fad2cece11bc8225e2","abstract_canon_sha256":"12a248cc742eb3eaab4f5d7aeaabf43ddf64f0d66283e3bef61216c3bd109bd3"},"schema_version":"1.0"},"canonical_sha256":"a1f219335d1052518ffa7a2f370db1f2eaf76c775eaeaaafdd679e8c9d24c514","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:53.726292Z","signature_b64":"WG+a9EuRX4OD3cgKQWGbWZihjQlgrHq64zZz6/1r0aol9q743baah+ZD3hGKr4Q+X7Jzw5vHHgR9C29E8yfgDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1f219335d1052518ffa7a2f370db1f2eaf76c775eaeaaafdd679e8c9d24c514","last_reissued_at":"2026-05-18T04:09:53.725621Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:53.725621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.5443","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-05-18T04:09:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u0QnwOl/knETejLKBcEu2Gg8CK3BxLNzT4Fu6ioBf2HOlFYpkK7AHi6tPa+rgFl/9hX6g0v8b3k7ldZEH3jRDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:52:36.076066Z"},"content_sha256":"2722c428eaee64a65b99db173fe4554ea07830f899ae1018e99e163e8f7b1d8c","schema_version":"1.0","event_id":"sha256:2722c428eaee64a65b99db173fe4554ea07830f899ae1018e99e163e8f7b1d8c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:UHZBSM25CBJFDD72PIXTODNR6L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Corr\\'adi and Hajnal's theorem for sparse random graphs","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Choongbum Lee, J\\'ozsef Balogh, Wojciech Samotij","submitted_at":"2010-11-24T17:52:10Z","abstract_excerpt":"In this paper we extend a classical theorem of Corr\\'adi and Hajnal into the setting of sparse random graphs. We show that if $p(n) \\gg (\\log n / n)^{1/2}$, then asymptotically almost surely every subgraph of $G(n,p)$ with minimum degree at least $(2/3 + o(1))np$ contains a triangle packing that covers all but at most $O(p^{-2})$ vertices. Moreover, the assumption on $p$ is optimal up to the $(\\log n)^{1/2}$ factor and the presence of the set of $O(p^{-2})$ uncovered vertices is indispensable. The main ingredient in the proof, which might be of independent interest, is an embedding theorem whi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5443","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":""},"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-05-18T04:09:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/zbHJKkxjbhFLfryEQxveQXt4aUzID1udRVbUOiO0OkOkkQCbPLlOvb8bfQFLW35BncvU+H+GVgoIG2BUwbiAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:52:36.076798Z"},"content_sha256":"295d248b5e9af9ae013b7383c13b074a5c80ce8a7216dcc65076ad06c5fdf721","schema_version":"1.0","event_id":"sha256:295d248b5e9af9ae013b7383c13b074a5c80ce8a7216dcc65076ad06c5fdf721"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UHZBSM25CBJFDD72PIXTODNR6L/bundle.json","state_url":"https://pith.science/pith/UHZBSM25CBJFDD72PIXTODNR6L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UHZBSM25CBJFDD72PIXTODNR6L/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-05-26T07:52:36Z","links":{"resolver":"https://pith.science/pith/UHZBSM25CBJFDD72PIXTODNR6L","bundle":"https://pith.science/pith/UHZBSM25CBJFDD72PIXTODNR6L/bundle.json","state":"https://pith.science/pith/UHZBSM25CBJFDD72PIXTODNR6L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UHZBSM25CBJFDD72PIXTODNR6L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:UHZBSM25CBJFDD72PIXTODNR6L","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":"12a248cc742eb3eaab4f5d7aeaabf43ddf64f0d66283e3bef61216c3bd109bd3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2010-11-24T17:52:10Z","title_canon_sha256":"be89f19185fbefc2a37a87f39f16a8e9b5ce0940799f50fad2cece11bc8225e2"},"schema_version":"1.0","source":{"id":"1011.5443","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5443","created_at":"2026-05-18T04:09:53Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5443v2","created_at":"2026-05-18T04:09:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5443","created_at":"2026-05-18T04:09:53Z"},{"alias_kind":"pith_short_12","alias_value":"UHZBSM25CBJF","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UHZBSM25CBJFDD72","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UHZBSM25","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:295d248b5e9af9ae013b7383c13b074a5c80ce8a7216dcc65076ad06c5fdf721","target":"graph","created_at":"2026-05-18T04:09:53Z","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"},"paper":{"abstract_excerpt":"In this paper we extend a classical theorem of Corr\\'adi and Hajnal into the setting of sparse random graphs. We show that if $p(n) \\gg (\\log n / n)^{1/2}$, then asymptotically almost surely every subgraph of $G(n,p)$ with minimum degree at least $(2/3 + o(1))np$ contains a triangle packing that covers all but at most $O(p^{-2})$ vertices. Moreover, the assumption on $p$ is optimal up to the $(\\log n)^{1/2}$ factor and the presence of the set of $O(p^{-2})$ uncovered vertices is indispensable. The main ingredient in the proof, which might be of independent interest, is an embedding theorem whi","authors_text":"Choongbum Lee, J\\'ozsef Balogh, Wojciech Samotij","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2010-11-24T17:52:10Z","title":"Corr\\'adi and Hajnal's theorem for sparse random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5443","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:2722c428eaee64a65b99db173fe4554ea07830f899ae1018e99e163e8f7b1d8c","target":"record","created_at":"2026-05-18T04:09:53Z","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":"12a248cc742eb3eaab4f5d7aeaabf43ddf64f0d66283e3bef61216c3bd109bd3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2010-11-24T17:52:10Z","title_canon_sha256":"be89f19185fbefc2a37a87f39f16a8e9b5ce0940799f50fad2cece11bc8225e2"},"schema_version":"1.0","source":{"id":"1011.5443","kind":"arxiv","version":2}},"canonical_sha256":"a1f219335d1052518ffa7a2f370db1f2eaf76c775eaeaaafdd679e8c9d24c514","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1f219335d1052518ffa7a2f370db1f2eaf76c775eaeaaafdd679e8c9d24c514","first_computed_at":"2026-05-18T04:09:53.725621Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:53.725621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WG+a9EuRX4OD3cgKQWGbWZihjQlgrHq64zZz6/1r0aol9q743baah+ZD3hGKr4Q+X7Jzw5vHHgR9C29E8yfgDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:53.726292Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.5443","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2722c428eaee64a65b99db173fe4554ea07830f899ae1018e99e163e8f7b1d8c","sha256:295d248b5e9af9ae013b7383c13b074a5c80ce8a7216dcc65076ad06c5fdf721"],"state_sha256":"6b1cffe8d90209ca690e1f8eff0f6f0f4426b08a601ecccdb0eb890f0eb064b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ovBoqRS9zOnjPfczAhGT4lVos61vlcAQvuy8ERuZKqWBuqHoxXWq0Xrqu2SdZvZ0KUCy9c0Bkfr5VcVEwPKaDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:52:36.080839Z","bundle_sha256":"1a939e24db915524a63221e3b3c18fac376bd3210cc0415bd6fb7e78e0d17dad"}}