{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZTIIVDL6BS7XVTY5LIXCI2MESI","short_pith_number":"pith:ZTIIVDL6","canonical_record":{"source":{"id":"1503.05072","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-15T17:08:59Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"5c5a09b57e5aa5c755779626c60122f5e91f42a598f0ec71e554e58ebfbee14d","abstract_canon_sha256":"bc9f52c1136577512038788216b86b44edc5ff947db1d007f144dcb93e8b0d81"},"schema_version":"1.0"},"canonical_sha256":"ccd08a8d7e0cbf7acf1d5a2e246984922fd488066b39750026fdd742f0d8022a","source":{"kind":"arxiv","id":"1503.05072","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.05072","created_at":"2026-05-18T01:28:25Z"},{"alias_kind":"arxiv_version","alias_value":"1503.05072v2","created_at":"2026-05-18T01:28:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05072","created_at":"2026-05-18T01:28:25Z"},{"alias_kind":"pith_short_12","alias_value":"ZTIIVDL6BS7X","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZTIIVDL6BS7XVTY5","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZTIIVDL6","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZTIIVDL6BS7XVTY5LIXCI2MESI","target":"record","payload":{"canonical_record":{"source":{"id":"1503.05072","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-15T17:08:59Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"5c5a09b57e5aa5c755779626c60122f5e91f42a598f0ec71e554e58ebfbee14d","abstract_canon_sha256":"bc9f52c1136577512038788216b86b44edc5ff947db1d007f144dcb93e8b0d81"},"schema_version":"1.0"},"canonical_sha256":"ccd08a8d7e0cbf7acf1d5a2e246984922fd488066b39750026fdd742f0d8022a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:25.811042Z","signature_b64":"rVR0siHGIJqoZwv0q10fG4eCw/SGgeZXkbQxLSz7p6bHhisnquFFZySX1yHj2eGP3cj1Rhyd+ovG5QTkMvS+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccd08a8d7e0cbf7acf1d5a2e246984922fd488066b39750026fdd742f0d8022a","last_reissued_at":"2026-05-18T01:28:25.810393Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:25.810393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.05072","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-18T01:28:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zU8u3+LCCEOXRMRBjavgXj7/jnDQgn+qVx1f/Q1FzhUpPjxLgY5dsSXwSgXP7AcjOysiLWt26flm270h2vWDCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:05:20.814226Z"},"content_sha256":"80a354e1d5698dfc1ce6b8bfd450707b20c960d6d341fcdc27c5b3c7a3dbf603","schema_version":"1.0","event_id":"sha256:80a354e1d5698dfc1ce6b8bfd450707b20c960d6d341fcdc27c5b3c7a3dbf603"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZTIIVDL6BS7XVTY5LIXCI2MESI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A random triadic process","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Benny Sudakov, D\\'aniel Kor\\'andi, Yuval Peled","submitted_at":"2015-03-15T17:08:59Z","abstract_excerpt":"Given a random 3-uniform hypergraph $H=H(n,p)$ on $n$ vertices where each triple independently appears with probability $p$, consider the following graph process. We start with the star $G_0$ on the same vertex set, containing all the edges incident to some vertex $v_0$, and repeatedly add an edge $xy$ if there is a vertex $z$ such that $xz$ and $zy$ are already in the graph and $xzy \\in H$. We say that the process propagates if it reaches the complete graph before it terminates. In this paper we prove that the threshold probability for propagation is $p=\\frac{1}{2\\sqrt{n}}$. We conclude that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.05072","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-18T01:28:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A+culk2f7SOMekKdMjuU1ug8bJYQgjcx6qFX3wBKexLgdQV7X62fUfS5TaUG37csb5IGjH0ypxU3qWXTOC+ZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:05:20.814909Z"},"content_sha256":"17a3bd39374f0dc20104d3997bc785bfd03f1d3dc027b0ab833d8bf7bc023674","schema_version":"1.0","event_id":"sha256:17a3bd39374f0dc20104d3997bc785bfd03f1d3dc027b0ab833d8bf7bc023674"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZTIIVDL6BS7XVTY5LIXCI2MESI/bundle.json","state_url":"https://pith.science/pith/ZTIIVDL6BS7XVTY5LIXCI2MESI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZTIIVDL6BS7XVTY5LIXCI2MESI/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-30T10:05:20Z","links":{"resolver":"https://pith.science/pith/ZTIIVDL6BS7XVTY5LIXCI2MESI","bundle":"https://pith.science/pith/ZTIIVDL6BS7XVTY5LIXCI2MESI/bundle.json","state":"https://pith.science/pith/ZTIIVDL6BS7XVTY5LIXCI2MESI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZTIIVDL6BS7XVTY5LIXCI2MESI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZTIIVDL6BS7XVTY5LIXCI2MESI","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":"bc9f52c1136577512038788216b86b44edc5ff947db1d007f144dcb93e8b0d81","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-15T17:08:59Z","title_canon_sha256":"5c5a09b57e5aa5c755779626c60122f5e91f42a598f0ec71e554e58ebfbee14d"},"schema_version":"1.0","source":{"id":"1503.05072","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.05072","created_at":"2026-05-18T01:28:25Z"},{"alias_kind":"arxiv_version","alias_value":"1503.05072v2","created_at":"2026-05-18T01:28:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05072","created_at":"2026-05-18T01:28:25Z"},{"alias_kind":"pith_short_12","alias_value":"ZTIIVDL6BS7X","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZTIIVDL6BS7XVTY5","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZTIIVDL6","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:17a3bd39374f0dc20104d3997bc785bfd03f1d3dc027b0ab833d8bf7bc023674","target":"graph","created_at":"2026-05-18T01:28:25Z","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":"Given a random 3-uniform hypergraph $H=H(n,p)$ on $n$ vertices where each triple independently appears with probability $p$, consider the following graph process. We start with the star $G_0$ on the same vertex set, containing all the edges incident to some vertex $v_0$, and repeatedly add an edge $xy$ if there is a vertex $z$ such that $xz$ and $zy$ are already in the graph and $xzy \\in H$. We say that the process propagates if it reaches the complete graph before it terminates. In this paper we prove that the threshold probability for propagation is $p=\\frac{1}{2\\sqrt{n}}$. We conclude that ","authors_text":"Benny Sudakov, D\\'aniel Kor\\'andi, Yuval Peled","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-15T17:08:59Z","title":"A random triadic process"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.05072","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:80a354e1d5698dfc1ce6b8bfd450707b20c960d6d341fcdc27c5b3c7a3dbf603","target":"record","created_at":"2026-05-18T01:28:25Z","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":"bc9f52c1136577512038788216b86b44edc5ff947db1d007f144dcb93e8b0d81","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-15T17:08:59Z","title_canon_sha256":"5c5a09b57e5aa5c755779626c60122f5e91f42a598f0ec71e554e58ebfbee14d"},"schema_version":"1.0","source":{"id":"1503.05072","kind":"arxiv","version":2}},"canonical_sha256":"ccd08a8d7e0cbf7acf1d5a2e246984922fd488066b39750026fdd742f0d8022a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ccd08a8d7e0cbf7acf1d5a2e246984922fd488066b39750026fdd742f0d8022a","first_computed_at":"2026-05-18T01:28:25.810393Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:28:25.810393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rVR0siHGIJqoZwv0q10fG4eCw/SGgeZXkbQxLSz7p6bHhisnquFFZySX1yHj2eGP3cj1Rhyd+ovG5QTkMvS+AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:28:25.811042Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.05072","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80a354e1d5698dfc1ce6b8bfd450707b20c960d6d341fcdc27c5b3c7a3dbf603","sha256:17a3bd39374f0dc20104d3997bc785bfd03f1d3dc027b0ab833d8bf7bc023674"],"state_sha256":"b007c7158eb54bdbc6cf4f179077019c55fcb328345932216af61731c7a53a7e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9fB0shFYXBorCuv7zMrdzfov9n3RFhUwZOofWeBvqNwF9Tk+oTzmkpKjqjGUsG75hmXBxfKstSWzGkQ8EFRWBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:05:20.818645Z","bundle_sha256":"a2ed8f6521c3afeed54afad9a0224626a8d42e865327c2eec2bc156d03b4eb1a"}}