{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:RS5KSRNHF4Z6ER3NADD7VHPZYI","short_pith_number":"pith:RS5KSRNH","canonical_record":{"source":{"id":"1412.6862","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-22T03:00:38Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"584fc70aa6c731199eec80cfd5d4a9e95aa6daa50689e40a3a1a9ec85b610bd1","abstract_canon_sha256":"6d31997df96136f808fb6ff179c878d540411951637aa1dea3be905524c5b9fd"},"schema_version":"1.0"},"canonical_sha256":"8cbaa945a72f33e2476d00c7fa9df9c23ce91c801ce3b7fcf2d38cbbb8b86a12","source":{"kind":"arxiv","id":"1412.6862","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6862","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6862v1","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6862","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"pith_short_12","alias_value":"RS5KSRNHF4Z6","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RS5KSRNHF4Z6ER3N","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RS5KSRNH","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:RS5KSRNHF4Z6ER3NADD7VHPZYI","target":"record","payload":{"canonical_record":{"source":{"id":"1412.6862","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-22T03:00:38Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"584fc70aa6c731199eec80cfd5d4a9e95aa6daa50689e40a3a1a9ec85b610bd1","abstract_canon_sha256":"6d31997df96136f808fb6ff179c878d540411951637aa1dea3be905524c5b9fd"},"schema_version":"1.0"},"canonical_sha256":"8cbaa945a72f33e2476d00c7fa9df9c23ce91c801ce3b7fcf2d38cbbb8b86a12","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:46.077908Z","signature_b64":"YCdBx7AxQm5+EurqwawYBXjKK4f9JfuU+MC+KK6fePruwmnuKkEI6y6Gddx8wHdOW/NTmO0JTPIPSOL/cYVOAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cbaa945a72f33e2476d00c7fa9df9c23ce91c801ce3b7fcf2d38cbbb8b86a12","last_reissued_at":"2026-05-18T02:30:46.077482Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:46.077482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.6862","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-18T02:30:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h+zynBqZr3uJpPll017XUFb/cq/r5/aSwgvRUrkbJLrfw9wLf7Ggt1B7moc1JbTD5cmj7tlm3fvXpXp9oSZ0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:53:19.680400Z"},"content_sha256":"447dc467603996b956de228cf884182764b3bd79a9da4e06dbdf34397e991f46","schema_version":"1.0","event_id":"sha256:447dc467603996b956de228cf884182764b3bd79a9da4e06dbdf34397e991f46"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:RS5KSRNHF4Z6ER3NADD7VHPZYI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computationally Efficient Implementation of a Hamming Code Decoder using a Graphics Processing Unit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DC","authors_text":"Cheol-Hong Kim, Jong-Myon Kim, Shohidul Islam","submitted_at":"2014-12-22T03:00:38Z","abstract_excerpt":"This paper presents a computationally efficient implementation of a Hamming code decoder on a graphics processing unit (GPU) to support real-time software-defined radio (SDR), which is a software alternative for realizing wireless communication. The Hamming code algorithm is challenging to parallelize effectively on a GPU because it works on sparsely located data items with several conditional statements, leading to non-coalesced, long latency, global memory access, and huge thread divergence. To address these issues, we propose an optimized implementation of the Hamming code on the GPU to exp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6862","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-18T02:30:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6w8YOOK2BzReFjZ0FlQDEFLFT1Z5GXPuP60zV9pYSOn44WkhdfZLmqrtbCfWftlBQ3tP4nU3xPtxwSkog7+WCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:53:19.680726Z"},"content_sha256":"19053b9274f1ddb6673aaba741865334ef624f8d4e407cde674ba8d8a8662caa","schema_version":"1.0","event_id":"sha256:19053b9274f1ddb6673aaba741865334ef624f8d4e407cde674ba8d8a8662caa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RS5KSRNHF4Z6ER3NADD7VHPZYI/bundle.json","state_url":"https://pith.science/pith/RS5KSRNHF4Z6ER3NADD7VHPZYI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RS5KSRNHF4Z6ER3NADD7VHPZYI/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-27T03:53:19Z","links":{"resolver":"https://pith.science/pith/RS5KSRNHF4Z6ER3NADD7VHPZYI","bundle":"https://pith.science/pith/RS5KSRNHF4Z6ER3NADD7VHPZYI/bundle.json","state":"https://pith.science/pith/RS5KSRNHF4Z6ER3NADD7VHPZYI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RS5KSRNHF4Z6ER3NADD7VHPZYI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RS5KSRNHF4Z6ER3NADD7VHPZYI","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":"6d31997df96136f808fb6ff179c878d540411951637aa1dea3be905524c5b9fd","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-22T03:00:38Z","title_canon_sha256":"584fc70aa6c731199eec80cfd5d4a9e95aa6daa50689e40a3a1a9ec85b610bd1"},"schema_version":"1.0","source":{"id":"1412.6862","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6862","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6862v1","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6862","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"pith_short_12","alias_value":"RS5KSRNHF4Z6","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RS5KSRNHF4Z6ER3N","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RS5KSRNH","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:19053b9274f1ddb6673aaba741865334ef624f8d4e407cde674ba8d8a8662caa","target":"graph","created_at":"2026-05-18T02:30:46Z","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":"This paper presents a computationally efficient implementation of a Hamming code decoder on a graphics processing unit (GPU) to support real-time software-defined radio (SDR), which is a software alternative for realizing wireless communication. The Hamming code algorithm is challenging to parallelize effectively on a GPU because it works on sparsely located data items with several conditional statements, leading to non-coalesced, long latency, global memory access, and huge thread divergence. To address these issues, we propose an optimized implementation of the Hamming code on the GPU to exp","authors_text":"Cheol-Hong Kim, Jong-Myon Kim, Shohidul Islam","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-22T03:00:38Z","title":"Computationally Efficient Implementation of a Hamming Code Decoder using a Graphics Processing Unit"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6862","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:447dc467603996b956de228cf884182764b3bd79a9da4e06dbdf34397e991f46","target":"record","created_at":"2026-05-18T02:30:46Z","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":"6d31997df96136f808fb6ff179c878d540411951637aa1dea3be905524c5b9fd","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-22T03:00:38Z","title_canon_sha256":"584fc70aa6c731199eec80cfd5d4a9e95aa6daa50689e40a3a1a9ec85b610bd1"},"schema_version":"1.0","source":{"id":"1412.6862","kind":"arxiv","version":1}},"canonical_sha256":"8cbaa945a72f33e2476d00c7fa9df9c23ce91c801ce3b7fcf2d38cbbb8b86a12","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8cbaa945a72f33e2476d00c7fa9df9c23ce91c801ce3b7fcf2d38cbbb8b86a12","first_computed_at":"2026-05-18T02:30:46.077482Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:46.077482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YCdBx7AxQm5+EurqwawYBXjKK4f9JfuU+MC+KK6fePruwmnuKkEI6y6Gddx8wHdOW/NTmO0JTPIPSOL/cYVOAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:46.077908Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.6862","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:447dc467603996b956de228cf884182764b3bd79a9da4e06dbdf34397e991f46","sha256:19053b9274f1ddb6673aaba741865334ef624f8d4e407cde674ba8d8a8662caa"],"state_sha256":"eef3c647cc65305b72f54fb51d3eb047f20620dfc2414d1c25e2d794e4c72ba5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kIfcINjqmKNkLizzJjbmbXJBHk8l/FZS5slTby11IBuuh4xC8tGDtGVDwcqgS3SAkJUbJAsu25FNy0/OkPKVBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T03:53:19.682470Z","bundle_sha256":"78a5e1be38ba9bc532a81cca9f6870df4c3b29d0333437b98c6b6f5c8d1ea06b"}}