{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZRKSB33JRQZ4F5CKKE4ZKCFOSI","short_pith_number":"pith:ZRKSB33J","canonical_record":{"source":{"id":"1710.01513","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-10-04T09:12:50Z","cross_cats_sorted":[],"title_canon_sha256":"b8cd70093100ac357886452ec21550e1e57e068acf5077cc5f4ad1038c5f5377","abstract_canon_sha256":"e9ce76f1ead9b56ec0ab54172c30f284ae306a4ee38fd6d9954d13998283a7f3"},"schema_version":"1.0"},"canonical_sha256":"cc5520ef698c33c2f44a51399508ae9214cd18dfc578ada72273af2983dc7f35","source":{"kind":"arxiv","id":"1710.01513","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01513","created_at":"2026-05-18T00:33:42Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01513v1","created_at":"2026-05-18T00:33:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01513","created_at":"2026-05-18T00:33:42Z"},{"alias_kind":"pith_short_12","alias_value":"ZRKSB33JRQZ4","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZRKSB33JRQZ4F5CK","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZRKSB33J","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZRKSB33JRQZ4F5CKKE4ZKCFOSI","target":"record","payload":{"canonical_record":{"source":{"id":"1710.01513","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-10-04T09:12:50Z","cross_cats_sorted":[],"title_canon_sha256":"b8cd70093100ac357886452ec21550e1e57e068acf5077cc5f4ad1038c5f5377","abstract_canon_sha256":"e9ce76f1ead9b56ec0ab54172c30f284ae306a4ee38fd6d9954d13998283a7f3"},"schema_version":"1.0"},"canonical_sha256":"cc5520ef698c33c2f44a51399508ae9214cd18dfc578ada72273af2983dc7f35","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:42.537209Z","signature_b64":"Q3rhwxagm4X2iA5IFyKlIcOZkvv49gh3juTjukRsIUedZDqDD9+QZtfJ6skk5JVR6Hy58us8IYWCVlohCq/oBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc5520ef698c33c2f44a51399508ae9214cd18dfc578ada72273af2983dc7f35","last_reissued_at":"2026-05-18T00:33:42.536558Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:42.536558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.01513","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-18T00:33:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RkUOvmWzKjCzoeCQhpLwhJEzANwtrSTFDNwtSjpLfgc0FfnMTLDKmBIejH7jQvZfbUJqB5M79y5/9TlrSGZxBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T07:11:27.331296Z"},"content_sha256":"8de03824b282e16dcd50dce26edfd301b2a82ce6e4ab9f0633ef72c335d06af9","schema_version":"1.0","event_id":"sha256:8de03824b282e16dcd50dce26edfd301b2a82ce6e4ab9f0633ef72c335d06af9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZRKSB33JRQZ4F5CKKE4ZKCFOSI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lossless quantum data compression with exponential penalization: an operational interpretation of the quantum R\\'enyi entropy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"F. Holik, G. Bellomo, G.M. Bosyk, S. Zozor","submitted_at":"2017-10-04T09:12:50Z","abstract_excerpt":"Based on the problem of quantum data compression in a lossless way, we present here an operational interpretation for the family of quantum R\\'enyi entropies. In order to do this, we appeal to a very general quantum encoding scheme that satisfies a quantum version of the Kraft-McMillan inequality. Then, in the standard situation, where one is intended to minimize the usual average length of the quantum codewords, we recover the known results, namely that the von Neumann entropy of the source bounds the average length of the optimal codes. Otherwise, we show that by invoking an exponential aver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01513","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-18T00:33:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OFsd7y37q/ZAK5BrUGv27yTImeBzuH6ziLzAWf045ST85r/Sjkk94h22O8xVMRCtN8Nx6MMiWIFmYigHWgCHCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T07:11:27.332172Z"},"content_sha256":"6f0fd60d3b43353091316b0fe08e113f85d4d9ce61db8092889e27c3773191d1","schema_version":"1.0","event_id":"sha256:6f0fd60d3b43353091316b0fe08e113f85d4d9ce61db8092889e27c3773191d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZRKSB33JRQZ4F5CKKE4ZKCFOSI/bundle.json","state_url":"https://pith.science/pith/ZRKSB33JRQZ4F5CKKE4ZKCFOSI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZRKSB33JRQZ4F5CKKE4ZKCFOSI/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-19T07:11:27Z","links":{"resolver":"https://pith.science/pith/ZRKSB33JRQZ4F5CKKE4ZKCFOSI","bundle":"https://pith.science/pith/ZRKSB33JRQZ4F5CKKE4ZKCFOSI/bundle.json","state":"https://pith.science/pith/ZRKSB33JRQZ4F5CKKE4ZKCFOSI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZRKSB33JRQZ4F5CKKE4ZKCFOSI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZRKSB33JRQZ4F5CKKE4ZKCFOSI","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":"e9ce76f1ead9b56ec0ab54172c30f284ae306a4ee38fd6d9954d13998283a7f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-10-04T09:12:50Z","title_canon_sha256":"b8cd70093100ac357886452ec21550e1e57e068acf5077cc5f4ad1038c5f5377"},"schema_version":"1.0","source":{"id":"1710.01513","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01513","created_at":"2026-05-18T00:33:42Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01513v1","created_at":"2026-05-18T00:33:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01513","created_at":"2026-05-18T00:33:42Z"},{"alias_kind":"pith_short_12","alias_value":"ZRKSB33JRQZ4","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZRKSB33JRQZ4F5CK","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZRKSB33J","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:6f0fd60d3b43353091316b0fe08e113f85d4d9ce61db8092889e27c3773191d1","target":"graph","created_at":"2026-05-18T00:33:42Z","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":"Based on the problem of quantum data compression in a lossless way, we present here an operational interpretation for the family of quantum R\\'enyi entropies. In order to do this, we appeal to a very general quantum encoding scheme that satisfies a quantum version of the Kraft-McMillan inequality. Then, in the standard situation, where one is intended to minimize the usual average length of the quantum codewords, we recover the known results, namely that the von Neumann entropy of the source bounds the average length of the optimal codes. Otherwise, we show that by invoking an exponential aver","authors_text":"F. Holik, G. Bellomo, G.M. Bosyk, S. Zozor","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-10-04T09:12:50Z","title":"Lossless quantum data compression with exponential penalization: an operational interpretation of the quantum R\\'enyi entropy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01513","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:8de03824b282e16dcd50dce26edfd301b2a82ce6e4ab9f0633ef72c335d06af9","target":"record","created_at":"2026-05-18T00:33:42Z","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":"e9ce76f1ead9b56ec0ab54172c30f284ae306a4ee38fd6d9954d13998283a7f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-10-04T09:12:50Z","title_canon_sha256":"b8cd70093100ac357886452ec21550e1e57e068acf5077cc5f4ad1038c5f5377"},"schema_version":"1.0","source":{"id":"1710.01513","kind":"arxiv","version":1}},"canonical_sha256":"cc5520ef698c33c2f44a51399508ae9214cd18dfc578ada72273af2983dc7f35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc5520ef698c33c2f44a51399508ae9214cd18dfc578ada72273af2983dc7f35","first_computed_at":"2026-05-18T00:33:42.536558Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:42.536558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q3rhwxagm4X2iA5IFyKlIcOZkvv49gh3juTjukRsIUedZDqDD9+QZtfJ6skk5JVR6Hy58us8IYWCVlohCq/oBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:42.537209Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.01513","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8de03824b282e16dcd50dce26edfd301b2a82ce6e4ab9f0633ef72c335d06af9","sha256:6f0fd60d3b43353091316b0fe08e113f85d4d9ce61db8092889e27c3773191d1"],"state_sha256":"bb85d3c1059827399b802cb4145ba84a3e1686c7e2370b6e51eb05c7eaa3c720"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pr/uDcfwyF9JT+eJ0wMAff+pYX46t9bFQT5wC40c+18HrilZb/2xM6SmBOExQVDfQXiADFsniLWk93fYHGJQCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T07:11:27.335266Z","bundle_sha256":"2c438cfeb0e461c2e088124d460bd430a0e8100dbd89c3a4124ced629748fd0c"}}