{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FKXERXXLWGABFR72DL57RYGCFZ","short_pith_number":"pith:FKXERXXL","canonical_record":{"source":{"id":"1610.05994","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-19T12:57:48Z","cross_cats_sorted":[],"title_canon_sha256":"8ae3f51009c94ee2a4ac49c01ed5e774a6b1574a63cdc6b8d1692f5697bb6c3b","abstract_canon_sha256":"3b3e7ddb18f54b2797a7162b9e8c1eafb2175cf2e134163ab1696748b1911d9c"},"schema_version":"1.0"},"canonical_sha256":"2aae48deebb18012c7fa1afbf8e0c22e5693e6e08eab0c0e811adf00a73f167c","source":{"kind":"arxiv","id":"1610.05994","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.05994","created_at":"2026-05-18T01:01:50Z"},{"alias_kind":"arxiv_version","alias_value":"1610.05994v1","created_at":"2026-05-18T01:01:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05994","created_at":"2026-05-18T01:01:50Z"},{"alias_kind":"pith_short_12","alias_value":"FKXERXXLWGAB","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FKXERXXLWGABFR72","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FKXERXXL","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FKXERXXLWGABFR72DL57RYGCFZ","target":"record","payload":{"canonical_record":{"source":{"id":"1610.05994","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-19T12:57:48Z","cross_cats_sorted":[],"title_canon_sha256":"8ae3f51009c94ee2a4ac49c01ed5e774a6b1574a63cdc6b8d1692f5697bb6c3b","abstract_canon_sha256":"3b3e7ddb18f54b2797a7162b9e8c1eafb2175cf2e134163ab1696748b1911d9c"},"schema_version":"1.0"},"canonical_sha256":"2aae48deebb18012c7fa1afbf8e0c22e5693e6e08eab0c0e811adf00a73f167c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:50.464134Z","signature_b64":"/tBXMvvqRJ+o9fQci6Ffgzk+hwlIPXsp1UOhzShU2Mt0z7bfr2mxAlBAyV+705EbCNj0loi6UDlNi9pkA3C1CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2aae48deebb18012c7fa1afbf8e0c22e5693e6e08eab0c0e811adf00a73f167c","last_reissued_at":"2026-05-18T01:01:50.463370Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:50.463370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.05994","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-18T01:01:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"heQ5AqlY4+j4cvlq9etw4UBPVv/qRIDlTo1TDPhJPAEkE4xWv+5bZBw4XxK1X06DxUGNbbVGs5me22h0BDOGBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:55:52.816689Z"},"content_sha256":"5fdecdb4288ff95e802598eba501cb5e3c4cf3af2af3ade7f467bf1a54afd0c5","schema_version":"1.0","event_id":"sha256:5fdecdb4288ff95e802598eba501cb5e3c4cf3af2af3ade7f467bf1a54afd0c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FKXERXXLWGABFR72DL57RYGCFZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Construction of Wavelet Trees on Multicore Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Diego Seco, Erick Elejalde, Jos\\'e Fuentes-Sep\\'ulveda, Leo Ferres","submitted_at":"2016-10-19T12:57:48Z","abstract_excerpt":"The wavelet tree has become a very useful data structure to efficiently represent and query large volumes of data in many different domains, from bioinformatics to geographic information systems. One problem with wavelet trees is their construction time. In this paper, we introduce two algorithms that reduce the time complexity of a wavelet tree's construction by taking advantage of nowadays ubiquitous multicore machines.\n  Our first algorithm constructs all the levels of the wavelet in parallel in $O(n)$ time and $O(n\\lg\\sigma + \\sigma\\lg n)$ bits of working space, where $n$ is the size of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05994","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-18T01:01:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b9JCtA5rR+rqVDMxbCQZU56rhTFpqGgklbZOdV8TGKt/ooIkYBuI7E5gpWL6N3egRgsO5j2OM5nP6Htk/OfOAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:55:52.817363Z"},"content_sha256":"165a31cb7f09b45dd5dd0850e670d31c13cb2dadd9b03771131e87c22c57d1cd","schema_version":"1.0","event_id":"sha256:165a31cb7f09b45dd5dd0850e670d31c13cb2dadd9b03771131e87c22c57d1cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FKXERXXLWGABFR72DL57RYGCFZ/bundle.json","state_url":"https://pith.science/pith/FKXERXXLWGABFR72DL57RYGCFZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FKXERXXLWGABFR72DL57RYGCFZ/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-27T10:55:52Z","links":{"resolver":"https://pith.science/pith/FKXERXXLWGABFR72DL57RYGCFZ","bundle":"https://pith.science/pith/FKXERXXLWGABFR72DL57RYGCFZ/bundle.json","state":"https://pith.science/pith/FKXERXXLWGABFR72DL57RYGCFZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FKXERXXLWGABFR72DL57RYGCFZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FKXERXXLWGABFR72DL57RYGCFZ","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":"3b3e7ddb18f54b2797a7162b9e8c1eafb2175cf2e134163ab1696748b1911d9c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-19T12:57:48Z","title_canon_sha256":"8ae3f51009c94ee2a4ac49c01ed5e774a6b1574a63cdc6b8d1692f5697bb6c3b"},"schema_version":"1.0","source":{"id":"1610.05994","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.05994","created_at":"2026-05-18T01:01:50Z"},{"alias_kind":"arxiv_version","alias_value":"1610.05994v1","created_at":"2026-05-18T01:01:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05994","created_at":"2026-05-18T01:01:50Z"},{"alias_kind":"pith_short_12","alias_value":"FKXERXXLWGAB","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FKXERXXLWGABFR72","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FKXERXXL","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:165a31cb7f09b45dd5dd0850e670d31c13cb2dadd9b03771131e87c22c57d1cd","target":"graph","created_at":"2026-05-18T01:01:50Z","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 has become a very useful data structure to efficiently represent and query large volumes of data in many different domains, from bioinformatics to geographic information systems. One problem with wavelet trees is their construction time. In this paper, we introduce two algorithms that reduce the time complexity of a wavelet tree's construction by taking advantage of nowadays ubiquitous multicore machines.\n  Our first algorithm constructs all the levels of the wavelet in parallel in $O(n)$ time and $O(n\\lg\\sigma + \\sigma\\lg n)$ bits of working space, where $n$ is the size of th","authors_text":"Diego Seco, Erick Elejalde, Jos\\'e Fuentes-Sep\\'ulveda, Leo Ferres","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-19T12:57:48Z","title":"Parallel Construction of Wavelet Trees on Multicore Architectures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05994","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:5fdecdb4288ff95e802598eba501cb5e3c4cf3af2af3ade7f467bf1a54afd0c5","target":"record","created_at":"2026-05-18T01:01:50Z","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":"3b3e7ddb18f54b2797a7162b9e8c1eafb2175cf2e134163ab1696748b1911d9c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-19T12:57:48Z","title_canon_sha256":"8ae3f51009c94ee2a4ac49c01ed5e774a6b1574a63cdc6b8d1692f5697bb6c3b"},"schema_version":"1.0","source":{"id":"1610.05994","kind":"arxiv","version":1}},"canonical_sha256":"2aae48deebb18012c7fa1afbf8e0c22e5693e6e08eab0c0e811adf00a73f167c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2aae48deebb18012c7fa1afbf8e0c22e5693e6e08eab0c0e811adf00a73f167c","first_computed_at":"2026-05-18T01:01:50.463370Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:50.463370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/tBXMvvqRJ+o9fQci6Ffgzk+hwlIPXsp1UOhzShU2Mt0z7bfr2mxAlBAyV+705EbCNj0loi6UDlNi9pkA3C1CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:50.464134Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.05994","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5fdecdb4288ff95e802598eba501cb5e3c4cf3af2af3ade7f467bf1a54afd0c5","sha256:165a31cb7f09b45dd5dd0850e670d31c13cb2dadd9b03771131e87c22c57d1cd"],"state_sha256":"e2545ed2c83fcdb82e7f973279c7099ab6513a9b29f9e939306603323e30cf8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GCPyx87Lmqc6dX96DkZcD9x91nlo+3wERNkJUJ6ObtkmWXOMffhmN0q1hOxmZMkFIzM0/d2SoqtQTCKdpwW0Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:55:52.820957Z","bundle_sha256":"f304845adceefa860bc3363a00052e0b40200e5edae8340a727de6526de128b5"}}