{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FEW6DVHNZR4HHH6J7BC4OS7U7M","short_pith_number":"pith:FEW6DVHN","schema_version":"1.0","canonical_sha256":"292de1d4edcc78739fc9f845c74bf4fb3bee7268043ac2b59a863dc5a9cae67b","source":{"kind":"arxiv","id":"1407.8142","version":7},"attestation_state":"computed","paper":{"title":"Parallel Wavelet Tree Construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Julian Shun","submitted_at":"2014-07-30T17:55:42Z","abstract_excerpt":"We present parallel algorithms for wavelet tree construction with polylogarithmic depth, improving upon the linear depth of the recent parallel algorithms by Fuentes-Sepulveda et al. We experimentally show on a 40-core machine with two-way hyper-threading that we outperform the existing parallel algorithms by 1.3--5.6x and achieve up to 27x speedup over the sequential algorithm on a variety of real-world and artificial inputs. Our algorithms show good scalability with increasing thread count, input size and alphabet size. We also discuss extensions to variants of the standard wavelet tree."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1407.8142","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-30T17:55:42Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"6adb01c95985c1e9e23d03baa993c4310407128644639219ce1123fc63bab0a4","abstract_canon_sha256":"6ac62de0db671e3393eccc17d0768e0edb81aa27470dea4b79760e509fc72bde"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:02.844967Z","signature_b64":"o4Y8txGEByQ+QmzWrMhf5rVLDIN66ZXqDdasOEQi6p2hnQ0lDgDu0FqV7JdRTgG971Ke4h/6hlDQBZ87yW6vDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"292de1d4edcc78739fc9f845c74bf4fb3bee7268043ac2b59a863dc5a9cae67b","last_reissued_at":"2026-05-18T00:59:02.844477Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:02.844477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Wavelet Tree Construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Julian Shun","submitted_at":"2014-07-30T17:55:42Z","abstract_excerpt":"We present parallel algorithms for wavelet tree construction with polylogarithmic depth, improving upon the linear depth of the recent parallel algorithms by Fuentes-Sepulveda et al. We experimentally show on a 40-core machine with two-way hyper-threading that we outperform the existing parallel algorithms by 1.3--5.6x and achieve up to 27x speedup over the sequential algorithm on a variety of real-world and artificial inputs. Our algorithms show good scalability with increasing thread count, input size and alphabet size. We also discuss extensions to variants of the standard wavelet tree."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.8142","kind":"arxiv","version":7},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.8142","created_at":"2026-05-18T00:59:02.844568+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.8142v7","created_at":"2026-05-18T00:59:02.844568+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.8142","created_at":"2026-05-18T00:59:02.844568+00:00"},{"alias_kind":"pith_short_12","alias_value":"FEW6DVHNZR4H","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FEW6DVHNZR4HHH6J","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FEW6DVHN","created_at":"2026-05-18T12:28:28.263976+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FEW6DVHNZR4HHH6J7BC4OS7U7M","json":"https://pith.science/pith/FEW6DVHNZR4HHH6J7BC4OS7U7M.json","graph_json":"https://pith.science/api/pith-number/FEW6DVHNZR4HHH6J7BC4OS7U7M/graph.json","events_json":"https://pith.science/api/pith-number/FEW6DVHNZR4HHH6J7BC4OS7U7M/events.json","paper":"https://pith.science/paper/FEW6DVHN"},"agent_actions":{"view_html":"https://pith.science/pith/FEW6DVHNZR4HHH6J7BC4OS7U7M","download_json":"https://pith.science/pith/FEW6DVHNZR4HHH6J7BC4OS7U7M.json","view_paper":"https://pith.science/paper/FEW6DVHN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.8142&json=true","fetch_graph":"https://pith.science/api/pith-number/FEW6DVHNZR4HHH6J7BC4OS7U7M/graph.json","fetch_events":"https://pith.science/api/pith-number/FEW6DVHNZR4HHH6J7BC4OS7U7M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FEW6DVHNZR4HHH6J7BC4OS7U7M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FEW6DVHNZR4HHH6J7BC4OS7U7M/action/storage_attestation","attest_author":"https://pith.science/pith/FEW6DVHNZR4HHH6J7BC4OS7U7M/action/author_attestation","sign_citation":"https://pith.science/pith/FEW6DVHNZR4HHH6J7BC4OS7U7M/action/citation_signature","submit_replication":"https://pith.science/pith/FEW6DVHNZR4HHH6J7BC4OS7U7M/action/replication_record"}},"created_at":"2026-05-18T00:59:02.844568+00:00","updated_at":"2026-05-18T00:59:02.844568+00:00"}