{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:Y6KLB5ZS2PLAWFVP7ZDERDANCC","short_pith_number":"pith:Y6KLB5ZS","canonical_record":{"source":{"id":"1109.1579","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-07T21:10:36Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b0b309231b74700de1582346e6f7f637b5160020bbc7a1dbf6dda8a6248fa9b6","abstract_canon_sha256":"1971c8d4456fc3abdd648797a6b803e52034514ddbdd8e78212e6e0c4e6625d9"},"schema_version":"1.0"},"canonical_sha256":"c794b0f732d3d60b16affe46488c0d108d1864439004b8cbf8f5f1acf97ff571","source":{"kind":"arxiv","id":"1109.1579","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1579","created_at":"2026-05-18T04:13:54Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1579v1","created_at":"2026-05-18T04:13:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1579","created_at":"2026-05-18T04:13:54Z"},{"alias_kind":"pith_short_12","alias_value":"Y6KLB5ZS2PLA","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Y6KLB5ZS2PLAWFVP","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Y6KLB5ZS","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:Y6KLB5ZS2PLAWFVP7ZDERDANCC","target":"record","payload":{"canonical_record":{"source":{"id":"1109.1579","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-07T21:10:36Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b0b309231b74700de1582346e6f7f637b5160020bbc7a1dbf6dda8a6248fa9b6","abstract_canon_sha256":"1971c8d4456fc3abdd648797a6b803e52034514ddbdd8e78212e6e0c4e6625d9"},"schema_version":"1.0"},"canonical_sha256":"c794b0f732d3d60b16affe46488c0d108d1864439004b8cbf8f5f1acf97ff571","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:54.884954Z","signature_b64":"It+ykLUnFQHjbEKYhlIaO9ERUG1U79dwNjNB5TGUfAcTWtX38Whjn600G/BWIqwKmLJ/qJBlH49ixowS3w8NDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c794b0f732d3d60b16affe46488c0d108d1864439004b8cbf8f5f1acf97ff571","last_reissued_at":"2026-05-18T04:13:54.884362Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:54.884362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.1579","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-18T04:13:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z5+48pnYYyni3mACNH9s7fm2mAnWNP/BkHPrwdht5K8oZxGcy4sMYeeBJACiZMCRmLlwVko3bpuW7DlpNW+lAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T12:51:38.274066Z"},"content_sha256":"d29947ff1218d65c831d0084bd650bea49c037133fe2831504691e15c592336c","schema_version":"1.0","event_id":"sha256:d29947ff1218d65c831d0084bd650bea49c037133fe2831504691e15c592336c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:Y6KLB5ZS2PLAWFVP7ZDERDANCC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Clustering using MapReduce","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Alina Ene, Benjamin Moseley, Sungjin Im","submitted_at":"2011-09-07T21:10:36Z","abstract_excerpt":"Clustering problems have numerous applications and are becoming more challenging as the size of the data increases. In this paper, we consider designing clustering algorithms that can be used in MapReduce, the most popular programming environment for processing large datasets. We focus on the practical and popular clustering problems, $k$-center and $k$-median. We develop fast clustering algorithms with constant factor approximation guarantees. From a theoretical perspective, we give the first analysis that shows several clustering algorithms are in $\\mathcal{MRC}^0$, a theoretical MapReduce c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1579","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-18T04:13:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nt2f4C3yIYg8fYxBvi34wO0Uof/Q/TvlBXWzoJ5jV6fq4PwAEtqtYqNRaors2vFkhqJ/K++g5ip0WfCvslAZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T12:51:38.274431Z"},"content_sha256":"f624110e56485b76c0f2efefacce50e73acd1c3968292a0b0c572f1dee59f7ae","schema_version":"1.0","event_id":"sha256:f624110e56485b76c0f2efefacce50e73acd1c3968292a0b0c572f1dee59f7ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y6KLB5ZS2PLAWFVP7ZDERDANCC/bundle.json","state_url":"https://pith.science/pith/Y6KLB5ZS2PLAWFVP7ZDERDANCC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y6KLB5ZS2PLAWFVP7ZDERDANCC/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-27T12:51:38Z","links":{"resolver":"https://pith.science/pith/Y6KLB5ZS2PLAWFVP7ZDERDANCC","bundle":"https://pith.science/pith/Y6KLB5ZS2PLAWFVP7ZDERDANCC/bundle.json","state":"https://pith.science/pith/Y6KLB5ZS2PLAWFVP7ZDERDANCC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y6KLB5ZS2PLAWFVP7ZDERDANCC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:Y6KLB5ZS2PLAWFVP7ZDERDANCC","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":"1971c8d4456fc3abdd648797a6b803e52034514ddbdd8e78212e6e0c4e6625d9","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-07T21:10:36Z","title_canon_sha256":"b0b309231b74700de1582346e6f7f637b5160020bbc7a1dbf6dda8a6248fa9b6"},"schema_version":"1.0","source":{"id":"1109.1579","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1579","created_at":"2026-05-18T04:13:54Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1579v1","created_at":"2026-05-18T04:13:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1579","created_at":"2026-05-18T04:13:54Z"},{"alias_kind":"pith_short_12","alias_value":"Y6KLB5ZS2PLA","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Y6KLB5ZS2PLAWFVP","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Y6KLB5ZS","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:f624110e56485b76c0f2efefacce50e73acd1c3968292a0b0c572f1dee59f7ae","target":"graph","created_at":"2026-05-18T04:13:54Z","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":"Clustering problems have numerous applications and are becoming more challenging as the size of the data increases. In this paper, we consider designing clustering algorithms that can be used in MapReduce, the most popular programming environment for processing large datasets. We focus on the practical and popular clustering problems, $k$-center and $k$-median. We develop fast clustering algorithms with constant factor approximation guarantees. From a theoretical perspective, we give the first analysis that shows several clustering algorithms are in $\\mathcal{MRC}^0$, a theoretical MapReduce c","authors_text":"Alina Ene, Benjamin Moseley, Sungjin Im","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-07T21:10:36Z","title":"Fast Clustering using MapReduce"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1579","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:d29947ff1218d65c831d0084bd650bea49c037133fe2831504691e15c592336c","target":"record","created_at":"2026-05-18T04:13:54Z","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":"1971c8d4456fc3abdd648797a6b803e52034514ddbdd8e78212e6e0c4e6625d9","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-07T21:10:36Z","title_canon_sha256":"b0b309231b74700de1582346e6f7f637b5160020bbc7a1dbf6dda8a6248fa9b6"},"schema_version":"1.0","source":{"id":"1109.1579","kind":"arxiv","version":1}},"canonical_sha256":"c794b0f732d3d60b16affe46488c0d108d1864439004b8cbf8f5f1acf97ff571","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c794b0f732d3d60b16affe46488c0d108d1864439004b8cbf8f5f1acf97ff571","first_computed_at":"2026-05-18T04:13:54.884362Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:13:54.884362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"It+ykLUnFQHjbEKYhlIaO9ERUG1U79dwNjNB5TGUfAcTWtX38Whjn600G/BWIqwKmLJ/qJBlH49ixowS3w8NDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:13:54.884954Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.1579","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d29947ff1218d65c831d0084bd650bea49c037133fe2831504691e15c592336c","sha256:f624110e56485b76c0f2efefacce50e73acd1c3968292a0b0c572f1dee59f7ae"],"state_sha256":"64e88233b906d8912d020c3757903c706394d8363239b0a51b5bc360fc5dbbaf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m/F7EJytRD3Tat0ltHNffr1SQmEkdg9miSh9qrpEPRES0ssclHRWZH4sikby05UvP2ojwfg4rYn9tqw0h9+8Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T12:51:38.276414Z","bundle_sha256":"ab6fe2f467f3e4607827addf35d66d5e41acff6c24cccd864e0122cb0a7ddbf8"}}