{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:E7NES3WWNGVR5LP5BI76FCBORF","short_pith_number":"pith:E7NES3WW","schema_version":"1.0","canonical_sha256":"27da496ed669ab1eadfd0a3fe2882e894811d559ad0fe5e3e14582f789b1bb30","source":{"kind":"arxiv","id":"quant-ph/0303055","version":1},"attestation_state":"computed","paper":{"title":"Classical deterministic complexity of Edmonds' problem and Quantum Entanglement","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Leonid Gurvits","submitted_at":"2003-03-11T00:27:39Z","abstract_excerpt":"This paper continues research initiated in quant-ph/0201022 . The main subject here is the so-called Edmonds' problem of deciding if a given linear subspace of square matrices contains a nonsingular matrix . We present a deterministic polynomial time algorithm to solve this problem for linear subspaces satisfying a special matroids motivated property, called in the paper the Edmonds-Rado property . This property is shown to be very closely related to the separability of bipartite mixed states . One of the main tools used in the paper is the Quantum Permanent introduced in quant-ph/0201022 ."},"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/0303055","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-03-11T00:27:39Z","cross_cats_sorted":[],"title_canon_sha256":"7a559f1c1510cdf5f4c8acb58f163677bd4f2d8e6f5e240757565e1264b16daf","abstract_canon_sha256":"4ad385456a7afa1777a088f26bd6cb95094d0ab1d9b6e823a849bb5156397363"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:46:08.275063Z","signature_b64":"bQVfTEWUQh6cn/PDsFgcYzGOeR0ezqqXfasQ37C5h6Zsu+WgJ/VE1BEvwEmgIsdVCUPgoAiTgg/Zxz2GypMWDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27da496ed669ab1eadfd0a3fe2882e894811d559ad0fe5e3e14582f789b1bb30","last_reissued_at":"2026-07-04T14:46:08.274719Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:46:08.274719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classical deterministic complexity of Edmonds' problem and Quantum Entanglement","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Leonid Gurvits","submitted_at":"2003-03-11T00:27:39Z","abstract_excerpt":"This paper continues research initiated in quant-ph/0201022 . The main subject here is the so-called Edmonds' problem of deciding if a given linear subspace of square matrices contains a nonsingular matrix . We present a deterministic polynomial time algorithm to solve this problem for linear subspaces satisfying a special matroids motivated property, called in the paper the Edmonds-Rado property . This property is shown to be very closely related to the separability of bipartite mixed states . One of the main tools used in the paper is the Quantum Permanent introduced in quant-ph/0201022 ."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0303055","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/quant-ph/0303055/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":"quant-ph/0303055","created_at":"2026-07-04T14:46:08.274772+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0303055v1","created_at":"2026-07-04T14:46:08.274772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0303055","created_at":"2026-07-04T14:46:08.274772+00:00"},{"alias_kind":"pith_short_12","alias_value":"E7NES3WWNGVR","created_at":"2026-07-04T14:46:08.274772+00:00"},{"alias_kind":"pith_short_16","alias_value":"E7NES3WWNGVR5LP5","created_at":"2026-07-04T14:46:08.274772+00:00"},{"alias_kind":"pith_short_8","alias_value":"E7NES3WW","created_at":"2026-07-04T14:46:08.274772+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1906.10929","citing_title":"Entanglement Certification $-$ From Theory to Experiment","ref_index":62,"is_internal_anchor":true},{"citing_arxiv_id":"2509.07585","citing_title":"Particle Collisions & Quantum Entanglement in High-Energy Collisions","ref_index":76,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E7NES3WWNGVR5LP5BI76FCBORF","json":"https://pith.science/pith/E7NES3WWNGVR5LP5BI76FCBORF.json","graph_json":"https://pith.science/api/pith-number/E7NES3WWNGVR5LP5BI76FCBORF/graph.json","events_json":"https://pith.science/api/pith-number/E7NES3WWNGVR5LP5BI76FCBORF/events.json","paper":"https://pith.science/paper/E7NES3WW"},"agent_actions":{"view_html":"https://pith.science/pith/E7NES3WWNGVR5LP5BI76FCBORF","download_json":"https://pith.science/pith/E7NES3WWNGVR5LP5BI76FCBORF.json","view_paper":"https://pith.science/paper/E7NES3WW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0303055&json=true","fetch_graph":"https://pith.science/api/pith-number/E7NES3WWNGVR5LP5BI76FCBORF/graph.json","fetch_events":"https://pith.science/api/pith-number/E7NES3WWNGVR5LP5BI76FCBORF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E7NES3WWNGVR5LP5BI76FCBORF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E7NES3WWNGVR5LP5BI76FCBORF/action/storage_attestation","attest_author":"https://pith.science/pith/E7NES3WWNGVR5LP5BI76FCBORF/action/author_attestation","sign_citation":"https://pith.science/pith/E7NES3WWNGVR5LP5BI76FCBORF/action/citation_signature","submit_replication":"https://pith.science/pith/E7NES3WWNGVR5LP5BI76FCBORF/action/replication_record"}},"created_at":"2026-07-04T14:46:08.274772+00:00","updated_at":"2026-07-04T14:46:08.274772+00:00"}