{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NE6IU45MQ3JTVDCBOIXCJPXZ6R","short_pith_number":"pith:NE6IU45M","schema_version":"1.0","canonical_sha256":"693c8a73ac86d33a8c41722e24bef9f455c0b91bc7708e2c74e6279ef38b5456","source":{"kind":"arxiv","id":"1711.01616","version":3},"attestation_state":"computed","paper":{"title":"Bloom Filters, Adaptivity, and the Dictionary Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Martin Farach-Colton, Mayank Goswami, Michael A. Bender, Rob Johnson, Samuel McCauley, Shikha Singh","submitted_at":"2017-11-05T17:10:40Z","abstract_excerpt":"The Bloom filter---or, more generally, an approximate membership query data structure (AMQ)---maintains a compact, probabilistic representation of a set S of keys from a universe U. An AMQ supports lookups, inserts, and (for some AMQs) deletes. A query for an x in S is guaranteed to return \"present.\" A query for x not in S returns \"absent\" with probability at least 1-epsilon, where epsilon is a tunable false positive probability. If a query returns \"present,\" but x is not in S, then x is a false positive of the AMQ. Because AMQs have a nonzero probability of false-positives, they require far l"},"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":"1711.01616","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-05T17:10:40Z","cross_cats_sorted":[],"title_canon_sha256":"83cea7beebdf967fd60e1cd9945f77fb5c42448a85de0d9660add9b72fa7698e","abstract_canon_sha256":"bee3b66bed2f21c2972d8431b3c7b0103774540d9bb19fab6e88aa3132bc9471"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:18.286612Z","signature_b64":"GwyXTiAIiHDPeSmPcwkI0l6nbj/v0GWzeEfw/XIs7MYhQ2aIT8kG2sfDvS2hCVC8UgUQ7PPxbxRfrkau9OkwDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"693c8a73ac86d33a8c41722e24bef9f455c0b91bc7708e2c74e6279ef38b5456","last_reissued_at":"2026-05-18T00:07:18.286027Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:18.286027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bloom Filters, Adaptivity, and the Dictionary Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Martin Farach-Colton, Mayank Goswami, Michael A. Bender, Rob Johnson, Samuel McCauley, Shikha Singh","submitted_at":"2017-11-05T17:10:40Z","abstract_excerpt":"The Bloom filter---or, more generally, an approximate membership query data structure (AMQ)---maintains a compact, probabilistic representation of a set S of keys from a universe U. An AMQ supports lookups, inserts, and (for some AMQs) deletes. A query for an x in S is guaranteed to return \"present.\" A query for x not in S returns \"absent\" with probability at least 1-epsilon, where epsilon is a tunable false positive probability. If a query returns \"present,\" but x is not in S, then x is a false positive of the AMQ. Because AMQs have a nonzero probability of false-positives, they require far l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01616","kind":"arxiv","version":3},"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":"1711.01616","created_at":"2026-05-18T00:07:18.286142+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.01616v3","created_at":"2026-05-18T00:07:18.286142+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01616","created_at":"2026-05-18T00:07:18.286142+00:00"},{"alias_kind":"pith_short_12","alias_value":"NE6IU45MQ3JT","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"NE6IU45MQ3JTVDCB","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"NE6IU45M","created_at":"2026-05-18T12:31:31.346846+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/NE6IU45MQ3JTVDCBOIXCJPXZ6R","json":"https://pith.science/pith/NE6IU45MQ3JTVDCBOIXCJPXZ6R.json","graph_json":"https://pith.science/api/pith-number/NE6IU45MQ3JTVDCBOIXCJPXZ6R/graph.json","events_json":"https://pith.science/api/pith-number/NE6IU45MQ3JTVDCBOIXCJPXZ6R/events.json","paper":"https://pith.science/paper/NE6IU45M"},"agent_actions":{"view_html":"https://pith.science/pith/NE6IU45MQ3JTVDCBOIXCJPXZ6R","download_json":"https://pith.science/pith/NE6IU45MQ3JTVDCBOIXCJPXZ6R.json","view_paper":"https://pith.science/paper/NE6IU45M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.01616&json=true","fetch_graph":"https://pith.science/api/pith-number/NE6IU45MQ3JTVDCBOIXCJPXZ6R/graph.json","fetch_events":"https://pith.science/api/pith-number/NE6IU45MQ3JTVDCBOIXCJPXZ6R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NE6IU45MQ3JTVDCBOIXCJPXZ6R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NE6IU45MQ3JTVDCBOIXCJPXZ6R/action/storage_attestation","attest_author":"https://pith.science/pith/NE6IU45MQ3JTVDCBOIXCJPXZ6R/action/author_attestation","sign_citation":"https://pith.science/pith/NE6IU45MQ3JTVDCBOIXCJPXZ6R/action/citation_signature","submit_replication":"https://pith.science/pith/NE6IU45MQ3JTVDCBOIXCJPXZ6R/action/replication_record"}},"created_at":"2026-05-18T00:07:18.286142+00:00","updated_at":"2026-05-18T00:07:18.286142+00:00"}