{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MUFJG2EAWTPLZKD5RA6A6BG2MY","short_pith_number":"pith:MUFJG2EA","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"},"canonical_sha256":"650a936880b4debca87d883c0f04da662b6248105f9146783db3cf9b98dea571","source":{"kind":"arxiv","id":"1510.03019","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03019","created_at":"2026-05-18T01:18:42Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03019v3","created_at":"2026-05-18T01:18:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03019","created_at":"2026-05-18T01:18:42Z"},{"alias_kind":"pith_short_12","alias_value":"MUFJG2EAWTPL","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MUFJG2EAWTPLZKD5","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MUFJG2EA","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MUFJG2EAWTPLZKD5RA6A6BG2MY","target":"record","payload":{"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"},"canonical_sha256":"650a936880b4debca87d883c0f04da662b6248105f9146783db3cf9b98dea571","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"},"source_kind":"arxiv","source_id":"1510.03019","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:18:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZzyPM9las8l8GT8/vSPcksFEySw173ISmz3mslaHdTf05opglEIfvFVU6YLnzVf2O9nvCaA74CiewauvrEV3Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:46:27.770736Z"},"content_sha256":"c157b6f1e8152e3080b7fa2b849346596ce49efbcd9e685017cb9881329ec1c9","schema_version":"1.0","event_id":"sha256:c157b6f1e8152e3080b7fa2b849346596ce49efbcd9e685017cb9881329ec1c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MUFJG2EAWTPLZKD5RA6A6BG2MY","target":"graph","payload":{"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"},"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:18:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KV2R6CVNwgFB5ep+dR7HE21p9pi+mz59Fvv5B67BWd/iUgKjdUpzPvH7oCMsJrq0NM+RLYqdpKc/yWSkq8aiAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:46:27.771499Z"},"content_sha256":"55866a3d4c4c720e1b90c0634336211382644c1fe377752ab5a9624d43891df4","schema_version":"1.0","event_id":"sha256:55866a3d4c4c720e1b90c0634336211382644c1fe377752ab5a9624d43891df4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MUFJG2EAWTPLZKD5RA6A6BG2MY/bundle.json","state_url":"https://pith.science/pith/MUFJG2EAWTPLZKD5RA6A6BG2MY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MUFJG2EAWTPLZKD5RA6A6BG2MY/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-09T08:46:27Z","links":{"resolver":"https://pith.science/pith/MUFJG2EAWTPLZKD5RA6A6BG2MY","bundle":"https://pith.science/pith/MUFJG2EAWTPLZKD5RA6A6BG2MY/bundle.json","state":"https://pith.science/pith/MUFJG2EAWTPLZKD5RA6A6BG2MY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MUFJG2EAWTPLZKD5RA6A6BG2MY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MUFJG2EAWTPLZKD5RA6A6BG2MY","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":"ea4ae3c836ee0e5a69c3fc6999aa9d24d9d94e02da6769da349ff296e4116db7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-11T07:41:22Z","title_canon_sha256":"f2c994aed2953076b6e4dc8d2975361a9e56cd33197cb1053f62e8c0e164c983"},"schema_version":"1.0","source":{"id":"1510.03019","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03019","created_at":"2026-05-18T01:18:42Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03019v3","created_at":"2026-05-18T01:18:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03019","created_at":"2026-05-18T01:18:42Z"},{"alias_kind":"pith_short_12","alias_value":"MUFJG2EAWTPL","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MUFJG2EAWTPLZKD5","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MUFJG2EA","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:55866a3d4c4c720e1b90c0634336211382644c1fe377752ab5a9624d43891df4","target":"graph","created_at":"2026-05-18T01:18:42Z","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":"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","authors_text":"Alex X. Liu, Gaogang Xie, Muhammad Shahzad, Qiaobin Fu, Tong Yang, Xiaoming Li, Yuankun Zhong, Zi Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-11T07:41:22Z","title":"A Shifting Bloom Filter Framework for Set Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03019","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:c157b6f1e8152e3080b7fa2b849346596ce49efbcd9e685017cb9881329ec1c9","target":"record","created_at":"2026-05-18T01:18:42Z","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":"ea4ae3c836ee0e5a69c3fc6999aa9d24d9d94e02da6769da349ff296e4116db7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-11T07:41:22Z","title_canon_sha256":"f2c994aed2953076b6e4dc8d2975361a9e56cd33197cb1053f62e8c0e164c983"},"schema_version":"1.0","source":{"id":"1510.03019","kind":"arxiv","version":3}},"canonical_sha256":"650a936880b4debca87d883c0f04da662b6248105f9146783db3cf9b98dea571","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"650a936880b4debca87d883c0f04da662b6248105f9146783db3cf9b98dea571","first_computed_at":"2026-05-18T01:18:42.553039Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:42.553039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dXo0iiVGKajZG0tnE2xwBVCKMLdJPngaguO+XvCTW+N2YHiM5x0yN05DDWuneWhs1zh3F6v0Ry6JmV3BDYzCCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:42.553621Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.03019","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c157b6f1e8152e3080b7fa2b849346596ce49efbcd9e685017cb9881329ec1c9","sha256:55866a3d4c4c720e1b90c0634336211382644c1fe377752ab5a9624d43891df4"],"state_sha256":"3cb245b1855b18d9b45729823c374a198060aaa39e695074731e6dbcc8b8884b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MQslKrS2P/Pe0DTxybr9Yb+X2tEpyM6hrnKA3mdTCD4RCnG09VlTosEaYD3DQvu6/vczHj+SfoAHI2LQ2QwQDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:46:27.775388Z","bundle_sha256":"cd18b76eb3e69681b4e75f7eaa104af3545e061135fea8fe47c8da63da6e2492"}}