{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2004:NV54QTRM6QATGSA3W3ZVWRGSK2","short_pith_number":"pith:NV54QTRM","canonical_record":{"source":{"id":"quant-ph/0407179","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2004-07-22T13:51:16Z","cross_cats_sorted":[],"title_canon_sha256":"34cf47e15304815c61720bb6e8322c956289bd66e98cce6a1da4ef869e362e52","abstract_canon_sha256":"a53399a578b2fecb33dc4331580e33e64cd1c7a6a9af5a831a001d5f7b291366"},"schema_version":"1.0"},"canonical_sha256":"6d7bc84e2cf40133481bb6f35b44d25693c1e431f4ca0b554305e6fe30b32428","source":{"kind":"arxiv","id":"quant-ph/0407179","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0407179","created_at":"2026-07-04T16:50:21Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0407179v1","created_at":"2026-07-04T16:50:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0407179","created_at":"2026-07-04T16:50:21Z"},{"alias_kind":"pith_short_12","alias_value":"NV54QTRM6QAT","created_at":"2026-07-04T16:50:21Z"},{"alias_kind":"pith_short_16","alias_value":"NV54QTRM6QATGSA3","created_at":"2026-07-04T16:50:21Z"},{"alias_kind":"pith_short_8","alias_value":"NV54QTRM","created_at":"2026-07-04T16:50:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2004:NV54QTRM6QATGSA3W3ZVWRGSK2","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0407179","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2004-07-22T13:51:16Z","cross_cats_sorted":[],"title_canon_sha256":"34cf47e15304815c61720bb6e8322c956289bd66e98cce6a1da4ef869e362e52","abstract_canon_sha256":"a53399a578b2fecb33dc4331580e33e64cd1c7a6a9af5a831a001d5f7b291366"},"schema_version":"1.0"},"canonical_sha256":"6d7bc84e2cf40133481bb6f35b44d25693c1e431f4ca0b554305e6fe30b32428","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T16:50:21.520371Z","signature_b64":"hQE/myxjqJ346h1onDqyjSmyOEd3+6qjZX4m5xLBBpFlvXNNNv1/3MVwtOVj9sEIy4QqXitXpupgQIoGl9LLAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d7bc84e2cf40133481bb6f35b44d25693c1e431f4ca0b554305e6fe30b32428","last_reissued_at":"2026-07-04T16:50:21.520013Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T16:50:21.520013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0407179","source_version":1,"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-04T16:50:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yef5Jg2+XwKhGPAE5Zb8ZG9M2ORvIsicCHEl9CUow2L7lUGrkUkrGnt4QlSjIOxASSCmUWjU5qiLsApbZxTdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T19:13:36.686584Z"},"content_sha256":"ca75a8faedf6af0b22ef2110714585aa87446ef050dc4325174ef0fa28940bf2","schema_version":"1.0","event_id":"sha256:ca75a8faedf6af0b22ef2110714585aa87446ef050dc4325174ef0fa28940bf2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2004:NV54QTRM6QATGSA3W3ZVWRGSK2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A two-way algorithm for the entanglement problem","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dagmar Bruss, Florian Hulpke","submitted_at":"2004-07-22T13:51:16Z","abstract_excerpt":"We propose an algorithm which proves a given bipartite quantum state to be separable in a finite number of steps. Our approach is based on the search for a decomposition via a countable subset of product states, which is dense within all product states. Performing our algorithm simultaneously with the algorithm by Doherty, Parrilo and Spedalieri (which proves a quantum state to be entangled in a finite number of steps) leads to a two-way algorithm that terminates for any input state. Only for a set of arbitrary small measure near the border between separable and entangled states the result is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0407179","kind":"arxiv","version":1},"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/quant-ph/0407179/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-04T16:50:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7ylwxVOCXGebYMjUiEalm7xQ71sfBA5BlWGex3AybrxfRZzgWxnTiID8Pk7jbVYnF42cBGHdhvjjDcYWOSQcDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T19:13:36.688410Z"},"content_sha256":"fb006a22fcf6cff6d3b7a44af0fbb9f1b9d297465da190ab1583773fc2e4e84c","schema_version":"1.0","event_id":"sha256:fb006a22fcf6cff6d3b7a44af0fbb9f1b9d297465da190ab1583773fc2e4e84c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NV54QTRM6QATGSA3W3ZVWRGSK2/bundle.json","state_url":"https://pith.science/pith/NV54QTRM6QATGSA3W3ZVWRGSK2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NV54QTRM6QATGSA3W3ZVWRGSK2/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-10T19:13:36Z","links":{"resolver":"https://pith.science/pith/NV54QTRM6QATGSA3W3ZVWRGSK2","bundle":"https://pith.science/pith/NV54QTRM6QATGSA3W3ZVWRGSK2/bundle.json","state":"https://pith.science/pith/NV54QTRM6QATGSA3W3ZVWRGSK2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NV54QTRM6QATGSA3W3ZVWRGSK2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:NV54QTRM6QATGSA3W3ZVWRGSK2","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":"a53399a578b2fecb33dc4331580e33e64cd1c7a6a9af5a831a001d5f7b291366","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2004-07-22T13:51:16Z","title_canon_sha256":"34cf47e15304815c61720bb6e8322c956289bd66e98cce6a1da4ef869e362e52"},"schema_version":"1.0","source":{"id":"quant-ph/0407179","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0407179","created_at":"2026-07-04T16:50:21Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0407179v1","created_at":"2026-07-04T16:50:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0407179","created_at":"2026-07-04T16:50:21Z"},{"alias_kind":"pith_short_12","alias_value":"NV54QTRM6QAT","created_at":"2026-07-04T16:50:21Z"},{"alias_kind":"pith_short_16","alias_value":"NV54QTRM6QATGSA3","created_at":"2026-07-04T16:50:21Z"},{"alias_kind":"pith_short_8","alias_value":"NV54QTRM","created_at":"2026-07-04T16:50:21Z"}],"graph_snapshots":[{"event_id":"sha256:fb006a22fcf6cff6d3b7a44af0fbb9f1b9d297465da190ab1583773fc2e4e84c","target":"graph","created_at":"2026-07-04T16:50:21Z","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/quant-ph/0407179/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose an algorithm which proves a given bipartite quantum state to be separable in a finite number of steps. Our approach is based on the search for a decomposition via a countable subset of product states, which is dense within all product states. Performing our algorithm simultaneously with the algorithm by Doherty, Parrilo and Spedalieri (which proves a quantum state to be entangled in a finite number of steps) leads to a two-way algorithm that terminates for any input state. Only for a set of arbitrary small measure near the border between separable and entangled states the result is ","authors_text":"Dagmar Bruss, Florian Hulpke","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2004-07-22T13:51:16Z","title":"A two-way algorithm for the entanglement problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0407179","kind":"arxiv","version":1},"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:ca75a8faedf6af0b22ef2110714585aa87446ef050dc4325174ef0fa28940bf2","target":"record","created_at":"2026-07-04T16:50:21Z","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":"a53399a578b2fecb33dc4331580e33e64cd1c7a6a9af5a831a001d5f7b291366","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2004-07-22T13:51:16Z","title_canon_sha256":"34cf47e15304815c61720bb6e8322c956289bd66e98cce6a1da4ef869e362e52"},"schema_version":"1.0","source":{"id":"quant-ph/0407179","kind":"arxiv","version":1}},"canonical_sha256":"6d7bc84e2cf40133481bb6f35b44d25693c1e431f4ca0b554305e6fe30b32428","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d7bc84e2cf40133481bb6f35b44d25693c1e431f4ca0b554305e6fe30b32428","first_computed_at":"2026-07-04T16:50:21.520013Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T16:50:21.520013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hQE/myxjqJ346h1onDqyjSmyOEd3+6qjZX4m5xLBBpFlvXNNNv1/3MVwtOVj9sEIy4QqXitXpupgQIoGl9LLAg==","signature_status":"signed_v1","signed_at":"2026-07-04T16:50:21.520371Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0407179","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca75a8faedf6af0b22ef2110714585aa87446ef050dc4325174ef0fa28940bf2","sha256:fb006a22fcf6cff6d3b7a44af0fbb9f1b9d297465da190ab1583773fc2e4e84c"],"state_sha256":"f57ca801b9df53a956c16dbfcc2e9ffa082d814dcede992c371a17fe4c314262"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NJT4yo7fhLDnwXLqaJz/Yb0KM9/VDuyBphl/Z7b8jCVEY3RX1dLS+07LTtUeLyG8FtnxbTyADprdHQj8tkRvBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T19:13:36.700922Z","bundle_sha256":"6a38e806466981f8d51872b70ca4e2e5e69341328fa1aff039febdd853c54cf5"}}