{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EJ2QQ7CLFEPCQBOCGEGJU3FGV3","short_pith_number":"pith:EJ2QQ7CL","canonical_record":{"source":{"id":"1607.07673","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-26T13:01:15Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f5aacde489b850871c69693c80c4f301db9b503e2e4f9faeb4c7529ebeff2799","abstract_canon_sha256":"e05eebca234b28f773c4f812593003d94237aeaea9a59cd0010641c15f5970a6"},"schema_version":"1.0"},"canonical_sha256":"2275087c4b291e2805c2310c9a6ca6aec34f8382e859af724dab69b3f3327a9f","source":{"kind":"arxiv","id":"1607.07673","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07673","created_at":"2026-05-18T00:38:18Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07673v2","created_at":"2026-05-18T00:38:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07673","created_at":"2026-05-18T00:38:18Z"},{"alias_kind":"pith_short_12","alias_value":"EJ2QQ7CLFEPC","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EJ2QQ7CLFEPCQBOC","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EJ2QQ7CL","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EJ2QQ7CLFEPCQBOCGEGJU3FGV3","target":"record","payload":{"canonical_record":{"source":{"id":"1607.07673","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-26T13:01:15Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f5aacde489b850871c69693c80c4f301db9b503e2e4f9faeb4c7529ebeff2799","abstract_canon_sha256":"e05eebca234b28f773c4f812593003d94237aeaea9a59cd0010641c15f5970a6"},"schema_version":"1.0"},"canonical_sha256":"2275087c4b291e2805c2310c9a6ca6aec34f8382e859af724dab69b3f3327a9f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:18.641602Z","signature_b64":"rWT2ZPl5jwYTYf6w/A3Q36IED2HaNbjcNiBd/scovTiYwNbbXyng91ssdiLXZKUuRHIuS9iiuvXYdCMi8KM7Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2275087c4b291e2805c2310c9a6ca6aec34f8382e859af724dab69b3f3327a9f","last_reissued_at":"2026-05-18T00:38:18.640830Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:18.640830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.07673","source_version":2,"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:38:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P2RvkxNtmGyoC9oUy8yBHAJX542smYgpmf+FIbBQ4Ea/v9FvZqql36IRpgKdXwLh2jmVl0FOUZ4mdD+AfDvxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:57:21.219005Z"},"content_sha256":"1cbb2fa85da414088618923b39ce06b2da224422d0699012fb0b00746caa57ae","schema_version":"1.0","event_id":"sha256:1cbb2fa85da414088618923b39ce06b2da224422d0699012fb0b00746caa57ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EJ2QQ7CLFEPCQBOCGEGJU3FGV3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Selectable Sloppy Heap","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Adrian Dumitrescu","submitted_at":"2016-07-26T13:01:15Z","abstract_excerpt":"We study the selection problem, namely that of computing the $i$th order statistic of $n$ given elements. Here we offer a data structure called \\emph{selectable sloppy heap} handling a dynamic version in which upon request: (i)~a new element is inserted or (ii)~an element of a prescribed quantile group is deleted from the data structure. Each operation is executed in (ideal!) constant time---and is thus independent of $n$ (the number of elements stored in the data structure)---provided that the number of quantile groups is fixed. This is the first result of this kind accommodating both inserti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07673","kind":"arxiv","version":2},"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:38:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bOPBi+dALlK72gLmvU2QZvtgEXN61AimhNr2ylXQYy+4errVNPN9g7MDQeho0ughnkKVwaesl+duysX60GGzCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:57:21.219388Z"},"content_sha256":"4dbd03bd72f8b948f9292954cbe4a504c643b7d59a9f391d36212bcba6cc4048","schema_version":"1.0","event_id":"sha256:4dbd03bd72f8b948f9292954cbe4a504c643b7d59a9f391d36212bcba6cc4048"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EJ2QQ7CLFEPCQBOCGEGJU3FGV3/bundle.json","state_url":"https://pith.science/pith/EJ2QQ7CLFEPCQBOCGEGJU3FGV3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EJ2QQ7CLFEPCQBOCGEGJU3FGV3/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-05-30T09:57:21Z","links":{"resolver":"https://pith.science/pith/EJ2QQ7CLFEPCQBOCGEGJU3FGV3","bundle":"https://pith.science/pith/EJ2QQ7CLFEPCQBOCGEGJU3FGV3/bundle.json","state":"https://pith.science/pith/EJ2QQ7CLFEPCQBOCGEGJU3FGV3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EJ2QQ7CLFEPCQBOCGEGJU3FGV3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EJ2QQ7CLFEPCQBOCGEGJU3FGV3","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":"e05eebca234b28f773c4f812593003d94237aeaea9a59cd0010641c15f5970a6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-26T13:01:15Z","title_canon_sha256":"f5aacde489b850871c69693c80c4f301db9b503e2e4f9faeb4c7529ebeff2799"},"schema_version":"1.0","source":{"id":"1607.07673","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07673","created_at":"2026-05-18T00:38:18Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07673v2","created_at":"2026-05-18T00:38:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07673","created_at":"2026-05-18T00:38:18Z"},{"alias_kind":"pith_short_12","alias_value":"EJ2QQ7CLFEPC","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EJ2QQ7CLFEPCQBOC","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EJ2QQ7CL","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:4dbd03bd72f8b948f9292954cbe4a504c643b7d59a9f391d36212bcba6cc4048","target":"graph","created_at":"2026-05-18T00:38:18Z","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 study the selection problem, namely that of computing the $i$th order statistic of $n$ given elements. Here we offer a data structure called \\emph{selectable sloppy heap} handling a dynamic version in which upon request: (i)~a new element is inserted or (ii)~an element of a prescribed quantile group is deleted from the data structure. Each operation is executed in (ideal!) constant time---and is thus independent of $n$ (the number of elements stored in the data structure)---provided that the number of quantile groups is fixed. This is the first result of this kind accommodating both inserti","authors_text":"Adrian Dumitrescu","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-26T13:01:15Z","title":"A Selectable Sloppy Heap"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07673","kind":"arxiv","version":2},"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:1cbb2fa85da414088618923b39ce06b2da224422d0699012fb0b00746caa57ae","target":"record","created_at":"2026-05-18T00:38:18Z","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":"e05eebca234b28f773c4f812593003d94237aeaea9a59cd0010641c15f5970a6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-26T13:01:15Z","title_canon_sha256":"f5aacde489b850871c69693c80c4f301db9b503e2e4f9faeb4c7529ebeff2799"},"schema_version":"1.0","source":{"id":"1607.07673","kind":"arxiv","version":2}},"canonical_sha256":"2275087c4b291e2805c2310c9a6ca6aec34f8382e859af724dab69b3f3327a9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2275087c4b291e2805c2310c9a6ca6aec34f8382e859af724dab69b3f3327a9f","first_computed_at":"2026-05-18T00:38:18.640830Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:18.640830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rWT2ZPl5jwYTYf6w/A3Q36IED2HaNbjcNiBd/scovTiYwNbbXyng91ssdiLXZKUuRHIuS9iiuvXYdCMi8KM7Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:18.641602Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.07673","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1cbb2fa85da414088618923b39ce06b2da224422d0699012fb0b00746caa57ae","sha256:4dbd03bd72f8b948f9292954cbe4a504c643b7d59a9f391d36212bcba6cc4048"],"state_sha256":"af219ff19a1f69d15c56f331bd24877dcf7175c2ebacf7bcf01295b67b765eec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"glrrRTi+6jKQoK29YRzVjl9B7wYdEf/b6jAPIaOIyR7Nkqpc9KLCdQWRedRKvJ5KaLPUAVGfFL4KZKmzs+qFCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:57:21.221381Z","bundle_sha256":"ef545fa3e9f132668d1351c25ee7411419f1528d98a0103bfdab84683923ff22"}}