{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:FBQ7HLBYNIKSBH5XJ6XA5R3CIT","short_pith_number":"pith:FBQ7HLBY","schema_version":"1.0","canonical_sha256":"2861f3ac386a15209fb74fae0ec76244ca1eeb16fa55ce4827c63b74e46cd5d2","source":{"kind":"arxiv","id":"0906.0637","version":2},"attestation_state":"computed","paper":{"title":"Minimum error discrimination problem for pure qubit states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Boris F Samsonov","submitted_at":"2009-06-03T03:27:43Z","abstract_excerpt":"The necessary and sufficient conditions for minimization of the generalized rate error for discriminating among $N$ pure qubit states are reformulated in terms of Bloch vectors representing the states. For the direct optimization problem an algorithmic solution to these conditions is indicated. A solution to the inverse optimization problem is given. General results are widely illustrated by particular cases of equiprobable states and $N=2,3,4$ pure qubit states given with different prior probabilities."},"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":"0906.0637","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-06-03T03:27:43Z","cross_cats_sorted":[],"title_canon_sha256":"6035e53612ca4889f0569f21e533f3aea184d000e7bfb7a1d95326b9f6d55928","abstract_canon_sha256":"4427b65a9bffafe3d76875753cb695cf8ffffdf332256db849488ae2ed54cb69"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:23:59.673461Z","signature_b64":"K6meR1Sof3iZEPldpjZS3GGv+0cE3VtlD/y95StRlHnGRnFCMSH2sVU81TAlzU6Vd+Z7oYieSzrU6Y2MbRUsBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2861f3ac386a15209fb74fae0ec76244ca1eeb16fa55ce4827c63b74e46cd5d2","last_reissued_at":"2026-05-18T03:23:59.672395Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:23:59.672395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum error discrimination problem for pure qubit states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Boris F Samsonov","submitted_at":"2009-06-03T03:27:43Z","abstract_excerpt":"The necessary and sufficient conditions for minimization of the generalized rate error for discriminating among $N$ pure qubit states are reformulated in terms of Bloch vectors representing the states. For the direct optimization problem an algorithmic solution to these conditions is indicated. A solution to the inverse optimization problem is given. General results are widely illustrated by particular cases of equiprobable states and $N=2,3,4$ pure qubit states given with different prior probabilities."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.0637","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":"0906.0637","created_at":"2026-05-18T03:23:59.672580+00:00"},{"alias_kind":"arxiv_version","alias_value":"0906.0637v2","created_at":"2026-05-18T03:23:59.672580+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.0637","created_at":"2026-05-18T03:23:59.672580+00:00"},{"alias_kind":"pith_short_12","alias_value":"FBQ7HLBYNIKS","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"FBQ7HLBYNIKSBH5X","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"FBQ7HLBY","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/FBQ7HLBYNIKSBH5XJ6XA5R3CIT","json":"https://pith.science/pith/FBQ7HLBYNIKSBH5XJ6XA5R3CIT.json","graph_json":"https://pith.science/api/pith-number/FBQ7HLBYNIKSBH5XJ6XA5R3CIT/graph.json","events_json":"https://pith.science/api/pith-number/FBQ7HLBYNIKSBH5XJ6XA5R3CIT/events.json","paper":"https://pith.science/paper/FBQ7HLBY"},"agent_actions":{"view_html":"https://pith.science/pith/FBQ7HLBYNIKSBH5XJ6XA5R3CIT","download_json":"https://pith.science/pith/FBQ7HLBYNIKSBH5XJ6XA5R3CIT.json","view_paper":"https://pith.science/paper/FBQ7HLBY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0906.0637&json=true","fetch_graph":"https://pith.science/api/pith-number/FBQ7HLBYNIKSBH5XJ6XA5R3CIT/graph.json","fetch_events":"https://pith.science/api/pith-number/FBQ7HLBYNIKSBH5XJ6XA5R3CIT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FBQ7HLBYNIKSBH5XJ6XA5R3CIT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FBQ7HLBYNIKSBH5XJ6XA5R3CIT/action/storage_attestation","attest_author":"https://pith.science/pith/FBQ7HLBYNIKSBH5XJ6XA5R3CIT/action/author_attestation","sign_citation":"https://pith.science/pith/FBQ7HLBYNIKSBH5XJ6XA5R3CIT/action/citation_signature","submit_replication":"https://pith.science/pith/FBQ7HLBYNIKSBH5XJ6XA5R3CIT/action/replication_record"}},"created_at":"2026-05-18T03:23:59.672580+00:00","updated_at":"2026-05-18T03:23:59.672580+00:00"}