{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:ES4NFZON2WIQVM4A6SHYS5XWFO","short_pith_number":"pith:ES4NFZON","canonical_record":{"source":{"id":"2106.00155","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-06-01T00:15:33Z","cross_cats_sorted":[],"title_canon_sha256":"ceb1dea0efc671f0ffb89c715cb9182d22d377b4e4306a84da5fd0a708d9fb45","abstract_canon_sha256":"c5d8cbf2ce529cb9da48c5dd5e5358a3c26d3be021b9ad33abff7a5cdca8ad17"},"schema_version":"1.0"},"canonical_sha256":"24b8d2e5cdd5910ab380f48f8976f62b84802ead0aadf7f7375cf0591b1c579c","source":{"kind":"arxiv","id":"2106.00155","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.00155","created_at":"2026-07-05T04:13:09Z"},{"alias_kind":"arxiv_version","alias_value":"2106.00155v2","created_at":"2026-07-05T04:13:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.00155","created_at":"2026-07-05T04:13:09Z"},{"alias_kind":"pith_short_12","alias_value":"ES4NFZON2WIQ","created_at":"2026-07-05T04:13:09Z"},{"alias_kind":"pith_short_16","alias_value":"ES4NFZON2WIQVM4A","created_at":"2026-07-05T04:13:09Z"},{"alias_kind":"pith_short_8","alias_value":"ES4NFZON","created_at":"2026-07-05T04:13:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:ES4NFZON2WIQVM4A6SHYS5XWFO","target":"record","payload":{"canonical_record":{"source":{"id":"2106.00155","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-06-01T00:15:33Z","cross_cats_sorted":[],"title_canon_sha256":"ceb1dea0efc671f0ffb89c715cb9182d22d377b4e4306a84da5fd0a708d9fb45","abstract_canon_sha256":"c5d8cbf2ce529cb9da48c5dd5e5358a3c26d3be021b9ad33abff7a5cdca8ad17"},"schema_version":"1.0"},"canonical_sha256":"24b8d2e5cdd5910ab380f48f8976f62b84802ead0aadf7f7375cf0591b1c579c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:13:09.908285Z","signature_b64":"LitMvucgPxCET/9SPLyq12yiuCDI7GYjgtLu8TbQZ7bWyoUv8zRW801EQwhAflUttMx7cmYMhOm3tzdQIwLnDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24b8d2e5cdd5910ab380f48f8976f62b84802ead0aadf7f7375cf0591b1c579c","last_reissued_at":"2026-07-05T04:13:09.907894Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:13:09.907894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2106.00155","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-07-05T04:13:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CDJ/WjOOT/vzVYenzgv/R0F5eNtO8l3qG9eJ/8ZG4XNSpVoS8Nsh13WLEwJyXRjUo8jJWNH/PvfKsIosLYY7BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-25T08:40:09.088098Z"},"content_sha256":"0cf2ad1275362826f512e49736a7d60481bb1ee814678da11f2add5232ee889f","schema_version":"1.0","event_id":"sha256:0cf2ad1275362826f512e49736a7d60481bb1ee814678da11f2add5232ee889f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:ES4NFZON2WIQVM4A6SHYS5XWFO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The geometry of Bloch space in the context of quantum random access codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Laura Man\\v{c}inska, Sigurd A. L. Storgaard","submitted_at":"2021-06-01T00:15:33Z","abstract_excerpt":"We study the communication protocol known as a Quantum Random Access Code (QRAC) which encodes $n$ classical bits into $m$ qubits ($m<n$) with a probability of recovering any of the initial $n$ bits of at least $p>\\tfrac{1}{2}$. Such a code is denoted by $(n,m,p)$-QRAC. If cooperation is allowed through a shared random string we call it a QRAC with shared randomness. We prove that for any $(n,m,p)$-QRAC with shared randomness the parameter $p$ is upper bounded by $ \\tfrac{1}{2}+\\tfrac{1}{2}\\sqrt{\\tfrac{2^{m-1}}{n}}$. For $m=2$ this gives a new bound of $p\\le \\tfrac{1}{2}+\\tfrac{1}{\\sqrt{2n}}$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.00155","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.00155/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:13:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+YvNh6biUzbY9zpeGIHjCmraXJsm8wWCvsfhv+onRv/M/83DVdTHACbY7aUc3E0aqvgsbnN+BnFMxxIU0pkWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-25T08:40:09.088492Z"},"content_sha256":"20cc30a8b9691365ad323152a9d673401fdb5f0f4214cdc50265ec7395c141b9","schema_version":"1.0","event_id":"sha256:20cc30a8b9691365ad323152a9d673401fdb5f0f4214cdc50265ec7395c141b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ES4NFZON2WIQVM4A6SHYS5XWFO/bundle.json","state_url":"https://pith.science/pith/ES4NFZON2WIQVM4A6SHYS5XWFO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ES4NFZON2WIQVM4A6SHYS5XWFO/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-25T08:40:09Z","links":{"resolver":"https://pith.science/pith/ES4NFZON2WIQVM4A6SHYS5XWFO","bundle":"https://pith.science/pith/ES4NFZON2WIQVM4A6SHYS5XWFO/bundle.json","state":"https://pith.science/pith/ES4NFZON2WIQVM4A6SHYS5XWFO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ES4NFZON2WIQVM4A6SHYS5XWFO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:ES4NFZON2WIQVM4A6SHYS5XWFO","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":"c5d8cbf2ce529cb9da48c5dd5e5358a3c26d3be021b9ad33abff7a5cdca8ad17","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-06-01T00:15:33Z","title_canon_sha256":"ceb1dea0efc671f0ffb89c715cb9182d22d377b4e4306a84da5fd0a708d9fb45"},"schema_version":"1.0","source":{"id":"2106.00155","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.00155","created_at":"2026-07-05T04:13:09Z"},{"alias_kind":"arxiv_version","alias_value":"2106.00155v2","created_at":"2026-07-05T04:13:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.00155","created_at":"2026-07-05T04:13:09Z"},{"alias_kind":"pith_short_12","alias_value":"ES4NFZON2WIQ","created_at":"2026-07-05T04:13:09Z"},{"alias_kind":"pith_short_16","alias_value":"ES4NFZON2WIQVM4A","created_at":"2026-07-05T04:13:09Z"},{"alias_kind":"pith_short_8","alias_value":"ES4NFZON","created_at":"2026-07-05T04:13:09Z"}],"graph_snapshots":[{"event_id":"sha256:20cc30a8b9691365ad323152a9d673401fdb5f0f4214cdc50265ec7395c141b9","target":"graph","created_at":"2026-07-05T04:13:09Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2106.00155/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the communication protocol known as a Quantum Random Access Code (QRAC) which encodes $n$ classical bits into $m$ qubits ($m<n$) with a probability of recovering any of the initial $n$ bits of at least $p>\\tfrac{1}{2}$. Such a code is denoted by $(n,m,p)$-QRAC. If cooperation is allowed through a shared random string we call it a QRAC with shared randomness. We prove that for any $(n,m,p)$-QRAC with shared randomness the parameter $p$ is upper bounded by $ \\tfrac{1}{2}+\\tfrac{1}{2}\\sqrt{\\tfrac{2^{m-1}}{n}}$. For $m=2$ this gives a new bound of $p\\le \\tfrac{1}{2}+\\tfrac{1}{\\sqrt{2n}}$ ","authors_text":"Laura Man\\v{c}inska, Sigurd A. L. Storgaard","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-06-01T00:15:33Z","title":"The geometry of Bloch space in the context of quantum random access codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.00155","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:0cf2ad1275362826f512e49736a7d60481bb1ee814678da11f2add5232ee889f","target":"record","created_at":"2026-07-05T04:13:09Z","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":"c5d8cbf2ce529cb9da48c5dd5e5358a3c26d3be021b9ad33abff7a5cdca8ad17","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-06-01T00:15:33Z","title_canon_sha256":"ceb1dea0efc671f0ffb89c715cb9182d22d377b4e4306a84da5fd0a708d9fb45"},"schema_version":"1.0","source":{"id":"2106.00155","kind":"arxiv","version":2}},"canonical_sha256":"24b8d2e5cdd5910ab380f48f8976f62b84802ead0aadf7f7375cf0591b1c579c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24b8d2e5cdd5910ab380f48f8976f62b84802ead0aadf7f7375cf0591b1c579c","first_computed_at":"2026-07-05T04:13:09.907894Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:13:09.907894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LitMvucgPxCET/9SPLyq12yiuCDI7GYjgtLu8TbQZ7bWyoUv8zRW801EQwhAflUttMx7cmYMhOm3tzdQIwLnDA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:13:09.908285Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.00155","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0cf2ad1275362826f512e49736a7d60481bb1ee814678da11f2add5232ee889f","sha256:20cc30a8b9691365ad323152a9d673401fdb5f0f4214cdc50265ec7395c141b9"],"state_sha256":"8073c5b54814b0b27fe376460c89bde1770b40b207ec3aa9a4dae5cb663b13a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1SpmdXRGfKbi7NyimljI9eTa6WnBrua9L+N3nB+I8h/FL7F+zkRCUraFQQMnXZxWvKKC33PjOQVA1EyIas/WBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-25T08:40:09.091207Z","bundle_sha256":"87d05fc94d4a85357e115ed278bca01352c651b33bf4a81cbe459d47452dab0c"}}