{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UPKGSVL6C6XYKFTWVVY2LRVNV7","short_pith_number":"pith:UPKGSVL6","schema_version":"1.0","canonical_sha256":"a3d469557e17af851676ad71a5c6adaff636823ee857cc0b4d6a5d606becb3f6","source":{"kind":"arxiv","id":"1802.06481","version":1},"attestation_state":"computed","paper":{"title":"Finite-Length Construction of High Performance Spatially-Coupled Codes via Optimized Partitioning and Lifting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed Hareedy, Homa Esfahanizadeh, Lara Dolecek","submitted_at":"2018-02-19T01:30:33Z","abstract_excerpt":"Spatially-coupled (SC) codes are a family of graph-based codes that have attracted significant attention thanks to their capacity approaching performance and low decoding latency. An SC code is constructed by partitioning an underlying block code into a number of components and coupling their copies together. In this paper, we first introduce a general approach for the enumeration of detrimental combinatorial objects in the graph of finite-length SC codes. Our approach is general in the sense that it effectively works for SC codes with various column weights and memories. Next, we present a tw"},"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":"1802.06481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-19T01:30:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"304c69278a938ca068f52f563178affa72319326bcf8e37c3eb82a487fc37636","abstract_canon_sha256":"bf4196cf82ae82497d18118206808c0e57f2a0b93449b8a9091e09fbbfcc7224"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:03.159075Z","signature_b64":"d+A4CDaclPVPh1xsCvEZRYBpePzk3YyfoZoaR0w1sEfZMyFfqPcs0rtQ1ixTC77Liwa7gvmAQZDYEuSgP3iMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3d469557e17af851676ad71a5c6adaff636823ee857cc0b4d6a5d606becb3f6","last_reissued_at":"2026-05-18T00:23:03.158374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:03.158374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finite-Length Construction of High Performance Spatially-Coupled Codes via Optimized Partitioning and Lifting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed Hareedy, Homa Esfahanizadeh, Lara Dolecek","submitted_at":"2018-02-19T01:30:33Z","abstract_excerpt":"Spatially-coupled (SC) codes are a family of graph-based codes that have attracted significant attention thanks to their capacity approaching performance and low decoding latency. An SC code is constructed by partitioning an underlying block code into a number of components and coupling their copies together. In this paper, we first introduce a general approach for the enumeration of detrimental combinatorial objects in the graph of finite-length SC codes. Our approach is general in the sense that it effectively works for SC codes with various column weights and memories. Next, we present a tw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06481","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":"1802.06481","created_at":"2026-05-18T00:23:03.158490+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.06481v1","created_at":"2026-05-18T00:23:03.158490+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06481","created_at":"2026-05-18T00:23:03.158490+00:00"},{"alias_kind":"pith_short_12","alias_value":"UPKGSVL6C6XY","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UPKGSVL6C6XYKFTW","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UPKGSVL6","created_at":"2026-05-18T12:32:56.356000+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/UPKGSVL6C6XYKFTWVVY2LRVNV7","json":"https://pith.science/pith/UPKGSVL6C6XYKFTWVVY2LRVNV7.json","graph_json":"https://pith.science/api/pith-number/UPKGSVL6C6XYKFTWVVY2LRVNV7/graph.json","events_json":"https://pith.science/api/pith-number/UPKGSVL6C6XYKFTWVVY2LRVNV7/events.json","paper":"https://pith.science/paper/UPKGSVL6"},"agent_actions":{"view_html":"https://pith.science/pith/UPKGSVL6C6XYKFTWVVY2LRVNV7","download_json":"https://pith.science/pith/UPKGSVL6C6XYKFTWVVY2LRVNV7.json","view_paper":"https://pith.science/paper/UPKGSVL6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.06481&json=true","fetch_graph":"https://pith.science/api/pith-number/UPKGSVL6C6XYKFTWVVY2LRVNV7/graph.json","fetch_events":"https://pith.science/api/pith-number/UPKGSVL6C6XYKFTWVVY2LRVNV7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UPKGSVL6C6XYKFTWVVY2LRVNV7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UPKGSVL6C6XYKFTWVVY2LRVNV7/action/storage_attestation","attest_author":"https://pith.science/pith/UPKGSVL6C6XYKFTWVVY2LRVNV7/action/author_attestation","sign_citation":"https://pith.science/pith/UPKGSVL6C6XYKFTWVVY2LRVNV7/action/citation_signature","submit_replication":"https://pith.science/pith/UPKGSVL6C6XYKFTWVVY2LRVNV7/action/replication_record"}},"created_at":"2026-05-18T00:23:03.158490+00:00","updated_at":"2026-05-18T00:23:03.158490+00:00"}