{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FQ6YTG6QJAINQMRY63N7NF74PW","short_pith_number":"pith:FQ6YTG6Q","schema_version":"1.0","canonical_sha256":"2c3d899bd04810d83238f6dbf697fc7d9d21bd55a15298177c20083a2c9745c4","source":{"kind":"arxiv","id":"2506.04165","version":3},"attestation_state":"computed","paper":{"title":"A Faster Generalized Two-Stage Approximate Top-K","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Praneeth Netrapalli, Prateek Jain, Spandana Raj Babbula, Varun Yerram, Yashas Samaga","submitted_at":"2025-06-04T17:04:09Z","abstract_excerpt":"We consider the Top-$K$ selection problem, which aims to identify the largest $K$ elements in an array. Top-$K$ selection arises in many machine learning algorithms and often becomes a bottleneck on accelerators, which are optimized for dense matrix multiplications. To address this problem, Chern et al. (2022) proposed a fast two-stage approximate Top-$K$ algorithm that: (i) partitions the input array into equal-sized chunks and selects the top-$1$ element from each partition; and (ii) sorts the resulting smaller subset and returns the top $K$ elements. In this paper, we generalize the first s"},"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":"2506.04165","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-04T17:04:09Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a618fe2cc17534a8c1fa77cb60ed69450a70bffbd44c403b130e42989e55743b","abstract_canon_sha256":"aa9cf38d0d7004d4f9c611e3adc99b0d4bd22210bfa87e85e6c52ade1efb439e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:35.507671Z","signature_b64":"9/4ORHqJvqXG2LlfP375CZJKnjyELphGyYtqry3Jvb93FdVKH2IePurfD2qyznDd+U0zsmzAGPajPTzm64TgCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c3d899bd04810d83238f6dbf697fc7d9d21bd55a15298177c20083a2c9745c4","last_reissued_at":"2026-05-18T03:09:35.507083Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:35.507083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Faster Generalized Two-Stage Approximate Top-K","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Praneeth Netrapalli, Prateek Jain, Spandana Raj Babbula, Varun Yerram, Yashas Samaga","submitted_at":"2025-06-04T17:04:09Z","abstract_excerpt":"We consider the Top-$K$ selection problem, which aims to identify the largest $K$ elements in an array. Top-$K$ selection arises in many machine learning algorithms and often becomes a bottleneck on accelerators, which are optimized for dense matrix multiplications. To address this problem, Chern et al. (2022) proposed a fast two-stage approximate Top-$K$ algorithm that: (i) partitions the input array into equal-sized chunks and selects the top-$1$ element from each partition; and (ii) sorts the resulting smaller subset and returns the top $K$ elements. In this paper, we generalize the first s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.04165","kind":"arxiv","version":3},"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":"2506.04165","created_at":"2026-05-18T03:09:35.507169+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.04165v3","created_at":"2026-05-18T03:09:35.507169+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.04165","created_at":"2026-05-18T03:09:35.507169+00:00"},{"alias_kind":"pith_short_12","alias_value":"FQ6YTG6QJAIN","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"FQ6YTG6QJAINQMRY","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"FQ6YTG6Q","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FQ6YTG6QJAINQMRY63N7NF74PW","json":"https://pith.science/pith/FQ6YTG6QJAINQMRY63N7NF74PW.json","graph_json":"https://pith.science/api/pith-number/FQ6YTG6QJAINQMRY63N7NF74PW/graph.json","events_json":"https://pith.science/api/pith-number/FQ6YTG6QJAINQMRY63N7NF74PW/events.json","paper":"https://pith.science/paper/FQ6YTG6Q"},"agent_actions":{"view_html":"https://pith.science/pith/FQ6YTG6QJAINQMRY63N7NF74PW","download_json":"https://pith.science/pith/FQ6YTG6QJAINQMRY63N7NF74PW.json","view_paper":"https://pith.science/paper/FQ6YTG6Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.04165&json=true","fetch_graph":"https://pith.science/api/pith-number/FQ6YTG6QJAINQMRY63N7NF74PW/graph.json","fetch_events":"https://pith.science/api/pith-number/FQ6YTG6QJAINQMRY63N7NF74PW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FQ6YTG6QJAINQMRY63N7NF74PW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FQ6YTG6QJAINQMRY63N7NF74PW/action/storage_attestation","attest_author":"https://pith.science/pith/FQ6YTG6QJAINQMRY63N7NF74PW/action/author_attestation","sign_citation":"https://pith.science/pith/FQ6YTG6QJAINQMRY63N7NF74PW/action/citation_signature","submit_replication":"https://pith.science/pith/FQ6YTG6QJAINQMRY63N7NF74PW/action/replication_record"}},"created_at":"2026-05-18T03:09:35.507169+00:00","updated_at":"2026-05-18T03:09:35.507169+00:00"}