{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:M3EZTG6VMZ5OQQXHTAYKTD5JF6","short_pith_number":"pith:M3EZTG6V","canonical_record":{"source":{"id":"1101.1902","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-01-10T17:46:40Z","cross_cats_sorted":[],"title_canon_sha256":"9a84bf2a94d37b7dfa9871ed851e49a9dac6bcf3ef93af006244443fa2f11874","abstract_canon_sha256":"dce20018042c86c0d19409e7c8c3c619420f69c7f399d55a8d270681fb21c2ba"},"schema_version":"1.0"},"canonical_sha256":"66c9999bd5667ae842e79830a98fa92f9e12f834baf3d7f1ea745c6af8b82bfd","source":{"kind":"arxiv","id":"1101.1902","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.1902","created_at":"2026-05-18T04:31:51Z"},{"alias_kind":"arxiv_version","alias_value":"1101.1902v1","created_at":"2026-05-18T04:31:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.1902","created_at":"2026-05-18T04:31:51Z"},{"alias_kind":"pith_short_12","alias_value":"M3EZTG6VMZ5O","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"M3EZTG6VMZ5OQQXH","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"M3EZTG6V","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:M3EZTG6VMZ5OQQXHTAYKTD5JF6","target":"record","payload":{"canonical_record":{"source":{"id":"1101.1902","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-01-10T17:46:40Z","cross_cats_sorted":[],"title_canon_sha256":"9a84bf2a94d37b7dfa9871ed851e49a9dac6bcf3ef93af006244443fa2f11874","abstract_canon_sha256":"dce20018042c86c0d19409e7c8c3c619420f69c7f399d55a8d270681fb21c2ba"},"schema_version":"1.0"},"canonical_sha256":"66c9999bd5667ae842e79830a98fa92f9e12f834baf3d7f1ea745c6af8b82bfd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:51.613981Z","signature_b64":"PaMVAw1x6j1uAAwmWxzI1lpWDaZM5kOGXmrPRgCR0gl1fAM4RxA7iWZRe0p0legYEYJHuLpXxQGgk1LRWSlDAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66c9999bd5667ae842e79830a98fa92f9e12f834baf3d7f1ea745c6af8b82bfd","last_reissued_at":"2026-05-18T04:31:51.613418Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:51.613418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.1902","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:31:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ai2xQMC1i/ovl1f7VXBVXn7J9hKEiv3uLfpgZTl/dQWOjTkQN7ZOLjO1Gcn5Rw+ABw5xHCUsSlj8Ls1W1TxZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:27:41.658289Z"},"content_sha256":"239bd5b0f385e881fc9c8837b244fc3c0cd5cf25d8752d0d571dfc7f9de10d37","schema_version":"1.0","event_id":"sha256:239bd5b0f385e881fc9c8837b244fc3c0cd5cf25d8752d0d571dfc7f9de10d37"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:M3EZTG6VMZ5OQQXHTAYKTD5JF6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sorting, Searching, and Simulation in the MapReduce Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Michael T. Goodrich, Nodari Sitchinava, Qin Zhang","submitted_at":"2011-01-10T17:46:40Z","abstract_excerpt":"In this paper, we study the MapReduce framework from an algorithmic standpoint and demonstrate the usefulness of our approach by designing and analyzing efficient MapReduce algorithms for fundamental sorting, searching, and simulation problems. This study is motivated by a goal of ultimately putting the MapReduce framework on an equal theoretical footing with the well-known PRAM and BSP parallel models, which would benefit both the theory and practice of MapReduce algorithms. We describe efficient MapReduce algorithms for sorting, multi-searching, and simulations of parallel algorithms specifi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.1902","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:31:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UGVC4eU7XbZyE2pzyBz9P5CM89gs/QMNvcTVmMHiLxmjP+5GAnUTkgf0EHE8YqKLLkFawBic0rroEW0BUiuvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:27:41.659050Z"},"content_sha256":"5d9ca434af0db6bde26f2901ce6c7901f10e8bc239a864a4af1e12bbfd864744","schema_version":"1.0","event_id":"sha256:5d9ca434af0db6bde26f2901ce6c7901f10e8bc239a864a4af1e12bbfd864744"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M3EZTG6VMZ5OQQXHTAYKTD5JF6/bundle.json","state_url":"https://pith.science/pith/M3EZTG6VMZ5OQQXHTAYKTD5JF6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M3EZTG6VMZ5OQQXHTAYKTD5JF6/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-05-31T23:27:41Z","links":{"resolver":"https://pith.science/pith/M3EZTG6VMZ5OQQXHTAYKTD5JF6","bundle":"https://pith.science/pith/M3EZTG6VMZ5OQQXHTAYKTD5JF6/bundle.json","state":"https://pith.science/pith/M3EZTG6VMZ5OQQXHTAYKTD5JF6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M3EZTG6VMZ5OQQXHTAYKTD5JF6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:M3EZTG6VMZ5OQQXHTAYKTD5JF6","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":"dce20018042c86c0d19409e7c8c3c619420f69c7f399d55a8d270681fb21c2ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-01-10T17:46:40Z","title_canon_sha256":"9a84bf2a94d37b7dfa9871ed851e49a9dac6bcf3ef93af006244443fa2f11874"},"schema_version":"1.0","source":{"id":"1101.1902","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.1902","created_at":"2026-05-18T04:31:51Z"},{"alias_kind":"arxiv_version","alias_value":"1101.1902v1","created_at":"2026-05-18T04:31:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.1902","created_at":"2026-05-18T04:31:51Z"},{"alias_kind":"pith_short_12","alias_value":"M3EZTG6VMZ5O","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"M3EZTG6VMZ5OQQXH","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"M3EZTG6V","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:5d9ca434af0db6bde26f2901ce6c7901f10e8bc239a864a4af1e12bbfd864744","target":"graph","created_at":"2026-05-18T04:31: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":"In this paper, we study the MapReduce framework from an algorithmic standpoint and demonstrate the usefulness of our approach by designing and analyzing efficient MapReduce algorithms for fundamental sorting, searching, and simulation problems. This study is motivated by a goal of ultimately putting the MapReduce framework on an equal theoretical footing with the well-known PRAM and BSP parallel models, which would benefit both the theory and practice of MapReduce algorithms. We describe efficient MapReduce algorithms for sorting, multi-searching, and simulations of parallel algorithms specifi","authors_text":"Michael T. Goodrich, Nodari Sitchinava, Qin Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-01-10T17:46:40Z","title":"Sorting, Searching, and Simulation in the MapReduce Framework"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.1902","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:239bd5b0f385e881fc9c8837b244fc3c0cd5cf25d8752d0d571dfc7f9de10d37","target":"record","created_at":"2026-05-18T04:31: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":"dce20018042c86c0d19409e7c8c3c619420f69c7f399d55a8d270681fb21c2ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-01-10T17:46:40Z","title_canon_sha256":"9a84bf2a94d37b7dfa9871ed851e49a9dac6bcf3ef93af006244443fa2f11874"},"schema_version":"1.0","source":{"id":"1101.1902","kind":"arxiv","version":1}},"canonical_sha256":"66c9999bd5667ae842e79830a98fa92f9e12f834baf3d7f1ea745c6af8b82bfd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66c9999bd5667ae842e79830a98fa92f9e12f834baf3d7f1ea745c6af8b82bfd","first_computed_at":"2026-05-18T04:31:51.613418Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:31:51.613418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PaMVAw1x6j1uAAwmWxzI1lpWDaZM5kOGXmrPRgCR0gl1fAM4RxA7iWZRe0p0legYEYJHuLpXxQGgk1LRWSlDAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:31:51.613981Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.1902","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:239bd5b0f385e881fc9c8837b244fc3c0cd5cf25d8752d0d571dfc7f9de10d37","sha256:5d9ca434af0db6bde26f2901ce6c7901f10e8bc239a864a4af1e12bbfd864744"],"state_sha256":"3948f68a65f74a176e082fe550fe71978a98d4c34d7d54a6690cecc23acf15fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T6FXu8JwifLXVyppvzIWsxPd14NMAGIRRk7CDAQpnmKPjnFaptU53F7ulx3AYMegsd4XCSy/EKg80W36yg4/BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:27:41.663528Z","bundle_sha256":"1735e357779687ba57e4976a184062e5259a916f3afa7a556fba68b8eabd3149"}}