{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:U6FSIYYHLV5OM4YBYDNXDIMVW4","short_pith_number":"pith:U6FSIYYH","schema_version":"1.0","canonical_sha256":"a78b2463075d7ae67301c0db71a195b706d70fbf18869f0437a5376b0c364717","source":{"kind":"arxiv","id":"quant-ph/0205017","version":5},"attestation_state":"computed","paper":{"title":"A matrix realignment method for recognizing entanglement","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Kai Chen, Ling-An Wu","submitted_at":"2002-05-04T09:38:53Z","abstract_excerpt":"Motivated by the Kronecker product approximation technique, we have developed a very simple method to assess the inseparability of bipartite quantum systems, which is based on a realigned matrix constructed from the density matrix. For any separable state, the sum of the singular values of the matrix should be less than or equal to 1. This condition provides a very simple, computable necessary criterion for separability, and shows powerful ability to identify most bound entangled states discussed in the literature. As a byproduct of the criterion, we give an estimate for the degree of entangle"},"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/0205017","kind":"arxiv","version":5},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2002-05-04T09:38:53Z","cross_cats_sorted":[],"title_canon_sha256":"3ebde976e8f4c2f712e76700dcf54fb829338bd36943a5599871db91388594a1","abstract_canon_sha256":"a2de9683a6615915cce322a90b472431a9a3c177f9e79eca3953860f58c2025f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:45:56.107739Z","signature_b64":"J0nbGwF7dkLQonuhxWqfb84b/FwnLzA+EpIoQFW+UKeGTHTdL4OkOXhJf/i9f4QBE3Crb8fz+Vff0mZTEQDCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a78b2463075d7ae67301c0db71a195b706d70fbf18869f0437a5376b0c364717","last_reissued_at":"2026-07-04T14:45:56.107326Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:45:56.107326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A matrix realignment method for recognizing entanglement","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Kai Chen, Ling-An Wu","submitted_at":"2002-05-04T09:38:53Z","abstract_excerpt":"Motivated by the Kronecker product approximation technique, we have developed a very simple method to assess the inseparability of bipartite quantum systems, which is based on a realigned matrix constructed from the density matrix. For any separable state, the sum of the singular values of the matrix should be less than or equal to 1. This condition provides a very simple, computable necessary criterion for separability, and shows powerful ability to identify most bound entangled states discussed in the literature. As a byproduct of the criterion, we give an estimate for the degree of entangle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0205017","kind":"arxiv","version":5},"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/0205017/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/0205017","created_at":"2026-07-04T14:45:56.107395+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0205017v5","created_at":"2026-07-04T14:45:56.107395+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0205017","created_at":"2026-07-04T14:45:56.107395+00:00"},{"alias_kind":"pith_short_12","alias_value":"U6FSIYYHLV5O","created_at":"2026-07-04T14:45:56.107395+00:00"},{"alias_kind":"pith_short_16","alias_value":"U6FSIYYHLV5OM4YB","created_at":"2026-07-04T14:45:56.107395+00:00"},{"alias_kind":"pith_short_8","alias_value":"U6FSIYYH","created_at":"2026-07-04T14:45:56.107395+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"2605.24360","citing_title":"Multiple fidelities and joint numerical range","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2605.30426","citing_title":"Detecting bipartite entanglement with PnCP maps and non-negative polynomials","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"1906.10929","citing_title":"Entanglement Certification $-$ From Theory to Experiment","ref_index":92,"is_internal_anchor":true},{"citing_arxiv_id":"2509.00593","citing_title":"Genuine multientropy, dihedral invariants and Lifshitz theory","ref_index":85,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U6FSIYYHLV5OM4YBYDNXDIMVW4","json":"https://pith.science/pith/U6FSIYYHLV5OM4YBYDNXDIMVW4.json","graph_json":"https://pith.science/api/pith-number/U6FSIYYHLV5OM4YBYDNXDIMVW4/graph.json","events_json":"https://pith.science/api/pith-number/U6FSIYYHLV5OM4YBYDNXDIMVW4/events.json","paper":"https://pith.science/paper/U6FSIYYH"},"agent_actions":{"view_html":"https://pith.science/pith/U6FSIYYHLV5OM4YBYDNXDIMVW4","download_json":"https://pith.science/pith/U6FSIYYHLV5OM4YBYDNXDIMVW4.json","view_paper":"https://pith.science/paper/U6FSIYYH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0205017&json=true","fetch_graph":"https://pith.science/api/pith-number/U6FSIYYHLV5OM4YBYDNXDIMVW4/graph.json","fetch_events":"https://pith.science/api/pith-number/U6FSIYYHLV5OM4YBYDNXDIMVW4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U6FSIYYHLV5OM4YBYDNXDIMVW4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U6FSIYYHLV5OM4YBYDNXDIMVW4/action/storage_attestation","attest_author":"https://pith.science/pith/U6FSIYYHLV5OM4YBYDNXDIMVW4/action/author_attestation","sign_citation":"https://pith.science/pith/U6FSIYYHLV5OM4YBYDNXDIMVW4/action/citation_signature","submit_replication":"https://pith.science/pith/U6FSIYYHLV5OM4YBYDNXDIMVW4/action/replication_record"}},"created_at":"2026-07-04T14:45:56.107395+00:00","updated_at":"2026-07-04T14:45:56.107395+00:00"}