{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FQ6YTG6QJAINQMRY63N7NF74PW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"aa9cf38d0d7004d4f9c611e3adc99b0d4bd22210bfa87e85e6c52ade1efb439e","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-04T17:04:09Z","title_canon_sha256":"a618fe2cc17534a8c1fa77cb60ed69450a70bffbd44c403b130e42989e55743b"},"schema_version":"1.0","source":{"id":"2506.04165","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.04165","created_at":"2026-05-18T03:09:35Z"},{"alias_kind":"arxiv_version","alias_value":"2506.04165v3","created_at":"2026-05-18T03:09:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.04165","created_at":"2026-05-18T03:09:35Z"},{"alias_kind":"pith_short_12","alias_value":"FQ6YTG6QJAIN","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"FQ6YTG6QJAINQMRY","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"FQ6YTG6Q","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:6cd1ee4fe1321e71bb738fcd693a81dfe434b060f141986950cc9c6664133960","target":"graph","created_at":"2026-05-18T03:09:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Praneeth Netrapalli, Prateek Jain, Spandana Raj Babbula, Varun Yerram, Yashas Samaga","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-04T17:04:09Z","title":"A Faster Generalized Two-Stage Approximate Top-K"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.04165","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:568830db45f9781ea81d018d7e66d647068f066d8e7e650b62a578415be8680d","target":"record","created_at":"2026-05-18T03:09:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"aa9cf38d0d7004d4f9c611e3adc99b0d4bd22210bfa87e85e6c52ade1efb439e","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-04T17:04:09Z","title_canon_sha256":"a618fe2cc17534a8c1fa77cb60ed69450a70bffbd44c403b130e42989e55743b"},"schema_version":"1.0","source":{"id":"2506.04165","kind":"arxiv","version":3}},"canonical_sha256":"2c3d899bd04810d83238f6dbf697fc7d9d21bd55a15298177c20083a2c9745c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c3d899bd04810d83238f6dbf697fc7d9d21bd55a15298177c20083a2c9745c4","first_computed_at":"2026-05-18T03:09:35.507083Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:35.507083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9/4ORHqJvqXG2LlfP375CZJKnjyELphGyYtqry3Jvb93FdVKH2IePurfD2qyznDd+U0zsmzAGPajPTzm64TgCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:35.507671Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.04165","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:568830db45f9781ea81d018d7e66d647068f066d8e7e650b62a578415be8680d","sha256:6cd1ee4fe1321e71bb738fcd693a81dfe434b060f141986950cc9c6664133960"],"state_sha256":"df003281293902aa26a3acd134dd0cb9f719e1e7e7a4839cca06865e875ed57d"}