{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:FDKXONXZSUMM22WUEYNHI3I7UO","short_pith_number":"pith:FDKXONXZ","schema_version":"1.0","canonical_sha256":"28d57736f99518cd6ad4261a746d1fa3aea390327e244087a4956f54e07e45c6","source":{"kind":"arxiv","id":"quant-ph/0610031","version":2},"attestation_state":"computed","paper":{"title":"Compatibility of subsystem states and convex geometry","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"William Hall (University of York)","submitted_at":"2006-10-05T10:46:22Z","abstract_excerpt":"The subsystem compatibility problem, which concerns the question of whether a set of subsystem states are compatible with a state of the entire system, has received much study. Here we attack the problem from a new angle, utilising the ideas of convexity that have been successfully employed against the separability problem. Analogously to an entanglement witness, we introduce the idea of a compatibility witness, and prove a number of properties about these objects. We show that the subsystem compatibility problem can be solved numerically and efficiently using semidefinite programming, and tha"},"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":"quant-ph/0610031","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-10-05T10:46:22Z","cross_cats_sorted":[],"title_canon_sha256":"837c8a6663561111fa0315a11d10ce02bb5a57bd82c7b85c604fc0ebb309ecc3","abstract_canon_sha256":"7c7e3f1ea703fdf9c7a79d2d1e790125c5d85de9c40edb85956406061d7012a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:24:19.341900Z","signature_b64":"J/bXOHcbhenJx+G27o5AD885IGg+mu7kfhq+9Jk9G9iFJnpFItSMJ773xqBUT6YKYZli/XrV++kqvBx6D5YPBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28d57736f99518cd6ad4261a746d1fa3aea390327e244087a4956f54e07e45c6","last_reissued_at":"2026-05-18T03:24:19.341087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:24:19.341087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compatibility of subsystem states and convex geometry","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"William Hall (University of York)","submitted_at":"2006-10-05T10:46:22Z","abstract_excerpt":"The subsystem compatibility problem, which concerns the question of whether a set of subsystem states are compatible with a state of the entire system, has received much study. Here we attack the problem from a new angle, utilising the ideas of convexity that have been successfully employed against the separability problem. Analogously to an entanglement witness, we introduce the idea of a compatibility witness, and prove a number of properties about these objects. We show that the subsystem compatibility problem can be solved numerically and efficiently using semidefinite programming, and tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0610031","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":"quant-ph/0610031","created_at":"2026-05-18T03:24:19.341238+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0610031v2","created_at":"2026-05-18T03:24:19.341238+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0610031","created_at":"2026-05-18T03:24:19.341238+00:00"},{"alias_kind":"pith_short_12","alias_value":"FDKXONXZSUMM","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"FDKXONXZSUMM22WU","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"FDKXONXZ","created_at":"2026-05-18T12:25:53.939244+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/FDKXONXZSUMM22WUEYNHI3I7UO","json":"https://pith.science/pith/FDKXONXZSUMM22WUEYNHI3I7UO.json","graph_json":"https://pith.science/api/pith-number/FDKXONXZSUMM22WUEYNHI3I7UO/graph.json","events_json":"https://pith.science/api/pith-number/FDKXONXZSUMM22WUEYNHI3I7UO/events.json","paper":"https://pith.science/paper/FDKXONXZ"},"agent_actions":{"view_html":"https://pith.science/pith/FDKXONXZSUMM22WUEYNHI3I7UO","download_json":"https://pith.science/pith/FDKXONXZSUMM22WUEYNHI3I7UO.json","view_paper":"https://pith.science/paper/FDKXONXZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0610031&json=true","fetch_graph":"https://pith.science/api/pith-number/FDKXONXZSUMM22WUEYNHI3I7UO/graph.json","fetch_events":"https://pith.science/api/pith-number/FDKXONXZSUMM22WUEYNHI3I7UO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FDKXONXZSUMM22WUEYNHI3I7UO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FDKXONXZSUMM22WUEYNHI3I7UO/action/storage_attestation","attest_author":"https://pith.science/pith/FDKXONXZSUMM22WUEYNHI3I7UO/action/author_attestation","sign_citation":"https://pith.science/pith/FDKXONXZSUMM22WUEYNHI3I7UO/action/citation_signature","submit_replication":"https://pith.science/pith/FDKXONXZSUMM22WUEYNHI3I7UO/action/replication_record"}},"created_at":"2026-05-18T03:24:19.341238+00:00","updated_at":"2026-05-18T03:24:19.341238+00:00"}