{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XJFR6YPXZDCU2D2CPYRT6QRAIU","short_pith_number":"pith:XJFR6YPX","canonical_record":{"source":{"id":"1809.04662","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-12T20:26:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0034e6dda009f6ca9b8650b1cb6bc568aa85ce5e893806c711c622102cb97f16","abstract_canon_sha256":"3b5b689d41866f6638873b25a40374ac25e70e430c31e419f7069a4f7ce4b33d"},"schema_version":"1.0"},"canonical_sha256":"ba4b1f61f7c8c54d0f427e233f4220450c5e063ed1e3599e2855619ab2e3a865","source":{"kind":"arxiv","id":"1809.04662","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04662","created_at":"2026-05-18T00:05:50Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04662v1","created_at":"2026-05-18T00:05:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04662","created_at":"2026-05-18T00:05:50Z"},{"alias_kind":"pith_short_12","alias_value":"XJFR6YPXZDCU","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XJFR6YPXZDCU2D2C","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XJFR6YPX","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XJFR6YPXZDCU2D2CPYRT6QRAIU","target":"record","payload":{"canonical_record":{"source":{"id":"1809.04662","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-12T20:26:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0034e6dda009f6ca9b8650b1cb6bc568aa85ce5e893806c711c622102cb97f16","abstract_canon_sha256":"3b5b689d41866f6638873b25a40374ac25e70e430c31e419f7069a4f7ce4b33d"},"schema_version":"1.0"},"canonical_sha256":"ba4b1f61f7c8c54d0f427e233f4220450c5e063ed1e3599e2855619ab2e3a865","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:50.073758Z","signature_b64":"MZx6sse7VMKaL5ofBin9yjDjThjHFp28PUS7ucJPhZHjdZqqsO0RRYzcN0yHf5xcZqgGqIM2Zzs6EjNzv5XuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba4b1f61f7c8c54d0f427e233f4220450c5e063ed1e3599e2855619ab2e3a865","last_reissued_at":"2026-05-18T00:05:50.073066Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:50.073066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.04662","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:05:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IN+MMxs7YhBoDSuU5rJ6j/r1ft574q4XQR54uLAnqZ4glhmqv2DmOI5BxMIFbDFvioi7HsHlWvm0+j8Dr/D5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:33:33.844651Z"},"content_sha256":"fcf9a50b06a6a3af9802cd0b31270ce7ecb9bab822c9b0fdfa36836a157a5069","schema_version":"1.0","event_id":"sha256:fcf9a50b06a6a3af9802cd0b31270ce7ecb9bab822c9b0fdfa36836a157a5069"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XJFR6YPXZDCU2D2CPYRT6QRAIU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compact QC-LDPC Block and SC-LDPC Convolutional Codes for Low-Latency Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alireza Tasdighi, Franco Chiaraluce, Marco Baldi, Massimo Battaglioni, Mohammad H. Tadayon","submitted_at":"2018-09-12T20:26:31Z","abstract_excerpt":"Low decoding latency and complexity are two important requirements of channel codes used in many applications, like machine-to-machine communications. In this paper, we show how these requirements can be fulfilled by using some special quasi-cyclic low-density parity-check block codes and spatially coupled low-density parity-check convolutional codes that we denote as compact. They are defined by parity-check matrices designed according to a recent approach based on sequentially multiplied columns. This method allows obtaining codes with girth up to 12. Many numerical examples of practical cod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04662","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:05:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YQgAQKr31jnxEges3HoV10uR4+Sj99crVc7VfMjK+78Ksp0lT7D1PmC8mla02w1Ns6dBxcMJO7dS+E72kByHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:33:33.845242Z"},"content_sha256":"74d2bb424c9c364c23f5563ac6bfb6763528eb75578a562595afeef8e57397cd","schema_version":"1.0","event_id":"sha256:74d2bb424c9c364c23f5563ac6bfb6763528eb75578a562595afeef8e57397cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XJFR6YPXZDCU2D2CPYRT6QRAIU/bundle.json","state_url":"https://pith.science/pith/XJFR6YPXZDCU2D2CPYRT6QRAIU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XJFR6YPXZDCU2D2CPYRT6QRAIU/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-01T23:33:33Z","links":{"resolver":"https://pith.science/pith/XJFR6YPXZDCU2D2CPYRT6QRAIU","bundle":"https://pith.science/pith/XJFR6YPXZDCU2D2CPYRT6QRAIU/bundle.json","state":"https://pith.science/pith/XJFR6YPXZDCU2D2CPYRT6QRAIU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XJFR6YPXZDCU2D2CPYRT6QRAIU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XJFR6YPXZDCU2D2CPYRT6QRAIU","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":"3b5b689d41866f6638873b25a40374ac25e70e430c31e419f7069a4f7ce4b33d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-12T20:26:31Z","title_canon_sha256":"0034e6dda009f6ca9b8650b1cb6bc568aa85ce5e893806c711c622102cb97f16"},"schema_version":"1.0","source":{"id":"1809.04662","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04662","created_at":"2026-05-18T00:05:50Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04662v1","created_at":"2026-05-18T00:05:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04662","created_at":"2026-05-18T00:05:50Z"},{"alias_kind":"pith_short_12","alias_value":"XJFR6YPXZDCU","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XJFR6YPXZDCU2D2C","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XJFR6YPX","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:74d2bb424c9c364c23f5563ac6bfb6763528eb75578a562595afeef8e57397cd","target":"graph","created_at":"2026-05-18T00:05:50Z","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":"Low decoding latency and complexity are two important requirements of channel codes used in many applications, like machine-to-machine communications. In this paper, we show how these requirements can be fulfilled by using some special quasi-cyclic low-density parity-check block codes and spatially coupled low-density parity-check convolutional codes that we denote as compact. They are defined by parity-check matrices designed according to a recent approach based on sequentially multiplied columns. This method allows obtaining codes with girth up to 12. Many numerical examples of practical cod","authors_text":"Alireza Tasdighi, Franco Chiaraluce, Marco Baldi, Massimo Battaglioni, Mohammad H. Tadayon","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-12T20:26:31Z","title":"Compact QC-LDPC Block and SC-LDPC Convolutional Codes for Low-Latency Communications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04662","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:fcf9a50b06a6a3af9802cd0b31270ce7ecb9bab822c9b0fdfa36836a157a5069","target":"record","created_at":"2026-05-18T00:05:50Z","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":"3b5b689d41866f6638873b25a40374ac25e70e430c31e419f7069a4f7ce4b33d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-12T20:26:31Z","title_canon_sha256":"0034e6dda009f6ca9b8650b1cb6bc568aa85ce5e893806c711c622102cb97f16"},"schema_version":"1.0","source":{"id":"1809.04662","kind":"arxiv","version":1}},"canonical_sha256":"ba4b1f61f7c8c54d0f427e233f4220450c5e063ed1e3599e2855619ab2e3a865","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba4b1f61f7c8c54d0f427e233f4220450c5e063ed1e3599e2855619ab2e3a865","first_computed_at":"2026-05-18T00:05:50.073066Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:50.073066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MZx6sse7VMKaL5ofBin9yjDjThjHFp28PUS7ucJPhZHjdZqqsO0RRYzcN0yHf5xcZqgGqIM2Zzs6EjNzv5XuDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:50.073758Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.04662","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fcf9a50b06a6a3af9802cd0b31270ce7ecb9bab822c9b0fdfa36836a157a5069","sha256:74d2bb424c9c364c23f5563ac6bfb6763528eb75578a562595afeef8e57397cd"],"state_sha256":"a68cdeca7f2746a912a0ecf630d50bbbc8a9e3b204e57d50bf1b86b9f40a3b80"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2v4KtQ/2QXRLLyxvYAHXYIHbQm3fAc//D0JN17Kgob5mUjYanqlfFQqp2gQ/EKBoPlFDZipOaVu9ZcfrFRrECQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T23:33:33.847050Z","bundle_sha256":"acbf3d18bcd42e958b342b1cfa019f520e16340dbbfd0aef91d28abdbe012932"}}