{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZTIIVDL6BS7XVTY5LIXCI2MESI","short_pith_number":"pith:ZTIIVDL6","schema_version":"1.0","canonical_sha256":"ccd08a8d7e0cbf7acf1d5a2e246984922fd488066b39750026fdd742f0d8022a","source":{"kind":"arxiv","id":"1503.05072","version":2},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.05072","created_at":"2026-05-18T01:28:25.810506+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.05072v2","created_at":"2026-05-18T01:28:25.810506+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05072","created_at":"2026-05-18T01:28:25.810506+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZTIIVDL6BS7X","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZTIIVDL6BS7XVTY5","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZTIIVDL6","created_at":"2026-05-18T12:29:52.810259+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZTIIVDL6BS7XVTY5LIXCI2MESI","json":"https://pith.science/pith/ZTIIVDL6BS7XVTY5LIXCI2MESI.json","graph_json":"https://pith.science/api/pith-number/ZTIIVDL6BS7XVTY5LIXCI2MESI/graph.json","events_json":"https://pith.science/api/pith-number/ZTIIVDL6BS7XVTY5LIXCI2MESI/events.json","paper":"https://pith.science/paper/ZTIIVDL6"},"agent_actions":{"view_html":"https://pith.science/pith/ZTIIVDL6BS7XVTY5LIXCI2MESI","download_json":"https://pith.science/pith/ZTIIVDL6BS7XVTY5LIXCI2MESI.json","view_paper":"https://pith.science/paper/ZTIIVDL6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.05072&json=true","fetch_graph":"https://pith.science/api/pith-number/ZTIIVDL6BS7XVTY5LIXCI2MESI/graph.json","fetch_events":"https://pith.science/api/pith-number/ZTIIVDL6BS7XVTY5LIXCI2MESI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZTIIVDL6BS7XVTY5LIXCI2MESI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZTIIVDL6BS7XVTY5LIXCI2MESI/action/storage_attestation","attest_author":"https://pith.science/pith/ZTIIVDL6BS7XVTY5LIXCI2MESI/action/author_attestation","sign_citation":"https://pith.science/pith/ZTIIVDL6BS7XVTY5LIXCI2MESI/action/citation_signature","submit_replication":"https://pith.science/pith/ZTIIVDL6BS7XVTY5LIXCI2MESI/action/replication_record"}},"created_at":"2026-05-18T01:28:25.810506+00:00","updated_at":"2026-05-18T01:28:25.810506+00:00"}