{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:36P3FAVN33ZMMQIHDYSTVEVBDA","short_pith_number":"pith:36P3FAVN","schema_version":"1.0","canonical_sha256":"df9fb282addef2c641071e253a92a11801dcde3531c0586d2459bcfb0114308b","source":{"kind":"arxiv","id":"2308.13632","version":1},"attestation_state":"computed","paper":{"title":"ChainedFilter: Combining Membership Filters by Chain Rule","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","math.IT"],"primary_cat":"cs.DB","authors_text":"Aditya Akella, Haoyu Li, Jianan Ji, Liuhui Wang, Qizhi Chen, Tong Yang, Yikai Zhao, Yuhan Wu","submitted_at":"2023-08-25T18:58:29Z","abstract_excerpt":"Membership (membership query / membership testing) is a fundamental problem across databases, networks and security. However, previous research has primarily focused on either approximate solutions, such as Bloom Filters, or exact methods, like perfect hashing and dictionaries, without attempting to develop a an integral theory. In this paper, we propose a unified and complete theory, namely chain rule, for general membership problems, which encompasses both approximate and exact membership as extreme cases. Building upon the chain rule, we introduce a straightforward yet versatile algorithm f"},"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":"2308.13632","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2023-08-25T18:58:29Z","cross_cats_sorted":["cs.DS","cs.IT","math.IT"],"title_canon_sha256":"93f9a52b63f8dd4f3df081865c67f2f04f6933ed942f1301e2e088dd2e99b2f6","abstract_canon_sha256":"ad9137faf0ea93f12d1dfd05101cf1d57b379e3473eeb9710a9593b8017f4c17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:44:53.170381Z","signature_b64":"OYbjgbkTSPUIskVjO0IZr6nSawEzqIrSPNZYtbGEgj1tR8Lu1HSmlAzrbkmXAZIbfrCGDDmpqdtdWnfFxMHWCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df9fb282addef2c641071e253a92a11801dcde3531c0586d2459bcfb0114308b","last_reissued_at":"2026-07-05T06:44:53.169975Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:44:53.169975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ChainedFilter: Combining Membership Filters by Chain Rule","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","math.IT"],"primary_cat":"cs.DB","authors_text":"Aditya Akella, Haoyu Li, Jianan Ji, Liuhui Wang, Qizhi Chen, Tong Yang, Yikai Zhao, Yuhan Wu","submitted_at":"2023-08-25T18:58:29Z","abstract_excerpt":"Membership (membership query / membership testing) is a fundamental problem across databases, networks and security. However, previous research has primarily focused on either approximate solutions, such as Bloom Filters, or exact methods, like perfect hashing and dictionaries, without attempting to develop a an integral theory. In this paper, we propose a unified and complete theory, namely chain rule, for general membership problems, which encompasses both approximate and exact membership as extreme cases. Building upon the chain rule, we introduce a straightforward yet versatile algorithm f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.13632","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.13632/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2308.13632","created_at":"2026-07-05T06:44:53.170030+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.13632v1","created_at":"2026-07-05T06:44:53.170030+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.13632","created_at":"2026-07-05T06:44:53.170030+00:00"},{"alias_kind":"pith_short_12","alias_value":"36P3FAVN33ZM","created_at":"2026-07-05T06:44:53.170030+00:00"},{"alias_kind":"pith_short_16","alias_value":"36P3FAVN33ZMMQIH","created_at":"2026-07-05T06:44:53.170030+00:00"},{"alias_kind":"pith_short_8","alias_value":"36P3FAVN","created_at":"2026-07-05T06:44:53.170030+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/36P3FAVN33ZMMQIHDYSTVEVBDA","json":"https://pith.science/pith/36P3FAVN33ZMMQIHDYSTVEVBDA.json","graph_json":"https://pith.science/api/pith-number/36P3FAVN33ZMMQIHDYSTVEVBDA/graph.json","events_json":"https://pith.science/api/pith-number/36P3FAVN33ZMMQIHDYSTVEVBDA/events.json","paper":"https://pith.science/paper/36P3FAVN"},"agent_actions":{"view_html":"https://pith.science/pith/36P3FAVN33ZMMQIHDYSTVEVBDA","download_json":"https://pith.science/pith/36P3FAVN33ZMMQIHDYSTVEVBDA.json","view_paper":"https://pith.science/paper/36P3FAVN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.13632&json=true","fetch_graph":"https://pith.science/api/pith-number/36P3FAVN33ZMMQIHDYSTVEVBDA/graph.json","fetch_events":"https://pith.science/api/pith-number/36P3FAVN33ZMMQIHDYSTVEVBDA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/36P3FAVN33ZMMQIHDYSTVEVBDA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/36P3FAVN33ZMMQIHDYSTVEVBDA/action/storage_attestation","attest_author":"https://pith.science/pith/36P3FAVN33ZMMQIHDYSTVEVBDA/action/author_attestation","sign_citation":"https://pith.science/pith/36P3FAVN33ZMMQIHDYSTVEVBDA/action/citation_signature","submit_replication":"https://pith.science/pith/36P3FAVN33ZMMQIHDYSTVEVBDA/action/replication_record"}},"created_at":"2026-07-05T06:44:53.170030+00:00","updated_at":"2026-07-05T06:44:53.170030+00:00"}