{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MAAG4RHTQ3PLEL7ZTF7QHMWNZQ","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":"ad0b3818b1a7a5c63fe576049b41fda22a7b69f9ca02a1a2c7c0cd0b03f88dff","cross_cats_sorted":["math-ph","math.MP"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-10T21:41:58Z","title_canon_sha256":"767b0b5e69d3972bd50602dd9e28c3b7d265db898c77dc74a35a0f40641dc614"},"schema_version":"1.0","source":{"id":"2606.12700","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.12700","created_at":"2026-06-12T01:08:46Z"},{"alias_kind":"arxiv_version","alias_value":"2606.12700v1","created_at":"2026-06-12T01:08:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12700","created_at":"2026-06-12T01:08:46Z"},{"alias_kind":"pith_short_12","alias_value":"MAAG4RHTQ3PL","created_at":"2026-06-12T01:08:46Z"},{"alias_kind":"pith_short_16","alias_value":"MAAG4RHTQ3PLEL7Z","created_at":"2026-06-12T01:08:46Z"},{"alias_kind":"pith_short_8","alias_value":"MAAG4RHT","created_at":"2026-06-12T01:08:46Z"}],"graph_snapshots":[{"event_id":"sha256:480d746b150e60a40675f22fc5df9e3b45c0fa3c6baa221e1156df956b7ee9f9","target":"graph","created_at":"2026-06-12T01:08:46Z","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/2606.12700/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum random access codes (QRACs) ask how well N classical bits can be encoded into M qubits while allowing any single bit to be recovered. Although the Nayak bound remains the standard general upper bound on the decoding probability, numerical evidence suggests a stronger upper bound in the small-qubit regime.\n  In this work, we formulate the optimal decoding probability in terms of decoding measurements, reformulating QRAC design as a spectral problem for noncommuting measurements. Using this formulation, we give an elementary proof of the Nayak bound by simplifying the Chernoff-bound argu","authors_text":"Kosei Teramoto, Rudy Raymond, Seiseki Akibue, Suguru Tamaki","cross_cats":["math-ph","math.MP"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-10T21:41:58Z","title":"Measurement Geometry for Quantum Random Access Codes: Beyond Nayak Bound and Toward Optimality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.12700","kind":"arxiv","version":1},"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:70c8bfe6d0cbe0be3f1307464bbc31bb765e0397d322493dbc189be9ca767730","target":"record","created_at":"2026-06-12T01:08:46Z","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":"ad0b3818b1a7a5c63fe576049b41fda22a7b69f9ca02a1a2c7c0cd0b03f88dff","cross_cats_sorted":["math-ph","math.MP"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-10T21:41:58Z","title_canon_sha256":"767b0b5e69d3972bd50602dd9e28c3b7d265db898c77dc74a35a0f40641dc614"},"schema_version":"1.0","source":{"id":"2606.12700","kind":"arxiv","version":1}},"canonical_sha256":"60006e44f386deb22ff9997f03b2cdcc17e8d26e8836f00ca0ccefdea7c95198","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60006e44f386deb22ff9997f03b2cdcc17e8d26e8836f00ca0ccefdea7c95198","first_computed_at":"2026-06-12T01:08:46.162586Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-12T01:08:46.162586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d8JguFTkjQo8xK5jcz3aD1mxG8cIr6ZzNo78njY5FdGiB3fixTSmai4yIvmVKtGnG+FCexpmeMBiIdo8aCarDw==","signature_status":"signed_v1","signed_at":"2026-06-12T01:08:46.163496Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.12700","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70c8bfe6d0cbe0be3f1307464bbc31bb765e0397d322493dbc189be9ca767730","sha256:480d746b150e60a40675f22fc5df9e3b45c0fa3c6baa221e1156df956b7ee9f9"],"state_sha256":"417e24600a2c7d7712545d1f7779b2ee65b298dda660a0b825cb709c1bd434fe"}