{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:L3V53N55WFRXBXKFLVLMICTJMC","short_pith_number":"pith:L3V53N55","schema_version":"1.0","canonical_sha256":"5eebddb7bdb16370dd455d56c40a696089d5038c4734e54a48c0b8c10bac7b35","source":{"kind":"arxiv","id":"1701.07695","version":1},"attestation_state":"computed","paper":{"title":"Exponential Source/Channel Duality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ram Zamir, Sergey Tridenski","submitted_at":"2017-01-26T13:35:57Z","abstract_excerpt":"We propose a source/channel duality in the exponential regime, where success/failure in source coding parallels error/correctness in channel coding, and a distortion constraint becomes a log-likelihood ratio (LLR) threshold. We establish this duality by first deriving exact exponents for lossy coding of a memoryless source P, at distortion D, for a general i.i.d. codebook distribution Q, for both encoding success (R < R(P,Q,D)) and failure (R > R(P,Q,D)). We then turn to maximum likelihood (ML) decoding over a memoryless channel P with an i.i.d. input Q, and show that if we substitute P=QP, Q="},"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":"1701.07695","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-26T13:35:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cfd43c1b7bab13c8fc6b40df146878915732ba332ff64ae503eae5a63daac749","abstract_canon_sha256":"612ab43247beb5b7302535b3f11ac02f8f65ed183ea9f0e7a1308ea9c1b0ba37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:02.817041Z","signature_b64":"JMoHZMQBJHzvr3SkOZQmgziYlU1G9H2C/SHt8RlVpRxYsd3WwRFxfd9ITndscTm9rwS3eeiCl4lfUp1wP5K4DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5eebddb7bdb16370dd455d56c40a696089d5038c4734e54a48c0b8c10bac7b35","last_reissued_at":"2026-05-18T00:52:02.816300Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:02.816300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exponential Source/Channel Duality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ram Zamir, Sergey Tridenski","submitted_at":"2017-01-26T13:35:57Z","abstract_excerpt":"We propose a source/channel duality in the exponential regime, where success/failure in source coding parallels error/correctness in channel coding, and a distortion constraint becomes a log-likelihood ratio (LLR) threshold. We establish this duality by first deriving exact exponents for lossy coding of a memoryless source P, at distortion D, for a general i.i.d. codebook distribution Q, for both encoding success (R < R(P,Q,D)) and failure (R > R(P,Q,D)). We then turn to maximum likelihood (ML) decoding over a memoryless channel P with an i.i.d. input Q, and show that if we substitute P=QP, Q="},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07695","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":"1701.07695","created_at":"2026-05-18T00:52:02.816441+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.07695v1","created_at":"2026-05-18T00:52:02.816441+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07695","created_at":"2026-05-18T00:52:02.816441+00:00"},{"alias_kind":"pith_short_12","alias_value":"L3V53N55WFRX","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"L3V53N55WFRXBXKF","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"L3V53N55","created_at":"2026-05-18T12:31:28.150371+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/L3V53N55WFRXBXKFLVLMICTJMC","json":"https://pith.science/pith/L3V53N55WFRXBXKFLVLMICTJMC.json","graph_json":"https://pith.science/api/pith-number/L3V53N55WFRXBXKFLVLMICTJMC/graph.json","events_json":"https://pith.science/api/pith-number/L3V53N55WFRXBXKFLVLMICTJMC/events.json","paper":"https://pith.science/paper/L3V53N55"},"agent_actions":{"view_html":"https://pith.science/pith/L3V53N55WFRXBXKFLVLMICTJMC","download_json":"https://pith.science/pith/L3V53N55WFRXBXKFLVLMICTJMC.json","view_paper":"https://pith.science/paper/L3V53N55","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.07695&json=true","fetch_graph":"https://pith.science/api/pith-number/L3V53N55WFRXBXKFLVLMICTJMC/graph.json","fetch_events":"https://pith.science/api/pith-number/L3V53N55WFRXBXKFLVLMICTJMC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L3V53N55WFRXBXKFLVLMICTJMC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L3V53N55WFRXBXKFLVLMICTJMC/action/storage_attestation","attest_author":"https://pith.science/pith/L3V53N55WFRXBXKFLVLMICTJMC/action/author_attestation","sign_citation":"https://pith.science/pith/L3V53N55WFRXBXKFLVLMICTJMC/action/citation_signature","submit_replication":"https://pith.science/pith/L3V53N55WFRXBXKFLVLMICTJMC/action/replication_record"}},"created_at":"2026-05-18T00:52:02.816441+00:00","updated_at":"2026-05-18T00:52:02.816441+00:00"}