{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:AJEL6SU76MJSPRWNVJL5WM6HLZ","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":"1e0fa2824c88c4beea0abfa0b70b790842f7890b4bc170d1b779db3d614378af","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2006-09-05T19:34:55Z","title_canon_sha256":"855dcf1819a9301e97fef20bee7eaa01d63fda36baa34f4f271b13043986f216"},"schema_version":"1.0","source":{"id":"cs/0609018","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0609018","created_at":"2026-05-18T00:58:08Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0609018v1","created_at":"2026-05-18T00:58:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0609018","created_at":"2026-05-18T00:58:08Z"},{"alias_kind":"pith_short_12","alias_value":"AJEL6SU76MJS","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"AJEL6SU76MJSPRWN","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"AJEL6SU7","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:8a14502143bf3d17dd26d3839e0ab99ab306d0fe27b22412432a4e209a74af6f","target":"graph","created_at":"2026-05-18T00:58:08Z","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 paper describes an efficient implementation of binning for the relay channel using low-density parity-check (LDPC) codes. We devise bilayer LDPC codes to approach the theoretically promised rate of the decode-and-forward relaying strategy by incorporating relay-generated information bits in specially designed bilayer graphical code structures. While conventional LDPC codes are sensitively tuned to operate efficiently at a certain channel parameter, the proposed bilayer LDPC codes are capable of working at two different channel parameters and two different rates: that at the relay and at t","authors_text":"Peyman Razaghi, Wei Yu","cross_cats":["math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2006-09-05T19:34:55Z","title":"Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0609018","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:5e2a4aacb5284f7ed6204637578580feec119dcc75d524818802e66cea43ef6c","target":"record","created_at":"2026-05-18T00:58:08Z","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":"1e0fa2824c88c4beea0abfa0b70b790842f7890b4bc170d1b779db3d614378af","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2006-09-05T19:34:55Z","title_canon_sha256":"855dcf1819a9301e97fef20bee7eaa01d63fda36baa34f4f271b13043986f216"},"schema_version":"1.0","source":{"id":"cs/0609018","kind":"arxiv","version":1}},"canonical_sha256":"0248bf4a9ff31327c6cdaa57db33c75e449c5f24e83959363826693be413915f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0248bf4a9ff31327c6cdaa57db33c75e449c5f24e83959363826693be413915f","first_computed_at":"2026-05-18T00:58:08.801300Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:08.801300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YfC+XzIg0BPaoVN+XFPg1nJLhea1osCfi1SFcQEok7Sj7ROV9Ls3uZM4xCKBn+Dhc4vhiU57qd8cbRPpd1XECw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:08.801972Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0609018","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e2a4aacb5284f7ed6204637578580feec119dcc75d524818802e66cea43ef6c","sha256:8a14502143bf3d17dd26d3839e0ab99ab306d0fe27b22412432a4e209a74af6f"],"state_sha256":"8d3feaaa5bbb6968303e7f4348599a06b8e129e72dae661e7ea5571880d9fb9e"}