{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2000:YP47JQRHB4G4FFFYPAUQX2CLL4","short_pith_number":"pith:YP47JQRH","schema_version":"1.0","canonical_sha256":"c3f9f4c2270f0dc294b878290be84b5f0272f98c0c87233dbc3fa0511432eb14","source":{"kind":"arxiv","id":"quant-ph/0007016","version":2},"attestation_state":"computed","paper":{"title":"Quantum Algorithms for Element Distinctness","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christoph Durr, Frederic Magniez, Harry Buhrman, Mark Heiligman, Miklos Santha, Peter Hoyer, Ronald de Wolf","submitted_at":"2000-07-06T17:18:05Z","abstract_excerpt":"We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard, Hoyer, and Tapp, and imply an O(N^{3/4} log N) quantum upper bound for the element distinctness problem in the comparison complexity model (contrasting with Theta(N log N) classical complexity). We also prove a lower bound of Omega(N^{1/2}) comparisons for this problem and derive bounds for a number of related problems."},"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/0007016","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2000-07-06T17:18:05Z","cross_cats_sorted":[],"title_canon_sha256":"30c9e29b053df7a0f596428a05a58f244e91a5cec9652869018d75337010f218","abstract_canon_sha256":"dbb504f1141795a39613094ce01a1fe9a38b815a2143056ae7eaaaa38918f98a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:12.804277Z","signature_b64":"T5+PUCdqX88jyZD7xIwYg1oRWegbkM4t6/iJNm+F7sDOuNoGhhi0UEF9drLeSrYPA96g/ofCpvYHpiJf1ly9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3f9f4c2270f0dc294b878290be84b5f0272f98c0c87233dbc3fa0511432eb14","last_reissued_at":"2026-05-18T00:53:12.803873Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:12.803873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Algorithms for Element Distinctness","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christoph Durr, Frederic Magniez, Harry Buhrman, Mark Heiligman, Miklos Santha, Peter Hoyer, Ronald de Wolf","submitted_at":"2000-07-06T17:18:05Z","abstract_excerpt":"We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard, Hoyer, and Tapp, and imply an O(N^{3/4} log N) quantum upper bound for the element distinctness problem in the comparison complexity model (contrasting with Theta(N log N) classical complexity). We also prove a lower bound of Omega(N^{1/2}) comparisons for this problem and derive bounds for a number of related problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0007016","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/0007016","created_at":"2026-05-18T00:53:12.803937+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0007016v2","created_at":"2026-05-18T00:53:12.803937+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0007016","created_at":"2026-05-18T00:53:12.803937+00:00"},{"alias_kind":"pith_short_12","alias_value":"YP47JQRHB4G4","created_at":"2026-05-18T12:25:50.254431+00:00"},{"alias_kind":"pith_short_16","alias_value":"YP47JQRHB4G4FFFY","created_at":"2026-05-18T12:25:50.254431+00:00"},{"alias_kind":"pith_short_8","alias_value":"YP47JQRH","created_at":"2026-05-18T12:25:50.254431+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.12385","citing_title":"Lower overhead fault-tolerant building blocks for noisy quantum computers","ref_index":112,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05133","citing_title":"Tight Quantum Lower Bound for k-Distinctness","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YP47JQRHB4G4FFFYPAUQX2CLL4","json":"https://pith.science/pith/YP47JQRHB4G4FFFYPAUQX2CLL4.json","graph_json":"https://pith.science/api/pith-number/YP47JQRHB4G4FFFYPAUQX2CLL4/graph.json","events_json":"https://pith.science/api/pith-number/YP47JQRHB4G4FFFYPAUQX2CLL4/events.json","paper":"https://pith.science/paper/YP47JQRH"},"agent_actions":{"view_html":"https://pith.science/pith/YP47JQRHB4G4FFFYPAUQX2CLL4","download_json":"https://pith.science/pith/YP47JQRHB4G4FFFYPAUQX2CLL4.json","view_paper":"https://pith.science/paper/YP47JQRH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0007016&json=true","fetch_graph":"https://pith.science/api/pith-number/YP47JQRHB4G4FFFYPAUQX2CLL4/graph.json","fetch_events":"https://pith.science/api/pith-number/YP47JQRHB4G4FFFYPAUQX2CLL4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YP47JQRHB4G4FFFYPAUQX2CLL4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YP47JQRHB4G4FFFYPAUQX2CLL4/action/storage_attestation","attest_author":"https://pith.science/pith/YP47JQRHB4G4FFFYPAUQX2CLL4/action/author_attestation","sign_citation":"https://pith.science/pith/YP47JQRHB4G4FFFYPAUQX2CLL4/action/citation_signature","submit_replication":"https://pith.science/pith/YP47JQRHB4G4FFFYPAUQX2CLL4/action/replication_record"}},"created_at":"2026-05-18T00:53:12.803937+00:00","updated_at":"2026-05-18T00:53:12.803937+00:00"}