{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QZE2NYPEQJROZRXAGPTTWFHTLT","short_pith_number":"pith:QZE2NYPE","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"},"canonical_sha256":"8649a6e1e48262ecc6e033e73b14f35cf47d4615156f3e5ac326cf0bfd8abd16","source":{"kind":"arxiv","id":"1304.2336","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.2336","created_at":"2026-05-18T03:05:26Z"},{"alias_kind":"arxiv_version","alias_value":"1304.2336v2","created_at":"2026-05-18T03:05:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2336","created_at":"2026-05-18T03:05:26Z"},{"alias_kind":"pith_short_12","alias_value":"QZE2NYPEQJRO","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QZE2NYPEQJROZRXA","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QZE2NYPE","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QZE2NYPEQJROZRXAGPTTWFHTLT","target":"record","payload":{"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"},"canonical_sha256":"8649a6e1e48262ecc6e033e73b14f35cf47d4615156f3e5ac326cf0bfd8abd16","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"},"source_kind":"arxiv","source_id":"1304.2336","source_version":2,"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-18T03:05:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CTawpgaAufkw//gKxiBq5bPhZ/bUNCCAMzd1iePHE8eiQWk+N5wGqBPB0F4zFO/CeynpaxFxokxzJPuiZKZwDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:21:17.115038Z"},"content_sha256":"20e4169dab8b2498a630b44b380d02dc409970ea79583e9868ee80d1baabec34","schema_version":"1.0","event_id":"sha256:20e4169dab8b2498a630b44b380d02dc409970ea79583e9868ee80d1baabec34"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QZE2NYPEQJROZRXAGPTTWFHTLT","target":"graph","payload":{"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"},"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-18T03:05:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zLlnKX05sRjTHFUylICmQJM129ZGrQvdxLw6wrJU4m/Za+SuI5TqL5v9x/cUu8jnASfMa5HnFHWvJTSVZ7KLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:21:17.115525Z"},"content_sha256":"26b56f862cb40018a5f4e3262930ffdb396f88b1f807841830b13ee138f2eab7","schema_version":"1.0","event_id":"sha256:26b56f862cb40018a5f4e3262930ffdb396f88b1f807841830b13ee138f2eab7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QZE2NYPEQJROZRXAGPTTWFHTLT/bundle.json","state_url":"https://pith.science/pith/QZE2NYPEQJROZRXAGPTTWFHTLT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QZE2NYPEQJROZRXAGPTTWFHTLT/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-05-26T17:21:17Z","links":{"resolver":"https://pith.science/pith/QZE2NYPEQJROZRXAGPTTWFHTLT","bundle":"https://pith.science/pith/QZE2NYPEQJROZRXAGPTTWFHTLT/bundle.json","state":"https://pith.science/pith/QZE2NYPEQJROZRXAGPTTWFHTLT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QZE2NYPEQJROZRXAGPTTWFHTLT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QZE2NYPEQJROZRXAGPTTWFHTLT","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":"4192e6269aecefe7573af6a1314cb8829eeeed5f05731ba9c2f6876098f19e38","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-04-08T19:57:56Z","title_canon_sha256":"5a6449b5d5b5570825402b965280f0343d894cd49809a22bde63f3e14c3ed8a5"},"schema_version":"1.0","source":{"id":"1304.2336","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.2336","created_at":"2026-05-18T03:05:26Z"},{"alias_kind":"arxiv_version","alias_value":"1304.2336v2","created_at":"2026-05-18T03:05:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2336","created_at":"2026-05-18T03:05:26Z"},{"alias_kind":"pith_short_12","alias_value":"QZE2NYPEQJRO","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QZE2NYPEQJROZRXA","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QZE2NYPE","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:26b56f862cb40018a5f4e3262930ffdb396f88b1f807841830b13ee138f2eab7","target":"graph","created_at":"2026-05-18T03:05:26Z","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":"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 ","authors_text":"Joseph M. Renes, Mark M. Wilde, Nilanjana Datta, Renato Renner","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-04-08T19:57:56Z","title":"One-shot lossy quantum data compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2336","kind":"arxiv","version":2},"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:20e4169dab8b2498a630b44b380d02dc409970ea79583e9868ee80d1baabec34","target":"record","created_at":"2026-05-18T03:05:26Z","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":"4192e6269aecefe7573af6a1314cb8829eeeed5f05731ba9c2f6876098f19e38","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-04-08T19:57:56Z","title_canon_sha256":"5a6449b5d5b5570825402b965280f0343d894cd49809a22bde63f3e14c3ed8a5"},"schema_version":"1.0","source":{"id":"1304.2336","kind":"arxiv","version":2}},"canonical_sha256":"8649a6e1e48262ecc6e033e73b14f35cf47d4615156f3e5ac326cf0bfd8abd16","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8649a6e1e48262ecc6e033e73b14f35cf47d4615156f3e5ac326cf0bfd8abd16","first_computed_at":"2026-05-18T03:05:26.167181Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:26.167181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ym3wVx85k1ieIFJRl7ir1L1twYLuI1eiVTj4SMQTZU+SQddxNg0LwX/Y3zco8C+OrNsWcGo5IdN/hqyGciz0DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:26.167928Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.2336","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20e4169dab8b2498a630b44b380d02dc409970ea79583e9868ee80d1baabec34","sha256:26b56f862cb40018a5f4e3262930ffdb396f88b1f807841830b13ee138f2eab7"],"state_sha256":"bcd2aa8d5ad6a340d920bd21b191f7b7fa8f45decca53f5cc2f1d44bd2467a14"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BFu0ZzkgNhIwIoD6KjOivDCUHo+9WRrK4JIAE3CzA402OaRlIwvafuTmnVtwhscm56IJ580pkA7fHJ2nzGSVAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:21:17.118705Z","bundle_sha256":"8916e09f4ef655cd5f32ce2a28cdf1498b9f2f545f9e1217f93907cd73711eed"}}