{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SAVOZN7VABMMSY4ZEVMR55PRER","short_pith_number":"pith:SAVOZN7V","canonical_record":{"source":{"id":"1709.03617","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-09-11T22:47:24Z","cross_cats_sorted":[],"title_canon_sha256":"19c5fc701efde1668b8bc88ade5cd1d5cb1b44704678d1da90134bbb5dad6043","abstract_canon_sha256":"d66f8059656f9524dc3b35b3caa0c3bd9be10a473d3dedc57719216563bc9313"},"schema_version":"1.0"},"canonical_sha256":"902aecb7f50058c9639925591ef5f12479a45d4fbc301131c5528e165125aefd","source":{"kind":"arxiv","id":"1709.03617","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.03617","created_at":"2026-07-05T08:21:34Z"},{"alias_kind":"arxiv_version","alias_value":"1709.03617v2","created_at":"2026-07-05T08:21:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03617","created_at":"2026-07-05T08:21:34Z"},{"alias_kind":"pith_short_12","alias_value":"SAVOZN7VABMM","created_at":"2026-07-05T08:21:34Z"},{"alias_kind":"pith_short_16","alias_value":"SAVOZN7VABMMSY4Z","created_at":"2026-07-05T08:21:34Z"},{"alias_kind":"pith_short_8","alias_value":"SAVOZN7V","created_at":"2026-07-05T08:21:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SAVOZN7VABMMSY4ZEVMR55PRER","target":"record","payload":{"canonical_record":{"source":{"id":"1709.03617","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-09-11T22:47:24Z","cross_cats_sorted":[],"title_canon_sha256":"19c5fc701efde1668b8bc88ade5cd1d5cb1b44704678d1da90134bbb5dad6043","abstract_canon_sha256":"d66f8059656f9524dc3b35b3caa0c3bd9be10a473d3dedc57719216563bc9313"},"schema_version":"1.0"},"canonical_sha256":"902aecb7f50058c9639925591ef5f12479a45d4fbc301131c5528e165125aefd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:21:34.595616Z","signature_b64":"Mxm7yv0jepVH36REu6Jho9gL1ufD+R5qOEEaLIx/gvZmAw886jfr21Q0SP2EG2amx9o+cnz4Uw8grMoCslHFDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"902aecb7f50058c9639925591ef5f12479a45d4fbc301131c5528e165125aefd","last_reissued_at":"2026-07-05T08:21:34.595126Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:21:34.595126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.03617","source_version":2,"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-07-05T08:21:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CzQUM6LQQcKgqRF78rn2V9iwx3ZLvvUwGSbXSorT4C/M1QQDG5eyHyjTyemqRiGI2tv6NGKiFsEspw8yefxcCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T20:27:13.779479Z"},"content_sha256":"3fc78c487609f92a96f951988b661b3436081f897eb83530491cb052d25ba2a7","schema_version":"1.0","event_id":"sha256:3fc78c487609f92a96f951988b661b3436081f897eb83530491cb052d25ba2a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SAVOZN7VABMMSY4ZEVMR55PRER","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning to Detect Entanglement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bingjie Wang","submitted_at":"2017-09-11T22:47:24Z","abstract_excerpt":"Classifying states as entangled or separable is a fundamental, but expensive task. This paper presents a method, the forest algorithm, to improve the amount of resources needed to detect entanglement. Starting from 'optimized' methods for using geometric criterion to detect entanglement, specific steps are replaced with machine learning models. Tests using numerical simulations indicate that the model is able to declare a state as entangled in fewer steps compared to existing methods. This improvement is achieved without affecting the correctness of the original algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03617","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1709.03617/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"},"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-07-05T08:21:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z7K0Ti26PuSkl2iwaI2sMq3mdcSPfu5Nx244PDPlrw+JjPZsX0ihD+r/3boxCXanxeGCoPrHni0oXp6cXZiiBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T20:27:13.779997Z"},"content_sha256":"c17ea944fa2429785bd219e711a4e86e26ccd8d242d4cf2acb73b7128f51d3c9","schema_version":"1.0","event_id":"sha256:c17ea944fa2429785bd219e711a4e86e26ccd8d242d4cf2acb73b7128f51d3c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SAVOZN7VABMMSY4ZEVMR55PRER/bundle.json","state_url":"https://pith.science/pith/SAVOZN7VABMMSY4ZEVMR55PRER/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SAVOZN7VABMMSY4ZEVMR55PRER/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-08-21T20:27:13Z","links":{"resolver":"https://pith.science/pith/SAVOZN7VABMMSY4ZEVMR55PRER","bundle":"https://pith.science/pith/SAVOZN7VABMMSY4ZEVMR55PRER/bundle.json","state":"https://pith.science/pith/SAVOZN7VABMMSY4ZEVMR55PRER/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SAVOZN7VABMMSY4ZEVMR55PRER/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SAVOZN7VABMMSY4ZEVMR55PRER","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":"d66f8059656f9524dc3b35b3caa0c3bd9be10a473d3dedc57719216563bc9313","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-09-11T22:47:24Z","title_canon_sha256":"19c5fc701efde1668b8bc88ade5cd1d5cb1b44704678d1da90134bbb5dad6043"},"schema_version":"1.0","source":{"id":"1709.03617","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.03617","created_at":"2026-07-05T08:21:34Z"},{"alias_kind":"arxiv_version","alias_value":"1709.03617v2","created_at":"2026-07-05T08:21:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03617","created_at":"2026-07-05T08:21:34Z"},{"alias_kind":"pith_short_12","alias_value":"SAVOZN7VABMM","created_at":"2026-07-05T08:21:34Z"},{"alias_kind":"pith_short_16","alias_value":"SAVOZN7VABMMSY4Z","created_at":"2026-07-05T08:21:34Z"},{"alias_kind":"pith_short_8","alias_value":"SAVOZN7V","created_at":"2026-07-05T08:21:34Z"}],"graph_snapshots":[{"event_id":"sha256:c17ea944fa2429785bd219e711a4e86e26ccd8d242d4cf2acb73b7128f51d3c9","target":"graph","created_at":"2026-07-05T08:21:34Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1709.03617/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Classifying states as entangled or separable is a fundamental, but expensive task. This paper presents a method, the forest algorithm, to improve the amount of resources needed to detect entanglement. Starting from 'optimized' methods for using geometric criterion to detect entanglement, specific steps are replaced with machine learning models. Tests using numerical simulations indicate that the model is able to declare a state as entangled in fewer steps compared to existing methods. This improvement is achieved without affecting the correctness of the original algorithm.","authors_text":"Bingjie Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-09-11T22:47:24Z","title":"Learning to Detect Entanglement"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03617","kind":"arxiv","version":2},"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:3fc78c487609f92a96f951988b661b3436081f897eb83530491cb052d25ba2a7","target":"record","created_at":"2026-07-05T08:21:34Z","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":"d66f8059656f9524dc3b35b3caa0c3bd9be10a473d3dedc57719216563bc9313","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-09-11T22:47:24Z","title_canon_sha256":"19c5fc701efde1668b8bc88ade5cd1d5cb1b44704678d1da90134bbb5dad6043"},"schema_version":"1.0","source":{"id":"1709.03617","kind":"arxiv","version":2}},"canonical_sha256":"902aecb7f50058c9639925591ef5f12479a45d4fbc301131c5528e165125aefd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"902aecb7f50058c9639925591ef5f12479a45d4fbc301131c5528e165125aefd","first_computed_at":"2026-07-05T08:21:34.595126Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:21:34.595126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mxm7yv0jepVH36REu6Jho9gL1ufD+R5qOEEaLIx/gvZmAw886jfr21Q0SP2EG2amx9o+cnz4Uw8grMoCslHFDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:21:34.595616Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.03617","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fc78c487609f92a96f951988b661b3436081f897eb83530491cb052d25ba2a7","sha256:c17ea944fa2429785bd219e711a4e86e26ccd8d242d4cf2acb73b7128f51d3c9"],"state_sha256":"61dcaf72c0262e8710db6fb05300fdb3ba030de50537786762d0ef6aba9c72dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EyfJTYEBJaCnQu4Y/euNoaWvWSt/nf/GcmFPCx1frmbMM41LSzjd04bETQXBEemlwBHxNS5yCEQ6sDCtOXSqBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T20:27:13.785369Z","bundle_sha256":"60beec16b969c2dd3f8d1a8e6a02faeab191a963fe6f9febba0a805427152fbb"}}