{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SU6ZEEDIT7UCARPB7KS4YGYLXY","short_pith_number":"pith:SU6ZEEDI","canonical_record":{"source":{"id":"1703.08139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-03-23T16:50:03Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"204fb87ef737c08c6216d9d9a251c330dc84a81657877b40c3a056f23d716a9a","abstract_canon_sha256":"24e5447b710c442fc6d66546cdd4f5887cc25db88d688c20b17391ad8cc825f6"},"schema_version":"1.0"},"canonical_sha256":"953d9210689fe82045e1faa5cc1b0bbe0f3d4e57f893dc5d5e573aaf11882278","source":{"kind":"arxiv","id":"1703.08139","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.08139","created_at":"2026-05-18T00:48:03Z"},{"alias_kind":"arxiv_version","alias_value":"1703.08139v1","created_at":"2026-05-18T00:48:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08139","created_at":"2026-05-18T00:48:03Z"},{"alias_kind":"pith_short_12","alias_value":"SU6ZEEDIT7UC","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SU6ZEEDIT7UCARPB","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SU6ZEEDI","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SU6ZEEDIT7UCARPB7KS4YGYLXY","target":"record","payload":{"canonical_record":{"source":{"id":"1703.08139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-03-23T16:50:03Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"204fb87ef737c08c6216d9d9a251c330dc84a81657877b40c3a056f23d716a9a","abstract_canon_sha256":"24e5447b710c442fc6d66546cdd4f5887cc25db88d688c20b17391ad8cc825f6"},"schema_version":"1.0"},"canonical_sha256":"953d9210689fe82045e1faa5cc1b0bbe0f3d4e57f893dc5d5e573aaf11882278","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:03.766388Z","signature_b64":"uRzb0m2RBPdNcGMNdXRMUu9jjNSoIF44Wp7+FA9ZVJQyON4RsDMq8kkLnKa4JXRRRe0so21WrlX3ocOQ7hPTBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"953d9210689fe82045e1faa5cc1b0bbe0f3d4e57f893dc5d5e573aaf11882278","last_reissued_at":"2026-05-18T00:48:03.765701Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:03.765701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.08139","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-18T00:48:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dJg+fNkgKxAa78nKgIPzk90ceMKLh2CWSNCFbzHH/GZnSbNenoYcoGXzrSgpEBKM+gPmfh0uIOoAsZmEd2R6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:24:25.205532Z"},"content_sha256":"a3860ec13c7457b27c170c61d5ef84fe456fb4c2bb5beca8985dce652abc374e","schema_version":"1.0","event_id":"sha256:a3860ec13c7457b27c170c61d5ef84fe456fb4c2bb5beca8985dce652abc374e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SU6ZEEDIT7UCARPB7KS4YGYLXY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal lower bounds for universal relation, samplers, and finding duplicates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Jakub Pachocki, Jelani Nelson, Zhengyu Wang","submitted_at":"2017-03-23T16:50:03Z","abstract_excerpt":"In the communication problem $\\mathbf{UR}$ (universal relation) [KRW95], Alice and Bob respectively receive $x$ and $y$ in $\\{0,1\\}^n$ with the promise that $x\\neq y$. The last player to receive a message must output an index $i$ such that $x_i\\neq y_i$. We prove that the randomized one-way communication complexity of this problem in the public coin model is exactly $\\Theta(\\min\\{n, \\log(1/\\delta)\\log^2(\\frac{n}{\\log(1/\\delta)})\\})$ bits for failure probability $\\delta$. Our lower bound holds even if promised $\\mathop{support}(y)\\subset \\mathop{support}(x)$. As a corollary, we obtain optimal l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08139","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-18T00:48:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dh7oWfsphBVrhvKpHQUk3gZPgVNtOnMtxNUWg17y9MmW6Fkl2DWlFr5rTOIcga6ENqYvLG0Mb6y+EbmddpKQAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:24:25.206197Z"},"content_sha256":"f31fbdcbad512383311f6f056999c9192b8570d6c87b8cd75fa7e1346876c365","schema_version":"1.0","event_id":"sha256:f31fbdcbad512383311f6f056999c9192b8570d6c87b8cd75fa7e1346876c365"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SU6ZEEDIT7UCARPB7KS4YGYLXY/bundle.json","state_url":"https://pith.science/pith/SU6ZEEDIT7UCARPB7KS4YGYLXY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SU6ZEEDIT7UCARPB7KS4YGYLXY/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-05-27T22:24:25Z","links":{"resolver":"https://pith.science/pith/SU6ZEEDIT7UCARPB7KS4YGYLXY","bundle":"https://pith.science/pith/SU6ZEEDIT7UCARPB7KS4YGYLXY/bundle.json","state":"https://pith.science/pith/SU6ZEEDIT7UCARPB7KS4YGYLXY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SU6ZEEDIT7UCARPB7KS4YGYLXY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SU6ZEEDIT7UCARPB7KS4YGYLXY","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":"24e5447b710c442fc6d66546cdd4f5887cc25db88d688c20b17391ad8cc825f6","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-03-23T16:50:03Z","title_canon_sha256":"204fb87ef737c08c6216d9d9a251c330dc84a81657877b40c3a056f23d716a9a"},"schema_version":"1.0","source":{"id":"1703.08139","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.08139","created_at":"2026-05-18T00:48:03Z"},{"alias_kind":"arxiv_version","alias_value":"1703.08139v1","created_at":"2026-05-18T00:48:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08139","created_at":"2026-05-18T00:48:03Z"},{"alias_kind":"pith_short_12","alias_value":"SU6ZEEDIT7UC","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SU6ZEEDIT7UCARPB","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SU6ZEEDI","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:f31fbdcbad512383311f6f056999c9192b8570d6c87b8cd75fa7e1346876c365","target":"graph","created_at":"2026-05-18T00:48:03Z","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":"In the communication problem $\\mathbf{UR}$ (universal relation) [KRW95], Alice and Bob respectively receive $x$ and $y$ in $\\{0,1\\}^n$ with the promise that $x\\neq y$. The last player to receive a message must output an index $i$ such that $x_i\\neq y_i$. We prove that the randomized one-way communication complexity of this problem in the public coin model is exactly $\\Theta(\\min\\{n, \\log(1/\\delta)\\log^2(\\frac{n}{\\log(1/\\delta)})\\})$ bits for failure probability $\\delta$. Our lower bound holds even if promised $\\mathop{support}(y)\\subset \\mathop{support}(x)$. As a corollary, we obtain optimal l","authors_text":"Jakub Pachocki, Jelani Nelson, Zhengyu Wang","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-03-23T16:50:03Z","title":"Optimal lower bounds for universal relation, samplers, and finding duplicates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08139","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:a3860ec13c7457b27c170c61d5ef84fe456fb4c2bb5beca8985dce652abc374e","target":"record","created_at":"2026-05-18T00:48:03Z","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":"24e5447b710c442fc6d66546cdd4f5887cc25db88d688c20b17391ad8cc825f6","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-03-23T16:50:03Z","title_canon_sha256":"204fb87ef737c08c6216d9d9a251c330dc84a81657877b40c3a056f23d716a9a"},"schema_version":"1.0","source":{"id":"1703.08139","kind":"arxiv","version":1}},"canonical_sha256":"953d9210689fe82045e1faa5cc1b0bbe0f3d4e57f893dc5d5e573aaf11882278","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"953d9210689fe82045e1faa5cc1b0bbe0f3d4e57f893dc5d5e573aaf11882278","first_computed_at":"2026-05-18T00:48:03.765701Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:03.765701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uRzb0m2RBPdNcGMNdXRMUu9jjNSoIF44Wp7+FA9ZVJQyON4RsDMq8kkLnKa4JXRRRe0so21WrlX3ocOQ7hPTBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:03.766388Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.08139","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3860ec13c7457b27c170c61d5ef84fe456fb4c2bb5beca8985dce652abc374e","sha256:f31fbdcbad512383311f6f056999c9192b8570d6c87b8cd75fa7e1346876c365"],"state_sha256":"42faa6d78c923b64fb263aa21005208cf7f3852bb5bb7aae970e6c151391e451"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yp8w+mh7oIKcH6WJBxh8DtGymw2SmGq//ChwkMEM0jHahyg2SFkaI2p6JlbREO6yBW1h8vJ9i+9C41tjUMxdDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:24:25.209585Z","bundle_sha256":"1936e94a72e30287e763797cac65eb9433d92810429ea5b0c5be51442a36122f"}}