{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2004:KQ2FOJKO4W54FTCLPKB4LQW5QJ","short_pith_number":"pith:KQ2FOJKO","canonical_record":{"source":{"id":"quant-ph/0411204","kind":"arxiv","version":5},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2004-11-30T03:17:02Z","cross_cats_sorted":[],"title_canon_sha256":"ae37ac0f31b62fad3defa7a251f3403b4104ed50402294988d05206ece0484c8","abstract_canon_sha256":"7cc906335a56e267122c619c1a368e3e2c68190ac2586f5452e1a5cb4af3237f"},"schema_version":"1.0"},"canonical_sha256":"543457254ee5bbc2cc4b7a83c5c2dd8240ea8eb74f748ac839e82802513d7696","source":{"kind":"arxiv","id":"quant-ph/0411204","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0411204","created_at":"2026-07-04T14:50:17Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0411204v5","created_at":"2026-07-04T14:50:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0411204","created_at":"2026-07-04T14:50:17Z"},{"alias_kind":"pith_short_12","alias_value":"KQ2FOJKO4W54","created_at":"2026-07-04T14:50:17Z"},{"alias_kind":"pith_short_16","alias_value":"KQ2FOJKO4W54FTCL","created_at":"2026-07-04T14:50:17Z"},{"alias_kind":"pith_short_8","alias_value":"KQ2FOJKO","created_at":"2026-07-04T14:50:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2004:KQ2FOJKO4W54FTCLPKB4LQW5QJ","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0411204","kind":"arxiv","version":5},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2004-11-30T03:17:02Z","cross_cats_sorted":[],"title_canon_sha256":"ae37ac0f31b62fad3defa7a251f3403b4104ed50402294988d05206ece0484c8","abstract_canon_sha256":"7cc906335a56e267122c619c1a368e3e2c68190ac2586f5452e1a5cb4af3237f"},"schema_version":"1.0"},"canonical_sha256":"543457254ee5bbc2cc4b7a83c5c2dd8240ea8eb74f748ac839e82802513d7696","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:50:17.497959Z","signature_b64":"pn9tNajxG6zBYSANxD87V2h1wWQdx6Pvm0tZEvX/o4gPA526qTXybOqc6yiszi2Rn8/p+2VUohEh642t2UWYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"543457254ee5bbc2cc4b7a83c5c2dd8240ea8eb74f748ac839e82802513d7696","last_reissued_at":"2026-07-04T14:50:17.497608Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:50:17.497608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0411204","source_version":5,"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:50:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Rjql/nVABjlOdDKvl7okEgXvzZ3sg8Zq9/gethVR1wBFerr6vbeIxj30Tp0gJmzrFshFiFr5sFW6FFng37iBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T07:10:39.592844Z"},"content_sha256":"88030796f6003a97323d19c1139286e004af8ee9ccc14cdbaaafe2411a1d468e","schema_version":"1.0","event_id":"sha256:88030796f6003a97323d19c1139286e004af8ee9ccc14cdbaaafe2411a1d468e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2004:KQ2FOJKO4W54FTCLPKB4LQW5QJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Quantum Algorithms for Oracle Identification","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Akinori Kawachi, Andris Ambainis, Kazuo Iwama, Rudy Raymond, Shigeru Yamashita","submitted_at":"2004-11-30T03:17:02Z","abstract_excerpt":"The oracle identification problem (OIP) was introduced by Ambainis et al. \\cite{AIKMRY04}. It is given as a set $S$ of $M$ oracles and a blackbox oracle $f$. Our task is to figure out which oracle in $S$ is equal to the blackbox $f$ by making queries to $f$. OIP includes several problems such as the Grover Search as special cases. In this paper, we improve the algorithms in \\cite{AIKMRY04} by providing a mostly optimal upper bound of query complexity for this problem: ($i$) For any oracle set $S$ such that $|S| \\le 2^{N^d}$ ($d < 1$), we design an algorithm whose query complexity is $O(\\sqrt{N"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0411204","kind":"arxiv","version":5},"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/0411204/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:50:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cUsLZS5lH//pxDHIQAVUdZUJFJXya4UbMwfG0r8R+AgC5smd96yuhCExv51MLqH1NwDn9XKs95TO19Dr6pWGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T07:10:39.593398Z"},"content_sha256":"f5179833c8758c662d13f38d171541898e30a6b71b7897eaef8bbf929a20a13f","schema_version":"1.0","event_id":"sha256:f5179833c8758c662d13f38d171541898e30a6b71b7897eaef8bbf929a20a13f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KQ2FOJKO4W54FTCLPKB4LQW5QJ/bundle.json","state_url":"https://pith.science/pith/KQ2FOJKO4W54FTCLPKB4LQW5QJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KQ2FOJKO4W54FTCLPKB4LQW5QJ/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-07T07:10:39Z","links":{"resolver":"https://pith.science/pith/KQ2FOJKO4W54FTCLPKB4LQW5QJ","bundle":"https://pith.science/pith/KQ2FOJKO4W54FTCLPKB4LQW5QJ/bundle.json","state":"https://pith.science/pith/KQ2FOJKO4W54FTCLPKB4LQW5QJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KQ2FOJKO4W54FTCLPKB4LQW5QJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:KQ2FOJKO4W54FTCLPKB4LQW5QJ","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":"7cc906335a56e267122c619c1a368e3e2c68190ac2586f5452e1a5cb4af3237f","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2004-11-30T03:17:02Z","title_canon_sha256":"ae37ac0f31b62fad3defa7a251f3403b4104ed50402294988d05206ece0484c8"},"schema_version":"1.0","source":{"id":"quant-ph/0411204","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0411204","created_at":"2026-07-04T14:50:17Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0411204v5","created_at":"2026-07-04T14:50:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0411204","created_at":"2026-07-04T14:50:17Z"},{"alias_kind":"pith_short_12","alias_value":"KQ2FOJKO4W54","created_at":"2026-07-04T14:50:17Z"},{"alias_kind":"pith_short_16","alias_value":"KQ2FOJKO4W54FTCL","created_at":"2026-07-04T14:50:17Z"},{"alias_kind":"pith_short_8","alias_value":"KQ2FOJKO","created_at":"2026-07-04T14:50:17Z"}],"graph_snapshots":[{"event_id":"sha256:f5179833c8758c662d13f38d171541898e30a6b71b7897eaef8bbf929a20a13f","target":"graph","created_at":"2026-07-04T14:50:17Z","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/0411204/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The oracle identification problem (OIP) was introduced by Ambainis et al. \\cite{AIKMRY04}. It is given as a set $S$ of $M$ oracles and a blackbox oracle $f$. Our task is to figure out which oracle in $S$ is equal to the blackbox $f$ by making queries to $f$. OIP includes several problems such as the Grover Search as special cases. In this paper, we improve the algorithms in \\cite{AIKMRY04} by providing a mostly optimal upper bound of query complexity for this problem: ($i$) For any oracle set $S$ such that $|S| \\le 2^{N^d}$ ($d < 1$), we design an algorithm whose query complexity is $O(\\sqrt{N","authors_text":"Akinori Kawachi, Andris Ambainis, Kazuo Iwama, Rudy Raymond, Shigeru Yamashita","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2004-11-30T03:17:02Z","title":"Robust Quantum Algorithms for Oracle Identification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0411204","kind":"arxiv","version":5},"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:88030796f6003a97323d19c1139286e004af8ee9ccc14cdbaaafe2411a1d468e","target":"record","created_at":"2026-07-04T14:50:17Z","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":"7cc906335a56e267122c619c1a368e3e2c68190ac2586f5452e1a5cb4af3237f","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2004-11-30T03:17:02Z","title_canon_sha256":"ae37ac0f31b62fad3defa7a251f3403b4104ed50402294988d05206ece0484c8"},"schema_version":"1.0","source":{"id":"quant-ph/0411204","kind":"arxiv","version":5}},"canonical_sha256":"543457254ee5bbc2cc4b7a83c5c2dd8240ea8eb74f748ac839e82802513d7696","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"543457254ee5bbc2cc4b7a83c5c2dd8240ea8eb74f748ac839e82802513d7696","first_computed_at":"2026-07-04T14:50:17.497608Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:50:17.497608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pn9tNajxG6zBYSANxD87V2h1wWQdx6Pvm0tZEvX/o4gPA526qTXybOqc6yiszi2Rn8/p+2VUohEh642t2UWYCw==","signature_status":"signed_v1","signed_at":"2026-07-04T14:50:17.497959Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0411204","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88030796f6003a97323d19c1139286e004af8ee9ccc14cdbaaafe2411a1d468e","sha256:f5179833c8758c662d13f38d171541898e30a6b71b7897eaef8bbf929a20a13f"],"state_sha256":"a03d40d0bcfbc59e9de2efa4c77c96e3616fece1018c93082da66eab36edbf15"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DU4Xdv7AI+HhtfaKBxnI1bHRmfgnpgXpUjDcdnWAiO4A8f4Xn9khOfkBbVMUatuVrgLEXsuOBbyR9W4Pt8N9AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T07:10:39.601231Z","bundle_sha256":"9843db9bd6fc7731d3230329d23315b10d370ca417dbd17e1af2baa5d4a2a294"}}