{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FKBGFLIX7JLUYFMN4QKITP6QHA","short_pith_number":"pith:FKBGFLIX","canonical_record":{"source":{"id":"1410.0245","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-01T14:44:01Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"6f50c2f173e3d5b699982e4ecee7026e2a0bb81a4a1ea76e2ab3d18664f5746d","abstract_canon_sha256":"2ef8f4c610fa22cf7882b6a1330a886949d999b5b9274f9b2ae4d4ca7a942912"},"schema_version":"1.0"},"canonical_sha256":"2a8262ad17fa574c158de41489bfd0383c6983a8d228f76ecaf8e4b309740360","source":{"kind":"arxiv","id":"1410.0245","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0245","created_at":"2026-05-18T01:31:03Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0245v2","created_at":"2026-05-18T01:31:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0245","created_at":"2026-05-18T01:31:03Z"},{"alias_kind":"pith_short_12","alias_value":"FKBGFLIX7JLU","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FKBGFLIX7JLUYFMN","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FKBGFLIX","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FKBGFLIX7JLUYFMN4QKITP6QHA","target":"record","payload":{"canonical_record":{"source":{"id":"1410.0245","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-01T14:44:01Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"6f50c2f173e3d5b699982e4ecee7026e2a0bb81a4a1ea76e2ab3d18664f5746d","abstract_canon_sha256":"2ef8f4c610fa22cf7882b6a1330a886949d999b5b9274f9b2ae4d4ca7a942912"},"schema_version":"1.0"},"canonical_sha256":"2a8262ad17fa574c158de41489bfd0383c6983a8d228f76ecaf8e4b309740360","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:03.751547Z","signature_b64":"PVF8AUOio3B3IR3uP5IymBm4QN0pIIdYXWqOD5PhhP8PAuKDK2Og8JeO+Tky2o+XZk1N7LKLPJEWBO4DW5oECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a8262ad17fa574c158de41489bfd0383c6983a8d228f76ecaf8e4b309740360","last_reissued_at":"2026-05-18T01:31:03.750774Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:03.750774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.0245","source_version":2,"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-18T01:31:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sCk1oalohjfpwwlUHntQ33LzNH+F7Oux2RzK2om7l3Q4jqjP0jMOfBVO0DwjjaV9mi5oo/WeGTxb+GaqMdtCAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:49:15.764064Z"},"content_sha256":"91b388f5f31560417d98de885c109bba4a4dda1a7530d80fa17b70a8aa584b1b","schema_version":"1.0","event_id":"sha256:91b388f5f31560417d98de885c109bba4a4dda1a7530d80fa17b70a8aa584b1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FKBGFLIX7JLUYFMN4QKITP6QHA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Computational Complexity of MapReduce","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CC","authors_text":"\\'Ad\\'am D\\'aniel Lelkes, Benjamin Fish, Gy\\\"orgy Tur\\'an, Jeremy Kun, Lev Reyzin","submitted_at":"2014-10-01T14:44:01Z","abstract_excerpt":"In this paper we study MapReduce computations from a complexity-theoretic perspective. First, we formulate a uniform version of the MRC model of Karloff et al. (2010). We then show that the class of regular languages, and moreover all of sublogarithmic space, lies in constant round MRC. This result also applies to the MPC model of Andoni et al. (2014). In addition, we prove that, conditioned on a variant of the Exponential Time Hypothesis, there are strict hierarchies within MRC so that increasing the number of rounds or the amount of time per processor increases the power of MRC. To the best "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0245","kind":"arxiv","version":2},"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-18T01:31:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wSqKfXg1hVn39ZCj2QKW8Ub5uBt3/D7nfiS1rpa3u03/aqXxVQta5kNCFWdtWSxVZR88/OGmfi/nI2bKoklcDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:49:15.764427Z"},"content_sha256":"0b1021a7fd2c059cdeb5aee8d3973ab66c21fae9461e9067dfce310ad22a1960","schema_version":"1.0","event_id":"sha256:0b1021a7fd2c059cdeb5aee8d3973ab66c21fae9461e9067dfce310ad22a1960"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FKBGFLIX7JLUYFMN4QKITP6QHA/bundle.json","state_url":"https://pith.science/pith/FKBGFLIX7JLUYFMN4QKITP6QHA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FKBGFLIX7JLUYFMN4QKITP6QHA/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-02T07:49:15Z","links":{"resolver":"https://pith.science/pith/FKBGFLIX7JLUYFMN4QKITP6QHA","bundle":"https://pith.science/pith/FKBGFLIX7JLUYFMN4QKITP6QHA/bundle.json","state":"https://pith.science/pith/FKBGFLIX7JLUYFMN4QKITP6QHA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FKBGFLIX7JLUYFMN4QKITP6QHA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FKBGFLIX7JLUYFMN4QKITP6QHA","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":"2ef8f4c610fa22cf7882b6a1330a886949d999b5b9274f9b2ae4d4ca7a942912","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-01T14:44:01Z","title_canon_sha256":"6f50c2f173e3d5b699982e4ecee7026e2a0bb81a4a1ea76e2ab3d18664f5746d"},"schema_version":"1.0","source":{"id":"1410.0245","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0245","created_at":"2026-05-18T01:31:03Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0245v2","created_at":"2026-05-18T01:31:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0245","created_at":"2026-05-18T01:31:03Z"},{"alias_kind":"pith_short_12","alias_value":"FKBGFLIX7JLU","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FKBGFLIX7JLUYFMN","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FKBGFLIX","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:0b1021a7fd2c059cdeb5aee8d3973ab66c21fae9461e9067dfce310ad22a1960","target":"graph","created_at":"2026-05-18T01:31:03Z","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 MapReduce computations from a complexity-theoretic perspective. First, we formulate a uniform version of the MRC model of Karloff et al. (2010). We then show that the class of regular languages, and moreover all of sublogarithmic space, lies in constant round MRC. This result also applies to the MPC model of Andoni et al. (2014). In addition, we prove that, conditioned on a variant of the Exponential Time Hypothesis, there are strict hierarchies within MRC so that increasing the number of rounds or the amount of time per processor increases the power of MRC. To the best ","authors_text":"\\'Ad\\'am D\\'aniel Lelkes, Benjamin Fish, Gy\\\"orgy Tur\\'an, Jeremy Kun, Lev Reyzin","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-01T14:44:01Z","title":"On the Computational Complexity of MapReduce"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0245","kind":"arxiv","version":2},"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:91b388f5f31560417d98de885c109bba4a4dda1a7530d80fa17b70a8aa584b1b","target":"record","created_at":"2026-05-18T01:31:03Z","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":"2ef8f4c610fa22cf7882b6a1330a886949d999b5b9274f9b2ae4d4ca7a942912","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-01T14:44:01Z","title_canon_sha256":"6f50c2f173e3d5b699982e4ecee7026e2a0bb81a4a1ea76e2ab3d18664f5746d"},"schema_version":"1.0","source":{"id":"1410.0245","kind":"arxiv","version":2}},"canonical_sha256":"2a8262ad17fa574c158de41489bfd0383c6983a8d228f76ecaf8e4b309740360","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a8262ad17fa574c158de41489bfd0383c6983a8d228f76ecaf8e4b309740360","first_computed_at":"2026-05-18T01:31:03.750774Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:03.750774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PVF8AUOio3B3IR3uP5IymBm4QN0pIIdYXWqOD5PhhP8PAuKDK2Og8JeO+Tky2o+XZk1N7LKLPJEWBO4DW5oECg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:03.751547Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.0245","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91b388f5f31560417d98de885c109bba4a4dda1a7530d80fa17b70a8aa584b1b","sha256:0b1021a7fd2c059cdeb5aee8d3973ab66c21fae9461e9067dfce310ad22a1960"],"state_sha256":"f468e4d6d84570e357320df5d8069d90a5368af656be9f9ae361761e565df771"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jlEXcTv3EASIbSg2Lzpwpo+4h6MrRRgm828VttsgGpu20/0gerlpCEpF2ReAE2C1KFlchQv75ZEwHUUtWeFqAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:49:15.766342Z","bundle_sha256":"28dd8e51768f3f41cf3aafe05f46ac7180411d7dd8bf8dcd9975e4072470356d"}}