{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:U6LUCSEFRAMKE4VCEV6OH6LDFM","short_pith_number":"pith:U6LUCSEF","schema_version":"1.0","canonical_sha256":"a7974148858818a272a2257ce3f9632b0b3a8fbf01d27b047a488215b3ee593d","source":{"kind":"arxiv","id":"1205.1534","version":2},"attestation_state":"computed","paper":{"title":"Learning-Graph-Based Quantum Algorithm for k-distinctness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aleksandrs Belovs","submitted_at":"2012-05-07T20:26:44Z","abstract_excerpt":"We present a quantum algorithm solving the $k$-distinctness problem in $O(n^{1-2^{k-2}/(2^k-1)})$ queries with a bounded error. This improves the previous $O(n^{k/(k+1)})$-query algorithm by Ambainis. The construction uses a modified learning graph approach. Compared to the recent paper by Belovs and Lee arXiv:1108.3022, the algorithm doesn't require any prior information on the input, and the complexity analysis is much simpler.\n  Additionally, we introduce an $O(\\sqrt{n}\\alpha^{1/6})$ algorithm for the graph collision problem where $\\alpha$ is the independence number of the graph."},"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":"1205.1534","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-05-07T20:26:44Z","cross_cats_sorted":[],"title_canon_sha256":"a380e757e0f047b2d80af8469c382bfd4184df9e04dffd73e2e29417107072a7","abstract_canon_sha256":"f273780a064d086c392dd2fccb1646a208921b6beb475e4bf0932fad28877f8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:10.172515Z","signature_b64":"tWHgWTVUZbO1G7krrz4Hm7MJ7iV6wQ+F/oI+fUxt0g8lOXzSweIegdGQ0VYxooOCJ94Vwrn4EKi/0ttj5Ve+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7974148858818a272a2257ce3f9632b0b3a8fbf01d27b047a488215b3ee593d","last_reissued_at":"2026-05-18T03:49:10.172072Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:10.172072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning-Graph-Based Quantum Algorithm for k-distinctness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aleksandrs Belovs","submitted_at":"2012-05-07T20:26:44Z","abstract_excerpt":"We present a quantum algorithm solving the $k$-distinctness problem in $O(n^{1-2^{k-2}/(2^k-1)})$ queries with a bounded error. This improves the previous $O(n^{k/(k+1)})$-query algorithm by Ambainis. The construction uses a modified learning graph approach. Compared to the recent paper by Belovs and Lee arXiv:1108.3022, the algorithm doesn't require any prior information on the input, and the complexity analysis is much simpler.\n  Additionally, we introduce an $O(\\sqrt{n}\\alpha^{1/6})$ algorithm for the graph collision problem where $\\alpha$ is the independence number of the graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1534","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":"1205.1534","created_at":"2026-05-18T03:49:10.172137+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.1534v2","created_at":"2026-05-18T03:49:10.172137+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1534","created_at":"2026-05-18T03:49:10.172137+00:00"},{"alias_kind":"pith_short_12","alias_value":"U6LUCSEFRAMK","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"U6LUCSEFRAMKE4VC","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"U6LUCSEF","created_at":"2026-05-18T12:27:23.164592+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.05133","citing_title":"Tight Quantum Lower Bound for k-Distinctness","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U6LUCSEFRAMKE4VCEV6OH6LDFM","json":"https://pith.science/pith/U6LUCSEFRAMKE4VCEV6OH6LDFM.json","graph_json":"https://pith.science/api/pith-number/U6LUCSEFRAMKE4VCEV6OH6LDFM/graph.json","events_json":"https://pith.science/api/pith-number/U6LUCSEFRAMKE4VCEV6OH6LDFM/events.json","paper":"https://pith.science/paper/U6LUCSEF"},"agent_actions":{"view_html":"https://pith.science/pith/U6LUCSEFRAMKE4VCEV6OH6LDFM","download_json":"https://pith.science/pith/U6LUCSEFRAMKE4VCEV6OH6LDFM.json","view_paper":"https://pith.science/paper/U6LUCSEF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.1534&json=true","fetch_graph":"https://pith.science/api/pith-number/U6LUCSEFRAMKE4VCEV6OH6LDFM/graph.json","fetch_events":"https://pith.science/api/pith-number/U6LUCSEFRAMKE4VCEV6OH6LDFM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U6LUCSEFRAMKE4VCEV6OH6LDFM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U6LUCSEFRAMKE4VCEV6OH6LDFM/action/storage_attestation","attest_author":"https://pith.science/pith/U6LUCSEFRAMKE4VCEV6OH6LDFM/action/author_attestation","sign_citation":"https://pith.science/pith/U6LUCSEFRAMKE4VCEV6OH6LDFM/action/citation_signature","submit_replication":"https://pith.science/pith/U6LUCSEFRAMKE4VCEV6OH6LDFM/action/replication_record"}},"created_at":"2026-05-18T03:49:10.172137+00:00","updated_at":"2026-05-18T03:49:10.172137+00:00"}