{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:N2DW5YFCSOHTXDALVMQKVX7Y3X","short_pith_number":"pith:N2DW5YFC","schema_version":"1.0","canonical_sha256":"6e876ee0a2938f3b8c0bab20aadff8ddf636dd411bbf3a2a7fb266e4023185a4","source":{"kind":"arxiv","id":"2011.14482","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2011.14482","created_at":"2026-07-05T06:23:31.490969+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.14482v4","created_at":"2026-07-05T06:23:31.490969+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.14482","created_at":"2026-07-05T06:23:31.490969+00:00"},{"alias_kind":"pith_short_12","alias_value":"N2DW5YFCSOHT","created_at":"2026-07-05T06:23:31.490969+00:00"},{"alias_kind":"pith_short_16","alias_value":"N2DW5YFCSOHTXDAL","created_at":"2026-07-05T06:23:31.490969+00:00"},{"alias_kind":"pith_short_8","alias_value":"N2DW5YFC","created_at":"2026-07-05T06:23:31.490969+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/N2DW5YFCSOHTXDALVMQKVX7Y3X","json":"https://pith.science/pith/N2DW5YFCSOHTXDALVMQKVX7Y3X.json","graph_json":"https://pith.science/api/pith-number/N2DW5YFCSOHTXDALVMQKVX7Y3X/graph.json","events_json":"https://pith.science/api/pith-number/N2DW5YFCSOHTXDALVMQKVX7Y3X/events.json","paper":"https://pith.science/paper/N2DW5YFC"},"agent_actions":{"view_html":"https://pith.science/pith/N2DW5YFCSOHTXDALVMQKVX7Y3X","download_json":"https://pith.science/pith/N2DW5YFCSOHTXDALVMQKVX7Y3X.json","view_paper":"https://pith.science/paper/N2DW5YFC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.14482&json=true","fetch_graph":"https://pith.science/api/pith-number/N2DW5YFCSOHTXDALVMQKVX7Y3X/graph.json","fetch_events":"https://pith.science/api/pith-number/N2DW5YFCSOHTXDALVMQKVX7Y3X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N2DW5YFCSOHTXDALVMQKVX7Y3X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N2DW5YFCSOHTXDALVMQKVX7Y3X/action/storage_attestation","attest_author":"https://pith.science/pith/N2DW5YFCSOHTXDALVMQKVX7Y3X/action/author_attestation","sign_citation":"https://pith.science/pith/N2DW5YFCSOHTXDALVMQKVX7Y3X/action/citation_signature","submit_replication":"https://pith.science/pith/N2DW5YFCSOHTXDALVMQKVX7Y3X/action/replication_record"}},"created_at":"2026-07-05T06:23:31.490969+00:00","updated_at":"2026-07-05T06:23:31.490969+00:00"}