{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WJTSYJXREOFE5OL6KHSY5WMN34","short_pith_number":"pith:WJTSYJXR","canonical_record":{"source":{"id":"1210.1148","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-10-03T15:30:12Z","cross_cats_sorted":[],"title_canon_sha256":"dbe2f2e27a0301fd63145e77fe78b2f9e3b9da304530ecfb07daed97c2490709","abstract_canon_sha256":"054f76574913cdac1e318773ecef2316d3316ec49024b4ed3876abac37f29182"},"schema_version":"1.0"},"canonical_sha256":"b2672c26f1238a4eb97e51e58ed98ddf2c7e186d82aa4161250535981f1a4b33","source":{"kind":"arxiv","id":"1210.1148","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.1148","created_at":"2026-05-18T02:47:41Z"},{"alias_kind":"arxiv_version","alias_value":"1210.1148v4","created_at":"2026-05-18T02:47:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1148","created_at":"2026-05-18T02:47:41Z"},{"alias_kind":"pith_short_12","alias_value":"WJTSYJXREOFE","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WJTSYJXREOFE5OL6","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WJTSYJXR","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WJTSYJXREOFE5OL6KHSY5WMN34","target":"record","payload":{"canonical_record":{"source":{"id":"1210.1148","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-10-03T15:30:12Z","cross_cats_sorted":[],"title_canon_sha256":"dbe2f2e27a0301fd63145e77fe78b2f9e3b9da304530ecfb07daed97c2490709","abstract_canon_sha256":"054f76574913cdac1e318773ecef2316d3316ec49024b4ed3876abac37f29182"},"schema_version":"1.0"},"canonical_sha256":"b2672c26f1238a4eb97e51e58ed98ddf2c7e186d82aa4161250535981f1a4b33","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:41.383352Z","signature_b64":"MD46rySGS8kUi1DavCbLSuncBZ4fkGNhDc3C7sOqusVQzw6DNsS8kuLnWwbtBHmleRoCBBk3gpsRM94+rHU3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2672c26f1238a4eb97e51e58ed98ddf2c7e186d82aa4161250535981f1a4b33","last_reissued_at":"2026-05-18T02:47:41.382587Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:41.382587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.1148","source_version":4,"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:47:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VlrZX7rtHmi1NU6VhloIZKL9i80t3TJOlWivwpe96xCGn1cRB1tqP2LZUnnnz0yReJc5V5ZziLGuuPvBI/2sCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:27:58.466717Z"},"content_sha256":"660a4c64d86f4a84069a1a81b142c11ced6d98d9d30f36f3149a539a84664fd7","schema_version":"1.0","event_id":"sha256:660a4c64d86f4a84069a1a81b142c11ced6d98d9d30f36f3149a539a84664fd7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WJTSYJXREOFE5OL6KHSY5WMN34","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum algorithms for search with wildcards and combinatorial group testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andris Ambainis, Ashley Montanaro","submitted_at":"2012-10-03T15:30:12Z","abstract_excerpt":"We consider two combinatorial problems. The first we call \"search with wildcards\": given an unknown n-bit string x, and the ability to check whether any subset of the bits of x is equal to a provided query string, the goal is to output x. We give a nearly optimal O(sqrt(n) log n) quantum query algorithm for search with wildcards, beating the classical lower bound of Omega(n) queries. Rather than using amplitude amplification or a quantum walk, our algorithm is ultimately based on the solution to a state discrimination problem. The second problem we consider is combinatorial group testing, whic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1148","kind":"arxiv","version":4},"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:47:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KrNwR+mxYSW/2kWG05jGXAkayxks7B96mVBC82s0gxqW2ySIeFwkSbl+wz9lk+A+hDqP9uuE5poGwatf74cqDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:27:58.467170Z"},"content_sha256":"d0d9605e68b82f2393f3480fb5499d91e609b6a0b4b97cd4c6708278b3a7d103","schema_version":"1.0","event_id":"sha256:d0d9605e68b82f2393f3480fb5499d91e609b6a0b4b97cd4c6708278b3a7d103"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WJTSYJXREOFE5OL6KHSY5WMN34/bundle.json","state_url":"https://pith.science/pith/WJTSYJXREOFE5OL6KHSY5WMN34/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WJTSYJXREOFE5OL6KHSY5WMN34/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-26T01:27:58Z","links":{"resolver":"https://pith.science/pith/WJTSYJXREOFE5OL6KHSY5WMN34","bundle":"https://pith.science/pith/WJTSYJXREOFE5OL6KHSY5WMN34/bundle.json","state":"https://pith.science/pith/WJTSYJXREOFE5OL6KHSY5WMN34/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WJTSYJXREOFE5OL6KHSY5WMN34/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WJTSYJXREOFE5OL6KHSY5WMN34","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":"054f76574913cdac1e318773ecef2316d3316ec49024b4ed3876abac37f29182","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-10-03T15:30:12Z","title_canon_sha256":"dbe2f2e27a0301fd63145e77fe78b2f9e3b9da304530ecfb07daed97c2490709"},"schema_version":"1.0","source":{"id":"1210.1148","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.1148","created_at":"2026-05-18T02:47:41Z"},{"alias_kind":"arxiv_version","alias_value":"1210.1148v4","created_at":"2026-05-18T02:47:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1148","created_at":"2026-05-18T02:47:41Z"},{"alias_kind":"pith_short_12","alias_value":"WJTSYJXREOFE","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WJTSYJXREOFE5OL6","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WJTSYJXR","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:d0d9605e68b82f2393f3480fb5499d91e609b6a0b4b97cd4c6708278b3a7d103","target":"graph","created_at":"2026-05-18T02:47:41Z","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 consider two combinatorial problems. The first we call \"search with wildcards\": given an unknown n-bit string x, and the ability to check whether any subset of the bits of x is equal to a provided query string, the goal is to output x. We give a nearly optimal O(sqrt(n) log n) quantum query algorithm for search with wildcards, beating the classical lower bound of Omega(n) queries. Rather than using amplitude amplification or a quantum walk, our algorithm is ultimately based on the solution to a state discrimination problem. The second problem we consider is combinatorial group testing, whic","authors_text":"Andris Ambainis, Ashley Montanaro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-10-03T15:30:12Z","title":"Quantum algorithms for search with wildcards and combinatorial group testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1148","kind":"arxiv","version":4},"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:660a4c64d86f4a84069a1a81b142c11ced6d98d9d30f36f3149a539a84664fd7","target":"record","created_at":"2026-05-18T02:47:41Z","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":"054f76574913cdac1e318773ecef2316d3316ec49024b4ed3876abac37f29182","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-10-03T15:30:12Z","title_canon_sha256":"dbe2f2e27a0301fd63145e77fe78b2f9e3b9da304530ecfb07daed97c2490709"},"schema_version":"1.0","source":{"id":"1210.1148","kind":"arxiv","version":4}},"canonical_sha256":"b2672c26f1238a4eb97e51e58ed98ddf2c7e186d82aa4161250535981f1a4b33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2672c26f1238a4eb97e51e58ed98ddf2c7e186d82aa4161250535981f1a4b33","first_computed_at":"2026-05-18T02:47:41.382587Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:41.382587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MD46rySGS8kUi1DavCbLSuncBZ4fkGNhDc3C7sOqusVQzw6DNsS8kuLnWwbtBHmleRoCBBk3gpsRM94+rHU3Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:41.383352Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.1148","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:660a4c64d86f4a84069a1a81b142c11ced6d98d9d30f36f3149a539a84664fd7","sha256:d0d9605e68b82f2393f3480fb5499d91e609b6a0b4b97cd4c6708278b3a7d103"],"state_sha256":"6af812d919129251ca505a04a431a420fa33ad214ffbf44527e92a2c1ecb5b4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zmAAP+iJNYxbo3G7BKmXcTmDFtoMIU75pLn+vZTEFwnrUYmEHe5x3vNC2ZyZ07zjaNOjl2RZpF31Y3kUzfS0Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:27:58.470775Z","bundle_sha256":"468b9b007570f94cd3b40646542d9de03c4c1c2cdfcc6db506e632000308272c"}}