{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:P5UXFXBFMKPI6R64YFROWAJM2P","short_pith_number":"pith:P5UXFXBF","canonical_record":{"source":{"id":"1305.5625","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-24T05:55:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6216303000ef0cd58ad798831f5d5af939e47b7be1b48d868bb83a1dee6ffb6c","abstract_canon_sha256":"8cbc14df272a22adfa7e61079fc254b132c2d97ec94ff4db0da77b6c32d492dd"},"schema_version":"1.0"},"canonical_sha256":"7f6972dc25629e8f47dcc162eb012cd3fc5e3d3606ad5db22e597eae1473bd20","source":{"kind":"arxiv","id":"1305.5625","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.5625","created_at":"2026-05-18T03:10:14Z"},{"alias_kind":"arxiv_version","alias_value":"1305.5625v2","created_at":"2026-05-18T03:10:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5625","created_at":"2026-05-18T03:10:14Z"},{"alias_kind":"pith_short_12","alias_value":"P5UXFXBFMKPI","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"P5UXFXBFMKPI6R64","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"P5UXFXBF","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:P5UXFXBFMKPI6R64YFROWAJM2P","target":"record","payload":{"canonical_record":{"source":{"id":"1305.5625","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-24T05:55:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6216303000ef0cd58ad798831f5d5af939e47b7be1b48d868bb83a1dee6ffb6c","abstract_canon_sha256":"8cbc14df272a22adfa7e61079fc254b132c2d97ec94ff4db0da77b6c32d492dd"},"schema_version":"1.0"},"canonical_sha256":"7f6972dc25629e8f47dcc162eb012cd3fc5e3d3606ad5db22e597eae1473bd20","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:14.280990Z","signature_b64":"8DkgO5NwVsD/1HLKTBNDYciCDfWIWmwmAD9d2dReV1TEPeuAlpfg0DkX36C13j+DkV0h2vDu4zKcsLp1G7Y0Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f6972dc25629e8f47dcc162eb012cd3fc5e3d3606ad5db22e597eae1473bd20","last_reissued_at":"2026-05-18T03:10:14.280475Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:14.280475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.5625","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:10:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o3iV8O9cyYO/WEOqXdFvIHdozJl2QjOWDNPE69u2xZe7VzPMaDJcMXiuf6gXgZJ0aUWPWJ1qrDygbZ41L7vHAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:24:18.641167Z"},"content_sha256":"af39786226cb038867e5c0d0c175dd0a5a9cad742b44bf6dfc79349497e5df01","schema_version":"1.0","event_id":"sha256:af39786226cb038867e5c0d0c175dd0a5a9cad742b44bf6dfc79349497e5df01"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:P5UXFXBFMKPI6R64YFROWAJM2P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Memory Efficient Decoders using Spatially Coupled Quasi-Cyclic LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gottfried Lechner, Sarah J. Johnson, Vikram Arkalgud Chandrasetty","submitted_at":"2013-05-24T05:55:16Z","abstract_excerpt":"In this paper we propose the construction of Spatially Coupled Low-Density Parity-Check (SC-LDPC) codes using a periodic time-variant Quasi-Cyclic (QC) algorithm. The QC based approach is optimized to obtain memory efficiency in storing the parity-check matrix in the decoders. A hardware model of the parity-check storage units has been designed for Xilinx FPGA to compare the logic and memory requirements for various approaches. It is shown that the proposed QC SC-LDPC code (with optimization) can be stored with reasonable logic resources and without the need of block memory in the FPGA. In add"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5625","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:10:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PcIsLv+yEwqakM7EUb13xzP+PFIhPJmyg778+xEL+TeiKUetzWnqLMD65OVJI58ZNooIisLrGijJUqg78btUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:24:18.641523Z"},"content_sha256":"dc6af4920d846635a17d3a2f1673ee64616444d48bd80d8110f7d6f73588de09","schema_version":"1.0","event_id":"sha256:dc6af4920d846635a17d3a2f1673ee64616444d48bd80d8110f7d6f73588de09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P5UXFXBFMKPI6R64YFROWAJM2P/bundle.json","state_url":"https://pith.science/pith/P5UXFXBFMKPI6R64YFROWAJM2P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P5UXFXBFMKPI6R64YFROWAJM2P/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-01T08:24:18Z","links":{"resolver":"https://pith.science/pith/P5UXFXBFMKPI6R64YFROWAJM2P","bundle":"https://pith.science/pith/P5UXFXBFMKPI6R64YFROWAJM2P/bundle.json","state":"https://pith.science/pith/P5UXFXBFMKPI6R64YFROWAJM2P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P5UXFXBFMKPI6R64YFROWAJM2P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:P5UXFXBFMKPI6R64YFROWAJM2P","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":"8cbc14df272a22adfa7e61079fc254b132c2d97ec94ff4db0da77b6c32d492dd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-24T05:55:16Z","title_canon_sha256":"6216303000ef0cd58ad798831f5d5af939e47b7be1b48d868bb83a1dee6ffb6c"},"schema_version":"1.0","source":{"id":"1305.5625","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.5625","created_at":"2026-05-18T03:10:14Z"},{"alias_kind":"arxiv_version","alias_value":"1305.5625v2","created_at":"2026-05-18T03:10:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5625","created_at":"2026-05-18T03:10:14Z"},{"alias_kind":"pith_short_12","alias_value":"P5UXFXBFMKPI","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"P5UXFXBFMKPI6R64","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"P5UXFXBF","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:dc6af4920d846635a17d3a2f1673ee64616444d48bd80d8110f7d6f73588de09","target":"graph","created_at":"2026-05-18T03:10:14Z","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":"In this paper we propose the construction of Spatially Coupled Low-Density Parity-Check (SC-LDPC) codes using a periodic time-variant Quasi-Cyclic (QC) algorithm. The QC based approach is optimized to obtain memory efficiency in storing the parity-check matrix in the decoders. A hardware model of the parity-check storage units has been designed for Xilinx FPGA to compare the logic and memory requirements for various approaches. It is shown that the proposed QC SC-LDPC code (with optimization) can be stored with reasonable logic resources and without the need of block memory in the FPGA. In add","authors_text":"Gottfried Lechner, Sarah J. Johnson, Vikram Arkalgud Chandrasetty","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-24T05:55:16Z","title":"Memory Efficient Decoders using Spatially Coupled Quasi-Cyclic LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5625","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:af39786226cb038867e5c0d0c175dd0a5a9cad742b44bf6dfc79349497e5df01","target":"record","created_at":"2026-05-18T03:10:14Z","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":"8cbc14df272a22adfa7e61079fc254b132c2d97ec94ff4db0da77b6c32d492dd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-24T05:55:16Z","title_canon_sha256":"6216303000ef0cd58ad798831f5d5af939e47b7be1b48d868bb83a1dee6ffb6c"},"schema_version":"1.0","source":{"id":"1305.5625","kind":"arxiv","version":2}},"canonical_sha256":"7f6972dc25629e8f47dcc162eb012cd3fc5e3d3606ad5db22e597eae1473bd20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f6972dc25629e8f47dcc162eb012cd3fc5e3d3606ad5db22e597eae1473bd20","first_computed_at":"2026-05-18T03:10:14.280475Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:14.280475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8DkgO5NwVsD/1HLKTBNDYciCDfWIWmwmAD9d2dReV1TEPeuAlpfg0DkX36C13j+DkV0h2vDu4zKcsLp1G7Y0Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:14.280990Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.5625","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af39786226cb038867e5c0d0c175dd0a5a9cad742b44bf6dfc79349497e5df01","sha256:dc6af4920d846635a17d3a2f1673ee64616444d48bd80d8110f7d6f73588de09"],"state_sha256":"9f1289a421d2e2ce7767ef21e1c65684e35e7b5f674cbd5cc57c23257321ec19"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nw/GVjJgpFxgEKNUbMiCAWhiz4zkCI1XxG5wUmaBlpeZA8QzRj96k2bnESk2GPKFHE7VZ7dsRILUi4LNnUy7AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T08:24:18.643374Z","bundle_sha256":"9c4020894c8c27de1b3bf66fe9ff968d0ad5b4a3134cccd8c2a905aea7569e5b"}}