{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GK5OTWOUOJHH6UZKZAXLP4Y56H","short_pith_number":"pith:GK5OTWOU","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"},"canonical_sha256":"32bae9d9d4724e7f532ac82eb7f31df1f006e4058b93646c4854f2055fc97467","source":{"kind":"arxiv","id":"1705.01523","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.01523","created_at":"2026-05-18T00:10:41Z"},{"alias_kind":"arxiv_version","alias_value":"1705.01523v3","created_at":"2026-05-18T00:10:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01523","created_at":"2026-05-18T00:10:41Z"},{"alias_kind":"pith_short_12","alias_value":"GK5OTWOUOJHH","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GK5OTWOUOJHH6UZK","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GK5OTWOU","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GK5OTWOUOJHH6UZKZAXLP4Y56H","target":"record","payload":{"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"},"canonical_sha256":"32bae9d9d4724e7f532ac82eb7f31df1f006e4058b93646c4854f2055fc97467","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"},"source_kind":"arxiv","source_id":"1705.01523","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:10:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LR2BirgpTjnqXc33k62Qtk6caVyApobQiPIzl1vW+75xGjYmqaW/jwtIRN8q5YDztj0yRuOF1sjiA0NOydFeBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:36:40.774892Z"},"content_sha256":"796fa6577c469309d6e20dab3e56f12c1490566d347eb13b4c64a6f19d63e6d7","schema_version":"1.0","event_id":"sha256:796fa6577c469309d6e20dab3e56f12c1490566d347eb13b4c64a6f19d63e6d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GK5OTWOUOJHH6UZKZAXLP4Y56H","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:10:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qYOwaS+/Le9errI2YOBSQWjc3aH4/WEwJXKITjR6FF1M6klhJZTe2iRzNbqim54NnyEHB1E9/IAaIILV12ZcDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:36:40.775558Z"},"content_sha256":"6b24533129c32b817be0244759a7d10fdc0245f710c9b59173e9999854fab070","schema_version":"1.0","event_id":"sha256:6b24533129c32b817be0244759a7d10fdc0245f710c9b59173e9999854fab070"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GK5OTWOUOJHH6UZKZAXLP4Y56H/bundle.json","state_url":"https://pith.science/pith/GK5OTWOUOJHH6UZKZAXLP4Y56H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GK5OTWOUOJHH6UZKZAXLP4Y56H/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T23:36:40Z","links":{"resolver":"https://pith.science/pith/GK5OTWOUOJHH6UZKZAXLP4Y56H","bundle":"https://pith.science/pith/GK5OTWOUOJHH6UZKZAXLP4Y56H/bundle.json","state":"https://pith.science/pith/GK5OTWOUOJHH6UZKZAXLP4Y56H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GK5OTWOUOJHH6UZKZAXLP4Y56H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GK5OTWOUOJHH6UZKZAXLP4Y56H","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7a437e71322b532622bb268623a85f0c7e520de721a857eb37433d033150939c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-05-03T17:39:57Z","title_canon_sha256":"c6848179d83bc108c8bec0cf0da79fffd9bdcee20d9f2e75124ac9c17a110188"},"schema_version":"1.0","source":{"id":"1705.01523","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.01523","created_at":"2026-05-18T00:10:41Z"},{"alias_kind":"arxiv_version","alias_value":"1705.01523v3","created_at":"2026-05-18T00:10:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01523","created_at":"2026-05-18T00:10:41Z"},{"alias_kind":"pith_short_12","alias_value":"GK5OTWOUOJHH","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GK5OTWOUOJHH6UZK","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GK5OTWOU","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:6b24533129c32b817be0244759a7d10fdc0245f710c9b59173e9999854fab070","target":"graph","created_at":"2026-05-18T00:10:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Bei Zeng, Dawei Lu, Duanlu Zhou, Jianxin Chen, Jun Li, Keren Li, Shilin Huang, Sirui Lu, Yi Shen, Zhengfeng Ji","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-05-03T17:39:57Z","title":"A Separability-Entanglement Classifier via Machine Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01523","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:796fa6577c469309d6e20dab3e56f12c1490566d347eb13b4c64a6f19d63e6d7","target":"record","created_at":"2026-05-18T00:10:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7a437e71322b532622bb268623a85f0c7e520de721a857eb37433d033150939c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-05-03T17:39:57Z","title_canon_sha256":"c6848179d83bc108c8bec0cf0da79fffd9bdcee20d9f2e75124ac9c17a110188"},"schema_version":"1.0","source":{"id":"1705.01523","kind":"arxiv","version":3}},"canonical_sha256":"32bae9d9d4724e7f532ac82eb7f31df1f006e4058b93646c4854f2055fc97467","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32bae9d9d4724e7f532ac82eb7f31df1f006e4058b93646c4854f2055fc97467","first_computed_at":"2026-05-18T00:10:41.431186Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:41.431186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9w1hKsHoiKaS1rrmI3tbP1O3C81JU6caMlMW8nE2iZKuRaWvrOlyGodkjEZyGCMN7gtcBXpavHadQhjLJhqgCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:41.431885Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.01523","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:796fa6577c469309d6e20dab3e56f12c1490566d347eb13b4c64a6f19d63e6d7","sha256:6b24533129c32b817be0244759a7d10fdc0245f710c9b59173e9999854fab070"],"state_sha256":"ae38cc84ae0e44eabf89efdc01ee62008de750d5027418e20c4b22c9b4c9716c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nu+uO05B2PjulBknXi9a8tCRQFVOcxEa75F4fJXCqeSGnuEX5yyPZbtrkN65aI4AWYFNw9w8zTC95gKVbGr/DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:36:40.778998Z","bundle_sha256":"ba31271bcaefb3796e28147311ee586efb007d6ac5bb673bc1228182b4565ae8"}}