{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:35U33D2E4TVLHMFRUQ7L33HIX3","short_pith_number":"pith:35U33D2E","canonical_record":{"source":{"id":"1811.06599","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-11-15T21:47:49Z","cross_cats_sorted":[],"title_canon_sha256":"e4c29cd7780956825f4c6e1f6b881735b86514557f25d952a9616896b48217ca","abstract_canon_sha256":"7888413ecdfeda927a557b73e9f2715b3130f7d8ea54eb86f9cddcfd7b37415f"},"schema_version":"1.0"},"canonical_sha256":"df69bd8f44e4eab3b0b1a43ebdece8beda9eb882e3b128a67e9fd5d39ddc5e67","source":{"kind":"arxiv","id":"1811.06599","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06599","created_at":"2026-07-05T01:23:07Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06599v3","created_at":"2026-07-05T01:23:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06599","created_at":"2026-07-05T01:23:07Z"},{"alias_kind":"pith_short_12","alias_value":"35U33D2E4TVL","created_at":"2026-07-05T01:23:07Z"},{"alias_kind":"pith_short_16","alias_value":"35U33D2E4TVLHMFR","created_at":"2026-07-05T01:23:07Z"},{"alias_kind":"pith_short_8","alias_value":"35U33D2E","created_at":"2026-07-05T01:23:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:35U33D2E4TVLHMFRUQ7L33HIX3","target":"record","payload":{"canonical_record":{"source":{"id":"1811.06599","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-11-15T21:47:49Z","cross_cats_sorted":[],"title_canon_sha256":"e4c29cd7780956825f4c6e1f6b881735b86514557f25d952a9616896b48217ca","abstract_canon_sha256":"7888413ecdfeda927a557b73e9f2715b3130f7d8ea54eb86f9cddcfd7b37415f"},"schema_version":"1.0"},"canonical_sha256":"df69bd8f44e4eab3b0b1a43ebdece8beda9eb882e3b128a67e9fd5d39ddc5e67","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:23:07.943103Z","signature_b64":"S5mlBPwmgmfnG9fWznLi0Wv6FmB8Ahf3cRmTclDW2J3yhxwYYXW1rpK1zBfBMLljFa+yIx5TUA+ztyKfgaZxAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df69bd8f44e4eab3b0b1a43ebdece8beda9eb882e3b128a67e9fd5d39ddc5e67","last_reissued_at":"2026-07-05T01:23:07.942675Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:23:07.942675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.06599","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-07-05T01:23:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bExZNsZb0gK7H/Ayh8l8hp7FvaO7PDn5urfcmN6m0oDZbuhsW+90k9KB6BeGzoTEtb9u3HOz2oUL2GMsNXjbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T12:58:17.024597Z"},"content_sha256":"bb07c9df4713d35b0ba7a5fe1c63905648a5f8aee405a6a05145082350beb44a","schema_version":"1.0","event_id":"sha256:bb07c9df4713d35b0ba7a5fe1c63905648a5f8aee405a6a05145082350beb44a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:35U33D2E4TVLHMFRUQ7L33HIX3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hilbert-Schmidt distance and entanglement witnessing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Marcin Wie\\'sniak, Omer Sakarya, Palash Pandya","submitted_at":"2018-11-15T21:47:49Z","abstract_excerpt":"Gilbert proposed an algorithm for bounding the distance between a given point and a convex set. In this article we apply the Gilbert's algorithm to get an upper bound on the Hilbert-Schmidt distance between a given state and the set of separable states. While Hilbert Schmidt Distance does not form a proper entanglement measure, it can nevertheless be useful for witnessing entanglement. We provide here a few methods based on the Gilbert's algorithm that can reliably qualify a given state as strongly entangled or practically separable, while being computationally efficient. The method also outpu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06599","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1811.06599/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-05T01:23:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"guLU86t5+qD/iTOI/uTlxPZBW0Z660Bd+hGn+0VBZ5TysWlTc6xHIsxYI32UKKkY/S534a8iJzds0QQ+zH3+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T12:58:17.025259Z"},"content_sha256":"efcb97373a0e6b4d56277568be1fe9164d859ee9fdab5f014eb01480c6ea7fc1","schema_version":"1.0","event_id":"sha256:efcb97373a0e6b4d56277568be1fe9164d859ee9fdab5f014eb01480c6ea7fc1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/35U33D2E4TVLHMFRUQ7L33HIX3/bundle.json","state_url":"https://pith.science/pith/35U33D2E4TVLHMFRUQ7L33HIX3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/35U33D2E4TVLHMFRUQ7L33HIX3/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-07-05T12:58:17Z","links":{"resolver":"https://pith.science/pith/35U33D2E4TVLHMFRUQ7L33HIX3","bundle":"https://pith.science/pith/35U33D2E4TVLHMFRUQ7L33HIX3/bundle.json","state":"https://pith.science/pith/35U33D2E4TVLHMFRUQ7L33HIX3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/35U33D2E4TVLHMFRUQ7L33HIX3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:35U33D2E4TVLHMFRUQ7L33HIX3","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":"7888413ecdfeda927a557b73e9f2715b3130f7d8ea54eb86f9cddcfd7b37415f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-11-15T21:47:49Z","title_canon_sha256":"e4c29cd7780956825f4c6e1f6b881735b86514557f25d952a9616896b48217ca"},"schema_version":"1.0","source":{"id":"1811.06599","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06599","created_at":"2026-07-05T01:23:07Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06599v3","created_at":"2026-07-05T01:23:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06599","created_at":"2026-07-05T01:23:07Z"},{"alias_kind":"pith_short_12","alias_value":"35U33D2E4TVL","created_at":"2026-07-05T01:23:07Z"},{"alias_kind":"pith_short_16","alias_value":"35U33D2E4TVLHMFR","created_at":"2026-07-05T01:23:07Z"},{"alias_kind":"pith_short_8","alias_value":"35U33D2E","created_at":"2026-07-05T01:23:07Z"}],"graph_snapshots":[{"event_id":"sha256:efcb97373a0e6b4d56277568be1fe9164d859ee9fdab5f014eb01480c6ea7fc1","target":"graph","created_at":"2026-07-05T01:23:07Z","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/1811.06599/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Gilbert proposed an algorithm for bounding the distance between a given point and a convex set. In this article we apply the Gilbert's algorithm to get an upper bound on the Hilbert-Schmidt distance between a given state and the set of separable states. While Hilbert Schmidt Distance does not form a proper entanglement measure, it can nevertheless be useful for witnessing entanglement. We provide here a few methods based on the Gilbert's algorithm that can reliably qualify a given state as strongly entangled or practically separable, while being computationally efficient. The method also outpu","authors_text":"Marcin Wie\\'sniak, Omer Sakarya, Palash Pandya","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-11-15T21:47:49Z","title":"Hilbert-Schmidt distance and entanglement witnessing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06599","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:bb07c9df4713d35b0ba7a5fe1c63905648a5f8aee405a6a05145082350beb44a","target":"record","created_at":"2026-07-05T01:23:07Z","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":"7888413ecdfeda927a557b73e9f2715b3130f7d8ea54eb86f9cddcfd7b37415f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-11-15T21:47:49Z","title_canon_sha256":"e4c29cd7780956825f4c6e1f6b881735b86514557f25d952a9616896b48217ca"},"schema_version":"1.0","source":{"id":"1811.06599","kind":"arxiv","version":3}},"canonical_sha256":"df69bd8f44e4eab3b0b1a43ebdece8beda9eb882e3b128a67e9fd5d39ddc5e67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df69bd8f44e4eab3b0b1a43ebdece8beda9eb882e3b128a67e9fd5d39ddc5e67","first_computed_at":"2026-07-05T01:23:07.942675Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:23:07.942675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S5mlBPwmgmfnG9fWznLi0Wv6FmB8Ahf3cRmTclDW2J3yhxwYYXW1rpK1zBfBMLljFa+yIx5TUA+ztyKfgaZxAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:23:07.943103Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.06599","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb07c9df4713d35b0ba7a5fe1c63905648a5f8aee405a6a05145082350beb44a","sha256:efcb97373a0e6b4d56277568be1fe9164d859ee9fdab5f014eb01480c6ea7fc1"],"state_sha256":"226d2c9b52196deec708c3bbd6e79c3e81935aa26c62a960a05ff6f4c5aa4675"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JYzX2LhMWc21J6n8NimkuisYlt+9Rgm2n3c/6eMN01/7l3IDvZ8is0c4xvkqOVOvguVNFUBzCUeoZLWrCwO9DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T12:58:17.028767Z","bundle_sha256":"23862d8f21c008288060b165279d9df3686efc6da1c2955e66ba37a80fc6c051"}}