{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4L5MDA2B3UKMZ4J4HPSFL56NSZ","short_pith_number":"pith:4L5MDA2B","schema_version":"1.0","canonical_sha256":"e2fac18341dd14ccf13c3be455f7cd965a4e0401b83d03d6bf8f02edb0ffe795","source":{"kind":"arxiv","id":"1402.2712","version":3},"attestation_state":"computed","paper":{"title":"Dynamic Partial Sorting","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jiamou Liu, Kostya Ross","submitted_at":"2014-02-12T01:36:36Z","abstract_excerpt":"The dynamic partial sorting problem asks for an algorithm that maintains lists of numbers under the link, cut and change value operations, and queries the sorted sequence of the $k$ least numbers in one of the lists. We first solve the problem in $O(k\\log (n))$ time for queries and $O(\\log (n))$ time for updates using the tournament tree data structure, where $n$ is the number of elements in the lists. We then introduce a layered tournament tree data structure and solve the same problem in $O(\\log_\\varphi^* (n) k\\log (k))$ time for queries and $O\\left(\\log (n)\\cdot\\log^2\\log (n)\\right)$ for up"},"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":"1402.2712","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2014-02-12T01:36:36Z","cross_cats_sorted":[],"title_canon_sha256":"e47a8bb1a6e497d890a2ef57877235af1e0c9d139d98ab40b21907a309f6694d","abstract_canon_sha256":"83c35989b150c1676ad0cccfa8c716bef1e33841239c635c4fcd92b0d92f3dea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:55.836342Z","signature_b64":"dkFk1FW7v7y5pBqk11d4qlW8pf5qbNCX/ZOUcHk1CNj6G6staIqth66jY5QGM4BOCSh/5TwW47MR2Jt7HZy3Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2fac18341dd14ccf13c3be455f7cd965a4e0401b83d03d6bf8f02edb0ffe795","last_reissued_at":"2026-05-18T02:53:55.835451Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:55.835451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Partial Sorting","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jiamou Liu, Kostya Ross","submitted_at":"2014-02-12T01:36:36Z","abstract_excerpt":"The dynamic partial sorting problem asks for an algorithm that maintains lists of numbers under the link, cut and change value operations, and queries the sorted sequence of the $k$ least numbers in one of the lists. We first solve the problem in $O(k\\log (n))$ time for queries and $O(\\log (n))$ time for updates using the tournament tree data structure, where $n$ is the number of elements in the lists. We then introduce a layered tournament tree data structure and solve the same problem in $O(\\log_\\varphi^* (n) k\\log (k))$ time for queries and $O\\left(\\log (n)\\cdot\\log^2\\log (n)\\right)$ for up"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2712","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1402.2712","created_at":"2026-05-18T02:53:55.835600+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.2712v3","created_at":"2026-05-18T02:53:55.835600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2712","created_at":"2026-05-18T02:53:55.835600+00:00"},{"alias_kind":"pith_short_12","alias_value":"4L5MDA2B3UKM","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4L5MDA2B3UKMZ4J4","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4L5MDA2B","created_at":"2026-05-18T12:28:14.216126+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/4L5MDA2B3UKMZ4J4HPSFL56NSZ","json":"https://pith.science/pith/4L5MDA2B3UKMZ4J4HPSFL56NSZ.json","graph_json":"https://pith.science/api/pith-number/4L5MDA2B3UKMZ4J4HPSFL56NSZ/graph.json","events_json":"https://pith.science/api/pith-number/4L5MDA2B3UKMZ4J4HPSFL56NSZ/events.json","paper":"https://pith.science/paper/4L5MDA2B"},"agent_actions":{"view_html":"https://pith.science/pith/4L5MDA2B3UKMZ4J4HPSFL56NSZ","download_json":"https://pith.science/pith/4L5MDA2B3UKMZ4J4HPSFL56NSZ.json","view_paper":"https://pith.science/paper/4L5MDA2B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.2712&json=true","fetch_graph":"https://pith.science/api/pith-number/4L5MDA2B3UKMZ4J4HPSFL56NSZ/graph.json","fetch_events":"https://pith.science/api/pith-number/4L5MDA2B3UKMZ4J4HPSFL56NSZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4L5MDA2B3UKMZ4J4HPSFL56NSZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4L5MDA2B3UKMZ4J4HPSFL56NSZ/action/storage_attestation","attest_author":"https://pith.science/pith/4L5MDA2B3UKMZ4J4HPSFL56NSZ/action/author_attestation","sign_citation":"https://pith.science/pith/4L5MDA2B3UKMZ4J4HPSFL56NSZ/action/citation_signature","submit_replication":"https://pith.science/pith/4L5MDA2B3UKMZ4J4HPSFL56NSZ/action/replication_record"}},"created_at":"2026-05-18T02:53:55.835600+00:00","updated_at":"2026-05-18T02:53:55.835600+00:00"}