{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:LIWP7D25FJUXISNVERWUZDOKSE","short_pith_number":"pith:LIWP7D25","schema_version":"1.0","canonical_sha256":"5a2cff8f5d2a697449b5246d4c8dca9125035389782404353f5d9f9e3c8df108","source":{"kind":"arxiv","id":"math/0605536","version":3},"attestation_state":"computed","paper":{"title":"Topology of random clique complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT"],"primary_cat":"math.CO","authors_text":"Matthew Kahle","submitted_at":"2006-05-19T05:23:27Z","abstract_excerpt":"In a seminal paper, Erdos and Renyi identified the threshold for connectivity of the random graph G(n,p). In particular, they showed that if p >> log(n)/n then G(n,p) is almost always connected, and if p << log(n)/n then G(n,p) is almost always disconnected, as n goes to infinity.\n  The clique complex X(H) of a graph H is the simplicial complex with all complete subgraphs of H as its faces. In contrast to the zeroth homology group of X(H), which measures the number of connected components of H, the higher dimensional homology groups of X(H) do not correspond to monotone graph properties. There"},"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":"math/0605536","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2006-05-19T05:23:27Z","cross_cats_sorted":["math.AT"],"title_canon_sha256":"d1b7fadf6712f7d0f694ef18e567a4965a38415ec05bd366da74e6baea15615c","abstract_canon_sha256":"214fc191cbf2b92c8156f48a47bb47ee526008614d13309e0d6a2481f11d636a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:33.020719Z","signature_b64":"2AXPIhHguL0ALt1INnbQk8RQMtkdOVQ+HLz5lbo/fywurfQ7qLnZCpYmWs2h9UCd63fUOIjw4sOT7qkfHJ47Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a2cff8f5d2a697449b5246d4c8dca9125035389782404353f5d9f9e3c8df108","last_reissued_at":"2026-05-18T04:40:33.020175Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:33.020175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Topology of random clique complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT"],"primary_cat":"math.CO","authors_text":"Matthew Kahle","submitted_at":"2006-05-19T05:23:27Z","abstract_excerpt":"In a seminal paper, Erdos and Renyi identified the threshold for connectivity of the random graph G(n,p). In particular, they showed that if p >> log(n)/n then G(n,p) is almost always connected, and if p << log(n)/n then G(n,p) is almost always disconnected, as n goes to infinity.\n  The clique complex X(H) of a graph H is the simplicial complex with all complete subgraphs of H as its faces. In contrast to the zeroth homology group of X(H), which measures the number of connected components of H, the higher dimensional homology groups of X(H) do not correspond to monotone graph properties. There"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0605536","kind":"arxiv","version":3},"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":"math/0605536","created_at":"2026-05-18T04:40:33.020256+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0605536v3","created_at":"2026-05-18T04:40:33.020256+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0605536","created_at":"2026-05-18T04:40:33.020256+00:00"},{"alias_kind":"pith_short_12","alias_value":"LIWP7D25FJUX","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"LIWP7D25FJUXISNV","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"LIWP7D25","created_at":"2026-05-18T12:25:54.717736+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/LIWP7D25FJUXISNVERWUZDOKSE","json":"https://pith.science/pith/LIWP7D25FJUXISNVERWUZDOKSE.json","graph_json":"https://pith.science/api/pith-number/LIWP7D25FJUXISNVERWUZDOKSE/graph.json","events_json":"https://pith.science/api/pith-number/LIWP7D25FJUXISNVERWUZDOKSE/events.json","paper":"https://pith.science/paper/LIWP7D25"},"agent_actions":{"view_html":"https://pith.science/pith/LIWP7D25FJUXISNVERWUZDOKSE","download_json":"https://pith.science/pith/LIWP7D25FJUXISNVERWUZDOKSE.json","view_paper":"https://pith.science/paper/LIWP7D25","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0605536&json=true","fetch_graph":"https://pith.science/api/pith-number/LIWP7D25FJUXISNVERWUZDOKSE/graph.json","fetch_events":"https://pith.science/api/pith-number/LIWP7D25FJUXISNVERWUZDOKSE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LIWP7D25FJUXISNVERWUZDOKSE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LIWP7D25FJUXISNVERWUZDOKSE/action/storage_attestation","attest_author":"https://pith.science/pith/LIWP7D25FJUXISNVERWUZDOKSE/action/author_attestation","sign_citation":"https://pith.science/pith/LIWP7D25FJUXISNVERWUZDOKSE/action/citation_signature","submit_replication":"https://pith.science/pith/LIWP7D25FJUXISNVERWUZDOKSE/action/replication_record"}},"created_at":"2026-05-18T04:40:33.020256+00:00","updated_at":"2026-05-18T04:40:33.020256+00:00"}