{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:FQ6YTG6QJAINQMRY63N7NF74PW","short_pith_number":"pith:FQ6YTG6Q","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"},"canonical_sha256":"2c3d899bd04810d83238f6dbf697fc7d9d21bd55a15298177c20083a2c9745c4","source":{"kind":"arxiv","id":"2506.04165","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:FQ6YTG6QJAINQMRY63N7NF74PW","target":"record","payload":{"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"},"canonical_sha256":"2c3d899bd04810d83238f6dbf697fc7d9d21bd55a15298177c20083a2c9745c4","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"},"source_kind":"arxiv","source_id":"2506.04165","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yjXdki82XEW96KYPKBo8yFe2RilrjBv4K6azlF4d1EVXI5ffILDQVTjveJFGdAvB0TyTPYlRs3SEkYkSLME/Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T18:12:35.924859Z"},"content_sha256":"568830db45f9781ea81d018d7e66d647068f066d8e7e650b62a578415be8680d","schema_version":"1.0","event_id":"sha256:568830db45f9781ea81d018d7e66d647068f066d8e7e650b62a578415be8680d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:FQ6YTG6QJAINQMRY63N7NF74PW","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8JfBdmmUtbmCMJ/rU3ffoSEwBnDo2R6Ce+yBeQo8qs7F36NDhC4MxLGkHVi1q5kVz5gbalkTJHrxYzw8baPICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T18:12:35.925524Z"},"content_sha256":"6cd1ee4fe1321e71bb738fcd693a81dfe434b060f141986950cc9c6664133960","schema_version":"1.0","event_id":"sha256:6cd1ee4fe1321e71bb738fcd693a81dfe434b060f141986950cc9c6664133960"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FQ6YTG6QJAINQMRY63N7NF74PW/bundle.json","state_url":"https://pith.science/pith/FQ6YTG6QJAINQMRY63N7NF74PW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FQ6YTG6QJAINQMRY63N7NF74PW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-21T18:12:35Z","links":{"resolver":"https://pith.science/pith/FQ6YTG6QJAINQMRY63N7NF74PW","bundle":"https://pith.science/pith/FQ6YTG6QJAINQMRY63N7NF74PW/bundle.json","state":"https://pith.science/pith/FQ6YTG6QJAINQMRY63N7NF74PW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FQ6YTG6QJAINQMRY63N7NF74PW/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uU4AtLYuMQsaT4jf8XC8X1f2gne5tXj9KbGDEtl+1+Xaj3ioGnqTwwu98G1qo4qvT+1K9awBH0dMUPBspmX4DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T18:12:35.928696Z","bundle_sha256":"95006b45fc07d34385b3d0767b49a6d53642182a60219bfb440daa5e020a3239"}}