{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KWTEMA46JKKNKRFEVL32FC5UJD","short_pith_number":"pith:KWTEMA46","canonical_record":{"source":{"id":"1710.08381","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-10-23T16:57:50Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3fb56d1f4defce62d63d4d1e2307961c8eb9e2dd53973b2f46f88a25c618e95b","abstract_canon_sha256":"846d1a6db7186a90b7d7acb095dd691bc1f2d9a1c49becb8921d66d8fa85069c"},"schema_version":"1.0"},"canonical_sha256":"55a646039e4a94d544a4aaf7a28bb448ee3478f82b583ffc2c418849c304afb5","source":{"kind":"arxiv","id":"1710.08381","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08381","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08381v1","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08381","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"pith_short_12","alias_value":"KWTEMA46JKKN","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KWTEMA46JKKNKRFE","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KWTEMA46","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KWTEMA46JKKNKRFEVL32FC5UJD","target":"record","payload":{"canonical_record":{"source":{"id":"1710.08381","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-10-23T16:57:50Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3fb56d1f4defce62d63d4d1e2307961c8eb9e2dd53973b2f46f88a25c618e95b","abstract_canon_sha256":"846d1a6db7186a90b7d7acb095dd691bc1f2d9a1c49becb8921d66d8fa85069c"},"schema_version":"1.0"},"canonical_sha256":"55a646039e4a94d544a4aaf7a28bb448ee3478f82b583ffc2c418849c304afb5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:16.558208Z","signature_b64":"Ee7elA+082Pjf28zjzCAnvJtGiBd2hUhwRCcWX6BxUnRb9JoQ8Ww6AeCVim9ikCcPNHd6Y7KMj1u1gB2pwB0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55a646039e4a94d544a4aaf7a28bb448ee3478f82b583ffc2c418849c304afb5","last_reissued_at":"2026-05-18T00:32:16.557599Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:16.557599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.08381","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:32:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pRcNNuKkhNrHxdXKMDaP1FdnpuYe9d2+WDlTYo6kSjRYLbB2Ofrbk888rvKD+tdmR4CZ05jtjv1OgZnH8PrUBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T15:22:37.759818Z"},"content_sha256":"1ace8470e78729e1368ad570f01448af0f30e1823fdfae6ff27e96fa174dedcb","schema_version":"1.0","event_id":"sha256:1ace8470e78729e1368ad570f01448af0f30e1823fdfae6ff27e96fa174dedcb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KWTEMA46JKKNKRFEVL32FC5UJD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-Optimal Clustering in the $k$-machine model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Sayan Bandyapadhyay, Shreyas Pai, Sriram V. Pemmaraju, Tanmay Inamdar","submitted_at":"2017-10-23T16:57:50Z","abstract_excerpt":"The clustering problem, in its many variants, has numerous applications in operations research and computer science (e.g., in applications in bioinformatics, image processing, social network analysis, etc.). As sizes of data sets have grown rapidly, researchers have focused on designing algorithms for clustering problems in models of computation suited for large-scale computation such as MapReduce, Pregel, and streaming models. The $k$-machine model (Klauck et al., SODA 2015) is a simple, message-passing model for large-scale distributed graph processing. This paper considers three of the most"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08381","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:32:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Dq8hx/LzKsleBDQfli3RGvxIutgDQmcVfoCn3e6nnAmZZE9Yy4P8edcKl68/2wLbeWlpyXeoJKujyZ9ALZqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T15:22:37.760166Z"},"content_sha256":"8ce437e757dae01bc64dc72e9b4b94fcfd67d9633562ecb3f2120735c196d203","schema_version":"1.0","event_id":"sha256:8ce437e757dae01bc64dc72e9b4b94fcfd67d9633562ecb3f2120735c196d203"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KWTEMA46JKKNKRFEVL32FC5UJD/bundle.json","state_url":"https://pith.science/pith/KWTEMA46JKKNKRFEVL32FC5UJD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KWTEMA46JKKNKRFEVL32FC5UJD/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-21T15:22:37Z","links":{"resolver":"https://pith.science/pith/KWTEMA46JKKNKRFEVL32FC5UJD","bundle":"https://pith.science/pith/KWTEMA46JKKNKRFEVL32FC5UJD/bundle.json","state":"https://pith.science/pith/KWTEMA46JKKNKRFEVL32FC5UJD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KWTEMA46JKKNKRFEVL32FC5UJD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KWTEMA46JKKNKRFEVL32FC5UJD","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":"846d1a6db7186a90b7d7acb095dd691bc1f2d9a1c49becb8921d66d8fa85069c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-10-23T16:57:50Z","title_canon_sha256":"3fb56d1f4defce62d63d4d1e2307961c8eb9e2dd53973b2f46f88a25c618e95b"},"schema_version":"1.0","source":{"id":"1710.08381","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08381","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08381v1","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08381","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"pith_short_12","alias_value":"KWTEMA46JKKN","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KWTEMA46JKKNKRFE","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KWTEMA46","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:8ce437e757dae01bc64dc72e9b4b94fcfd67d9633562ecb3f2120735c196d203","target":"graph","created_at":"2026-05-18T00:32:16Z","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 clustering problem, in its many variants, has numerous applications in operations research and computer science (e.g., in applications in bioinformatics, image processing, social network analysis, etc.). As sizes of data sets have grown rapidly, researchers have focused on designing algorithms for clustering problems in models of computation suited for large-scale computation such as MapReduce, Pregel, and streaming models. The $k$-machine model (Klauck et al., SODA 2015) is a simple, message-passing model for large-scale distributed graph processing. This paper considers three of the most","authors_text":"Sayan Bandyapadhyay, Shreyas Pai, Sriram V. Pemmaraju, Tanmay Inamdar","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-10-23T16:57:50Z","title":"Near-Optimal Clustering in the $k$-machine model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08381","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:1ace8470e78729e1368ad570f01448af0f30e1823fdfae6ff27e96fa174dedcb","target":"record","created_at":"2026-05-18T00:32:16Z","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":"846d1a6db7186a90b7d7acb095dd691bc1f2d9a1c49becb8921d66d8fa85069c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-10-23T16:57:50Z","title_canon_sha256":"3fb56d1f4defce62d63d4d1e2307961c8eb9e2dd53973b2f46f88a25c618e95b"},"schema_version":"1.0","source":{"id":"1710.08381","kind":"arxiv","version":1}},"canonical_sha256":"55a646039e4a94d544a4aaf7a28bb448ee3478f82b583ffc2c418849c304afb5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55a646039e4a94d544a4aaf7a28bb448ee3478f82b583ffc2c418849c304afb5","first_computed_at":"2026-05-18T00:32:16.557599Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:16.557599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ee7elA+082Pjf28zjzCAnvJtGiBd2hUhwRCcWX6BxUnRb9JoQ8Ww6AeCVim9ikCcPNHd6Y7KMj1u1gB2pwB0Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:16.558208Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.08381","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ace8470e78729e1368ad570f01448af0f30e1823fdfae6ff27e96fa174dedcb","sha256:8ce437e757dae01bc64dc72e9b4b94fcfd67d9633562ecb3f2120735c196d203"],"state_sha256":"711cec73d97d8f544f3f8ec45b08836973ec8dd4b6c432bdc0d835681cd2f1f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zeV55DjT760f+OOG11TN8yzHEQOqYi84Eml/at4KSwsjH49XCaZzr5WWBWWeQXdBdz9mSIJuS9+1sX3fUWBiAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T15:22:37.762129Z","bundle_sha256":"7d017e894196296f4280736af89fa1e510b0010620b61ebe3634d967549873a6"}}