{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GK5OTWOUOJHH6UZKZAXLP4Y56H","short_pith_number":"pith:GK5OTWOU","schema_version":"1.0","canonical_sha256":"32bae9d9d4724e7f532ac82eb7f31df1f006e4058b93646c4854f2055fc97467","source":{"kind":"arxiv","id":"1705.01523","version":3},"attestation_state":"computed","paper":{"title":"A Separability-Entanglement Classifier via Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bei Zeng, Dawei Lu, Duanlu Zhou, Jianxin Chen, Jun Li, Keren Li, Shilin Huang, Sirui Lu, Yi Shen, Zhengfeng Ji","submitted_at":"2017-05-03T17:39:57Z","abstract_excerpt":"The problem of determining whether a given quantum state is entangled lies at the heart of quantum information processing, which is known to be an NP-hard problem in general. Despite the proposed many methods such as the positive partial transpose (PPT) criterion and the k-symmetric extendibility criterion to tackle this problem in practice, none of them enables a general, effective solution to the problem even for small dimensions. Explicitly, separable states form a high-dimensional convex set, which exhibits a vastly complicated structure. In this work, we build a new separability-entanglem"},"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":"1705.01523","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-05-03T17:39:57Z","cross_cats_sorted":[],"title_canon_sha256":"c6848179d83bc108c8bec0cf0da79fffd9bdcee20d9f2e75124ac9c17a110188","abstract_canon_sha256":"7a437e71322b532622bb268623a85f0c7e520de721a857eb37433d033150939c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:41.431885Z","signature_b64":"9w1hKsHoiKaS1rrmI3tbP1O3C81JU6caMlMW8nE2iZKuRaWvrOlyGodkjEZyGCMN7gtcBXpavHadQhjLJhqgCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32bae9d9d4724e7f532ac82eb7f31df1f006e4058b93646c4854f2055fc97467","last_reissued_at":"2026-05-18T00:10:41.431186Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:41.431186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Separability-Entanglement Classifier via Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bei Zeng, Dawei Lu, Duanlu Zhou, Jianxin Chen, Jun Li, Keren Li, Shilin Huang, Sirui Lu, Yi Shen, Zhengfeng Ji","submitted_at":"2017-05-03T17:39:57Z","abstract_excerpt":"The problem of determining whether a given quantum state is entangled lies at the heart of quantum information processing, which is known to be an NP-hard problem in general. Despite the proposed many methods such as the positive partial transpose (PPT) criterion and the k-symmetric extendibility criterion to tackle this problem in practice, none of them enables a general, effective solution to the problem even for small dimensions. Explicitly, separable states form a high-dimensional convex set, which exhibits a vastly complicated structure. In this work, we build a new separability-entanglem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01523","kind":"arxiv","version":3},"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":"1705.01523","created_at":"2026-05-18T00:10:41.431292+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.01523v3","created_at":"2026-05-18T00:10:41.431292+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01523","created_at":"2026-05-18T00:10:41.431292+00:00"},{"alias_kind":"pith_short_12","alias_value":"GK5OTWOUOJHH","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GK5OTWOUOJHH6UZK","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GK5OTWOU","created_at":"2026-05-18T12:31:18.294218+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/GK5OTWOUOJHH6UZKZAXLP4Y56H","json":"https://pith.science/pith/GK5OTWOUOJHH6UZKZAXLP4Y56H.json","graph_json":"https://pith.science/api/pith-number/GK5OTWOUOJHH6UZKZAXLP4Y56H/graph.json","events_json":"https://pith.science/api/pith-number/GK5OTWOUOJHH6UZKZAXLP4Y56H/events.json","paper":"https://pith.science/paper/GK5OTWOU"},"agent_actions":{"view_html":"https://pith.science/pith/GK5OTWOUOJHH6UZKZAXLP4Y56H","download_json":"https://pith.science/pith/GK5OTWOUOJHH6UZKZAXLP4Y56H.json","view_paper":"https://pith.science/paper/GK5OTWOU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.01523&json=true","fetch_graph":"https://pith.science/api/pith-number/GK5OTWOUOJHH6UZKZAXLP4Y56H/graph.json","fetch_events":"https://pith.science/api/pith-number/GK5OTWOUOJHH6UZKZAXLP4Y56H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GK5OTWOUOJHH6UZKZAXLP4Y56H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GK5OTWOUOJHH6UZKZAXLP4Y56H/action/storage_attestation","attest_author":"https://pith.science/pith/GK5OTWOUOJHH6UZKZAXLP4Y56H/action/author_attestation","sign_citation":"https://pith.science/pith/GK5OTWOUOJHH6UZKZAXLP4Y56H/action/citation_signature","submit_replication":"https://pith.science/pith/GK5OTWOUOJHH6UZKZAXLP4Y56H/action/replication_record"}},"created_at":"2026-05-18T00:10:41.431292+00:00","updated_at":"2026-05-18T00:10:41.431292+00:00"}