{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3JTWDDGXJLXRFXTTDILNQ32OK3","short_pith_number":"pith:3JTWDDGX","schema_version":"1.0","canonical_sha256":"da67618cd74aef12de731a16d86f4e56cc81f24a2e4b10966fc8722983331312","source":{"kind":"arxiv","id":"1508.01878","version":2},"attestation_state":"computed","paper":{"title":"Clique percolation in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"Bing-Hong Wang, Ming Li, Youjin Deng","submitted_at":"2015-08-08T09:58:07Z","abstract_excerpt":"As a generation of the classical percolation, clique percolation focuses on the connection of cliques in a graph, where the connection of two $k$-cliques means that they share at least $l<k$ vertices. In this paper, we develop a theoretical approach to study clique percolation in Erd\\H{o}s-R\\'{e}nyi graphs, which gives not only the exact solutions of the critical point, but also the corresponding order parameter. Based on this, we prove theoretically that the fraction $\\psi$ of cliques in the giant clique cluster always makes a continuous phase transition as the classical percolation. However,"},"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":"1508.01878","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2015-08-08T09:58:07Z","cross_cats_sorted":["cs.SI","physics.soc-ph"],"title_canon_sha256":"9deb3fb5378cfbbd214c20c803c076d9496febbb4de2482d16c6372115ad21ff","abstract_canon_sha256":"07fb3026e485ff3ce1ae3c129ad0945bb7cd14132e8a8f0970a224ec5dd4f2e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:48.709639Z","signature_b64":"i1mlrO+SaJ7AmtNtjjguNHw2tRG0XzN5JFxmoa8ZIDto3VY8VGVM/roumuAXn79HQdKjjRl1000GkQpnyjVDDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da67618cd74aef12de731a16d86f4e56cc81f24a2e4b10966fc8722983331312","last_reissued_at":"2026-05-18T01:30:48.709259Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:48.709259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clique percolation in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"Bing-Hong Wang, Ming Li, Youjin Deng","submitted_at":"2015-08-08T09:58:07Z","abstract_excerpt":"As a generation of the classical percolation, clique percolation focuses on the connection of cliques in a graph, where the connection of two $k$-cliques means that they share at least $l<k$ vertices. In this paper, we develop a theoretical approach to study clique percolation in Erd\\H{o}s-R\\'{e}nyi graphs, which gives not only the exact solutions of the critical point, but also the corresponding order parameter. Based on this, we prove theoretically that the fraction $\\psi$ of cliques in the giant clique cluster always makes a continuous phase transition as the classical percolation. However,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01878","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":"1508.01878","created_at":"2026-05-18T01:30:48.709321+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.01878v2","created_at":"2026-05-18T01:30:48.709321+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01878","created_at":"2026-05-18T01:30:48.709321+00:00"},{"alias_kind":"pith_short_12","alias_value":"3JTWDDGXJLXR","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3JTWDDGXJLXRFXTT","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3JTWDDGX","created_at":"2026-05-18T12:29:02.477457+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/3JTWDDGXJLXRFXTTDILNQ32OK3","json":"https://pith.science/pith/3JTWDDGXJLXRFXTTDILNQ32OK3.json","graph_json":"https://pith.science/api/pith-number/3JTWDDGXJLXRFXTTDILNQ32OK3/graph.json","events_json":"https://pith.science/api/pith-number/3JTWDDGXJLXRFXTTDILNQ32OK3/events.json","paper":"https://pith.science/paper/3JTWDDGX"},"agent_actions":{"view_html":"https://pith.science/pith/3JTWDDGXJLXRFXTTDILNQ32OK3","download_json":"https://pith.science/pith/3JTWDDGXJLXRFXTTDILNQ32OK3.json","view_paper":"https://pith.science/paper/3JTWDDGX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.01878&json=true","fetch_graph":"https://pith.science/api/pith-number/3JTWDDGXJLXRFXTTDILNQ32OK3/graph.json","fetch_events":"https://pith.science/api/pith-number/3JTWDDGXJLXRFXTTDILNQ32OK3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3JTWDDGXJLXRFXTTDILNQ32OK3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3JTWDDGXJLXRFXTTDILNQ32OK3/action/storage_attestation","attest_author":"https://pith.science/pith/3JTWDDGXJLXRFXTTDILNQ32OK3/action/author_attestation","sign_citation":"https://pith.science/pith/3JTWDDGXJLXRFXTTDILNQ32OK3/action/citation_signature","submit_replication":"https://pith.science/pith/3JTWDDGXJLXRFXTTDILNQ32OK3/action/replication_record"}},"created_at":"2026-05-18T01:30:48.709321+00:00","updated_at":"2026-05-18T01:30:48.709321+00:00"}