{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6JLPDRE2XAALCF6NS5LOQ57A2N","short_pith_number":"pith:6JLPDRE2","schema_version":"1.0","canonical_sha256":"f256f1c49ab800b117cd9756e877e0d367b20507474610fe3754151a46fac108","source":{"kind":"arxiv","id":"1710.03619","version":1},"attestation_state":"computed","paper":{"title":"A Generalized Algebraic Approach to Optimizing SC-LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Allison Beemer, Christine A. Kelley, Joerg Kliewer, Salman Habib","submitted_at":"2017-10-10T14:17:31Z","abstract_excerpt":"Spatially coupled low-density parity-check (SC-LDPC) codes are sparse graph codes that have recently become of interest due to their capacity-approaching performance on memoryless binary input channels. In this paper, we unify all existing SC-LDPC code construction methods under a new generalized description of SC-LDPC codes based on algebraic lifts of graphs. We present an improved low-complexity counting method for the special case of $(3,3)$-absorbing sets for array-based SC-LDPC codes, which we then use to optimize permutation assignments in SC-LDPC code construction. We show that codes co"},"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":"1710.03619","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-10T14:17:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"de6a0fedac99f7f8a7e9b44ec80f116c2f2cc483fb419c220877a2520d218e70","abstract_canon_sha256":"01ee79a279ba4a523b1cdb71c94af9f71eed3e6c2c7913cf81049db2655722c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:11.188511Z","signature_b64":"pOj65D+lJ66Wd+/sMtOEj2uFYY4yqnByFACbDf41sbDUDuYDmG6FJv+/zmG2XYJtTKQUnZsGGlak1lk/iYROAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f256f1c49ab800b117cd9756e877e0d367b20507474610fe3754151a46fac108","last_reissued_at":"2026-05-18T00:33:11.187730Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:11.187730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Generalized Algebraic Approach to Optimizing SC-LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Allison Beemer, Christine A. Kelley, Joerg Kliewer, Salman Habib","submitted_at":"2017-10-10T14:17:31Z","abstract_excerpt":"Spatially coupled low-density parity-check (SC-LDPC) codes are sparse graph codes that have recently become of interest due to their capacity-approaching performance on memoryless binary input channels. In this paper, we unify all existing SC-LDPC code construction methods under a new generalized description of SC-LDPC codes based on algebraic lifts of graphs. We present an improved low-complexity counting method for the special case of $(3,3)$-absorbing sets for array-based SC-LDPC codes, which we then use to optimize permutation assignments in SC-LDPC code construction. We show that codes co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03619","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":"1710.03619","created_at":"2026-05-18T00:33:11.187864+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.03619v1","created_at":"2026-05-18T00:33:11.187864+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03619","created_at":"2026-05-18T00:33:11.187864+00:00"},{"alias_kind":"pith_short_12","alias_value":"6JLPDRE2XAAL","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6JLPDRE2XAALCF6N","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6JLPDRE2","created_at":"2026-05-18T12:31:03.183658+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/6JLPDRE2XAALCF6NS5LOQ57A2N","json":"https://pith.science/pith/6JLPDRE2XAALCF6NS5LOQ57A2N.json","graph_json":"https://pith.science/api/pith-number/6JLPDRE2XAALCF6NS5LOQ57A2N/graph.json","events_json":"https://pith.science/api/pith-number/6JLPDRE2XAALCF6NS5LOQ57A2N/events.json","paper":"https://pith.science/paper/6JLPDRE2"},"agent_actions":{"view_html":"https://pith.science/pith/6JLPDRE2XAALCF6NS5LOQ57A2N","download_json":"https://pith.science/pith/6JLPDRE2XAALCF6NS5LOQ57A2N.json","view_paper":"https://pith.science/paper/6JLPDRE2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.03619&json=true","fetch_graph":"https://pith.science/api/pith-number/6JLPDRE2XAALCF6NS5LOQ57A2N/graph.json","fetch_events":"https://pith.science/api/pith-number/6JLPDRE2XAALCF6NS5LOQ57A2N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6JLPDRE2XAALCF6NS5LOQ57A2N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6JLPDRE2XAALCF6NS5LOQ57A2N/action/storage_attestation","attest_author":"https://pith.science/pith/6JLPDRE2XAALCF6NS5LOQ57A2N/action/author_attestation","sign_citation":"https://pith.science/pith/6JLPDRE2XAALCF6NS5LOQ57A2N/action/citation_signature","submit_replication":"https://pith.science/pith/6JLPDRE2XAALCF6NS5LOQ57A2N/action/replication_record"}},"created_at":"2026-05-18T00:33:11.187864+00:00","updated_at":"2026-05-18T00:33:11.187864+00:00"}