{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ARNIEYS4B4Z3LD3QGH6TUN6OSP","short_pith_number":"pith:ARNIEYS4","schema_version":"1.0","canonical_sha256":"045a82625c0f33b58f7031fd3a37ce93cf271eaec82ccd9738d17484761a5bfd","source":{"kind":"arxiv","id":"1401.4643","version":1},"attestation_state":"computed","paper":{"title":"On Two Ways to Look for Mutually Unbiased Bases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Maurice Robert Kibler (IPNL)","submitted_at":"2014-01-19T08:01:22Z","abstract_excerpt":"Two equivalent ways of looking for mutually unbiased bases are discussed in this note. The passage from the search for d+1 mutually unbiased bases in C(d) to the search for d(d+1) vectors in C(d*d) satisfying constraint relations is clarified. Symmetric informationally complete positive-operator-valued measures are briefly discussed in a similar vein."},"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":"1401.4643","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-01-19T08:01:22Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"b27de7619719ed76f8fe9991c7bf29752c8aeb53bef9d2c29b1ccdc8319c8d56","abstract_canon_sha256":"6e832c72b46e94d09bd1980bee7285f9675169ed87199e9929c65711515f2bfc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:41.611094Z","signature_b64":"hGCrIqSNzFTaWGbunuK7OiTToFDKacMNPVfObckNLnVmL+ieJcPAXFykaIfpVdG0r9BwBMpTm9nWCkdfZ1sUAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"045a82625c0f33b58f7031fd3a37ce93cf271eaec82ccd9738d17484761a5bfd","last_reissued_at":"2026-05-18T02:52:41.610509Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:41.610509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Two Ways to Look for Mutually Unbiased Bases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Maurice Robert Kibler (IPNL)","submitted_at":"2014-01-19T08:01:22Z","abstract_excerpt":"Two equivalent ways of looking for mutually unbiased bases are discussed in this note. The passage from the search for d+1 mutually unbiased bases in C(d) to the search for d(d+1) vectors in C(d*d) satisfying constraint relations is clarified. Symmetric informationally complete positive-operator-valued measures are briefly discussed in a similar vein."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4643","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":""},"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":"1401.4643","created_at":"2026-05-18T02:52:41.610589+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.4643v1","created_at":"2026-05-18T02:52:41.610589+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4643","created_at":"2026-05-18T02:52:41.610589+00:00"},{"alias_kind":"pith_short_12","alias_value":"ARNIEYS4B4Z3","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"ARNIEYS4B4Z3LD3Q","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"ARNIEYS4","created_at":"2026-05-18T12:28:19.803747+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/ARNIEYS4B4Z3LD3QGH6TUN6OSP","json":"https://pith.science/pith/ARNIEYS4B4Z3LD3QGH6TUN6OSP.json","graph_json":"https://pith.science/api/pith-number/ARNIEYS4B4Z3LD3QGH6TUN6OSP/graph.json","events_json":"https://pith.science/api/pith-number/ARNIEYS4B4Z3LD3QGH6TUN6OSP/events.json","paper":"https://pith.science/paper/ARNIEYS4"},"agent_actions":{"view_html":"https://pith.science/pith/ARNIEYS4B4Z3LD3QGH6TUN6OSP","download_json":"https://pith.science/pith/ARNIEYS4B4Z3LD3QGH6TUN6OSP.json","view_paper":"https://pith.science/paper/ARNIEYS4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.4643&json=true","fetch_graph":"https://pith.science/api/pith-number/ARNIEYS4B4Z3LD3QGH6TUN6OSP/graph.json","fetch_events":"https://pith.science/api/pith-number/ARNIEYS4B4Z3LD3QGH6TUN6OSP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ARNIEYS4B4Z3LD3QGH6TUN6OSP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ARNIEYS4B4Z3LD3QGH6TUN6OSP/action/storage_attestation","attest_author":"https://pith.science/pith/ARNIEYS4B4Z3LD3QGH6TUN6OSP/action/author_attestation","sign_citation":"https://pith.science/pith/ARNIEYS4B4Z3LD3QGH6TUN6OSP/action/citation_signature","submit_replication":"https://pith.science/pith/ARNIEYS4B4Z3LD3QGH6TUN6OSP/action/replication_record"}},"created_at":"2026-05-18T02:52:41.610589+00:00","updated_at":"2026-05-18T02:52:41.610589+00:00"}