{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:V43XH32QI4YGO7PCF63ESGP2QP","short_pith_number":"pith:V43XH32Q","schema_version":"1.0","canonical_sha256":"af3773ef504730677de22fb64919fa83ffcbd94f8e8b99e3b7338d414a260b57","source":{"kind":"arxiv","id":"2608.12573","version":1},"attestation_state":"computed","paper":{"title":"Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jacek Tabor, {\\L}ukasz Struski, Marcin Mazur, Tadeusz Dziarmaga, Witold Sikora","submitted_at":"2026-08-12T20:31:33Z","abstract_excerpt":"Top-k selection is a fundamental computational primitive with applications spanning databases, information retrieval, signal processing, and modern machine learning workloads, including sparse activations and attention pruning. As data sizes grow, existing approaches become inefficient: exact methods incur high memory and compute overhead, while approximate methods often rely on brittle heuristics that degrade under adversarial or heavy-tailed inputs. In this paper, we introduce Prof-K, a fast, scalable, and distribution-agnostic top-k algorithm with probabilistic correctness guarantees. Prof-"},"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":"2608.12573","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-12T20:31:33Z","cross_cats_sorted":[],"title_canon_sha256":"d2b2056e091a4d316454e65ad6858f2ca405e44bd7c275f4a97eb30866d09913","abstract_canon_sha256":"af888550ca6971df61c918cba808f4ea6816efe82bdee6bbfb5eae047b1b1f85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-14T00:45:15.936353Z","signature_b64":"T7KmPppvDsspkNoCg4yFgE+SuAsMv3dEZ8MPw2+RnDEcruKDE6FzURb5ecitn1VKvJtbukqyvVDMcxm34RjABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af3773ef504730677de22fb64919fa83ffcbd94f8e8b99e3b7338d414a260b57","last_reissued_at":"2026-08-14T00:45:15.925477Z","signature_status":"signed_v1","first_computed_at":"2026-08-14T00:45:15.925477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jacek Tabor, {\\L}ukasz Struski, Marcin Mazur, Tadeusz Dziarmaga, Witold Sikora","submitted_at":"2026-08-12T20:31:33Z","abstract_excerpt":"Top-k selection is a fundamental computational primitive with applications spanning databases, information retrieval, signal processing, and modern machine learning workloads, including sparse activations and attention pruning. As data sizes grow, existing approaches become inefficient: exact methods incur high memory and compute overhead, while approximate methods often rely on brittle heuristics that degrade under adversarial or heavy-tailed inputs. In this paper, we introduce Prof-K, a fast, scalable, and distribution-agnostic top-k algorithm with probabilistic correctness guarantees. Prof-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.12573","kind":"arxiv","version":1},"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/2608.12573/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2608.12573","created_at":"2026-08-14T00:45:15.935094+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.12573v1","created_at":"2026-08-14T00:45:15.935094+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.12573","created_at":"2026-08-14T00:45:15.935094+00:00"},{"alias_kind":"pith_short_12","alias_value":"V43XH32QI4YG","created_at":"2026-08-14T00:45:15.935094+00:00"},{"alias_kind":"pith_short_16","alias_value":"V43XH32QI4YGO7PC","created_at":"2026-08-14T00:45:15.935094+00:00"},{"alias_kind":"pith_short_8","alias_value":"V43XH32Q","created_at":"2026-08-14T00:45:15.935094+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/V43XH32QI4YGO7PCF63ESGP2QP","json":"https://pith.science/pith/V43XH32QI4YGO7PCF63ESGP2QP.json","graph_json":"https://pith.science/api/pith-number/V43XH32QI4YGO7PCF63ESGP2QP/graph.json","events_json":"https://pith.science/api/pith-number/V43XH32QI4YGO7PCF63ESGP2QP/events.json","paper":"https://pith.science/paper/V43XH32Q"},"agent_actions":{"view_html":"https://pith.science/pith/V43XH32QI4YGO7PCF63ESGP2QP","download_json":"https://pith.science/pith/V43XH32QI4YGO7PCF63ESGP2QP.json","view_paper":"https://pith.science/paper/V43XH32Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.12573&json=true","fetch_graph":"https://pith.science/api/pith-number/V43XH32QI4YGO7PCF63ESGP2QP/graph.json","fetch_events":"https://pith.science/api/pith-number/V43XH32QI4YGO7PCF63ESGP2QP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V43XH32QI4YGO7PCF63ESGP2QP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V43XH32QI4YGO7PCF63ESGP2QP/action/storage_attestation","attest_author":"https://pith.science/pith/V43XH32QI4YGO7PCF63ESGP2QP/action/author_attestation","sign_citation":"https://pith.science/pith/V43XH32QI4YGO7PCF63ESGP2QP/action/citation_signature","submit_replication":"https://pith.science/pith/V43XH32QI4YGO7PCF63ESGP2QP/action/replication_record"}},"created_at":"2026-08-14T00:45:15.935094+00:00","updated_at":"2026-08-14T00:45:15.935094+00:00"}