{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RWKSGH5JCDVM5OFWC66D6X5XGF","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":"1343a68530e56f3526a47e5ed6d9a2aada5c65b659686d5ebecaf677e699eb1e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-21T14:56:03Z","title_canon_sha256":"56262a2ebb715fd09a30529fca96436c064e2b4ccd9fff66f834623e23592457"},"schema_version":"1.0","source":{"id":"1802.07598","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07598","created_at":"2026-05-18T00:20:02Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07598v2","created_at":"2026-05-18T00:20:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07598","created_at":"2026-05-18T00:20:02Z"},{"alias_kind":"pith_short_12","alias_value":"RWKSGH5JCDVM","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RWKSGH5JCDVM5OFW","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RWKSGH5J","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:6a6a53e92f799a5c6d352d45d581674cf16e96a5faa59fd8590e5a88c538f5a0","target":"graph","created_at":"2026-05-18T00:20:02Z","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":"In this paper, we propose a new design method of irregular spatially-coupled low-density parity-check (SC-LDPC) codes with non-uniform degree distributions by linear programming (LP). In general, irregular SC-LDPC codes with non-uniform degree distributions is difficult to design with low complexity because their density evolution equations are multi-dimensional. To solve the problem, the proposed method is based on two main ideas: A local design of the degree distributions and pre-computation of the input/output message relationship. These ideas make it possible to design the degree distribut","authors_text":"Heeyoul Kwak, Hosung Park, Jong-Seon No","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-21T14:56:03Z","title":"Design of Irregular SC-LDPC Codes With Non-Uniform Degree Distributions by Linear Programing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07598","kind":"arxiv","version":2},"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:f139eeca696ef19d61b2734f92a338d61fd27662d204b4b97eb54083ce43ca8c","target":"record","created_at":"2026-05-18T00:20:02Z","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":"1343a68530e56f3526a47e5ed6d9a2aada5c65b659686d5ebecaf677e699eb1e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-21T14:56:03Z","title_canon_sha256":"56262a2ebb715fd09a30529fca96436c064e2b4ccd9fff66f834623e23592457"},"schema_version":"1.0","source":{"id":"1802.07598","kind":"arxiv","version":2}},"canonical_sha256":"8d95231fa910eaceb8b617bc3f5fb73155522ae445cb7d75ab8d446517bfe275","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d95231fa910eaceb8b617bc3f5fb73155522ae445cb7d75ab8d446517bfe275","first_computed_at":"2026-05-18T00:20:02.028197Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:02.028197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7HvOBJ/BCTAciiYpQaXwg74llqtiElOR8S1JZMkLk9GddSkm7eVzvjh5tq3D/PrUH3wfnWs9pEr7WBpICn3xDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:02.028716Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.07598","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f139eeca696ef19d61b2734f92a338d61fd27662d204b4b97eb54083ce43ca8c","sha256:6a6a53e92f799a5c6d352d45d581674cf16e96a5faa59fd8590e5a88c538f5a0"],"state_sha256":"46d6fd84afa0153e2b3404de6c6bb7b3d20adbf1ac1e32c07ba0bc5a75170f74"}