{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:I7DDF6URN3NOV7VIBSVB26UH7S","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":"e0814945deb36478aa509e5f98de88a42a61a1bca009eed9440975ead6b7b39f","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-02T12:58:13Z","title_canon_sha256":"ba0a4f3425452a30835e39b7475ef5b627ccb62ae8b69109c9f7ea3514dcaff6"},"schema_version":"1.0","source":{"id":"1605.00462","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.00462","created_at":"2026-05-18T01:15:55Z"},{"alias_kind":"arxiv_version","alias_value":"1605.00462v1","created_at":"2026-05-18T01:15:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00462","created_at":"2026-05-18T01:15:55Z"},{"alias_kind":"pith_short_12","alias_value":"I7DDF6URN3NO","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"I7DDF6URN3NOV7VI","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"I7DDF6UR","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:669199bcc1e3fbcd82e95e416a9b7a9761168df73559ce39bdb0a638ae1162ee","target":"graph","created_at":"2026-05-18T01:15:55Z","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":"Two sets $A, B \\subseteq \\{0, 1\\}^n$ form a Uniquely Decodable Code Pair (UDCP) if every pair $a \\in A$, $b \\in B$ yields a distinct sum $a+b$, where the addition is over $\\mathbb{Z}^n$. We show that every UDCP $A, B$, with $|A| = 2^{(1-\\epsilon)n}$ and $|B| = 2^{\\beta n}$, satisfies $\\beta \\leq 0.4228 +\\sqrt{\\epsilon}$. For sufficiently small $\\epsilon$, this bound significantly improves previous bounds by Urbanke and Li~[Information Theory Workshop '98] and Ordentlich and Shayevitz~[2014, arXiv:1412.8415], which upper bound $\\beta$ by $0.4921$ and $0.4798$, respectively, as $\\epsilon$ approa","authors_text":"Jesper Nederlof, Mikko Koivisto, Per Austrin, Petteri Kaski","cross_cats":["cs.DM","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-02T12:58:13Z","title":"Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00462","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:9556d2078bc7ded806641ba373e6bddd3d93848c8b2bcdaeda80638fb4af86dd","target":"record","created_at":"2026-05-18T01:15:55Z","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":"e0814945deb36478aa509e5f98de88a42a61a1bca009eed9440975ead6b7b39f","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-02T12:58:13Z","title_canon_sha256":"ba0a4f3425452a30835e39b7475ef5b627ccb62ae8b69109c9f7ea3514dcaff6"},"schema_version":"1.0","source":{"id":"1605.00462","kind":"arxiv","version":1}},"canonical_sha256":"47c632fa916edaeafea80caa1d7a87fc95e20f2364fa258410c4dca1378cad74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47c632fa916edaeafea80caa1d7a87fc95e20f2364fa258410c4dca1378cad74","first_computed_at":"2026-05-18T01:15:55.715343Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:55.715343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yR+/AUOD1q1wUGtZNM4EAPAhkO+jrNuOvl09sioo8whJLeYrGZZRb8w01g4ld0CAAeJryQecMKr9xF/lHHSLAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:55.715946Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.00462","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9556d2078bc7ded806641ba373e6bddd3d93848c8b2bcdaeda80638fb4af86dd","sha256:669199bcc1e3fbcd82e95e416a9b7a9761168df73559ce39bdb0a638ae1162ee"],"state_sha256":"459c2108da22bfb4badec69cac11dc5fd9a241d847afb1468be81bde30415797"}