{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:WJTSYJXREOFE5OL6KHSY5WMN34","short_pith_number":"pith:WJTSYJXR","schema_version":"1.0","canonical_sha256":"b2672c26f1238a4eb97e51e58ed98ddf2c7e186d82aa4161250535981f1a4b33","source":{"kind":"arxiv","id":"1210.1148","version":4},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.1148","created_at":"2026-05-18T02:47:41.382712+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.1148v4","created_at":"2026-05-18T02:47:41.382712+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1148","created_at":"2026-05-18T02:47:41.382712+00:00"},{"alias_kind":"pith_short_12","alias_value":"WJTSYJXREOFE","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"WJTSYJXREOFE5OL6","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"WJTSYJXR","created_at":"2026-05-18T12:27:25.539911+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WJTSYJXREOFE5OL6KHSY5WMN34","json":"https://pith.science/pith/WJTSYJXREOFE5OL6KHSY5WMN34.json","graph_json":"https://pith.science/api/pith-number/WJTSYJXREOFE5OL6KHSY5WMN34/graph.json","events_json":"https://pith.science/api/pith-number/WJTSYJXREOFE5OL6KHSY5WMN34/events.json","paper":"https://pith.science/paper/WJTSYJXR"},"agent_actions":{"view_html":"https://pith.science/pith/WJTSYJXREOFE5OL6KHSY5WMN34","download_json":"https://pith.science/pith/WJTSYJXREOFE5OL6KHSY5WMN34.json","view_paper":"https://pith.science/paper/WJTSYJXR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.1148&json=true","fetch_graph":"https://pith.science/api/pith-number/WJTSYJXREOFE5OL6KHSY5WMN34/graph.json","fetch_events":"https://pith.science/api/pith-number/WJTSYJXREOFE5OL6KHSY5WMN34/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WJTSYJXREOFE5OL6KHSY5WMN34/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WJTSYJXREOFE5OL6KHSY5WMN34/action/storage_attestation","attest_author":"https://pith.science/pith/WJTSYJXREOFE5OL6KHSY5WMN34/action/author_attestation","sign_citation":"https://pith.science/pith/WJTSYJXREOFE5OL6KHSY5WMN34/action/citation_signature","submit_replication":"https://pith.science/pith/WJTSYJXREOFE5OL6KHSY5WMN34/action/replication_record"}},"created_at":"2026-05-18T02:47:41.382712+00:00","updated_at":"2026-05-18T02:47:41.382712+00:00"}