{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BLTWL6JX2TLIUFVVDDZ4R6R5YS","short_pith_number":"pith:BLTWL6JX","schema_version":"1.0","canonical_sha256":"0ae765f937d4d68a16b518f3c8fa3dc4ab735b96c0507fdcdd6f330143d31ef7","source":{"kind":"arxiv","id":"1412.8164","version":1},"attestation_state":"computed","paper":{"title":"How to select the largest k elements from evolving data?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jialin Zhang, Qin Huang, Xiaoming Sun, Xingwu Liu","submitted_at":"2014-12-28T13:26:19Z","abstract_excerpt":"In this paper we investigate the top-$k$-selection problem, i.e. determine the largest, second largest, ..., and the $k$-th largest elements, in the dynamic data model. In this model the order of elements evolves dynamically over time. In each time step the algorithm can only probe the changes of data by comparing a pair of elements. Previously only two special cases were studied[2]: finding the largest element and the median; and sorting all elements. This paper systematically deals with $k\\in [n]$ and solves the problem almost completely. Specifically, we identify a critical point $k^*$ such"},"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":"1412.8164","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-28T13:26:19Z","cross_cats_sorted":[],"title_canon_sha256":"c535f476dfca2587acafae40d3b2971b585030113b15c0a1ea827b25d1f74e0f","abstract_canon_sha256":"99f8c5255cce41af07eb14731b9254d37dab1f52d381eb73bd272e2610f34a45"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:23.910863Z","signature_b64":"lmLrAZX7m5u8AqWZ7JsyT4R3wcGpmAqs1D1V9duG7oFUcfV42YWrW9kW/suPvuSrNHIh/VZc/TpcHiG9SiNuBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ae765f937d4d68a16b518f3c8fa3dc4ab735b96c0507fdcdd6f330143d31ef7","last_reissued_at":"2026-05-18T02:30:23.910261Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:23.910261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to select the largest k elements from evolving data?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jialin Zhang, Qin Huang, Xiaoming Sun, Xingwu Liu","submitted_at":"2014-12-28T13:26:19Z","abstract_excerpt":"In this paper we investigate the top-$k$-selection problem, i.e. determine the largest, second largest, ..., and the $k$-th largest elements, in the dynamic data model. In this model the order of elements evolves dynamically over time. In each time step the algorithm can only probe the changes of data by comparing a pair of elements. Previously only two special cases were studied[2]: finding the largest element and the median; and sorting all elements. This paper systematically deals with $k\\in [n]$ and solves the problem almost completely. Specifically, we identify a critical point $k^*$ such"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8164","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":""},"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":"1412.8164","created_at":"2026-05-18T02:30:23.910373+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.8164v1","created_at":"2026-05-18T02:30:23.910373+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8164","created_at":"2026-05-18T02:30:23.910373+00:00"},{"alias_kind":"pith_short_12","alias_value":"BLTWL6JX2TLI","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"BLTWL6JX2TLIUFVV","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"BLTWL6JX","created_at":"2026-05-18T12:28:22.404517+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/BLTWL6JX2TLIUFVVDDZ4R6R5YS","json":"https://pith.science/pith/BLTWL6JX2TLIUFVVDDZ4R6R5YS.json","graph_json":"https://pith.science/api/pith-number/BLTWL6JX2TLIUFVVDDZ4R6R5YS/graph.json","events_json":"https://pith.science/api/pith-number/BLTWL6JX2TLIUFVVDDZ4R6R5YS/events.json","paper":"https://pith.science/paper/BLTWL6JX"},"agent_actions":{"view_html":"https://pith.science/pith/BLTWL6JX2TLIUFVVDDZ4R6R5YS","download_json":"https://pith.science/pith/BLTWL6JX2TLIUFVVDDZ4R6R5YS.json","view_paper":"https://pith.science/paper/BLTWL6JX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.8164&json=true","fetch_graph":"https://pith.science/api/pith-number/BLTWL6JX2TLIUFVVDDZ4R6R5YS/graph.json","fetch_events":"https://pith.science/api/pith-number/BLTWL6JX2TLIUFVVDDZ4R6R5YS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BLTWL6JX2TLIUFVVDDZ4R6R5YS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BLTWL6JX2TLIUFVVDDZ4R6R5YS/action/storage_attestation","attest_author":"https://pith.science/pith/BLTWL6JX2TLIUFVVDDZ4R6R5YS/action/author_attestation","sign_citation":"https://pith.science/pith/BLTWL6JX2TLIUFVVDDZ4R6R5YS/action/citation_signature","submit_replication":"https://pith.science/pith/BLTWL6JX2TLIUFVVDDZ4R6R5YS/action/replication_record"}},"created_at":"2026-05-18T02:30:23.910373+00:00","updated_at":"2026-05-18T02:30:23.910373+00:00"}