{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NE6IU45MQ3JTVDCBOIXCJPXZ6R","short_pith_number":"pith:NE6IU45M","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"},"canonical_sha256":"693c8a73ac86d33a8c41722e24bef9f455c0b91bc7708e2c74e6279ef38b5456","source":{"kind":"arxiv","id":"1711.01616","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01616","created_at":"2026-05-18T00:07:18Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01616v3","created_at":"2026-05-18T00:07:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01616","created_at":"2026-05-18T00:07:18Z"},{"alias_kind":"pith_short_12","alias_value":"NE6IU45MQ3JT","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NE6IU45MQ3JTVDCB","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NE6IU45M","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NE6IU45MQ3JTVDCBOIXCJPXZ6R","target":"record","payload":{"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"},"canonical_sha256":"693c8a73ac86d33a8c41722e24bef9f455c0b91bc7708e2c74e6279ef38b5456","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"},"source_kind":"arxiv","source_id":"1711.01616","source_version":3,"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:07:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VtkXu3KInGeJwbDlcsWMINigZm3vDSK+ifVWfEf6gZ0yXM7emk+AblJaoYvq7bJde5TehvYUcBKSlq0aEM2MAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:43:03.711937Z"},"content_sha256":"9f4a5a30fd789919226964a5f96b987cdce1119f0b591b947d12f390e198df5a","schema_version":"1.0","event_id":"sha256:9f4a5a30fd789919226964a5f96b987cdce1119f0b591b947d12f390e198df5a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NE6IU45MQ3JTVDCBOIXCJPXZ6R","target":"graph","payload":{"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"},"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:07:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yPlmazF2+Gtlme2L9SYxwMKBJ4nv57WhHnE5jIf+Puz75mfJ+7tWIGaEuoOW+Co5ZrecypnDTu2cgJukASkeBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:43:03.712634Z"},"content_sha256":"235b57de88031d71661026a4a83ef0d04b5ec4266d70f4139c6a4f19834b8ebb","schema_version":"1.0","event_id":"sha256:235b57de88031d71661026a4a83ef0d04b5ec4266d70f4139c6a4f19834b8ebb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NE6IU45MQ3JTVDCBOIXCJPXZ6R/bundle.json","state_url":"https://pith.science/pith/NE6IU45MQ3JTVDCBOIXCJPXZ6R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NE6IU45MQ3JTVDCBOIXCJPXZ6R/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-26T21:43:03Z","links":{"resolver":"https://pith.science/pith/NE6IU45MQ3JTVDCBOIXCJPXZ6R","bundle":"https://pith.science/pith/NE6IU45MQ3JTVDCBOIXCJPXZ6R/bundle.json","state":"https://pith.science/pith/NE6IU45MQ3JTVDCBOIXCJPXZ6R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NE6IU45MQ3JTVDCBOIXCJPXZ6R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NE6IU45MQ3JTVDCBOIXCJPXZ6R","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":"bee3b66bed2f21c2972d8431b3c7b0103774540d9bb19fab6e88aa3132bc9471","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-05T17:10:40Z","title_canon_sha256":"83cea7beebdf967fd60e1cd9945f77fb5c42448a85de0d9660add9b72fa7698e"},"schema_version":"1.0","source":{"id":"1711.01616","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01616","created_at":"2026-05-18T00:07:18Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01616v3","created_at":"2026-05-18T00:07:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01616","created_at":"2026-05-18T00:07:18Z"},{"alias_kind":"pith_short_12","alias_value":"NE6IU45MQ3JT","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NE6IU45MQ3JTVDCB","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NE6IU45M","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:235b57de88031d71661026a4a83ef0d04b5ec4266d70f4139c6a4f19834b8ebb","target":"graph","created_at":"2026-05-18T00:07: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":"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","authors_text":"Martin Farach-Colton, Mayank Goswami, Michael A. Bender, Rob Johnson, Samuel McCauley, Shikha Singh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-05T17:10:40Z","title":"Bloom Filters, Adaptivity, and the Dictionary Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01616","kind":"arxiv","version":3},"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:9f4a5a30fd789919226964a5f96b987cdce1119f0b591b947d12f390e198df5a","target":"record","created_at":"2026-05-18T00:07: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":"bee3b66bed2f21c2972d8431b3c7b0103774540d9bb19fab6e88aa3132bc9471","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-05T17:10:40Z","title_canon_sha256":"83cea7beebdf967fd60e1cd9945f77fb5c42448a85de0d9660add9b72fa7698e"},"schema_version":"1.0","source":{"id":"1711.01616","kind":"arxiv","version":3}},"canonical_sha256":"693c8a73ac86d33a8c41722e24bef9f455c0b91bc7708e2c74e6279ef38b5456","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"693c8a73ac86d33a8c41722e24bef9f455c0b91bc7708e2c74e6279ef38b5456","first_computed_at":"2026-05-18T00:07:18.286027Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:18.286027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GwyXTiAIiHDPeSmPcwkI0l6nbj/v0GWzeEfw/XIs7MYhQ2aIT8kG2sfDvS2hCVC8UgUQ7PPxbxRfrkau9OkwDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:18.286612Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.01616","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f4a5a30fd789919226964a5f96b987cdce1119f0b591b947d12f390e198df5a","sha256:235b57de88031d71661026a4a83ef0d04b5ec4266d70f4139c6a4f19834b8ebb"],"state_sha256":"4131edcc12a3915bb89318b0ffbd6d86544b5bddfef9a86f78ef2e0267f8064d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WIB6DgtvkacsgMnf/87VETL0RWMmK3eIqi7x7S/f7xRZKXsyMqrWrs8m4ecwJk/7MnHNApR9cLnug6haf1NzBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:43:03.716356Z","bundle_sha256":"09c1775c1919b8de89d250f4ce71ba458914a8448e7efdca07080836bed36740"}}