{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EOYXROPTR4ZPYYTJ4WJW7WUQL2","short_pith_number":"pith:EOYXROPT","canonical_record":{"source":{"id":"1702.07578","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-24T13:43:20Z","cross_cats_sorted":[],"title_canon_sha256":"e3baae445f76e52e7de6ed08f9485bce4a792b27ab440f8981861cda6bc0f67a","abstract_canon_sha256":"83f5de1584f8fdf0ce7d96e843d066c9c8690816ccef61fe828f955da2fed383"},"schema_version":"1.0"},"canonical_sha256":"23b178b9f38f32fc6269e5936fda905e8f13a1829fa419a427343e6a89930217","source":{"kind":"arxiv","id":"1702.07578","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EOYXROPTR4ZPYYTJ4WJW7WUQL2","target":"record","payload":{"canonical_record":{"source":{"id":"1702.07578","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-24T13:43:20Z","cross_cats_sorted":[],"title_canon_sha256":"e3baae445f76e52e7de6ed08f9485bce4a792b27ab440f8981861cda6bc0f67a","abstract_canon_sha256":"83f5de1584f8fdf0ce7d96e843d066c9c8690816ccef61fe828f955da2fed383"},"schema_version":"1.0"},"canonical_sha256":"23b178b9f38f32fc6269e5936fda905e8f13a1829fa419a427343e6a89930217","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:55.211159Z","signature_b64":"rLzySvtPi+aFhhp/irL19J+iHUErenF/YzF4C/R5oJXkhNYixBYgbnx4vHkB0jEF/+FTIMS0c73nOOWl1Xf8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23b178b9f38f32fc6269e5936fda905e8f13a1829fa419a427343e6a89930217","last_reissued_at":"2026-05-18T00:30:55.210494Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:55.210494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.07578","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-18T00:30:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aN314FwOI2TGRPJo4XNoLaaI5PbN/KQ1dsSQfekI46dqkp4QSUPFhkkSSaKLWgfkB7uq1NNswf12zlKGTRcNBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:51:41.932583Z"},"content_sha256":"6e4a33f44e0924d271715b724301f0e91a5c710d3ad56301471ebee8e057b57e","schema_version":"1.0","event_id":"sha256:6e4a33f44e0924d271715b724301f0e91a5c710d3ad56301471ebee8e057b57e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EOYXROPTR4ZPYYTJ4WJW7WUQL2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simple, Fast and Lightweight Parallel Wavelet Tree Construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Florian Kurpicz, Johannes Fischer, Marvin L\\\"obel","submitted_at":"2017-02-24T13:43:20Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07578","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-18T00:30:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vP4OqGR/XYApCfoica8CUl9rYLvnJd0J/nlCPLxbHllOcknpnsQfKczz/Fn4ElcgWrqnebIjPRVvVuT7eAG5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:51:41.933384Z"},"content_sha256":"3ea2f84678ff1c8624f0ece25d7a9fb844d33a88e4c0f0165ea67c6db9633805","schema_version":"1.0","event_id":"sha256:3ea2f84678ff1c8624f0ece25d7a9fb844d33a88e4c0f0165ea67c6db9633805"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EOYXROPTR4ZPYYTJ4WJW7WUQL2/bundle.json","state_url":"https://pith.science/pith/EOYXROPTR4ZPYYTJ4WJW7WUQL2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EOYXROPTR4ZPYYTJ4WJW7WUQL2/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-30T03:51:41Z","links":{"resolver":"https://pith.science/pith/EOYXROPTR4ZPYYTJ4WJW7WUQL2","bundle":"https://pith.science/pith/EOYXROPTR4ZPYYTJ4WJW7WUQL2/bundle.json","state":"https://pith.science/pith/EOYXROPTR4ZPYYTJ4WJW7WUQL2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EOYXROPTR4ZPYYTJ4WJW7WUQL2/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tRq4tysFTQmxnua2hS4zRjDkfbOzlFzMdVSaeTfA5ken5tHPInGQlLrwaNGyujNAcq9jC4BnqptLT9DbH771CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T03:51:41.937445Z","bundle_sha256":"b7d8cd7ca5b0a4ec83cc5649825260a693fbaf780f7ce85aeab28cf7adfe94b8"}}