{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NHPYXJP3UGOSRON7F42U5PDOFH","short_pith_number":"pith:NHPYXJP3","schema_version":"1.0","canonical_sha256":"69df8ba5fba19d28b9bf2f354ebc6e29fc096925642453e3352845f77e92c28a","source":{"kind":"arxiv","id":"1806.03351","version":1},"attestation_state":"computed","paper":{"title":"On simple connectivity of random 2-complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT","math.PR"],"primary_cat":"math.CO","authors_text":"Yuval Peled, Zur Luria","submitted_at":"2018-06-08T20:52:13Z","abstract_excerpt":"The fundamental group of the $2$-dimensional Linial-Meshulam random simplicial complex $Y_2(n,p)$ was first studied by Babson, Hoffman and Kahle. They proved that the threshold probability for simple connectivity of $Y_2(n,p)$ is about $p\\approx n^{-1/2}$. In this paper, we show that this threshold probability is at most $p\\le (\\gamma n)^{-1/2}$, where $\\gamma = 4^4/3^3$, and conjecture that this threshold is sharp.\n  In fact, we show that $p=(\\gamma n)^{-1/2}$ is a sharp threshold probability for the stronger property that every cycle of length $3$ is the boundary of a subcomplex of $Y_2(n,p)"},"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":"1806.03351","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-08T20:52:13Z","cross_cats_sorted":["math.GT","math.PR"],"title_canon_sha256":"8dc172f9ee55f3ce57aac991f9345c5d2b31e7ebf65f0e4ecb3b89ae09dbeb17","abstract_canon_sha256":"773b5720576a1cbf146a20d8c6615c8392e9a74dc743fa45e95c66493adac7af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:43.679341Z","signature_b64":"nCg4yCsSxGU0kp4Hhe9Xs9VujI/U70sg8X03K6oZa/XWu8io4YOaHkug/5z3ckX7ELjEKc6y24ofDJRB/yagAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69df8ba5fba19d28b9bf2f354ebc6e29fc096925642453e3352845f77e92c28a","last_reissued_at":"2026-05-18T00:13:43.678628Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:43.678628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On simple connectivity of random 2-complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT","math.PR"],"primary_cat":"math.CO","authors_text":"Yuval Peled, Zur Luria","submitted_at":"2018-06-08T20:52:13Z","abstract_excerpt":"The fundamental group of the $2$-dimensional Linial-Meshulam random simplicial complex $Y_2(n,p)$ was first studied by Babson, Hoffman and Kahle. They proved that the threshold probability for simple connectivity of $Y_2(n,p)$ is about $p\\approx n^{-1/2}$. In this paper, we show that this threshold probability is at most $p\\le (\\gamma n)^{-1/2}$, where $\\gamma = 4^4/3^3$, and conjecture that this threshold is sharp.\n  In fact, we show that $p=(\\gamma n)^{-1/2}$ is a sharp threshold probability for the stronger property that every cycle of length $3$ is the boundary of a subcomplex of $Y_2(n,p)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03351","kind":"arxiv","version":1},"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":"1806.03351","created_at":"2026-05-18T00:13:43.678747+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.03351v1","created_at":"2026-05-18T00:13:43.678747+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03351","created_at":"2026-05-18T00:13:43.678747+00:00"},{"alias_kind":"pith_short_12","alias_value":"NHPYXJP3UGOS","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NHPYXJP3UGOSRON7","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NHPYXJP3","created_at":"2026-05-18T12:32:40.477152+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/NHPYXJP3UGOSRON7F42U5PDOFH","json":"https://pith.science/pith/NHPYXJP3UGOSRON7F42U5PDOFH.json","graph_json":"https://pith.science/api/pith-number/NHPYXJP3UGOSRON7F42U5PDOFH/graph.json","events_json":"https://pith.science/api/pith-number/NHPYXJP3UGOSRON7F42U5PDOFH/events.json","paper":"https://pith.science/paper/NHPYXJP3"},"agent_actions":{"view_html":"https://pith.science/pith/NHPYXJP3UGOSRON7F42U5PDOFH","download_json":"https://pith.science/pith/NHPYXJP3UGOSRON7F42U5PDOFH.json","view_paper":"https://pith.science/paper/NHPYXJP3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.03351&json=true","fetch_graph":"https://pith.science/api/pith-number/NHPYXJP3UGOSRON7F42U5PDOFH/graph.json","fetch_events":"https://pith.science/api/pith-number/NHPYXJP3UGOSRON7F42U5PDOFH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NHPYXJP3UGOSRON7F42U5PDOFH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NHPYXJP3UGOSRON7F42U5PDOFH/action/storage_attestation","attest_author":"https://pith.science/pith/NHPYXJP3UGOSRON7F42U5PDOFH/action/author_attestation","sign_citation":"https://pith.science/pith/NHPYXJP3UGOSRON7F42U5PDOFH/action/citation_signature","submit_replication":"https://pith.science/pith/NHPYXJP3UGOSRON7F42U5PDOFH/action/replication_record"}},"created_at":"2026-05-18T00:13:43.678747+00:00","updated_at":"2026-05-18T00:13:43.678747+00:00"}