{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:AKFYGWTHTMO2SDFZFM4JWC4DYU","short_pith_number":"pith:AKFYGWTH","canonical_record":{"source":{"id":"2409.00822","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-09-01T19:43:40Z","cross_cats_sorted":[],"title_canon_sha256":"3c1944baeef19149d697798b8c604eff79c88b7ba6c7b527a4cc41eb697153af","abstract_canon_sha256":"80c75ef2766162b55aadc242a47b8d9ffb941016a50b09004583f2436b915d9f"},"schema_version":"1.0"},"canonical_sha256":"028b835a679b1da90cb92b389b0b83c5068f83b0f031b77e1b8e3c192f50c4b7","source":{"kind":"arxiv","id":"2409.00822","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.00822","created_at":"2026-07-05T10:43:01Z"},{"alias_kind":"arxiv_version","alias_value":"2409.00822v4","created_at":"2026-07-05T10:43:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.00822","created_at":"2026-07-05T10:43:01Z"},{"alias_kind":"pith_short_12","alias_value":"AKFYGWTHTMO2","created_at":"2026-07-05T10:43:01Z"},{"alias_kind":"pith_short_16","alias_value":"AKFYGWTHTMO2SDFZ","created_at":"2026-07-05T10:43:01Z"},{"alias_kind":"pith_short_8","alias_value":"AKFYGWTH","created_at":"2026-07-05T10:43:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:AKFYGWTHTMO2SDFZFM4JWC4DYU","target":"record","payload":{"canonical_record":{"source":{"id":"2409.00822","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-09-01T19:43:40Z","cross_cats_sorted":[],"title_canon_sha256":"3c1944baeef19149d697798b8c604eff79c88b7ba6c7b527a4cc41eb697153af","abstract_canon_sha256":"80c75ef2766162b55aadc242a47b8d9ffb941016a50b09004583f2436b915d9f"},"schema_version":"1.0"},"canonical_sha256":"028b835a679b1da90cb92b389b0b83c5068f83b0f031b77e1b8e3c192f50c4b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:43:01.045131Z","signature_b64":"tNRHeXbNQL4x+n8HSRbjLGzS7pymjFm+1k/DX/TaA2tntdOjDcmGuG7QKhxnZyWclDUcq2VUSgalhtS1uG6MAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"028b835a679b1da90cb92b389b0b83c5068f83b0f031b77e1b8e3c192f50c4b7","last_reissued_at":"2026-07-05T10:43:01.044688Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:43:01.044688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.00822","source_version":4,"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-07-05T10:43:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xolp5bW2OEW2FbuBD0EUT4Q+FTQnQL7VT/vU/Fw/5YHOWEzKgEMRakD1IO2kVR78UTj6pWey+4vUhvuTmSPCAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:39:37.166141Z"},"content_sha256":"f407cd553351e6a65f694d531cb337bd53d8e42da1f01fabf482a68330b7a4cb","schema_version":"1.0","event_id":"sha256:f407cd553351e6a65f694d531cb337bd53d8e42da1f01fabf482a68330b7a4cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:AKFYGWTHTMO2SDFZFM4JWC4DYU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"RTop-K: Ultra-Fast Row-Wise Top-K Selection for Neural Network Acceleration on GPUs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Caiwen Ding, Hongwu Peng, Xi Xie, Yuebo Luo","submitted_at":"2024-09-01T19:43:40Z","abstract_excerpt":"Top-k selection algorithms are fundamental in a wide range of applications, including high-performance computing, information retrieval, big data processing, and neural network model training. In this paper, we present RTop-K, a highly efficient parallel row-wise top-k selection algorithm specifically designed for GPUs. RTop-K leverages a binary search-based approach to optimize row-wise top-k selection, providing a scalable and accelerated solution. We conduct a detailed analysis of early stopping in our algorithm, showing that it effectively maintains the testing accuracy of neural network m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.00822","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.00822/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T10:43:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6F4kv3OH5qoNsja3cK0SHFsSZgPWpI906hCQ2BQaoywsYhOnHkw/40TTJgcoafxlyyg7gPVO077eWwyyU7MfAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:39:37.166555Z"},"content_sha256":"cd30693421ec510586ec538d1912c04e9df725bb986b77df1bb5a6e8de25145d","schema_version":"1.0","event_id":"sha256:cd30693421ec510586ec538d1912c04e9df725bb986b77df1bb5a6e8de25145d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AKFYGWTHTMO2SDFZFM4JWC4DYU/bundle.json","state_url":"https://pith.science/pith/AKFYGWTHTMO2SDFZFM4JWC4DYU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AKFYGWTHTMO2SDFZFM4JWC4DYU/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-07-07T06:39:37Z","links":{"resolver":"https://pith.science/pith/AKFYGWTHTMO2SDFZFM4JWC4DYU","bundle":"https://pith.science/pith/AKFYGWTHTMO2SDFZFM4JWC4DYU/bundle.json","state":"https://pith.science/pith/AKFYGWTHTMO2SDFZFM4JWC4DYU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AKFYGWTHTMO2SDFZFM4JWC4DYU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:AKFYGWTHTMO2SDFZFM4JWC4DYU","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":"80c75ef2766162b55aadc242a47b8d9ffb941016a50b09004583f2436b915d9f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-09-01T19:43:40Z","title_canon_sha256":"3c1944baeef19149d697798b8c604eff79c88b7ba6c7b527a4cc41eb697153af"},"schema_version":"1.0","source":{"id":"2409.00822","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.00822","created_at":"2026-07-05T10:43:01Z"},{"alias_kind":"arxiv_version","alias_value":"2409.00822v4","created_at":"2026-07-05T10:43:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.00822","created_at":"2026-07-05T10:43:01Z"},{"alias_kind":"pith_short_12","alias_value":"AKFYGWTHTMO2","created_at":"2026-07-05T10:43:01Z"},{"alias_kind":"pith_short_16","alias_value":"AKFYGWTHTMO2SDFZ","created_at":"2026-07-05T10:43:01Z"},{"alias_kind":"pith_short_8","alias_value":"AKFYGWTH","created_at":"2026-07-05T10:43:01Z"}],"graph_snapshots":[{"event_id":"sha256:cd30693421ec510586ec538d1912c04e9df725bb986b77df1bb5a6e8de25145d","target":"graph","created_at":"2026-07-05T10:43:01Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2409.00822/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Top-k selection algorithms are fundamental in a wide range of applications, including high-performance computing, information retrieval, big data processing, and neural network model training. In this paper, we present RTop-K, a highly efficient parallel row-wise top-k selection algorithm specifically designed for GPUs. RTop-K leverages a binary search-based approach to optimize row-wise top-k selection, providing a scalable and accelerated solution. We conduct a detailed analysis of early stopping in our algorithm, showing that it effectively maintains the testing accuracy of neural network m","authors_text":"Caiwen Ding, Hongwu Peng, Xi Xie, Yuebo Luo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-09-01T19:43:40Z","title":"RTop-K: Ultra-Fast Row-Wise Top-K Selection for Neural Network Acceleration on GPUs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.00822","kind":"arxiv","version":4},"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:f407cd553351e6a65f694d531cb337bd53d8e42da1f01fabf482a68330b7a4cb","target":"record","created_at":"2026-07-05T10:43:01Z","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":"80c75ef2766162b55aadc242a47b8d9ffb941016a50b09004583f2436b915d9f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-09-01T19:43:40Z","title_canon_sha256":"3c1944baeef19149d697798b8c604eff79c88b7ba6c7b527a4cc41eb697153af"},"schema_version":"1.0","source":{"id":"2409.00822","kind":"arxiv","version":4}},"canonical_sha256":"028b835a679b1da90cb92b389b0b83c5068f83b0f031b77e1b8e3c192f50c4b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"028b835a679b1da90cb92b389b0b83c5068f83b0f031b77e1b8e3c192f50c4b7","first_computed_at":"2026-07-05T10:43:01.044688Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:43:01.044688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tNRHeXbNQL4x+n8HSRbjLGzS7pymjFm+1k/DX/TaA2tntdOjDcmGuG7QKhxnZyWclDUcq2VUSgalhtS1uG6MAw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:43:01.045131Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.00822","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f407cd553351e6a65f694d531cb337bd53d8e42da1f01fabf482a68330b7a4cb","sha256:cd30693421ec510586ec538d1912c04e9df725bb986b77df1bb5a6e8de25145d"],"state_sha256":"48bca9a131ac79815cfdda45dd08128088335bd5816a7227e6b78481f34b15dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/PTKFelHspqRBsUlwL4H2GfPO26d6XKCZcbvjwX66HINnHgSVz6hdB2g5pr9S1+eBpmjHWRZES7SzGDf1UqTCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T06:39:37.169146Z","bundle_sha256":"91610c2e657555254aca7a6ad202772e78d88e9eaf8baf1a3c8e63beefdebffa"}}