{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:M74TAT3OSS2T7WTSVSVSXKPNF4","short_pith_number":"pith:M74TAT3O","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"},"canonical_sha256":"67f9304f6e94b53fda72acab2ba9ed2f3d998ecacdaf3572deb6bdcaa896716f","source":{"kind":"arxiv","id":"1801.06328","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.06328","created_at":"2026-05-18T00:25:30Z"},{"alias_kind":"arxiv_version","alias_value":"1801.06328v1","created_at":"2026-05-18T00:25:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06328","created_at":"2026-05-18T00:25:30Z"},{"alias_kind":"pith_short_12","alias_value":"M74TAT3OSS2T","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"M74TAT3OSS2T7WTS","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"M74TAT3O","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:M74TAT3OSS2T7WTSVSVSXKPNF4","target":"record","payload":{"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"},"canonical_sha256":"67f9304f6e94b53fda72acab2ba9ed2f3d998ecacdaf3572deb6bdcaa896716f","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"},"source_kind":"arxiv","source_id":"1801.06328","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:25:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MqoeAcvBKJhf4SVveQ5xhMa31eeW+T4ibGRTW4lFvuTLB/AI2W/OIUYQHrVtVBxOvDCxT/vNkD5SIlTUS5yoCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:07:17.054449Z"},"content_sha256":"787ce57762f1323be7ae887c96ec3b10529128b528c89f59cb7d145b2111e8df","schema_version":"1.0","event_id":"sha256:787ce57762f1323be7ae887c96ec3b10529128b528c89f59cb7d145b2111e8df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:M74TAT3OSS2T7WTSVSVSXKPNF4","target":"graph","payload":{"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"},"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:25:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2FdicnoLg0FBBC8oEL9kuSL0VUsU/eUZO3+tau2xNpaLKTNOhVqQZGq0J0NZbojytLm9bnQq0F4jLgGB2llQCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:07:17.054843Z"},"content_sha256":"80cd152232c4c06749f17a189f191d44d926acd359478ce4f9cb762da14e423a","schema_version":"1.0","event_id":"sha256:80cd152232c4c06749f17a189f191d44d926acd359478ce4f9cb762da14e423a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M74TAT3OSS2T7WTSVSVSXKPNF4/bundle.json","state_url":"https://pith.science/pith/M74TAT3OSS2T7WTSVSVSXKPNF4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M74TAT3OSS2T7WTSVSVSXKPNF4/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-02T13:07:17Z","links":{"resolver":"https://pith.science/pith/M74TAT3OSS2T7WTSVSVSXKPNF4","bundle":"https://pith.science/pith/M74TAT3OSS2T7WTSVSVSXKPNF4/bundle.json","state":"https://pith.science/pith/M74TAT3OSS2T7WTSVSVSXKPNF4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M74TAT3OSS2T7WTSVSVSXKPNF4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:M74TAT3OSS2T7WTSVSVSXKPNF4","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":"5224f8d55f68c94e30ede39b718bd2ca40eeb96e954db5bb483a5bfc78718433","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-19T07:59:18Z","title_canon_sha256":"f5c68f15c1e632ffc5202f41c0779d3dc7875f7cbd6f3b40e7ffcc5aaa6381e2"},"schema_version":"1.0","source":{"id":"1801.06328","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.06328","created_at":"2026-05-18T00:25:30Z"},{"alias_kind":"arxiv_version","alias_value":"1801.06328v1","created_at":"2026-05-18T00:25:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06328","created_at":"2026-05-18T00:25:30Z"},{"alias_kind":"pith_short_12","alias_value":"M74TAT3OSS2T","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"M74TAT3OSS2T7WTS","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"M74TAT3O","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:80cd152232c4c06749f17a189f191d44d926acd359478ce4f9cb762da14e423a","target":"graph","created_at":"2026-05-18T00:25:30Z","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 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 ","authors_text":"Masahito Hayashi, Satoshi Takabe, Tadashi Wadayama, Yuta Ishimatsu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-19T07:59:18Z","title":"Asymptotic Analysis on Spatial Coupling Coding for Two-Way Relay Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06328","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:787ce57762f1323be7ae887c96ec3b10529128b528c89f59cb7d145b2111e8df","target":"record","created_at":"2026-05-18T00:25:30Z","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":"5224f8d55f68c94e30ede39b718bd2ca40eeb96e954db5bb483a5bfc78718433","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-19T07:59:18Z","title_canon_sha256":"f5c68f15c1e632ffc5202f41c0779d3dc7875f7cbd6f3b40e7ffcc5aaa6381e2"},"schema_version":"1.0","source":{"id":"1801.06328","kind":"arxiv","version":1}},"canonical_sha256":"67f9304f6e94b53fda72acab2ba9ed2f3d998ecacdaf3572deb6bdcaa896716f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67f9304f6e94b53fda72acab2ba9ed2f3d998ecacdaf3572deb6bdcaa896716f","first_computed_at":"2026-05-18T00:25:30.491849Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:30.491849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AMCL9/zK1gLF08mcn8iWafCVXeWnJK87+RsDmYt8YE8QfiA0kDOxtAsv46R2VI4hfJIWN27/dXqjB4jbp0NZBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:30.492450Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.06328","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:787ce57762f1323be7ae887c96ec3b10529128b528c89f59cb7d145b2111e8df","sha256:80cd152232c4c06749f17a189f191d44d926acd359478ce4f9cb762da14e423a"],"state_sha256":"5aaa266142d65b10cb106b710e524632919615faf304a0327de26574d3dbb99d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X8zhUIDMsT3tQlTDJJ8V4iz07waGJOsJwrh1Yra5b+1yFiNQZ1vUj8MuPUPtO6WzYWAzOQLSLgHHwldR6MsyAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T13:07:17.056826Z","bundle_sha256":"c6520c117e4da80402c8bde831647e40365b59b93e4fd583e1d7eebad504959c"}}