{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VC5Y5VT5WPL53KA5ZK76I3WYS2","short_pith_number":"pith:VC5Y5VT5","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"},"canonical_sha256":"a8bb8ed67db3d7dda81dcabfe46ed8969218da060e31513a14897b452e65d69a","source":{"kind":"arxiv","id":"1306.6056","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.6056","created_at":"2026-05-18T03:19:57Z"},{"alias_kind":"arxiv_version","alias_value":"1306.6056v1","created_at":"2026-05-18T03:19:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.6056","created_at":"2026-05-18T03:19:57Z"},{"alias_kind":"pith_short_12","alias_value":"VC5Y5VT5WPL5","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VC5Y5VT5WPL53KA5","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VC5Y5VT5","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VC5Y5VT5WPL53KA5ZK76I3WYS2","target":"record","payload":{"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"},"canonical_sha256":"a8bb8ed67db3d7dda81dcabfe46ed8969218da060e31513a14897b452e65d69a","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"},"source_kind":"arxiv","source_id":"1306.6056","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:19:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"upDsFLFTUqPbbKLkg6spMtAU3KMre4ZRSSuLamKsYUTHN+Lld2IabJUG7H7za2allLS5jovDBajsKuUoBdfpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:38:47.944819Z"},"content_sha256":"5c5c3b1d4a5e2f197beb0cbe75e4f9e8b44ba737ea2fe3c846614fcf0a035bbe","schema_version":"1.0","event_id":"sha256:5c5c3b1d4a5e2f197beb0cbe75e4f9e8b44ba737ea2fe3c846614fcf0a035bbe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VC5Y5VT5WPL53KA5ZK76I3WYS2","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:19:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cP+WTrhSlGL3lb1OgW0JhqNtaDrMlDkRmyzoAwjo7mNkU/eE+uhgpqV2rUo3LVrPLr980rQzVcGsOco81cR1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:38:47.945176Z"},"content_sha256":"be4d0d68210d0a34739ae80c23f2b473c3b532514d3546c8ab539d6c6289c780","schema_version":"1.0","event_id":"sha256:be4d0d68210d0a34739ae80c23f2b473c3b532514d3546c8ab539d6c6289c780"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VC5Y5VT5WPL53KA5ZK76I3WYS2/bundle.json","state_url":"https://pith.science/pith/VC5Y5VT5WPL53KA5ZK76I3WYS2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VC5Y5VT5WPL53KA5ZK76I3WYS2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T08:38:47Z","links":{"resolver":"https://pith.science/pith/VC5Y5VT5WPL53KA5ZK76I3WYS2","bundle":"https://pith.science/pith/VC5Y5VT5WPL53KA5ZK76I3WYS2/bundle.json","state":"https://pith.science/pith/VC5Y5VT5WPL53KA5ZK76I3WYS2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VC5Y5VT5WPL53KA5ZK76I3WYS2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VC5Y5VT5WPL53KA5ZK76I3WYS2","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":"0ff7f6083e1821dcd5524473104bc150aba7020b33e89aefcb4bd87ed1369134","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-25T18:36:32Z","title_canon_sha256":"6debace6fb75a429b7d898cd6bb1a9618cc3e7ed9d7d9667044b8d5a876c87f8"},"schema_version":"1.0","source":{"id":"1306.6056","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.6056","created_at":"2026-05-18T03:19:57Z"},{"alias_kind":"arxiv_version","alias_value":"1306.6056v1","created_at":"2026-05-18T03:19:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.6056","created_at":"2026-05-18T03:19:57Z"},{"alias_kind":"pith_short_12","alias_value":"VC5Y5VT5WPL5","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VC5Y5VT5WPL53KA5","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VC5Y5VT5","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:be4d0d68210d0a34739ae80c23f2b473c3b532514d3546c8ab539d6c6289c780","target":"graph","created_at":"2026-05-18T03:19:57Z","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":"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","authors_text":"Aria Nosratinia, Dariush Divsalar, Thuy Van Nguyen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-25T18:36:32Z","title":"Rate-Compatible Protograph-based LDPC Codes for Inter-Symbol Interference Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.6056","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:5c5c3b1d4a5e2f197beb0cbe75e4f9e8b44ba737ea2fe3c846614fcf0a035bbe","target":"record","created_at":"2026-05-18T03:19:57Z","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":"0ff7f6083e1821dcd5524473104bc150aba7020b33e89aefcb4bd87ed1369134","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-25T18:36:32Z","title_canon_sha256":"6debace6fb75a429b7d898cd6bb1a9618cc3e7ed9d7d9667044b8d5a876c87f8"},"schema_version":"1.0","source":{"id":"1306.6056","kind":"arxiv","version":1}},"canonical_sha256":"a8bb8ed67db3d7dda81dcabfe46ed8969218da060e31513a14897b452e65d69a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8bb8ed67db3d7dda81dcabfe46ed8969218da060e31513a14897b452e65d69a","first_computed_at":"2026-05-18T03:19:57.898645Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:19:57.898645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hNBaAN0Z9jkI+kEOlCaD0Bfp9djNXiPEHQbrMu4WwViAWKmwAAt3TA1zYm2y4wR1uXf9FRUPKcA8xdith+r1AA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:19:57.899298Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.6056","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c5c3b1d4a5e2f197beb0cbe75e4f9e8b44ba737ea2fe3c846614fcf0a035bbe","sha256:be4d0d68210d0a34739ae80c23f2b473c3b532514d3546c8ab539d6c6289c780"],"state_sha256":"682a742ad7a482cf0ad1155b5df24f2439c66bcbc3435da9221a79361df438d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ul+TZAdsxU/uI9qKkXxbD3p2keOVlsN+8ZC0DAi/MtGhyLYKtwp2Kk5qEAgdIcuOoXj+YcPkLzdn4YbEx7sCCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:38:47.947262Z","bundle_sha256":"1c7e29fea95f1c60627b0b30ffe526c2b89fbfed0cb7fd6e36510329c815a651"}}