{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BLTWL6JX2TLIUFVVDDZ4R6R5YS","short_pith_number":"pith:BLTWL6JX","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"},"canonical_sha256":"0ae765f937d4d68a16b518f3c8fa3dc4ab735b96c0507fdcdd6f330143d31ef7","source":{"kind":"arxiv","id":"1412.8164","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.8164","created_at":"2026-05-18T02:30:23Z"},{"alias_kind":"arxiv_version","alias_value":"1412.8164v1","created_at":"2026-05-18T02:30:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8164","created_at":"2026-05-18T02:30:23Z"},{"alias_kind":"pith_short_12","alias_value":"BLTWL6JX2TLI","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BLTWL6JX2TLIUFVV","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BLTWL6JX","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BLTWL6JX2TLIUFVVDDZ4R6R5YS","target":"record","payload":{"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"},"canonical_sha256":"0ae765f937d4d68a16b518f3c8fa3dc4ab735b96c0507fdcdd6f330143d31ef7","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"},"source_kind":"arxiv","source_id":"1412.8164","source_version":1,"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-18T02:30:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VN15qW6mfAy6EFgu/LuwUy8e6GnucCztLFXwiyGXK64I5TGwqTxYslSkjPPaxoPzCZxrq3zEDpbjFJh8zxttCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:59:23.297752Z"},"content_sha256":"cd2934ac0a0f977a8f52bb288267cc0959ed5fd513a55f39b44658757f61e7bb","schema_version":"1.0","event_id":"sha256:cd2934ac0a0f977a8f52bb288267cc0959ed5fd513a55f39b44658757f61e7bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BLTWL6JX2TLIUFVVDDZ4R6R5YS","target":"graph","payload":{"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"},"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-18T02:30:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5fHgkMHZtffFUcu3f4F8xpunZz3/DFMnGFLgRlCQRxCq+2MA4Wvr/h9daikBVZMA2Ps4NdvIq2zPUK7AlfpyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:59:23.298093Z"},"content_sha256":"1683a8331f4afc05e860f8586daf66444b2cf9ea0799041e6cbc5ebff15b2f6e","schema_version":"1.0","event_id":"sha256:1683a8331f4afc05e860f8586daf66444b2cf9ea0799041e6cbc5ebff15b2f6e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BLTWL6JX2TLIUFVVDDZ4R6R5YS/bundle.json","state_url":"https://pith.science/pith/BLTWL6JX2TLIUFVVDDZ4R6R5YS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BLTWL6JX2TLIUFVVDDZ4R6R5YS/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-06-02T02:59:23Z","links":{"resolver":"https://pith.science/pith/BLTWL6JX2TLIUFVVDDZ4R6R5YS","bundle":"https://pith.science/pith/BLTWL6JX2TLIUFVVDDZ4R6R5YS/bundle.json","state":"https://pith.science/pith/BLTWL6JX2TLIUFVVDDZ4R6R5YS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BLTWL6JX2TLIUFVVDDZ4R6R5YS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BLTWL6JX2TLIUFVVDDZ4R6R5YS","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":"99f8c5255cce41af07eb14731b9254d37dab1f52d381eb73bd272e2610f34a45","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-28T13:26:19Z","title_canon_sha256":"c535f476dfca2587acafae40d3b2971b585030113b15c0a1ea827b25d1f74e0f"},"schema_version":"1.0","source":{"id":"1412.8164","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.8164","created_at":"2026-05-18T02:30:23Z"},{"alias_kind":"arxiv_version","alias_value":"1412.8164v1","created_at":"2026-05-18T02:30:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8164","created_at":"2026-05-18T02:30:23Z"},{"alias_kind":"pith_short_12","alias_value":"BLTWL6JX2TLI","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BLTWL6JX2TLIUFVV","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BLTWL6JX","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:1683a8331f4afc05e860f8586daf66444b2cf9ea0799041e6cbc5ebff15b2f6e","target":"graph","created_at":"2026-05-18T02:30:23Z","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":"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","authors_text":"Jialin Zhang, Qin Huang, Xiaoming Sun, Xingwu Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-28T13:26:19Z","title":"How to select the largest k elements from evolving data?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8164","kind":"arxiv","version":1},"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:cd2934ac0a0f977a8f52bb288267cc0959ed5fd513a55f39b44658757f61e7bb","target":"record","created_at":"2026-05-18T02:30:23Z","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":"99f8c5255cce41af07eb14731b9254d37dab1f52d381eb73bd272e2610f34a45","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-28T13:26:19Z","title_canon_sha256":"c535f476dfca2587acafae40d3b2971b585030113b15c0a1ea827b25d1f74e0f"},"schema_version":"1.0","source":{"id":"1412.8164","kind":"arxiv","version":1}},"canonical_sha256":"0ae765f937d4d68a16b518f3c8fa3dc4ab735b96c0507fdcdd6f330143d31ef7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ae765f937d4d68a16b518f3c8fa3dc4ab735b96c0507fdcdd6f330143d31ef7","first_computed_at":"2026-05-18T02:30:23.910261Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:23.910261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lmLrAZX7m5u8AqWZ7JsyT4R3wcGpmAqs1D1V9duG7oFUcfV42YWrW9kW/suPvuSrNHIh/VZc/TpcHiG9SiNuBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:23.910863Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.8164","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd2934ac0a0f977a8f52bb288267cc0959ed5fd513a55f39b44658757f61e7bb","sha256:1683a8331f4afc05e860f8586daf66444b2cf9ea0799041e6cbc5ebff15b2f6e"],"state_sha256":"411114592289d4553a630e95f599dabca3b2f6f08befdbe7ccb0ede8db422ec8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sin12uuz+RINoO6p36mT2zkolZSKylpsPg/uYZ06I0njZcXEb4uSuGdk3Sl2ThUFHLMRRl8rKLo9CFQWMVuyCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:59:23.300187Z","bundle_sha256":"8950d4d82800049ee285c55f3b6450744c6f5d6f06eb7fd4a870b518c2d44cb7"}}