{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WRLQAFKAFCSUOROOKBBTUJGH3T","short_pith_number":"pith:WRLQAFKA","canonical_record":{"source":{"id":"1701.06942","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-01-24T15:46:34Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"f1629fa88458d5fc5cbcc180d1b6b8df2330939bd18aca8062a9644b1b23c772","abstract_canon_sha256":"963a235da5796fec4350b115ceb49a1f9086dd62083e4aae9db8d985495083a6"},"schema_version":"1.0"},"canonical_sha256":"b45700154028a54745ce50433a24c7dce8f35265fa4585f19e9e9fd46fcb18ff","source":{"kind":"arxiv","id":"1701.06942","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06942","created_at":"2026-05-18T00:52:10Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06942v1","created_at":"2026-05-18T00:52:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06942","created_at":"2026-05-18T00:52:10Z"},{"alias_kind":"pith_short_12","alias_value":"WRLQAFKAFCSU","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WRLQAFKAFCSUOROO","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WRLQAFKA","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WRLQAFKAFCSUOROOKBBTUJGH3T","target":"record","payload":{"canonical_record":{"source":{"id":"1701.06942","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-01-24T15:46:34Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"f1629fa88458d5fc5cbcc180d1b6b8df2330939bd18aca8062a9644b1b23c772","abstract_canon_sha256":"963a235da5796fec4350b115ceb49a1f9086dd62083e4aae9db8d985495083a6"},"schema_version":"1.0"},"canonical_sha256":"b45700154028a54745ce50433a24c7dce8f35265fa4585f19e9e9fd46fcb18ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:10.075372Z","signature_b64":"W38CY2KlQGtQpjj7qBfmfO3cJ5jxLcdv02xfxqWfp87SIH8n7WDywAkQR7lXT60WeNnMA72jeNcGjQSoZwQTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b45700154028a54745ce50433a24c7dce8f35265fa4585f19e9e9fd46fcb18ff","last_reissued_at":"2026-05-18T00:52:10.074835Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:10.074835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.06942","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-18T00:52:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dwcVJgtgU2sdykjnZXN0/7XKU7y/fwglFTAimzOoamBBG6w56B82Uo+ynrputX54r9GgIZX+gcerP4BppW1YAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T07:59:36.918091Z"},"content_sha256":"789f01b12de20e678b2e37c03303d0bf3f065e94cf16d1820acf7bb36e17406c","schema_version":"1.0","event_id":"sha256:789f01b12de20e678b2e37c03303d0bf3f065e94cf16d1820acf7bb36e17406c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WRLQAFKAFCSUOROOKBBTUJGH3T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal one-shot quantum algorithm for EQUALITY and AND","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis, Janis Iraids","submitted_at":"2017-01-24T15:46:34Z","abstract_excerpt":"We study the computation complexity of Boolean functions in the quantum black box model. In this model our task is to compute a function $f:\\{0,1\\}\\to\\{0,1\\}$ on an input $x\\in\\{0,1\\}^n$ that can be accessed by querying the black box. Quantum algorithms are inherently probabilistic; we are interested in the lowest possible probability that the algorithm outputs incorrect answer (the error probability) for a fixed number of queries. We show that the lowest possible error probability for $AND_n$ and $EQUALITY_{n+1}$ is $1/2-n/(n^2+1)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06942","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-18T00:52:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TAByQBcQGAAHGaMtusP0kxTZzYHW2LZcxTRlpXH1eXX6trz7VzQ3SoKpX4RJNM9Ev+2+o2cojZOWW5jbL/nZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T07:59:36.918798Z"},"content_sha256":"2cfaef2aebd540d47c1eefafd042f219b04f8e2a22488ac0852cb7f1d5640ee3","schema_version":"1.0","event_id":"sha256:2cfaef2aebd540d47c1eefafd042f219b04f8e2a22488ac0852cb7f1d5640ee3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WRLQAFKAFCSUOROOKBBTUJGH3T/bundle.json","state_url":"https://pith.science/pith/WRLQAFKAFCSUOROOKBBTUJGH3T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WRLQAFKAFCSUOROOKBBTUJGH3T/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-05-25T07:59:36Z","links":{"resolver":"https://pith.science/pith/WRLQAFKAFCSUOROOKBBTUJGH3T","bundle":"https://pith.science/pith/WRLQAFKAFCSUOROOKBBTUJGH3T/bundle.json","state":"https://pith.science/pith/WRLQAFKAFCSUOROOKBBTUJGH3T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WRLQAFKAFCSUOROOKBBTUJGH3T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WRLQAFKAFCSUOROOKBBTUJGH3T","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":"963a235da5796fec4350b115ceb49a1f9086dd62083e4aae9db8d985495083a6","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-01-24T15:46:34Z","title_canon_sha256":"f1629fa88458d5fc5cbcc180d1b6b8df2330939bd18aca8062a9644b1b23c772"},"schema_version":"1.0","source":{"id":"1701.06942","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06942","created_at":"2026-05-18T00:52:10Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06942v1","created_at":"2026-05-18T00:52:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06942","created_at":"2026-05-18T00:52:10Z"},{"alias_kind":"pith_short_12","alias_value":"WRLQAFKAFCSU","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WRLQAFKAFCSUOROO","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WRLQAFKA","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:2cfaef2aebd540d47c1eefafd042f219b04f8e2a22488ac0852cb7f1d5640ee3","target":"graph","created_at":"2026-05-18T00:52:10Z","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":"We study the computation complexity of Boolean functions in the quantum black box model. In this model our task is to compute a function $f:\\{0,1\\}\\to\\{0,1\\}$ on an input $x\\in\\{0,1\\}^n$ that can be accessed by querying the black box. Quantum algorithms are inherently probabilistic; we are interested in the lowest possible probability that the algorithm outputs incorrect answer (the error probability) for a fixed number of queries. We show that the lowest possible error probability for $AND_n$ and $EQUALITY_{n+1}$ is $1/2-n/(n^2+1)$.","authors_text":"Andris Ambainis, Janis Iraids","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-01-24T15:46:34Z","title":"Optimal one-shot quantum algorithm for EQUALITY and AND"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06942","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:789f01b12de20e678b2e37c03303d0bf3f065e94cf16d1820acf7bb36e17406c","target":"record","created_at":"2026-05-18T00:52:10Z","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":"963a235da5796fec4350b115ceb49a1f9086dd62083e4aae9db8d985495083a6","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-01-24T15:46:34Z","title_canon_sha256":"f1629fa88458d5fc5cbcc180d1b6b8df2330939bd18aca8062a9644b1b23c772"},"schema_version":"1.0","source":{"id":"1701.06942","kind":"arxiv","version":1}},"canonical_sha256":"b45700154028a54745ce50433a24c7dce8f35265fa4585f19e9e9fd46fcb18ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b45700154028a54745ce50433a24c7dce8f35265fa4585f19e9e9fd46fcb18ff","first_computed_at":"2026-05-18T00:52:10.074835Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:10.074835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W38CY2KlQGtQpjj7qBfmfO3cJ5jxLcdv02xfxqWfp87SIH8n7WDywAkQR7lXT60WeNnMA72jeNcGjQSoZwQTAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:10.075372Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.06942","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:789f01b12de20e678b2e37c03303d0bf3f065e94cf16d1820acf7bb36e17406c","sha256:2cfaef2aebd540d47c1eefafd042f219b04f8e2a22488ac0852cb7f1d5640ee3"],"state_sha256":"d1c9b8668a1916ed23867e494561e11103780dd5bb882bb07fbe23a102de15cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dlYZoCeQBV4JvVywMMtZFZwrDWYMEwLGtdELhLuNoG+J1/vlGloNybLfVXNdphcUkaf1pPNH2U0aiqlIAoFwAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T07:59:36.922024Z","bundle_sha256":"f6aa38f4088b096ac824570d6c952a89428a5b13d6fbc7bbb16558605d20f0da"}}