{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MSYJPS2JBGWVQ5YC32E7LJXBRJ","short_pith_number":"pith:MSYJPS2J","canonical_record":{"source":{"id":"1807.01599","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-03T13:02:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"aac8e9e89296dd9b440b3985303f86776792417f6bc834f5538d97999b35cc1d","abstract_canon_sha256":"58d81792cb6c92408a4a8a5a83a8ff9ddc756c913c9ca3018835c717bbe1c9ff"},"schema_version":"1.0"},"canonical_sha256":"64b097cb4909ad587702de89f5a6e18a649746d78e9511a5f02755f8d23eaf08","source":{"kind":"arxiv","id":"1807.01599","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.01599","created_at":"2026-05-18T00:11:29Z"},{"alias_kind":"arxiv_version","alias_value":"1807.01599v1","created_at":"2026-05-18T00:11:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01599","created_at":"2026-05-18T00:11:29Z"},{"alias_kind":"pith_short_12","alias_value":"MSYJPS2JBGWV","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MSYJPS2JBGWVQ5YC","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MSYJPS2J","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MSYJPS2JBGWVQ5YC32E7LJXBRJ","target":"record","payload":{"canonical_record":{"source":{"id":"1807.01599","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-03T13:02:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"aac8e9e89296dd9b440b3985303f86776792417f6bc834f5538d97999b35cc1d","abstract_canon_sha256":"58d81792cb6c92408a4a8a5a83a8ff9ddc756c913c9ca3018835c717bbe1c9ff"},"schema_version":"1.0"},"canonical_sha256":"64b097cb4909ad587702de89f5a6e18a649746d78e9511a5f02755f8d23eaf08","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:29.364936Z","signature_b64":"dcW6bS56kaB65e2EZNYk/p7Y84kzQFs4p+Xi63qlNeZ56zobB6AqbkZ7IqbrQyFDxkGTogoG9DZlWWDKbL7SDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64b097cb4909ad587702de89f5a6e18a649746d78e9511a5f02755f8d23eaf08","last_reissued_at":"2026-05-18T00:11:29.364494Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:29.364494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.01599","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-18T00:11:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KU2jsUQWoorhc7pTKkFjf/dSAZyJM18FSh444qfXE4FwQxtV5PgieAedULVWiTP7uTAyur3EzvSKupIaUWjlCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:13:42.108487Z"},"content_sha256":"4181c26ee3e05f28ea93933f7681ee12532204be5ebe9717b43b8db92dee5e42","schema_version":"1.0","event_id":"sha256:4181c26ee3e05f28ea93933f7681ee12532204be5ebe9717b43b8db92dee5e42"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MSYJPS2JBGWVQ5YC32E7LJXBRJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotic Analysis of Spatial Coupling Coding for Compute-and-Forward Relaying","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","submitted_at":"2018-07-03T13:02:10Z","abstract_excerpt":"Compute-and-forward (CAF) relaying is effective to increase bandwidth efficiency of wireless two-way relay channels. In a CAF scheme, a relay is designed 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 CAF relaying schemes remain as an important issue to be studied. As described in this paper, we will present an asymptotic performance analysis of LDPC codes over two-way relay channels based on density evolution (DE). Because of the asymmetric characteristics of the channel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01599","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-18T00:11:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4VKhU8xDo8aoTRmOH6ud3ERn5k6PG7qK5eINTulVUTc84V8NbdeapNxdG6ZfUaORNJTC2j5U31wKWSSzF6G8Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:13:42.108837Z"},"content_sha256":"84fc164c84144b9ce95b89e0c6f5a4ec2f40c611ef0cd33be89e7340682ecfaa","schema_version":"1.0","event_id":"sha256:84fc164c84144b9ce95b89e0c6f5a4ec2f40c611ef0cd33be89e7340682ecfaa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MSYJPS2JBGWVQ5YC32E7LJXBRJ/bundle.json","state_url":"https://pith.science/pith/MSYJPS2JBGWVQ5YC32E7LJXBRJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MSYJPS2JBGWVQ5YC32E7LJXBRJ/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-06-02T23:13:42Z","links":{"resolver":"https://pith.science/pith/MSYJPS2JBGWVQ5YC32E7LJXBRJ","bundle":"https://pith.science/pith/MSYJPS2JBGWVQ5YC32E7LJXBRJ/bundle.json","state":"https://pith.science/pith/MSYJPS2JBGWVQ5YC32E7LJXBRJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MSYJPS2JBGWVQ5YC32E7LJXBRJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MSYJPS2JBGWVQ5YC32E7LJXBRJ","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":"58d81792cb6c92408a4a8a5a83a8ff9ddc756c913c9ca3018835c717bbe1c9ff","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-03T13:02:10Z","title_canon_sha256":"aac8e9e89296dd9b440b3985303f86776792417f6bc834f5538d97999b35cc1d"},"schema_version":"1.0","source":{"id":"1807.01599","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.01599","created_at":"2026-05-18T00:11:29Z"},{"alias_kind":"arxiv_version","alias_value":"1807.01599v1","created_at":"2026-05-18T00:11:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01599","created_at":"2026-05-18T00:11:29Z"},{"alias_kind":"pith_short_12","alias_value":"MSYJPS2JBGWV","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MSYJPS2JBGWVQ5YC","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MSYJPS2J","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:84fc164c84144b9ce95b89e0c6f5a4ec2f40c611ef0cd33be89e7340682ecfaa","target":"graph","created_at":"2026-05-18T00:11:29Z","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":"Compute-and-forward (CAF) relaying is effective to increase bandwidth efficiency of wireless two-way relay channels. In a CAF scheme, a relay is designed 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 CAF relaying schemes remain as an important issue to be studied. As described in this paper, we will present an asymptotic performance analysis of LDPC codes over two-way relay channels based on density evolution (DE). Because of the asymmetric characteristics of the channel","authors_text":"Masahito Hayashi, Satoshi Takabe, Tadashi Wadayama","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-03T13:02:10Z","title":"Asymptotic Analysis of Spatial Coupling Coding for Compute-and-Forward Relaying"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01599","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:4181c26ee3e05f28ea93933f7681ee12532204be5ebe9717b43b8db92dee5e42","target":"record","created_at":"2026-05-18T00:11:29Z","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":"58d81792cb6c92408a4a8a5a83a8ff9ddc756c913c9ca3018835c717bbe1c9ff","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-03T13:02:10Z","title_canon_sha256":"aac8e9e89296dd9b440b3985303f86776792417f6bc834f5538d97999b35cc1d"},"schema_version":"1.0","source":{"id":"1807.01599","kind":"arxiv","version":1}},"canonical_sha256":"64b097cb4909ad587702de89f5a6e18a649746d78e9511a5f02755f8d23eaf08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64b097cb4909ad587702de89f5a6e18a649746d78e9511a5f02755f8d23eaf08","first_computed_at":"2026-05-18T00:11:29.364494Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:29.364494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dcW6bS56kaB65e2EZNYk/p7Y84kzQFs4p+Xi63qlNeZ56zobB6AqbkZ7IqbrQyFDxkGTogoG9DZlWWDKbL7SDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:29.364936Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.01599","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4181c26ee3e05f28ea93933f7681ee12532204be5ebe9717b43b8db92dee5e42","sha256:84fc164c84144b9ce95b89e0c6f5a4ec2f40c611ef0cd33be89e7340682ecfaa"],"state_sha256":"c85e2dac569236652c8590f54bf6d70269fce84036d9a2e81b9e0c4b01a21228"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SZwGIwajTP+zdBav3PZ/6Be1OMYQrG+Mc8CR/3A0w4tqiUYlqND33bwhavSUgb6TbgvqZSaiwPsREjo2cgEdAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T23:13:42.110968Z","bundle_sha256":"b9b77a1a3feeacd4d1ddf7b650ae18195a56adfef19d809b9712867466318348"}}