{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:N2DW5YFCSOHTXDALVMQKVX7Y3X","short_pith_number":"pith:N2DW5YFC","canonical_record":{"source":{"id":"2011.14482","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2020-11-30T00:48:35Z","cross_cats_sorted":[],"title_canon_sha256":"0e508c049d5f7975961b44a27ea74a3cc2b0d97f4fb50f746ba77c9e99a652c4","abstract_canon_sha256":"d6262f9136fb426ee80ec2d39e348d5d733ce45560a38b3c9379f58ea0a86479"},"schema_version":"1.0"},"canonical_sha256":"6e876ee0a2938f3b8c0bab20aadff8ddf636dd411bbf3a2a7fb266e4023185a4","source":{"kind":"arxiv","id":"2011.14482","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.14482","created_at":"2026-07-05T06:23:31Z"},{"alias_kind":"arxiv_version","alias_value":"2011.14482v4","created_at":"2026-07-05T06:23:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.14482","created_at":"2026-07-05T06:23:31Z"},{"alias_kind":"pith_short_12","alias_value":"N2DW5YFCSOHT","created_at":"2026-07-05T06:23:31Z"},{"alias_kind":"pith_short_16","alias_value":"N2DW5YFCSOHTXDAL","created_at":"2026-07-05T06:23:31Z"},{"alias_kind":"pith_short_8","alias_value":"N2DW5YFC","created_at":"2026-07-05T06:23:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:N2DW5YFCSOHTXDALVMQKVX7Y3X","target":"record","payload":{"canonical_record":{"source":{"id":"2011.14482","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2020-11-30T00:48:35Z","cross_cats_sorted":[],"title_canon_sha256":"0e508c049d5f7975961b44a27ea74a3cc2b0d97f4fb50f746ba77c9e99a652c4","abstract_canon_sha256":"d6262f9136fb426ee80ec2d39e348d5d733ce45560a38b3c9379f58ea0a86479"},"schema_version":"1.0"},"canonical_sha256":"6e876ee0a2938f3b8c0bab20aadff8ddf636dd411bbf3a2a7fb266e4023185a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:23:31.491303Z","signature_b64":"OWHoFxZIG+msrxLPEfVrWhnH8eSNnqNxpHCEePO+2FK8971KtE1WzgrDkPHDu6aVUCiuvfvhf12Neyg5wrY9BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e876ee0a2938f3b8c0bab20aadff8ddf636dd411bbf3a2a7fb266e4023185a4","last_reissued_at":"2026-07-05T06:23:31.490904Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:23:31.490904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.14482","source_version":4,"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-07-05T06:23:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R/m3m1WRRqFDT7AA3VIC4aRXhbgtKZD9mOlXAfO8IBT0UYv6XTsssbJiV/fwpe+182vsqEJ1GjrpGSh81+irAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T08:10:19.730328Z"},"content_sha256":"3240c1aeed547ebafb97974acf599c58685eeeca634228cde7a01c8d76ce1830","schema_version":"1.0","event_id":"sha256:3240c1aeed547ebafb97974acf599c58685eeeca634228cde7a01c8d76ce1830"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:N2DW5YFCSOHTXDALVMQKVX7Y3X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Near-Optimal Parallel Algorithm for Joining Binary Relations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Bas Ketsman, Dan Suciu, Yufei Tao","submitted_at":"2020-11-30T00:48:35Z","abstract_excerpt":"We present a constant-round algorithm in the massively parallel computation (MPC) model for evaluating a natural join where every input relation has two attributes. Our algorithm achieves a load of $\\tilde{O}(m/p^{1/\\rho})$ where $m$ is the total size of the input relations, $p$ is the number of machines, $\\rho$ is the join's fractional edge covering number, and $\\tilde{O}(.)$ hides a polylogarithmic factor. The load matches a known lower bound up to a polylogarithmic factor. At the core of the proposed algorithm is a new theorem (which we name the \"isolated cartesian product theorem\") that pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.14482","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.14482/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T06:23:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MK5fEOKIVQez38qMF5GNZlJ6bI+np+tPfBbUb3+dI+vi8JaOvi48Atvna3LT6Ns81NQQ9a/JbEtI49PgSN8RDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T08:10:19.731252Z"},"content_sha256":"dfbf8b09988fbfba7328cc410f43d9e6d28c9e6e817afbb579f407ab008a07f6","schema_version":"1.0","event_id":"sha256:dfbf8b09988fbfba7328cc410f43d9e6d28c9e6e817afbb579f407ab008a07f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N2DW5YFCSOHTXDALVMQKVX7Y3X/bundle.json","state_url":"https://pith.science/pith/N2DW5YFCSOHTXDALVMQKVX7Y3X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N2DW5YFCSOHTXDALVMQKVX7Y3X/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-08-05T08:10:19Z","links":{"resolver":"https://pith.science/pith/N2DW5YFCSOHTXDALVMQKVX7Y3X","bundle":"https://pith.science/pith/N2DW5YFCSOHTXDALVMQKVX7Y3X/bundle.json","state":"https://pith.science/pith/N2DW5YFCSOHTXDALVMQKVX7Y3X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N2DW5YFCSOHTXDALVMQKVX7Y3X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:N2DW5YFCSOHTXDALVMQKVX7Y3X","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":"d6262f9136fb426ee80ec2d39e348d5d733ce45560a38b3c9379f58ea0a86479","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2020-11-30T00:48:35Z","title_canon_sha256":"0e508c049d5f7975961b44a27ea74a3cc2b0d97f4fb50f746ba77c9e99a652c4"},"schema_version":"1.0","source":{"id":"2011.14482","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.14482","created_at":"2026-07-05T06:23:31Z"},{"alias_kind":"arxiv_version","alias_value":"2011.14482v4","created_at":"2026-07-05T06:23:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.14482","created_at":"2026-07-05T06:23:31Z"},{"alias_kind":"pith_short_12","alias_value":"N2DW5YFCSOHT","created_at":"2026-07-05T06:23:31Z"},{"alias_kind":"pith_short_16","alias_value":"N2DW5YFCSOHTXDAL","created_at":"2026-07-05T06:23:31Z"},{"alias_kind":"pith_short_8","alias_value":"N2DW5YFC","created_at":"2026-07-05T06:23:31Z"}],"graph_snapshots":[{"event_id":"sha256:dfbf8b09988fbfba7328cc410f43d9e6d28c9e6e817afbb579f407ab008a07f6","target":"graph","created_at":"2026-07-05T06:23:31Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2011.14482/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a constant-round algorithm in the massively parallel computation (MPC) model for evaluating a natural join where every input relation has two attributes. Our algorithm achieves a load of $\\tilde{O}(m/p^{1/\\rho})$ where $m$ is the total size of the input relations, $p$ is the number of machines, $\\rho$ is the join's fractional edge covering number, and $\\tilde{O}(.)$ hides a polylogarithmic factor. The load matches a known lower bound up to a polylogarithmic factor. At the core of the proposed algorithm is a new theorem (which we name the \"isolated cartesian product theorem\") that pr","authors_text":"Bas Ketsman, Dan Suciu, Yufei Tao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2020-11-30T00:48:35Z","title":"A Near-Optimal Parallel Algorithm for Joining Binary Relations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.14482","kind":"arxiv","version":4},"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:3240c1aeed547ebafb97974acf599c58685eeeca634228cde7a01c8d76ce1830","target":"record","created_at":"2026-07-05T06:23:31Z","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":"d6262f9136fb426ee80ec2d39e348d5d733ce45560a38b3c9379f58ea0a86479","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2020-11-30T00:48:35Z","title_canon_sha256":"0e508c049d5f7975961b44a27ea74a3cc2b0d97f4fb50f746ba77c9e99a652c4"},"schema_version":"1.0","source":{"id":"2011.14482","kind":"arxiv","version":4}},"canonical_sha256":"6e876ee0a2938f3b8c0bab20aadff8ddf636dd411bbf3a2a7fb266e4023185a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e876ee0a2938f3b8c0bab20aadff8ddf636dd411bbf3a2a7fb266e4023185a4","first_computed_at":"2026-07-05T06:23:31.490904Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:23:31.490904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OWHoFxZIG+msrxLPEfVrWhnH8eSNnqNxpHCEePO+2FK8971KtE1WzgrDkPHDu6aVUCiuvfvhf12Neyg5wrY9BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:23:31.491303Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.14482","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3240c1aeed547ebafb97974acf599c58685eeeca634228cde7a01c8d76ce1830","sha256:dfbf8b09988fbfba7328cc410f43d9e6d28c9e6e817afbb579f407ab008a07f6"],"state_sha256":"d3c48f630a699f3d2ec5ba67271378fded74339f70cf79ecd5cdac01253f2007"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WC6khb7wAYC02U6hT/T6znsPLFJma8ERLIBEfMlL/6FFzqujRPK8g1v/lDLtzSQSC0qoCrmsLAFUC/Pm6pcCCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T08:10:19.736345Z","bundle_sha256":"a395ef4110709908fc211bff7f09400cac54c5a5285f1c9d38ba2ba131ef821a"}}