{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4BJPO63GBVOTY6GWUPOXO775IY","short_pith_number":"pith:4BJPO63G","schema_version":"1.0","canonical_sha256":"e052f77b660d5d3c78d6a3dd777ffd461fcc6faf0d578f2bd811a4b932567a7b","source":{"kind":"arxiv","id":"1602.01443","version":1},"attestation_state":"computed","paper":{"title":"Some Pairs Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Jeffrey D. Ullman, Jonathan Ullman","submitted_at":"2016-02-03T20:14:25Z","abstract_excerpt":"A common form of MapReduce application involves discovering relationships between certain pairs of inputs. Similarity joins serve as a good example of this type of problem, which we call a \"some-pairs\" problem. In the framework of Afrati et al. (VLDB 2013), algorithms are measured by the tradeoff between reducer size (maximum number of inputs a reducer can handle) and the replication rate (average number of reducers to which an input must be sent. There are two obvious approaches to solving some-pairs problems in general. We show that no general-purpose MapReduce algorithm can beat both of the"},"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":"1602.01443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-03T20:14:25Z","cross_cats_sorted":[],"title_canon_sha256":"76d3e446d9e06891bc884dc9b8a0c842f2e33c305f315eb26358d9c9be5b028f","abstract_canon_sha256":"7d655519ae6360efd891fc55d145bde4b9f9d2b85ff2ff20425deaaec399c00e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:20.220230Z","signature_b64":"lcnRkbot6T376yAP6Zmctifu2z5jEEtrRgMVmTKUigfiWu2tvD3GbH79J8trrS8hMQRBwaFk3gptUsLbxdITCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e052f77b660d5d3c78d6a3dd777ffd461fcc6faf0d578f2bd811a4b932567a7b","last_reissued_at":"2026-05-18T01:21:20.219494Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:20.219494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some Pairs Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Jeffrey D. Ullman, Jonathan Ullman","submitted_at":"2016-02-03T20:14:25Z","abstract_excerpt":"A common form of MapReduce application involves discovering relationships between certain pairs of inputs. Similarity joins serve as a good example of this type of problem, which we call a \"some-pairs\" problem. In the framework of Afrati et al. (VLDB 2013), algorithms are measured by the tradeoff between reducer size (maximum number of inputs a reducer can handle) and the replication rate (average number of reducers to which an input must be sent. There are two obvious approaches to solving some-pairs problems in general. We show that no general-purpose MapReduce algorithm can beat both of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01443","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":"1602.01443","created_at":"2026-05-18T01:21:20.219607+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.01443v1","created_at":"2026-05-18T01:21:20.219607+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01443","created_at":"2026-05-18T01:21:20.219607+00:00"},{"alias_kind":"pith_short_12","alias_value":"4BJPO63GBVOT","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4BJPO63GBVOTY6GW","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4BJPO63G","created_at":"2026-05-18T12:29:58.707656+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/4BJPO63GBVOTY6GWUPOXO775IY","json":"https://pith.science/pith/4BJPO63GBVOTY6GWUPOXO775IY.json","graph_json":"https://pith.science/api/pith-number/4BJPO63GBVOTY6GWUPOXO775IY/graph.json","events_json":"https://pith.science/api/pith-number/4BJPO63GBVOTY6GWUPOXO775IY/events.json","paper":"https://pith.science/paper/4BJPO63G"},"agent_actions":{"view_html":"https://pith.science/pith/4BJPO63GBVOTY6GWUPOXO775IY","download_json":"https://pith.science/pith/4BJPO63GBVOTY6GWUPOXO775IY.json","view_paper":"https://pith.science/paper/4BJPO63G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.01443&json=true","fetch_graph":"https://pith.science/api/pith-number/4BJPO63GBVOTY6GWUPOXO775IY/graph.json","fetch_events":"https://pith.science/api/pith-number/4BJPO63GBVOTY6GWUPOXO775IY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4BJPO63GBVOTY6GWUPOXO775IY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4BJPO63GBVOTY6GWUPOXO775IY/action/storage_attestation","attest_author":"https://pith.science/pith/4BJPO63GBVOTY6GWUPOXO775IY/action/author_attestation","sign_citation":"https://pith.science/pith/4BJPO63GBVOTY6GWUPOXO775IY/action/citation_signature","submit_replication":"https://pith.science/pith/4BJPO63GBVOTY6GWUPOXO775IY/action/replication_record"}},"created_at":"2026-05-18T01:21:20.219607+00:00","updated_at":"2026-05-18T01:21:20.219607+00:00"}