{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VPO7QFTRBNIEUDBUMOCSKM4KRI","short_pith_number":"pith:VPO7QFTR","schema_version":"1.0","canonical_sha256":"abddf816710b504a0c34638525338a8a1e9c12b4a6cb51e49a97046a28b2626b","source":{"kind":"arxiv","id":"2502.03774","version":2},"attestation_state":"computed","paper":{"title":"High-Rate Spatially Coupled LDPC Codes Based on Massey's Convolutional Self-Orthogonal Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel J. Costello, David G. M. Mitchell, Jr., Michael Lentmaier, Min Zhu","submitted_at":"2025-02-06T04:25:16Z","abstract_excerpt":"In this paper, we study a new class of high-rate spatially coupled LDPC (SC-LDPC) codes based on the convolutional self-orthogonal codes (CSOCs) first introduced by Massey. The SC-LDPC codes are constructed by treating the irregular graph corresponding to the parity-check matrix of a systematic rate R = (n - 1)/n CSOC as a convolutional protograph. The protograph can then be lifted using permutation matrices to generate a high-rate SC-LDPC code whose strength depends on the lifting factor. The SC-LDPC codes constructed in this fashion can be decoded using iterative belief propagation (BP) base"},"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":"2502.03774","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-02-06T04:25:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ff4f8db7c0496ca76d4bbe78c8e6118c6943b4a8d06cbab4be4f5199b8df7020","abstract_canon_sha256":"1ddf225f08899870731b799bd632bcb1765390145ba3304e6f150ecdef64b246"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:15:25.598903Z","signature_b64":"ju02BgkH1vpjYtRnIY7uO/ifxOYP1ZXO1RPj1xIGAEUblWDnkL3FNuW7OK8gf3fYrmt62uBhKuyIvBAUpT9tBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abddf816710b504a0c34638525338a8a1e9c12b4a6cb51e49a97046a28b2626b","last_reissued_at":"2026-07-05T10:15:25.598369Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:15:25.598369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High-Rate Spatially Coupled LDPC Codes Based on Massey's Convolutional Self-Orthogonal Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel J. Costello, David G. M. Mitchell, Jr., Michael Lentmaier, Min Zhu","submitted_at":"2025-02-06T04:25:16Z","abstract_excerpt":"In this paper, we study a new class of high-rate spatially coupled LDPC (SC-LDPC) codes based on the convolutional self-orthogonal codes (CSOCs) first introduced by Massey. The SC-LDPC codes are constructed by treating the irregular graph corresponding to the parity-check matrix of a systematic rate R = (n - 1)/n CSOC as a convolutional protograph. The protograph can then be lifted using permutation matrices to generate a high-rate SC-LDPC code whose strength depends on the lifting factor. The SC-LDPC codes constructed in this fashion can be decoded using iterative belief propagation (BP) base"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.03774","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.03774/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2502.03774","created_at":"2026-07-05T10:15:25.598437+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.03774v2","created_at":"2026-07-05T10:15:25.598437+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.03774","created_at":"2026-07-05T10:15:25.598437+00:00"},{"alias_kind":"pith_short_12","alias_value":"VPO7QFTRBNIE","created_at":"2026-07-05T10:15:25.598437+00:00"},{"alias_kind":"pith_short_16","alias_value":"VPO7QFTRBNIEUDBU","created_at":"2026-07-05T10:15:25.598437+00:00"},{"alias_kind":"pith_short_8","alias_value":"VPO7QFTR","created_at":"2026-07-05T10:15:25.598437+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/VPO7QFTRBNIEUDBUMOCSKM4KRI","json":"https://pith.science/pith/VPO7QFTRBNIEUDBUMOCSKM4KRI.json","graph_json":"https://pith.science/api/pith-number/VPO7QFTRBNIEUDBUMOCSKM4KRI/graph.json","events_json":"https://pith.science/api/pith-number/VPO7QFTRBNIEUDBUMOCSKM4KRI/events.json","paper":"https://pith.science/paper/VPO7QFTR"},"agent_actions":{"view_html":"https://pith.science/pith/VPO7QFTRBNIEUDBUMOCSKM4KRI","download_json":"https://pith.science/pith/VPO7QFTRBNIEUDBUMOCSKM4KRI.json","view_paper":"https://pith.science/paper/VPO7QFTR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.03774&json=true","fetch_graph":"https://pith.science/api/pith-number/VPO7QFTRBNIEUDBUMOCSKM4KRI/graph.json","fetch_events":"https://pith.science/api/pith-number/VPO7QFTRBNIEUDBUMOCSKM4KRI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VPO7QFTRBNIEUDBUMOCSKM4KRI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VPO7QFTRBNIEUDBUMOCSKM4KRI/action/storage_attestation","attest_author":"https://pith.science/pith/VPO7QFTRBNIEUDBUMOCSKM4KRI/action/author_attestation","sign_citation":"https://pith.science/pith/VPO7QFTRBNIEUDBUMOCSKM4KRI/action/citation_signature","submit_replication":"https://pith.science/pith/VPO7QFTRBNIEUDBUMOCSKM4KRI/action/replication_record"}},"created_at":"2026-07-05T10:15:25.598437+00:00","updated_at":"2026-07-05T10:15:25.598437+00:00"}