{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2001:HH2Z6I4C5CE2Z7NWRH7SXU2TSH","short_pith_number":"pith:HH2Z6I4C","schema_version":"1.0","canonical_sha256":"39f59f2382e889acfdb689ff2bd35391e32c94c93b83c995f2295b0a6fe7c277","source":{"kind":"arxiv","id":"quant-ph/0112086","version":1},"attestation_state":"computed","paper":{"title":"Quantum lower bounds for the collision and the element distinctness problems","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Yaoyun Shi","submitted_at":"2001-12-15T06:00:58Z","abstract_excerpt":"Given a function f as an oracle, the collision problem is to find two distinct inputs i and j such that f(i)=f(j), under the promise that such inputs exist. Since the security of many fundamental cryptographic primitives depends on the hardness of finding collisions, quantum lower bounds for the collision problem would provide evidence for the existence of cryptographic primitives that are immune to quantum cryptanalysis.\n  In this paper, we prove that any quantum algorithm for finding a collision in an r-to-one function must evaluate the function Omega((n/r)^{1/3}) times, where n is the size "},"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/0112086","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2001-12-15T06:00:58Z","cross_cats_sorted":[],"title_canon_sha256":"25495549dbc7d4006400fbd5ea973ee54fd6761f98cf903d6d5195de87181c51","abstract_canon_sha256":"45946c3e78e3ef48a4e8029f50ed82d6df974203ebc154a64fbae6918832eea1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:36.528419Z","signature_b64":"o+gKIELUN1ibzjXfTIBsdd2TN1opN2bAJoJANMB5PC+ndgY/8ZhTI7/UyW0rrL60rvrhQHqPuDKfEiZcL9iZAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39f59f2382e889acfdb689ff2bd35391e32c94c93b83c995f2295b0a6fe7c277","last_reissued_at":"2026-05-18T04:09:36.527992Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:36.527992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum lower bounds for the collision and the element distinctness problems","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Yaoyun Shi","submitted_at":"2001-12-15T06:00:58Z","abstract_excerpt":"Given a function f as an oracle, the collision problem is to find two distinct inputs i and j such that f(i)=f(j), under the promise that such inputs exist. Since the security of many fundamental cryptographic primitives depends on the hardness of finding collisions, quantum lower bounds for the collision problem would provide evidence for the existence of cryptographic primitives that are immune to quantum cryptanalysis.\n  In this paper, we prove that any quantum algorithm for finding a collision in an r-to-one function must evaluate the function Omega((n/r)^{1/3}) times, where n is the size "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0112086","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/0112086","created_at":"2026-05-18T04:09:36.528061+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0112086v1","created_at":"2026-05-18T04:09:36.528061+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0112086","created_at":"2026-05-18T04:09:36.528061+00:00"},{"alias_kind":"pith_short_12","alias_value":"HH2Z6I4C5CE2","created_at":"2026-05-18T12:25:50.254431+00:00"},{"alias_kind":"pith_short_16","alias_value":"HH2Z6I4C5CE2Z7NW","created_at":"2026-05-18T12:25:50.254431+00:00"},{"alias_kind":"pith_short_8","alias_value":"HH2Z6I4C","created_at":"2026-05-18T12:25:50.254431+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08517","citing_title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HH2Z6I4C5CE2Z7NWRH7SXU2TSH","json":"https://pith.science/pith/HH2Z6I4C5CE2Z7NWRH7SXU2TSH.json","graph_json":"https://pith.science/api/pith-number/HH2Z6I4C5CE2Z7NWRH7SXU2TSH/graph.json","events_json":"https://pith.science/api/pith-number/HH2Z6I4C5CE2Z7NWRH7SXU2TSH/events.json","paper":"https://pith.science/paper/HH2Z6I4C"},"agent_actions":{"view_html":"https://pith.science/pith/HH2Z6I4C5CE2Z7NWRH7SXU2TSH","download_json":"https://pith.science/pith/HH2Z6I4C5CE2Z7NWRH7SXU2TSH.json","view_paper":"https://pith.science/paper/HH2Z6I4C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0112086&json=true","fetch_graph":"https://pith.science/api/pith-number/HH2Z6I4C5CE2Z7NWRH7SXU2TSH/graph.json","fetch_events":"https://pith.science/api/pith-number/HH2Z6I4C5CE2Z7NWRH7SXU2TSH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HH2Z6I4C5CE2Z7NWRH7SXU2TSH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HH2Z6I4C5CE2Z7NWRH7SXU2TSH/action/storage_attestation","attest_author":"https://pith.science/pith/HH2Z6I4C5CE2Z7NWRH7SXU2TSH/action/author_attestation","sign_citation":"https://pith.science/pith/HH2Z6I4C5CE2Z7NWRH7SXU2TSH/action/citation_signature","submit_replication":"https://pith.science/pith/HH2Z6I4C5CE2Z7NWRH7SXU2TSH/action/replication_record"}},"created_at":"2026-05-18T04:09:36.528061+00:00","updated_at":"2026-05-18T04:09:36.528061+00:00"}