{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:G6QLKRCYL6IPFVAMG3GP7BWPAY","short_pith_number":"pith:G6QLKRCY","schema_version":"1.0","canonical_sha256":"37a0b544585f90f2d40c36ccff86cf0618f125a4e985501f000b57f6b1ec63e8","source":{"kind":"arxiv","id":"1504.06595","version":2},"attestation_state":"computed","paper":{"title":"Positive Maps and Separable Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jiawang Nie, Xinzhen Zhang","submitted_at":"2015-04-24T18:43:30Z","abstract_excerpt":"A linear map between real symmetric matrix spaces is positive if all positive semidefinite matrices are mapped to positive semidefinite ones. A real symmetric matrix is separable if it can be written as a summation of Kronecker products of positive semidefinite matrices. This paper studies how to check if a linear map is positive or not and how to check if a matrix is separable or not. We propose numerical algorithms, based on Lasserre type semidefinite relaxations, for solving such questions. To check the positivity of a linear map, we construct a hierarchy of semidefinite relaxations for min"},"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":"1504.06595","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-04-24T18:43:30Z","cross_cats_sorted":[],"title_canon_sha256":"1f3c23482656bd1a502ae88012c81151e23c4ced7ee2dfd77ed6a1b8ff16e1d9","abstract_canon_sha256":"de7cf4159b04405f31eebca6641e231ba505cc2b55acf6b2f38ab0ba272e7cfc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:14.648614Z","signature_b64":"fwJbOZMYll+2UKxcIxFq2Dw22isgT3WIcclVJ/Gvz4DekhXqS/z6FaOvSp3lyBdR5eg9shpXJrLcHZSodlvZBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37a0b544585f90f2d40c36ccff86cf0618f125a4e985501f000b57f6b1ec63e8","last_reissued_at":"2026-05-18T01:18:14.648047Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:14.648047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Positive Maps and Separable Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jiawang Nie, Xinzhen Zhang","submitted_at":"2015-04-24T18:43:30Z","abstract_excerpt":"A linear map between real symmetric matrix spaces is positive if all positive semidefinite matrices are mapped to positive semidefinite ones. A real symmetric matrix is separable if it can be written as a summation of Kronecker products of positive semidefinite matrices. This paper studies how to check if a linear map is positive or not and how to check if a matrix is separable or not. We propose numerical algorithms, based on Lasserre type semidefinite relaxations, for solving such questions. To check the positivity of a linear map, we construct a hierarchy of semidefinite relaxations for min"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06595","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":"1504.06595","created_at":"2026-05-18T01:18:14.648134+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.06595v2","created_at":"2026-05-18T01:18:14.648134+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06595","created_at":"2026-05-18T01:18:14.648134+00:00"},{"alias_kind":"pith_short_12","alias_value":"G6QLKRCYL6IP","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"G6QLKRCYL6IPFVAM","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"G6QLKRCY","created_at":"2026-05-18T12:29:22.688609+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/G6QLKRCYL6IPFVAMG3GP7BWPAY","json":"https://pith.science/pith/G6QLKRCYL6IPFVAMG3GP7BWPAY.json","graph_json":"https://pith.science/api/pith-number/G6QLKRCYL6IPFVAMG3GP7BWPAY/graph.json","events_json":"https://pith.science/api/pith-number/G6QLKRCYL6IPFVAMG3GP7BWPAY/events.json","paper":"https://pith.science/paper/G6QLKRCY"},"agent_actions":{"view_html":"https://pith.science/pith/G6QLKRCYL6IPFVAMG3GP7BWPAY","download_json":"https://pith.science/pith/G6QLKRCYL6IPFVAMG3GP7BWPAY.json","view_paper":"https://pith.science/paper/G6QLKRCY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.06595&json=true","fetch_graph":"https://pith.science/api/pith-number/G6QLKRCYL6IPFVAMG3GP7BWPAY/graph.json","fetch_events":"https://pith.science/api/pith-number/G6QLKRCYL6IPFVAMG3GP7BWPAY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G6QLKRCYL6IPFVAMG3GP7BWPAY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G6QLKRCYL6IPFVAMG3GP7BWPAY/action/storage_attestation","attest_author":"https://pith.science/pith/G6QLKRCYL6IPFVAMG3GP7BWPAY/action/author_attestation","sign_citation":"https://pith.science/pith/G6QLKRCYL6IPFVAMG3GP7BWPAY/action/citation_signature","submit_replication":"https://pith.science/pith/G6QLKRCYL6IPFVAMG3GP7BWPAY/action/replication_record"}},"created_at":"2026-05-18T01:18:14.648134+00:00","updated_at":"2026-05-18T01:18:14.648134+00:00"}