{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1997:HC4ZGZUMQCU7KMU6O3R7V2OSZ3","short_pith_number":"pith:HC4ZGZUM","schema_version":"1.0","canonical_sha256":"38b993668c80a9f5329e76e3fae9d2cecd34d6d9e673411c66a110ec9edf8e49","source":{"kind":"arxiv","id":"quant-ph/9705002","version":1},"attestation_state":"computed","paper":{"title":"Quantum Algorithm for the Collision Problem","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"(2) Odense University), Alain Tapp (1) ((1) Universite de Montreal, Gilles Brassard (1), Peter Hoyer (2)","submitted_at":"1997-05-01T21:59:56Z","abstract_excerpt":"In this note, we give a quantum algorithm that finds collisions in arbitrary r-to-one functions after only O((N/r)^(1/3)) expected evaluations of the function. Assuming the function is given by a black box, this is more efficient than the best possible classical algorithm, even allowing probabilism. We also give a similar algorithm for finding claws in pairs of functions. Furthermore, we exhibit a space-time tradeoff for our technique. Our approach uses Grover's quantum searching algorithm in a novel way."},"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/9705002","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1997-05-01T21:59:56Z","cross_cats_sorted":[],"title_canon_sha256":"9f96d125bc8fe0edb6973b0bdb5c40215a2b2e336566ba38e0a87c56cc8c315c","abstract_canon_sha256":"93f20cd9d82ecbd53e043308612038e59729243d601fa57e761c1cefb37f22ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:12.785559Z","signature_b64":"q+epoJh3RVMstsAbjlzGOag57ZCYFGvOafU8UF9JsraovgK1OtK+r9Ht8tKC16q92ARLRJPPRlg7/tNFnInYAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38b993668c80a9f5329e76e3fae9d2cecd34d6d9e673411c66a110ec9edf8e49","last_reissued_at":"2026-05-18T00:53:12.784943Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:12.784943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Algorithm for the Collision Problem","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"(2) Odense University), Alain Tapp (1) ((1) Universite de Montreal, Gilles Brassard (1), Peter Hoyer (2)","submitted_at":"1997-05-01T21:59:56Z","abstract_excerpt":"In this note, we give a quantum algorithm that finds collisions in arbitrary r-to-one functions after only O((N/r)^(1/3)) expected evaluations of the function. Assuming the function is given by a black box, this is more efficient than the best possible classical algorithm, even allowing probabilism. We also give a similar algorithm for finding claws in pairs of functions. Furthermore, we exhibit a space-time tradeoff for our technique. Our approach uses Grover's quantum searching algorithm in a novel way."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9705002","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/9705002","created_at":"2026-05-18T00:53:12.785050+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9705002v1","created_at":"2026-05-18T00:53:12.785050+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9705002","created_at":"2026-05-18T00:53:12.785050+00:00"},{"alias_kind":"pith_short_12","alias_value":"HC4ZGZUMQCU7","created_at":"2026-05-18T12:25:48.327863+00:00"},{"alias_kind":"pith_short_16","alias_value":"HC4ZGZUMQCU7KMU6","created_at":"2026-05-18T12:25:48.327863+00:00"},{"alias_kind":"pith_short_8","alias_value":"HC4ZGZUM","created_at":"2026-05-18T12:25:48.327863+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.15653","citing_title":"Future-Proofing Cloud Security Against Quantum Attacks: Risk, Transition, and Mitigation Strategies","ref_index":38,"is_internal_anchor":true},{"citing_arxiv_id":"2604.05133","citing_title":"Tight Quantum Lower Bound for k-Distinctness","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HC4ZGZUMQCU7KMU6O3R7V2OSZ3","json":"https://pith.science/pith/HC4ZGZUMQCU7KMU6O3R7V2OSZ3.json","graph_json":"https://pith.science/api/pith-number/HC4ZGZUMQCU7KMU6O3R7V2OSZ3/graph.json","events_json":"https://pith.science/api/pith-number/HC4ZGZUMQCU7KMU6O3R7V2OSZ3/events.json","paper":"https://pith.science/paper/HC4ZGZUM"},"agent_actions":{"view_html":"https://pith.science/pith/HC4ZGZUMQCU7KMU6O3R7V2OSZ3","download_json":"https://pith.science/pith/HC4ZGZUMQCU7KMU6O3R7V2OSZ3.json","view_paper":"https://pith.science/paper/HC4ZGZUM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9705002&json=true","fetch_graph":"https://pith.science/api/pith-number/HC4ZGZUMQCU7KMU6O3R7V2OSZ3/graph.json","fetch_events":"https://pith.science/api/pith-number/HC4ZGZUMQCU7KMU6O3R7V2OSZ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HC4ZGZUMQCU7KMU6O3R7V2OSZ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HC4ZGZUMQCU7KMU6O3R7V2OSZ3/action/storage_attestation","attest_author":"https://pith.science/pith/HC4ZGZUMQCU7KMU6O3R7V2OSZ3/action/author_attestation","sign_citation":"https://pith.science/pith/HC4ZGZUMQCU7KMU6O3R7V2OSZ3/action/citation_signature","submit_replication":"https://pith.science/pith/HC4ZGZUMQCU7KMU6O3R7V2OSZ3/action/replication_record"}},"created_at":"2026-05-18T00:53:12.785050+00:00","updated_at":"2026-05-18T00:53:12.785050+00:00"}