{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:3YAJJULNNQU3OZMQKBURFHUDL4","short_pith_number":"pith:3YAJJULN","canonical_record":{"source":{"id":"2112.08055","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-15T11:50:25Z","cross_cats_sorted":["cond-mat.dis-nn","cs.LG"],"title_canon_sha256":"195460f8a099672d010f6cc7ec27e20eaea0b071d006a79cc5e26a2bea7974b1","abstract_canon_sha256":"87ee3565b25af77a278a9852cebf9f1778337de02d2d7b12d08c09ec77634ccf"},"schema_version":"1.0"},"canonical_sha256":"de0094d16d6c29b765905069129e835f30097c8b6a0e9eacf51fe6c34a49b1ef","source":{"kind":"arxiv","id":"2112.08055","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.08055","created_at":"2026-07-05T04:38:12Z"},{"alias_kind":"arxiv_version","alias_value":"2112.08055v5","created_at":"2026-07-05T04:38:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.08055","created_at":"2026-07-05T04:38:12Z"},{"alias_kind":"pith_short_12","alias_value":"3YAJJULNNQU3","created_at":"2026-07-05T04:38:12Z"},{"alias_kind":"pith_short_16","alias_value":"3YAJJULNNQU3OZMQ","created_at":"2026-07-05T04:38:12Z"},{"alias_kind":"pith_short_8","alias_value":"3YAJJULN","created_at":"2026-07-05T04:38:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:3YAJJULNNQU3OZMQKBURFHUDL4","target":"record","payload":{"canonical_record":{"source":{"id":"2112.08055","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-15T11:50:25Z","cross_cats_sorted":["cond-mat.dis-nn","cs.LG"],"title_canon_sha256":"195460f8a099672d010f6cc7ec27e20eaea0b071d006a79cc5e26a2bea7974b1","abstract_canon_sha256":"87ee3565b25af77a278a9852cebf9f1778337de02d2d7b12d08c09ec77634ccf"},"schema_version":"1.0"},"canonical_sha256":"de0094d16d6c29b765905069129e835f30097c8b6a0e9eacf51fe6c34a49b1ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:38:12.805578Z","signature_b64":"8bK9/NTkvU7pN+Q2FILOevrj0Gz3dCWhC7utp4dpJbEucT/vz5v27GDMilBDyPeYMNTXn3GvKw7ERjoMrwN7Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de0094d16d6c29b765905069129e835f30097c8b6a0e9eacf51fe6c34a49b1ef","last_reissued_at":"2026-07-05T04:38:12.805077Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:38:12.805077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2112.08055","source_version":5,"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-05T04:38:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"40ywudJFcO2FkQ9qfG/OoyqURSYF+RQ7VP+bvd6ts9RptO7lTA06Mhj5BG39ap7iZjvQRpDdTIMvBqsl9aezCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T04:52:35.479430Z"},"content_sha256":"533773d80bb62bd4819bc39bb544e19d3fde491a0e4c984f66fdd0c0ca3cf6a5","schema_version":"1.0","event_id":"sha256:533773d80bb62bd4819bc39bb544e19d3fde491a0e4c984f66fdd0c0ca3cf6a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:3YAJJULNNQU3OZMQKBURFHUDL4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Building separable approximations for quantum states via neural networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.dis-nn","cs.LG"],"primary_cat":"quant-ph","authors_text":"Antoine Girardin, Nicolas Brunner, Tam\\'as Kriv\\'achy","submitted_at":"2021-12-15T11:50:25Z","abstract_excerpt":"Finding the closest separable state to a given target state is a notoriously difficult task, even more difficult than deciding whether a state is entangled or separable. To tackle this task, we parametrize separable states with a neural network and train it to minimize the distance to a given target state, with respect to a differentiable distance, such as the trace distance or Hilbert--Schmidt distance. By examining the output of the algorithm, we obtain an upper bound on the entanglement of the target state, and construct an approximation for its closest separable state. We benchmark the met"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.08055","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/2112.08055/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-05T04:38:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lzp4wJN/gprwKou+4OE6lHiQnY9gM/1GQn1av6lX9hQ/nxoZ39tj9Lw157lhJZkSMATVL3YuagQFPEacIymuBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T04:52:35.479963Z"},"content_sha256":"f0321de2dba0182a8f8c7a5c9578c6b5ea83d440b3d370d6b9b2daf90ef88714","schema_version":"1.0","event_id":"sha256:f0321de2dba0182a8f8c7a5c9578c6b5ea83d440b3d370d6b9b2daf90ef88714"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3YAJJULNNQU3OZMQKBURFHUDL4/bundle.json","state_url":"https://pith.science/pith/3YAJJULNNQU3OZMQKBURFHUDL4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3YAJJULNNQU3OZMQKBURFHUDL4/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-11T04:52:35Z","links":{"resolver":"https://pith.science/pith/3YAJJULNNQU3OZMQKBURFHUDL4","bundle":"https://pith.science/pith/3YAJJULNNQU3OZMQKBURFHUDL4/bundle.json","state":"https://pith.science/pith/3YAJJULNNQU3OZMQKBURFHUDL4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3YAJJULNNQU3OZMQKBURFHUDL4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:3YAJJULNNQU3OZMQKBURFHUDL4","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":"87ee3565b25af77a278a9852cebf9f1778337de02d2d7b12d08c09ec77634ccf","cross_cats_sorted":["cond-mat.dis-nn","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-15T11:50:25Z","title_canon_sha256":"195460f8a099672d010f6cc7ec27e20eaea0b071d006a79cc5e26a2bea7974b1"},"schema_version":"1.0","source":{"id":"2112.08055","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.08055","created_at":"2026-07-05T04:38:12Z"},{"alias_kind":"arxiv_version","alias_value":"2112.08055v5","created_at":"2026-07-05T04:38:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.08055","created_at":"2026-07-05T04:38:12Z"},{"alias_kind":"pith_short_12","alias_value":"3YAJJULNNQU3","created_at":"2026-07-05T04:38:12Z"},{"alias_kind":"pith_short_16","alias_value":"3YAJJULNNQU3OZMQ","created_at":"2026-07-05T04:38:12Z"},{"alias_kind":"pith_short_8","alias_value":"3YAJJULN","created_at":"2026-07-05T04:38:12Z"}],"graph_snapshots":[{"event_id":"sha256:f0321de2dba0182a8f8c7a5c9578c6b5ea83d440b3d370d6b9b2daf90ef88714","target":"graph","created_at":"2026-07-05T04:38:12Z","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/2112.08055/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Finding the closest separable state to a given target state is a notoriously difficult task, even more difficult than deciding whether a state is entangled or separable. To tackle this task, we parametrize separable states with a neural network and train it to minimize the distance to a given target state, with respect to a differentiable distance, such as the trace distance or Hilbert--Schmidt distance. By examining the output of the algorithm, we obtain an upper bound on the entanglement of the target state, and construct an approximation for its closest separable state. We benchmark the met","authors_text":"Antoine Girardin, Nicolas Brunner, Tam\\'as Kriv\\'achy","cross_cats":["cond-mat.dis-nn","cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-15T11:50:25Z","title":"Building separable approximations for quantum states via neural networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.08055","kind":"arxiv","version":5},"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:533773d80bb62bd4819bc39bb544e19d3fde491a0e4c984f66fdd0c0ca3cf6a5","target":"record","created_at":"2026-07-05T04:38:12Z","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":"87ee3565b25af77a278a9852cebf9f1778337de02d2d7b12d08c09ec77634ccf","cross_cats_sorted":["cond-mat.dis-nn","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-15T11:50:25Z","title_canon_sha256":"195460f8a099672d010f6cc7ec27e20eaea0b071d006a79cc5e26a2bea7974b1"},"schema_version":"1.0","source":{"id":"2112.08055","kind":"arxiv","version":5}},"canonical_sha256":"de0094d16d6c29b765905069129e835f30097c8b6a0e9eacf51fe6c34a49b1ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de0094d16d6c29b765905069129e835f30097c8b6a0e9eacf51fe6c34a49b1ef","first_computed_at":"2026-07-05T04:38:12.805077Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:38:12.805077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8bK9/NTkvU7pN+Q2FILOevrj0Gz3dCWhC7utp4dpJbEucT/vz5v27GDMilBDyPeYMNTXn3GvKw7ERjoMrwN7Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:38:12.805578Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.08055","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:533773d80bb62bd4819bc39bb544e19d3fde491a0e4c984f66fdd0c0ca3cf6a5","sha256:f0321de2dba0182a8f8c7a5c9578c6b5ea83d440b3d370d6b9b2daf90ef88714"],"state_sha256":"addfb55c9c83ece98f7b3a16850bdaa0986d6bb8c793dba31ff8c0f2f06be8fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BG3mOR2SrUdwBORAypA3slkaDX1rK/AaLfp9sJm3n+4e25YPReWp+O699vu1R680YFIHItA275RMWW+T1+lIAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T04:52:35.486560Z","bundle_sha256":"2e36e3ca583eff6792a0727b8fa3a70d6f0d61d8d47353947cdae905e17fa3c5"}}