{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:TXY76YW7EHANX6SOXZOAKHGEQ7","short_pith_number":"pith:TXY76YW7","canonical_record":{"source":{"id":"1205.0038","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-04-30T21:40:37Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"053364e50251c34d728a6d378900d726940fdd551e686292ab949ca3f4f1ae73","abstract_canon_sha256":"ed1c756adf96ac4ef48e5c79694b8e49c25b2f9643fdb2bab843951a51a5b504"},"schema_version":"1.0"},"canonical_sha256":"9df1ff62df21c0dbfa4ebe5c051cc487fb2b558e55405e314f1a4464e648c423","source":{"kind":"arxiv","id":"1205.0038","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.0038","created_at":"2026-05-18T03:56:35Z"},{"alias_kind":"arxiv_version","alias_value":"1205.0038v1","created_at":"2026-05-18T03:56:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0038","created_at":"2026-05-18T03:56:35Z"},{"alias_kind":"pith_short_12","alias_value":"TXY76YW7EHAN","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TXY76YW7EHANX6SO","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TXY76YW7","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:TXY76YW7EHANX6SOXZOAKHGEQ7","target":"record","payload":{"canonical_record":{"source":{"id":"1205.0038","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-04-30T21:40:37Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"053364e50251c34d728a6d378900d726940fdd551e686292ab949ca3f4f1ae73","abstract_canon_sha256":"ed1c756adf96ac4ef48e5c79694b8e49c25b2f9643fdb2bab843951a51a5b504"},"schema_version":"1.0"},"canonical_sha256":"9df1ff62df21c0dbfa4ebe5c051cc487fb2b558e55405e314f1a4464e648c423","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:35.973016Z","signature_b64":"SPihoaDbEEJfpjb6CbOcHfg/1gyYT9xpq7k87UNQ1sel1yZEZh0bsEltGWZMXIoa+B2lmCT2RUtfstxfrKrSCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9df1ff62df21c0dbfa4ebe5c051cc487fb2b558e55405e314f1a4464e648c423","last_reissued_at":"2026-05-18T03:56:35.972305Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:35.972305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.0038","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-18T03:56:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jgq6q+PKGyhJYxUJGiFCd3XqLRSRxe9Q7Nh75gL90OmYnYz7jGvGLdg44btkIJroYCcuCZ3XJSh+B4PZvjUPDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T08:35:35.820067Z"},"content_sha256":"3f71e4ecea1ef2c6bba7d173ed812a2dd0cec90058552cecd153902de82884ba","schema_version":"1.0","event_id":"sha256:3f71e4ecea1ef2c6bba7d173ed812a2dd0cec90058552cecd153902de82884ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:TXY76YW7EHANX6SOXZOAKHGEQ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Percolation Computation in Complex Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Aaron McDaid, Fergal Reid, Neil Hurley","submitted_at":"2012-04-30T21:40:37Z","abstract_excerpt":"K-clique percolation is an overlapping community finding algorithm which extracts particular structures, comprised of overlapping cliques, from complex networks. While it is conceptually straightforward, and can be elegantly expressed using clique graphs, certain aspects of k-clique percolation are computationally challenging in practice. In this paper we investigate aspects of empirical social networks, such as the large numbers of overlapping maximal cliques contained within them, that make clique percolation, and clique graph representations, computationally expensive. We motivate a simple "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0038","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-18T03:56:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hhFIu+mUNMDYwz7im92DW2j1bHWwDSWA9KBTEY+Q/ksuRwqsHN8w8KFNrnmkYBdGyupStBOBgjXuBOG1WOr2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T08:35:35.820435Z"},"content_sha256":"e7dca93f35bea773effb38a902b9e7e5caca09ade251488ba2debc8f8b45566f","schema_version":"1.0","event_id":"sha256:e7dca93f35bea773effb38a902b9e7e5caca09ade251488ba2debc8f8b45566f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TXY76YW7EHANX6SOXZOAKHGEQ7/bundle.json","state_url":"https://pith.science/pith/TXY76YW7EHANX6SOXZOAKHGEQ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TXY76YW7EHANX6SOXZOAKHGEQ7/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-23T08:35:35Z","links":{"resolver":"https://pith.science/pith/TXY76YW7EHANX6SOXZOAKHGEQ7","bundle":"https://pith.science/pith/TXY76YW7EHANX6SOXZOAKHGEQ7/bundle.json","state":"https://pith.science/pith/TXY76YW7EHANX6SOXZOAKHGEQ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TXY76YW7EHANX6SOXZOAKHGEQ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:TXY76YW7EHANX6SOXZOAKHGEQ7","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":"ed1c756adf96ac4ef48e5c79694b8e49c25b2f9643fdb2bab843951a51a5b504","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-04-30T21:40:37Z","title_canon_sha256":"053364e50251c34d728a6d378900d726940fdd551e686292ab949ca3f4f1ae73"},"schema_version":"1.0","source":{"id":"1205.0038","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.0038","created_at":"2026-05-18T03:56:35Z"},{"alias_kind":"arxiv_version","alias_value":"1205.0038v1","created_at":"2026-05-18T03:56:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0038","created_at":"2026-05-18T03:56:35Z"},{"alias_kind":"pith_short_12","alias_value":"TXY76YW7EHAN","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TXY76YW7EHANX6SO","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TXY76YW7","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:e7dca93f35bea773effb38a902b9e7e5caca09ade251488ba2debc8f8b45566f","target":"graph","created_at":"2026-05-18T03:56:35Z","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":"K-clique percolation is an overlapping community finding algorithm which extracts particular structures, comprised of overlapping cliques, from complex networks. While it is conceptually straightforward, and can be elegantly expressed using clique graphs, certain aspects of k-clique percolation are computationally challenging in practice. In this paper we investigate aspects of empirical social networks, such as the large numbers of overlapping maximal cliques contained within them, that make clique percolation, and clique graph representations, computationally expensive. We motivate a simple ","authors_text":"Aaron McDaid, Fergal Reid, Neil Hurley","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-04-30T21:40:37Z","title":"Percolation Computation in Complex Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0038","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:3f71e4ecea1ef2c6bba7d173ed812a2dd0cec90058552cecd153902de82884ba","target":"record","created_at":"2026-05-18T03:56:35Z","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":"ed1c756adf96ac4ef48e5c79694b8e49c25b2f9643fdb2bab843951a51a5b504","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-04-30T21:40:37Z","title_canon_sha256":"053364e50251c34d728a6d378900d726940fdd551e686292ab949ca3f4f1ae73"},"schema_version":"1.0","source":{"id":"1205.0038","kind":"arxiv","version":1}},"canonical_sha256":"9df1ff62df21c0dbfa4ebe5c051cc487fb2b558e55405e314f1a4464e648c423","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9df1ff62df21c0dbfa4ebe5c051cc487fb2b558e55405e314f1a4464e648c423","first_computed_at":"2026-05-18T03:56:35.972305Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:56:35.972305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SPihoaDbEEJfpjb6CbOcHfg/1gyYT9xpq7k87UNQ1sel1yZEZh0bsEltGWZMXIoa+B2lmCT2RUtfstxfrKrSCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:56:35.973016Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.0038","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f71e4ecea1ef2c6bba7d173ed812a2dd0cec90058552cecd153902de82884ba","sha256:e7dca93f35bea773effb38a902b9e7e5caca09ade251488ba2debc8f8b45566f"],"state_sha256":"587be1b197754e96e9ce15da7f9fac28c676380bf4ebe4d472a13ced66272f37"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VnraBH+WedgF5ZTUaqOpvIcAwO8U6I6nlp60t52GzN/5OL0hIuGTgw+7tOIqO4NBzAiTqDiESJdsPYKffhYQAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T08:35:35.822422Z","bundle_sha256":"86650cdab7b392ce0db1beccede3803f921be744dbc2de62e0ff9149b6163f6f"}}