{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:ZNAO3J5GNA3WSOI2JZHJKHEVVI","short_pith_number":"pith:ZNAO3J5G","canonical_record":{"source":{"id":"2312.14142","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-12-21T18:57:55Z","cross_cats_sorted":[],"title_canon_sha256":"3991b21ec222e01c61438b74e5d1c50e778334074e17c5cf2a117e60c43443f7","abstract_canon_sha256":"2345eaeaa1288e774bfd4e87cc338bf2c562b667de43e9a79f339c1d7cc2e4b8"},"schema_version":"1.0"},"canonical_sha256":"cb40eda7a6683769391a4e4e951c95aa24c8a9c57a9bf0b339a2907ede9f983b","source":{"kind":"arxiv","id":"2312.14142","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.14142","created_at":"2026-07-05T10:19:54Z"},{"alias_kind":"arxiv_version","alias_value":"2312.14142v3","created_at":"2026-07-05T10:19:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.14142","created_at":"2026-07-05T10:19:54Z"},{"alias_kind":"pith_short_12","alias_value":"ZNAO3J5GNA3W","created_at":"2026-07-05T10:19:54Z"},{"alias_kind":"pith_short_16","alias_value":"ZNAO3J5GNA3WSOI2","created_at":"2026-07-05T10:19:54Z"},{"alias_kind":"pith_short_8","alias_value":"ZNAO3J5G","created_at":"2026-07-05T10:19:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:ZNAO3J5GNA3WSOI2JZHJKHEVVI","target":"record","payload":{"canonical_record":{"source":{"id":"2312.14142","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-12-21T18:57:55Z","cross_cats_sorted":[],"title_canon_sha256":"3991b21ec222e01c61438b74e5d1c50e778334074e17c5cf2a117e60c43443f7","abstract_canon_sha256":"2345eaeaa1288e774bfd4e87cc338bf2c562b667de43e9a79f339c1d7cc2e4b8"},"schema_version":"1.0"},"canonical_sha256":"cb40eda7a6683769391a4e4e951c95aa24c8a9c57a9bf0b339a2907ede9f983b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:19:54.769106Z","signature_b64":"6MnV7xxHRgRquKXCQLJJbPNWua99oVNGaLHONLjBveefwhPFxXR2an9gWWW31vW34wowe9kV0KqIc99w7y/ECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb40eda7a6683769391a4e4e951c95aa24c8a9c57a9bf0b339a2907ede9f983b","last_reissued_at":"2026-07-05T10:19:54.768577Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:19:54.768577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2312.14142","source_version":3,"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-05T10:19:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g55iJ/kWmZIjsbIUi69q9mxfBRyVJIxBgYS+nsqeG+ANVgSHEajAFT4K4EW3TmT+SW53N5i/xiPIU2u0G/UODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T14:18:12.863716Z"},"content_sha256":"523eaf778228781139aec1d86877572d9e6907d1d83b46376ac0a5d22f01ade0","schema_version":"1.0","event_id":"sha256:523eaf778228781139aec1d86877572d9e6907d1d83b46376ac0a5d22f01ade0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:ZNAO3J5GNA3WSOI2JZHJKHEVVI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simple and general bounds on quantum random access codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Armin Tavakoli, M\\'at\\'e Farkas, Nikolai Miklin","submitted_at":"2023-12-21T18:57:55Z","abstract_excerpt":"Random access codes are a type of communication task that is widely used in quantum information science. The optimal average success probability that can be achieved through classical strategies is known for any random access code. However, only a few cases are solved exactly for quantum random access codes. In this paper, we provide bounds for the fully general setting of n independent variables, each selected from a d-dimensional classical alphabet and encoded in a D-dimensional quantum system subject to an arbitrary quantum measurement. The bound recovers the exactly known special cases, an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.14142","kind":"arxiv","version":3},"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/2312.14142/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-05T10:19:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xGHX8VL9HTeiBpaShV9/3TdDCYClTPD42uCGziAr9ojrsrSLx6gWkJkgr14Fs+6sphELcTtZXFjA9Qa4BT68AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T14:18:12.864271Z"},"content_sha256":"c408324c99732c15e5f1c61e7bdf1bd963efc1ef0d001dc581f2dd035a5ca819","schema_version":"1.0","event_id":"sha256:c408324c99732c15e5f1c61e7bdf1bd963efc1ef0d001dc581f2dd035a5ca819"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZNAO3J5GNA3WSOI2JZHJKHEVVI/bundle.json","state_url":"https://pith.science/pith/ZNAO3J5GNA3WSOI2JZHJKHEVVI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZNAO3J5GNA3WSOI2JZHJKHEVVI/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-08-20T14:18:12Z","links":{"resolver":"https://pith.science/pith/ZNAO3J5GNA3WSOI2JZHJKHEVVI","bundle":"https://pith.science/pith/ZNAO3J5GNA3WSOI2JZHJKHEVVI/bundle.json","state":"https://pith.science/pith/ZNAO3J5GNA3WSOI2JZHJKHEVVI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZNAO3J5GNA3WSOI2JZHJKHEVVI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:ZNAO3J5GNA3WSOI2JZHJKHEVVI","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":"2345eaeaa1288e774bfd4e87cc338bf2c562b667de43e9a79f339c1d7cc2e4b8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-12-21T18:57:55Z","title_canon_sha256":"3991b21ec222e01c61438b74e5d1c50e778334074e17c5cf2a117e60c43443f7"},"schema_version":"1.0","source":{"id":"2312.14142","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.14142","created_at":"2026-07-05T10:19:54Z"},{"alias_kind":"arxiv_version","alias_value":"2312.14142v3","created_at":"2026-07-05T10:19:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.14142","created_at":"2026-07-05T10:19:54Z"},{"alias_kind":"pith_short_12","alias_value":"ZNAO3J5GNA3W","created_at":"2026-07-05T10:19:54Z"},{"alias_kind":"pith_short_16","alias_value":"ZNAO3J5GNA3WSOI2","created_at":"2026-07-05T10:19:54Z"},{"alias_kind":"pith_short_8","alias_value":"ZNAO3J5G","created_at":"2026-07-05T10:19:54Z"}],"graph_snapshots":[{"event_id":"sha256:c408324c99732c15e5f1c61e7bdf1bd963efc1ef0d001dc581f2dd035a5ca819","target":"graph","created_at":"2026-07-05T10:19:54Z","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/2312.14142/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Random access codes are a type of communication task that is widely used in quantum information science. The optimal average success probability that can be achieved through classical strategies is known for any random access code. However, only a few cases are solved exactly for quantum random access codes. In this paper, we provide bounds for the fully general setting of n independent variables, each selected from a d-dimensional classical alphabet and encoded in a D-dimensional quantum system subject to an arbitrary quantum measurement. The bound recovers the exactly known special cases, an","authors_text":"Armin Tavakoli, M\\'at\\'e Farkas, Nikolai Miklin","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-12-21T18:57:55Z","title":"Simple and general bounds on quantum random access codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.14142","kind":"arxiv","version":3},"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:523eaf778228781139aec1d86877572d9e6907d1d83b46376ac0a5d22f01ade0","target":"record","created_at":"2026-07-05T10:19:54Z","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":"2345eaeaa1288e774bfd4e87cc338bf2c562b667de43e9a79f339c1d7cc2e4b8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-12-21T18:57:55Z","title_canon_sha256":"3991b21ec222e01c61438b74e5d1c50e778334074e17c5cf2a117e60c43443f7"},"schema_version":"1.0","source":{"id":"2312.14142","kind":"arxiv","version":3}},"canonical_sha256":"cb40eda7a6683769391a4e4e951c95aa24c8a9c57a9bf0b339a2907ede9f983b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb40eda7a6683769391a4e4e951c95aa24c8a9c57a9bf0b339a2907ede9f983b","first_computed_at":"2026-07-05T10:19:54.768577Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:19:54.768577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6MnV7xxHRgRquKXCQLJJbPNWua99oVNGaLHONLjBveefwhPFxXR2an9gWWW31vW34wowe9kV0KqIc99w7y/ECg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:19:54.769106Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.14142","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:523eaf778228781139aec1d86877572d9e6907d1d83b46376ac0a5d22f01ade0","sha256:c408324c99732c15e5f1c61e7bdf1bd963efc1ef0d001dc581f2dd035a5ca819"],"state_sha256":"adf7b20e28892a791c28c87bfadf07e8e84a9d48fb2f3996e8e086c7efad6db8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6iRiYx6d307YvvNmR7fV6TTzPi0L16/YIKq69mJDsrFolPTNVQR2LQJj3Xybcf5sRdCnY/mxLw4ywBzw4rqiCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T14:18:12.869254Z","bundle_sha256":"819acee3d11159b9b4382a5443cdda5a0315bd72df1588832bf1dfdae268c771"}}