{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:S52265HQGVISTPJU2TTIQNXCRX","short_pith_number":"pith:S52265HQ","schema_version":"1.0","canonical_sha256":"9775af74f0355129bd34d4e68836e28dd0fda329c7dbc57f8ccde4304db28c46","source":{"kind":"arxiv","id":"1307.8327","version":1},"attestation_state":"computed","paper":{"title":"The Likelihood Encoder for Source Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eva C. Song, Paul Cuff","submitted_at":"2013-07-31T14:13:55Z","abstract_excerpt":"The likelihood encoder with a random codebook is demonstrated as an effective tool for source coding. Coupled with a soft covering lemma (associated with channel resolvability), likelihood encoders yield simple achievability proofs for known results, such as rate-distortion theory. They also produce a tractable analysis for secure rate-distortion theory and strong coordination."},"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":"1307.8327","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-31T14:13:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"209cc687bb717dd9fb000e9e5228c77580def2448da67750db75ccbab2d202ff","abstract_canon_sha256":"8a4d76b38127789c5228de0cc82928b0b7ba82af49257035f9b5348bb0734d43"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:01.558577Z","signature_b64":"zyPqNceQQzupUBwB+I05cvdANuS1JuME+xWkmkTdF7qubIN2aDTbvKyf8NMomcX98tSpVhmxqqUJ00f73Q71AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9775af74f0355129bd34d4e68836e28dd0fda329c7dbc57f8ccde4304db28c46","last_reissued_at":"2026-05-18T03:17:01.557929Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:01.557929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Likelihood Encoder for Source Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eva C. Song, Paul Cuff","submitted_at":"2013-07-31T14:13:55Z","abstract_excerpt":"The likelihood encoder with a random codebook is demonstrated as an effective tool for source coding. Coupled with a soft covering lemma (associated with channel resolvability), likelihood encoders yield simple achievability proofs for known results, such as rate-distortion theory. They also produce a tractable analysis for secure rate-distortion theory and strong coordination."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.8327","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":"1307.8327","created_at":"2026-05-18T03:17:01.558028+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.8327v1","created_at":"2026-05-18T03:17:01.558028+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.8327","created_at":"2026-05-18T03:17:01.558028+00:00"},{"alias_kind":"pith_short_12","alias_value":"S52265HQGVIS","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"S52265HQGVISTPJU","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"S52265HQ","created_at":"2026-05-18T12:27:59.945178+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/S52265HQGVISTPJU2TTIQNXCRX","json":"https://pith.science/pith/S52265HQGVISTPJU2TTIQNXCRX.json","graph_json":"https://pith.science/api/pith-number/S52265HQGVISTPJU2TTIQNXCRX/graph.json","events_json":"https://pith.science/api/pith-number/S52265HQGVISTPJU2TTIQNXCRX/events.json","paper":"https://pith.science/paper/S52265HQ"},"agent_actions":{"view_html":"https://pith.science/pith/S52265HQGVISTPJU2TTIQNXCRX","download_json":"https://pith.science/pith/S52265HQGVISTPJU2TTIQNXCRX.json","view_paper":"https://pith.science/paper/S52265HQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.8327&json=true","fetch_graph":"https://pith.science/api/pith-number/S52265HQGVISTPJU2TTIQNXCRX/graph.json","fetch_events":"https://pith.science/api/pith-number/S52265HQGVISTPJU2TTIQNXCRX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S52265HQGVISTPJU2TTIQNXCRX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S52265HQGVISTPJU2TTIQNXCRX/action/storage_attestation","attest_author":"https://pith.science/pith/S52265HQGVISTPJU2TTIQNXCRX/action/author_attestation","sign_citation":"https://pith.science/pith/S52265HQGVISTPJU2TTIQNXCRX/action/citation_signature","submit_replication":"https://pith.science/pith/S52265HQGVISTPJU2TTIQNXCRX/action/replication_record"}},"created_at":"2026-05-18T03:17:01.558028+00:00","updated_at":"2026-05-18T03:17:01.558028+00:00"}