{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:EFWN7HWVFBT736FVSFI7HNGFXM","short_pith_number":"pith:EFWN7HWV","canonical_record":{"source":{"id":"1211.6526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-11-28T06:03:24Z","cross_cats_sorted":[],"title_canon_sha256":"8898f39d932d0f0b0872638a2e5fb3252d822f18e4264b741731e7d0c10bd790","abstract_canon_sha256":"b88282166a9b34cf46f329b9f1e556d91e1ac958aae395e5032f058223bae090"},"schema_version":"1.0"},"canonical_sha256":"216cdf9ed52867fdf8b59151f3b4c5bb2d31336ecbc5ff1a95c9c05a5be72055","source":{"kind":"arxiv","id":"1211.6526","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.6526","created_at":"2026-05-18T03:39:51Z"},{"alias_kind":"arxiv_version","alias_value":"1211.6526v1","created_at":"2026-05-18T03:39:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6526","created_at":"2026-05-18T03:39:51Z"},{"alias_kind":"pith_short_12","alias_value":"EFWN7HWVFBT7","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EFWN7HWVFBT736FV","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EFWN7HWV","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:EFWN7HWVFBT736FVSFI7HNGFXM","target":"record","payload":{"canonical_record":{"source":{"id":"1211.6526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-11-28T06:03:24Z","cross_cats_sorted":[],"title_canon_sha256":"8898f39d932d0f0b0872638a2e5fb3252d822f18e4264b741731e7d0c10bd790","abstract_canon_sha256":"b88282166a9b34cf46f329b9f1e556d91e1ac958aae395e5032f058223bae090"},"schema_version":"1.0"},"canonical_sha256":"216cdf9ed52867fdf8b59151f3b4c5bb2d31336ecbc5ff1a95c9c05a5be72055","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:51.281187Z","signature_b64":"M7oUha32m40jzH+viGWowDqInQKnNNr54MJFHnbGfW7Zx/deYP5EKPfpkv58ap1SssNeJI0HheQzpOdfoNPwDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"216cdf9ed52867fdf8b59151f3b4c5bb2d31336ecbc5ff1a95c9c05a5be72055","last_reissued_at":"2026-05-18T03:39:51.280719Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:51.280719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.6526","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-18T03:39:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S3crqC3I9dQTJNmxlmoeMdsAAEhaBCBxSZoCNzTkwApJKhxnYXZbNvdDMMxre/vlVHbvDBD+Kx2k/uGeOTrdAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T13:10:10.831352Z"},"content_sha256":"7d594bcd6eaf670f9876bb8a711cdc6196838722f511e8306dc77318fddf98b4","schema_version":"1.0","event_id":"sha256:7d594bcd6eaf670f9876bb8a711cdc6196838722f511e8306dc77318fddf98b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:EFWN7HWVFBT736FVSFI7HNGFXM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity Measures for Map-Reduce, and Comparison to Parallel Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ashish Goel, Kamesh Munagala","submitted_at":"2012-11-28T06:03:24Z","abstract_excerpt":"The programming paradigm Map-Reduce and its main open-source implementation, Hadoop, have had an enormous impact on large scale data processing. Our goal in this expository writeup is two-fold: first, we want to present some complexity measures that allow us to talk about Map-Reduce algorithms formally, and second, we want to point out why this model is actually different from other models of parallel programming, most notably the PRAM (Parallel Random Access Memory) model. We are looking for complexity measures that are detailed enough to make fine-grained distinction between different algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6526","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-18T03:39:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G58nepyyQNadvcyWtCaHnnolTyQm5eAmjafmKOm7OQGJGnZ0gaFGKE2i95J0w1kt+eDsDHwOmlqOhdEQmZOUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T13:10:10.831699Z"},"content_sha256":"13d9cbf41ab8cc72b56a5c2bcff9fa55eab9521e80b85595ce35fc13b0bd647b","schema_version":"1.0","event_id":"sha256:13d9cbf41ab8cc72b56a5c2bcff9fa55eab9521e80b85595ce35fc13b0bd647b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EFWN7HWVFBT736FVSFI7HNGFXM/bundle.json","state_url":"https://pith.science/pith/EFWN7HWVFBT736FVSFI7HNGFXM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EFWN7HWVFBT736FVSFI7HNGFXM/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-04T13:10:10Z","links":{"resolver":"https://pith.science/pith/EFWN7HWVFBT736FVSFI7HNGFXM","bundle":"https://pith.science/pith/EFWN7HWVFBT736FVSFI7HNGFXM/bundle.json","state":"https://pith.science/pith/EFWN7HWVFBT736FVSFI7HNGFXM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EFWN7HWVFBT736FVSFI7HNGFXM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:EFWN7HWVFBT736FVSFI7HNGFXM","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":"b88282166a9b34cf46f329b9f1e556d91e1ac958aae395e5032f058223bae090","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-11-28T06:03:24Z","title_canon_sha256":"8898f39d932d0f0b0872638a2e5fb3252d822f18e4264b741731e7d0c10bd790"},"schema_version":"1.0","source":{"id":"1211.6526","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.6526","created_at":"2026-05-18T03:39:51Z"},{"alias_kind":"arxiv_version","alias_value":"1211.6526v1","created_at":"2026-05-18T03:39:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6526","created_at":"2026-05-18T03:39:51Z"},{"alias_kind":"pith_short_12","alias_value":"EFWN7HWVFBT7","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EFWN7HWVFBT736FV","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EFWN7HWV","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:13d9cbf41ab8cc72b56a5c2bcff9fa55eab9521e80b85595ce35fc13b0bd647b","target":"graph","created_at":"2026-05-18T03:39:51Z","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 programming paradigm Map-Reduce and its main open-source implementation, Hadoop, have had an enormous impact on large scale data processing. Our goal in this expository writeup is two-fold: first, we want to present some complexity measures that allow us to talk about Map-Reduce algorithms formally, and second, we want to point out why this model is actually different from other models of parallel programming, most notably the PRAM (Parallel Random Access Memory) model. We are looking for complexity measures that are detailed enough to make fine-grained distinction between different algori","authors_text":"Ashish Goel, Kamesh Munagala","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-11-28T06:03:24Z","title":"Complexity Measures for Map-Reduce, and Comparison to Parallel Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6526","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:7d594bcd6eaf670f9876bb8a711cdc6196838722f511e8306dc77318fddf98b4","target":"record","created_at":"2026-05-18T03:39:51Z","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":"b88282166a9b34cf46f329b9f1e556d91e1ac958aae395e5032f058223bae090","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-11-28T06:03:24Z","title_canon_sha256":"8898f39d932d0f0b0872638a2e5fb3252d822f18e4264b741731e7d0c10bd790"},"schema_version":"1.0","source":{"id":"1211.6526","kind":"arxiv","version":1}},"canonical_sha256":"216cdf9ed52867fdf8b59151f3b4c5bb2d31336ecbc5ff1a95c9c05a5be72055","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"216cdf9ed52867fdf8b59151f3b4c5bb2d31336ecbc5ff1a95c9c05a5be72055","first_computed_at":"2026-05-18T03:39:51.280719Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:39:51.280719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M7oUha32m40jzH+viGWowDqInQKnNNr54MJFHnbGfW7Zx/deYP5EKPfpkv58ap1SssNeJI0HheQzpOdfoNPwDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:39:51.281187Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.6526","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d594bcd6eaf670f9876bb8a711cdc6196838722f511e8306dc77318fddf98b4","sha256:13d9cbf41ab8cc72b56a5c2bcff9fa55eab9521e80b85595ce35fc13b0bd647b"],"state_sha256":"1ee6710d96945775d63124e89cf4f0bae5c0466b9b803839dc3b1672de1826c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KCLoJalUG9rfpouDv+x15VKtDpZ+s93sEIk6StcNnlBZmBf87uwwon99lvQUydv76wg88MMr5S5uO+cCvLnuAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T13:10:10.833530Z","bundle_sha256":"1d22ad5a98381b1bc94d999f7b9663917c884afbec904a669ed14913b22fe8b4"}}