{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PY2OZCOCSTKNFADC7G5INP6EPR","short_pith_number":"pith:PY2OZCOC","canonical_record":{"source":{"id":"1410.4156","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-10-15T18:25:22Z","cross_cats_sorted":[],"title_canon_sha256":"98fc8e0a531f2334879c55b99a4a300498d0b705e20bf9df32dc1e7bbdcefa85","abstract_canon_sha256":"9ac04d31903115b3962bd8417003e785ddb0eb9f825c5f7391a5cb292398ec29"},"schema_version":"1.0"},"canonical_sha256":"7e34ec89c294d4d28062f9ba86bfc47c6d7c0b747ce9da77098ec65b963105b9","source":{"kind":"arxiv","id":"1410.4156","version":8},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4156","created_at":"2026-05-18T00:52:04Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4156v8","created_at":"2026-05-18T00:52:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4156","created_at":"2026-05-18T00:52:04Z"},{"alias_kind":"pith_short_12","alias_value":"PY2OZCOCSTKN","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PY2OZCOCSTKNFADC","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PY2OZCOC","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PY2OZCOCSTKNFADC7G5INP6EPR","target":"record","payload":{"canonical_record":{"source":{"id":"1410.4156","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-10-15T18:25:22Z","cross_cats_sorted":[],"title_canon_sha256":"98fc8e0a531f2334879c55b99a4a300498d0b705e20bf9df32dc1e7bbdcefa85","abstract_canon_sha256":"9ac04d31903115b3962bd8417003e785ddb0eb9f825c5f7391a5cb292398ec29"},"schema_version":"1.0"},"canonical_sha256":"7e34ec89c294d4d28062f9ba86bfc47c6d7c0b747ce9da77098ec65b963105b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:04.400655Z","signature_b64":"oqektuNAiXDWmBvm2h9kdnBrgeq3HKt6QD8oeP3SfwQBdSONevN/GSc3GYES3s07x/GhmcbX2u7o/5gn3qVjAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e34ec89c294d4d28062f9ba86bfc47c6d7c0b747ce9da77098ec65b963105b9","last_reissued_at":"2026-05-18T00:52:04.400170Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:04.400170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.4156","source_version":8,"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-18T00:52:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YCncMZv+REArfuwHcf0r/syV8Ti6U0BbyGEAjWGudjM0jxiGMa6qCyMcM/9G/aA0UbqU5WjAdvwvu1j8HNM8CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T16:34:24.460895Z"},"content_sha256":"cd959a2bd4d8f9be8b6d5dd723100e7fd84fe933c5bc1bde3ff6613ab57d52b9","schema_version":"1.0","event_id":"sha256:cd959a2bd4d8f9be8b6d5dd723100e7fd84fe933c5bc1bde3ff6613ab57d52b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PY2OZCOCSTKNFADC7G5INP6EPR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GYM: A Multiround Join Algorithm In MapReduce","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Christopher R\\'e, Foto Afrati, Jeffrey D. Ullman, Manas Joglekar, Semih Salihoglu","submitted_at":"2014-10-15T18:25:22Z","abstract_excerpt":"Multiround algorithms are now commonly used in distributed data processing systems, yet the extent to which algorithms can benefit from running more rounds is not well understood. This paper answers this question for a spectrum of rounds for the problem of computing the equijoin of $n$ relations. Specifically, given any query $Q$ with width $\\w$, {\\em intersection width} $\\iw$, input size $\\mathrm{IN}$, output size $\\mathrm{OUT}$, and a cluster of machines with $M$ memory available per machine, we show that:\n  (1) $Q$ can be computed in $O(n)$ rounds with $O(n\\frac{(\\mathrm{IN}^{\\w} + \\mathrm{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4156","kind":"arxiv","version":8},"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-18T00:52:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZlEEn4mNa0MidsvVeykwd/5zJTVw4Tk01x/nQ0uXaVoGXiuqucMMS8Q8r61t6CQva7V6n3Z40p1T5kiBFbC/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T16:34:24.461376Z"},"content_sha256":"d1bd5635934e56b1780116f4d9b31286a6a95fc0a3687dbcbbbbf8aed3d87032","schema_version":"1.0","event_id":"sha256:d1bd5635934e56b1780116f4d9b31286a6a95fc0a3687dbcbbbbf8aed3d87032"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PY2OZCOCSTKNFADC7G5INP6EPR/bundle.json","state_url":"https://pith.science/pith/PY2OZCOCSTKNFADC7G5INP6EPR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PY2OZCOCSTKNFADC7G5INP6EPR/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-22T16:34:24Z","links":{"resolver":"https://pith.science/pith/PY2OZCOCSTKNFADC7G5INP6EPR","bundle":"https://pith.science/pith/PY2OZCOCSTKNFADC7G5INP6EPR/bundle.json","state":"https://pith.science/pith/PY2OZCOCSTKNFADC7G5INP6EPR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PY2OZCOCSTKNFADC7G5INP6EPR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PY2OZCOCSTKNFADC7G5INP6EPR","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":"9ac04d31903115b3962bd8417003e785ddb0eb9f825c5f7391a5cb292398ec29","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-10-15T18:25:22Z","title_canon_sha256":"98fc8e0a531f2334879c55b99a4a300498d0b705e20bf9df32dc1e7bbdcefa85"},"schema_version":"1.0","source":{"id":"1410.4156","kind":"arxiv","version":8}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4156","created_at":"2026-05-18T00:52:04Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4156v8","created_at":"2026-05-18T00:52:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4156","created_at":"2026-05-18T00:52:04Z"},{"alias_kind":"pith_short_12","alias_value":"PY2OZCOCSTKN","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PY2OZCOCSTKNFADC","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PY2OZCOC","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:d1bd5635934e56b1780116f4d9b31286a6a95fc0a3687dbcbbbbf8aed3d87032","target":"graph","created_at":"2026-05-18T00:52:04Z","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":"Multiround algorithms are now commonly used in distributed data processing systems, yet the extent to which algorithms can benefit from running more rounds is not well understood. This paper answers this question for a spectrum of rounds for the problem of computing the equijoin of $n$ relations. Specifically, given any query $Q$ with width $\\w$, {\\em intersection width} $\\iw$, input size $\\mathrm{IN}$, output size $\\mathrm{OUT}$, and a cluster of machines with $M$ memory available per machine, we show that:\n  (1) $Q$ can be computed in $O(n)$ rounds with $O(n\\frac{(\\mathrm{IN}^{\\w} + \\mathrm{","authors_text":"Christopher R\\'e, Foto Afrati, Jeffrey D. Ullman, Manas Joglekar, Semih Salihoglu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-10-15T18:25:22Z","title":"GYM: A Multiround Join Algorithm In MapReduce"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4156","kind":"arxiv","version":8},"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:cd959a2bd4d8f9be8b6d5dd723100e7fd84fe933c5bc1bde3ff6613ab57d52b9","target":"record","created_at":"2026-05-18T00:52:04Z","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":"9ac04d31903115b3962bd8417003e785ddb0eb9f825c5f7391a5cb292398ec29","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-10-15T18:25:22Z","title_canon_sha256":"98fc8e0a531f2334879c55b99a4a300498d0b705e20bf9df32dc1e7bbdcefa85"},"schema_version":"1.0","source":{"id":"1410.4156","kind":"arxiv","version":8}},"canonical_sha256":"7e34ec89c294d4d28062f9ba86bfc47c6d7c0b747ce9da77098ec65b963105b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e34ec89c294d4d28062f9ba86bfc47c6d7c0b747ce9da77098ec65b963105b9","first_computed_at":"2026-05-18T00:52:04.400170Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:04.400170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oqektuNAiXDWmBvm2h9kdnBrgeq3HKt6QD8oeP3SfwQBdSONevN/GSc3GYES3s07x/GhmcbX2u7o/5gn3qVjAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:04.400655Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.4156","source_kind":"arxiv","source_version":8}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd959a2bd4d8f9be8b6d5dd723100e7fd84fe933c5bc1bde3ff6613ab57d52b9","sha256:d1bd5635934e56b1780116f4d9b31286a6a95fc0a3687dbcbbbbf8aed3d87032"],"state_sha256":"4d59fe5133e3afa24a1ffa44b877713c51350763663db2d26b39ee91e63237a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GNfPvrYbO/o3WEu6y/2hy0oedOS3ndcZGzCt3xKwtd6aLGdKKN+t+0gD7QqKiEh8rdeC0O8pM0RMi+diHxJlBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T16:34:24.463912Z","bundle_sha256":"940ef2899adacf5f146fcdc57c80bc409b91c9ac9fb49e6936640ce746baf79f"}}