{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:54CPLQ6CADXQPN6Q3YTV2Z6JLS","short_pith_number":"pith:54CPLQ6C","canonical_record":{"source":{"id":"1405.1220","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-06T10:36:07Z","cross_cats_sorted":[],"title_canon_sha256":"5817dc08bf4266574e0887496feaeec5807383fa51756976e6bbec999a97c9aa","abstract_canon_sha256":"11ea6eee9225a753935aba4795a9e0ba7f3e6f48cba8703eda5ae1145984b6b9"},"schema_version":"1.0"},"canonical_sha256":"ef04f5c3c200ef07b7d0de275d67c95c8d9342f69db2aed75270d99dd5c7f0a6","source":{"kind":"arxiv","id":"1405.1220","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1220","created_at":"2026-05-18T02:52:33Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1220v1","created_at":"2026-05-18T02:52:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1220","created_at":"2026-05-18T02:52:33Z"},{"alias_kind":"pith_short_12","alias_value":"54CPLQ6CADXQ","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"54CPLQ6CADXQPN6Q","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"54CPLQ6C","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:54CPLQ6CADXQPN6Q3YTV2Z6JLS","target":"record","payload":{"canonical_record":{"source":{"id":"1405.1220","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-06T10:36:07Z","cross_cats_sorted":[],"title_canon_sha256":"5817dc08bf4266574e0887496feaeec5807383fa51756976e6bbec999a97c9aa","abstract_canon_sha256":"11ea6eee9225a753935aba4795a9e0ba7f3e6f48cba8703eda5ae1145984b6b9"},"schema_version":"1.0"},"canonical_sha256":"ef04f5c3c200ef07b7d0de275d67c95c8d9342f69db2aed75270d99dd5c7f0a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:33.264048Z","signature_b64":"0LxuYhQ+6g6hpF4Rf7eE/r499D8zw1jgnK/bu2982vzx4/J5+wh6mSPuZmPe458afalJs/o1SpxJcWffRMjKAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef04f5c3c200ef07b7d0de275d67c95c8d9342f69db2aed75270d99dd5c7f0a6","last_reissued_at":"2026-05-18T02:52:33.263468Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:33.263468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.1220","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-18T02:52:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L5GkxJ235j5rxBwyKrNCLqW+PyX+uSzaag50tcy8tmnL3xtXUWHls9/ilvKImJDPU0IPK25yC0l5U9C0n0LCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:29:18.981595Z"},"content_sha256":"134ac3721eb272d90942415b927e3fd95c3b6cd47e55583f0bb4721af2f24848","schema_version":"1.0","event_id":"sha256:134ac3721eb272d90942415b927e3fd95c3b6cd47e55583f0bb4721af2f24848"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:54CPLQ6CADXQPN6Q3YTV2Z6JLS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Compressed Wavelet Trees over Large Alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alberto Ord\\'o\\~nez, Francisco Claude, Gonzalo Navarro","submitted_at":"2014-05-06T10:36:07Z","abstract_excerpt":"The {\\em wavelet tree} is a flexible data structure that permits representing sequences $S[1,n]$ of symbols over an alphabet of size $\\sigma$, within compressed space and supporting a wide range of operations on $S$. When $\\sigma$ is significant compared to $n$, current wavelet tree representations incur in noticeable space or time overheads. In this article we introduce the {\\em wavelet matrix}, an alternative representation for large alphabets that retains all the properties of wavelet trees but is significantly faster. We also show how the wavelet matrix can be compressed up to the zero-ord"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1220","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-18T02:52:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"je8oKtLo6wolu0+dI4ApAn117Dj9DLeC0CzcNoUQOGMOYo1+cl+NhSyu3Kzp3v2eDHEGwLEDgE3lEaP7Q9axBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:29:18.982129Z"},"content_sha256":"42528d541ce4767705ceceb3db7b1ade21e69fd795c589f9b252b88af3b8d45f","schema_version":"1.0","event_id":"sha256:42528d541ce4767705ceceb3db7b1ade21e69fd795c589f9b252b88af3b8d45f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/54CPLQ6CADXQPN6Q3YTV2Z6JLS/bundle.json","state_url":"https://pith.science/pith/54CPLQ6CADXQPN6Q3YTV2Z6JLS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/54CPLQ6CADXQPN6Q3YTV2Z6JLS/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-31T15:29:18Z","links":{"resolver":"https://pith.science/pith/54CPLQ6CADXQPN6Q3YTV2Z6JLS","bundle":"https://pith.science/pith/54CPLQ6CADXQPN6Q3YTV2Z6JLS/bundle.json","state":"https://pith.science/pith/54CPLQ6CADXQPN6Q3YTV2Z6JLS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/54CPLQ6CADXQPN6Q3YTV2Z6JLS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:54CPLQ6CADXQPN6Q3YTV2Z6JLS","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":"11ea6eee9225a753935aba4795a9e0ba7f3e6f48cba8703eda5ae1145984b6b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-06T10:36:07Z","title_canon_sha256":"5817dc08bf4266574e0887496feaeec5807383fa51756976e6bbec999a97c9aa"},"schema_version":"1.0","source":{"id":"1405.1220","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1220","created_at":"2026-05-18T02:52:33Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1220v1","created_at":"2026-05-18T02:52:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1220","created_at":"2026-05-18T02:52:33Z"},{"alias_kind":"pith_short_12","alias_value":"54CPLQ6CADXQ","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"54CPLQ6CADXQPN6Q","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"54CPLQ6C","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:42528d541ce4767705ceceb3db7b1ade21e69fd795c589f9b252b88af3b8d45f","target":"graph","created_at":"2026-05-18T02:52:33Z","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":"The {\\em wavelet tree} is a flexible data structure that permits representing sequences $S[1,n]$ of symbols over an alphabet of size $\\sigma$, within compressed space and supporting a wide range of operations on $S$. When $\\sigma$ is significant compared to $n$, current wavelet tree representations incur in noticeable space or time overheads. In this article we introduce the {\\em wavelet matrix}, an alternative representation for large alphabets that retains all the properties of wavelet trees but is significantly faster. We also show how the wavelet matrix can be compressed up to the zero-ord","authors_text":"Alberto Ord\\'o\\~nez, Francisco Claude, Gonzalo Navarro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-06T10:36:07Z","title":"Efficient Compressed Wavelet Trees over Large Alphabets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1220","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:134ac3721eb272d90942415b927e3fd95c3b6cd47e55583f0bb4721af2f24848","target":"record","created_at":"2026-05-18T02:52:33Z","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":"11ea6eee9225a753935aba4795a9e0ba7f3e6f48cba8703eda5ae1145984b6b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-06T10:36:07Z","title_canon_sha256":"5817dc08bf4266574e0887496feaeec5807383fa51756976e6bbec999a97c9aa"},"schema_version":"1.0","source":{"id":"1405.1220","kind":"arxiv","version":1}},"canonical_sha256":"ef04f5c3c200ef07b7d0de275d67c95c8d9342f69db2aed75270d99dd5c7f0a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef04f5c3c200ef07b7d0de275d67c95c8d9342f69db2aed75270d99dd5c7f0a6","first_computed_at":"2026-05-18T02:52:33.263468Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:33.263468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0LxuYhQ+6g6hpF4Rf7eE/r499D8zw1jgnK/bu2982vzx4/J5+wh6mSPuZmPe458afalJs/o1SpxJcWffRMjKAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:33.264048Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.1220","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:134ac3721eb272d90942415b927e3fd95c3b6cd47e55583f0bb4721af2f24848","sha256:42528d541ce4767705ceceb3db7b1ade21e69fd795c589f9b252b88af3b8d45f"],"state_sha256":"201521acf63f5fb926f3af1157ccf162df66076fe9954d49116660f198ed8784"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bPPCSnC2Wmdzqr9c/Lr9KOD8CYqEiDXe1UIFmGrVC1QFzd9VHNhttwJe9i9xOilQocUhu9HDrLAjs58YPRTZAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T15:29:18.985604Z","bundle_sha256":"fa0967c6ec9345fda516748e30e53dc7f1f815c3f69c7849b15133c6a22e8419"}}