{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GIR5BVXDY74NW5HZNPK45B3BZK","short_pith_number":"pith:GIR5BVXD","schema_version":"1.0","canonical_sha256":"3223d0d6e3c7f8db74f96bd5ce8761ca81ed9d7e067423f2c16bb2622f5fcd43","source":{"kind":"arxiv","id":"1605.05560","version":1},"attestation_state":"computed","paper":{"title":"Time-Invariant Spatially Coupled Low-Density Parity-Check Codes with Small Constraint Length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Franco Chiaraluce, Giovanni Cancellieri, Marco Baldi, Massimo Battaglioni","submitted_at":"2016-05-18T12:51:37Z","abstract_excerpt":"We consider a special family of SC-LDPC codes, that is, time-invariant LDPCC codes, which are known in the literature for a long time. Codes of this kind are usually designed by starting from QC block codes, and applying suitable unwrapping procedures. We show that, by directly designing the LDPCC code syndrome former matrix without the constraints of the underlying QC block code, it is possible to achieve smaller constraint lengths with respect to the best solutions available in the literature. We also find theoretical lower bounds on the syndrome former constraint length for codes with a spe"},"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":"1605.05560","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-18T12:51:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d317ab4e0ff83ef1fc85f6400b89f978ed372d1f5b1dc3dcc0664154d4e979e7","abstract_canon_sha256":"99fab75f89aeb9e5548cf9bf8c2c3e59eed87808911897aeabc8274779f5fa70"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:34.589028Z","signature_b64":"3KKZJrQZxwLne9t7uhehLPW6X/gIgjKGL79hAZrXc63Lmtfwd//DHWaUbV5iR46CcYRBuG7Clog0RAOUAeTQDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3223d0d6e3c7f8db74f96bd5ce8761ca81ed9d7e067423f2c16bb2622f5fcd43","last_reissued_at":"2026-05-18T01:14:34.588366Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:34.588366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Time-Invariant Spatially Coupled Low-Density Parity-Check Codes with Small Constraint Length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Franco Chiaraluce, Giovanni Cancellieri, Marco Baldi, Massimo Battaglioni","submitted_at":"2016-05-18T12:51:37Z","abstract_excerpt":"We consider a special family of SC-LDPC codes, that is, time-invariant LDPCC codes, which are known in the literature for a long time. Codes of this kind are usually designed by starting from QC block codes, and applying suitable unwrapping procedures. We show that, by directly designing the LDPCC code syndrome former matrix without the constraints of the underlying QC block code, it is possible to achieve smaller constraint lengths with respect to the best solutions available in the literature. We also find theoretical lower bounds on the syndrome former constraint length for codes with a spe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05560","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":"1605.05560","created_at":"2026-05-18T01:14:34.588478+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.05560v1","created_at":"2026-05-18T01:14:34.588478+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05560","created_at":"2026-05-18T01:14:34.588478+00:00"},{"alias_kind":"pith_short_12","alias_value":"GIR5BVXDY74N","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GIR5BVXDY74NW5HZ","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GIR5BVXD","created_at":"2026-05-18T12:30:19.053100+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/GIR5BVXDY74NW5HZNPK45B3BZK","json":"https://pith.science/pith/GIR5BVXDY74NW5HZNPK45B3BZK.json","graph_json":"https://pith.science/api/pith-number/GIR5BVXDY74NW5HZNPK45B3BZK/graph.json","events_json":"https://pith.science/api/pith-number/GIR5BVXDY74NW5HZNPK45B3BZK/events.json","paper":"https://pith.science/paper/GIR5BVXD"},"agent_actions":{"view_html":"https://pith.science/pith/GIR5BVXDY74NW5HZNPK45B3BZK","download_json":"https://pith.science/pith/GIR5BVXDY74NW5HZNPK45B3BZK.json","view_paper":"https://pith.science/paper/GIR5BVXD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.05560&json=true","fetch_graph":"https://pith.science/api/pith-number/GIR5BVXDY74NW5HZNPK45B3BZK/graph.json","fetch_events":"https://pith.science/api/pith-number/GIR5BVXDY74NW5HZNPK45B3BZK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GIR5BVXDY74NW5HZNPK45B3BZK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GIR5BVXDY74NW5HZNPK45B3BZK/action/storage_attestation","attest_author":"https://pith.science/pith/GIR5BVXDY74NW5HZNPK45B3BZK/action/author_attestation","sign_citation":"https://pith.science/pith/GIR5BVXDY74NW5HZNPK45B3BZK/action/citation_signature","submit_replication":"https://pith.science/pith/GIR5BVXDY74NW5HZNPK45B3BZK/action/replication_record"}},"created_at":"2026-05-18T01:14:34.588478+00:00","updated_at":"2026-05-18T01:14:34.588478+00:00"}