{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:FMRPTOWC7V64GWCEEZHXDYRXXO","short_pith_number":"pith:FMRPTOWC","canonical_record":{"source":{"id":"1011.4532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-19T22:00:50Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"1ca5fbcfa32c6774bd8e4190670ca681650e4b02f40734f165b94927b3ecd356","abstract_canon_sha256":"966ca6740e2fbc8cd2b9d94629efd95b2aaf0b75536869f3c3652d4a017b0764"},"schema_version":"1.0"},"canonical_sha256":"2b22f9bac2fd7dc35844264f71e237bb85d4da8c6671a336a35ca8b6afc968d0","source":{"kind":"arxiv","id":"1011.4532","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.4532","created_at":"2026-05-18T04:35:05Z"},{"alias_kind":"arxiv_version","alias_value":"1011.4532v1","created_at":"2026-05-18T04:35:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4532","created_at":"2026-05-18T04:35:05Z"},{"alias_kind":"pith_short_12","alias_value":"FMRPTOWC7V64","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"FMRPTOWC7V64GWCE","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"FMRPTOWC","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:FMRPTOWC7V64GWCEEZHXDYRXXO","target":"record","payload":{"canonical_record":{"source":{"id":"1011.4532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-19T22:00:50Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"1ca5fbcfa32c6774bd8e4190670ca681650e4b02f40734f165b94927b3ecd356","abstract_canon_sha256":"966ca6740e2fbc8cd2b9d94629efd95b2aaf0b75536869f3c3652d4a017b0764"},"schema_version":"1.0"},"canonical_sha256":"2b22f9bac2fd7dc35844264f71e237bb85d4da8c6671a336a35ca8b6afc968d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:35:05.931345Z","signature_b64":"eh9gM9aruRLrDpygNtVoq1X4N0Dynv1OjXHvylpz47lR25jWVYGZDsfnu77k5ImXPSpkWwhyYob3kOpC6s70CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b22f9bac2fd7dc35844264f71e237bb85d4da8c6671a336a35ca8b6afc968d0","last_reissued_at":"2026-05-18T04:35:05.930880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:35:05.930880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.4532","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-18T04:35:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uN4HJvAemfQhR9I16bpKQr7VZztGaX44XQZ1zzECTWDvq/Z80ua4qY5t0yOpBI9H8u6lk2DOc9FGzTp8I7LKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:58:34.849446Z"},"content_sha256":"f067799837e9b5cc499bdbc16c4a5040e7e9c59050fafbd564bacb8096c428e3","schema_version":"1.0","event_id":"sha256:f067799837e9b5cc499bdbc16c4a5040e7e9c59050fafbd564bacb8096c428e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:FMRPTOWC7V64GWCEEZHXDYRXXO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Algorithms on Wavelet Trees and Applications to Information Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DS","authors_text":"Gonzalo Navarro, Simon J. Puglisi, Travis Gagie","submitted_at":"2010-11-19T22:00:50Z","abstract_excerpt":"Wavelet trees are widely used in the representation of sequences, permutations, text collections, binary relations, discrete points, and other succinct data structures. We show, however, that this still falls short of exploiting all of the virtues of this versatile data structure. In particular we show how to use wavelet trees to solve fundamental algorithmic problems such as {\\em range quantile} queries, {\\em range next value} queries, and {\\em range intersection} queries. We explore several applications of these queries in Information Retrieval, in particular {\\em document retrieval} in hier"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.4532","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-18T04:35:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rJ5E55IMu09Vb9Td5CNzJndVzNiGFV2YlhUgBOefnUd6b8nysdEnSRa2J8xXX7teSxqYN5Yr6U8rSyJg8TmCDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:58:34.849935Z"},"content_sha256":"ea683ccf6bdd0d37d1de30dbd0d9074f466007018a8e19ed950ba3e116d9a089","schema_version":"1.0","event_id":"sha256:ea683ccf6bdd0d37d1de30dbd0d9074f466007018a8e19ed950ba3e116d9a089"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FMRPTOWC7V64GWCEEZHXDYRXXO/bundle.json","state_url":"https://pith.science/pith/FMRPTOWC7V64GWCEEZHXDYRXXO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FMRPTOWC7V64GWCEEZHXDYRXXO/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-26T21:58:34Z","links":{"resolver":"https://pith.science/pith/FMRPTOWC7V64GWCEEZHXDYRXXO","bundle":"https://pith.science/pith/FMRPTOWC7V64GWCEEZHXDYRXXO/bundle.json","state":"https://pith.science/pith/FMRPTOWC7V64GWCEEZHXDYRXXO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FMRPTOWC7V64GWCEEZHXDYRXXO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:FMRPTOWC7V64GWCEEZHXDYRXXO","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":"966ca6740e2fbc8cd2b9d94629efd95b2aaf0b75536869f3c3652d4a017b0764","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-19T22:00:50Z","title_canon_sha256":"1ca5fbcfa32c6774bd8e4190670ca681650e4b02f40734f165b94927b3ecd356"},"schema_version":"1.0","source":{"id":"1011.4532","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.4532","created_at":"2026-05-18T04:35:05Z"},{"alias_kind":"arxiv_version","alias_value":"1011.4532v1","created_at":"2026-05-18T04:35:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4532","created_at":"2026-05-18T04:35:05Z"},{"alias_kind":"pith_short_12","alias_value":"FMRPTOWC7V64","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"FMRPTOWC7V64GWCE","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"FMRPTOWC","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:ea683ccf6bdd0d37d1de30dbd0d9074f466007018a8e19ed950ba3e116d9a089","target":"graph","created_at":"2026-05-18T04:35:05Z","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":"Wavelet trees are widely used in the representation of sequences, permutations, text collections, binary relations, discrete points, and other succinct data structures. We show, however, that this still falls short of exploiting all of the virtues of this versatile data structure. In particular we show how to use wavelet trees to solve fundamental algorithmic problems such as {\\em range quantile} queries, {\\em range next value} queries, and {\\em range intersection} queries. We explore several applications of these queries in Information Retrieval, in particular {\\em document retrieval} in hier","authors_text":"Gonzalo Navarro, Simon J. Puglisi, Travis Gagie","cross_cats":["cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-19T22:00:50Z","title":"New Algorithms on Wavelet Trees and Applications to Information Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.4532","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:f067799837e9b5cc499bdbc16c4a5040e7e9c59050fafbd564bacb8096c428e3","target":"record","created_at":"2026-05-18T04:35:05Z","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":"966ca6740e2fbc8cd2b9d94629efd95b2aaf0b75536869f3c3652d4a017b0764","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-19T22:00:50Z","title_canon_sha256":"1ca5fbcfa32c6774bd8e4190670ca681650e4b02f40734f165b94927b3ecd356"},"schema_version":"1.0","source":{"id":"1011.4532","kind":"arxiv","version":1}},"canonical_sha256":"2b22f9bac2fd7dc35844264f71e237bb85d4da8c6671a336a35ca8b6afc968d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b22f9bac2fd7dc35844264f71e237bb85d4da8c6671a336a35ca8b6afc968d0","first_computed_at":"2026-05-18T04:35:05.930880Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:35:05.930880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eh9gM9aruRLrDpygNtVoq1X4N0Dynv1OjXHvylpz47lR25jWVYGZDsfnu77k5ImXPSpkWwhyYob3kOpC6s70CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:35:05.931345Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.4532","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f067799837e9b5cc499bdbc16c4a5040e7e9c59050fafbd564bacb8096c428e3","sha256:ea683ccf6bdd0d37d1de30dbd0d9074f466007018a8e19ed950ba3e116d9a089"],"state_sha256":"a963e518cfbc64033de167a88d0fdd223d690683249fddec6885ac06f09e2893"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LZ3XASL6Q4TmffqGZOaXCdopMpDsNRa3bOVx7eVpK0SlYTsNRg2NGhJk6kA+Bx2LL3JxWHErc7ucDNVdgKpMDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:58:34.852682Z","bundle_sha256":"d9a472beda180a64d70f0639fe31d30e3a8beb7b83a58031589df9f3df5906d8"}}