{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:VECJF4W3IZMYUGC6EAQHEA22YC","short_pith_number":"pith:VECJF4W3","canonical_record":{"source":{"id":"1402.4466","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-02-18T20:41:33Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"09d354d1da9c02271d5bf8336d23186a84004df1472b91ba325c9263264324f7","abstract_canon_sha256":"c640c3294b6249abab129d20bd50d8aa31f1c7ec69f358510a51e7b00732899c"},"schema_version":"1.0"},"canonical_sha256":"a90492f2db46598a185e202072035ac098e6810e150a99563c8afe689f719edb","source":{"kind":"arxiv","id":"1402.4466","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4466","created_at":"2026-05-18T01:23:12Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4466v3","created_at":"2026-05-18T01:23:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4466","created_at":"2026-05-18T01:23:12Z"},{"alias_kind":"pith_short_12","alias_value":"VECJF4W3IZMY","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"VECJF4W3IZMYUGC6","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"VECJF4W3","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:VECJF4W3IZMYUGC6EAQHEA22YC","target":"record","payload":{"canonical_record":{"source":{"id":"1402.4466","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-02-18T20:41:33Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"09d354d1da9c02271d5bf8336d23186a84004df1472b91ba325c9263264324f7","abstract_canon_sha256":"c640c3294b6249abab129d20bd50d8aa31f1c7ec69f358510a51e7b00732899c"},"schema_version":"1.0"},"canonical_sha256":"a90492f2db46598a185e202072035ac098e6810e150a99563c8afe689f719edb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:12.677574Z","signature_b64":"BopL8+efpHyfo8sIo4Xm39CGc5j3y3W9J7xh0eVS/9XtT/o/fnzt3V5XzU7hrxUo4l3b+IMZW56fgAYi5VQzDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a90492f2db46598a185e202072035ac098e6810e150a99563c8afe689f719edb","last_reissued_at":"2026-05-18T01:23:12.677060Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:12.677060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.4466","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:23:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"66CQk5vjgPp+S3OcuJtpONwueuY8l518bpWeb8VMz0qLP/KiCzn/mBWa9xvxIwtQoKsMUNFFGO57Rpq5oCm4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:00:29.802298Z"},"content_sha256":"ab0c383312363eb0bd720b82c62d03aee59e978556e0ff77b46da522f80f0f3e","schema_version":"1.0","event_id":"sha256:ab0c383312363eb0bd720b82c62d03aee59e978556e0ff77b46da522f80f0f3e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:VECJF4W3IZMYUGC6EAQHEA22YC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compressed bitmap indexes: beyond unions and intersections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"Daniel Lemire, Owen Kaser","submitted_at":"2014-02-18T20:41:33Z","abstract_excerpt":"Compressed bitmap indexes are used to speed up simple aggregate queries in databases. Indeed, set operations like intersections, unions and complements can be represented as logical operations (AND,OR,NOT) that are ideally suited for bitmaps. However, it is less obvious how to apply bitmaps to more advanced queries. For example, we might seek products in a store that meet some, but maybe not all, criteria. Such threshold queries generalize intersections and unions; they are often used in information-retrieval and data-mining applications. We introduce new algorithms that are sometimes three or"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4466","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:23:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7WsAbeCzT2J7lHmXIIqEoM06ebMHTbwHwMbfqB4Jq1jnXCfcIYAukQk07g9S9je0+lKqSqK3OLzjAGI7BJs9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:00:29.802981Z"},"content_sha256":"d0dfd1b498c5bc19c142cf25761ec12ce179da506f863299937a2ad7ed795ec1","schema_version":"1.0","event_id":"sha256:d0dfd1b498c5bc19c142cf25761ec12ce179da506f863299937a2ad7ed795ec1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VECJF4W3IZMYUGC6EAQHEA22YC/bundle.json","state_url":"https://pith.science/pith/VECJF4W3IZMYUGC6EAQHEA22YC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VECJF4W3IZMYUGC6EAQHEA22YC/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-27T01:00:29Z","links":{"resolver":"https://pith.science/pith/VECJF4W3IZMYUGC6EAQHEA22YC","bundle":"https://pith.science/pith/VECJF4W3IZMYUGC6EAQHEA22YC/bundle.json","state":"https://pith.science/pith/VECJF4W3IZMYUGC6EAQHEA22YC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VECJF4W3IZMYUGC6EAQHEA22YC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:VECJF4W3IZMYUGC6EAQHEA22YC","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":"c640c3294b6249abab129d20bd50d8aa31f1c7ec69f358510a51e7b00732899c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-02-18T20:41:33Z","title_canon_sha256":"09d354d1da9c02271d5bf8336d23186a84004df1472b91ba325c9263264324f7"},"schema_version":"1.0","source":{"id":"1402.4466","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4466","created_at":"2026-05-18T01:23:12Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4466v3","created_at":"2026-05-18T01:23:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4466","created_at":"2026-05-18T01:23:12Z"},{"alias_kind":"pith_short_12","alias_value":"VECJF4W3IZMY","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"VECJF4W3IZMYUGC6","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"VECJF4W3","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:d0dfd1b498c5bc19c142cf25761ec12ce179da506f863299937a2ad7ed795ec1","target":"graph","created_at":"2026-05-18T01:23:12Z","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":"Compressed bitmap indexes are used to speed up simple aggregate queries in databases. Indeed, set operations like intersections, unions and complements can be represented as logical operations (AND,OR,NOT) that are ideally suited for bitmaps. However, it is less obvious how to apply bitmaps to more advanced queries. For example, we might seek products in a store that meet some, but maybe not all, criteria. Such threshold queries generalize intersections and unions; they are often used in information-retrieval and data-mining applications. We introduce new algorithms that are sometimes three or","authors_text":"Daniel Lemire, Owen Kaser","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-02-18T20:41:33Z","title":"Compressed bitmap indexes: beyond unions and intersections"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4466","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:ab0c383312363eb0bd720b82c62d03aee59e978556e0ff77b46da522f80f0f3e","target":"record","created_at":"2026-05-18T01:23:12Z","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":"c640c3294b6249abab129d20bd50d8aa31f1c7ec69f358510a51e7b00732899c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-02-18T20:41:33Z","title_canon_sha256":"09d354d1da9c02271d5bf8336d23186a84004df1472b91ba325c9263264324f7"},"schema_version":"1.0","source":{"id":"1402.4466","kind":"arxiv","version":3}},"canonical_sha256":"a90492f2db46598a185e202072035ac098e6810e150a99563c8afe689f719edb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a90492f2db46598a185e202072035ac098e6810e150a99563c8afe689f719edb","first_computed_at":"2026-05-18T01:23:12.677060Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:12.677060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BopL8+efpHyfo8sIo4Xm39CGc5j3y3W9J7xh0eVS/9XtT/o/fnzt3V5XzU7hrxUo4l3b+IMZW56fgAYi5VQzDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:12.677574Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.4466","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab0c383312363eb0bd720b82c62d03aee59e978556e0ff77b46da522f80f0f3e","sha256:d0dfd1b498c5bc19c142cf25761ec12ce179da506f863299937a2ad7ed795ec1"],"state_sha256":"6de172ff86ae38a9e2d691b3ab14c48039dd5dab707bc56d460102e66996c287"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZvJNScZS+3DGnTsGz7WRgBv3jjFO05lfa28q2swltpXGCASjuHzG8i1wjY84BPsr1M/+8lRj0/8wBPHCNHzyAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:00:29.806392Z","bundle_sha256":"92154ddcd7e6c0059da5098635fdf160a32c2ea653ba1fe6cc099d9cee48603d"}}