{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:O2OOWJEVPP3G2FWCKU5UDQH6UL","short_pith_number":"pith:O2OOWJEV","schema_version":"1.0","canonical_sha256":"769ceb24957bf66d16c2553b41c0fea2fc1264afad166d8a3a9429af32a2d75f","source":{"kind":"arxiv","id":"1111.2228","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1111.2228","created_at":"2026-05-18T03:21:10.735450+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.2228v1","created_at":"2026-05-18T03:21:10.735450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.2228","created_at":"2026-05-18T03:21:10.735450+00:00"},{"alias_kind":"pith_short_12","alias_value":"O2OOWJEVPP3G","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"O2OOWJEVPP3G2FWC","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"O2OOWJEV","created_at":"2026-05-18T12:26:37.096874+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O2OOWJEVPP3G2FWCKU5UDQH6UL","json":"https://pith.science/pith/O2OOWJEVPP3G2FWCKU5UDQH6UL.json","graph_json":"https://pith.science/api/pith-number/O2OOWJEVPP3G2FWCKU5UDQH6UL/graph.json","events_json":"https://pith.science/api/pith-number/O2OOWJEVPP3G2FWCKU5UDQH6UL/events.json","paper":"https://pith.science/paper/O2OOWJEV"},"agent_actions":{"view_html":"https://pith.science/pith/O2OOWJEVPP3G2FWCKU5UDQH6UL","download_json":"https://pith.science/pith/O2OOWJEVPP3G2FWCKU5UDQH6UL.json","view_paper":"https://pith.science/paper/O2OOWJEV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.2228&json=true","fetch_graph":"https://pith.science/api/pith-number/O2OOWJEVPP3G2FWCKU5UDQH6UL/graph.json","fetch_events":"https://pith.science/api/pith-number/O2OOWJEVPP3G2FWCKU5UDQH6UL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O2OOWJEVPP3G2FWCKU5UDQH6UL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O2OOWJEVPP3G2FWCKU5UDQH6UL/action/storage_attestation","attest_author":"https://pith.science/pith/O2OOWJEVPP3G2FWCKU5UDQH6UL/action/author_attestation","sign_citation":"https://pith.science/pith/O2OOWJEVPP3G2FWCKU5UDQH6UL/action/citation_signature","submit_replication":"https://pith.science/pith/O2OOWJEVPP3G2FWCKU5UDQH6UL/action/replication_record"}},"created_at":"2026-05-18T03:21:10.735450+00:00","updated_at":"2026-05-18T03:21:10.735450+00:00"}