{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GR34XAZD7DWA4GPLLFZJQNYGKX","short_pith_number":"pith:GR34XAZD","schema_version":"1.0","canonical_sha256":"3477cb8323f8ec0e19eb597298370655c73a825c52d072540083a3b4a8d7e48b","source":{"kind":"arxiv","id":"1801.05946","version":1},"attestation_state":"computed","paper":{"title":"On Efficiently Detecting Overlapping Communities over Distributed Dynamic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Lei Chen, Xiang Lian, Xun Jian","submitted_at":"2018-01-18T05:51:46Z","abstract_excerpt":"Modern networks are of huge sizes as well as high dynamics, which challenges the efficiency of community detection algorithms. In this paper, we study the problem of overlapping community detection on distributed and dynamic graphs. Given a distributed, undirected and unweighted graph, the goal is to detect overlapping communities incrementally as the graph is dynamically changing. We propose an efficient algorithm, called \\textit{randomized Speaker-Listener Label Propagation Algorithm} (rSLPA), based on the \\textit{Speaker-Listener Label Propagation Algorithm} (SLPA) by relaxing the probabili"},"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":"1801.05946","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-01-18T05:51:46Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"2cfc16713b066d45cd5ebc5100f4bd73613b22a44c8ef73252e77ff241116c45","abstract_canon_sha256":"2b5845f90f454c42e428e77c77cc9c51b745e2055f5c1230371745247a86015b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:36.005431Z","signature_b64":"sqRRNJphCBNr8A2++K7AKSa84cfSuOscZgu5gZ/92thl+Sc0Z8nmVg2vWydVsRjXEO0ACkXgIsnumJhDRMSUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3477cb8323f8ec0e19eb597298370655c73a825c52d072540083a3b4a8d7e48b","last_reissued_at":"2026-05-18T00:25:36.004666Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:36.004666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Efficiently Detecting Overlapping Communities over Distributed Dynamic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Lei Chen, Xiang Lian, Xun Jian","submitted_at":"2018-01-18T05:51:46Z","abstract_excerpt":"Modern networks are of huge sizes as well as high dynamics, which challenges the efficiency of community detection algorithms. In this paper, we study the problem of overlapping community detection on distributed and dynamic graphs. Given a distributed, undirected and unweighted graph, the goal is to detect overlapping communities incrementally as the graph is dynamically changing. We propose an efficient algorithm, called \\textit{randomized Speaker-Listener Label Propagation Algorithm} (rSLPA), based on the \\textit{Speaker-Listener Label Propagation Algorithm} (SLPA) by relaxing the probabili"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05946","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":"1801.05946","created_at":"2026-05-18T00:25:36.004803+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.05946v1","created_at":"2026-05-18T00:25:36.004803+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05946","created_at":"2026-05-18T00:25:36.004803+00:00"},{"alias_kind":"pith_short_12","alias_value":"GR34XAZD7DWA","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GR34XAZD7DWA4GPL","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GR34XAZD","created_at":"2026-05-18T12:32:25.280505+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/GR34XAZD7DWA4GPLLFZJQNYGKX","json":"https://pith.science/pith/GR34XAZD7DWA4GPLLFZJQNYGKX.json","graph_json":"https://pith.science/api/pith-number/GR34XAZD7DWA4GPLLFZJQNYGKX/graph.json","events_json":"https://pith.science/api/pith-number/GR34XAZD7DWA4GPLLFZJQNYGKX/events.json","paper":"https://pith.science/paper/GR34XAZD"},"agent_actions":{"view_html":"https://pith.science/pith/GR34XAZD7DWA4GPLLFZJQNYGKX","download_json":"https://pith.science/pith/GR34XAZD7DWA4GPLLFZJQNYGKX.json","view_paper":"https://pith.science/paper/GR34XAZD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.05946&json=true","fetch_graph":"https://pith.science/api/pith-number/GR34XAZD7DWA4GPLLFZJQNYGKX/graph.json","fetch_events":"https://pith.science/api/pith-number/GR34XAZD7DWA4GPLLFZJQNYGKX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GR34XAZD7DWA4GPLLFZJQNYGKX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GR34XAZD7DWA4GPLLFZJQNYGKX/action/storage_attestation","attest_author":"https://pith.science/pith/GR34XAZD7DWA4GPLLFZJQNYGKX/action/author_attestation","sign_citation":"https://pith.science/pith/GR34XAZD7DWA4GPLLFZJQNYGKX/action/citation_signature","submit_replication":"https://pith.science/pith/GR34XAZD7DWA4GPLLFZJQNYGKX/action/replication_record"}},"created_at":"2026-05-18T00:25:36.004803+00:00","updated_at":"2026-05-18T00:25:36.004803+00:00"}