{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6QM7VJU2HSGQHR2PD47XRCEDS4","short_pith_number":"pith:6QM7VJU2","canonical_record":{"source":{"id":"1901.06493","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-19T09:53:29Z","cross_cats_sorted":[],"title_canon_sha256":"d224035ba3f0f269be55685999aada30b626f743c7f2f27523045c1b6d410862","abstract_canon_sha256":"fb2f05a59b48e6fe59528520be7190c9fad9b932c90aeeffc95b948692e783fd"},"schema_version":"1.0"},"canonical_sha256":"f419faa69a3c8d03c74f1f3f788883973054216cc4626c184683555ef06769a1","source":{"kind":"arxiv","id":"1901.06493","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.06493","created_at":"2026-05-17T23:55:50Z"},{"alias_kind":"arxiv_version","alias_value":"1901.06493v1","created_at":"2026-05-17T23:55:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06493","created_at":"2026-05-17T23:55:50Z"},{"alias_kind":"pith_short_12","alias_value":"6QM7VJU2HSGQ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6QM7VJU2HSGQHR2P","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6QM7VJU2","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6QM7VJU2HSGQHR2PD47XRCEDS4","target":"record","payload":{"canonical_record":{"source":{"id":"1901.06493","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-19T09:53:29Z","cross_cats_sorted":[],"title_canon_sha256":"d224035ba3f0f269be55685999aada30b626f743c7f2f27523045c1b6d410862","abstract_canon_sha256":"fb2f05a59b48e6fe59528520be7190c9fad9b932c90aeeffc95b948692e783fd"},"schema_version":"1.0"},"canonical_sha256":"f419faa69a3c8d03c74f1f3f788883973054216cc4626c184683555ef06769a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:50.095754Z","signature_b64":"PNsm5cdeqngCZdmKzcguE7Z035PYPXf2C2vU83cnQrSS8EYm6of9UsD6OXlxMg8XtmKAllMnm3Oz1Nkz4Xn/Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f419faa69a3c8d03c74f1f3f788883973054216cc4626c184683555ef06769a1","last_reissued_at":"2026-05-17T23:55:50.095136Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:50.095136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.06493","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:55:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iZocEiIbzB4kfdcCtLH/eU1KBVsdd6NOd/FskKzL60IKXzhfD1Q2BOMxJNHiTwOhBnuOinmnfjwJRc9f/qZHAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:30:48.674044Z"},"content_sha256":"bcc2be76b2ee1b36a68fee14569bfc08092493784787a3700f090011efed641e","schema_version":"1.0","event_id":"sha256:bcc2be76b2ee1b36a68fee14569bfc08092493784787a3700f090011efed641e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6QM7VJU2HSGQHR2PD47XRCEDS4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Partition Bloom Filters: A Bounded False Positive Solution For Dynamic Set Membership (Extended Abstract)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ameya Dubey, Amitabha Bagchi, Jeetu Raj, Manish Yadav, Nishant Yadav, Sidharth Negi","submitted_at":"2019-01-19T09:53:29Z","abstract_excerpt":"Dynamic Bloom filters (DBF) were proposed by Guo et. al. in 2010 to tackle the situation where the size of the set to be stored compactly is not known in advance or can change during the course of the application. We propose a novel competitor to DBF with the following important property that DBF is not able to achieve: our structure is able to maintain a bound on the false positive rate for the set membership query across all possible sizes of sets that are stored in it. The new data structure we propose is a dynamic structure that we call Dynamic Partition Bloom filter (DPBF). DPBF is based "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06493","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:55:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XfUCeYCgpCsTKIcZNLQkItNZgpSpj3yyhVbOTpr9ao8uc2faa22yA/XuIACMOL2Z7vRC5htp4C2Lf8svYuxuBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:30:48.674540Z"},"content_sha256":"ec5de91c47e8bd2df248dc1dcaf169d7a22b018bc16bae54375f28b2ede5f833","schema_version":"1.0","event_id":"sha256:ec5de91c47e8bd2df248dc1dcaf169d7a22b018bc16bae54375f28b2ede5f833"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6QM7VJU2HSGQHR2PD47XRCEDS4/bundle.json","state_url":"https://pith.science/pith/6QM7VJU2HSGQHR2PD47XRCEDS4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6QM7VJU2HSGQHR2PD47XRCEDS4/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-30T16:30:48Z","links":{"resolver":"https://pith.science/pith/6QM7VJU2HSGQHR2PD47XRCEDS4","bundle":"https://pith.science/pith/6QM7VJU2HSGQHR2PD47XRCEDS4/bundle.json","state":"https://pith.science/pith/6QM7VJU2HSGQHR2PD47XRCEDS4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6QM7VJU2HSGQHR2PD47XRCEDS4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6QM7VJU2HSGQHR2PD47XRCEDS4","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":"fb2f05a59b48e6fe59528520be7190c9fad9b932c90aeeffc95b948692e783fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-19T09:53:29Z","title_canon_sha256":"d224035ba3f0f269be55685999aada30b626f743c7f2f27523045c1b6d410862"},"schema_version":"1.0","source":{"id":"1901.06493","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.06493","created_at":"2026-05-17T23:55:50Z"},{"alias_kind":"arxiv_version","alias_value":"1901.06493v1","created_at":"2026-05-17T23:55:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06493","created_at":"2026-05-17T23:55:50Z"},{"alias_kind":"pith_short_12","alias_value":"6QM7VJU2HSGQ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6QM7VJU2HSGQHR2P","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6QM7VJU2","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:ec5de91c47e8bd2df248dc1dcaf169d7a22b018bc16bae54375f28b2ede5f833","target":"graph","created_at":"2026-05-17T23:55:50Z","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":"Dynamic Bloom filters (DBF) were proposed by Guo et. al. in 2010 to tackle the situation where the size of the set to be stored compactly is not known in advance or can change during the course of the application. We propose a novel competitor to DBF with the following important property that DBF is not able to achieve: our structure is able to maintain a bound on the false positive rate for the set membership query across all possible sizes of sets that are stored in it. The new data structure we propose is a dynamic structure that we call Dynamic Partition Bloom filter (DPBF). DPBF is based ","authors_text":"Ameya Dubey, Amitabha Bagchi, Jeetu Raj, Manish Yadav, Nishant Yadav, Sidharth Negi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-19T09:53:29Z","title":"Dynamic Partition Bloom Filters: A Bounded False Positive Solution For Dynamic Set Membership (Extended Abstract)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06493","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:bcc2be76b2ee1b36a68fee14569bfc08092493784787a3700f090011efed641e","target":"record","created_at":"2026-05-17T23:55:50Z","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":"fb2f05a59b48e6fe59528520be7190c9fad9b932c90aeeffc95b948692e783fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-19T09:53:29Z","title_canon_sha256":"d224035ba3f0f269be55685999aada30b626f743c7f2f27523045c1b6d410862"},"schema_version":"1.0","source":{"id":"1901.06493","kind":"arxiv","version":1}},"canonical_sha256":"f419faa69a3c8d03c74f1f3f788883973054216cc4626c184683555ef06769a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f419faa69a3c8d03c74f1f3f788883973054216cc4626c184683555ef06769a1","first_computed_at":"2026-05-17T23:55:50.095136Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:50.095136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PNsm5cdeqngCZdmKzcguE7Z035PYPXf2C2vU83cnQrSS8EYm6of9UsD6OXlxMg8XtmKAllMnm3Oz1Nkz4Xn/Dg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:50.095754Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.06493","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bcc2be76b2ee1b36a68fee14569bfc08092493784787a3700f090011efed641e","sha256:ec5de91c47e8bd2df248dc1dcaf169d7a22b018bc16bae54375f28b2ede5f833"],"state_sha256":"30fb8d22dcc993fbd9898d9b3732d0fa5aa6d3e680dd09dcb77943f23cb414c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eMrEBssw8L4q/PqOMw0Jq1sjHGKy3cZufHG1pTVmMzrdSD9oYi8l5DtQRgxt/9al5w4fhZD7yPPQigkkGjjpBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:30:48.677525Z","bundle_sha256":"4f181e26b155d86e1bf65c978739dc0195ff0411bd276544fcc78b9018fb945f"}}