{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:TYGXTCKIHNL553FORMY2ET5IRD","short_pith_number":"pith:TYGXTCKI","schema_version":"1.0","canonical_sha256":"9e0d7989483b57deecae8b31a24fa888fae745c31f91c43a992ed98fda32cdee","source":{"kind":"arxiv","id":"1207.5028","version":2},"attestation_state":"computed","paper":{"title":"Fundamental Groups of Random Clique Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Eric Babson","submitted_at":"2012-07-20T19:10:41Z","abstract_excerpt":"Clique complexes of Erd\\H{o}s-R\\'{e}nyi random graphs with edge probability between $n^{-{1\\over 3}}$ and $n^{-{1\\over 2}}$ are shown to be aas not simply connected. This entails showing that a connected two dimensional simplicial complex for which every subcomplex has fewer than three times as many edges as vertices must have the homotopy type of a wedge of circles, two spheres and real projective planes. Note that $n^{-{1\\over 3}}$ is a threshold for simple connectivity and $n^{-{1\\over 2}}$ is one for vanishing first $\\F_2$ homology."},"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":"1207.5028","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-20T19:10:41Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"fd0674f297672dc6ea06016d01692e7e33fef555eb99b1a8d96eca01cdc7a413","abstract_canon_sha256":"48d343d72fceb4bb49ee388734a6f452ff85a84e1c09ca1af61513ecae2d7b47"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:25.859636Z","signature_b64":"Uj4TcIhg6To5kxLl/e62NzNkMB4br6mhi9Uu76y+UuOuBPTgs8OhOcZbYTL1w1sTGkx3cCJHDFiza0QAcV/8DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e0d7989483b57deecae8b31a24fa888fae745c31f91c43a992ed98fda32cdee","last_reissued_at":"2026-05-18T03:33:25.859024Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:25.859024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fundamental Groups of Random Clique Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Eric Babson","submitted_at":"2012-07-20T19:10:41Z","abstract_excerpt":"Clique complexes of Erd\\H{o}s-R\\'{e}nyi random graphs with edge probability between $n^{-{1\\over 3}}$ and $n^{-{1\\over 2}}$ are shown to be aas not simply connected. This entails showing that a connected two dimensional simplicial complex for which every subcomplex has fewer than three times as many edges as vertices must have the homotopy type of a wedge of circles, two spheres and real projective planes. Note that $n^{-{1\\over 3}}$ is a threshold for simple connectivity and $n^{-{1\\over 2}}$ is one for vanishing first $\\F_2$ homology."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5028","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":"1207.5028","created_at":"2026-05-18T03:33:25.859126+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.5028v2","created_at":"2026-05-18T03:33:25.859126+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5028","created_at":"2026-05-18T03:33:25.859126+00:00"},{"alias_kind":"pith_short_12","alias_value":"TYGXTCKIHNL5","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"TYGXTCKIHNL553FO","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"TYGXTCKI","created_at":"2026-05-18T12:27:23.164592+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.05697","citing_title":"When does a tree activate the random graph?","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TYGXTCKIHNL553FORMY2ET5IRD","json":"https://pith.science/pith/TYGXTCKIHNL553FORMY2ET5IRD.json","graph_json":"https://pith.science/api/pith-number/TYGXTCKIHNL553FORMY2ET5IRD/graph.json","events_json":"https://pith.science/api/pith-number/TYGXTCKIHNL553FORMY2ET5IRD/events.json","paper":"https://pith.science/paper/TYGXTCKI"},"agent_actions":{"view_html":"https://pith.science/pith/TYGXTCKIHNL553FORMY2ET5IRD","download_json":"https://pith.science/pith/TYGXTCKIHNL553FORMY2ET5IRD.json","view_paper":"https://pith.science/paper/TYGXTCKI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.5028&json=true","fetch_graph":"https://pith.science/api/pith-number/TYGXTCKIHNL553FORMY2ET5IRD/graph.json","fetch_events":"https://pith.science/api/pith-number/TYGXTCKIHNL553FORMY2ET5IRD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TYGXTCKIHNL553FORMY2ET5IRD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TYGXTCKIHNL553FORMY2ET5IRD/action/storage_attestation","attest_author":"https://pith.science/pith/TYGXTCKIHNL553FORMY2ET5IRD/action/author_attestation","sign_citation":"https://pith.science/pith/TYGXTCKIHNL553FORMY2ET5IRD/action/citation_signature","submit_replication":"https://pith.science/pith/TYGXTCKIHNL553FORMY2ET5IRD/action/replication_record"}},"created_at":"2026-05-18T03:33:25.859126+00:00","updated_at":"2026-05-18T03:33:25.859126+00:00"}