{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SVT6HT3ZV2AXJK5BBTAMEYPO7L","short_pith_number":"pith:SVT6HT3Z","schema_version":"1.0","canonical_sha256":"9567e3cf79ae8174aba10cc0c261eefac5237bfaddb663de79a99730268f95da","source":{"kind":"arxiv","id":"1604.04797","version":1},"attestation_state":"computed","paper":{"title":"An infinite family of strongly unextendible mutually unbiased bases in $\\mathbb{C}^{2^{2h}}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jonathan Jedwab, Lily Yen","submitted_at":"2016-04-16T21:05:51Z","abstract_excerpt":"A set of $b$ mutually unbiased bases (MUBs) in $\\mathbb{C}^d$ (for $d > 1$) comprises $bd$ vectors in $\\mathbb{C}^d$, partitioned into $b$ orthogonal bases for $\\mathbb{C}^d$ such that the pairwise angle between all vectors from distinct bases is $\\arccos(1/\\sqrt{d})$. The largest number $\\mu(d)$ of MUBs that can exist in $\\mathbb{C}^d$ is at most $d+1$, but constructions attaining this bound are known only when $d$ is a prime power. A set of $b$ MUBs in $\\mathbb{C}^d$ that cannot be enlarged, even by the first vector of a potential $(b+1)$-th MUB, is called strongly unextendible. Until now, o"},"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":"1604.04797","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-16T21:05:51Z","cross_cats_sorted":[],"title_canon_sha256":"fc8e31a5962673e9240fcc40df616bdc257203dd78e331559f091c6483c8ce16","abstract_canon_sha256":"37c7a5b0572aede2883c46ea928aee5dc3adfdbf1ab0f7e8da00eca095bc2cad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:58.494658Z","signature_b64":"vJSWtrvO89HywM3y+FzcQmN9ysthTrR18YC9i6oWq3rN+oTOgAmkJEK14ABB0wyttwSo2rVRDZ74sDwvC1k+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9567e3cf79ae8174aba10cc0c261eefac5237bfaddb663de79a99730268f95da","last_reissued_at":"2026-05-18T01:16:58.493985Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:58.493985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An infinite family of strongly unextendible mutually unbiased bases in $\\mathbb{C}^{2^{2h}}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jonathan Jedwab, Lily Yen","submitted_at":"2016-04-16T21:05:51Z","abstract_excerpt":"A set of $b$ mutually unbiased bases (MUBs) in $\\mathbb{C}^d$ (for $d > 1$) comprises $bd$ vectors in $\\mathbb{C}^d$, partitioned into $b$ orthogonal bases for $\\mathbb{C}^d$ such that the pairwise angle between all vectors from distinct bases is $\\arccos(1/\\sqrt{d})$. The largest number $\\mu(d)$ of MUBs that can exist in $\\mathbb{C}^d$ is at most $d+1$, but constructions attaining this bound are known only when $d$ is a prime power. A set of $b$ MUBs in $\\mathbb{C}^d$ that cannot be enlarged, even by the first vector of a potential $(b+1)$-th MUB, is called strongly unextendible. Until now, o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04797","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":"1604.04797","created_at":"2026-05-18T01:16:58.494085+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.04797v1","created_at":"2026-05-18T01:16:58.494085+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04797","created_at":"2026-05-18T01:16:58.494085+00:00"},{"alias_kind":"pith_short_12","alias_value":"SVT6HT3ZV2AX","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SVT6HT3ZV2AXJK5B","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SVT6HT3Z","created_at":"2026-05-18T12:30:44.179134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2410.23997","citing_title":"Mutually Unbiased Bases in Composite Dimensions -- A Review","ref_index":205,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SVT6HT3ZV2AXJK5BBTAMEYPO7L","json":"https://pith.science/pith/SVT6HT3ZV2AXJK5BBTAMEYPO7L.json","graph_json":"https://pith.science/api/pith-number/SVT6HT3ZV2AXJK5BBTAMEYPO7L/graph.json","events_json":"https://pith.science/api/pith-number/SVT6HT3ZV2AXJK5BBTAMEYPO7L/events.json","paper":"https://pith.science/paper/SVT6HT3Z"},"agent_actions":{"view_html":"https://pith.science/pith/SVT6HT3ZV2AXJK5BBTAMEYPO7L","download_json":"https://pith.science/pith/SVT6HT3ZV2AXJK5BBTAMEYPO7L.json","view_paper":"https://pith.science/paper/SVT6HT3Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.04797&json=true","fetch_graph":"https://pith.science/api/pith-number/SVT6HT3ZV2AXJK5BBTAMEYPO7L/graph.json","fetch_events":"https://pith.science/api/pith-number/SVT6HT3ZV2AXJK5BBTAMEYPO7L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SVT6HT3ZV2AXJK5BBTAMEYPO7L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SVT6HT3ZV2AXJK5BBTAMEYPO7L/action/storage_attestation","attest_author":"https://pith.science/pith/SVT6HT3ZV2AXJK5BBTAMEYPO7L/action/author_attestation","sign_citation":"https://pith.science/pith/SVT6HT3ZV2AXJK5BBTAMEYPO7L/action/citation_signature","submit_replication":"https://pith.science/pith/SVT6HT3ZV2AXJK5BBTAMEYPO7L/action/replication_record"}},"created_at":"2026-05-18T01:16:58.494085+00:00","updated_at":"2026-05-18T01:16:58.494085+00:00"}