{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KBVVX7NNQSVMSEWODF5VW777IA","short_pith_number":"pith:KBVVX7NN","canonical_record":{"source":{"id":"1607.02667","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-07-09T21:26:12Z","cross_cats_sorted":[],"title_canon_sha256":"0a820d1bfbcd97798b983a8334c3e4297ac0c49ad3119996f0017973af61c55f","abstract_canon_sha256":"38f4fae513f5fe3ef0af9bb133cdab66ba1664a0841a40a3f8613c896685aecb"},"schema_version":"1.0"},"canonical_sha256":"506b5bfdad84aac912ce197b5b7fff403fec9bf4b470ad71974b09d6b7e64acd","source":{"kind":"arxiv","id":"1607.02667","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02667","created_at":"2026-05-18T00:44:24Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02667v2","created_at":"2026-05-18T00:44:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02667","created_at":"2026-05-18T00:44:24Z"},{"alias_kind":"pith_short_12","alias_value":"KBVVX7NNQSVM","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KBVVX7NNQSVMSEWO","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KBVVX7NN","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KBVVX7NNQSVMSEWODF5VW777IA","target":"record","payload":{"canonical_record":{"source":{"id":"1607.02667","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-07-09T21:26:12Z","cross_cats_sorted":[],"title_canon_sha256":"0a820d1bfbcd97798b983a8334c3e4297ac0c49ad3119996f0017973af61c55f","abstract_canon_sha256":"38f4fae513f5fe3ef0af9bb133cdab66ba1664a0841a40a3f8613c896685aecb"},"schema_version":"1.0"},"canonical_sha256":"506b5bfdad84aac912ce197b5b7fff403fec9bf4b470ad71974b09d6b7e64acd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:24.600663Z","signature_b64":"JA8HvAqe3K7kKjctChB9T1Pt5z9bybZrxeS/ScE6MfUH0zAk9Bv+TSy88zEJ37qvhyY0M9Dm8RuagsnXXHyzBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"506b5bfdad84aac912ce197b5b7fff403fec9bf4b470ad71974b09d6b7e64acd","last_reissued_at":"2026-05-18T00:44:24.600200Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:24.600200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.02667","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-18T00:44:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/p1tBb2HQwMIm/u3SPXNcuJ6l9ThrDR6xl7TfFdU7gwD8waivcu1/g3sRAowjwkTFt4Ba7S1mHjA6ttrWFxpBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T15:24:51.728281Z"},"content_sha256":"8ccc9f4f02d097a7411fc1d136455e9034b5a1840a18a5e1a42eeac824293277","schema_version":"1.0","event_id":"sha256:8ccc9f4f02d097a7411fc1d136455e9034b5a1840a18a5e1a42eeac824293277"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KBVVX7NNQSVMSEWODF5VW777IA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Classical and Quantum Random Access Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ola Liab{\\o}tr{\\o}","submitted_at":"2016-07-09T21:26:12Z","abstract_excerpt":"A (Quantum) Random Access Code ((Q)RAC) is a scheme that encodes $n$ bits into $m$ (qu)bits such that any of the $n$ bits can be recovered with a worst case probability $p>\\frac{1}{2}$. Such a code is denoted by the triple $(n,m,p)$. It is known that $n<4^m$ for all QRACs and $n<2^m$ for classical RACs. These bounds are also known to be tight, as explicit constructions exist for $n=4^m-1$ and $n=2^m-1$ for quantum and classical codes respectively. We generalize (Q)RACs to a scheme encoding $n$ $d$-levels into $m$ (qu)-$d$-levels such that any $d$-level can be recovered with the probability for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02667","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-18T00:44:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FA1tAmkmfyBJ9T3129fL0tDG5ZHoQb0l37/zh3AaEJlcgT3PMZECBCe1GODTTYSaGxxVtcuo+xkpHiZh1Is+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T15:24:51.728635Z"},"content_sha256":"f24a4afd8033e5748d587c09ba494a1febb283f3f01879d51486eb2dd9841c04","schema_version":"1.0","event_id":"sha256:f24a4afd8033e5748d587c09ba494a1febb283f3f01879d51486eb2dd9841c04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KBVVX7NNQSVMSEWODF5VW777IA/bundle.json","state_url":"https://pith.science/pith/KBVVX7NNQSVMSEWODF5VW777IA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KBVVX7NNQSVMSEWODF5VW777IA/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-07-03T15:24:51Z","links":{"resolver":"https://pith.science/pith/KBVVX7NNQSVMSEWODF5VW777IA","bundle":"https://pith.science/pith/KBVVX7NNQSVMSEWODF5VW777IA/bundle.json","state":"https://pith.science/pith/KBVVX7NNQSVMSEWODF5VW777IA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KBVVX7NNQSVMSEWODF5VW777IA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KBVVX7NNQSVMSEWODF5VW777IA","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":"38f4fae513f5fe3ef0af9bb133cdab66ba1664a0841a40a3f8613c896685aecb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-07-09T21:26:12Z","title_canon_sha256":"0a820d1bfbcd97798b983a8334c3e4297ac0c49ad3119996f0017973af61c55f"},"schema_version":"1.0","source":{"id":"1607.02667","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02667","created_at":"2026-05-18T00:44:24Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02667v2","created_at":"2026-05-18T00:44:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02667","created_at":"2026-05-18T00:44:24Z"},{"alias_kind":"pith_short_12","alias_value":"KBVVX7NNQSVM","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KBVVX7NNQSVMSEWO","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KBVVX7NN","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:f24a4afd8033e5748d587c09ba494a1febb283f3f01879d51486eb2dd9841c04","target":"graph","created_at":"2026-05-18T00:44:24Z","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":"A (Quantum) Random Access Code ((Q)RAC) is a scheme that encodes $n$ bits into $m$ (qu)bits such that any of the $n$ bits can be recovered with a worst case probability $p>\\frac{1}{2}$. Such a code is denoted by the triple $(n,m,p)$. It is known that $n<4^m$ for all QRACs and $n<2^m$ for classical RACs. These bounds are also known to be tight, as explicit constructions exist for $n=4^m-1$ and $n=2^m-1$ for quantum and classical codes respectively. We generalize (Q)RACs to a scheme encoding $n$ $d$-levels into $m$ (qu)-$d$-levels such that any $d$-level can be recovered with the probability for","authors_text":"Ola Liab{\\o}tr{\\o}","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-07-09T21:26:12Z","title":"Improved Classical and Quantum Random Access Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02667","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:8ccc9f4f02d097a7411fc1d136455e9034b5a1840a18a5e1a42eeac824293277","target":"record","created_at":"2026-05-18T00:44:24Z","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":"38f4fae513f5fe3ef0af9bb133cdab66ba1664a0841a40a3f8613c896685aecb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-07-09T21:26:12Z","title_canon_sha256":"0a820d1bfbcd97798b983a8334c3e4297ac0c49ad3119996f0017973af61c55f"},"schema_version":"1.0","source":{"id":"1607.02667","kind":"arxiv","version":2}},"canonical_sha256":"506b5bfdad84aac912ce197b5b7fff403fec9bf4b470ad71974b09d6b7e64acd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"506b5bfdad84aac912ce197b5b7fff403fec9bf4b470ad71974b09d6b7e64acd","first_computed_at":"2026-05-18T00:44:24.600200Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:24.600200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JA8HvAqe3K7kKjctChB9T1Pt5z9bybZrxeS/ScE6MfUH0zAk9Bv+TSy88zEJ37qvhyY0M9Dm8RuagsnXXHyzBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:24.600663Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.02667","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ccc9f4f02d097a7411fc1d136455e9034b5a1840a18a5e1a42eeac824293277","sha256:f24a4afd8033e5748d587c09ba494a1febb283f3f01879d51486eb2dd9841c04"],"state_sha256":"908c8d6e5d17c9571dd2474b83332b7fcf4e5b44dce43b58fc856cb7c02b1b37"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DLYfHmmSt1oM/9+gumYEjecIdfGwjDZ1188N7JzJ3Q1GSWqXIE1X56psVhFx6aLEAUCaKFoLxt9yhf5ujsp+AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T15:24:51.730581Z","bundle_sha256":"e83b32eb56d3a8bd6981aebf111411bf7012ba744c00c5d150cf54a0f7242d40"}}