{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:KZ3PFD7BPICCP3W43CUXT3ZCNX","short_pith_number":"pith:KZ3PFD7B","schema_version":"1.0","canonical_sha256":"5676f28fe17a0427eedcd8a979ef226df9c81e3363bfa07f9eddfb0f96845ba3","source":{"kind":"arxiv","id":"1104.3590","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1104.3590","created_at":"2026-05-18T02:22:02.373254+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.3590v1","created_at":"2026-05-18T02:22:02.373254+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3590","created_at":"2026-05-18T02:22:02.373254+00:00"},{"alias_kind":"pith_short_12","alias_value":"KZ3PFD7BPICC","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"KZ3PFD7BPICCP3W4","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"KZ3PFD7B","created_at":"2026-05-18T12:26:34.985390+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/KZ3PFD7BPICCP3W43CUXT3ZCNX","json":"https://pith.science/pith/KZ3PFD7BPICCP3W43CUXT3ZCNX.json","graph_json":"https://pith.science/api/pith-number/KZ3PFD7BPICCP3W43CUXT3ZCNX/graph.json","events_json":"https://pith.science/api/pith-number/KZ3PFD7BPICCP3W43CUXT3ZCNX/events.json","paper":"https://pith.science/paper/KZ3PFD7B"},"agent_actions":{"view_html":"https://pith.science/pith/KZ3PFD7BPICCP3W43CUXT3ZCNX","download_json":"https://pith.science/pith/KZ3PFD7BPICCP3W43CUXT3ZCNX.json","view_paper":"https://pith.science/paper/KZ3PFD7B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.3590&json=true","fetch_graph":"https://pith.science/api/pith-number/KZ3PFD7BPICCP3W43CUXT3ZCNX/graph.json","fetch_events":"https://pith.science/api/pith-number/KZ3PFD7BPICCP3W43CUXT3ZCNX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KZ3PFD7BPICCP3W43CUXT3ZCNX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KZ3PFD7BPICCP3W43CUXT3ZCNX/action/storage_attestation","attest_author":"https://pith.science/pith/KZ3PFD7BPICCP3W43CUXT3ZCNX/action/author_attestation","sign_citation":"https://pith.science/pith/KZ3PFD7BPICCP3W43CUXT3ZCNX/action/citation_signature","submit_replication":"https://pith.science/pith/KZ3PFD7BPICCP3W43CUXT3ZCNX/action/replication_record"}},"created_at":"2026-05-18T02:22:02.373254+00:00","updated_at":"2026-05-18T02:22:02.373254+00:00"}