{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6US6342DW2YVLGJMU7MKBFN372","short_pith_number":"pith:6US6342D","schema_version":"1.0","canonical_sha256":"f525edf343b6b155992ca7d8a095bbfea3064d217dc95088d511831a2c3c54b7","source":{"kind":"arxiv","id":"1709.04898","version":2},"attestation_state":"computed","paper":{"title":"Connections Between Mutually Unbiased Bases and Quantum Random Access Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Edgar A. Aguilar, Jakub J. Borka{\\l}a, Marcin Paw{\\l}owski, Piotr Mironowicz","submitted_at":"2017-09-14T17:38:55Z","abstract_excerpt":"We present a new quantum communication complexity protocol, the promise--Quantum Random Access Code, which allows us to introduce a new measure of unbiasedness for bases of Hilbert spaces. The proposed measure possesses a clear operational meaning and can be used to investigate whether a specific number of mutually unbiased bases exist in a given dimension by employing Semi--Definite Programming techniques."},"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":"1709.04898","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-09-14T17:38:55Z","cross_cats_sorted":[],"title_canon_sha256":"691f2f7c40066fdf83e39d31fefb96acd75aeab400d261dff43f2e8ff8463ec3","abstract_canon_sha256":"5f5f151205634e1e5aa85540c3eef02edf9300a05fd0228d4eb37ad43368149f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:46.359643Z","signature_b64":"tdgDGLRzcb51FZT20TIsHHvXjxfZWZZw8KOlEwL+zhrphDFgP4y1e2P+uYBy6YrLCRfdjjCufSHzgNiE+dNeAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f525edf343b6b155992ca7d8a095bbfea3064d217dc95088d511831a2c3c54b7","last_reissued_at":"2026-05-18T00:08:46.359077Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:46.359077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Connections Between Mutually Unbiased Bases and Quantum Random Access Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Edgar A. Aguilar, Jakub J. Borka{\\l}a, Marcin Paw{\\l}owski, Piotr Mironowicz","submitted_at":"2017-09-14T17:38:55Z","abstract_excerpt":"We present a new quantum communication complexity protocol, the promise--Quantum Random Access Code, which allows us to introduce a new measure of unbiasedness for bases of Hilbert spaces. The proposed measure possesses a clear operational meaning and can be used to investigate whether a specific number of mutually unbiased bases exist in a given dimension by employing Semi--Definite Programming techniques."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04898","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":""},"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":"1709.04898","created_at":"2026-05-18T00:08:46.359150+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.04898v2","created_at":"2026-05-18T00:08:46.359150+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04898","created_at":"2026-05-18T00:08:46.359150+00:00"},{"alias_kind":"pith_short_12","alias_value":"6US6342DW2YV","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6US6342DW2YVLGJM","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6US6342D","created_at":"2026-05-18T12:31:03.183658+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/6US6342DW2YVLGJMU7MKBFN372","json":"https://pith.science/pith/6US6342DW2YVLGJMU7MKBFN372.json","graph_json":"https://pith.science/api/pith-number/6US6342DW2YVLGJMU7MKBFN372/graph.json","events_json":"https://pith.science/api/pith-number/6US6342DW2YVLGJMU7MKBFN372/events.json","paper":"https://pith.science/paper/6US6342D"},"agent_actions":{"view_html":"https://pith.science/pith/6US6342DW2YVLGJMU7MKBFN372","download_json":"https://pith.science/pith/6US6342DW2YVLGJMU7MKBFN372.json","view_paper":"https://pith.science/paper/6US6342D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.04898&json=true","fetch_graph":"https://pith.science/api/pith-number/6US6342DW2YVLGJMU7MKBFN372/graph.json","fetch_events":"https://pith.science/api/pith-number/6US6342DW2YVLGJMU7MKBFN372/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6US6342DW2YVLGJMU7MKBFN372/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6US6342DW2YVLGJMU7MKBFN372/action/storage_attestation","attest_author":"https://pith.science/pith/6US6342DW2YVLGJMU7MKBFN372/action/author_attestation","sign_citation":"https://pith.science/pith/6US6342DW2YVLGJMU7MKBFN372/action/citation_signature","submit_replication":"https://pith.science/pith/6US6342DW2YVLGJMU7MKBFN372/action/replication_record"}},"created_at":"2026-05-18T00:08:46.359150+00:00","updated_at":"2026-05-18T00:08:46.359150+00:00"}