{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:K7OBKRNRKQ6KSLJNLM54BDOL5T","short_pith_number":"pith:K7OBKRNR","canonical_record":{"source":{"id":"quant-ph/0504041","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-04-06T15:25:30Z","cross_cats_sorted":[],"title_canon_sha256":"8eef06bf0a2cf6e5e30f0f7dacf85753a9f13b6614f07e60719f75b31922871e","abstract_canon_sha256":"e3cfc9e7851a971cfd560db61f38811537e141e402e98c0639a070e8224cd614"},"schema_version":"1.0"},"canonical_sha256":"57dc1545b1543ca92d2d5b3bc08dcbecef3645dec40dc3e4cd13d65b62a4e496","source":{"kind":"arxiv","id":"quant-ph/0504041","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0504041","created_at":"2026-07-04T14:46:56Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0504041v1","created_at":"2026-07-04T14:46:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0504041","created_at":"2026-07-04T14:46:56Z"},{"alias_kind":"pith_short_12","alias_value":"K7OBKRNRKQ6K","created_at":"2026-07-04T14:46:56Z"},{"alias_kind":"pith_short_16","alias_value":"K7OBKRNRKQ6KSLJN","created_at":"2026-07-04T14:46:56Z"},{"alias_kind":"pith_short_8","alias_value":"K7OBKRNR","created_at":"2026-07-04T14:46:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:K7OBKRNRKQ6KSLJNLM54BDOL5T","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0504041","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-04-06T15:25:30Z","cross_cats_sorted":[],"title_canon_sha256":"8eef06bf0a2cf6e5e30f0f7dacf85753a9f13b6614f07e60719f75b31922871e","abstract_canon_sha256":"e3cfc9e7851a971cfd560db61f38811537e141e402e98c0639a070e8224cd614"},"schema_version":"1.0"},"canonical_sha256":"57dc1545b1543ca92d2d5b3bc08dcbecef3645dec40dc3e4cd13d65b62a4e496","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:46:56.983810Z","signature_b64":"ukuCXP05UwLonKtQ9QBDkayx824yoncy4FeMfWzk2BJbtH7DVc8+SWwxPUv5SMlmERZXgRba/12rhImYlAk6BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57dc1545b1543ca92d2d5b3bc08dcbecef3645dec40dc3e4cd13d65b62a4e496","last_reissued_at":"2026-07-04T14:46:56.983469Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:46:56.983469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0504041","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-04T14:46:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AYmQPXyP22hr6UdDhq4QAIvhZ3IPN/LFM772S+dvrRGpf/0E2f/KjgMO7LjNcf7l9a7EuqNJNyjMvOVVztdpCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T02:48:12.726897Z"},"content_sha256":"f824bbcd25e43706392d67037f14e1e87bbb1a8d58d731dcb49aa7b352d30cd0","schema_version":"1.0","event_id":"sha256:f824bbcd25e43706392d67037f14e1e87bbb1a8d58d731dcb49aa7b352d30cd0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:K7OBKRNRKQ6KSLJNLM54BDOL5T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards efficient algorithm deciding separability of distributed quantum states","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Pawel Horodecki, Piotr Badziag, Ryszard Horodecki","submitted_at":"2005-04-06T15:25:30Z","abstract_excerpt":"It is pointed out that separability problem for arbitrary multi-partite states can be fully solved by a finite size, elementary recursive algorithm. In the worse case scenario, the underlying numerical procedure, may grow doubly exponentially with the state's rank. Nevertheless, we argue that for generic states, analysis of concurrence matrices essentially reduces the task of solving separability problem in $m \\times n$ dimensions to solving a set of linear equations in about $\\binom{mn+D-1}{D}$ variables, where $D$ decreases with $mn$ and for large $mn$ it should not exceed 4. Moreover, the s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0504041","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/0504041/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-04T14:46:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9h23ZS0w8jFYjdFvv88gXUmnFzkrVKF5Os1SaesYOm0YgQ/XZeyybevqvqFPtaHrhMuX/BxpnDQPWJ8uwEtmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T02:48:12.727693Z"},"content_sha256":"771ab4c110addf4ee22e18f60bb85571521b8f07276858f008626df3523549c0","schema_version":"1.0","event_id":"sha256:771ab4c110addf4ee22e18f60bb85571521b8f07276858f008626df3523549c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K7OBKRNRKQ6KSLJNLM54BDOL5T/bundle.json","state_url":"https://pith.science/pith/K7OBKRNRKQ6KSLJNLM54BDOL5T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K7OBKRNRKQ6KSLJNLM54BDOL5T/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-05T02:48:12Z","links":{"resolver":"https://pith.science/pith/K7OBKRNRKQ6KSLJNLM54BDOL5T","bundle":"https://pith.science/pith/K7OBKRNRKQ6KSLJNLM54BDOL5T/bundle.json","state":"https://pith.science/pith/K7OBKRNRKQ6KSLJNLM54BDOL5T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K7OBKRNRKQ6KSLJNLM54BDOL5T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:K7OBKRNRKQ6KSLJNLM54BDOL5T","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":"e3cfc9e7851a971cfd560db61f38811537e141e402e98c0639a070e8224cd614","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2005-04-06T15:25:30Z","title_canon_sha256":"8eef06bf0a2cf6e5e30f0f7dacf85753a9f13b6614f07e60719f75b31922871e"},"schema_version":"1.0","source":{"id":"quant-ph/0504041","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0504041","created_at":"2026-07-04T14:46:56Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0504041v1","created_at":"2026-07-04T14:46:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0504041","created_at":"2026-07-04T14:46:56Z"},{"alias_kind":"pith_short_12","alias_value":"K7OBKRNRKQ6K","created_at":"2026-07-04T14:46:56Z"},{"alias_kind":"pith_short_16","alias_value":"K7OBKRNRKQ6KSLJN","created_at":"2026-07-04T14:46:56Z"},{"alias_kind":"pith_short_8","alias_value":"K7OBKRNR","created_at":"2026-07-04T14:46:56Z"}],"graph_snapshots":[{"event_id":"sha256:771ab4c110addf4ee22e18f60bb85571521b8f07276858f008626df3523549c0","target":"graph","created_at":"2026-07-04T14:46:56Z","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/0504041/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"It is pointed out that separability problem for arbitrary multi-partite states can be fully solved by a finite size, elementary recursive algorithm. In the worse case scenario, the underlying numerical procedure, may grow doubly exponentially with the state's rank. Nevertheless, we argue that for generic states, analysis of concurrence matrices essentially reduces the task of solving separability problem in $m \\times n$ dimensions to solving a set of linear equations in about $\\binom{mn+D-1}{D}$ variables, where $D$ decreases with $mn$ and for large $mn$ it should not exceed 4. Moreover, the s","authors_text":"Pawel Horodecki, Piotr Badziag, Ryszard Horodecki","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2005-04-06T15:25:30Z","title":"Towards efficient algorithm deciding separability of distributed quantum states"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0504041","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:f824bbcd25e43706392d67037f14e1e87bbb1a8d58d731dcb49aa7b352d30cd0","target":"record","created_at":"2026-07-04T14:46:56Z","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":"e3cfc9e7851a971cfd560db61f38811537e141e402e98c0639a070e8224cd614","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2005-04-06T15:25:30Z","title_canon_sha256":"8eef06bf0a2cf6e5e30f0f7dacf85753a9f13b6614f07e60719f75b31922871e"},"schema_version":"1.0","source":{"id":"quant-ph/0504041","kind":"arxiv","version":1}},"canonical_sha256":"57dc1545b1543ca92d2d5b3bc08dcbecef3645dec40dc3e4cd13d65b62a4e496","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57dc1545b1543ca92d2d5b3bc08dcbecef3645dec40dc3e4cd13d65b62a4e496","first_computed_at":"2026-07-04T14:46:56.983469Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:46:56.983469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ukuCXP05UwLonKtQ9QBDkayx824yoncy4FeMfWzk2BJbtH7DVc8+SWwxPUv5SMlmERZXgRba/12rhImYlAk6BQ==","signature_status":"signed_v1","signed_at":"2026-07-04T14:46:56.983810Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0504041","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f824bbcd25e43706392d67037f14e1e87bbb1a8d58d731dcb49aa7b352d30cd0","sha256:771ab4c110addf4ee22e18f60bb85571521b8f07276858f008626df3523549c0"],"state_sha256":"87239febed77e56cd8fa3d0856f63e843d1fc8672b7d5e8b3f758e119c5148ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cgcavq71P6fZcs1/Kxy80jD4OyIpDC/q1y9tDpqsJj2g+pHyxZyGaNWqVFC2jcW5pr7ig3/qC21jdz3IFdY/CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T02:48:12.733936Z","bundle_sha256":"134d026a223e1133715371a7c0527554fe6b1846d51469e6a123d5b44cb11cd8"}}