{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:REZNV3FRVFYFKVHHK3O4EDIVHW","short_pith_number":"pith:REZNV3FR","canonical_record":{"source":{"id":"1811.06072","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-14T21:33:45Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"0bafc067b1563af49e12159a75f888d87103aa04b4ae1aaadb7c34477c74ab25","abstract_canon_sha256":"5930b52efd3e3780270ea24d79c0e54087876d20db59b187b056541625b3a10b"},"schema_version":"1.0"},"canonical_sha256":"8932daecb1a9705554e756ddc20d153da763ec54d1c586fa70b7d57b924e6587","source":{"kind":"arxiv","id":"1811.06072","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06072","created_at":"2026-05-18T00:00:38Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06072v1","created_at":"2026-05-18T00:00:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06072","created_at":"2026-05-18T00:00:38Z"},{"alias_kind":"pith_short_12","alias_value":"REZNV3FRVFYF","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"REZNV3FRVFYFKVHH","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"REZNV3FR","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:REZNV3FRVFYFKVHHK3O4EDIVHW","target":"record","payload":{"canonical_record":{"source":{"id":"1811.06072","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-14T21:33:45Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"0bafc067b1563af49e12159a75f888d87103aa04b4ae1aaadb7c34477c74ab25","abstract_canon_sha256":"5930b52efd3e3780270ea24d79c0e54087876d20db59b187b056541625b3a10b"},"schema_version":"1.0"},"canonical_sha256":"8932daecb1a9705554e756ddc20d153da763ec54d1c586fa70b7d57b924e6587","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:38.728691Z","signature_b64":"m55npSJj/ZJqecQx3SdiiLfBsP1/CGrSWYRAGDdLpIOvS/VlnQQ54NCcivNcld7BejQGXGJy+iCwmL6qDxVmCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8932daecb1a9705554e756ddc20d153da763ec54d1c586fa70b7d57b924e6587","last_reissued_at":"2026-05-18T00:00:38.728104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:38.728104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.06072","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:00:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g6uSDoBS/2wKgFbGjnZVRBS/srtuTSjxNVSXvZSFz8XOcwN69J1htg2aIybJpChb5lYY8RjcsOzo3/yln9DRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:28:06.631029Z"},"content_sha256":"9768388ad427688c33395d40d7cb5d6ea8cc12d9f6ca7e6d0d46fe6588e08f5b","schema_version":"1.0","event_id":"sha256:9768388ad427688c33395d40d7cb5d6ea8cc12d9f6ca7e6d0d46fe6588e08f5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:REZNV3FRVFYFKVHHK3O4EDIVHW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Communication-Optimal Distributed Dynamic Graph Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Chun Jiang Zhu, Jinbo Bi, Kam-yiu Lam, Song Han, Tan Zhu","submitted_at":"2018-11-14T21:33:45Z","abstract_excerpt":"We consider the problem of clustering graph nodes over large-scale dynamic graphs, such as citation networks, images and web networks, when graph updates such as node/edge insertions/deletions are observed distributively. We propose communication-efficient algorithms for two well-established communication models namely the message passing and the blackboard models. Given a graph with $n$ nodes that is observed at $s$ remote sites over time $[1,t]$, the two proposed algorithms have communication costs $\\tilde{O}(ns)$ and $\\tilde{O}(n+s)$ ($\\tilde{O}$ hides a polylogarithmic factor), almost matc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06072","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:00:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Em5OkBTLQKV0N4PwuN9eohQ2h4aJmwaKhLNw36N2ZlXzrfqYo0KqbllM+1kM4Ict4HZe1Qr4bSRoRUgLV+K4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:28:06.631692Z"},"content_sha256":"9176f7755818121310aed44cf7842605d5291a7c18473491fdd2b2156fde27cb","schema_version":"1.0","event_id":"sha256:9176f7755818121310aed44cf7842605d5291a7c18473491fdd2b2156fde27cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/REZNV3FRVFYFKVHHK3O4EDIVHW/bundle.json","state_url":"https://pith.science/pith/REZNV3FRVFYFKVHHK3O4EDIVHW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/REZNV3FRVFYFKVHHK3O4EDIVHW/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-02T12:28:06Z","links":{"resolver":"https://pith.science/pith/REZNV3FRVFYFKVHHK3O4EDIVHW","bundle":"https://pith.science/pith/REZNV3FRVFYFKVHHK3O4EDIVHW/bundle.json","state":"https://pith.science/pith/REZNV3FRVFYFKVHHK3O4EDIVHW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/REZNV3FRVFYFKVHHK3O4EDIVHW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:REZNV3FRVFYFKVHHK3O4EDIVHW","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":"5930b52efd3e3780270ea24d79c0e54087876d20db59b187b056541625b3a10b","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-14T21:33:45Z","title_canon_sha256":"0bafc067b1563af49e12159a75f888d87103aa04b4ae1aaadb7c34477c74ab25"},"schema_version":"1.0","source":{"id":"1811.06072","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06072","created_at":"2026-05-18T00:00:38Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06072v1","created_at":"2026-05-18T00:00:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06072","created_at":"2026-05-18T00:00:38Z"},{"alias_kind":"pith_short_12","alias_value":"REZNV3FRVFYF","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"REZNV3FRVFYFKVHH","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"REZNV3FR","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:9176f7755818121310aed44cf7842605d5291a7c18473491fdd2b2156fde27cb","target":"graph","created_at":"2026-05-18T00:00:38Z","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":"We consider the problem of clustering graph nodes over large-scale dynamic graphs, such as citation networks, images and web networks, when graph updates such as node/edge insertions/deletions are observed distributively. We propose communication-efficient algorithms for two well-established communication models namely the message passing and the blackboard models. Given a graph with $n$ nodes that is observed at $s$ remote sites over time $[1,t]$, the two proposed algorithms have communication costs $\\tilde{O}(ns)$ and $\\tilde{O}(n+s)$ ($\\tilde{O}$ hides a polylogarithmic factor), almost matc","authors_text":"Chun Jiang Zhu, Jinbo Bi, Kam-yiu Lam, Song Han, Tan Zhu","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-14T21:33:45Z","title":"Communication-Optimal Distributed Dynamic Graph Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06072","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:9768388ad427688c33395d40d7cb5d6ea8cc12d9f6ca7e6d0d46fe6588e08f5b","target":"record","created_at":"2026-05-18T00:00:38Z","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":"5930b52efd3e3780270ea24d79c0e54087876d20db59b187b056541625b3a10b","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-14T21:33:45Z","title_canon_sha256":"0bafc067b1563af49e12159a75f888d87103aa04b4ae1aaadb7c34477c74ab25"},"schema_version":"1.0","source":{"id":"1811.06072","kind":"arxiv","version":1}},"canonical_sha256":"8932daecb1a9705554e756ddc20d153da763ec54d1c586fa70b7d57b924e6587","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8932daecb1a9705554e756ddc20d153da763ec54d1c586fa70b7d57b924e6587","first_computed_at":"2026-05-18T00:00:38.728104Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:38.728104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m55npSJj/ZJqecQx3SdiiLfBsP1/CGrSWYRAGDdLpIOvS/VlnQQ54NCcivNcld7BejQGXGJy+iCwmL6qDxVmCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:38.728691Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.06072","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9768388ad427688c33395d40d7cb5d6ea8cc12d9f6ca7e6d0d46fe6588e08f5b","sha256:9176f7755818121310aed44cf7842605d5291a7c18473491fdd2b2156fde27cb"],"state_sha256":"56754bf6c4056e7fde23b49869e070c7d2bfc92157e20a22ab09c838544a61c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9tbkBEfaqqUwr4jXQOp16nfPwRUZTim4nAK8vy4yAVF2YWdH2xCLoyK8nDlatfg9PFPpligsqbCBR7tUxcb8BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T12:28:06.635374Z","bundle_sha256":"5fdbd39409b60d936646ffbbbeddf329774f5bc53b5756778f554b183b461e34"}}