{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QZE2NYPEQJROZRXAGPTTWFHTLT","short_pith_number":"pith:QZE2NYPE","schema_version":"1.0","canonical_sha256":"8649a6e1e48262ecc6e033e73b14f35cf47d4615156f3e5ac326cf0bfd8abd16","source":{"kind":"arxiv","id":"1304.2336","version":2},"attestation_state":"computed","paper":{"title":"One-shot lossy quantum data compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Joseph M. Renes, Mark M. Wilde, Nilanjana Datta, Renato Renner","submitted_at":"2013-04-08T19:57:56Z","abstract_excerpt":"We provide a framework for one-shot quantum rate distortion coding, in which the goal is to determine the minimum number of qubits required to compress quantum information as a function of the probability that the distortion incurred upon decompression exceeds some specified level. We obtain a one-shot characterization of the minimum qubit compression size for an entanglement-assisted quantum rate-distortion code in terms of the smooth max-information, a quantity previously employed in the one-shot quantum reverse Shannon theorem. Next, we show how this characterization converges to the known "},"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":"1304.2336","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-04-08T19:57:56Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"5a6449b5d5b5570825402b965280f0343d894cd49809a22bde63f3e14c3ed8a5","abstract_canon_sha256":"4192e6269aecefe7573af6a1314cb8829eeeed5f05731ba9c2f6876098f19e38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:26.167928Z","signature_b64":"ym3wVx85k1ieIFJRl7ir1L1twYLuI1eiVTj4SMQTZU+SQddxNg0LwX/Y3zco8C+OrNsWcGo5IdN/hqyGciz0DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8649a6e1e48262ecc6e033e73b14f35cf47d4615156f3e5ac326cf0bfd8abd16","last_reissued_at":"2026-05-18T03:05:26.167181Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:26.167181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"One-shot lossy quantum data compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Joseph M. Renes, Mark M. Wilde, Nilanjana Datta, Renato Renner","submitted_at":"2013-04-08T19:57:56Z","abstract_excerpt":"We provide a framework for one-shot quantum rate distortion coding, in which the goal is to determine the minimum number of qubits required to compress quantum information as a function of the probability that the distortion incurred upon decompression exceeds some specified level. We obtain a one-shot characterization of the minimum qubit compression size for an entanglement-assisted quantum rate-distortion code in terms of the smooth max-information, a quantity previously employed in the one-shot quantum reverse Shannon theorem. Next, we show how this characterization converges to the known "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2336","kind":"arxiv","version":2},"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":"1304.2336","created_at":"2026-05-18T03:05:26.167284+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.2336v2","created_at":"2026-05-18T03:05:26.167284+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2336","created_at":"2026-05-18T03:05:26.167284+00:00"},{"alias_kind":"pith_short_12","alias_value":"QZE2NYPEQJRO","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QZE2NYPEQJROZRXA","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QZE2NYPE","created_at":"2026-05-18T12:27:57.521954+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.04271","citing_title":"Quantum Compression for Distributed Entanglement","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QZE2NYPEQJROZRXAGPTTWFHTLT","json":"https://pith.science/pith/QZE2NYPEQJROZRXAGPTTWFHTLT.json","graph_json":"https://pith.science/api/pith-number/QZE2NYPEQJROZRXAGPTTWFHTLT/graph.json","events_json":"https://pith.science/api/pith-number/QZE2NYPEQJROZRXAGPTTWFHTLT/events.json","paper":"https://pith.science/paper/QZE2NYPE"},"agent_actions":{"view_html":"https://pith.science/pith/QZE2NYPEQJROZRXAGPTTWFHTLT","download_json":"https://pith.science/pith/QZE2NYPEQJROZRXAGPTTWFHTLT.json","view_paper":"https://pith.science/paper/QZE2NYPE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.2336&json=true","fetch_graph":"https://pith.science/api/pith-number/QZE2NYPEQJROZRXAGPTTWFHTLT/graph.json","fetch_events":"https://pith.science/api/pith-number/QZE2NYPEQJROZRXAGPTTWFHTLT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QZE2NYPEQJROZRXAGPTTWFHTLT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QZE2NYPEQJROZRXAGPTTWFHTLT/action/storage_attestation","attest_author":"https://pith.science/pith/QZE2NYPEQJROZRXAGPTTWFHTLT/action/author_attestation","sign_citation":"https://pith.science/pith/QZE2NYPEQJROZRXAGPTTWFHTLT/action/citation_signature","submit_replication":"https://pith.science/pith/QZE2NYPEQJROZRXAGPTTWFHTLT/action/replication_record"}},"created_at":"2026-05-18T03:05:26.167284+00:00","updated_at":"2026-05-18T03:05:26.167284+00:00"}