{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:M74TAT3OSS2T7WTSVSVSXKPNF4","short_pith_number":"pith:M74TAT3O","schema_version":"1.0","canonical_sha256":"67f9304f6e94b53fda72acab2ba9ed2f3d998ecacdaf3572deb6bdcaa896716f","source":{"kind":"arxiv","id":"1801.06328","version":1},"attestation_state":"computed","paper":{"title":"Asymptotic Analysis on Spatial Coupling Coding for Two-Way Relay Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Masahito Hayashi, Satoshi Takabe, Tadashi Wadayama, Yuta Ishimatsu","submitted_at":"2018-01-19T07:59:18Z","abstract_excerpt":"Compute-and-forward relaying is effective to increase bandwidth efficiency of wireless two-way relay channels. In a compute-and-forward scheme, a relay tries to decode a linear combination composed of transmitted messages from other terminals or relays. Design for error correcting codes and its decoding algorithms suitable for compute-and-forward relaying schemes are still important issue to be studied. In this paper, we will present an asymptotic performance analysis on LDPC codes over two-way relay channels based on density evolution (DE). Because of the asymmetric nature of the channel, we "},"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":"1801.06328","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-19T07:59:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f5c68f15c1e632ffc5202f41c0779d3dc7875f7cbd6f3b40e7ffcc5aaa6381e2","abstract_canon_sha256":"5224f8d55f68c94e30ede39b718bd2ca40eeb96e954db5bb483a5bfc78718433"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:30.492450Z","signature_b64":"AMCL9/zK1gLF08mcn8iWafCVXeWnJK87+RsDmYt8YE8QfiA0kDOxtAsv46R2VI4hfJIWN27/dXqjB4jbp0NZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67f9304f6e94b53fda72acab2ba9ed2f3d998ecacdaf3572deb6bdcaa896716f","last_reissued_at":"2026-05-18T00:25:30.491849Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:30.491849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic Analysis on Spatial Coupling Coding for Two-Way Relay Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Masahito Hayashi, Satoshi Takabe, Tadashi Wadayama, Yuta Ishimatsu","submitted_at":"2018-01-19T07:59:18Z","abstract_excerpt":"Compute-and-forward relaying is effective to increase bandwidth efficiency of wireless two-way relay channels. In a compute-and-forward scheme, a relay tries to decode a linear combination composed of transmitted messages from other terminals or relays. Design for error correcting codes and its decoding algorithms suitable for compute-and-forward relaying schemes are still important issue to be studied. In this paper, we will present an asymptotic performance analysis on LDPC codes over two-way relay channels based on density evolution (DE). Because of the asymmetric nature of the channel, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06328","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":"1801.06328","created_at":"2026-05-18T00:25:30.491959+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.06328v1","created_at":"2026-05-18T00:25:30.491959+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06328","created_at":"2026-05-18T00:25:30.491959+00:00"},{"alias_kind":"pith_short_12","alias_value":"M74TAT3OSS2T","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"M74TAT3OSS2T7WTS","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"M74TAT3O","created_at":"2026-05-18T12:32:37.024351+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/M74TAT3OSS2T7WTSVSVSXKPNF4","json":"https://pith.science/pith/M74TAT3OSS2T7WTSVSVSXKPNF4.json","graph_json":"https://pith.science/api/pith-number/M74TAT3OSS2T7WTSVSVSXKPNF4/graph.json","events_json":"https://pith.science/api/pith-number/M74TAT3OSS2T7WTSVSVSXKPNF4/events.json","paper":"https://pith.science/paper/M74TAT3O"},"agent_actions":{"view_html":"https://pith.science/pith/M74TAT3OSS2T7WTSVSVSXKPNF4","download_json":"https://pith.science/pith/M74TAT3OSS2T7WTSVSVSXKPNF4.json","view_paper":"https://pith.science/paper/M74TAT3O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.06328&json=true","fetch_graph":"https://pith.science/api/pith-number/M74TAT3OSS2T7WTSVSVSXKPNF4/graph.json","fetch_events":"https://pith.science/api/pith-number/M74TAT3OSS2T7WTSVSVSXKPNF4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M74TAT3OSS2T7WTSVSVSXKPNF4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M74TAT3OSS2T7WTSVSVSXKPNF4/action/storage_attestation","attest_author":"https://pith.science/pith/M74TAT3OSS2T7WTSVSVSXKPNF4/action/author_attestation","sign_citation":"https://pith.science/pith/M74TAT3OSS2T7WTSVSVSXKPNF4/action/citation_signature","submit_replication":"https://pith.science/pith/M74TAT3OSS2T7WTSVSVSXKPNF4/action/replication_record"}},"created_at":"2026-05-18T00:25:30.491959+00:00","updated_at":"2026-05-18T00:25:30.491959+00:00"}