{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MUFJG2EAWTPLZKD5RA6A6BG2MY","short_pith_number":"pith:MUFJG2EA","schema_version":"1.0","canonical_sha256":"650a936880b4debca87d883c0f04da662b6248105f9146783db3cf9b98dea571","source":{"kind":"arxiv","id":"1510.03019","version":3},"attestation_state":"computed","paper":{"title":"A Shifting Bloom Filter Framework for Set Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alex X. Liu, Gaogang Xie, Muhammad Shahzad, Qiaobin Fu, Tong Yang, Xiaoming Li, Yuankun Zhong, Zi Li","submitted_at":"2015-10-11T07:41:22Z","abstract_excerpt":"Set queries are fundamental operations in computer systems and applications.This paper addresses the fundamental problem of designing a probabilistic data structure that can quickly process set queries using a small amount of memory. We propose a Shifting Bloom Filter (ShBF) framework for representing and querying sets. We demonstrate the effectiveness of ShBF using three types of popular set queries: membership, association, and multiplicity queries. The key novelty of ShBF is on encoding the auxiliary information of a set element in a location offset. In contrast, prior BF based set data str"},"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":"1510.03019","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-11T07:41:22Z","cross_cats_sorted":[],"title_canon_sha256":"f2c994aed2953076b6e4dc8d2975361a9e56cd33197cb1053f62e8c0e164c983","abstract_canon_sha256":"ea4ae3c836ee0e5a69c3fc6999aa9d24d9d94e02da6769da349ff296e4116db7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:42.553621Z","signature_b64":"dXo0iiVGKajZG0tnE2xwBVCKMLdJPngaguO+XvCTW+N2YHiM5x0yN05DDWuneWhs1zh3F6v0Ry6JmV3BDYzCCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"650a936880b4debca87d883c0f04da662b6248105f9146783db3cf9b98dea571","last_reissued_at":"2026-05-18T01:18:42.553039Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:42.553039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Shifting Bloom Filter Framework for Set Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alex X. Liu, Gaogang Xie, Muhammad Shahzad, Qiaobin Fu, Tong Yang, Xiaoming Li, Yuankun Zhong, Zi Li","submitted_at":"2015-10-11T07:41:22Z","abstract_excerpt":"Set queries are fundamental operations in computer systems and applications.This paper addresses the fundamental problem of designing a probabilistic data structure that can quickly process set queries using a small amount of memory. We propose a Shifting Bloom Filter (ShBF) framework for representing and querying sets. We demonstrate the effectiveness of ShBF using three types of popular set queries: membership, association, and multiplicity queries. The key novelty of ShBF is on encoding the auxiliary information of a set element in a location offset. In contrast, prior BF based set data str"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03019","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1510.03019","created_at":"2026-05-18T01:18:42.553143+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.03019v3","created_at":"2026-05-18T01:18:42.553143+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03019","created_at":"2026-05-18T01:18:42.553143+00:00"},{"alias_kind":"pith_short_12","alias_value":"MUFJG2EAWTPL","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MUFJG2EAWTPLZKD5","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MUFJG2EA","created_at":"2026-05-18T12:29:32.376354+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/MUFJG2EAWTPLZKD5RA6A6BG2MY","json":"https://pith.science/pith/MUFJG2EAWTPLZKD5RA6A6BG2MY.json","graph_json":"https://pith.science/api/pith-number/MUFJG2EAWTPLZKD5RA6A6BG2MY/graph.json","events_json":"https://pith.science/api/pith-number/MUFJG2EAWTPLZKD5RA6A6BG2MY/events.json","paper":"https://pith.science/paper/MUFJG2EA"},"agent_actions":{"view_html":"https://pith.science/pith/MUFJG2EAWTPLZKD5RA6A6BG2MY","download_json":"https://pith.science/pith/MUFJG2EAWTPLZKD5RA6A6BG2MY.json","view_paper":"https://pith.science/paper/MUFJG2EA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.03019&json=true","fetch_graph":"https://pith.science/api/pith-number/MUFJG2EAWTPLZKD5RA6A6BG2MY/graph.json","fetch_events":"https://pith.science/api/pith-number/MUFJG2EAWTPLZKD5RA6A6BG2MY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MUFJG2EAWTPLZKD5RA6A6BG2MY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MUFJG2EAWTPLZKD5RA6A6BG2MY/action/storage_attestation","attest_author":"https://pith.science/pith/MUFJG2EAWTPLZKD5RA6A6BG2MY/action/author_attestation","sign_citation":"https://pith.science/pith/MUFJG2EAWTPLZKD5RA6A6BG2MY/action/citation_signature","submit_replication":"https://pith.science/pith/MUFJG2EAWTPLZKD5RA6A6BG2MY/action/replication_record"}},"created_at":"2026-05-18T01:18:42.553143+00:00","updated_at":"2026-05-18T01:18:42.553143+00:00"}