{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KZ3PFD7BPICCP3W43CUXT3ZCNX","short_pith_number":"pith:KZ3PFD7B","canonical_record":{"source":{"id":"1104.3590","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-04-18T21:10:50Z","cross_cats_sorted":["cond-mat.stat-mech","physics.soc-ph"],"title_canon_sha256":"5e5ec248e80bc71f9862329f6a0645b94a127607e8dc810f76ad4d6c0dc5d77b","abstract_canon_sha256":"866b5dce024ba5ad33856784fcd1218ebe4af8775bad7ed6e166bc088c331891"},"schema_version":"1.0"},"canonical_sha256":"5676f28fe17a0427eedcd8a979ef226df9c81e3363bfa07f9eddfb0f96845ba3","source":{"kind":"arxiv","id":"1104.3590","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3590","created_at":"2026-05-18T02:22:02Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3590v1","created_at":"2026-05-18T02:22:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3590","created_at":"2026-05-18T02:22:02Z"},{"alias_kind":"pith_short_12","alias_value":"KZ3PFD7BPICC","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"KZ3PFD7BPICCP3W4","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"KZ3PFD7B","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KZ3PFD7BPICCP3W43CUXT3ZCNX","target":"record","payload":{"canonical_record":{"source":{"id":"1104.3590","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-04-18T21:10:50Z","cross_cats_sorted":["cond-mat.stat-mech","physics.soc-ph"],"title_canon_sha256":"5e5ec248e80bc71f9862329f6a0645b94a127607e8dc810f76ad4d6c0dc5d77b","abstract_canon_sha256":"866b5dce024ba5ad33856784fcd1218ebe4af8775bad7ed6e166bc088c331891"},"schema_version":"1.0"},"canonical_sha256":"5676f28fe17a0427eedcd8a979ef226df9c81e3363bfa07f9eddfb0f96845ba3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:02.373840Z","signature_b64":"NP+LYa8fmlcudmerlKHa07JjCXMZOi8jtmZ3N4M7bI/nuTx+xHKvlRYZbd5AXsSwD6sblsTXYkvxj36MqFUkCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5676f28fe17a0427eedcd8a979ef226df9c81e3363bfa07f9eddfb0f96845ba3","last_reissued_at":"2026-05-18T02:22:02.373143Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:02.373143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.3590","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-18T02:22:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v0X6a13mZi6nV9BRsDlEHjcU4GJzi7WW3/XKkSW+DJ+bY4nBPCzzlMd8fvQV4Nh7Ox0uvAe1hqmBGG9ph9AxDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T06:05:59.211589Z"},"content_sha256":"f0c4f51cb6196bc8d00b09b21ab49801098aaf2493d62fedfab1858014b4c3d1","schema_version":"1.0","event_id":"sha256:f0c4f51cb6196bc8d00b09b21ab49801098aaf2493d62fedfab1858014b4c3d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KZ3PFD7BPICCP3W43CUXT3ZCNX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An efficient and principled method for detecting communities in networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Brian Ball, Brian Karrer, M. E. J. Newman","submitted_at":"2011-04-18T21:10:50Z","abstract_excerpt":"A fundamental problem in the analysis of network data is the detection of network communities, groups of densely interconnected nodes, which may be overlapping or disjoint. Here we describe a method for finding overlapping communities based on a principled statistical approach using generative network models. We show how the method can be implemented using a fast, closed-form expectation-maximization algorithm that allows us to analyze networks of millions of nodes in reasonable running times. We test the method both on real-world networks and on synthetic benchmarks and find that it gives res"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3590","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-18T02:22:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kKVHhjtQpt86hQyBSvBDMWUuVBEhqz6tywTHGEdSYDpSRtbq8aB0PaH1dEvOMv2WbIx6EpVt+5lx3GIbgOj9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T06:05:59.212231Z"},"content_sha256":"a2d69f2930171c931c95ee4c29eac517b7db7027393078c64891a346d10e31b1","schema_version":"1.0","event_id":"sha256:a2d69f2930171c931c95ee4c29eac517b7db7027393078c64891a346d10e31b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KZ3PFD7BPICCP3W43CUXT3ZCNX/bundle.json","state_url":"https://pith.science/pith/KZ3PFD7BPICCP3W43CUXT3ZCNX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KZ3PFD7BPICCP3W43CUXT3ZCNX/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-05-23T06:05:59Z","links":{"resolver":"https://pith.science/pith/KZ3PFD7BPICCP3W43CUXT3ZCNX","bundle":"https://pith.science/pith/KZ3PFD7BPICCP3W43CUXT3ZCNX/bundle.json","state":"https://pith.science/pith/KZ3PFD7BPICCP3W43CUXT3ZCNX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KZ3PFD7BPICCP3W43CUXT3ZCNX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KZ3PFD7BPICCP3W43CUXT3ZCNX","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":"866b5dce024ba5ad33856784fcd1218ebe4af8775bad7ed6e166bc088c331891","cross_cats_sorted":["cond-mat.stat-mech","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-04-18T21:10:50Z","title_canon_sha256":"5e5ec248e80bc71f9862329f6a0645b94a127607e8dc810f76ad4d6c0dc5d77b"},"schema_version":"1.0","source":{"id":"1104.3590","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3590","created_at":"2026-05-18T02:22:02Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3590v1","created_at":"2026-05-18T02:22:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3590","created_at":"2026-05-18T02:22:02Z"},{"alias_kind":"pith_short_12","alias_value":"KZ3PFD7BPICC","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"KZ3PFD7BPICCP3W4","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"KZ3PFD7B","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:a2d69f2930171c931c95ee4c29eac517b7db7027393078c64891a346d10e31b1","target":"graph","created_at":"2026-05-18T02:22:02Z","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":"A fundamental problem in the analysis of network data is the detection of network communities, groups of densely interconnected nodes, which may be overlapping or disjoint. Here we describe a method for finding overlapping communities based on a principled statistical approach using generative network models. We show how the method can be implemented using a fast, closed-form expectation-maximization algorithm that allows us to analyze networks of millions of nodes in reasonable running times. We test the method both on real-world networks and on synthetic benchmarks and find that it gives res","authors_text":"Brian Ball, Brian Karrer, M. E. J. Newman","cross_cats":["cond-mat.stat-mech","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-04-18T21:10:50Z","title":"An efficient and principled method for detecting communities in networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3590","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:f0c4f51cb6196bc8d00b09b21ab49801098aaf2493d62fedfab1858014b4c3d1","target":"record","created_at":"2026-05-18T02:22:02Z","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":"866b5dce024ba5ad33856784fcd1218ebe4af8775bad7ed6e166bc088c331891","cross_cats_sorted":["cond-mat.stat-mech","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-04-18T21:10:50Z","title_canon_sha256":"5e5ec248e80bc71f9862329f6a0645b94a127607e8dc810f76ad4d6c0dc5d77b"},"schema_version":"1.0","source":{"id":"1104.3590","kind":"arxiv","version":1}},"canonical_sha256":"5676f28fe17a0427eedcd8a979ef226df9c81e3363bfa07f9eddfb0f96845ba3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5676f28fe17a0427eedcd8a979ef226df9c81e3363bfa07f9eddfb0f96845ba3","first_computed_at":"2026-05-18T02:22:02.373143Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:02.373143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NP+LYa8fmlcudmerlKHa07JjCXMZOi8jtmZ3N4M7bI/nuTx+xHKvlRYZbd5AXsSwD6sblsTXYkvxj36MqFUkCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:02.373840Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.3590","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0c4f51cb6196bc8d00b09b21ab49801098aaf2493d62fedfab1858014b4c3d1","sha256:a2d69f2930171c931c95ee4c29eac517b7db7027393078c64891a346d10e31b1"],"state_sha256":"41de857fdc7efc484756eb1afde9b61cef4f3753addd6648f3be95e54d72ca0a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ixGGdnjECFnKlU66QU758L2dQ2jfhMpgJNG9jG2sAo/YYEQtsuVwuRq0g0SII2QF4ADvDN5hoXaZOUAj8v/FCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T06:05:59.215469Z","bundle_sha256":"fe930ddeb0ef160d7f9d3dadcfad1096e2c305c9e49add5d427dc3720824560b"}}