{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:A3FDM3PA2DHKN6BAUEOMLIIHIG","short_pith_number":"pith:A3FDM3PA","canonical_record":{"source":{"id":"1404.5683","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-23T02:10:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6bfe24798a329d4f4c3cb8f6885a53373421aec9c6d8411e23ffbf179c3fd501","abstract_canon_sha256":"81575bbcc92fbaba019b5c70b4afc8521d3c896bc5125e4851be95d4c53894f4"},"schema_version":"1.0"},"canonical_sha256":"06ca366de0d0cea6f820a11cc5a10741a575f98c8f1d89285ef45254ac9d5d39","source":{"kind":"arxiv","id":"1404.5683","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5683","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5683v1","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5683","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"pith_short_12","alias_value":"A3FDM3PA2DHK","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"A3FDM3PA2DHKN6BA","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"A3FDM3PA","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:A3FDM3PA2DHKN6BAUEOMLIIHIG","target":"record","payload":{"canonical_record":{"source":{"id":"1404.5683","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-23T02:10:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6bfe24798a329d4f4c3cb8f6885a53373421aec9c6d8411e23ffbf179c3fd501","abstract_canon_sha256":"81575bbcc92fbaba019b5c70b4afc8521d3c896bc5125e4851be95d4c53894f4"},"schema_version":"1.0"},"canonical_sha256":"06ca366de0d0cea6f820a11cc5a10741a575f98c8f1d89285ef45254ac9d5d39","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:28.180169Z","signature_b64":"UuEepY8e44gQomalsvLE/U28suJmfZSssKzW9SbBLkMzp9929tKkKOQj0ZolCyWDzflbpeKNHfyNR3KyvUq8Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06ca366de0d0cea6f820a11cc5a10741a575f98c8f1d89285ef45254ac9d5d39","last_reissued_at":"2026-05-18T02:53:28.179461Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:28.179461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.5683","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-18T02:53:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fQx+ITTeLCXP7a03kWleqFX8xMib9o7kCO+o413lqua6mPUYaRF4RZdBVx/BExoJc3I7V+HBX1+p3/LXUIHhBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T21:38:03.843741Z"},"content_sha256":"1d53410b95b80baef4f844fdbabcfca0690f22d468ab61d423065c03b96f5814","schema_version":"1.0","event_id":"sha256:1d53410b95b80baef4f844fdbabcfca0690f22d468ab61d423065c03b96f5814"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:A3FDM3PA2DHKN6BAUEOMLIIHIG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Likelihood Encoder for Lossy Source 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-04-23T02:10:32Z","abstract_excerpt":"In this work, a likelihood encoder is studied in the context of lossy source compression. The analysis of the likelihood encoder is based on a soft-covering lemma. It is demonstrated that the use of a likelihood encoder together with the soft-covering lemma gives alternative achievability proofs for classical source coding problems. The case of the rate-distortion function with side information at the decoder (i.e. the Wyner-Ziv problem) is carefully examined and an application of the likelihood encoder to the multi-terminal source coding inner bound (i.e. the Berger-Tung region) is outlined."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5683","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-18T02:53:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KQKNBfsdwo6L4LiW8w5FAqnx5RpLnM5jo9A5M+grQB3RcCeIo6FevUZji+eLfQYRxYMRPdULBnoQcbuj3xj3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T21:38:03.844486Z"},"content_sha256":"91c166abcc8d069ccca257474a1add28f9532544221f58da6ce4e0111527be21","schema_version":"1.0","event_id":"sha256:91c166abcc8d069ccca257474a1add28f9532544221f58da6ce4e0111527be21"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A3FDM3PA2DHKN6BAUEOMLIIHIG/bundle.json","state_url":"https://pith.science/pith/A3FDM3PA2DHKN6BAUEOMLIIHIG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A3FDM3PA2DHKN6BAUEOMLIIHIG/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-09T21:38:03Z","links":{"resolver":"https://pith.science/pith/A3FDM3PA2DHKN6BAUEOMLIIHIG","bundle":"https://pith.science/pith/A3FDM3PA2DHKN6BAUEOMLIIHIG/bundle.json","state":"https://pith.science/pith/A3FDM3PA2DHKN6BAUEOMLIIHIG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A3FDM3PA2DHKN6BAUEOMLIIHIG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:A3FDM3PA2DHKN6BAUEOMLIIHIG","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":"81575bbcc92fbaba019b5c70b4afc8521d3c896bc5125e4851be95d4c53894f4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-23T02:10:32Z","title_canon_sha256":"6bfe24798a329d4f4c3cb8f6885a53373421aec9c6d8411e23ffbf179c3fd501"},"schema_version":"1.0","source":{"id":"1404.5683","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5683","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5683v1","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5683","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"pith_short_12","alias_value":"A3FDM3PA2DHK","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"A3FDM3PA2DHKN6BA","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"A3FDM3PA","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:91c166abcc8d069ccca257474a1add28f9532544221f58da6ce4e0111527be21","target":"graph","created_at":"2026-05-18T02:53:28Z","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 this work, a likelihood encoder is studied in the context of lossy source compression. The analysis of the likelihood encoder is based on a soft-covering lemma. It is demonstrated that the use of a likelihood encoder together with the soft-covering lemma gives alternative achievability proofs for classical source coding problems. The case of the rate-distortion function with side information at the decoder (i.e. the Wyner-Ziv problem) is carefully examined and an application of the likelihood encoder to the multi-terminal source coding inner bound (i.e. the Berger-Tung region) is outlined.","authors_text":"Eva C. Song, H. Vincent Poor, Paul Cuff","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-23T02:10:32Z","title":"The Likelihood Encoder for Lossy Source Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5683","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:1d53410b95b80baef4f844fdbabcfca0690f22d468ab61d423065c03b96f5814","target":"record","created_at":"2026-05-18T02:53:28Z","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":"81575bbcc92fbaba019b5c70b4afc8521d3c896bc5125e4851be95d4c53894f4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-23T02:10:32Z","title_canon_sha256":"6bfe24798a329d4f4c3cb8f6885a53373421aec9c6d8411e23ffbf179c3fd501"},"schema_version":"1.0","source":{"id":"1404.5683","kind":"arxiv","version":1}},"canonical_sha256":"06ca366de0d0cea6f820a11cc5a10741a575f98c8f1d89285ef45254ac9d5d39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06ca366de0d0cea6f820a11cc5a10741a575f98c8f1d89285ef45254ac9d5d39","first_computed_at":"2026-05-18T02:53:28.179461Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:28.179461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UuEepY8e44gQomalsvLE/U28suJmfZSssKzW9SbBLkMzp9929tKkKOQj0ZolCyWDzflbpeKNHfyNR3KyvUq8Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:28.180169Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.5683","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d53410b95b80baef4f844fdbabcfca0690f22d468ab61d423065c03b96f5814","sha256:91c166abcc8d069ccca257474a1add28f9532544221f58da6ce4e0111527be21"],"state_sha256":"1d1246562d46387cb75871842718b3e5bddcdaca313c52c6f87bdd787794a2a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LSFM637tV/EAiDsDpewlYfYOn8UZw20t0E4hyY2Rl/Nl6820PoEHzznaboAdTlPh7LM/hAHBV6GSWJwr+KbmDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T21:38:03.848530Z","bundle_sha256":"7d69db51e118f426879bc9db5028df19cde9a031b6b62ee32c0b118ddc70aa36"}}