{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GR34XAZD7DWA4GPLLFZJQNYGKX","short_pith_number":"pith:GR34XAZD","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"},"canonical_sha256":"3477cb8323f8ec0e19eb597298370655c73a825c52d072540083a3b4a8d7e48b","source":{"kind":"arxiv","id":"1801.05946","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.05946","created_at":"2026-05-18T00:25:36Z"},{"alias_kind":"arxiv_version","alias_value":"1801.05946v1","created_at":"2026-05-18T00:25:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05946","created_at":"2026-05-18T00:25:36Z"},{"alias_kind":"pith_short_12","alias_value":"GR34XAZD7DWA","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GR34XAZD7DWA4GPL","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GR34XAZD","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GR34XAZD7DWA4GPLLFZJQNYGKX","target":"record","payload":{"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"},"canonical_sha256":"3477cb8323f8ec0e19eb597298370655c73a825c52d072540083a3b4a8d7e48b","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"},"source_kind":"arxiv","source_id":"1801.05946","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-18T00:25:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xg2gezyz2nMkVH73CmH4LZxCbfxHnnQnY2w0vB54WiuKuUabT8ctcxqqW0OyoTwkl1ApVb4U0P9mwXkLXEgIDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:13:12.003360Z"},"content_sha256":"e0dd60da9c7195837eb7f0df9b4c3a5bae1d804462efec1e774a58601b72538d","schema_version":"1.0","event_id":"sha256:e0dd60da9c7195837eb7f0df9b4c3a5bae1d804462efec1e774a58601b72538d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GR34XAZD7DWA4GPLLFZJQNYGKX","target":"graph","payload":{"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"},"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-18T00:25:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KIwgM8B2eBHF9dJPNA/iQp3QogR0VzLzBpai+7uhFgJSnkg8Ug74hklr5Kx/mGZ6TVT5+KAb5lIF33gcxp4jAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:13:12.004015Z"},"content_sha256":"9dc5358f62e613ebd1c5aeb5a3f8eb535a65e3b09caf5634cfb1ff5000a9de48","schema_version":"1.0","event_id":"sha256:9dc5358f62e613ebd1c5aeb5a3f8eb535a65e3b09caf5634cfb1ff5000a9de48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GR34XAZD7DWA4GPLLFZJQNYGKX/bundle.json","state_url":"https://pith.science/pith/GR34XAZD7DWA4GPLLFZJQNYGKX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GR34XAZD7DWA4GPLLFZJQNYGKX/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-03T15:13:12Z","links":{"resolver":"https://pith.science/pith/GR34XAZD7DWA4GPLLFZJQNYGKX","bundle":"https://pith.science/pith/GR34XAZD7DWA4GPLLFZJQNYGKX/bundle.json","state":"https://pith.science/pith/GR34XAZD7DWA4GPLLFZJQNYGKX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GR34XAZD7DWA4GPLLFZJQNYGKX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GR34XAZD7DWA4GPLLFZJQNYGKX","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":"2b5845f90f454c42e428e77c77cc9c51b745e2055f5c1230371745247a86015b","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-01-18T05:51:46Z","title_canon_sha256":"2cfc16713b066d45cd5ebc5100f4bd73613b22a44c8ef73252e77ff241116c45"},"schema_version":"1.0","source":{"id":"1801.05946","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.05946","created_at":"2026-05-18T00:25:36Z"},{"alias_kind":"arxiv_version","alias_value":"1801.05946v1","created_at":"2026-05-18T00:25:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05946","created_at":"2026-05-18T00:25:36Z"},{"alias_kind":"pith_short_12","alias_value":"GR34XAZD7DWA","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GR34XAZD7DWA4GPL","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GR34XAZD","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:9dc5358f62e613ebd1c5aeb5a3f8eb535a65e3b09caf5634cfb1ff5000a9de48","target":"graph","created_at":"2026-05-18T00:25:36Z","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":"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","authors_text":"Lei Chen, Xiang Lian, Xun Jian","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-01-18T05:51:46Z","title":"On Efficiently Detecting Overlapping Communities over Distributed Dynamic Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05946","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:e0dd60da9c7195837eb7f0df9b4c3a5bae1d804462efec1e774a58601b72538d","target":"record","created_at":"2026-05-18T00:25:36Z","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":"2b5845f90f454c42e428e77c77cc9c51b745e2055f5c1230371745247a86015b","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-01-18T05:51:46Z","title_canon_sha256":"2cfc16713b066d45cd5ebc5100f4bd73613b22a44c8ef73252e77ff241116c45"},"schema_version":"1.0","source":{"id":"1801.05946","kind":"arxiv","version":1}},"canonical_sha256":"3477cb8323f8ec0e19eb597298370655c73a825c52d072540083a3b4a8d7e48b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3477cb8323f8ec0e19eb597298370655c73a825c52d072540083a3b4a8d7e48b","first_computed_at":"2026-05-18T00:25:36.004666Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:36.004666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sqRRNJphCBNr8A2++K7AKSa84cfSuOscZgu5gZ/92thl+Sc0Z8nmVg2vWydVsRjXEO0ACkXgIsnumJhDRMSUBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:36.005431Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.05946","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0dd60da9c7195837eb7f0df9b4c3a5bae1d804462efec1e774a58601b72538d","sha256:9dc5358f62e613ebd1c5aeb5a3f8eb535a65e3b09caf5634cfb1ff5000a9de48"],"state_sha256":"e95f851403bfd17810fcb3ad9d755d9ae67d7ad3e5c1f3630e08de9f019a4dbf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mLSBkZRxxO7B0NJrXavQuwb3pjwwT4HrxcJmcYmyKAxRrcSh+11p7Lu/09AH+s9L+4LFH9DoORwe8Ql7b733Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T15:13:12.006609Z","bundle_sha256":"54458f407a792ea6980c91d64e72a5dfa1f0b0cf167007a9f9a5247243ee5445"}}