{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:W7WVBBXIZKRDVUUFYZJB6QBJVY","short_pith_number":"pith:W7WVBBXI","canonical_record":{"source":{"id":"1503.00272","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-03-01T13:20:36Z","cross_cats_sorted":[],"title_canon_sha256":"03709269568a79480849ecc45cd191fbcda8dfd2e1a9f2afd94af0399d5caa82","abstract_canon_sha256":"5c471225412ab7fbe22cae40d5c32478db9d6b472f2f5ea2cea888d80eb02813"},"schema_version":"1.0"},"canonical_sha256":"b7ed5086e8caa23ad285c6521f4029ae20f173fc17c2a95dffb7bacdfbfaf75e","source":{"kind":"arxiv","id":"1503.00272","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00272","created_at":"2026-05-18T02:25:54Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00272v1","created_at":"2026-05-18T02:25:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00272","created_at":"2026-05-18T02:25:54Z"},{"alias_kind":"pith_short_12","alias_value":"W7WVBBXIZKRD","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"W7WVBBXIZKRDVUUF","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"W7WVBBXI","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:W7WVBBXIZKRDVUUFYZJB6QBJVY","target":"record","payload":{"canonical_record":{"source":{"id":"1503.00272","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-03-01T13:20:36Z","cross_cats_sorted":[],"title_canon_sha256":"03709269568a79480849ecc45cd191fbcda8dfd2e1a9f2afd94af0399d5caa82","abstract_canon_sha256":"5c471225412ab7fbe22cae40d5c32478db9d6b472f2f5ea2cea888d80eb02813"},"schema_version":"1.0"},"canonical_sha256":"b7ed5086e8caa23ad285c6521f4029ae20f173fc17c2a95dffb7bacdfbfaf75e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:54.791650Z","signature_b64":"IoHu8XdNbJ1b5Kv3XsUJ7lJzjhlkcpCiqiVOIzQlXY+rtG2Wr569qGYgu5N7OJLWlhxDk8BDaFSvHojUyFDoDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7ed5086e8caa23ad285c6521f4029ae20f173fc17c2a95dffb7bacdfbfaf75e","last_reissued_at":"2026-05-18T02:25:54.791292Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:54.791292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.00272","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-05-18T02:25:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"83GKunIHeUo0i6QdnhqBpRgvmfV+8y+nKiPhjxulrCPBJN8q0pd1PEBKij/AHnbMFrWsEi+89tXhRdEOibLVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:12:32.951923Z"},"content_sha256":"88b84569370d37520a126778fd6c7472c939e3105b96908064a1b16d939d9753","schema_version":"1.0","event_id":"sha256:88b84569370d37520a126778fd6c7472c939e3105b96908064a1b16d939d9753"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:W7WVBBXIZKRDVUUFYZJB6QBJVY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing the maximum violation of a Bell inequality is NP-complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"C. H. Raymond Ooi, J. Batle","submitted_at":"2015-03-01T13:20:36Z","abstract_excerpt":"The number of steps required in order to maximize a Bell inequality for arbitrary number of qubits is shown to grow exponentially with either the number of steps and the number of parties involved. The proof that the optimization of such correlation measure is a NP-problem is based on an operational perspective involving a Turing machine, which follows a general algorithm. The implications for the computability of the so called {\\it nonlocality} for any number of qubits is similar to recent results involving entanglement or similar quantum correlation-based measures."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00272","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":""},"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-05-18T02:25:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FAWJkO72bbI30Sg+zkVbIVXyBr8WfyKwemUH0WwXkU4RJFGMNZ1QzUGQqOkH944l3+PsIDVmnKlW0wuEE1TFDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:12:32.952676Z"},"content_sha256":"6145c14ba60cf19f2f172bd99278e6e838cd962af7507a0b5a582cda273ae25a","schema_version":"1.0","event_id":"sha256:6145c14ba60cf19f2f172bd99278e6e838cd962af7507a0b5a582cda273ae25a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W7WVBBXIZKRDVUUFYZJB6QBJVY/bundle.json","state_url":"https://pith.science/pith/W7WVBBXIZKRDVUUFYZJB6QBJVY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W7WVBBXIZKRDVUUFYZJB6QBJVY/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-06-12T03:12:32Z","links":{"resolver":"https://pith.science/pith/W7WVBBXIZKRDVUUFYZJB6QBJVY","bundle":"https://pith.science/pith/W7WVBBXIZKRDVUUFYZJB6QBJVY/bundle.json","state":"https://pith.science/pith/W7WVBBXIZKRDVUUFYZJB6QBJVY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W7WVBBXIZKRDVUUFYZJB6QBJVY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:W7WVBBXIZKRDVUUFYZJB6QBJVY","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":"5c471225412ab7fbe22cae40d5c32478db9d6b472f2f5ea2cea888d80eb02813","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-03-01T13:20:36Z","title_canon_sha256":"03709269568a79480849ecc45cd191fbcda8dfd2e1a9f2afd94af0399d5caa82"},"schema_version":"1.0","source":{"id":"1503.00272","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00272","created_at":"2026-05-18T02:25:54Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00272v1","created_at":"2026-05-18T02:25:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00272","created_at":"2026-05-18T02:25:54Z"},{"alias_kind":"pith_short_12","alias_value":"W7WVBBXIZKRD","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"W7WVBBXIZKRDVUUF","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"W7WVBBXI","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:6145c14ba60cf19f2f172bd99278e6e838cd962af7507a0b5a582cda273ae25a","target":"graph","created_at":"2026-05-18T02:25:54Z","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"},"paper":{"abstract_excerpt":"The number of steps required in order to maximize a Bell inequality for arbitrary number of qubits is shown to grow exponentially with either the number of steps and the number of parties involved. The proof that the optimization of such correlation measure is a NP-problem is based on an operational perspective involving a Turing machine, which follows a general algorithm. The implications for the computability of the so called {\\it nonlocality} for any number of qubits is similar to recent results involving entanglement or similar quantum correlation-based measures.","authors_text":"C. H. Raymond Ooi, J. Batle","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-03-01T13:20:36Z","title":"Computing the maximum violation of a Bell inequality is NP-complete"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00272","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:88b84569370d37520a126778fd6c7472c939e3105b96908064a1b16d939d9753","target":"record","created_at":"2026-05-18T02:25:54Z","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":"5c471225412ab7fbe22cae40d5c32478db9d6b472f2f5ea2cea888d80eb02813","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-03-01T13:20:36Z","title_canon_sha256":"03709269568a79480849ecc45cd191fbcda8dfd2e1a9f2afd94af0399d5caa82"},"schema_version":"1.0","source":{"id":"1503.00272","kind":"arxiv","version":1}},"canonical_sha256":"b7ed5086e8caa23ad285c6521f4029ae20f173fc17c2a95dffb7bacdfbfaf75e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7ed5086e8caa23ad285c6521f4029ae20f173fc17c2a95dffb7bacdfbfaf75e","first_computed_at":"2026-05-18T02:25:54.791292Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:54.791292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IoHu8XdNbJ1b5Kv3XsUJ7lJzjhlkcpCiqiVOIzQlXY+rtG2Wr569qGYgu5N7OJLWlhxDk8BDaFSvHojUyFDoDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:54.791650Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.00272","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88b84569370d37520a126778fd6c7472c939e3105b96908064a1b16d939d9753","sha256:6145c14ba60cf19f2f172bd99278e6e838cd962af7507a0b5a582cda273ae25a"],"state_sha256":"6c2c7f840f61efec29f1f8ea26fc1df584f4f9762c4b6cd1ba6712618e79a3b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qo1f7sHmcIVs45U2dsg+RxlkLVw6f1K9GJoj/R8pACDBieytTmjavE/XK9GU40EqW7Pl1WG+GlDR/lUCEniAAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T03:12:32.956940Z","bundle_sha256":"f848d8a12621370961e37408d7e46e38b9fcd6a785d5c419f206c2839e2e04c8"}}