{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:463VVVKXALUF4IQKGQ3G4XHHPJ","short_pith_number":"pith:463VVVKX","canonical_record":{"source":{"id":"1204.0334","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-02T07:48:02Z","cross_cats_sorted":["cs.DC","math.IT"],"title_canon_sha256":"34bf5e294e36f0581e494006fa3812bae9aa9f0a2ce6b359c5d66ac9f285cac0","abstract_canon_sha256":"6021ea1ccfcadc03c47dfe7762af6c22c55581d67fe905397c685608df3c680f"},"schema_version":"1.0"},"canonical_sha256":"e7b75ad55702e85e220a34366e5ce77a7967fe588ece855a43e9052a54bfc099","source":{"kind":"arxiv","id":"1204.0334","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.0334","created_at":"2026-05-18T03:49:59Z"},{"alias_kind":"arxiv_version","alias_value":"1204.0334v2","created_at":"2026-05-18T03:49:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0334","created_at":"2026-05-18T03:49:59Z"},{"alias_kind":"pith_short_12","alias_value":"463VVVKXALUF","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"463VVVKXALUF4IQK","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"463VVVKX","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:463VVVKXALUF4IQKGQ3G4XHHPJ","target":"record","payload":{"canonical_record":{"source":{"id":"1204.0334","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-02T07:48:02Z","cross_cats_sorted":["cs.DC","math.IT"],"title_canon_sha256":"34bf5e294e36f0581e494006fa3812bae9aa9f0a2ce6b359c5d66ac9f285cac0","abstract_canon_sha256":"6021ea1ccfcadc03c47dfe7762af6c22c55581d67fe905397c685608df3c680f"},"schema_version":"1.0"},"canonical_sha256":"e7b75ad55702e85e220a34366e5ce77a7967fe588ece855a43e9052a54bfc099","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:59.646864Z","signature_b64":"ycyTviIHNkIMs+i15BMw0pj4J3vx7bfKeoeg3+5wBMzdWbUHo3qgGEqEh4h+rHsmRfmt+XR5CBBsN7WrqGN4Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7b75ad55702e85e220a34366e5ce77a7967fe588ece855a43e9052a54bfc099","last_reissued_at":"2026-05-18T03:49:59.646419Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:59.646419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.0334","source_version":2,"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-18T03:49:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PY+gC71V+ZiHAeSAxjW+CYgZR7fdYdUP0OMfzjoF4V/cSI71T0WtrmFi2OPNguiqR0R2yml+nM3BGrAkhTSPCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:30:46.693258Z"},"content_sha256":"626379d2d742f307ecb1b0a4e810c37d08eb86eec1712295f8139ccbcd93da71","schema_version":"1.0","event_id":"sha256:626379d2d742f307ecb1b0a4e810c37d08eb86eec1712295f8139ccbcd93da71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:463VVVKXALUF4IQKGQ3G4XHHPJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Implementation Of Decoders for LDPC Block Codes and LDPC Convolutional Codes Based on GPUs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"Francis C. M. Lau, Yue Zhao","submitted_at":"2012-04-02T07:48:02Z","abstract_excerpt":"With the use of belief propagation (BP) decoding algorithm, low-density parity-check (LDPC) codes can achieve near-Shannon limit performance. In order to evaluate the error performance of LDPC codes, simulators running on CPUs are commonly used. However, the time taken to evaluate LDPC codes with very good error performance is excessive. In this paper, efficient LDPC block-code decoders/simulators which run on graphics processing units (GPUs) are proposed. We also implement the decoder for the LDPC convolutional code (LDPCCC). The LDPCCC is derived from a pre-designed quasi-cyclic LDPC block c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0334","kind":"arxiv","version":2},"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-18T03:49:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hopEOEJKgLq6rT0kS0DZm53L93/sGfJTRB+hXfj1Yfz+vDhKWq4mhs8AFCmZtj66wfI0KFhFhllxg+CdaJBpAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:30:46.694037Z"},"content_sha256":"a25226635f11acb13b218e357035e9da52f3d754df4100bfaa8edd1d43607815","schema_version":"1.0","event_id":"sha256:a25226635f11acb13b218e357035e9da52f3d754df4100bfaa8edd1d43607815"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/463VVVKXALUF4IQKGQ3G4XHHPJ/bundle.json","state_url":"https://pith.science/pith/463VVVKXALUF4IQKGQ3G4XHHPJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/463VVVKXALUF4IQKGQ3G4XHHPJ/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-11T22:30:46Z","links":{"resolver":"https://pith.science/pith/463VVVKXALUF4IQKGQ3G4XHHPJ","bundle":"https://pith.science/pith/463VVVKXALUF4IQKGQ3G4XHHPJ/bundle.json","state":"https://pith.science/pith/463VVVKXALUF4IQKGQ3G4XHHPJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/463VVVKXALUF4IQKGQ3G4XHHPJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:463VVVKXALUF4IQKGQ3G4XHHPJ","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":"6021ea1ccfcadc03c47dfe7762af6c22c55581d67fe905397c685608df3c680f","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-02T07:48:02Z","title_canon_sha256":"34bf5e294e36f0581e494006fa3812bae9aa9f0a2ce6b359c5d66ac9f285cac0"},"schema_version":"1.0","source":{"id":"1204.0334","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.0334","created_at":"2026-05-18T03:49:59Z"},{"alias_kind":"arxiv_version","alias_value":"1204.0334v2","created_at":"2026-05-18T03:49:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0334","created_at":"2026-05-18T03:49:59Z"},{"alias_kind":"pith_short_12","alias_value":"463VVVKXALUF","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"463VVVKXALUF4IQK","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"463VVVKX","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:a25226635f11acb13b218e357035e9da52f3d754df4100bfaa8edd1d43607815","target":"graph","created_at":"2026-05-18T03:49:59Z","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":"With the use of belief propagation (BP) decoding algorithm, low-density parity-check (LDPC) codes can achieve near-Shannon limit performance. In order to evaluate the error performance of LDPC codes, simulators running on CPUs are commonly used. However, the time taken to evaluate LDPC codes with very good error performance is excessive. In this paper, efficient LDPC block-code decoders/simulators which run on graphics processing units (GPUs) are proposed. We also implement the decoder for the LDPC convolutional code (LDPCCC). The LDPCCC is derived from a pre-designed quasi-cyclic LDPC block c","authors_text":"Francis C. M. Lau, Yue Zhao","cross_cats":["cs.DC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-02T07:48:02Z","title":"Implementation Of Decoders for LDPC Block Codes and LDPC Convolutional Codes Based on GPUs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0334","kind":"arxiv","version":2},"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:626379d2d742f307ecb1b0a4e810c37d08eb86eec1712295f8139ccbcd93da71","target":"record","created_at":"2026-05-18T03:49:59Z","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":"6021ea1ccfcadc03c47dfe7762af6c22c55581d67fe905397c685608df3c680f","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-02T07:48:02Z","title_canon_sha256":"34bf5e294e36f0581e494006fa3812bae9aa9f0a2ce6b359c5d66ac9f285cac0"},"schema_version":"1.0","source":{"id":"1204.0334","kind":"arxiv","version":2}},"canonical_sha256":"e7b75ad55702e85e220a34366e5ce77a7967fe588ece855a43e9052a54bfc099","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7b75ad55702e85e220a34366e5ce77a7967fe588ece855a43e9052a54bfc099","first_computed_at":"2026-05-18T03:49:59.646419Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:59.646419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ycyTviIHNkIMs+i15BMw0pj4J3vx7bfKeoeg3+5wBMzdWbUHo3qgGEqEh4h+rHsmRfmt+XR5CBBsN7WrqGN4Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:59.646864Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.0334","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:626379d2d742f307ecb1b0a4e810c37d08eb86eec1712295f8139ccbcd93da71","sha256:a25226635f11acb13b218e357035e9da52f3d754df4100bfaa8edd1d43607815"],"state_sha256":"d4d089a47539eb052a4296fa2da1fcd1e44b3375dc54e76438c012cd532e3717"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dqxFc5BedMO057Ub6a8eXCrA2Pc1Y3iTSzWcmopAVt0psLQ51yqg0p6YQVRx9lKQ8dwm6dueVd4LVEtoDZ/YAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T22:30:46.697625Z","bundle_sha256":"15e3e6faba999cf47205c3077b68c1e0671f5a29ad20c01cd6fb488b7e211255"}}