{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HWYCH2I726YDXQRTQP3LBJBBOR","short_pith_number":"pith:HWYCH2I7","schema_version":"1.0","canonical_sha256":"3db023e91fd7b03bc23383f6b0a42174704d8679cdccf5147d91ee1e2e5e96b5","source":{"kind":"arxiv","id":"1905.01748","version":1},"attestation_state":"computed","paper":{"title":"MapReduce Meets Fine-Grained Complexity: MapReduce Algorithms for APSP, Matrix Multiplication, 3-SUM, and Beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cliff Stein, MohammadTaghi Hajiaghayi, Saeed Seddighin, Silvio Lattanzi","submitted_at":"2019-05-05T21:14:38Z","abstract_excerpt":"Distributed processing frameworks, such as MapReduce, Hadoop, and Spark are popular systems for processing large amounts of data. The design of efficient algorithms in these frameworks is a challenging problem, as the systems both require parallelism---since datasets are so large that multiple machines are necessary---and limit the degree of parallelism---since the number of machines grows sublinearly in the size of the data. Although MapReduce is over a dozen years old~\\cite{dean2008mapreduce}, many fundamental problems, such as Matrix Multiplication, 3-SUM, and All Pairs Shortest Paths,\n  la"},"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":"1905.01748","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-05T21:14:38Z","cross_cats_sorted":[],"title_canon_sha256":"a3b1e8d593cb42f6183aa92ef8053a55008f101eca55a127ccf7a2168092d63c","abstract_canon_sha256":"ec46031f3dfc966d40bed7effa90611c82c8eacae8d419a90eb4ca9a59478404"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:57.553702Z","signature_b64":"AqoWATuNwVd30bUYzG2ZaogpIsoZsDo+GF1GbjMZbKMgJp2q7vk8bWzsL4dHprPArtg46QNvMPqQcamgOZpaCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3db023e91fd7b03bc23383f6b0a42174704d8679cdccf5147d91ee1e2e5e96b5","last_reissued_at":"2026-05-17T23:46:57.553102Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:57.553102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MapReduce Meets Fine-Grained Complexity: MapReduce Algorithms for APSP, Matrix Multiplication, 3-SUM, and Beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cliff Stein, MohammadTaghi Hajiaghayi, Saeed Seddighin, Silvio Lattanzi","submitted_at":"2019-05-05T21:14:38Z","abstract_excerpt":"Distributed processing frameworks, such as MapReduce, Hadoop, and Spark are popular systems for processing large amounts of data. The design of efficient algorithms in these frameworks is a challenging problem, as the systems both require parallelism---since datasets are so large that multiple machines are necessary---and limit the degree of parallelism---since the number of machines grows sublinearly in the size of the data. Although MapReduce is over a dozen years old~\\cite{dean2008mapreduce}, many fundamental problems, such as Matrix Multiplication, 3-SUM, and All Pairs Shortest Paths,\n  la"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01748","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":"1905.01748","created_at":"2026-05-17T23:46:57.553200+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.01748v1","created_at":"2026-05-17T23:46:57.553200+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01748","created_at":"2026-05-17T23:46:57.553200+00:00"},{"alias_kind":"pith_short_12","alias_value":"HWYCH2I726YD","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HWYCH2I726YDXQRT","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HWYCH2I7","created_at":"2026-05-18T12:33:18.533446+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/HWYCH2I726YDXQRTQP3LBJBBOR","json":"https://pith.science/pith/HWYCH2I726YDXQRTQP3LBJBBOR.json","graph_json":"https://pith.science/api/pith-number/HWYCH2I726YDXQRTQP3LBJBBOR/graph.json","events_json":"https://pith.science/api/pith-number/HWYCH2I726YDXQRTQP3LBJBBOR/events.json","paper":"https://pith.science/paper/HWYCH2I7"},"agent_actions":{"view_html":"https://pith.science/pith/HWYCH2I726YDXQRTQP3LBJBBOR","download_json":"https://pith.science/pith/HWYCH2I726YDXQRTQP3LBJBBOR.json","view_paper":"https://pith.science/paper/HWYCH2I7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.01748&json=true","fetch_graph":"https://pith.science/api/pith-number/HWYCH2I726YDXQRTQP3LBJBBOR/graph.json","fetch_events":"https://pith.science/api/pith-number/HWYCH2I726YDXQRTQP3LBJBBOR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HWYCH2I726YDXQRTQP3LBJBBOR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HWYCH2I726YDXQRTQP3LBJBBOR/action/storage_attestation","attest_author":"https://pith.science/pith/HWYCH2I726YDXQRTQP3LBJBBOR/action/author_attestation","sign_citation":"https://pith.science/pith/HWYCH2I726YDXQRTQP3LBJBBOR/action/citation_signature","submit_replication":"https://pith.science/pith/HWYCH2I726YDXQRTQP3LBJBBOR/action/replication_record"}},"created_at":"2026-05-17T23:46:57.553200+00:00","updated_at":"2026-05-17T23:46:57.553200+00:00"}