{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:O2OOWJEVPP3G2FWCKU5UDQH6UL","short_pith_number":"pith:O2OOWJEV","canonical_record":{"source":{"id":"1111.2228","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-09T15:13:40Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"15a8fe315b129073fcd8dff7a45091313ec953c1e4a52763910960ca58d019d2","abstract_canon_sha256":"00c0ad4c3efd16fff8c3d11796b1c4d68655a84b6d93b6629db8d6d61e33d09f"},"schema_version":"1.0"},"canonical_sha256":"769ceb24957bf66d16c2553b41c0fea2fc1264afad166d8a3a9429af32a2d75f","source":{"kind":"arxiv","id":"1111.2228","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.2228","created_at":"2026-05-18T03:21:10Z"},{"alias_kind":"arxiv_version","alias_value":"1111.2228v1","created_at":"2026-05-18T03:21:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.2228","created_at":"2026-05-18T03:21:10Z"},{"alias_kind":"pith_short_12","alias_value":"O2OOWJEVPP3G","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"O2OOWJEVPP3G2FWC","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"O2OOWJEV","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:O2OOWJEVPP3G2FWCKU5UDQH6UL","target":"record","payload":{"canonical_record":{"source":{"id":"1111.2228","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-09T15:13:40Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"15a8fe315b129073fcd8dff7a45091313ec953c1e4a52763910960ca58d019d2","abstract_canon_sha256":"00c0ad4c3efd16fff8c3d11796b1c4d68655a84b6d93b6629db8d6d61e33d09f"},"schema_version":"1.0"},"canonical_sha256":"769ceb24957bf66d16c2553b41c0fea2fc1264afad166d8a3a9429af32a2d75f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:10.736101Z","signature_b64":"h7omdcyjjBtTfQLGsHGA6RVIuBgrPholxr4Mh9o711T23G1D6L2x+W50fu5ElielMnbCqhPOv/i0T+nl8KhYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"769ceb24957bf66d16c2553b41c0fea2fc1264afad166d8a3a9429af32a2d75f","last_reissued_at":"2026-05-18T03:21:10.735299Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:10.735299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.2228","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:21:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oRMHey6H7QvvtiULXp1fNxef9Lv/x67dIfyX+MBQyftukOZcAKILvZApCWHPmofaGE8YIG4zm/68nJhJYco9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:26:10.289082Z"},"content_sha256":"380a3de274e67e652e3f4a8f63bc7734952c21cc7402dd3aafa9131499698f93","schema_version":"1.0","event_id":"sha256:380a3de274e67e652e3f4a8f63bc7734952c21cc7402dd3aafa9131499698f93"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:O2OOWJEVPP3G2FWCKU5UDQH6UL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Space-Round Tradeoffs for MapReduce Computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Andrea Pietracaprina, Eli Upfal, Francesco Silvestri, Geppino Pucci, Matteo Riondato","submitted_at":"2011-11-09T15:13:40Z","abstract_excerpt":"This work explores fundamental modeling and algorithmic issues arising in the well-established MapReduce framework. First, we formally specify a computational model for MapReduce which captures the functional flavor of the paradigm by allowing for a flexible use of parallelism. Indeed, the model diverges from a traditional processor-centric view by featuring parameters which embody only global and local memory constraints, thus favoring a more data-centric view. Second, we apply the model to the fundamental computation task of matrix multiplication presenting upper and lower bounds for both de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.2228","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:21:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HuUAPyo23B7SmY2xDKMj8f9ZwCTdHGO03RjEwA6beNN7qXsyU89le+NVj9Ou/vgq/goU9T67jkldSfLNs+TlCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:26:10.289455Z"},"content_sha256":"37c4dbac12a770bda0b40d86c9fb1b67df394b6dfa5ed1b1c4537686000a9dc3","schema_version":"1.0","event_id":"sha256:37c4dbac12a770bda0b40d86c9fb1b67df394b6dfa5ed1b1c4537686000a9dc3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O2OOWJEVPP3G2FWCKU5UDQH6UL/bundle.json","state_url":"https://pith.science/pith/O2OOWJEVPP3G2FWCKU5UDQH6UL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O2OOWJEVPP3G2FWCKU5UDQH6UL/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-04T03:26:10Z","links":{"resolver":"https://pith.science/pith/O2OOWJEVPP3G2FWCKU5UDQH6UL","bundle":"https://pith.science/pith/O2OOWJEVPP3G2FWCKU5UDQH6UL/bundle.json","state":"https://pith.science/pith/O2OOWJEVPP3G2FWCKU5UDQH6UL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O2OOWJEVPP3G2FWCKU5UDQH6UL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:O2OOWJEVPP3G2FWCKU5UDQH6UL","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":"00c0ad4c3efd16fff8c3d11796b1c4d68655a84b6d93b6629db8d6d61e33d09f","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-09T15:13:40Z","title_canon_sha256":"15a8fe315b129073fcd8dff7a45091313ec953c1e4a52763910960ca58d019d2"},"schema_version":"1.0","source":{"id":"1111.2228","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.2228","created_at":"2026-05-18T03:21:10Z"},{"alias_kind":"arxiv_version","alias_value":"1111.2228v1","created_at":"2026-05-18T03:21:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.2228","created_at":"2026-05-18T03:21:10Z"},{"alias_kind":"pith_short_12","alias_value":"O2OOWJEVPP3G","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"O2OOWJEVPP3G2FWC","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"O2OOWJEV","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:37c4dbac12a770bda0b40d86c9fb1b67df394b6dfa5ed1b1c4537686000a9dc3","target":"graph","created_at":"2026-05-18T03:21:10Z","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":"This work explores fundamental modeling and algorithmic issues arising in the well-established MapReduce framework. First, we formally specify a computational model for MapReduce which captures the functional flavor of the paradigm by allowing for a flexible use of parallelism. Indeed, the model diverges from a traditional processor-centric view by featuring parameters which embody only global and local memory constraints, thus favoring a more data-centric view. Second, we apply the model to the fundamental computation task of matrix multiplication presenting upper and lower bounds for both de","authors_text":"Andrea Pietracaprina, Eli Upfal, Francesco Silvestri, Geppino Pucci, Matteo Riondato","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-09T15:13:40Z","title":"Space-Round Tradeoffs for MapReduce Computations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.2228","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:380a3de274e67e652e3f4a8f63bc7734952c21cc7402dd3aafa9131499698f93","target":"record","created_at":"2026-05-18T03:21:10Z","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":"00c0ad4c3efd16fff8c3d11796b1c4d68655a84b6d93b6629db8d6d61e33d09f","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-09T15:13:40Z","title_canon_sha256":"15a8fe315b129073fcd8dff7a45091313ec953c1e4a52763910960ca58d019d2"},"schema_version":"1.0","source":{"id":"1111.2228","kind":"arxiv","version":1}},"canonical_sha256":"769ceb24957bf66d16c2553b41c0fea2fc1264afad166d8a3a9429af32a2d75f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"769ceb24957bf66d16c2553b41c0fea2fc1264afad166d8a3a9429af32a2d75f","first_computed_at":"2026-05-18T03:21:10.735299Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:10.735299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h7omdcyjjBtTfQLGsHGA6RVIuBgrPholxr4Mh9o711T23G1D6L2x+W50fu5ElielMnbCqhPOv/i0T+nl8KhYCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:10.736101Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.2228","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:380a3de274e67e652e3f4a8f63bc7734952c21cc7402dd3aafa9131499698f93","sha256:37c4dbac12a770bda0b40d86c9fb1b67df394b6dfa5ed1b1c4537686000a9dc3"],"state_sha256":"21f5e7e82880c705af1ef942748df274d611fed222ddb83138ccfc82d9c22f3b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BGNOb/Ba2sVccQj3viMaCUIMAdNcMGAOEv7xtbAjFFqSir1ca+gsq1DW8MzG1szgEcoaSSNj77G2BtRBPNIlCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T03:26:10.291975Z","bundle_sha256":"268d0e801c816bfbc30afa60f3ebf23e9463c989413056164310fec424cdd79d"}}