{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5Y2IQIVX7V6DKEM2XTIBFWJFAB","short_pith_number":"pith:5Y2IQIVX","schema_version":"1.0","canonical_sha256":"ee348822b7fd7c35119abcd012d925004568f01766fba74f43604c8f3f336a8e","source":{"kind":"arxiv","id":"1303.1858","version":1},"attestation_state":"computed","paper":{"title":"On the Minimum Distance of Generalized Spatially Coupled LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel J. Costello Jr, David G. M. Mitchell, Michael Lentmaier","submitted_at":"2013-03-08T00:00:28Z","abstract_excerpt":"Families of generalized spatially-coupled low-density parity-check (GSC-LDPC) code ensembles can be formed by terminating protograph-based generalized LDPC convolutional (GLDPCC) codes. It has previously been shown that ensembles of GSC-LDPC codes constructed from a protograph have better iterative decoding thresholds than their block code counterparts, and that, for large termination lengths, their thresholds coincide with the maximum a-posteriori (MAP) decoding threshold of the underlying generalized LDPC block code ensemble. Here we show that, in addition to their excellent iterative decodi"},"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":"1303.1858","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-08T00:00:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"71790b595207d39f33e3f4cedb074c0bd247b6231d21725a684d8b55e966e6ef","abstract_canon_sha256":"a2799957c5ea63cb60c4aec28fe5e35a0d9a9682267b8c7631b1ad0ff7adca10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:56.513713Z","signature_b64":"fifdy89A8dglXbLf7bbKpZFKnbjh++4CdVy7DzJWoxch/fVrHu7a1YNVi63ym6t5O+QNrsvp8lpRPgQ6dUNOCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee348822b7fd7c35119abcd012d925004568f01766fba74f43604c8f3f336a8e","last_reissued_at":"2026-05-18T00:57:56.513249Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:56.513249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Minimum Distance of Generalized Spatially Coupled LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel J. Costello Jr, David G. M. Mitchell, Michael Lentmaier","submitted_at":"2013-03-08T00:00:28Z","abstract_excerpt":"Families of generalized spatially-coupled low-density parity-check (GSC-LDPC) code ensembles can be formed by terminating protograph-based generalized LDPC convolutional (GLDPCC) codes. It has previously been shown that ensembles of GSC-LDPC codes constructed from a protograph have better iterative decoding thresholds than their block code counterparts, and that, for large termination lengths, their thresholds coincide with the maximum a-posteriori (MAP) decoding threshold of the underlying generalized LDPC block code ensemble. Here we show that, in addition to their excellent iterative decodi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1858","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":"1303.1858","created_at":"2026-05-18T00:57:56.513305+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.1858v1","created_at":"2026-05-18T00:57:56.513305+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1858","created_at":"2026-05-18T00:57:56.513305+00:00"},{"alias_kind":"pith_short_12","alias_value":"5Y2IQIVX7V6D","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5Y2IQIVX7V6DKEM2","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5Y2IQIVX","created_at":"2026-05-18T12:27:34.582898+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/5Y2IQIVX7V6DKEM2XTIBFWJFAB","json":"https://pith.science/pith/5Y2IQIVX7V6DKEM2XTIBFWJFAB.json","graph_json":"https://pith.science/api/pith-number/5Y2IQIVX7V6DKEM2XTIBFWJFAB/graph.json","events_json":"https://pith.science/api/pith-number/5Y2IQIVX7V6DKEM2XTIBFWJFAB/events.json","paper":"https://pith.science/paper/5Y2IQIVX"},"agent_actions":{"view_html":"https://pith.science/pith/5Y2IQIVX7V6DKEM2XTIBFWJFAB","download_json":"https://pith.science/pith/5Y2IQIVX7V6DKEM2XTIBFWJFAB.json","view_paper":"https://pith.science/paper/5Y2IQIVX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.1858&json=true","fetch_graph":"https://pith.science/api/pith-number/5Y2IQIVX7V6DKEM2XTIBFWJFAB/graph.json","fetch_events":"https://pith.science/api/pith-number/5Y2IQIVX7V6DKEM2XTIBFWJFAB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5Y2IQIVX7V6DKEM2XTIBFWJFAB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5Y2IQIVX7V6DKEM2XTIBFWJFAB/action/storage_attestation","attest_author":"https://pith.science/pith/5Y2IQIVX7V6DKEM2XTIBFWJFAB/action/author_attestation","sign_citation":"https://pith.science/pith/5Y2IQIVX7V6DKEM2XTIBFWJFAB/action/citation_signature","submit_replication":"https://pith.science/pith/5Y2IQIVX7V6DKEM2XTIBFWJFAB/action/replication_record"}},"created_at":"2026-05-18T00:57:56.513305+00:00","updated_at":"2026-05-18T00:57:56.513305+00:00"}