{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6JLPDRE2XAALCF6NS5LOQ57A2N","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":"01ee79a279ba4a523b1cdb71c94af9f71eed3e6c2c7913cf81049db2655722c6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-10T14:17:31Z","title_canon_sha256":"de6a0fedac99f7f8a7e9b44ec80f116c2f2cc483fb419c220877a2520d218e70"},"schema_version":"1.0","source":{"id":"1710.03619","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03619","created_at":"2026-05-18T00:33:11Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03619v1","created_at":"2026-05-18T00:33:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03619","created_at":"2026-05-18T00:33:11Z"},{"alias_kind":"pith_short_12","alias_value":"6JLPDRE2XAAL","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6JLPDRE2XAALCF6N","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6JLPDRE2","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:2ed860499e00e0ba110ab254a8832e8a6d47f88c3bab02e92f278f281ba39ebe","target":"graph","created_at":"2026-05-18T00:33:11Z","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":"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","authors_text":"Allison Beemer, Christine A. Kelley, Joerg Kliewer, Salman Habib","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-10T14:17:31Z","title":"A Generalized Algebraic Approach to Optimizing SC-LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03619","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:170af3703b7237fc65a73b47eb91cbe73c9a98fd8d5c589dc8bc7b8875334c96","target":"record","created_at":"2026-05-18T00:33:11Z","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":"01ee79a279ba4a523b1cdb71c94af9f71eed3e6c2c7913cf81049db2655722c6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-10T14:17:31Z","title_canon_sha256":"de6a0fedac99f7f8a7e9b44ec80f116c2f2cc483fb419c220877a2520d218e70"},"schema_version":"1.0","source":{"id":"1710.03619","kind":"arxiv","version":1}},"canonical_sha256":"f256f1c49ab800b117cd9756e877e0d367b20507474610fe3754151a46fac108","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f256f1c49ab800b117cd9756e877e0d367b20507474610fe3754151a46fac108","first_computed_at":"2026-05-18T00:33:11.187730Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:11.187730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pOj65D+lJ66Wd+/sMtOEj2uFYY4yqnByFACbDf41sbDUDuYDmG6FJv+/zmG2XYJtTKQUnZsGGlak1lk/iYROAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:11.188511Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.03619","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:170af3703b7237fc65a73b47eb91cbe73c9a98fd8d5c589dc8bc7b8875334c96","sha256:2ed860499e00e0ba110ab254a8832e8a6d47f88c3bab02e92f278f281ba39ebe"],"state_sha256":"f89b8112888c5837e3834bb769c0a1fe7e910eeca354ed50a8625bf20f074c5d"}