{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SDUIZLJDU3DX2R7HVF63NCRGSE","short_pith_number":"pith:SDUIZLJD","canonical_record":{"source":{"id":"1903.12525","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-17T20:19:23Z","cross_cats_sorted":[],"title_canon_sha256":"00e1dbce4abd6a1a0a0f85b7bb5584876b7e285449f773cdda1943bca6010186","abstract_canon_sha256":"7cd1bdb6b2bade682d7b8a8475c2327f08d178051c8b3548cc95eaf5b8467a5c"},"schema_version":"1.0"},"canonical_sha256":"90e88cad23a6c77d47e7a97db68a269126c931c4f9e41cf7716e51921de96824","source":{"kind":"arxiv","id":"1903.12525","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.12525","created_at":"2026-05-17T23:49:53Z"},{"alias_kind":"arxiv_version","alias_value":"1903.12525v1","created_at":"2026-05-17T23:49:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.12525","created_at":"2026-05-17T23:49:53Z"},{"alias_kind":"pith_short_12","alias_value":"SDUIZLJDU3DX","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SDUIZLJDU3DX2R7H","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SDUIZLJD","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SDUIZLJDU3DX2R7HVF63NCRGSE","target":"record","payload":{"canonical_record":{"source":{"id":"1903.12525","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-17T20:19:23Z","cross_cats_sorted":[],"title_canon_sha256":"00e1dbce4abd6a1a0a0f85b7bb5584876b7e285449f773cdda1943bca6010186","abstract_canon_sha256":"7cd1bdb6b2bade682d7b8a8475c2327f08d178051c8b3548cc95eaf5b8467a5c"},"schema_version":"1.0"},"canonical_sha256":"90e88cad23a6c77d47e7a97db68a269126c931c4f9e41cf7716e51921de96824","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:53.786431Z","signature_b64":"vJIO0c53sAaBOQxqyryDpWCxe8bDzf9NR1MxA199trwt2ZtaLigUQsaM7pyyQrunOqBWjGrQc7OCjOytRNeCAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90e88cad23a6c77d47e7a97db68a269126c931c4f9e41cf7716e51921de96824","last_reissued_at":"2026-05-17T23:49:53.786006Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:53.786006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.12525","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:49:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kY6y3R+S3zBwJ26oD59mS+Q07fJZO25oNTd+UcwGhd7eoOgveb5+vwnj0gQ/MI0keqakXHAolXn9MYyCddKDAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T09:15:54.437687Z"},"content_sha256":"2f28784d87c3e9301013d8154d7d71c0c76223214722a563b353ae3d07ea2f7b","schema_version":"1.0","event_id":"sha256:2f28784d87c3e9301013d8154d7d71c0c76223214722a563b353ae3d07ea2f7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SDUIZLJDU3DX2R7HVF63NCRGSE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shed More Light on Bloom Filter's Variants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ripon Patgiri, Sabuzima Nayak, Samir Kumar Borgohain","submitted_at":"2019-03-17T20:19:23Z","abstract_excerpt":"Bloom Filter is a probabilistic membership data structure and it is excessively used data structure for membership query. Bloom Filter becomes the predominant data structure in approximate membership filtering. Bloom Filter extremely enhances the query response time, and the response time is very fast. Bloom filter (BF) is used to detect whether an element belongs to a given set or not. The Bloom Filter returns True Positive (TP), False Positive (FP), or True Negative (TN). The Bloom Filter is widely adapted in numerous areas to enhance the performance of a system. In this paper, we present a)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.12525","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:49:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uc2IHTNVmdSNMfz7/uCcctlbnjAyu7fAf3u0f8q3WGvPU3WfgD2XdyLbHf2Qvx6XruyU/GFPJajeLS8VOFZdDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T09:15:54.438031Z"},"content_sha256":"607b049a1f7dd77a5014ce1aa2a713c3bcae38d6e7574f720193031b96d47e58","schema_version":"1.0","event_id":"sha256:607b049a1f7dd77a5014ce1aa2a713c3bcae38d6e7574f720193031b96d47e58"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SDUIZLJDU3DX2R7HVF63NCRGSE/bundle.json","state_url":"https://pith.science/pith/SDUIZLJDU3DX2R7HVF63NCRGSE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SDUIZLJDU3DX2R7HVF63NCRGSE/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-06-24T09:15:54Z","links":{"resolver":"https://pith.science/pith/SDUIZLJDU3DX2R7HVF63NCRGSE","bundle":"https://pith.science/pith/SDUIZLJDU3DX2R7HVF63NCRGSE/bundle.json","state":"https://pith.science/pith/SDUIZLJDU3DX2R7HVF63NCRGSE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SDUIZLJDU3DX2R7HVF63NCRGSE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SDUIZLJDU3DX2R7HVF63NCRGSE","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":"7cd1bdb6b2bade682d7b8a8475c2327f08d178051c8b3548cc95eaf5b8467a5c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-17T20:19:23Z","title_canon_sha256":"00e1dbce4abd6a1a0a0f85b7bb5584876b7e285449f773cdda1943bca6010186"},"schema_version":"1.0","source":{"id":"1903.12525","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.12525","created_at":"2026-05-17T23:49:53Z"},{"alias_kind":"arxiv_version","alias_value":"1903.12525v1","created_at":"2026-05-17T23:49:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.12525","created_at":"2026-05-17T23:49:53Z"},{"alias_kind":"pith_short_12","alias_value":"SDUIZLJDU3DX","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SDUIZLJDU3DX2R7H","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SDUIZLJD","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:607b049a1f7dd77a5014ce1aa2a713c3bcae38d6e7574f720193031b96d47e58","target":"graph","created_at":"2026-05-17T23:49:53Z","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 Filter is a probabilistic membership data structure and it is excessively used data structure for membership query. Bloom Filter becomes the predominant data structure in approximate membership filtering. Bloom Filter extremely enhances the query response time, and the response time is very fast. Bloom filter (BF) is used to detect whether an element belongs to a given set or not. The Bloom Filter returns True Positive (TP), False Positive (FP), or True Negative (TN). The Bloom Filter is widely adapted in numerous areas to enhance the performance of a system. In this paper, we present a)","authors_text":"Ripon Patgiri, Sabuzima Nayak, Samir Kumar Borgohain","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-17T20:19:23Z","title":"Shed More Light on Bloom Filter's Variants"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.12525","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:2f28784d87c3e9301013d8154d7d71c0c76223214722a563b353ae3d07ea2f7b","target":"record","created_at":"2026-05-17T23:49:53Z","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":"7cd1bdb6b2bade682d7b8a8475c2327f08d178051c8b3548cc95eaf5b8467a5c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-17T20:19:23Z","title_canon_sha256":"00e1dbce4abd6a1a0a0f85b7bb5584876b7e285449f773cdda1943bca6010186"},"schema_version":"1.0","source":{"id":"1903.12525","kind":"arxiv","version":1}},"canonical_sha256":"90e88cad23a6c77d47e7a97db68a269126c931c4f9e41cf7716e51921de96824","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90e88cad23a6c77d47e7a97db68a269126c931c4f9e41cf7716e51921de96824","first_computed_at":"2026-05-17T23:49:53.786006Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:53.786006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vJIO0c53sAaBOQxqyryDpWCxe8bDzf9NR1MxA199trwt2ZtaLigUQsaM7pyyQrunOqBWjGrQc7OCjOytRNeCAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:53.786431Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.12525","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f28784d87c3e9301013d8154d7d71c0c76223214722a563b353ae3d07ea2f7b","sha256:607b049a1f7dd77a5014ce1aa2a713c3bcae38d6e7574f720193031b96d47e58"],"state_sha256":"85a86094d269ad3958d2ae2332e6d9ce68b6955091f751152c68d52e85861c5f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"APumUvbUEywbberN4CAU97DRVNSbPJI2d05cGKyvdRFsT5rpJGDobB5ES5I+/kggNLMSpllYcPHgAF0/hOnEBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T09:15:54.440299Z","bundle_sha256":"d0b13739d9bd63372bc15b8e345f09404d16e798e0c21a3ca33f3c0c6a75f979"}}