{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LNKBF5X6FBCILUFJWXFS3QSGP5","short_pith_number":"pith:LNKBF5X6","schema_version":"1.0","canonical_sha256":"5b5412f6fe284485d0a9b5cb2dc2467f41d5661d497bd88a69e03e212af02348","source":{"kind":"arxiv","id":"1510.03045","version":4},"attestation_state":"computed","paper":{"title":"Quantum Advantages in (n,d)->1 Random Access Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis, Ashutosh Rai, Dmitry Kravchenko, Joonwoo Bae, Sk Sazim","submitted_at":"2015-10-11T12:27:51Z","abstract_excerpt":"A random access code (RAC), corresponding to a communication primitive with various applications in quantum information theory, is an instance of a preparation-and-measurement scenario. In this work, we consider (n,d)-RACs constituting an \"n\"-length string, constructed from a \"d\" size set of letters, and send an encoding of the string in a single d-level physical system and present their quantum advantages. We first characterize optimal classical RACs, proving that the well-known classical strategy known as majority-encoding-identity-decoding is indeed optimal. We then construct a quantum prot"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1510.03045","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-10-11T12:27:51Z","cross_cats_sorted":["cs.CC","cs.IT","math.IT"],"title_canon_sha256":"323b6e2c1ad4187a46806660f3dbfdbb954d243af110f34a250b66d7689d0b73","abstract_canon_sha256":"b9f73d33feda59a1821158d4b3598c0937e74fcd4490bee0676f25eaf0f39421"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:52:05.904063Z","signature_b64":"8FA26ATIIEaRfa/i5EAWbA9CdJh5sPciHacN4Zco/2umdUezAwIbBkHUXCiCZSY3OdN15tNGJD0B1WHUOx+dBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b5412f6fe284485d0a9b5cb2dc2467f41d5661d497bd88a69e03e212af02348","last_reissued_at":"2026-07-05T09:52:05.903626Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:52:05.903626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Advantages in (n,d)->1 Random Access Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis, Ashutosh Rai, Dmitry Kravchenko, Joonwoo Bae, Sk Sazim","submitted_at":"2015-10-11T12:27:51Z","abstract_excerpt":"A random access code (RAC), corresponding to a communication primitive with various applications in quantum information theory, is an instance of a preparation-and-measurement scenario. In this work, we consider (n,d)-RACs constituting an \"n\"-length string, constructed from a \"d\" size set of letters, and send an encoding of the string in a single d-level physical system and present their quantum advantages. We first characterize optimal classical RACs, proving that the well-known classical strategy known as majority-encoding-identity-decoding is indeed optimal. We then construct a quantum prot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03045","kind":"arxiv","version":4},"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/1510.03045/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1510.03045","created_at":"2026-07-05T09:52:05.903681+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.03045v4","created_at":"2026-07-05T09:52:05.903681+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03045","created_at":"2026-07-05T09:52:05.903681+00:00"},{"alias_kind":"pith_short_12","alias_value":"LNKBF5X6FBCI","created_at":"2026-07-05T09:52:05.903681+00:00"},{"alias_kind":"pith_short_16","alias_value":"LNKBF5X6FBCILUFJ","created_at":"2026-07-05T09:52:05.903681+00:00"},{"alias_kind":"pith_short_8","alias_value":"LNKBF5X6","created_at":"2026-07-05T09:52:05.903681+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LNKBF5X6FBCILUFJWXFS3QSGP5","json":"https://pith.science/pith/LNKBF5X6FBCILUFJWXFS3QSGP5.json","graph_json":"https://pith.science/api/pith-number/LNKBF5X6FBCILUFJWXFS3QSGP5/graph.json","events_json":"https://pith.science/api/pith-number/LNKBF5X6FBCILUFJWXFS3QSGP5/events.json","paper":"https://pith.science/paper/LNKBF5X6"},"agent_actions":{"view_html":"https://pith.science/pith/LNKBF5X6FBCILUFJWXFS3QSGP5","download_json":"https://pith.science/pith/LNKBF5X6FBCILUFJWXFS3QSGP5.json","view_paper":"https://pith.science/paper/LNKBF5X6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.03045&json=true","fetch_graph":"https://pith.science/api/pith-number/LNKBF5X6FBCILUFJWXFS3QSGP5/graph.json","fetch_events":"https://pith.science/api/pith-number/LNKBF5X6FBCILUFJWXFS3QSGP5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LNKBF5X6FBCILUFJWXFS3QSGP5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LNKBF5X6FBCILUFJWXFS3QSGP5/action/storage_attestation","attest_author":"https://pith.science/pith/LNKBF5X6FBCILUFJWXFS3QSGP5/action/author_attestation","sign_citation":"https://pith.science/pith/LNKBF5X6FBCILUFJWXFS3QSGP5/action/citation_signature","submit_replication":"https://pith.science/pith/LNKBF5X6FBCILUFJWXFS3QSGP5/action/replication_record"}},"created_at":"2026-07-05T09:52:05.903681+00:00","updated_at":"2026-07-05T09:52:05.903681+00:00"}