{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:O63GJNPJFTXIVQXCZPVVDHPQQY","short_pith_number":"pith:O63GJNPJ","schema_version":"1.0","canonical_sha256":"77b664b5e92cee8ac2e2cbeb519df0861e1002f8100b34bfbe83c21d6c723171","source":{"kind":"arxiv","id":"2607.23773","version":1},"attestation_state":"computed","paper":{"title":"Quantum Separability in Polynomial Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Giulio Malavolta","submitted_at":"2026-07-26T17:48:29Z","abstract_excerpt":"The quantum separability problem asks whether a bipartite density matrix is separable or is $\\eta$-far from every separable state. We give a randomized polynomial-time algorithm for this problem for every fixed constant gap $\\eta>0$, when distance is measured in the Euclidean norm."},"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":"2607.23773","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-26T17:48:29Z","cross_cats_sorted":[],"title_canon_sha256":"3937e11a1575bccbb168ddf7f16cde55ea5ed70fb3632c245f5bc8cfea7d1651","abstract_canon_sha256":"2f0d6fec4f86ab12a6f136ef205805a17d51b28cd56e7bd1ce99099ea28cd734"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-28T01:23:10.452630Z","signature_b64":"Z45Sw7E39GndFeowKSE+68NWVB1aRNE9GejrrW7cUF2yWQx+pm/JH5MBf8sHUgbCE6KBvo5bjQbjD3ub2RYUAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77b664b5e92cee8ac2e2cbeb519df0861e1002f8100b34bfbe83c21d6c723171","last_reissued_at":"2026-07-28T01:23:10.451792Z","signature_status":"signed_v1","first_computed_at":"2026-07-28T01:23:10.451792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Separability in Polynomial Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Giulio Malavolta","submitted_at":"2026-07-26T17:48:29Z","abstract_excerpt":"The quantum separability problem asks whether a bipartite density matrix is separable or is $\\eta$-far from every separable state. We give a randomized polynomial-time algorithm for this problem for every fixed constant gap $\\eta>0$, when distance is measured in the Euclidean norm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.23773","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/2607.23773/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":"2607.23773","created_at":"2026-07-28T01:23:10.452218+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.23773v1","created_at":"2026-07-28T01:23:10.452218+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.23773","created_at":"2026-07-28T01:23:10.452218+00:00"},{"alias_kind":"pith_short_12","alias_value":"O63GJNPJFTXI","created_at":"2026-07-28T01:23:10.452218+00:00"},{"alias_kind":"pith_short_16","alias_value":"O63GJNPJFTXIVQXC","created_at":"2026-07-28T01:23:10.452218+00:00"},{"alias_kind":"pith_short_8","alias_value":"O63GJNPJ","created_at":"2026-07-28T01:23:10.452218+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/O63GJNPJFTXIVQXCZPVVDHPQQY","json":"https://pith.science/pith/O63GJNPJFTXIVQXCZPVVDHPQQY.json","graph_json":"https://pith.science/api/pith-number/O63GJNPJFTXIVQXCZPVVDHPQQY/graph.json","events_json":"https://pith.science/api/pith-number/O63GJNPJFTXIVQXCZPVVDHPQQY/events.json","paper":"https://pith.science/paper/O63GJNPJ"},"agent_actions":{"view_html":"https://pith.science/pith/O63GJNPJFTXIVQXCZPVVDHPQQY","download_json":"https://pith.science/pith/O63GJNPJFTXIVQXCZPVVDHPQQY.json","view_paper":"https://pith.science/paper/O63GJNPJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.23773&json=true","fetch_graph":"https://pith.science/api/pith-number/O63GJNPJFTXIVQXCZPVVDHPQQY/graph.json","fetch_events":"https://pith.science/api/pith-number/O63GJNPJFTXIVQXCZPVVDHPQQY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O63GJNPJFTXIVQXCZPVVDHPQQY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O63GJNPJFTXIVQXCZPVVDHPQQY/action/storage_attestation","attest_author":"https://pith.science/pith/O63GJNPJFTXIVQXCZPVVDHPQQY/action/author_attestation","sign_citation":"https://pith.science/pith/O63GJNPJFTXIVQXCZPVVDHPQQY/action/citation_signature","submit_replication":"https://pith.science/pith/O63GJNPJFTXIVQXCZPVVDHPQQY/action/replication_record"}},"created_at":"2026-07-28T01:23:10.452218+00:00","updated_at":"2026-07-28T01:23:10.452218+00:00"}