{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HWYCH2I726YDXQRTQP3LBJBBOR","short_pith_number":"pith:HWYCH2I7","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"},"canonical_sha256":"3db023e91fd7b03bc23383f6b0a42174704d8679cdccf5147d91ee1e2e5e96b5","source":{"kind":"arxiv","id":"1905.01748","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.01748","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"arxiv_version","alias_value":"1905.01748v1","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01748","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"pith_short_12","alias_value":"HWYCH2I726YD","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HWYCH2I726YDXQRT","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HWYCH2I7","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HWYCH2I726YDXQRTQP3LBJBBOR","target":"record","payload":{"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"},"canonical_sha256":"3db023e91fd7b03bc23383f6b0a42174704d8679cdccf5147d91ee1e2e5e96b5","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"},"source_kind":"arxiv","source_id":"1905.01748","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-17T23:46:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lcdsL//tD6Nd7s0JDZ6DnSTXELw9r7JMNmbL+nptLyzfMQf1I1gu2h6RDl9U6e7MmVJPWvS6EvhTlwHznalECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:23:17.462428Z"},"content_sha256":"cf20626c304ad22ad333170561e965aef25901030a36fa08b12258c4cf71db47","schema_version":"1.0","event_id":"sha256:cf20626c304ad22ad333170561e965aef25901030a36fa08b12258c4cf71db47"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HWYCH2I726YDXQRTQP3LBJBBOR","target":"graph","payload":{"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"},"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-17T23:46:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"igXYNgyrZy0yf2ON+FUAu+wUcjQQJ4tO6w4L5XXOBjmKRVBGFhb8ddG7yg272C02SslXuPHIlT8mLITb5QtoAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:23:17.462782Z"},"content_sha256":"ea3a4aefb3daf446047b37d14d3fddfa2397d91a7bf28bdaeacd08afeddb20e5","schema_version":"1.0","event_id":"sha256:ea3a4aefb3daf446047b37d14d3fddfa2397d91a7bf28bdaeacd08afeddb20e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HWYCH2I726YDXQRTQP3LBJBBOR/bundle.json","state_url":"https://pith.science/pith/HWYCH2I726YDXQRTQP3LBJBBOR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HWYCH2I726YDXQRTQP3LBJBBOR/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-11T10:23:17Z","links":{"resolver":"https://pith.science/pith/HWYCH2I726YDXQRTQP3LBJBBOR","bundle":"https://pith.science/pith/HWYCH2I726YDXQRTQP3LBJBBOR/bundle.json","state":"https://pith.science/pith/HWYCH2I726YDXQRTQP3LBJBBOR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HWYCH2I726YDXQRTQP3LBJBBOR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HWYCH2I726YDXQRTQP3LBJBBOR","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":"ec46031f3dfc966d40bed7effa90611c82c8eacae8d419a90eb4ca9a59478404","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-05T21:14:38Z","title_canon_sha256":"a3b1e8d593cb42f6183aa92ef8053a55008f101eca55a127ccf7a2168092d63c"},"schema_version":"1.0","source":{"id":"1905.01748","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.01748","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"arxiv_version","alias_value":"1905.01748v1","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01748","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"pith_short_12","alias_value":"HWYCH2I726YD","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HWYCH2I726YDXQRT","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HWYCH2I7","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:ea3a4aefb3daf446047b37d14d3fddfa2397d91a7bf28bdaeacd08afeddb20e5","target":"graph","created_at":"2026-05-17T23:46:57Z","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":"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","authors_text":"Cliff Stein, MohammadTaghi Hajiaghayi, Saeed Seddighin, Silvio Lattanzi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-05T21:14:38Z","title":"MapReduce Meets Fine-Grained Complexity: MapReduce Algorithms for APSP, Matrix Multiplication, 3-SUM, and Beyond"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01748","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:cf20626c304ad22ad333170561e965aef25901030a36fa08b12258c4cf71db47","target":"record","created_at":"2026-05-17T23:46:57Z","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":"ec46031f3dfc966d40bed7effa90611c82c8eacae8d419a90eb4ca9a59478404","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-05T21:14:38Z","title_canon_sha256":"a3b1e8d593cb42f6183aa92ef8053a55008f101eca55a127ccf7a2168092d63c"},"schema_version":"1.0","source":{"id":"1905.01748","kind":"arxiv","version":1}},"canonical_sha256":"3db023e91fd7b03bc23383f6b0a42174704d8679cdccf5147d91ee1e2e5e96b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3db023e91fd7b03bc23383f6b0a42174704d8679cdccf5147d91ee1e2e5e96b5","first_computed_at":"2026-05-17T23:46:57.553102Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:57.553102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AqoWATuNwVd30bUYzG2ZaogpIsoZsDo+GF1GbjMZbKMgJp2q7vk8bWzsL4dHprPArtg46QNvMPqQcamgOZpaCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:57.553702Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.01748","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf20626c304ad22ad333170561e965aef25901030a36fa08b12258c4cf71db47","sha256:ea3a4aefb3daf446047b37d14d3fddfa2397d91a7bf28bdaeacd08afeddb20e5"],"state_sha256":"af16b271eb02c3a42c6220346662a30313136702bd89a1553378f3eeac304f4f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KGYhP+qy5LMqambED1j1SDNI3L1/HIUmh1JEq/Oy/u0m03qTENz79UIjJ+deO0A4NuLdBdI1f2tZR4C79m3zCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T10:23:17.464707Z","bundle_sha256":"6f030b9113af291efe5ded0631ce4211b599e5e5291637bfe095ba5865791f44"}}