{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SGQUSLVCRBXTEHB2E6XH3OXHER","short_pith_number":"pith:SGQUSLVC","schema_version":"1.0","canonical_sha256":"91a1492ea2886f321c3a27ae7dbae7245f09363521793c84b75d3964549bd2fc","source":{"kind":"arxiv","id":"1802.07041","version":1},"attestation_state":"computed","paper":{"title":"Selection from heaps, row-sorted matrices and $X+Y$ using soft heaps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Haim Kaplan, L\\'aszl\\'o Kozma, Or Zamir, Uri Zwick","submitted_at":"2018-02-20T10:10:45Z","abstract_excerpt":"We use soft heaps to obtain simpler optimal algorithms for selecting the $k$-th smallest item, and the set of~$k$ smallest items, from a heap-ordered tree, from a collection of sorted lists, and from $X+Y$, where $X$ and $Y$ are two unsorted sets. Our results match, and in some ways extend and improve, classical results of Frederickson (1993) and Frederickson and Johnson (1982). In particular, for selecting the $k$-th smallest item, or the set of~$k$ smallest items, from a collection of~$m$ sorted lists we obtain a new optimal \"output-sensitive\" algorithm that performs only $O(m+\\sum_{i=1}^m \\"},"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":"1802.07041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-20T10:10:45Z","cross_cats_sorted":[],"title_canon_sha256":"77f170054564de51a7305833c75c48e424a7d9cd8d102902c8467cfae0dd49c3","abstract_canon_sha256":"376290519f02195e076efe2bd04ed36c9734062181ffa22694b6a88417df412b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:53.647593Z","signature_b64":"DCs49C8sa426HpvfRxcZ9KHSEXnKg7VK4l6tuzGJX+qMFfkTY1jODOfWuQzizOUgzyrppr/aFiFgCJDCAc8YCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91a1492ea2886f321c3a27ae7dbae7245f09363521793c84b75d3964549bd2fc","last_reissued_at":"2026-05-18T00:22:53.647052Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:53.647052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Selection from heaps, row-sorted matrices and $X+Y$ using soft heaps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Haim Kaplan, L\\'aszl\\'o Kozma, Or Zamir, Uri Zwick","submitted_at":"2018-02-20T10:10:45Z","abstract_excerpt":"We use soft heaps to obtain simpler optimal algorithms for selecting the $k$-th smallest item, and the set of~$k$ smallest items, from a heap-ordered tree, from a collection of sorted lists, and from $X+Y$, where $X$ and $Y$ are two unsorted sets. Our results match, and in some ways extend and improve, classical results of Frederickson (1993) and Frederickson and Johnson (1982). In particular, for selecting the $k$-th smallest item, or the set of~$k$ smallest items, from a collection of~$m$ sorted lists we obtain a new optimal \"output-sensitive\" algorithm that performs only $O(m+\\sum_{i=1}^m \\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07041","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":"1802.07041","created_at":"2026-05-18T00:22:53.647130+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.07041v1","created_at":"2026-05-18T00:22:53.647130+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07041","created_at":"2026-05-18T00:22:53.647130+00:00"},{"alias_kind":"pith_short_12","alias_value":"SGQUSLVCRBXT","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SGQUSLVCRBXTEHB2","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SGQUSLVC","created_at":"2026-05-18T12:32:53.628368+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/SGQUSLVCRBXTEHB2E6XH3OXHER","json":"https://pith.science/pith/SGQUSLVCRBXTEHB2E6XH3OXHER.json","graph_json":"https://pith.science/api/pith-number/SGQUSLVCRBXTEHB2E6XH3OXHER/graph.json","events_json":"https://pith.science/api/pith-number/SGQUSLVCRBXTEHB2E6XH3OXHER/events.json","paper":"https://pith.science/paper/SGQUSLVC"},"agent_actions":{"view_html":"https://pith.science/pith/SGQUSLVCRBXTEHB2E6XH3OXHER","download_json":"https://pith.science/pith/SGQUSLVCRBXTEHB2E6XH3OXHER.json","view_paper":"https://pith.science/paper/SGQUSLVC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.07041&json=true","fetch_graph":"https://pith.science/api/pith-number/SGQUSLVCRBXTEHB2E6XH3OXHER/graph.json","fetch_events":"https://pith.science/api/pith-number/SGQUSLVCRBXTEHB2E6XH3OXHER/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SGQUSLVCRBXTEHB2E6XH3OXHER/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SGQUSLVCRBXTEHB2E6XH3OXHER/action/storage_attestation","attest_author":"https://pith.science/pith/SGQUSLVCRBXTEHB2E6XH3OXHER/action/author_attestation","sign_citation":"https://pith.science/pith/SGQUSLVCRBXTEHB2E6XH3OXHER/action/citation_signature","submit_replication":"https://pith.science/pith/SGQUSLVCRBXTEHB2E6XH3OXHER/action/replication_record"}},"created_at":"2026-05-18T00:22:53.647130+00:00","updated_at":"2026-05-18T00:22:53.647130+00:00"}