{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RS5KSRNHF4Z6ER3NADD7VHPZYI","short_pith_number":"pith:RS5KSRNH","schema_version":"1.0","canonical_sha256":"8cbaa945a72f33e2476d00c7fa9df9c23ce91c801ce3b7fcf2d38cbbb8b86a12","source":{"kind":"arxiv","id":"1412.6862","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.6862","created_at":"2026-05-18T02:30:46.077545+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.6862v1","created_at":"2026-05-18T02:30:46.077545+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6862","created_at":"2026-05-18T02:30:46.077545+00:00"},{"alias_kind":"pith_short_12","alias_value":"RS5KSRNHF4Z6","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RS5KSRNHF4Z6ER3N","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RS5KSRNH","created_at":"2026-05-18T12:28:46.137349+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/RS5KSRNHF4Z6ER3NADD7VHPZYI","json":"https://pith.science/pith/RS5KSRNHF4Z6ER3NADD7VHPZYI.json","graph_json":"https://pith.science/api/pith-number/RS5KSRNHF4Z6ER3NADD7VHPZYI/graph.json","events_json":"https://pith.science/api/pith-number/RS5KSRNHF4Z6ER3NADD7VHPZYI/events.json","paper":"https://pith.science/paper/RS5KSRNH"},"agent_actions":{"view_html":"https://pith.science/pith/RS5KSRNHF4Z6ER3NADD7VHPZYI","download_json":"https://pith.science/pith/RS5KSRNHF4Z6ER3NADD7VHPZYI.json","view_paper":"https://pith.science/paper/RS5KSRNH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.6862&json=true","fetch_graph":"https://pith.science/api/pith-number/RS5KSRNHF4Z6ER3NADD7VHPZYI/graph.json","fetch_events":"https://pith.science/api/pith-number/RS5KSRNHF4Z6ER3NADD7VHPZYI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RS5KSRNHF4Z6ER3NADD7VHPZYI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RS5KSRNHF4Z6ER3NADD7VHPZYI/action/storage_attestation","attest_author":"https://pith.science/pith/RS5KSRNHF4Z6ER3NADD7VHPZYI/action/author_attestation","sign_citation":"https://pith.science/pith/RS5KSRNHF4Z6ER3NADD7VHPZYI/action/citation_signature","submit_replication":"https://pith.science/pith/RS5KSRNHF4Z6ER3NADD7VHPZYI/action/replication_record"}},"created_at":"2026-05-18T02:30:46.077545+00:00","updated_at":"2026-05-18T02:30:46.077545+00:00"}