{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2QN7VAK3LG4JUF2L35RQO6IPRM","short_pith_number":"pith:2QN7VAK3","schema_version":"1.0","canonical_sha256":"d41bfa815b59b89a174bdf6307790f8b0f1fe7b11a9a66bfa30bc39e5c5d1fa1","source":{"kind":"arxiv","id":"1904.07494","version":1},"attestation_state":"computed","paper":{"title":"Efficient Distributed Community Detection in the Stochastic Block Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anisur Rahaman Molla, Gopal Pandurangan, Reza Fathi","submitted_at":"2019-04-16T07:03:06Z","abstract_excerpt":"Designing effective algorithms for community detection is an important and challenging problem in {\\em large-scale} graphs, studied extensively in the literature. Various solutions have been proposed, but many of them are centralized with expensive procedures (requiring full knowledge of the input graph) and have a large running time.\n  In this paper, we present a distributed algorithm for community detection in the {\\em stochastic block model} (also called {\\em planted partition model}), a widely-studied and canonical random graph model for community detection and clustering. Our algorithm ca"},"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":"1904.07494","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-16T07:03:06Z","cross_cats_sorted":[],"title_canon_sha256":"9a50c28c946ad87f067ce06d828ae93a8a2ab2f732ceaf422bc970c3731727b2","abstract_canon_sha256":"af7503861c334f5d5a52e6fbe729c1d42655221ec6f5b568fb065e40efa040f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:25.065654Z","signature_b64":"jG/AIGq1nap4a0cYBDpl0PBsTJdnKXEMMEZiaPt3jpas7iT2610rSRMqzyvKl7F1xlCqUQoIlJO1y5KNWCL7Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d41bfa815b59b89a174bdf6307790f8b0f1fe7b11a9a66bfa30bc39e5c5d1fa1","last_reissued_at":"2026-05-17T23:48:25.065147Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:25.065147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Distributed Community Detection in the Stochastic Block Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anisur Rahaman Molla, Gopal Pandurangan, Reza Fathi","submitted_at":"2019-04-16T07:03:06Z","abstract_excerpt":"Designing effective algorithms for community detection is an important and challenging problem in {\\em large-scale} graphs, studied extensively in the literature. Various solutions have been proposed, but many of them are centralized with expensive procedures (requiring full knowledge of the input graph) and have a large running time.\n  In this paper, we present a distributed algorithm for community detection in the {\\em stochastic block model} (also called {\\em planted partition model}), a widely-studied and canonical random graph model for community detection and clustering. Our algorithm ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07494","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":"1904.07494","created_at":"2026-05-17T23:48:25.065236+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.07494v1","created_at":"2026-05-17T23:48:25.065236+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07494","created_at":"2026-05-17T23:48:25.065236+00:00"},{"alias_kind":"pith_short_12","alias_value":"2QN7VAK3LG4J","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"2QN7VAK3LG4JUF2L","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"2QN7VAK3","created_at":"2026-05-18T12:33:07.085635+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/2QN7VAK3LG4JUF2L35RQO6IPRM","json":"https://pith.science/pith/2QN7VAK3LG4JUF2L35RQO6IPRM.json","graph_json":"https://pith.science/api/pith-number/2QN7VAK3LG4JUF2L35RQO6IPRM/graph.json","events_json":"https://pith.science/api/pith-number/2QN7VAK3LG4JUF2L35RQO6IPRM/events.json","paper":"https://pith.science/paper/2QN7VAK3"},"agent_actions":{"view_html":"https://pith.science/pith/2QN7VAK3LG4JUF2L35RQO6IPRM","download_json":"https://pith.science/pith/2QN7VAK3LG4JUF2L35RQO6IPRM.json","view_paper":"https://pith.science/paper/2QN7VAK3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.07494&json=true","fetch_graph":"https://pith.science/api/pith-number/2QN7VAK3LG4JUF2L35RQO6IPRM/graph.json","fetch_events":"https://pith.science/api/pith-number/2QN7VAK3LG4JUF2L35RQO6IPRM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2QN7VAK3LG4JUF2L35RQO6IPRM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2QN7VAK3LG4JUF2L35RQO6IPRM/action/storage_attestation","attest_author":"https://pith.science/pith/2QN7VAK3LG4JUF2L35RQO6IPRM/action/author_attestation","sign_citation":"https://pith.science/pith/2QN7VAK3LG4JUF2L35RQO6IPRM/action/citation_signature","submit_replication":"https://pith.science/pith/2QN7VAK3LG4JUF2L35RQO6IPRM/action/replication_record"}},"created_at":"2026-05-17T23:48:25.065236+00:00","updated_at":"2026-05-17T23:48:25.065236+00:00"}