{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4BJPO63GBVOTY6GWUPOXO775IY","short_pith_number":"pith:4BJPO63G","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"},"canonical_sha256":"e052f77b660d5d3c78d6a3dd777ffd461fcc6faf0d578f2bd811a4b932567a7b","source":{"kind":"arxiv","id":"1602.01443","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01443","created_at":"2026-05-18T01:21:20Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01443v1","created_at":"2026-05-18T01:21:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01443","created_at":"2026-05-18T01:21:20Z"},{"alias_kind":"pith_short_12","alias_value":"4BJPO63GBVOT","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4BJPO63GBVOTY6GW","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4BJPO63G","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4BJPO63GBVOTY6GWUPOXO775IY","target":"record","payload":{"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"},"canonical_sha256":"e052f77b660d5d3c78d6a3dd777ffd461fcc6faf0d578f2bd811a4b932567a7b","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"},"source_kind":"arxiv","source_id":"1602.01443","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-18T01:21:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VH3uNpkczENRfgJNPaZuVMYhaxnCpqBeJdyYdSIKyDn99wpwWLftcr1jdQnh/gRbDkuMBfQbnjHPAP2XU6vHCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T05:38:54.903837Z"},"content_sha256":"d3c2822e91139fc7ace5be43d7ac82988ceb0dfdaa5171885720713ab30499a8","schema_version":"1.0","event_id":"sha256:d3c2822e91139fc7ace5be43d7ac82988ceb0dfdaa5171885720713ab30499a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4BJPO63GBVOTY6GWUPOXO775IY","target":"graph","payload":{"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"},"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-18T01:21:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nfH9IeKQlE5lFVu9G/SQMTmtjBBO8JpujCfdhDOmEFJPIwkka+Ors8sjvZp4xlKoaFwdFKBBr+YQLNu7AsClBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T05:38:54.904200Z"},"content_sha256":"ba379bb50ddd7bb0a796fa842406a7bdf2de29d895569ed73d747e2a8e6dba57","schema_version":"1.0","event_id":"sha256:ba379bb50ddd7bb0a796fa842406a7bdf2de29d895569ed73d747e2a8e6dba57"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4BJPO63GBVOTY6GWUPOXO775IY/bundle.json","state_url":"https://pith.science/pith/4BJPO63GBVOTY6GWUPOXO775IY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4BJPO63GBVOTY6GWUPOXO775IY/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-23T05:38:54Z","links":{"resolver":"https://pith.science/pith/4BJPO63GBVOTY6GWUPOXO775IY","bundle":"https://pith.science/pith/4BJPO63GBVOTY6GWUPOXO775IY/bundle.json","state":"https://pith.science/pith/4BJPO63GBVOTY6GWUPOXO775IY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4BJPO63GBVOTY6GWUPOXO775IY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4BJPO63GBVOTY6GWUPOXO775IY","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":"7d655519ae6360efd891fc55d145bde4b9f9d2b85ff2ff20425deaaec399c00e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-03T20:14:25Z","title_canon_sha256":"76d3e446d9e06891bc884dc9b8a0c842f2e33c305f315eb26358d9c9be5b028f"},"schema_version":"1.0","source":{"id":"1602.01443","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01443","created_at":"2026-05-18T01:21:20Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01443v1","created_at":"2026-05-18T01:21:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01443","created_at":"2026-05-18T01:21:20Z"},{"alias_kind":"pith_short_12","alias_value":"4BJPO63GBVOT","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4BJPO63GBVOTY6GW","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4BJPO63G","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:ba379bb50ddd7bb0a796fa842406a7bdf2de29d895569ed73d747e2a8e6dba57","target":"graph","created_at":"2026-05-18T01:21:20Z","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":"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","authors_text":"Jeffrey D. Ullman, Jonathan Ullman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-03T20:14:25Z","title":"Some Pairs Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01443","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:d3c2822e91139fc7ace5be43d7ac82988ceb0dfdaa5171885720713ab30499a8","target":"record","created_at":"2026-05-18T01:21:20Z","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":"7d655519ae6360efd891fc55d145bde4b9f9d2b85ff2ff20425deaaec399c00e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-03T20:14:25Z","title_canon_sha256":"76d3e446d9e06891bc884dc9b8a0c842f2e33c305f315eb26358d9c9be5b028f"},"schema_version":"1.0","source":{"id":"1602.01443","kind":"arxiv","version":1}},"canonical_sha256":"e052f77b660d5d3c78d6a3dd777ffd461fcc6faf0d578f2bd811a4b932567a7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e052f77b660d5d3c78d6a3dd777ffd461fcc6faf0d578f2bd811a4b932567a7b","first_computed_at":"2026-05-18T01:21:20.219494Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:20.219494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lcnRkbot6T376yAP6Zmctifu2z5jEEtrRgMVmTKUigfiWu2tvD3GbH79J8trrS8hMQRBwaFk3gptUsLbxdITCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:20.220230Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.01443","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3c2822e91139fc7ace5be43d7ac82988ceb0dfdaa5171885720713ab30499a8","sha256:ba379bb50ddd7bb0a796fa842406a7bdf2de29d895569ed73d747e2a8e6dba57"],"state_sha256":"6484e1ef551ca218e98c708f4f4aac7b3f8aa7cb9694b091dea7283ea31b6846"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7wdlT6oXOoSxumi0cIcc/5RQPhPVYv369+ZO2pysVboXsxA6vUqlWBOsMtkKX1rwga6t6pya7b1fexRLMg5MBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T05:38:54.906200Z","bundle_sha256":"9ea991871eced665b74f41a6b3d850117c830201a5dad15487ab5b9e0d8b837d"}}