{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:PHQZ7GELGX6PMQYZ357QV4ZOW2","short_pith_number":"pith:PHQZ7GEL","schema_version":"1.0","canonical_sha256":"79e19f988b35fcf64319df7f0af32eb6ba70b84c6fd07b4dbe0855205cff63e6","source":{"kind":"arxiv","id":"2608.10147","version":1},"attestation_state":"computed","paper":{"title":"A Simple Algorithm for Best Separable State","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.DS","authors_text":"Amit Rajaraman, Prashanti Anderson, Samuel B. Hopkins","submitted_at":"2026-08-10T19:04:15Z","abstract_excerpt":"We study the best separable state problem (BSS), which asks for the maximum acceptance probability of a quantum measurement over unentangled states. In classical terms, the goal is to maximize $\\langle(x \\otimes y), M (x \\otimes y)\\rangle$ over unit vectors $x,y$ where $0 \\preceq M \\preceq I$; we call this value $\\mathrm{BSS}(M)$. We study $\\mathrm{BSS}$ in the \"perfect completeness\" regime, where given $M$ such that $\\mathrm{BSS}(M) = 1$ the goal is to find the best possible solution $x,y$ -- this generalizes the problem of finding a rank-one matrix as close as possible to a given subspace of"},"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":"2608.10147","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-08-10T19:04:15Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"bebe2ea724a54aa7968b23d66e21f40f371c08be66678bf3b66afa46f869f699","abstract_canon_sha256":"bdee5d74cffc33a66c8b63c46d9776987b6c12ded63c189377da595d72fb70fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-12T00:22:54.614940Z","signature_b64":"GYCyDT9LL4/bV3VB+q3NtUgGwZrLpBoauvgKiA4OhaOQSkc0lEx73m9FazvCJYhGv0B7CCTG0OjpjTRGyXHtCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79e19f988b35fcf64319df7f0af32eb6ba70b84c6fd07b4dbe0855205cff63e6","last_reissued_at":"2026-08-12T00:22:54.613193Z","signature_status":"signed_v1","first_computed_at":"2026-08-12T00:22:54.613193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Simple Algorithm for Best Separable State","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.DS","authors_text":"Amit Rajaraman, Prashanti Anderson, Samuel B. Hopkins","submitted_at":"2026-08-10T19:04:15Z","abstract_excerpt":"We study the best separable state problem (BSS), which asks for the maximum acceptance probability of a quantum measurement over unentangled states. In classical terms, the goal is to maximize $\\langle(x \\otimes y), M (x \\otimes y)\\rangle$ over unit vectors $x,y$ where $0 \\preceq M \\preceq I$; we call this value $\\mathrm{BSS}(M)$. We study $\\mathrm{BSS}$ in the \"perfect completeness\" regime, where given $M$ such that $\\mathrm{BSS}(M) = 1$ the goal is to find the best possible solution $x,y$ -- this generalizes the problem of finding a rank-one matrix as close as possible to a given subspace of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.10147","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.10147/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2608.10147","created_at":"2026-08-12T00:22:54.615956+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.10147v1","created_at":"2026-08-12T00:22:54.615956+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.10147","created_at":"2026-08-12T00:22:54.615956+00:00"},{"alias_kind":"pith_short_12","alias_value":"PHQZ7GELGX6P","created_at":"2026-08-12T00:22:54.615956+00:00"},{"alias_kind":"pith_short_16","alias_value":"PHQZ7GELGX6PMQYZ","created_at":"2026-08-12T00:22:54.615956+00:00"},{"alias_kind":"pith_short_8","alias_value":"PHQZ7GEL","created_at":"2026-08-12T00:22:54.615956+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/PHQZ7GELGX6PMQYZ357QV4ZOW2","json":"https://pith.science/pith/PHQZ7GELGX6PMQYZ357QV4ZOW2.json","graph_json":"https://pith.science/api/pith-number/PHQZ7GELGX6PMQYZ357QV4ZOW2/graph.json","events_json":"https://pith.science/api/pith-number/PHQZ7GELGX6PMQYZ357QV4ZOW2/events.json","paper":"https://pith.science/paper/PHQZ7GEL"},"agent_actions":{"view_html":"https://pith.science/pith/PHQZ7GELGX6PMQYZ357QV4ZOW2","download_json":"https://pith.science/pith/PHQZ7GELGX6PMQYZ357QV4ZOW2.json","view_paper":"https://pith.science/paper/PHQZ7GEL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.10147&json=true","fetch_graph":"https://pith.science/api/pith-number/PHQZ7GELGX6PMQYZ357QV4ZOW2/graph.json","fetch_events":"https://pith.science/api/pith-number/PHQZ7GELGX6PMQYZ357QV4ZOW2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PHQZ7GELGX6PMQYZ357QV4ZOW2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PHQZ7GELGX6PMQYZ357QV4ZOW2/action/storage_attestation","attest_author":"https://pith.science/pith/PHQZ7GELGX6PMQYZ357QV4ZOW2/action/author_attestation","sign_citation":"https://pith.science/pith/PHQZ7GELGX6PMQYZ357QV4ZOW2/action/citation_signature","submit_replication":"https://pith.science/pith/PHQZ7GELGX6PMQYZ357QV4ZOW2/action/replication_record"}},"created_at":"2026-08-12T00:22:54.615956+00:00","updated_at":"2026-08-12T00:22:54.615956+00:00"}