{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NHPYXJP3UGOSRON7F42U5PDOFH","short_pith_number":"pith:NHPYXJP3","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"},"canonical_sha256":"69df8ba5fba19d28b9bf2f354ebc6e29fc096925642453e3352845f77e92c28a","source":{"kind":"arxiv","id":"1806.03351","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03351","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03351v1","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03351","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"pith_short_12","alias_value":"NHPYXJP3UGOS","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NHPYXJP3UGOSRON7","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NHPYXJP3","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NHPYXJP3UGOSRON7F42U5PDOFH","target":"record","payload":{"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"},"canonical_sha256":"69df8ba5fba19d28b9bf2f354ebc6e29fc096925642453e3352845f77e92c28a","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"},"source_kind":"arxiv","source_id":"1806.03351","source_version":1,"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-18T00:13:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZK4xL0pcoPonEcXNbiM/i2GY1S2JMLrrJvNV2iYC7Bbxh1ijDn+LzdJOeV0SaAOOQCvnkCpIsCjgEg5RYysnBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:47:06.442313Z"},"content_sha256":"c461935e0d02bd477c9bacac4d69e74903492640717700274810eb301cc4f509","schema_version":"1.0","event_id":"sha256:c461935e0d02bd477c9bacac4d69e74903492640717700274810eb301cc4f509"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NHPYXJP3UGOSRON7F42U5PDOFH","target":"graph","payload":{"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"},"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-18T00:13:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lUhECnngM+wtURV7LQdji2JktxLrp5pm9F10clTjHrxPIOe32X8fpmV9buKcMKT0o4EklQAZrDW2XvY5YP05BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:47:06.442715Z"},"content_sha256":"8adc036d6d3d3e6c258a37d05ca5a39e483d4cb9410b353729f60144ec67a9e8","schema_version":"1.0","event_id":"sha256:8adc036d6d3d3e6c258a37d05ca5a39e483d4cb9410b353729f60144ec67a9e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NHPYXJP3UGOSRON7F42U5PDOFH/bundle.json","state_url":"https://pith.science/pith/NHPYXJP3UGOSRON7F42U5PDOFH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NHPYXJP3UGOSRON7F42U5PDOFH/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-06-05T18:47:06Z","links":{"resolver":"https://pith.science/pith/NHPYXJP3UGOSRON7F42U5PDOFH","bundle":"https://pith.science/pith/NHPYXJP3UGOSRON7F42U5PDOFH/bundle.json","state":"https://pith.science/pith/NHPYXJP3UGOSRON7F42U5PDOFH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NHPYXJP3UGOSRON7F42U5PDOFH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NHPYXJP3UGOSRON7F42U5PDOFH","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":"773b5720576a1cbf146a20d8c6615c8392e9a74dc743fa45e95c66493adac7af","cross_cats_sorted":["math.GT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-08T20:52:13Z","title_canon_sha256":"8dc172f9ee55f3ce57aac991f9345c5d2b31e7ebf65f0e4ecb3b89ae09dbeb17"},"schema_version":"1.0","source":{"id":"1806.03351","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03351","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03351v1","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03351","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"pith_short_12","alias_value":"NHPYXJP3UGOS","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NHPYXJP3UGOSRON7","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NHPYXJP3","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:8adc036d6d3d3e6c258a37d05ca5a39e483d4cb9410b353729f60144ec67a9e8","target":"graph","created_at":"2026-05-18T00:13:43Z","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":"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)","authors_text":"Yuval Peled, Zur Luria","cross_cats":["math.GT","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-08T20:52:13Z","title":"On simple connectivity of random 2-complexes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03351","kind":"arxiv","version":1},"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:c461935e0d02bd477c9bacac4d69e74903492640717700274810eb301cc4f509","target":"record","created_at":"2026-05-18T00:13:43Z","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":"773b5720576a1cbf146a20d8c6615c8392e9a74dc743fa45e95c66493adac7af","cross_cats_sorted":["math.GT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-08T20:52:13Z","title_canon_sha256":"8dc172f9ee55f3ce57aac991f9345c5d2b31e7ebf65f0e4ecb3b89ae09dbeb17"},"schema_version":"1.0","source":{"id":"1806.03351","kind":"arxiv","version":1}},"canonical_sha256":"69df8ba5fba19d28b9bf2f354ebc6e29fc096925642453e3352845f77e92c28a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69df8ba5fba19d28b9bf2f354ebc6e29fc096925642453e3352845f77e92c28a","first_computed_at":"2026-05-18T00:13:43.678628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:43.678628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nCg4yCsSxGU0kp4Hhe9Xs9VujI/U70sg8X03K6oZa/XWu8io4YOaHkug/5z3ckX7ELjEKc6y24ofDJRB/yagAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:43.679341Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.03351","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c461935e0d02bd477c9bacac4d69e74903492640717700274810eb301cc4f509","sha256:8adc036d6d3d3e6c258a37d05ca5a39e483d4cb9410b353729f60144ec67a9e8"],"state_sha256":"44a32dd6ceceb76c5e1790d7d1cfc2cbd05a42ecee3709dee35d4a89686d8773"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"otXkYlUHqskICztwSepmhQCawmAzD5604HBTU8VYjXuQ82gEVM2UjMAtt/ctT3usuYQOzkRyuDz8sQ1T0WXYCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T18:47:06.444804Z","bundle_sha256":"b689d323cede4c63fcacf421c5617ca6297fd7a77b09628e045579a52f3d03dc"}}