{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:1999:E27NV75ORQJCYPRG3DU3HQJUWT","short_pith_number":"pith:E27NV75O","canonical_record":{"source":{"id":"quant-ph/9907056","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1999-07-16T15:00:38Z","cross_cats_sorted":[],"title_canon_sha256":"564f05fe9b8f7f94ed89354588347524431ce66a22c8579746744936647ac6d6","abstract_canon_sha256":"224ad8113f422819474d4f2eb400571762d85b4495080dc428a5f74233215e50"},"schema_version":"1.0"},"canonical_sha256":"26bedaffae8c122c3e26d8e9b3c134b4c6271f5b43cbc49adbf69ba6aff9c173","source":{"kind":"arxiv","id":"quant-ph/9907056","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/9907056","created_at":"2026-07-04T14:47:27Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9907056v3","created_at":"2026-07-04T14:47:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9907056","created_at":"2026-07-04T14:47:27Z"},{"alias_kind":"pith_short_12","alias_value":"E27NV75ORQJC","created_at":"2026-07-04T14:47:27Z"},{"alias_kind":"pith_short_16","alias_value":"E27NV75ORQJCYPRG","created_at":"2026-07-04T14:47:27Z"},{"alias_kind":"pith_short_8","alias_value":"E27NV75O","created_at":"2026-07-04T14:47:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:1999:E27NV75ORQJCYPRG3DU3HQJUWT","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/9907056","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1999-07-16T15:00:38Z","cross_cats_sorted":[],"title_canon_sha256":"564f05fe9b8f7f94ed89354588347524431ce66a22c8579746744936647ac6d6","abstract_canon_sha256":"224ad8113f422819474d4f2eb400571762d85b4495080dc428a5f74233215e50"},"schema_version":"1.0"},"canonical_sha256":"26bedaffae8c122c3e26d8e9b3c134b4c6271f5b43cbc49adbf69ba6aff9c173","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:47:27.449597Z","signature_b64":"7LIIpDqmgvg/uVKrWLWFaRHELw/B2R2Mbpy4ajXnn5lJypF8uYFapjddOUYh7SEujo1jo5ajyAyGGD1nuMnWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26bedaffae8c122c3e26d8e9b3c134b4c6271f5b43cbc49adbf69ba6aff9c173","last_reissued_at":"2026-07-04T14:47:27.449221Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:47:27.449221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/9907056","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-04T14:47:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GUzn/3IuaCdwBK+Ghai8RxMQ/kmg+WdmmFGL5S4oBAKOmKD8SixNgsA6LYuF0ydDMKLsWCGNpffLr4n0vfjACQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T17:14:08.346209Z"},"content_sha256":"8b676711a06966d30da378671c1b546318e1ef69ae7eb0c055478c4231fb834e","schema_version":"1.0","event_id":"sha256:8b676711a06966d30da378671c1b546318e1ef69ae7eb0c055478c4231fb834e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:1999:E27NV75ORQJCYPRG3DU3HQJUWT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A quantum circuit for OR","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Herbert J. Bernstein, Howard Barnum, Lee Spector","submitted_at":"1999-07-16T15:00:38Z","abstract_excerpt":"We give the first quantum circuit for computing $f(0)$ OR $f(1)$ more reliably than is classically possible with a single evaluation of the function. OR therefore joins XOR (i.e. parity, $f(0) \\oplus f(1)$) to give the full set of logical connectives (up to relabeling of inputs and outputs) for which there is quantum speedup. The XOR algorithm is of fundamental importance in quantum computation; our OR algorithm (found with the aid of genetic programming), may represent a new quantum computational effect, also useful as a ``subroutine''."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9907056","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/quant-ph/9907056/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:47:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kbOkxU466+fX4zdCfp+Xwr86s2fpeYhEw7PEfFEWICpFEMycKKuJnP/Mw7h3BjDhKe3HptDQ72mrT2JAMyCRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T17:14:08.346749Z"},"content_sha256":"a3a1d6e9f83a92af71bb3430a698ce0d608aee363b487a148929cca313921ac0","schema_version":"1.0","event_id":"sha256:a3a1d6e9f83a92af71bb3430a698ce0d608aee363b487a148929cca313921ac0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E27NV75ORQJCYPRG3DU3HQJUWT/bundle.json","state_url":"https://pith.science/pith/E27NV75ORQJCYPRG3DU3HQJUWT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E27NV75ORQJCYPRG3DU3HQJUWT/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-06T17:14:08Z","links":{"resolver":"https://pith.science/pith/E27NV75ORQJCYPRG3DU3HQJUWT","bundle":"https://pith.science/pith/E27NV75ORQJCYPRG3DU3HQJUWT/bundle.json","state":"https://pith.science/pith/E27NV75ORQJCYPRG3DU3HQJUWT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E27NV75ORQJCYPRG3DU3HQJUWT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1999:E27NV75ORQJCYPRG3DU3HQJUWT","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":"224ad8113f422819474d4f2eb400571762d85b4495080dc428a5f74233215e50","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"1999-07-16T15:00:38Z","title_canon_sha256":"564f05fe9b8f7f94ed89354588347524431ce66a22c8579746744936647ac6d6"},"schema_version":"1.0","source":{"id":"quant-ph/9907056","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/9907056","created_at":"2026-07-04T14:47:27Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9907056v3","created_at":"2026-07-04T14:47:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9907056","created_at":"2026-07-04T14:47:27Z"},{"alias_kind":"pith_short_12","alias_value":"E27NV75ORQJC","created_at":"2026-07-04T14:47:27Z"},{"alias_kind":"pith_short_16","alias_value":"E27NV75ORQJCYPRG","created_at":"2026-07-04T14:47:27Z"},{"alias_kind":"pith_short_8","alias_value":"E27NV75O","created_at":"2026-07-04T14:47:27Z"}],"graph_snapshots":[{"event_id":"sha256:a3a1d6e9f83a92af71bb3430a698ce0d608aee363b487a148929cca313921ac0","target":"graph","created_at":"2026-07-04T14:47:27Z","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/9907056/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give the first quantum circuit for computing $f(0)$ OR $f(1)$ more reliably than is classically possible with a single evaluation of the function. OR therefore joins XOR (i.e. parity, $f(0) \\oplus f(1)$) to give the full set of logical connectives (up to relabeling of inputs and outputs) for which there is quantum speedup. The XOR algorithm is of fundamental importance in quantum computation; our OR algorithm (found with the aid of genetic programming), may represent a new quantum computational effect, also useful as a ``subroutine''.","authors_text":"Herbert J. Bernstein, Howard Barnum, Lee Spector","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"1999-07-16T15:00:38Z","title":"A quantum circuit for OR"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9907056","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:8b676711a06966d30da378671c1b546318e1ef69ae7eb0c055478c4231fb834e","target":"record","created_at":"2026-07-04T14:47:27Z","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":"224ad8113f422819474d4f2eb400571762d85b4495080dc428a5f74233215e50","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"1999-07-16T15:00:38Z","title_canon_sha256":"564f05fe9b8f7f94ed89354588347524431ce66a22c8579746744936647ac6d6"},"schema_version":"1.0","source":{"id":"quant-ph/9907056","kind":"arxiv","version":3}},"canonical_sha256":"26bedaffae8c122c3e26d8e9b3c134b4c6271f5b43cbc49adbf69ba6aff9c173","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26bedaffae8c122c3e26d8e9b3c134b4c6271f5b43cbc49adbf69ba6aff9c173","first_computed_at":"2026-07-04T14:47:27.449221Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:47:27.449221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7LIIpDqmgvg/uVKrWLWFaRHELw/B2R2Mbpy4ajXnn5lJypF8uYFapjddOUYh7SEujo1jo5ajyAyGGD1nuMnWCQ==","signature_status":"signed_v1","signed_at":"2026-07-04T14:47:27.449597Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/9907056","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b676711a06966d30da378671c1b546318e1ef69ae7eb0c055478c4231fb834e","sha256:a3a1d6e9f83a92af71bb3430a698ce0d608aee363b487a148929cca313921ac0"],"state_sha256":"d218f3f2cddb3d2723211200a80c6e014ba30390c42d18b173385b58eb208301"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ch0ETWzqSUJg61Z4bXe0E7TgIvOAy5yr8LguLDHh004imYCsaZuUNZUDtGyYobVQe6qxnceHaWqbmKiFDdMGBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T17:14:08.350364Z","bundle_sha256":"1ab55e1169112fc942e72e2dce2f0f0208c1a495eebbd83ec1e95665ff59c6ae"}}