{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZG7T2YCUSXV6K2JGF2DU7BPKUT","short_pith_number":"pith:ZG7T2YCU","canonical_record":{"source":{"id":"1501.01941","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2015-01-08T20:04:46Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d267625294fea07879d01c4337c19a55d07ef839b225f2f408319352ca6c6353","abstract_canon_sha256":"c5c1c9e38a3865a27be6c07f09193e87ba2ba5a834850a443a6c18a4d71c8ab3"},"schema_version":"1.0"},"canonical_sha256":"c9bf3d605495ebe569262e874f85eaa4c22c8404f4852995cda4b8202aebde26","source":{"kind":"arxiv","id":"1501.01941","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.01941","created_at":"2026-05-18T01:04:09Z"},{"alias_kind":"arxiv_version","alias_value":"1501.01941v3","created_at":"2026-05-18T01:04:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01941","created_at":"2026-05-18T01:04:09Z"},{"alias_kind":"pith_short_12","alias_value":"ZG7T2YCUSXV6","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZG7T2YCUSXV6K2JG","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZG7T2YCU","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZG7T2YCUSXV6K2JGF2DU7BPKUT","target":"record","payload":{"canonical_record":{"source":{"id":"1501.01941","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2015-01-08T20:04:46Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d267625294fea07879d01c4337c19a55d07ef839b225f2f408319352ca6c6353","abstract_canon_sha256":"c5c1c9e38a3865a27be6c07f09193e87ba2ba5a834850a443a6c18a4d71c8ab3"},"schema_version":"1.0"},"canonical_sha256":"c9bf3d605495ebe569262e874f85eaa4c22c8404f4852995cda4b8202aebde26","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:09.527940Z","signature_b64":"F1da8SUXRm14QyU4ybt6fPZMasgPNREMgE1wj7DNYUITVzE0J73i5rs4P6AgIFYkKVt0TNlqxqwvp6m/pV04AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9bf3d605495ebe569262e874f85eaa4c22c8404f4852995cda4b8202aebde26","last_reissued_at":"2026-05-18T01:04:09.527293Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:09.527293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.01941","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-18T01:04:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5tgBAbU4LSNeYXMQJFXhsZcjZEwcusGcduIIpY9P2azx+fo0dG1FCLsr+FB1Pqxm79AYne/u0pbOtARtf9AeAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:08:06.740820Z"},"content_sha256":"95d47cdf2c33598f8675b25008d2e9b22f194f33923fce3031def31c14e17411","schema_version":"1.0","event_id":"sha256:95d47cdf2c33598f8675b25008d2e9b22f194f33923fce3031def31c14e17411"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZG7T2YCUSXV6K2JGF2DU7BPKUT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bloofi: Multidimensional Bloom Filters","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"Adina Crainiceanu, Daniel Lemire","submitted_at":"2015-01-08T20:04:46Z","abstract_excerpt":"Bloom filters are probabilistic data structures commonly used for approximate membership problems in many areas of Computer Science (networking, distributed systems, databases, etc.). With the increase in data size and distribution of data, problems arise where a large number of Bloom filters are available, and all them need to be searched for potential matches. As an example, in a federated cloud environment, each cloud provider could encode the information using Bloom filters and share the Bloom filters with a central coordinator. The problem of interest is not only whether a given element i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01941","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-18T01:04:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nOXFyMkncBA4OgZjCYbQmthziNrDHoeARz3MysOir5V0BICvCf1SoJ3W2F9FMdC650iIxgx42IPePchRWdyqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:08:06.741437Z"},"content_sha256":"608e5a0ac8365d7d20a161485ca6319917c72ae818d3aaa7837472e614beef38","schema_version":"1.0","event_id":"sha256:608e5a0ac8365d7d20a161485ca6319917c72ae818d3aaa7837472e614beef38"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZG7T2YCUSXV6K2JGF2DU7BPKUT/bundle.json","state_url":"https://pith.science/pith/ZG7T2YCUSXV6K2JGF2DU7BPKUT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZG7T2YCUSXV6K2JGF2DU7BPKUT/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-26T19:08:06Z","links":{"resolver":"https://pith.science/pith/ZG7T2YCUSXV6K2JGF2DU7BPKUT","bundle":"https://pith.science/pith/ZG7T2YCUSXV6K2JGF2DU7BPKUT/bundle.json","state":"https://pith.science/pith/ZG7T2YCUSXV6K2JGF2DU7BPKUT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZG7T2YCUSXV6K2JGF2DU7BPKUT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZG7T2YCUSXV6K2JGF2DU7BPKUT","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":"c5c1c9e38a3865a27be6c07f09193e87ba2ba5a834850a443a6c18a4d71c8ab3","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2015-01-08T20:04:46Z","title_canon_sha256":"d267625294fea07879d01c4337c19a55d07ef839b225f2f408319352ca6c6353"},"schema_version":"1.0","source":{"id":"1501.01941","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.01941","created_at":"2026-05-18T01:04:09Z"},{"alias_kind":"arxiv_version","alias_value":"1501.01941v3","created_at":"2026-05-18T01:04:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01941","created_at":"2026-05-18T01:04:09Z"},{"alias_kind":"pith_short_12","alias_value":"ZG7T2YCUSXV6","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZG7T2YCUSXV6K2JG","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZG7T2YCU","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:608e5a0ac8365d7d20a161485ca6319917c72ae818d3aaa7837472e614beef38","target":"graph","created_at":"2026-05-18T01:04: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":"Bloom filters are probabilistic data structures commonly used for approximate membership problems in many areas of Computer Science (networking, distributed systems, databases, etc.). With the increase in data size and distribution of data, problems arise where a large number of Bloom filters are available, and all them need to be searched for potential matches. As an example, in a federated cloud environment, each cloud provider could encode the information using Bloom filters and share the Bloom filters with a central coordinator. The problem of interest is not only whether a given element i","authors_text":"Adina Crainiceanu, Daniel Lemire","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2015-01-08T20:04:46Z","title":"Bloofi: Multidimensional Bloom Filters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01941","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:95d47cdf2c33598f8675b25008d2e9b22f194f33923fce3031def31c14e17411","target":"record","created_at":"2026-05-18T01:04: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":"c5c1c9e38a3865a27be6c07f09193e87ba2ba5a834850a443a6c18a4d71c8ab3","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2015-01-08T20:04:46Z","title_canon_sha256":"d267625294fea07879d01c4337c19a55d07ef839b225f2f408319352ca6c6353"},"schema_version":"1.0","source":{"id":"1501.01941","kind":"arxiv","version":3}},"canonical_sha256":"c9bf3d605495ebe569262e874f85eaa4c22c8404f4852995cda4b8202aebde26","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9bf3d605495ebe569262e874f85eaa4c22c8404f4852995cda4b8202aebde26","first_computed_at":"2026-05-18T01:04:09.527293Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:09.527293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F1da8SUXRm14QyU4ybt6fPZMasgPNREMgE1wj7DNYUITVzE0J73i5rs4P6AgIFYkKVt0TNlqxqwvp6m/pV04AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:09.527940Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.01941","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95d47cdf2c33598f8675b25008d2e9b22f194f33923fce3031def31c14e17411","sha256:608e5a0ac8365d7d20a161485ca6319917c72ae818d3aaa7837472e614beef38"],"state_sha256":"b63806509d716ae4ad31ca9e142788760f7ec315285021de7d9ecc7d8cf910ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KMwqlu8ZjYbhCUZwzm04vHS8664kUEyqoxcihiXTvKb55BfAJORvY5dNAP8JQG+6EE3nn7rmMdLykWJ36DSXAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:08:06.745032Z","bundle_sha256":"a88c7b604ddda9b80f7480bc054f0626b4ebe60bc448158ecb494fd978f69c24"}}