{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HDLVWXP4OMALGO66K6MYIJ2CCA","short_pith_number":"pith:HDLVWXP4","canonical_record":{"source":{"id":"1606.00519","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-02T02:07:24Z","cross_cats_sorted":[],"title_canon_sha256":"b901ec5c77c8376496c76dea0b00cb972ef473477f6edc075548374bbe536615","abstract_canon_sha256":"5cf75a52a95cb92cd24c5247d57784aa78b9b714e0eba6d734d94c8ff6f81892"},"schema_version":"1.0"},"canonical_sha256":"38d75b5dfc7300b33bde5799842742101df4d57367c9801e6bce8e5718dfd2e4","source":{"kind":"arxiv","id":"1606.00519","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00519","created_at":"2026-05-18T01:13:04Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00519v1","created_at":"2026-05-18T01:13:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00519","created_at":"2026-05-18T01:13:04Z"},{"alias_kind":"pith_short_12","alias_value":"HDLVWXP4OMAL","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HDLVWXP4OMALGO66","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HDLVWXP4","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HDLVWXP4OMALGO66K6MYIJ2CCA","target":"record","payload":{"canonical_record":{"source":{"id":"1606.00519","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-02T02:07:24Z","cross_cats_sorted":[],"title_canon_sha256":"b901ec5c77c8376496c76dea0b00cb972ef473477f6edc075548374bbe536615","abstract_canon_sha256":"5cf75a52a95cb92cd24c5247d57784aa78b9b714e0eba6d734d94c8ff6f81892"},"schema_version":"1.0"},"canonical_sha256":"38d75b5dfc7300b33bde5799842742101df4d57367c9801e6bce8e5718dfd2e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:04.240715Z","signature_b64":"Q9+sRqig/f7SlFOda36FP+6DSrMx77SqSjI10BBTNTI79DyEUMxST1l0Gp08Hs/hYO0RNwSAd4z5+6a1aqaUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38d75b5dfc7300b33bde5799842742101df4d57367c9801e6bce8e5718dfd2e4","last_reissued_at":"2026-05-18T01:13:04.240355Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:04.240355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.00519","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:13:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4zCHT1/G8oqWClifX2nEdvP21itr4XwKpgo7tVeZBxMkIQFeay4qs1JVsalCmAJ3si92ndkCk3cxKjsujwYsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T15:34:59.005595Z"},"content_sha256":"6a4191981432c0eb73e99e728c881898457995d62ca045eb3da7c858473cc79f","schema_version":"1.0","event_id":"sha256:6a4191981432c0eb73e99e728c881898457995d62ca045eb3da7c858473cc79f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HDLVWXP4OMALGO66K6MYIJ2CCA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Massively-Parallel Lossless Data Decompression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Evangelia Sitaridi, Guy Lohman, Kenneth Ross, Rene Mueller, Tim Kaldewey","submitted_at":"2016-06-02T02:07:24Z","abstract_excerpt":"Today's exponentially increasing data volumes and the high cost of storage make compression essential for the Big Data industry. Although research has concentrated on efficient compression, fast decompression is critical for analytics queries that repeatedly read compressed data. While decompression can be parallelized somewhat by assigning each data block to a different process, break-through speed-ups require exploiting the massive parallelism of modern multi-core processors and GPUs for data decompression within a block. We propose two new techniques to increase the degree of parallelism du"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00519","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:13:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tNtjSzSeV/Ly1BHc7cYW4YirsDTLzOc/EsEQx/GjRcoBMfU6BgGh5n9tTBWg5yx6z53fya5deoNDY/NM8lwLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T15:34:59.005953Z"},"content_sha256":"538cc72632a3bb28f5c0cf26ce5f3cb3fb9e994b28ef3c61e1350f55f8e90660","schema_version":"1.0","event_id":"sha256:538cc72632a3bb28f5c0cf26ce5f3cb3fb9e994b28ef3c61e1350f55f8e90660"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HDLVWXP4OMALGO66K6MYIJ2CCA/bundle.json","state_url":"https://pith.science/pith/HDLVWXP4OMALGO66K6MYIJ2CCA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HDLVWXP4OMALGO66K6MYIJ2CCA/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-06-24T15:34:59Z","links":{"resolver":"https://pith.science/pith/HDLVWXP4OMALGO66K6MYIJ2CCA","bundle":"https://pith.science/pith/HDLVWXP4OMALGO66K6MYIJ2CCA/bundle.json","state":"https://pith.science/pith/HDLVWXP4OMALGO66K6MYIJ2CCA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HDLVWXP4OMALGO66K6MYIJ2CCA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HDLVWXP4OMALGO66K6MYIJ2CCA","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":"5cf75a52a95cb92cd24c5247d57784aa78b9b714e0eba6d734d94c8ff6f81892","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-02T02:07:24Z","title_canon_sha256":"b901ec5c77c8376496c76dea0b00cb972ef473477f6edc075548374bbe536615"},"schema_version":"1.0","source":{"id":"1606.00519","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00519","created_at":"2026-05-18T01:13:04Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00519v1","created_at":"2026-05-18T01:13:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00519","created_at":"2026-05-18T01:13:04Z"},{"alias_kind":"pith_short_12","alias_value":"HDLVWXP4OMAL","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HDLVWXP4OMALGO66","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HDLVWXP4","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:538cc72632a3bb28f5c0cf26ce5f3cb3fb9e994b28ef3c61e1350f55f8e90660","target":"graph","created_at":"2026-05-18T01:13:04Z","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":"Today's exponentially increasing data volumes and the high cost of storage make compression essential for the Big Data industry. Although research has concentrated on efficient compression, fast decompression is critical for analytics queries that repeatedly read compressed data. While decompression can be parallelized somewhat by assigning each data block to a different process, break-through speed-ups require exploiting the massive parallelism of modern multi-core processors and GPUs for data decompression within a block. We propose two new techniques to increase the degree of parallelism du","authors_text":"Evangelia Sitaridi, Guy Lohman, Kenneth Ross, Rene Mueller, Tim Kaldewey","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-02T02:07:24Z","title":"Massively-Parallel Lossless Data Decompression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00519","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:6a4191981432c0eb73e99e728c881898457995d62ca045eb3da7c858473cc79f","target":"record","created_at":"2026-05-18T01:13:04Z","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":"5cf75a52a95cb92cd24c5247d57784aa78b9b714e0eba6d734d94c8ff6f81892","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-02T02:07:24Z","title_canon_sha256":"b901ec5c77c8376496c76dea0b00cb972ef473477f6edc075548374bbe536615"},"schema_version":"1.0","source":{"id":"1606.00519","kind":"arxiv","version":1}},"canonical_sha256":"38d75b5dfc7300b33bde5799842742101df4d57367c9801e6bce8e5718dfd2e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38d75b5dfc7300b33bde5799842742101df4d57367c9801e6bce8e5718dfd2e4","first_computed_at":"2026-05-18T01:13:04.240355Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:04.240355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q9+sRqig/f7SlFOda36FP+6DSrMx77SqSjI10BBTNTI79DyEUMxST1l0Gp08Hs/hYO0RNwSAd4z5+6a1aqaUCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:04.240715Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.00519","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a4191981432c0eb73e99e728c881898457995d62ca045eb3da7c858473cc79f","sha256:538cc72632a3bb28f5c0cf26ce5f3cb3fb9e994b28ef3c61e1350f55f8e90660"],"state_sha256":"079e94f8ffbd70bcde315b5b9453b0bca4ac6e095d31735117bcf4d11478d9e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NRENhx6P5u8SboU8iQ5XZiK6ueFGBqccKRkGYih8i2+C8Jln6QJ9gY9roFmmOXwuXP+CwsjJFeYB01IuSWmmCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T15:34:59.007961Z","bundle_sha256":"d20550b2d762662ce0d1000208640b5bc578e646c04ff1238004d6c961b9059c"}}