{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:PRZZOCPX4YLOUEVDLGUFC77RJH","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":"6216b7bd19350e9ba2b5fef295b6cc17ed642a64abba4048813fa0f9678aaa2d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-25T10:29:20Z","title_canon_sha256":"674d5c61bfe4e5cb2251241eb459bfd290f4d90943cb94917f55ea1223fbf0de"},"schema_version":"1.0","source":{"id":"1102.5204","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.5204","created_at":"2026-05-18T04:27:56Z"},{"alias_kind":"arxiv_version","alias_value":"1102.5204v1","created_at":"2026-05-18T04:27:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5204","created_at":"2026-05-18T04:27:56Z"},{"alias_kind":"pith_short_12","alias_value":"PRZZOCPX4YLO","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PRZZOCPX4YLOUEVD","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PRZZOCPX","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:0553fe251f05416421db0f4bab672665892031a9c83c4f8c8c6b7e7284b6c4dc","target":"graph","created_at":"2026-05-18T04:27:56Z","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 present regular bilayer LDPC convolutional codes for half-duplex relay channels. For the binary erasure relay channel, we prove that the proposed code construction achieves the capacities for the source-relay link and the source-destination link provided that the channel conditions are known when designing the code. Meanwhile, this code enables the highest transmission rate with decode-and-forward relaying. In addition, its regular degree distributions can easily be computed from the channel parameters, which significantly simplifies the code optimization. Numerical results ar","authors_text":"Mikael Skoglund, Ragnar Thobaben, Zhongwei Si","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-25T10:29:20Z","title":"Bilayer LDPC Convolutional Codes for Half-Duplex Relay Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5204","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:6a20fc028676bbee0dd56161fba9c909abe8157037dea12770a452d1310e3007","target":"record","created_at":"2026-05-18T04:27:56Z","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":"6216b7bd19350e9ba2b5fef295b6cc17ed642a64abba4048813fa0f9678aaa2d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-25T10:29:20Z","title_canon_sha256":"674d5c61bfe4e5cb2251241eb459bfd290f4d90943cb94917f55ea1223fbf0de"},"schema_version":"1.0","source":{"id":"1102.5204","kind":"arxiv","version":1}},"canonical_sha256":"7c739709f7e616ea12a359a8517ff149c47e60b44bc0d9665695cf9daf8924f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c739709f7e616ea12a359a8517ff149c47e60b44bc0d9665695cf9daf8924f7","first_computed_at":"2026-05-18T04:27:56.001512Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:56.001512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XIKkPIJ0Y5Or61EeVJ5RxKra+BRqSOBZjr9qdAtOW+7oiuVL20kMHxV/15RWTDv6/6jXFxTDxLQA/K7tPYyODQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:56.002025Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.5204","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a20fc028676bbee0dd56161fba9c909abe8157037dea12770a452d1310e3007","sha256:0553fe251f05416421db0f4bab672665892031a9c83c4f8c8c6b7e7284b6c4dc"],"state_sha256":"4d93ddcdd904352459820d2e802edc634593ad87e57d4f4bc3325e72c3b1c201"}