{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:2QN7VAK3LG4JUF2L35RQO6IPRM","short_pith_number":"pith:2QN7VAK3","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"},"canonical_sha256":"d41bfa815b59b89a174bdf6307790f8b0f1fe7b11a9a66bfa30bc39e5c5d1fa1","source":{"kind":"arxiv","id":"1904.07494","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.07494","created_at":"2026-05-17T23:48:25Z"},{"alias_kind":"arxiv_version","alias_value":"1904.07494v1","created_at":"2026-05-17T23:48:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07494","created_at":"2026-05-17T23:48:25Z"},{"alias_kind":"pith_short_12","alias_value":"2QN7VAK3LG4J","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2QN7VAK3LG4JUF2L","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2QN7VAK3","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:2QN7VAK3LG4JUF2L35RQO6IPRM","target":"record","payload":{"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"},"canonical_sha256":"d41bfa815b59b89a174bdf6307790f8b0f1fe7b11a9a66bfa30bc39e5c5d1fa1","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"},"source_kind":"arxiv","source_id":"1904.07494","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-17T23:48:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2SovppmyN5dc+B0bASeFue+qr42HUS/tN4Qivg52paOvfWJ6AIvfzleaGk6bz7dcLIaW8CKJR3E2JEApitrXDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T02:55:55.470759Z"},"content_sha256":"2bc2abeae8510d871db41676e03526ad84c1b76161da3a050c72bb4797cb03bb","schema_version":"1.0","event_id":"sha256:2bc2abeae8510d871db41676e03526ad84c1b76161da3a050c72bb4797cb03bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:2QN7VAK3LG4JUF2L35RQO6IPRM","target":"graph","payload":{"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"},"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-17T23:48:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XgnMfOenrTLe0GSZoMWG7z6ADaL7wMVFayqgyIFfAdX87jMLG1/6NxiSc9dpVQJyaBHxb5u6bA7jL1ePxpYPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T02:55:55.471110Z"},"content_sha256":"332f1edf59f09cc59e045a58b57631a491ff5e4528ebd1cd8fb3faadb39b90f0","schema_version":"1.0","event_id":"sha256:332f1edf59f09cc59e045a58b57631a491ff5e4528ebd1cd8fb3faadb39b90f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2QN7VAK3LG4JUF2L35RQO6IPRM/bundle.json","state_url":"https://pith.science/pith/2QN7VAK3LG4JUF2L35RQO6IPRM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2QN7VAK3LG4JUF2L35RQO6IPRM/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-07-01T02:55:55Z","links":{"resolver":"https://pith.science/pith/2QN7VAK3LG4JUF2L35RQO6IPRM","bundle":"https://pith.science/pith/2QN7VAK3LG4JUF2L35RQO6IPRM/bundle.json","state":"https://pith.science/pith/2QN7VAK3LG4JUF2L35RQO6IPRM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2QN7VAK3LG4JUF2L35RQO6IPRM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:2QN7VAK3LG4JUF2L35RQO6IPRM","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":"af7503861c334f5d5a52e6fbe729c1d42655221ec6f5b568fb065e40efa040f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-16T07:03:06Z","title_canon_sha256":"9a50c28c946ad87f067ce06d828ae93a8a2ab2f732ceaf422bc970c3731727b2"},"schema_version":"1.0","source":{"id":"1904.07494","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.07494","created_at":"2026-05-17T23:48:25Z"},{"alias_kind":"arxiv_version","alias_value":"1904.07494v1","created_at":"2026-05-17T23:48:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07494","created_at":"2026-05-17T23:48:25Z"},{"alias_kind":"pith_short_12","alias_value":"2QN7VAK3LG4J","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2QN7VAK3LG4JUF2L","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2QN7VAK3","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:332f1edf59f09cc59e045a58b57631a491ff5e4528ebd1cd8fb3faadb39b90f0","target":"graph","created_at":"2026-05-17T23:48:25Z","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":"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","authors_text":"Anisur Rahaman Molla, Gopal Pandurangan, Reza Fathi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-16T07:03:06Z","title":"Efficient Distributed Community Detection in the Stochastic Block Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07494","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:2bc2abeae8510d871db41676e03526ad84c1b76161da3a050c72bb4797cb03bb","target":"record","created_at":"2026-05-17T23:48:25Z","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":"af7503861c334f5d5a52e6fbe729c1d42655221ec6f5b568fb065e40efa040f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-16T07:03:06Z","title_canon_sha256":"9a50c28c946ad87f067ce06d828ae93a8a2ab2f732ceaf422bc970c3731727b2"},"schema_version":"1.0","source":{"id":"1904.07494","kind":"arxiv","version":1}},"canonical_sha256":"d41bfa815b59b89a174bdf6307790f8b0f1fe7b11a9a66bfa30bc39e5c5d1fa1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d41bfa815b59b89a174bdf6307790f8b0f1fe7b11a9a66bfa30bc39e5c5d1fa1","first_computed_at":"2026-05-17T23:48:25.065147Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:25.065147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jG/AIGq1nap4a0cYBDpl0PBsTJdnKXEMMEZiaPt3jpas7iT2610rSRMqzyvKl7F1xlCqUQoIlJO1y5KNWCL7Dw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:25.065654Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.07494","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2bc2abeae8510d871db41676e03526ad84c1b76161da3a050c72bb4797cb03bb","sha256:332f1edf59f09cc59e045a58b57631a491ff5e4528ebd1cd8fb3faadb39b90f0"],"state_sha256":"356669112e5dbcd1089130fc64a60ae4abe97e35afe671bbece96a6e046469ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x76ZeD2CWIcBIOcJElcSuY99JR+UG5PyXmJNS7Uxha1rZ/iIaUqjaPsTwcEBDMrwW4FHGtSVQJ3zKDS/R7YUBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T02:55:55.473077Z","bundle_sha256":"bcf7f65551672100c878b41f60470b077d464d69b2a99db77c364ba0d55b4d8c"}}