{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:PRZZOCPX4YLOUEVDLGUFC77RJH","short_pith_number":"pith:PRZZOCPX","schema_version":"1.0","canonical_sha256":"7c739709f7e616ea12a359a8517ff149c47e60b44bc0d9665695cf9daf8924f7","source":{"kind":"arxiv","id":"1102.5204","version":1},"attestation_state":"computed","paper":{"title":"Bilayer LDPC Convolutional Codes for Half-Duplex Relay Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mikael Skoglund, Ragnar Thobaben, Zhongwei Si","submitted_at":"2011-02-25T10:29:20Z","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"},"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":"1102.5204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-25T10:29:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"674d5c61bfe4e5cb2251241eb459bfd290f4d90943cb94917f55ea1223fbf0de","abstract_canon_sha256":"6216b7bd19350e9ba2b5fef295b6cc17ed642a64abba4048813fa0f9678aaa2d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:56.002025Z","signature_b64":"XIKkPIJ0Y5Or61EeVJ5RxKra+BRqSOBZjr9qdAtOW+7oiuVL20kMHxV/15RWTDv6/6jXFxTDxLQA/K7tPYyODQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c739709f7e616ea12a359a8517ff149c47e60b44bc0d9665695cf9daf8924f7","last_reissued_at":"2026-05-18T04:27:56.001512Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:56.001512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bilayer LDPC Convolutional Codes for Half-Duplex Relay Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mikael Skoglund, Ragnar Thobaben, Zhongwei Si","submitted_at":"2011-02-25T10:29:20Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5204","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":"1102.5204","created_at":"2026-05-18T04:27:56.001608+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.5204v1","created_at":"2026-05-18T04:27:56.001608+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5204","created_at":"2026-05-18T04:27:56.001608+00:00"},{"alias_kind":"pith_short_12","alias_value":"PRZZOCPX4YLO","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"PRZZOCPX4YLOUEVD","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"PRZZOCPX","created_at":"2026-05-18T12:26:39.201973+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/PRZZOCPX4YLOUEVDLGUFC77RJH","json":"https://pith.science/pith/PRZZOCPX4YLOUEVDLGUFC77RJH.json","graph_json":"https://pith.science/api/pith-number/PRZZOCPX4YLOUEVDLGUFC77RJH/graph.json","events_json":"https://pith.science/api/pith-number/PRZZOCPX4YLOUEVDLGUFC77RJH/events.json","paper":"https://pith.science/paper/PRZZOCPX"},"agent_actions":{"view_html":"https://pith.science/pith/PRZZOCPX4YLOUEVDLGUFC77RJH","download_json":"https://pith.science/pith/PRZZOCPX4YLOUEVDLGUFC77RJH.json","view_paper":"https://pith.science/paper/PRZZOCPX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.5204&json=true","fetch_graph":"https://pith.science/api/pith-number/PRZZOCPX4YLOUEVDLGUFC77RJH/graph.json","fetch_events":"https://pith.science/api/pith-number/PRZZOCPX4YLOUEVDLGUFC77RJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PRZZOCPX4YLOUEVDLGUFC77RJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PRZZOCPX4YLOUEVDLGUFC77RJH/action/storage_attestation","attest_author":"https://pith.science/pith/PRZZOCPX4YLOUEVDLGUFC77RJH/action/author_attestation","sign_citation":"https://pith.science/pith/PRZZOCPX4YLOUEVDLGUFC77RJH/action/citation_signature","submit_replication":"https://pith.science/pith/PRZZOCPX4YLOUEVDLGUFC77RJH/action/replication_record"}},"created_at":"2026-05-18T04:27:56.001608+00:00","updated_at":"2026-05-18T04:27:56.001608+00:00"}