{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:CYIL25NUIHQTL3JINJNNPPBPWX","short_pith_number":"pith:CYIL25NU","schema_version":"1.0","canonical_sha256":"1610bd75b441e135ed286a5ad7bc2fb5cca18bee4c22c31e0d99e9c651db9cb9","source":{"kind":"arxiv","id":"quant-ph/0311038","version":2},"attestation_state":"computed","paper":{"title":"Quantum algorithms for subset finding","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew M. Childs, Jason M. Eisenberg","submitted_at":"2003-11-06T20:54:06Z","abstract_excerpt":"Recently, Ambainis gave an O(N^(2/3))-query quantum walk algorithm for element distinctness, and more generally, an O(N^(L/(L+1)))-query algorithm for finding L equal numbers. We point out that this algorithm actually solves a much more general problem, the problem of finding a subset of size L that satisfies any given property. We review the algorithm and give a considerably simplified analysis of its query complexity. We present several applications, including two algorithms for the problem of finding an L-clique in an N-vertex graph. One of these algorithms uses O(N^(2L/(L+1))) edge queries"},"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":"quant-ph/0311038","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-11-06T20:54:06Z","cross_cats_sorted":[],"title_canon_sha256":"e7ad1eb319a342b8803f5daad2e286d74cc3b9b3bcdd41a17893387e53a8b8f4","abstract_canon_sha256":"940d6921a1748c73399ae71f415feb6f3a6a28e10477e338f7af90a2c49a04d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:54.626872Z","signature_b64":"bBOd9ZRHVobdawfHcpvrxCGdm0H+Jzw/5AbCRjn8tHl3O6BDlG9wMrE3sIgXk3Zxe8El+MkznmLQoAwIXt4vCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1610bd75b441e135ed286a5ad7bc2fb5cca18bee4c22c31e0d99e9c651db9cb9","last_reissued_at":"2026-05-17T23:57:54.626336Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:54.626336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum algorithms for subset finding","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew M. Childs, Jason M. Eisenberg","submitted_at":"2003-11-06T20:54:06Z","abstract_excerpt":"Recently, Ambainis gave an O(N^(2/3))-query quantum walk algorithm for element distinctness, and more generally, an O(N^(L/(L+1)))-query algorithm for finding L equal numbers. We point out that this algorithm actually solves a much more general problem, the problem of finding a subset of size L that satisfies any given property. We review the algorithm and give a considerably simplified analysis of its query complexity. We present several applications, including two algorithms for the problem of finding an L-clique in an N-vertex graph. One of these algorithms uses O(N^(2L/(L+1))) edge queries"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0311038","kind":"arxiv","version":2},"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":"quant-ph/0311038","created_at":"2026-05-17T23:57:54.626427+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0311038v2","created_at":"2026-05-17T23:57:54.626427+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0311038","created_at":"2026-05-17T23:57:54.626427+00:00"},{"alias_kind":"pith_short_12","alias_value":"CYIL25NUIHQT","created_at":"2026-05-18T12:25:51.375804+00:00"},{"alias_kind":"pith_short_16","alias_value":"CYIL25NUIHQTL3JI","created_at":"2026-05-18T12:25:51.375804+00:00"},{"alias_kind":"pith_short_8","alias_value":"CYIL25NU","created_at":"2026-05-18T12:25:51.375804+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.12385","citing_title":"Lower overhead fault-tolerant building blocks for noisy quantum computers","ref_index":293,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CYIL25NUIHQTL3JINJNNPPBPWX","json":"https://pith.science/pith/CYIL25NUIHQTL3JINJNNPPBPWX.json","graph_json":"https://pith.science/api/pith-number/CYIL25NUIHQTL3JINJNNPPBPWX/graph.json","events_json":"https://pith.science/api/pith-number/CYIL25NUIHQTL3JINJNNPPBPWX/events.json","paper":"https://pith.science/paper/CYIL25NU"},"agent_actions":{"view_html":"https://pith.science/pith/CYIL25NUIHQTL3JINJNNPPBPWX","download_json":"https://pith.science/pith/CYIL25NUIHQTL3JINJNNPPBPWX.json","view_paper":"https://pith.science/paper/CYIL25NU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0311038&json=true","fetch_graph":"https://pith.science/api/pith-number/CYIL25NUIHQTL3JINJNNPPBPWX/graph.json","fetch_events":"https://pith.science/api/pith-number/CYIL25NUIHQTL3JINJNNPPBPWX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CYIL25NUIHQTL3JINJNNPPBPWX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CYIL25NUIHQTL3JINJNNPPBPWX/action/storage_attestation","attest_author":"https://pith.science/pith/CYIL25NUIHQTL3JINJNNPPBPWX/action/author_attestation","sign_citation":"https://pith.science/pith/CYIL25NUIHQTL3JINJNNPPBPWX/action/citation_signature","submit_replication":"https://pith.science/pith/CYIL25NUIHQTL3JINJNNPPBPWX/action/replication_record"}},"created_at":"2026-05-17T23:57:54.626427+00:00","updated_at":"2026-05-17T23:57:54.626427+00:00"}