{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:FACRS4QZYDPYCG24FVHXXMD4MO","short_pith_number":"pith:FACRS4QZ","schema_version":"1.0","canonical_sha256":"2805197219c0df811b5c2d4f7bb07c6390b8dbc4cd9aeffa599abd5dcb613abe","source":{"kind":"arxiv","id":"0910.5415","version":1},"attestation_state":"computed","paper":{"title":"The minimum-error discrimination via Helstrom family of ensembles and Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"M. Aali, M. A. Jafarizadeh, Y. Mazhari","submitted_at":"2009-10-28T16:15:41Z","abstract_excerpt":"Using the convex optimization method and Helstrom family of ensembles introduced in Ref. [1], we have discussed optimal ambiguous discrimination in qubit systems. We have analyzed the problem of the optimal discrimination of N known quantum states and have obtained maximum success probability and optimal measurement for N known quantum states with equiprobable prior probabilities and equidistant from center of the Bloch ball, not all of which are on the one half of the Bloch ball and all of the conjugate states are pure. An exact solution has also been given for arbitrary three known quantum s"},"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":"0910.5415","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-10-28T16:15:41Z","cross_cats_sorted":[],"title_canon_sha256":"f6ac0755203ca5821f03178f833b06fee1a021fc446c1f259d24fec6ee775562","abstract_canon_sha256":"439129db45ff829bfea1eab6c175e21118dd8b4087771fe5cdb7c96aba43ea5b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:01.419183Z","signature_b64":"aFC8TR2FTHDxQ2Cl9+0ZQWQDKvHSv6YtAlQx30FB7O8LlVK3saMZnNBYcIXxcpuVUxlO3x0Wax/jvKrFYs5cDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2805197219c0df811b5c2d4f7bb07c6390b8dbc4cd9aeffa599abd5dcb613abe","last_reissued_at":"2026-05-18T01:04:01.418432Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:01.418432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The minimum-error discrimination via Helstrom family of ensembles and Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"M. Aali, M. A. Jafarizadeh, Y. Mazhari","submitted_at":"2009-10-28T16:15:41Z","abstract_excerpt":"Using the convex optimization method and Helstrom family of ensembles introduced in Ref. [1], we have discussed optimal ambiguous discrimination in qubit systems. We have analyzed the problem of the optimal discrimination of N known quantum states and have obtained maximum success probability and optimal measurement for N known quantum states with equiprobable prior probabilities and equidistant from center of the Bloch ball, not all of which are on the one half of the Bloch ball and all of the conjugate states are pure. An exact solution has also been given for arbitrary three known quantum s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.5415","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":"0910.5415","created_at":"2026-05-18T01:04:01.418559+00:00"},{"alias_kind":"arxiv_version","alias_value":"0910.5415v1","created_at":"2026-05-18T01:04:01.418559+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.5415","created_at":"2026-05-18T01:04:01.418559+00:00"},{"alias_kind":"pith_short_12","alias_value":"FACRS4QZYDPY","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"FACRS4QZYDPYCG24","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"FACRS4QZ","created_at":"2026-05-18T12:25:59.703012+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/FACRS4QZYDPYCG24FVHXXMD4MO","json":"https://pith.science/pith/FACRS4QZYDPYCG24FVHXXMD4MO.json","graph_json":"https://pith.science/api/pith-number/FACRS4QZYDPYCG24FVHXXMD4MO/graph.json","events_json":"https://pith.science/api/pith-number/FACRS4QZYDPYCG24FVHXXMD4MO/events.json","paper":"https://pith.science/paper/FACRS4QZ"},"agent_actions":{"view_html":"https://pith.science/pith/FACRS4QZYDPYCG24FVHXXMD4MO","download_json":"https://pith.science/pith/FACRS4QZYDPYCG24FVHXXMD4MO.json","view_paper":"https://pith.science/paper/FACRS4QZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0910.5415&json=true","fetch_graph":"https://pith.science/api/pith-number/FACRS4QZYDPYCG24FVHXXMD4MO/graph.json","fetch_events":"https://pith.science/api/pith-number/FACRS4QZYDPYCG24FVHXXMD4MO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FACRS4QZYDPYCG24FVHXXMD4MO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FACRS4QZYDPYCG24FVHXXMD4MO/action/storage_attestation","attest_author":"https://pith.science/pith/FACRS4QZYDPYCG24FVHXXMD4MO/action/author_attestation","sign_citation":"https://pith.science/pith/FACRS4QZYDPYCG24FVHXXMD4MO/action/citation_signature","submit_replication":"https://pith.science/pith/FACRS4QZYDPYCG24FVHXXMD4MO/action/replication_record"}},"created_at":"2026-05-18T01:04:01.418559+00:00","updated_at":"2026-05-18T01:04:01.418559+00:00"}