{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OLGPYOCDZLF6UGXATWRBHSUVOE","short_pith_number":"pith:OLGPYOCD","schema_version":"1.0","canonical_sha256":"72ccfc3843cacbea1ae09da213ca95712ea6f1ad2697250080f46c4f766a1797","source":{"kind":"arxiv","id":"1407.2907","version":1},"attestation_state":"computed","paper":{"title":"Approximate Range Emptiness in Constant Time and Optimal Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Allan Gr{\\o}nlund, Kasper Green Larsen, Mayank Goswami, Rasmus Pagh","submitted_at":"2014-07-10T19:14:59Z","abstract_excerpt":"This paper studies the \\emph{$\\varepsilon$-approximate range emptiness} problem, where the task is to represent a set $S$ of $n$ points from $\\{0,\\ldots,U-1\\}$ and answer emptiness queries of the form \"$[a ; b]\\cap S \\neq \\emptyset$ ?\" with a probability of \\emph{false positives} allowed. This generalizes the functionality of \\emph{Bloom filters} from single point queries to any interval length $L$. Setting the false positive rate to $\\varepsilon/L$ and performing $L$ queries, Bloom filters yield a solution to this problem with space $O(n \\lg(L/\\varepsilon))$ bits, false positive probability b"},"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":"1407.2907","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-10T19:14:59Z","cross_cats_sorted":[],"title_canon_sha256":"58d445bea8d5e0669359a90691d9f08a2680f004c75b8855dc7bb0b6bcec53d4","abstract_canon_sha256":"443b0f4778e4e8c9a2cca72939bc757a93e654f72d7fdf4785bd6ef945c65f13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:53.407514Z","signature_b64":"vH6X0K5IJBUJd5+f7eZnopon7Pt+JHGGepj/26NF6A4B7TBjDKM+YYRugfWBVtjqDschf3yFIAxL+meB7NXfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72ccfc3843cacbea1ae09da213ca95712ea6f1ad2697250080f46c4f766a1797","last_reissued_at":"2026-05-18T02:47:53.406947Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:53.406947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Range Emptiness in Constant Time and Optimal Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Allan Gr{\\o}nlund, Kasper Green Larsen, Mayank Goswami, Rasmus Pagh","submitted_at":"2014-07-10T19:14:59Z","abstract_excerpt":"This paper studies the \\emph{$\\varepsilon$-approximate range emptiness} problem, where the task is to represent a set $S$ of $n$ points from $\\{0,\\ldots,U-1\\}$ and answer emptiness queries of the form \"$[a ; b]\\cap S \\neq \\emptyset$ ?\" with a probability of \\emph{false positives} allowed. This generalizes the functionality of \\emph{Bloom filters} from single point queries to any interval length $L$. Setting the false positive rate to $\\varepsilon/L$ and performing $L$ queries, Bloom filters yield a solution to this problem with space $O(n \\lg(L/\\varepsilon))$ bits, false positive probability b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2907","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":"1407.2907","created_at":"2026-05-18T02:47:53.407038+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.2907v1","created_at":"2026-05-18T02:47:53.407038+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2907","created_at":"2026-05-18T02:47:53.407038+00:00"},{"alias_kind":"pith_short_12","alias_value":"OLGPYOCDZLF6","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"OLGPYOCDZLF6UGXA","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"OLGPYOCD","created_at":"2026-05-18T12:28:41.024544+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/OLGPYOCDZLF6UGXATWRBHSUVOE","json":"https://pith.science/pith/OLGPYOCDZLF6UGXATWRBHSUVOE.json","graph_json":"https://pith.science/api/pith-number/OLGPYOCDZLF6UGXATWRBHSUVOE/graph.json","events_json":"https://pith.science/api/pith-number/OLGPYOCDZLF6UGXATWRBHSUVOE/events.json","paper":"https://pith.science/paper/OLGPYOCD"},"agent_actions":{"view_html":"https://pith.science/pith/OLGPYOCDZLF6UGXATWRBHSUVOE","download_json":"https://pith.science/pith/OLGPYOCDZLF6UGXATWRBHSUVOE.json","view_paper":"https://pith.science/paper/OLGPYOCD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.2907&json=true","fetch_graph":"https://pith.science/api/pith-number/OLGPYOCDZLF6UGXATWRBHSUVOE/graph.json","fetch_events":"https://pith.science/api/pith-number/OLGPYOCDZLF6UGXATWRBHSUVOE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OLGPYOCDZLF6UGXATWRBHSUVOE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OLGPYOCDZLF6UGXATWRBHSUVOE/action/storage_attestation","attest_author":"https://pith.science/pith/OLGPYOCDZLF6UGXATWRBHSUVOE/action/author_attestation","sign_citation":"https://pith.science/pith/OLGPYOCDZLF6UGXATWRBHSUVOE/action/citation_signature","submit_replication":"https://pith.science/pith/OLGPYOCDZLF6UGXATWRBHSUVOE/action/replication_record"}},"created_at":"2026-05-18T02:47:53.407038+00:00","updated_at":"2026-05-18T02:47:53.407038+00:00"}