{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CPVFO3PVKKVEVKY25ZYNBLO2GI","short_pith_number":"pith:CPVFO3PV","canonical_record":{"source":{"id":"1907.08579","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-19T17:17:44Z","cross_cats_sorted":[],"title_canon_sha256":"5a82447691d2293b4a14d957fea5c38e65b434f91790a65f0f5191f5e51a4a86","abstract_canon_sha256":"08207c82cab2eb9265e04b7bd893571f0be3e529db807a611eadefc57bfd05eb"},"schema_version":"1.0"},"canonical_sha256":"13ea576df552aa4aab1aee70d0adda322d1987b0b52b2ae75fc96ed61989d48c","source":{"kind":"arxiv","id":"1907.08579","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08579","created_at":"2026-05-17T23:40:09Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08579v1","created_at":"2026-05-17T23:40:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08579","created_at":"2026-05-17T23:40:09Z"},{"alias_kind":"pith_short_12","alias_value":"CPVFO3PVKKVE","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CPVFO3PVKKVEVKY2","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CPVFO3PV","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CPVFO3PVKKVEVKY25ZYNBLO2GI","target":"record","payload":{"canonical_record":{"source":{"id":"1907.08579","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-19T17:17:44Z","cross_cats_sorted":[],"title_canon_sha256":"5a82447691d2293b4a14d957fea5c38e65b434f91790a65f0f5191f5e51a4a86","abstract_canon_sha256":"08207c82cab2eb9265e04b7bd893571f0be3e529db807a611eadefc57bfd05eb"},"schema_version":"1.0"},"canonical_sha256":"13ea576df552aa4aab1aee70d0adda322d1987b0b52b2ae75fc96ed61989d48c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:09.384984Z","signature_b64":"QeHT20A15elpbvhd1+Su1b2AeLRjmwb9i5Xf3xKOmzjpBO8p8y6XOYeQEynXZHHxeJjgZWlEHY7X8xGeXWEGAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13ea576df552aa4aab1aee70d0adda322d1987b0b52b2ae75fc96ed61989d48c","last_reissued_at":"2026-05-17T23:40:09.384359Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:09.384359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.08579","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-17T23:40:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LdlSiSbMiMKU062T6OR7heUBsm+cyMPCkI4KWrcFdNVrSUg2R009smIW9gQeWMFgvZGvLCS+0JGassY1HtLaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:49:19.900066Z"},"content_sha256":"b0d819e0adb98d54067e7f244640eeaee5fdc607a27d97b683f2f5b7e51ea102","schema_version":"1.0","event_id":"sha256:b0d819e0adb98d54067e7f244640eeaee5fdc607a27d97b683f2f5b7e51ea102"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CPVFO3PVKKVEVKY25ZYNBLO2GI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Approximate Range Mode and Range Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bryce Sandlund, Hicham El-Zein, J. Ian Munro, Meng He, Yakov Nekrich","submitted_at":"2019-07-19T17:17:44Z","abstract_excerpt":"For any $\\epsilon \\in (0,1)$, a $(1+\\epsilon)$-approximate range mode query asks for the position of an element whose frequency in the query range is at most a factor $(1+\\epsilon)$ smaller than the true mode. For this problem, we design an $O(n/\\epsilon)$ bit data structure supporting queries in $O(\\lg(1/\\epsilon))$ time. This is an encoding data structure which does not require access to the input sequence; we prove the space cost is asymptotically optimal for constant $\\epsilon$. Our solution improves the previous best result of Greve et al. (Cell Probe Lower Bounds and Approximations for R"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08579","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-17T23:40:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NA2xi7iuU60QvoQqeje5burJDTpFF0SEy94PuugvRm102NHk5exKC/6vLcVHGIqqltFSrCMTWG9yEoQdApYoAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:49:19.900504Z"},"content_sha256":"91e2fc1ff8c4cf0ab981ba97e4f88770e900af879208c621269fc80297edd9b9","schema_version":"1.0","event_id":"sha256:91e2fc1ff8c4cf0ab981ba97e4f88770e900af879208c621269fc80297edd9b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CPVFO3PVKKVEVKY25ZYNBLO2GI/bundle.json","state_url":"https://pith.science/pith/CPVFO3PVKKVEVKY25ZYNBLO2GI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CPVFO3PVKKVEVKY25ZYNBLO2GI/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-27T18:49:19Z","links":{"resolver":"https://pith.science/pith/CPVFO3PVKKVEVKY25ZYNBLO2GI","bundle":"https://pith.science/pith/CPVFO3PVKKVEVKY25ZYNBLO2GI/bundle.json","state":"https://pith.science/pith/CPVFO3PVKKVEVKY25ZYNBLO2GI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CPVFO3PVKKVEVKY25ZYNBLO2GI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CPVFO3PVKKVEVKY25ZYNBLO2GI","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":"08207c82cab2eb9265e04b7bd893571f0be3e529db807a611eadefc57bfd05eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-19T17:17:44Z","title_canon_sha256":"5a82447691d2293b4a14d957fea5c38e65b434f91790a65f0f5191f5e51a4a86"},"schema_version":"1.0","source":{"id":"1907.08579","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08579","created_at":"2026-05-17T23:40:09Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08579v1","created_at":"2026-05-17T23:40:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08579","created_at":"2026-05-17T23:40:09Z"},{"alias_kind":"pith_short_12","alias_value":"CPVFO3PVKKVE","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CPVFO3PVKKVEVKY2","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CPVFO3PV","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:91e2fc1ff8c4cf0ab981ba97e4f88770e900af879208c621269fc80297edd9b9","target":"graph","created_at":"2026-05-17T23:40:09Z","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":"For any $\\epsilon \\in (0,1)$, a $(1+\\epsilon)$-approximate range mode query asks for the position of an element whose frequency in the query range is at most a factor $(1+\\epsilon)$ smaller than the true mode. For this problem, we design an $O(n/\\epsilon)$ bit data structure supporting queries in $O(\\lg(1/\\epsilon))$ time. This is an encoding data structure which does not require access to the input sequence; we prove the space cost is asymptotically optimal for constant $\\epsilon$. Our solution improves the previous best result of Greve et al. (Cell Probe Lower Bounds and Approximations for R","authors_text":"Bryce Sandlund, Hicham El-Zein, J. Ian Munro, Meng He, Yakov Nekrich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-19T17:17:44Z","title":"On Approximate Range Mode and Range Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08579","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:b0d819e0adb98d54067e7f244640eeaee5fdc607a27d97b683f2f5b7e51ea102","target":"record","created_at":"2026-05-17T23:40:09Z","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":"08207c82cab2eb9265e04b7bd893571f0be3e529db807a611eadefc57bfd05eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-19T17:17:44Z","title_canon_sha256":"5a82447691d2293b4a14d957fea5c38e65b434f91790a65f0f5191f5e51a4a86"},"schema_version":"1.0","source":{"id":"1907.08579","kind":"arxiv","version":1}},"canonical_sha256":"13ea576df552aa4aab1aee70d0adda322d1987b0b52b2ae75fc96ed61989d48c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13ea576df552aa4aab1aee70d0adda322d1987b0b52b2ae75fc96ed61989d48c","first_computed_at":"2026-05-17T23:40:09.384359Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:09.384359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QeHT20A15elpbvhd1+Su1b2AeLRjmwb9i5Xf3xKOmzjpBO8p8y6XOYeQEynXZHHxeJjgZWlEHY7X8xGeXWEGAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:09.384984Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.08579","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0d819e0adb98d54067e7f244640eeaee5fdc607a27d97b683f2f5b7e51ea102","sha256:91e2fc1ff8c4cf0ab981ba97e4f88770e900af879208c621269fc80297edd9b9"],"state_sha256":"b3b8fd61585f6c55b08cad77650dce3e0f1f7654509c024f1d3a0e4f61fcff69"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dTKq94p14NYjsFitcmcB+6Uj5viZANDEamP7aXvlxS88hC0CrnFhR1vf4C56JBiTHCbROrMxgbxFyg734wKTCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:49:19.903077Z","bundle_sha256":"b5b11c4bfe13caa1bae340690172f7854c7d540f8e2a45d0d1ef4da83bf91609"}}