{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EOYXROPTR4ZPYYTJ4WJW7WUQL2","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":"83f5de1584f8fdf0ce7d96e843d066c9c8690816ccef61fe828f955da2fed383","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-24T13:43:20Z","title_canon_sha256":"e3baae445f76e52e7de6ed08f9485bce4a792b27ab440f8981861cda6bc0f67a"},"schema_version":"1.0","source":{"id":"1702.07578","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07578","created_at":"2026-05-18T00:30:55Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07578v3","created_at":"2026-05-18T00:30:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07578","created_at":"2026-05-18T00:30:55Z"},{"alias_kind":"pith_short_12","alias_value":"EOYXROPTR4ZP","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EOYXROPTR4ZPYYTJ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EOYXROPT","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:3ea2f84678ff1c8624f0ece25d7a9fb844d33a88e4c0f0165ea67c6db9633805","target":"graph","created_at":"2026-05-18T00:30:55Z","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 wavelet tree (Grossi et al. [SODA, 2003]) and wavelet matrix (Claude et al. [Inf. Syst., 47:15--32, 2015]) are compact indices for texts over an alphabet $[0,\\sigma)$ that support rank, select and access queries in $O(\\lg \\sigma)$ time. We first present new practical sequential and parallel algorithms for wavelet tree construction. Their unifying characteristics is that they construct the wavelet tree bottomup}, i.e., they compute the last level first. We also show that this bottom-up construction can easily be adapted to wavelet matrices. In practice, our best sequential algorithm is up t","authors_text":"Florian Kurpicz, Johannes Fischer, Marvin L\\\"obel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-24T13:43:20Z","title":"Simple, Fast and Lightweight Parallel Wavelet Tree Construction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07578","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:6e4a33f44e0924d271715b724301f0e91a5c710d3ad56301471ebee8e057b57e","target":"record","created_at":"2026-05-18T00:30:55Z","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":"83f5de1584f8fdf0ce7d96e843d066c9c8690816ccef61fe828f955da2fed383","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-24T13:43:20Z","title_canon_sha256":"e3baae445f76e52e7de6ed08f9485bce4a792b27ab440f8981861cda6bc0f67a"},"schema_version":"1.0","source":{"id":"1702.07578","kind":"arxiv","version":3}},"canonical_sha256":"23b178b9f38f32fc6269e5936fda905e8f13a1829fa419a427343e6a89930217","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23b178b9f38f32fc6269e5936fda905e8f13a1829fa419a427343e6a89930217","first_computed_at":"2026-05-18T00:30:55.210494Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:55.210494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rLzySvtPi+aFhhp/irL19J+iHUErenF/YzF4C/R5oJXkhNYixBYgbnx4vHkB0jEF/+FTIMS0c73nOOWl1Xf8Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:55.211159Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.07578","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e4a33f44e0924d271715b724301f0e91a5c710d3ad56301471ebee8e057b57e","sha256:3ea2f84678ff1c8624f0ece25d7a9fb844d33a88e4c0f0165ea67c6db9633805"],"state_sha256":"81d651ac2cf609ab0c79dc0c52ba9380a2215629e54ae493a7fd241be0b64e87"}