{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VC5Y5VT5WPL53KA5ZK76I3WYS2","short_pith_number":"pith:VC5Y5VT5","schema_version":"1.0","canonical_sha256":"a8bb8ed67db3d7dda81dcabfe46ed8969218da060e31513a14897b452e65d69a","source":{"kind":"arxiv","id":"1306.6056","version":1},"attestation_state":"computed","paper":{"title":"Rate-Compatible Protograph-based LDPC Codes for Inter-Symbol Interference Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aria Nosratinia, Dariush Divsalar, Thuy Van Nguyen","submitted_at":"2013-06-25T18:36:32Z","abstract_excerpt":"This letter produces a family of rate-compatible protograph-based LDPC codes approaching the independent and uniformly distributed (i.u.d.) capacity of inter-symbol interference (ISI) channels. This problem is highly nontrivial due to the joint design of structured (protograph-based) LDPC codes and the state structure of ISI channels. We describe a method to design nested high-rate protograph codes by adding variable nodes to the protograph of a lower rate code. We then design a family of rate-compatible protograph codes using the extension method. The resulting protograph codes have iterative"},"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":"1306.6056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-25T18:36:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6debace6fb75a429b7d898cd6bb1a9618cc3e7ed9d7d9667044b8d5a876c87f8","abstract_canon_sha256":"0ff7f6083e1821dcd5524473104bc150aba7020b33e89aefcb4bd87ed1369134"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:57.899298Z","signature_b64":"hNBaAN0Z9jkI+kEOlCaD0Bfp9djNXiPEHQbrMu4WwViAWKmwAAt3TA1zYm2y4wR1uXf9FRUPKcA8xdith+r1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8bb8ed67db3d7dda81dcabfe46ed8969218da060e31513a14897b452e65d69a","last_reissued_at":"2026-05-18T03:19:57.898645Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:57.898645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rate-Compatible Protograph-based LDPC Codes for Inter-Symbol Interference Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aria Nosratinia, Dariush Divsalar, Thuy Van Nguyen","submitted_at":"2013-06-25T18:36:32Z","abstract_excerpt":"This letter produces a family of rate-compatible protograph-based LDPC codes approaching the independent and uniformly distributed (i.u.d.) capacity of inter-symbol interference (ISI) channels. This problem is highly nontrivial due to the joint design of structured (protograph-based) LDPC codes and the state structure of ISI channels. We describe a method to design nested high-rate protograph codes by adding variable nodes to the protograph of a lower rate code. We then design a family of rate-compatible protograph codes using the extension method. The resulting protograph codes have iterative"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.6056","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":"1306.6056","created_at":"2026-05-18T03:19:57.898757+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.6056v1","created_at":"2026-05-18T03:19:57.898757+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.6056","created_at":"2026-05-18T03:19:57.898757+00:00"},{"alias_kind":"pith_short_12","alias_value":"VC5Y5VT5WPL5","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VC5Y5VT5WPL53KA5","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VC5Y5VT5","created_at":"2026-05-18T12:28:04.890932+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/VC5Y5VT5WPL53KA5ZK76I3WYS2","json":"https://pith.science/pith/VC5Y5VT5WPL53KA5ZK76I3WYS2.json","graph_json":"https://pith.science/api/pith-number/VC5Y5VT5WPL53KA5ZK76I3WYS2/graph.json","events_json":"https://pith.science/api/pith-number/VC5Y5VT5WPL53KA5ZK76I3WYS2/events.json","paper":"https://pith.science/paper/VC5Y5VT5"},"agent_actions":{"view_html":"https://pith.science/pith/VC5Y5VT5WPL53KA5ZK76I3WYS2","download_json":"https://pith.science/pith/VC5Y5VT5WPL53KA5ZK76I3WYS2.json","view_paper":"https://pith.science/paper/VC5Y5VT5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.6056&json=true","fetch_graph":"https://pith.science/api/pith-number/VC5Y5VT5WPL53KA5ZK76I3WYS2/graph.json","fetch_events":"https://pith.science/api/pith-number/VC5Y5VT5WPL53KA5ZK76I3WYS2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VC5Y5VT5WPL53KA5ZK76I3WYS2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VC5Y5VT5WPL53KA5ZK76I3WYS2/action/storage_attestation","attest_author":"https://pith.science/pith/VC5Y5VT5WPL53KA5ZK76I3WYS2/action/author_attestation","sign_citation":"https://pith.science/pith/VC5Y5VT5WPL53KA5ZK76I3WYS2/action/citation_signature","submit_replication":"https://pith.science/pith/VC5Y5VT5WPL53KA5ZK76I3WYS2/action/replication_record"}},"created_at":"2026-05-18T03:19:57.898757+00:00","updated_at":"2026-05-18T03:19:57.898757+00:00"}