{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NSX4DPBWGFG2J4HKOOLYKVME2O","short_pith_number":"pith:NSX4DPBW","canonical_record":{"source":{"id":"1305.0185","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-01T14:40:30Z","cross_cats_sorted":["cs.AR","math.IT"],"title_canon_sha256":"dcf9d3150d8283218bc672ae20c4da4359ba8770ffdc53423480c64c436319c7","abstract_canon_sha256":"16907422f2c0589a0bca59fae29cdf95f607eb069d36d8773492d30c466cf62c"},"schema_version":"1.0"},"canonical_sha256":"6cafc1bc36314da4f0ea7397855584d399d98608f09945a44e50763c2bf6e54d","source":{"kind":"arxiv","id":"1305.0185","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0185","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0185v1","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0185","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"pith_short_12","alias_value":"NSX4DPBWGFG2","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NSX4DPBWGFG2J4HK","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NSX4DPBW","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NSX4DPBWGFG2J4HKOOLYKVME2O","target":"record","payload":{"canonical_record":{"source":{"id":"1305.0185","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-01T14:40:30Z","cross_cats_sorted":["cs.AR","math.IT"],"title_canon_sha256":"dcf9d3150d8283218bc672ae20c4da4359ba8770ffdc53423480c64c436319c7","abstract_canon_sha256":"16907422f2c0589a0bca59fae29cdf95f607eb069d36d8773492d30c466cf62c"},"schema_version":"1.0"},"canonical_sha256":"6cafc1bc36314da4f0ea7397855584d399d98608f09945a44e50763c2bf6e54d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:17.291294Z","signature_b64":"S6+98zWUSO6fxtSeirMSATyOC34iLTfx2FftjkD8oKCQbKo2o34j+Vr0dYJr7JtiVkNgJqok6/62PvWSo9mZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cafc1bc36314da4f0ea7397855584d399d98608f09945a44e50763c2bf6e54d","last_reissued_at":"2026-05-18T00:58:17.290574Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:17.290574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.0185","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-18T00:58:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zFDtFhH7OM+EiHlecsu1DdA3klxRLIGzlTDRM/0JeNltivAviHsNEie1XvNeSRJpCaZ+VpuVYb8GCVuj4PfnDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T15:12:00.004815Z"},"content_sha256":"e9dbc323f593789b8400ac2a016e548f06e5f75b9220c0bb22acd7c2c5abef27","schema_version":"1.0","event_id":"sha256:e9dbc323f593789b8400ac2a016e548f06e5f75b9220c0bb22acd7c2c5abef27"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NSX4DPBWGFG2J4HKOOLYKVME2O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A 2.0 Gb/s Throughput Decoder for QC-LDPC Convolutional Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR","math.IT"],"primary_cat":"cs.IT","authors_text":"Chiu-Wing Sham, Francis C.M. Lau, Wai M. Tam, Xu Chen, Yue Zhao","submitted_at":"2013-05-01T14:40:30Z","abstract_excerpt":"This paper propose a decoder architecture for low-density parity-check convolutional code (LDPCCC). Specifically, the LDPCCC is derived from a quasi-cyclic (QC) LDPC block code. By making use of the quasi-cyclic structure, the proposed LDPCCC decoder adopts a dynamic message storage in the memory and uses a simple address controller. The decoder efficiently combines the memories in the pipelining processors into a large memory block so as to take advantage of the data-width of the embedded memory in a modern field-programmable gate array (FPGA). A rate-5/6 QC-LDPCCC has been implemented on an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0185","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-18T00:58:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QX2xLy5bPeoWiIy4jLkExtERnWrtXV1XFYiwFN7QhqJ4Z2DHE7UCh7BicQ2cIZARUnxZmz1CwxF9E9Bfz9GeCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T15:12:00.005318Z"},"content_sha256":"f72aa79ff2e4b77ef42ce38fb763c4c202345eaad2387dd6e1a2881b17a7c628","schema_version":"1.0","event_id":"sha256:f72aa79ff2e4b77ef42ce38fb763c4c202345eaad2387dd6e1a2881b17a7c628"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NSX4DPBWGFG2J4HKOOLYKVME2O/bundle.json","state_url":"https://pith.science/pith/NSX4DPBWGFG2J4HKOOLYKVME2O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NSX4DPBWGFG2J4HKOOLYKVME2O/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-08-14T15:12:00Z","links":{"resolver":"https://pith.science/pith/NSX4DPBWGFG2J4HKOOLYKVME2O","bundle":"https://pith.science/pith/NSX4DPBWGFG2J4HKOOLYKVME2O/bundle.json","state":"https://pith.science/pith/NSX4DPBWGFG2J4HKOOLYKVME2O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NSX4DPBWGFG2J4HKOOLYKVME2O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NSX4DPBWGFG2J4HKOOLYKVME2O","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":"16907422f2c0589a0bca59fae29cdf95f607eb069d36d8773492d30c466cf62c","cross_cats_sorted":["cs.AR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-01T14:40:30Z","title_canon_sha256":"dcf9d3150d8283218bc672ae20c4da4359ba8770ffdc53423480c64c436319c7"},"schema_version":"1.0","source":{"id":"1305.0185","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0185","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0185v1","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0185","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"pith_short_12","alias_value":"NSX4DPBWGFG2","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NSX4DPBWGFG2J4HK","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NSX4DPBW","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:f72aa79ff2e4b77ef42ce38fb763c4c202345eaad2387dd6e1a2881b17a7c628","target":"graph","created_at":"2026-05-18T00:58:17Z","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 propose a decoder architecture for low-density parity-check convolutional code (LDPCCC). Specifically, the LDPCCC is derived from a quasi-cyclic (QC) LDPC block code. By making use of the quasi-cyclic structure, the proposed LDPCCC decoder adopts a dynamic message storage in the memory and uses a simple address controller. The decoder efficiently combines the memories in the pipelining processors into a large memory block so as to take advantage of the data-width of the embedded memory in a modern field-programmable gate array (FPGA). A rate-5/6 QC-LDPCCC has been implemented on an ","authors_text":"Chiu-Wing Sham, Francis C.M. Lau, Wai M. Tam, Xu Chen, Yue Zhao","cross_cats":["cs.AR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-01T14:40:30Z","title":"A 2.0 Gb/s Throughput Decoder for QC-LDPC Convolutional Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0185","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:e9dbc323f593789b8400ac2a016e548f06e5f75b9220c0bb22acd7c2c5abef27","target":"record","created_at":"2026-05-18T00:58:17Z","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":"16907422f2c0589a0bca59fae29cdf95f607eb069d36d8773492d30c466cf62c","cross_cats_sorted":["cs.AR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-01T14:40:30Z","title_canon_sha256":"dcf9d3150d8283218bc672ae20c4da4359ba8770ffdc53423480c64c436319c7"},"schema_version":"1.0","source":{"id":"1305.0185","kind":"arxiv","version":1}},"canonical_sha256":"6cafc1bc36314da4f0ea7397855584d399d98608f09945a44e50763c2bf6e54d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6cafc1bc36314da4f0ea7397855584d399d98608f09945a44e50763c2bf6e54d","first_computed_at":"2026-05-18T00:58:17.290574Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:17.290574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S6+98zWUSO6fxtSeirMSATyOC34iLTfx2FftjkD8oKCQbKo2o34j+Vr0dYJr7JtiVkNgJqok6/62PvWSo9mZAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:17.291294Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.0185","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9dbc323f593789b8400ac2a016e548f06e5f75b9220c0bb22acd7c2c5abef27","sha256:f72aa79ff2e4b77ef42ce38fb763c4c202345eaad2387dd6e1a2881b17a7c628"],"state_sha256":"8f0c4a30e6c3b9d26450b04b023f0a76f3eefcfcd4cd63a04f2bfc0787d343ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xsNv83DdZMYOdCYvKqlhBY3wtYR5PD86OFSwuXZ1M0ILk2hDEj0PBfxccTkU960ckO2T1EKmN6sAIXc/bp1EAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T15:12:00.009500Z","bundle_sha256":"62d2c80ac4a7a4c2dcffd700cdbe8ced8ca8c2f953bc5ca9f68213aeaaa4879c"}}