{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SGQUSLVCRBXTEHB2E6XH3OXHER","short_pith_number":"pith:SGQUSLVC","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"},"canonical_sha256":"91a1492ea2886f321c3a27ae7dbae7245f09363521793c84b75d3964549bd2fc","source":{"kind":"arxiv","id":"1802.07041","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07041","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07041v1","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07041","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"pith_short_12","alias_value":"SGQUSLVCRBXT","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SGQUSLVCRBXTEHB2","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SGQUSLVC","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SGQUSLVCRBXTEHB2E6XH3OXHER","target":"record","payload":{"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"},"canonical_sha256":"91a1492ea2886f321c3a27ae7dbae7245f09363521793c84b75d3964549bd2fc","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"},"source_kind":"arxiv","source_id":"1802.07041","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-18T00:22:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hvOKb27vc3cN0tFlI0IOKKZmUzQGNXIvmOXTQOn5LReMVfZ4b3j11kxRSZFXo8OtUh9uyBpYYPbh0RN4h+y9Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T16:32:49.098589Z"},"content_sha256":"ff37cc1a12124c77cc5d1d9151af95439f9aa8c9716c5e065d430c40651ee40a","schema_version":"1.0","event_id":"sha256:ff37cc1a12124c77cc5d1d9151af95439f9aa8c9716c5e065d430c40651ee40a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SGQUSLVCRBXTEHB2E6XH3OXHER","target":"graph","payload":{"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"},"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-18T00:22:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4b63KDVfbw5YJj063ThelCjQL25E+nCnVuXIMhZ0V0FvDp0oouXq8qIugeUTHDUOqDkc2LV8VezCRZTJ/eK8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T16:32:49.098929Z"},"content_sha256":"6658cc162e091313198733f53f86cca99e1a6c4476f299061a5f229b5a82e9ee","schema_version":"1.0","event_id":"sha256:6658cc162e091313198733f53f86cca99e1a6c4476f299061a5f229b5a82e9ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SGQUSLVCRBXTEHB2E6XH3OXHER/bundle.json","state_url":"https://pith.science/pith/SGQUSLVCRBXTEHB2E6XH3OXHER/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SGQUSLVCRBXTEHB2E6XH3OXHER/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-28T16:32:49Z","links":{"resolver":"https://pith.science/pith/SGQUSLVCRBXTEHB2E6XH3OXHER","bundle":"https://pith.science/pith/SGQUSLVCRBXTEHB2E6XH3OXHER/bundle.json","state":"https://pith.science/pith/SGQUSLVCRBXTEHB2E6XH3OXHER/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SGQUSLVCRBXTEHB2E6XH3OXHER/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SGQUSLVCRBXTEHB2E6XH3OXHER","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":"376290519f02195e076efe2bd04ed36c9734062181ffa22694b6a88417df412b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-20T10:10:45Z","title_canon_sha256":"77f170054564de51a7305833c75c48e424a7d9cd8d102902c8467cfae0dd49c3"},"schema_version":"1.0","source":{"id":"1802.07041","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07041","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07041v1","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07041","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"pith_short_12","alias_value":"SGQUSLVCRBXT","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SGQUSLVCRBXTEHB2","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SGQUSLVC","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:6658cc162e091313198733f53f86cca99e1a6c4476f299061a5f229b5a82e9ee","target":"graph","created_at":"2026-05-18T00:22:53Z","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":"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 \\","authors_text":"Haim Kaplan, L\\'aszl\\'o Kozma, Or Zamir, Uri Zwick","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-20T10:10:45Z","title":"Selection from heaps, row-sorted matrices and $X+Y$ using soft heaps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07041","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:ff37cc1a12124c77cc5d1d9151af95439f9aa8c9716c5e065d430c40651ee40a","target":"record","created_at":"2026-05-18T00:22:53Z","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":"376290519f02195e076efe2bd04ed36c9734062181ffa22694b6a88417df412b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-20T10:10:45Z","title_canon_sha256":"77f170054564de51a7305833c75c48e424a7d9cd8d102902c8467cfae0dd49c3"},"schema_version":"1.0","source":{"id":"1802.07041","kind":"arxiv","version":1}},"canonical_sha256":"91a1492ea2886f321c3a27ae7dbae7245f09363521793c84b75d3964549bd2fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91a1492ea2886f321c3a27ae7dbae7245f09363521793c84b75d3964549bd2fc","first_computed_at":"2026-05-18T00:22:53.647052Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:53.647052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DCs49C8sa426HpvfRxcZ9KHSEXnKg7VK4l6tuzGJX+qMFfkTY1jODOfWuQzizOUgzyrppr/aFiFgCJDCAc8YCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:53.647593Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.07041","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff37cc1a12124c77cc5d1d9151af95439f9aa8c9716c5e065d430c40651ee40a","sha256:6658cc162e091313198733f53f86cca99e1a6c4476f299061a5f229b5a82e9ee"],"state_sha256":"547f5d91292f89af1814061ef79d43826e622a147deaca03c963358ef9588c6e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E/UhCDdNeWLjJn4Kt5U1pTpiCQ/d7v7bozKTFCAy/9QCiZLmImgDXgj+pgShR1tFrzWN7cPhtnVVb/kubp0wCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T16:32:49.100765Z","bundle_sha256":"cb46b1a39e0b6282973cc5480e9b76f3edb68cee99ff4c663aa4cb0ccda192a9"}}