{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:5OT2QXOQ4UZLUDJVCOZ2C6OF2L","short_pith_number":"pith:5OT2QXOQ","schema_version":"1.0","canonical_sha256":"eba7a85dd0e532ba0d3513b3a179c5d2ed4762a34a8be8a35ab6a28b296c3d7e","source":{"kind":"arxiv","id":"1006.0093","version":1},"attestation_state":"computed","paper":{"title":"Mutually Unbiased Bases and Semi-definite Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP","math.OC"],"primary_cat":"quant-ph","authors_text":"Stefan Weigert, Stephen Brierley","submitted_at":"2010-06-01T09:29:19Z","abstract_excerpt":"A complex Hilbert space of dimension six supports at least three but not more than seven mutually unbiased bases. Two computer-aided analytical methods to tighten these bounds are reviewed, based on a discretization of parameter space and on Grobner bases. A third algorithmic approach is presented: the non-existence of more than three mutually unbiased bases in composite dimensions can be decided by a global optimization method known as semidefinite programming. The method is used to confirm that the spectral matrix cannot be part of a complete set of seven mutually unbiased bases in dimension"},"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":"1006.0093","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-06-01T09:29:19Z","cross_cats_sorted":["math-ph","math.MP","math.OC"],"title_canon_sha256":"9818b000907b06a2a3c6ef1d93d465bc7dfd1985d19932d8fec4ea9c7428dc19","abstract_canon_sha256":"49e0a4210b757f917c47b26fa8b429018d482e694d2e324f979f72c111a58787"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:29:44.574508Z","signature_b64":"YJIl+hHJAA1QxR8Z6s84fUIifEV1O/C8SSnaU7/qRbNZBPB3FGKCmDd5oRLHUOP0ymgSDoP9HMyeRSfq1kEbBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eba7a85dd0e532ba0d3513b3a179c5d2ed4762a34a8be8a35ab6a28b296c3d7e","last_reissued_at":"2026-05-18T04:29:44.573945Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:29:44.573945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mutually Unbiased Bases and Semi-definite Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP","math.OC"],"primary_cat":"quant-ph","authors_text":"Stefan Weigert, Stephen Brierley","submitted_at":"2010-06-01T09:29:19Z","abstract_excerpt":"A complex Hilbert space of dimension six supports at least three but not more than seven mutually unbiased bases. Two computer-aided analytical methods to tighten these bounds are reviewed, based on a discretization of parameter space and on Grobner bases. A third algorithmic approach is presented: the non-existence of more than three mutually unbiased bases in composite dimensions can be decided by a global optimization method known as semidefinite programming. The method is used to confirm that the spectral matrix cannot be part of a complete set of seven mutually unbiased bases in dimension"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.0093","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":"1006.0093","created_at":"2026-05-18T04:29:44.574030+00:00"},{"alias_kind":"arxiv_version","alias_value":"1006.0093v1","created_at":"2026-05-18T04:29:44.574030+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.0093","created_at":"2026-05-18T04:29:44.574030+00:00"},{"alias_kind":"pith_short_12","alias_value":"5OT2QXOQ4UZL","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"5OT2QXOQ4UZLUDJV","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"5OT2QXOQ","created_at":"2026-05-18T12:26:04.259169+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/5OT2QXOQ4UZLUDJVCOZ2C6OF2L","json":"https://pith.science/pith/5OT2QXOQ4UZLUDJVCOZ2C6OF2L.json","graph_json":"https://pith.science/api/pith-number/5OT2QXOQ4UZLUDJVCOZ2C6OF2L/graph.json","events_json":"https://pith.science/api/pith-number/5OT2QXOQ4UZLUDJVCOZ2C6OF2L/events.json","paper":"https://pith.science/paper/5OT2QXOQ"},"agent_actions":{"view_html":"https://pith.science/pith/5OT2QXOQ4UZLUDJVCOZ2C6OF2L","download_json":"https://pith.science/pith/5OT2QXOQ4UZLUDJVCOZ2C6OF2L.json","view_paper":"https://pith.science/paper/5OT2QXOQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1006.0093&json=true","fetch_graph":"https://pith.science/api/pith-number/5OT2QXOQ4UZLUDJVCOZ2C6OF2L/graph.json","fetch_events":"https://pith.science/api/pith-number/5OT2QXOQ4UZLUDJVCOZ2C6OF2L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5OT2QXOQ4UZLUDJVCOZ2C6OF2L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5OT2QXOQ4UZLUDJVCOZ2C6OF2L/action/storage_attestation","attest_author":"https://pith.science/pith/5OT2QXOQ4UZLUDJVCOZ2C6OF2L/action/author_attestation","sign_citation":"https://pith.science/pith/5OT2QXOQ4UZLUDJVCOZ2C6OF2L/action/citation_signature","submit_replication":"https://pith.science/pith/5OT2QXOQ4UZLUDJVCOZ2C6OF2L/action/replication_record"}},"created_at":"2026-05-18T04:29:44.574030+00:00","updated_at":"2026-05-18T04:29:44.574030+00:00"}