{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:RLCUGRDAJJ7DUCLIL6VWZT6HRS","short_pith_number":"pith:RLCUGRDA","canonical_record":{"source":{"id":"0709.2090","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2007-09-13T14:46:45Z","cross_cats_sorted":[],"title_canon_sha256":"2ebc38b26f3e47c496b18f26de7bc0d8902c34e8d82f866ef144373a1e7f5e75","abstract_canon_sha256":"e1788801921f67501ec117d474072ac500488be15cd3929ccfed27728550afe7"},"schema_version":"1.0"},"canonical_sha256":"8ac54344604a7e3a09685fab6ccfc78ca29a0c363d5fec31f279a115dd67ddfb","source":{"kind":"arxiv","id":"0709.2090","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0709.2090","created_at":"2026-07-04T15:15:01Z"},{"alias_kind":"arxiv_version","alias_value":"0709.2090v3","created_at":"2026-07-04T15:15:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0709.2090","created_at":"2026-07-04T15:15:01Z"},{"alias_kind":"pith_short_12","alias_value":"RLCUGRDAJJ7D","created_at":"2026-07-04T15:15:01Z"},{"alias_kind":"pith_short_16","alias_value":"RLCUGRDAJJ7DUCLI","created_at":"2026-07-04T15:15:01Z"},{"alias_kind":"pith_short_8","alias_value":"RLCUGRDA","created_at":"2026-07-04T15:15:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:RLCUGRDAJJ7DUCLIL6VWZT6HRS","target":"record","payload":{"canonical_record":{"source":{"id":"0709.2090","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2007-09-13T14:46:45Z","cross_cats_sorted":[],"title_canon_sha256":"2ebc38b26f3e47c496b18f26de7bc0d8902c34e8d82f866ef144373a1e7f5e75","abstract_canon_sha256":"e1788801921f67501ec117d474072ac500488be15cd3929ccfed27728550afe7"},"schema_version":"1.0"},"canonical_sha256":"8ac54344604a7e3a09685fab6ccfc78ca29a0c363d5fec31f279a115dd67ddfb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:15:01.434025Z","signature_b64":"pzbG49OSmxaa2jfKL91/G1bcm4Ebcn6k40llePN8J3F3ZXx9jBXDmQxGemSQFfInZgfCnos4p2j9j0kzp5mMBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ac54344604a7e3a09685fab6ccfc78ca29a0c363d5fec31f279a115dd67ddfb","last_reissued_at":"2026-07-04T15:15:01.433591Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:15:01.433591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0709.2090","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-04T15:15:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Olqd5V/f82HAKX1t8f6CnQMZgnyQuwKsu8NOL+e+MAISzcwCW/UF/MAwwXEZDPfWSvi9AFqKbCnHyUW6HEqAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T16:32:01.285056Z"},"content_sha256":"c622cb418507ff2656b65dcacf3a6eca0b6dafe6f9d60ebf1e92827b05a7da8a","schema_version":"1.0","event_id":"sha256:c622cb418507ff2656b65dcacf3a6eca0b6dafe6f9d60ebf1e92827b05a7da8a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:RLCUGRDAJJ7DUCLIL6VWZT6HRS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of Computing Zero-Error and Holevo Capacity of Quantum Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Peter W. Shor, Salman Beigi","submitted_at":"2007-09-13T14:46:45Z","abstract_excerpt":"One of the main problems in quantum complexity theory is that our understanding of the theory of QMA-completeness is not as rich as its classical analogue, the NP- completeness. In this paper we consider the clique problem in graphs, which is NP- complete, and try to find its quantum analogue. We show that, quantum clique problem can be defined as follows; Given a quantum channel, decide whether there are k states that are distinguishable, with no error, after passing through channel. This definition comes from reconsidering the clique problem in terms of the zero-error capacity of graphs, and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0709.2090","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/0709.2090/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-04T15:15:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bZh8Hfdipivit6PYKPNKbc+NP3nCln83Dlur2nMXQ9jSKLQCO/tO6cdMxUaAqvQTwXMDjLI/kW7HVna93TN1Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T16:32:01.285557Z"},"content_sha256":"be4294fc3e8d0ddc136ba546b4899218d80d14ecb3810a6aeddcce34a4b622cd","schema_version":"1.0","event_id":"sha256:be4294fc3e8d0ddc136ba546b4899218d80d14ecb3810a6aeddcce34a4b622cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RLCUGRDAJJ7DUCLIL6VWZT6HRS/bundle.json","state_url":"https://pith.science/pith/RLCUGRDAJJ7DUCLIL6VWZT6HRS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RLCUGRDAJJ7DUCLIL6VWZT6HRS/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-06T16:32:01Z","links":{"resolver":"https://pith.science/pith/RLCUGRDAJJ7DUCLIL6VWZT6HRS","bundle":"https://pith.science/pith/RLCUGRDAJJ7DUCLIL6VWZT6HRS/bundle.json","state":"https://pith.science/pith/RLCUGRDAJJ7DUCLIL6VWZT6HRS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RLCUGRDAJJ7DUCLIL6VWZT6HRS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:RLCUGRDAJJ7DUCLIL6VWZT6HRS","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":"e1788801921f67501ec117d474072ac500488be15cd3929ccfed27728550afe7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2007-09-13T14:46:45Z","title_canon_sha256":"2ebc38b26f3e47c496b18f26de7bc0d8902c34e8d82f866ef144373a1e7f5e75"},"schema_version":"1.0","source":{"id":"0709.2090","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0709.2090","created_at":"2026-07-04T15:15:01Z"},{"alias_kind":"arxiv_version","alias_value":"0709.2090v3","created_at":"2026-07-04T15:15:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0709.2090","created_at":"2026-07-04T15:15:01Z"},{"alias_kind":"pith_short_12","alias_value":"RLCUGRDAJJ7D","created_at":"2026-07-04T15:15:01Z"},{"alias_kind":"pith_short_16","alias_value":"RLCUGRDAJJ7DUCLI","created_at":"2026-07-04T15:15:01Z"},{"alias_kind":"pith_short_8","alias_value":"RLCUGRDA","created_at":"2026-07-04T15:15:01Z"}],"graph_snapshots":[{"event_id":"sha256:be4294fc3e8d0ddc136ba546b4899218d80d14ecb3810a6aeddcce34a4b622cd","target":"graph","created_at":"2026-07-04T15:15:01Z","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/0709.2090/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"One of the main problems in quantum complexity theory is that our understanding of the theory of QMA-completeness is not as rich as its classical analogue, the NP- completeness. In this paper we consider the clique problem in graphs, which is NP- complete, and try to find its quantum analogue. We show that, quantum clique problem can be defined as follows; Given a quantum channel, decide whether there are k states that are distinguishable, with no error, after passing through channel. This definition comes from reconsidering the clique problem in terms of the zero-error capacity of graphs, and","authors_text":"Peter W. Shor, Salman Beigi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2007-09-13T14:46:45Z","title":"On the Complexity of Computing Zero-Error and Holevo Capacity of Quantum Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0709.2090","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:c622cb418507ff2656b65dcacf3a6eca0b6dafe6f9d60ebf1e92827b05a7da8a","target":"record","created_at":"2026-07-04T15:15:01Z","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":"e1788801921f67501ec117d474072ac500488be15cd3929ccfed27728550afe7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2007-09-13T14:46:45Z","title_canon_sha256":"2ebc38b26f3e47c496b18f26de7bc0d8902c34e8d82f866ef144373a1e7f5e75"},"schema_version":"1.0","source":{"id":"0709.2090","kind":"arxiv","version":3}},"canonical_sha256":"8ac54344604a7e3a09685fab6ccfc78ca29a0c363d5fec31f279a115dd67ddfb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ac54344604a7e3a09685fab6ccfc78ca29a0c363d5fec31f279a115dd67ddfb","first_computed_at":"2026-07-04T15:15:01.433591Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:15:01.433591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pzbG49OSmxaa2jfKL91/G1bcm4Ebcn6k40llePN8J3F3ZXx9jBXDmQxGemSQFfInZgfCnos4p2j9j0kzp5mMBw==","signature_status":"signed_v1","signed_at":"2026-07-04T15:15:01.434025Z","signed_message":"canonical_sha256_bytes"},"source_id":"0709.2090","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c622cb418507ff2656b65dcacf3a6eca0b6dafe6f9d60ebf1e92827b05a7da8a","sha256:be4294fc3e8d0ddc136ba546b4899218d80d14ecb3810a6aeddcce34a4b622cd"],"state_sha256":"d8cf6dde36ef782e67c3e944f84b18fec8503d66f5082e3313889ac218048c7f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J98IP1or1VdOgePkw7dWTM5eF5+ruaXxYUPlJKM+b2zucoL9FK7NaiFfD0Idz3BsAj3Rq+YxCE1zYBZQWQB6CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T16:32:01.296238Z","bundle_sha256":"7cfd7fe8c6c7bbdc1e2f358050d5c63e20fc86940164bbdc1c24c05b68897065"}}