{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HMRG5KFXCSP5BHDBBUA5LHKWTG","short_pith_number":"pith:HMRG5KFX","schema_version":"1.0","canonical_sha256":"3b226ea8b7149fd09c610d01d59d5699a07248ef98099b65957f496e68babbaf","source":{"kind":"arxiv","id":"1408.4522","version":3},"attestation_state":"computed","paper":{"title":"The Likelihood Encoder for Lossy Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eva C. Song, H. Vincent Poor, Paul Cuff","submitted_at":"2014-08-20T05:07:26Z","abstract_excerpt":"A likelihood encoder is studied in the context of lossy source compression. The analysis of the likelihood encoder is based on the soft-covering lemma. It is demonstrated that the use of a likelihood encoder together with the soft-covering lemma yields simple achievability proofs for classical source coding problems. The cases of the point-to-point rate-distortion function, the rate-distortion function with side information at the decoder (i.e. the Wyner-Ziv problem), and the multi-terminal source coding inner bound (i.e. the Berger-Tung problem) are examined in this paper. Furthermore, a non-"},"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":"1408.4522","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-20T05:07:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f610f699a0ca128e41861271a3a500a26b725023054405dbd4a38f875cf28f31","abstract_canon_sha256":"123e2f4e08520f9893016db9b77ee4763efeac837ad52000aec4f6098ff99b04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:37.837281Z","signature_b64":"k810fT/fwQDaMMuqedY/i9v2geehuyHx52KBFal+AtrgOzehV+FSLibD18vgoEAkduXg3JsB+q7z69kCtirgDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b226ea8b7149fd09c610d01d59d5699a07248ef98099b65957f496e68babbaf","last_reissued_at":"2026-05-18T01:17:37.836671Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:37.836671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Likelihood Encoder for Lossy Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eva C. Song, H. Vincent Poor, Paul Cuff","submitted_at":"2014-08-20T05:07:26Z","abstract_excerpt":"A likelihood encoder is studied in the context of lossy source compression. The analysis of the likelihood encoder is based on the soft-covering lemma. It is demonstrated that the use of a likelihood encoder together with the soft-covering lemma yields simple achievability proofs for classical source coding problems. The cases of the point-to-point rate-distortion function, the rate-distortion function with side information at the decoder (i.e. the Wyner-Ziv problem), and the multi-terminal source coding inner bound (i.e. the Berger-Tung problem) are examined in this paper. Furthermore, a non-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4522","kind":"arxiv","version":3},"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":"1408.4522","created_at":"2026-05-18T01:17:37.836793+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.4522v3","created_at":"2026-05-18T01:17:37.836793+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4522","created_at":"2026-05-18T01:17:37.836793+00:00"},{"alias_kind":"pith_short_12","alias_value":"HMRG5KFXCSP5","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HMRG5KFXCSP5BHDB","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HMRG5KFX","created_at":"2026-05-18T12:28:30.664211+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/HMRG5KFXCSP5BHDBBUA5LHKWTG","json":"https://pith.science/pith/HMRG5KFXCSP5BHDBBUA5LHKWTG.json","graph_json":"https://pith.science/api/pith-number/HMRG5KFXCSP5BHDBBUA5LHKWTG/graph.json","events_json":"https://pith.science/api/pith-number/HMRG5KFXCSP5BHDBBUA5LHKWTG/events.json","paper":"https://pith.science/paper/HMRG5KFX"},"agent_actions":{"view_html":"https://pith.science/pith/HMRG5KFXCSP5BHDBBUA5LHKWTG","download_json":"https://pith.science/pith/HMRG5KFXCSP5BHDBBUA5LHKWTG.json","view_paper":"https://pith.science/paper/HMRG5KFX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.4522&json=true","fetch_graph":"https://pith.science/api/pith-number/HMRG5KFXCSP5BHDBBUA5LHKWTG/graph.json","fetch_events":"https://pith.science/api/pith-number/HMRG5KFXCSP5BHDBBUA5LHKWTG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HMRG5KFXCSP5BHDBBUA5LHKWTG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HMRG5KFXCSP5BHDBBUA5LHKWTG/action/storage_attestation","attest_author":"https://pith.science/pith/HMRG5KFXCSP5BHDBBUA5LHKWTG/action/author_attestation","sign_citation":"https://pith.science/pith/HMRG5KFXCSP5BHDBBUA5LHKWTG/action/citation_signature","submit_replication":"https://pith.science/pith/HMRG5KFXCSP5BHDBBUA5LHKWTG/action/replication_record"}},"created_at":"2026-05-18T01:17:37.836793+00:00","updated_at":"2026-05-18T01:17:37.836793+00:00"}