{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:RGAVKFI2HQ4H27Y36BZI2T7UKC","short_pith_number":"pith:RGAVKFI2","canonical_record":{"source":{"id":"1210.3581","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-12T17:19:29Z","cross_cats_sorted":[],"title_canon_sha256":"84517a5086d91a4a830457c3e1481ea3de8278375e3ce4d087e59732a870e7bb","abstract_canon_sha256":"ce6376b7dc0ddd919928dfbba23735c7a30b8ffba8d5c9cb77cd85ff07fc2e2e"},"schema_version":"1.0"},"canonical_sha256":"898155151a3c387d7f1bf0728d4ff45097c3022dcaae5c2a7bb5a099fb8481e2","source":{"kind":"arxiv","id":"1210.3581","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.3581","created_at":"2026-07-05T00:10:24Z"},{"alias_kind":"arxiv_version","alias_value":"1210.3581v2","created_at":"2026-07-05T00:10:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3581","created_at":"2026-07-05T00:10:24Z"},{"alias_kind":"pith_short_12","alias_value":"RGAVKFI2HQ4H","created_at":"2026-07-05T00:10:24Z"},{"alias_kind":"pith_short_16","alias_value":"RGAVKFI2HQ4H27Y3","created_at":"2026-07-05T00:10:24Z"},{"alias_kind":"pith_short_8","alias_value":"RGAVKFI2","created_at":"2026-07-05T00:10:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:RGAVKFI2HQ4H27Y36BZI2T7UKC","target":"record","payload":{"canonical_record":{"source":{"id":"1210.3581","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-12T17:19:29Z","cross_cats_sorted":[],"title_canon_sha256":"84517a5086d91a4a830457c3e1481ea3de8278375e3ce4d087e59732a870e7bb","abstract_canon_sha256":"ce6376b7dc0ddd919928dfbba23735c7a30b8ffba8d5c9cb77cd85ff07fc2e2e"},"schema_version":"1.0"},"canonical_sha256":"898155151a3c387d7f1bf0728d4ff45097c3022dcaae5c2a7bb5a099fb8481e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:10:24.760641Z","signature_b64":"eisrqI4oy+Hh751q8iRngS3Y7jcKAWq/d0NR3mHBjX6SaRepzCSE4OTxeRkxGA/iFL5J1IVAc2KY/ouwN+tWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"898155151a3c387d7f1bf0728d4ff45097c3022dcaae5c2a7bb5a099fb8481e2","last_reissued_at":"2026-07-05T00:10:24.760161Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:10:24.760161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.3581","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-07-05T00:10:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IkcW0J5SIrB+7CnicMvbivxlIYmyOWzPxaNaCRnoJEjdypjJPJ32jETNDfkrYu4x3DqRCGW/IqXUex6insqeAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T21:29:34.685813Z"},"content_sha256":"e752eae8ecc0056b0b1f836b7d8a1eadb96b2c56a06310790b0150a7bd3ec531","schema_version":"1.0","event_id":"sha256:e752eae8ecc0056b0b1f836b7d8a1eadb96b2c56a06310790b0150a7bd3ec531"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:RGAVKFI2HQ4H27Y36BZI2T7UKC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A natural barrier in random greedy hypergraph matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Patrick Bennett, Tom Bohman","submitted_at":"2012-10-12T17:19:29Z","abstract_excerpt":"Let $r \\ge 2$ be a fixed constant and let $ {\\mathcal H}$ be an $r$-uniform, $D$-regular hypergraph on $N$ vertices. Assume further that $ D \\to \\infty$ as $N \\to \\infty$ and that degrees of pairs of vertices in ${\\mathcal H}$ are at most $L$ where $L \\ = D/ (\\log N)^{\\omega(1)}$. We consider the random greedy algorithm for forming a matching in $ \\mathcal{H}$. We choose a matching at random by iteratively choosing edges uniformly at random to be in the matching and deleting all edges that share at least one vertex with a chosen edge before moving on to the next choice. This process terminates"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.3581","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/1210.3581/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-07-05T00:10:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qbjS5Bh0t9F/pc+a2nNPb764EWuL2sGR8jRojmRjQNxMNlPfkm5yjw/isB3cpM3Q3HRfPnz2rXxYXLqbk/8eBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T21:29:34.686764Z"},"content_sha256":"7d45f22a0a5e1745b0df0671181a1e1594d19fb7d4fefbcd19f81940718074f1","schema_version":"1.0","event_id":"sha256:7d45f22a0a5e1745b0df0671181a1e1594d19fb7d4fefbcd19f81940718074f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RGAVKFI2HQ4H27Y36BZI2T7UKC/bundle.json","state_url":"https://pith.science/pith/RGAVKFI2HQ4H27Y36BZI2T7UKC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RGAVKFI2HQ4H27Y36BZI2T7UKC/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-08-15T21:29:34Z","links":{"resolver":"https://pith.science/pith/RGAVKFI2HQ4H27Y36BZI2T7UKC","bundle":"https://pith.science/pith/RGAVKFI2HQ4H27Y36BZI2T7UKC/bundle.json","state":"https://pith.science/pith/RGAVKFI2HQ4H27Y36BZI2T7UKC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RGAVKFI2HQ4H27Y36BZI2T7UKC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RGAVKFI2HQ4H27Y36BZI2T7UKC","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":"ce6376b7dc0ddd919928dfbba23735c7a30b8ffba8d5c9cb77cd85ff07fc2e2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-12T17:19:29Z","title_canon_sha256":"84517a5086d91a4a830457c3e1481ea3de8278375e3ce4d087e59732a870e7bb"},"schema_version":"1.0","source":{"id":"1210.3581","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.3581","created_at":"2026-07-05T00:10:24Z"},{"alias_kind":"arxiv_version","alias_value":"1210.3581v2","created_at":"2026-07-05T00:10:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3581","created_at":"2026-07-05T00:10:24Z"},{"alias_kind":"pith_short_12","alias_value":"RGAVKFI2HQ4H","created_at":"2026-07-05T00:10:24Z"},{"alias_kind":"pith_short_16","alias_value":"RGAVKFI2HQ4H27Y3","created_at":"2026-07-05T00:10:24Z"},{"alias_kind":"pith_short_8","alias_value":"RGAVKFI2","created_at":"2026-07-05T00:10:24Z"}],"graph_snapshots":[{"event_id":"sha256:7d45f22a0a5e1745b0df0671181a1e1594d19fb7d4fefbcd19f81940718074f1","target":"graph","created_at":"2026-07-05T00:10:24Z","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/1210.3581/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $r \\ge 2$ be a fixed constant and let $ {\\mathcal H}$ be an $r$-uniform, $D$-regular hypergraph on $N$ vertices. Assume further that $ D \\to \\infty$ as $N \\to \\infty$ and that degrees of pairs of vertices in ${\\mathcal H}$ are at most $L$ where $L \\ = D/ (\\log N)^{\\omega(1)}$. We consider the random greedy algorithm for forming a matching in $ \\mathcal{H}$. We choose a matching at random by iteratively choosing edges uniformly at random to be in the matching and deleting all edges that share at least one vertex with a chosen edge before moving on to the next choice. This process terminates","authors_text":"Patrick Bennett, Tom Bohman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-12T17:19:29Z","title":"A natural barrier in random greedy hypergraph matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.3581","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:e752eae8ecc0056b0b1f836b7d8a1eadb96b2c56a06310790b0150a7bd3ec531","target":"record","created_at":"2026-07-05T00:10:24Z","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":"ce6376b7dc0ddd919928dfbba23735c7a30b8ffba8d5c9cb77cd85ff07fc2e2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-12T17:19:29Z","title_canon_sha256":"84517a5086d91a4a830457c3e1481ea3de8278375e3ce4d087e59732a870e7bb"},"schema_version":"1.0","source":{"id":"1210.3581","kind":"arxiv","version":2}},"canonical_sha256":"898155151a3c387d7f1bf0728d4ff45097c3022dcaae5c2a7bb5a099fb8481e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"898155151a3c387d7f1bf0728d4ff45097c3022dcaae5c2a7bb5a099fb8481e2","first_computed_at":"2026-07-05T00:10:24.760161Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:10:24.760161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eisrqI4oy+Hh751q8iRngS3Y7jcKAWq/d0NR3mHBjX6SaRepzCSE4OTxeRkxGA/iFL5J1IVAc2KY/ouwN+tWCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:10:24.760641Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.3581","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e752eae8ecc0056b0b1f836b7d8a1eadb96b2c56a06310790b0150a7bd3ec531","sha256:7d45f22a0a5e1745b0df0671181a1e1594d19fb7d4fefbcd19f81940718074f1"],"state_sha256":"a2819dbab3b712283b2817f501b376fc30960391289168c13af5155715e886a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D3Iyr4YPGDZ0hfpN6ZeCOCkIms6kchB1FfNsZPiOzKSCXO6/REDFp6QaGW5PFiJeTHDMCGZxYaoTYD8TzLTvAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T21:29:34.692799Z","bundle_sha256":"f27fd573b68d73feda0f1d42697d3f979a979a191a71a0c357783fc2b1dd19df"}}