{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LZLYRGMO2L5INQUTCBKMIE4FAX","short_pith_number":"pith:LZLYRGMO","canonical_record":{"source":{"id":"1905.01596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-05T04:02:28Z","cross_cats_sorted":["cs.DC","stat.ML"],"title_canon_sha256":"901be94569d3f9c1a25f0758296fac6aaad8cb90b9329ecbdd319dca7810cacb","abstract_canon_sha256":"d80fd53faccff6335f3f582d36a0b761418aa5fcadaedefba0106518ec34f035"},"schema_version":"1.0"},"canonical_sha256":"5e5788998ed2fa86c2931054c4138505ff32e84f1ebc1aea0d43e0f1be7bb250","source":{"kind":"arxiv","id":"1905.01596","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.01596","created_at":"2026-05-17T23:46:58Z"},{"alias_kind":"arxiv_version","alias_value":"1905.01596v1","created_at":"2026-05-17T23:46:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01596","created_at":"2026-05-17T23:46:58Z"},{"alias_kind":"pith_short_12","alias_value":"LZLYRGMO2L5I","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LZLYRGMO2L5INQUT","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LZLYRGMO","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LZLYRGMO2L5INQUTCBKMIE4FAX","target":"record","payload":{"canonical_record":{"source":{"id":"1905.01596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-05T04:02:28Z","cross_cats_sorted":["cs.DC","stat.ML"],"title_canon_sha256":"901be94569d3f9c1a25f0758296fac6aaad8cb90b9329ecbdd319dca7810cacb","abstract_canon_sha256":"d80fd53faccff6335f3f582d36a0b761418aa5fcadaedefba0106518ec34f035"},"schema_version":"1.0"},"canonical_sha256":"5e5788998ed2fa86c2931054c4138505ff32e84f1ebc1aea0d43e0f1be7bb250","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:58.045265Z","signature_b64":"qKOiqG6eRyWmjPpD0bWi8NF2cSbXfr1QU3CTZrFg+77j+eHq8VPcsjqWvLfuW707wUZsr5EdtXrdTHSV4m4rAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e5788998ed2fa86c2931054c4138505ff32e84f1ebc1aea0d43e0f1be7bb250","last_reissued_at":"2026-05-17T23:46:58.044577Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:58.044577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.01596","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:46:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DOT0KWFTJqyO6ayCchGg2GkaRevAGv/B+ve6lcuSlaelA3IXg62rmP62g90DbwDU0jr4S2Yktl+vdnqC+ILxCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T21:59:19.813743Z"},"content_sha256":"55ac94bf6738bc1ce755e3a6287ba6fd327451b1e6df8c9d68dbbae835a5adfd","schema_version":"1.0","event_id":"sha256:55ac94bf6738bc1ce755e3a6287ba6fd327451b1e6df8c9d68dbbae835a5adfd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LZLYRGMO2L5INQUTCBKMIE4FAX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast communication-efficient spectral clustering over distributed data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Donghui Yan, Guodong Wu, Honggang Wang, Jin Wang, Yingjie Wang","submitted_at":"2019-05-05T04:02:28Z","abstract_excerpt":"The last decades have seen a surge of interests in distributed computing thanks to advances in clustered computing and big data technology. Existing distributed algorithms typically assume {\\it all the data are already in one place}, and divide the data and conquer on multiple machines. However, it is increasingly often that the data are located at a number of distributed sites, and one wishes to compute over all the data with low communication overhead. For spectral clustering, we propose a novel framework that enables its computation over such distributed data, with \"minimal\" communications "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01596","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:46:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"67fSkI7YtEGDV07BScRG0m8uBNWHjXoGkeJawlQMSWQEzfdn2RTM/ZfnQ96+Ly3C6mlq3Dj9My6KV6QFLp5DDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T21:59:19.814098Z"},"content_sha256":"377f767ede9ff2176b0f4a97d89663bfc916df282b0895c13b6a5c852bc51db9","schema_version":"1.0","event_id":"sha256:377f767ede9ff2176b0f4a97d89663bfc916df282b0895c13b6a5c852bc51db9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LZLYRGMO2L5INQUTCBKMIE4FAX/bundle.json","state_url":"https://pith.science/pith/LZLYRGMO2L5INQUTCBKMIE4FAX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LZLYRGMO2L5INQUTCBKMIE4FAX/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-22T21:59:19Z","links":{"resolver":"https://pith.science/pith/LZLYRGMO2L5INQUTCBKMIE4FAX","bundle":"https://pith.science/pith/LZLYRGMO2L5INQUTCBKMIE4FAX/bundle.json","state":"https://pith.science/pith/LZLYRGMO2L5INQUTCBKMIE4FAX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LZLYRGMO2L5INQUTCBKMIE4FAX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LZLYRGMO2L5INQUTCBKMIE4FAX","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":"d80fd53faccff6335f3f582d36a0b761418aa5fcadaedefba0106518ec34f035","cross_cats_sorted":["cs.DC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-05T04:02:28Z","title_canon_sha256":"901be94569d3f9c1a25f0758296fac6aaad8cb90b9329ecbdd319dca7810cacb"},"schema_version":"1.0","source":{"id":"1905.01596","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.01596","created_at":"2026-05-17T23:46:58Z"},{"alias_kind":"arxiv_version","alias_value":"1905.01596v1","created_at":"2026-05-17T23:46:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01596","created_at":"2026-05-17T23:46:58Z"},{"alias_kind":"pith_short_12","alias_value":"LZLYRGMO2L5I","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LZLYRGMO2L5INQUT","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LZLYRGMO","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:377f767ede9ff2176b0f4a97d89663bfc916df282b0895c13b6a5c852bc51db9","target":"graph","created_at":"2026-05-17T23:46:58Z","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":"The last decades have seen a surge of interests in distributed computing thanks to advances in clustered computing and big data technology. Existing distributed algorithms typically assume {\\it all the data are already in one place}, and divide the data and conquer on multiple machines. However, it is increasingly often that the data are located at a number of distributed sites, and one wishes to compute over all the data with low communication overhead. For spectral clustering, we propose a novel framework that enables its computation over such distributed data, with \"minimal\" communications ","authors_text":"Donghui Yan, Guodong Wu, Honggang Wang, Jin Wang, Yingjie Wang","cross_cats":["cs.DC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-05T04:02:28Z","title":"Fast communication-efficient spectral clustering over distributed data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01596","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:55ac94bf6738bc1ce755e3a6287ba6fd327451b1e6df8c9d68dbbae835a5adfd","target":"record","created_at":"2026-05-17T23:46:58Z","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":"d80fd53faccff6335f3f582d36a0b761418aa5fcadaedefba0106518ec34f035","cross_cats_sorted":["cs.DC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-05T04:02:28Z","title_canon_sha256":"901be94569d3f9c1a25f0758296fac6aaad8cb90b9329ecbdd319dca7810cacb"},"schema_version":"1.0","source":{"id":"1905.01596","kind":"arxiv","version":1}},"canonical_sha256":"5e5788998ed2fa86c2931054c4138505ff32e84f1ebc1aea0d43e0f1be7bb250","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e5788998ed2fa86c2931054c4138505ff32e84f1ebc1aea0d43e0f1be7bb250","first_computed_at":"2026-05-17T23:46:58.044577Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:58.044577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qKOiqG6eRyWmjPpD0bWi8NF2cSbXfr1QU3CTZrFg+77j+eHq8VPcsjqWvLfuW707wUZsr5EdtXrdTHSV4m4rAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:58.045265Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.01596","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55ac94bf6738bc1ce755e3a6287ba6fd327451b1e6df8c9d68dbbae835a5adfd","sha256:377f767ede9ff2176b0f4a97d89663bfc916df282b0895c13b6a5c852bc51db9"],"state_sha256":"6d15e8ff7553b0236eb8b7aaa4989281510240061e953df02ca238cf31245afd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7b8kpWupiuZbbU8JqqDmpLKFVvtTnbfIbRoOYmPo2slalhUWderMzsl/MsKhKDcWBNvFNmzIivcgds4dxyQpCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T21:59:19.816076Z","bundle_sha256":"8bea0bac5d46c5174941b43c58df4b29815a5b89f04db346c1b5e2fca67e46a3"}}