{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DAGNHOTJICXFCRGVRX5QI4IYBJ","short_pith_number":"pith:DAGNHOTJ","canonical_record":{"source":{"id":"1809.05419","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-14T13:45:27Z","cross_cats_sorted":[],"title_canon_sha256":"ef0f0fd45a22638e125a33efe33c5dbe11c5a9e861a3386ac88387d0a7edabad","abstract_canon_sha256":"ae028eacccf6cd53349ba5b36a11989fd5cb714cdb1d8b5f2cb28292ea04ac33"},"schema_version":"1.0"},"canonical_sha256":"180cd3ba6940ae5144d58dfb0471180a725e7365974cb63afaa937d2f46f836e","source":{"kind":"arxiv","id":"1809.05419","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05419","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05419v1","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05419","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"pith_short_12","alias_value":"DAGNHOTJICXF","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DAGNHOTJICXFCRGV","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DAGNHOTJ","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DAGNHOTJICXFCRGVRX5QI4IYBJ","target":"record","payload":{"canonical_record":{"source":{"id":"1809.05419","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-14T13:45:27Z","cross_cats_sorted":[],"title_canon_sha256":"ef0f0fd45a22638e125a33efe33c5dbe11c5a9e861a3386ac88387d0a7edabad","abstract_canon_sha256":"ae028eacccf6cd53349ba5b36a11989fd5cb714cdb1d8b5f2cb28292ea04ac33"},"schema_version":"1.0"},"canonical_sha256":"180cd3ba6940ae5144d58dfb0471180a725e7365974cb63afaa937d2f46f836e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:41.502246Z","signature_b64":"CTfUeWWULHBuBoZowXJpewGDFD3g01YR4JdH6XmAcea5F50F6h8LgIqQ1vqV/UjM9PLD+TAHCSyUR6xuZRKRBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"180cd3ba6940ae5144d58dfb0471180a725e7365974cb63afaa937d2f46f836e","last_reissued_at":"2026-05-18T00:05:41.501582Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:41.501582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.05419","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-18T00:05:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x14CgiAi98jtiQMPVow0TK+nJjwTwVr2xz5OrXtq7VRLgkxqQcFLCZlXfKtQ+c/7mFVJZKCiXvLUvngvxGA9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:07:31.398036Z"},"content_sha256":"64b19339a9c4161ac1c5141520fc61c3c846507a2260ff4828a958f5c46fc74f","schema_version":"1.0","event_id":"sha256:64b19339a9c4161ac1c5141520fc61c3c846507a2260ff4828a958f5c46fc74f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DAGNHOTJICXFCRGVRX5QI4IYBJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Query Processing over Static Sets and Sliding Windows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ran Ben Basat, Seungbum Jo, Shubham Ugare, Srinivasa Rao Satti","submitted_at":"2018-09-14T13:45:27Z","abstract_excerpt":"Indexing of static and dynamic sets is fundamental to a large set of applications such as information retrieval and caching. Denoting the characteristic vector of the set by B, we consider the problem of encoding sets and multisets to support approximate versions of the operations rank(i) (i.e., computing sum_{j <= i}B[j]) and select(i) (i.e., finding min{p | rank(p) >= i}) queries. We study multiple types of approximations (allowing an error in the query or the result) and present lower bounds and succinct data structures for several variants of the problem. We also extend our model to slidin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05419","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-18T00:05:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ti9I35rpOjcCl75Lz+AGJ3jMznYOhf/nYIDV9HeLWBZxlhEnCfdLjvKPnufenyT+qg7Ur0f7c+RVQ0QL71UXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:07:31.398718Z"},"content_sha256":"97d6020edf2e6dc9a5ae4bc3e9826c924f8c0ffbd07d89a352cdb875b8cc12e4","schema_version":"1.0","event_id":"sha256:97d6020edf2e6dc9a5ae4bc3e9826c924f8c0ffbd07d89a352cdb875b8cc12e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DAGNHOTJICXFCRGVRX5QI4IYBJ/bundle.json","state_url":"https://pith.science/pith/DAGNHOTJICXFCRGVRX5QI4IYBJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DAGNHOTJICXFCRGVRX5QI4IYBJ/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-26T19:07:31Z","links":{"resolver":"https://pith.science/pith/DAGNHOTJICXFCRGVRX5QI4IYBJ","bundle":"https://pith.science/pith/DAGNHOTJICXFCRGVRX5QI4IYBJ/bundle.json","state":"https://pith.science/pith/DAGNHOTJICXFCRGVRX5QI4IYBJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DAGNHOTJICXFCRGVRX5QI4IYBJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DAGNHOTJICXFCRGVRX5QI4IYBJ","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":"ae028eacccf6cd53349ba5b36a11989fd5cb714cdb1d8b5f2cb28292ea04ac33","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-14T13:45:27Z","title_canon_sha256":"ef0f0fd45a22638e125a33efe33c5dbe11c5a9e861a3386ac88387d0a7edabad"},"schema_version":"1.0","source":{"id":"1809.05419","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05419","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05419v1","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05419","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"pith_short_12","alias_value":"DAGNHOTJICXF","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DAGNHOTJICXFCRGV","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DAGNHOTJ","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:97d6020edf2e6dc9a5ae4bc3e9826c924f8c0ffbd07d89a352cdb875b8cc12e4","target":"graph","created_at":"2026-05-18T00:05:41Z","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":"Indexing of static and dynamic sets is fundamental to a large set of applications such as information retrieval and caching. Denoting the characteristic vector of the set by B, we consider the problem of encoding sets and multisets to support approximate versions of the operations rank(i) (i.e., computing sum_{j <= i}B[j]) and select(i) (i.e., finding min{p | rank(p) >= i}) queries. We study multiple types of approximations (allowing an error in the query or the result) and present lower bounds and succinct data structures for several variants of the problem. We also extend our model to slidin","authors_text":"Ran Ben Basat, Seungbum Jo, Shubham Ugare, Srinivasa Rao Satti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-14T13:45:27Z","title":"Approximate Query Processing over Static Sets and Sliding Windows"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05419","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:64b19339a9c4161ac1c5141520fc61c3c846507a2260ff4828a958f5c46fc74f","target":"record","created_at":"2026-05-18T00:05:41Z","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":"ae028eacccf6cd53349ba5b36a11989fd5cb714cdb1d8b5f2cb28292ea04ac33","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-14T13:45:27Z","title_canon_sha256":"ef0f0fd45a22638e125a33efe33c5dbe11c5a9e861a3386ac88387d0a7edabad"},"schema_version":"1.0","source":{"id":"1809.05419","kind":"arxiv","version":1}},"canonical_sha256":"180cd3ba6940ae5144d58dfb0471180a725e7365974cb63afaa937d2f46f836e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"180cd3ba6940ae5144d58dfb0471180a725e7365974cb63afaa937d2f46f836e","first_computed_at":"2026-05-18T00:05:41.501582Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:41.501582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CTfUeWWULHBuBoZowXJpewGDFD3g01YR4JdH6XmAcea5F50F6h8LgIqQ1vqV/UjM9PLD+TAHCSyUR6xuZRKRBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:41.502246Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.05419","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64b19339a9c4161ac1c5141520fc61c3c846507a2260ff4828a958f5c46fc74f","sha256:97d6020edf2e6dc9a5ae4bc3e9826c924f8c0ffbd07d89a352cdb875b8cc12e4"],"state_sha256":"ae394df6480bc95b324f7de274632789cc61ccb4189048eb0a5c3e5fc9e4b405"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1V1raTjcWdCJg5a3hH96Xpwf/FoPhdrzuR1n8F20tnNb7O1FOdSUsk1UxdXkISswNxsDzonbALixBIvNezkuDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:07:31.402387Z","bundle_sha256":"baa7d2f058a8ce49dfcd6ed2ca6bec83c93739933b17edf8f8622e028e3a3a82"}}