{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AGSCQOAZY3JRYJ5GW6TY3FD7K2","short_pith_number":"pith:AGSCQOAZ","schema_version":"1.0","canonical_sha256":"01a4283819c6d31c27a6b7a78d947f5698361f21309658b27ab6467cf76f46f2","source":{"kind":"arxiv","id":"1710.01565","version":2},"attestation_state":"computed","paper":{"title":"Optimal convex approximations of quantum states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Massimiliano F. Sacchi","submitted_at":"2017-10-04T12:16:47Z","abstract_excerpt":"We consider the problem of optimally approximating an unavailable quantum state $\\rho $ by the convex mixing of states drawn from a set of available states $\\{ \\nu_i\\}$. The problem is recast to look for the least distinguishable state from $\\rho $ among the convex set $\\sum_i p_i \\nu_i$, and the corresponding optimal weights $\\{ p_i \\}$ provide the optimal convex mixing. We present the complete solution for the optimal convex approximation of a qubit mixed state when the set of available states comprises the three bases of the Pauli matrices."},"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":"1710.01565","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-10-04T12:16:47Z","cross_cats_sorted":[],"title_canon_sha256":"d37950a49098ac78679ea0c60c72a9b0f0b47854eea82914e01dfbc8e01f408b","abstract_canon_sha256":"9525a85b2d3263a8d273093d51426f8041b37d427792eb2ac34d06ff6c1cef52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:43.188746Z","signature_b64":"2TxNeXvyam07RCUDpBexIFImzVoKSepFTkZr7JYjH/iN7zLFvASemMfO8tUikEt5KQYQRd2zL2nQefVzde8uDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01a4283819c6d31c27a6b7a78d947f5698361f21309658b27ab6467cf76f46f2","last_reissued_at":"2026-05-17T23:55:43.188251Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:43.188251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal convex approximations of quantum states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Massimiliano F. Sacchi","submitted_at":"2017-10-04T12:16:47Z","abstract_excerpt":"We consider the problem of optimally approximating an unavailable quantum state $\\rho $ by the convex mixing of states drawn from a set of available states $\\{ \\nu_i\\}$. The problem is recast to look for the least distinguishable state from $\\rho $ among the convex set $\\sum_i p_i \\nu_i$, and the corresponding optimal weights $\\{ p_i \\}$ provide the optimal convex mixing. We present the complete solution for the optimal convex approximation of a qubit mixed state when the set of available states comprises the three bases of the Pauli matrices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01565","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":"1710.01565","created_at":"2026-05-17T23:55:43.188329+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.01565v2","created_at":"2026-05-17T23:55:43.188329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01565","created_at":"2026-05-17T23:55:43.188329+00:00"},{"alias_kind":"pith_short_12","alias_value":"AGSCQOAZY3JR","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AGSCQOAZY3JRYJ5G","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AGSCQOAZ","created_at":"2026-05-18T12:31:05.417338+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/AGSCQOAZY3JRYJ5GW6TY3FD7K2","json":"https://pith.science/pith/AGSCQOAZY3JRYJ5GW6TY3FD7K2.json","graph_json":"https://pith.science/api/pith-number/AGSCQOAZY3JRYJ5GW6TY3FD7K2/graph.json","events_json":"https://pith.science/api/pith-number/AGSCQOAZY3JRYJ5GW6TY3FD7K2/events.json","paper":"https://pith.science/paper/AGSCQOAZ"},"agent_actions":{"view_html":"https://pith.science/pith/AGSCQOAZY3JRYJ5GW6TY3FD7K2","download_json":"https://pith.science/pith/AGSCQOAZY3JRYJ5GW6TY3FD7K2.json","view_paper":"https://pith.science/paper/AGSCQOAZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.01565&json=true","fetch_graph":"https://pith.science/api/pith-number/AGSCQOAZY3JRYJ5GW6TY3FD7K2/graph.json","fetch_events":"https://pith.science/api/pith-number/AGSCQOAZY3JRYJ5GW6TY3FD7K2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AGSCQOAZY3JRYJ5GW6TY3FD7K2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AGSCQOAZY3JRYJ5GW6TY3FD7K2/action/storage_attestation","attest_author":"https://pith.science/pith/AGSCQOAZY3JRYJ5GW6TY3FD7K2/action/author_attestation","sign_citation":"https://pith.science/pith/AGSCQOAZY3JRYJ5GW6TY3FD7K2/action/citation_signature","submit_replication":"https://pith.science/pith/AGSCQOAZY3JRYJ5GW6TY3FD7K2/action/replication_record"}},"created_at":"2026-05-17T23:55:43.188329+00:00","updated_at":"2026-05-17T23:55:43.188329+00:00"}