{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:AOHPJK3H5A3NKQ4ZZAWXWYJJCV","short_pith_number":"pith:AOHPJK3H","schema_version":"1.0","canonical_sha256":"038ef4ab67e836d54399c82d7b612915772d65fed5e7fc3b06094aa2df96fe7f","source":{"kind":"arxiv","id":"2601.19190","version":1},"attestation_state":"computed","paper":{"title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Takayuki Suzuki","submitted_at":"2026-01-27T04:43:43Z","abstract_excerpt":"Quantum Random Access Codes (QRACs) embody the fundamental trade-off between the compressibility of information into limited quantum resources and the accessibility of that information, serving as a cornerstone of quantum communication and computation. In particular, the $(n, n-1)$-QRACs, which encode $n$ bits of classical information into $n-1$ qubits, provides an ideal theoretical model for verifying quantum advantage in high-dimensional spaces; however, the analytical derivation of optimal codes for general $n$ has remained an open problem. In this paper, we establish an analytical construc"},"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":"2601.19190","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-01-27T04:43:43Z","cross_cats_sorted":[],"title_canon_sha256":"555005eca9ec778e6e635f20293cde9fb045acbfd4e8ff6ea9d9160d01a1f580","abstract_canon_sha256":"5b3d92d195b03df5fe31432702bdb3656dfd291110c3a65073e0d6107430516e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T01:15:48.814901Z","signature_b64":"mlvJnDD6YORhpTnAMcF9W+MyxsNJVgZ4KUm5FQ8c4gMHYCEX8DcXCNQ1/wAht+N+Y3qHTqgf25cnV2GM0WYUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"038ef4ab67e836d54399c82d7b612915772d65fed5e7fc3b06094aa2df96fe7f","last_reissued_at":"2026-06-26T01:15:48.814418Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T01:15:48.814418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Takayuki Suzuki","submitted_at":"2026-01-27T04:43:43Z","abstract_excerpt":"Quantum Random Access Codes (QRACs) embody the fundamental trade-off between the compressibility of information into limited quantum resources and the accessibility of that information, serving as a cornerstone of quantum communication and computation. In particular, the $(n, n-1)$-QRACs, which encode $n$ bits of classical information into $n-1$ qubits, provides an ideal theoretical model for verifying quantum advantage in high-dimensional spaces; however, the analytical derivation of optimal codes for general $n$ has remained an open problem. In this paper, we establish an analytical construc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.19190","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2601.19190/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":"2601.19190","created_at":"2026-06-26T01:15:48.814477+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.19190v1","created_at":"2026-06-26T01:15:48.814477+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.19190","created_at":"2026-06-26T01:15:48.814477+00:00"},{"alias_kind":"pith_short_12","alias_value":"AOHPJK3H5A3N","created_at":"2026-06-26T01:15:48.814477+00:00"},{"alias_kind":"pith_short_16","alias_value":"AOHPJK3H5A3NKQ4Z","created_at":"2026-06-26T01:15:48.814477+00:00"},{"alias_kind":"pith_short_8","alias_value":"AOHPJK3H","created_at":"2026-06-26T01:15:48.814477+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2604.21274","citing_title":"Random Access Codes: Explicit Constructions, Optimality, and Classical-Quantum Gaps","ref_index":23,"is_internal_anchor":true},{"citing_arxiv_id":"2604.21274","citing_title":"Random Access Codes: Explicit Constructions, Optimality, and Classical-Quantum Gaps","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AOHPJK3H5A3NKQ4ZZAWXWYJJCV","json":"https://pith.science/pith/AOHPJK3H5A3NKQ4ZZAWXWYJJCV.json","graph_json":"https://pith.science/api/pith-number/AOHPJK3H5A3NKQ4ZZAWXWYJJCV/graph.json","events_json":"https://pith.science/api/pith-number/AOHPJK3H5A3NKQ4ZZAWXWYJJCV/events.json","paper":"https://pith.science/paper/AOHPJK3H"},"agent_actions":{"view_html":"https://pith.science/pith/AOHPJK3H5A3NKQ4ZZAWXWYJJCV","download_json":"https://pith.science/pith/AOHPJK3H5A3NKQ4ZZAWXWYJJCV.json","view_paper":"https://pith.science/paper/AOHPJK3H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.19190&json=true","fetch_graph":"https://pith.science/api/pith-number/AOHPJK3H5A3NKQ4ZZAWXWYJJCV/graph.json","fetch_events":"https://pith.science/api/pith-number/AOHPJK3H5A3NKQ4ZZAWXWYJJCV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AOHPJK3H5A3NKQ4ZZAWXWYJJCV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AOHPJK3H5A3NKQ4ZZAWXWYJJCV/action/storage_attestation","attest_author":"https://pith.science/pith/AOHPJK3H5A3NKQ4ZZAWXWYJJCV/action/author_attestation","sign_citation":"https://pith.science/pith/AOHPJK3H5A3NKQ4ZZAWXWYJJCV/action/citation_signature","submit_replication":"https://pith.science/pith/AOHPJK3H5A3NKQ4ZZAWXWYJJCV/action/replication_record"}},"created_at":"2026-06-26T01:15:48.814477+00:00","updated_at":"2026-06-26T01:15:48.814477+00:00"}