{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:6T7DKYZMTTZYEEH5AKPZOYEMT4","short_pith_number":"pith:6T7DKYZM","schema_version":"1.0","canonical_sha256":"f4fe35632c9cf38210fd029f97608c9f16ccd37fb3d7a1edf1332b192c060736","source":{"kind":"arxiv","id":"1212.1198","version":1},"attestation_state":"computed","paper":{"title":"Lattice Coding for the Two-way Two-relay Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chiu Ngo, Huai-Rong Shao, Natasha Devroye, Yiwei Song","submitted_at":"2012-12-05T22:48:39Z","abstract_excerpt":"Lattice coding techniques may be used to derive achievable rate regions which outperform known independent, identically distributed (i.i.d.) random codes in multi-source relay networks and in particular the two-way relay channel. Gains stem from the ability to decode the sum of codewords (or messages) using lattice codes at higher rates than possible with i.i.d. random codes. Here we develop a novel lattice coding scheme for the Two-way Two-relay Channel: 1 <-> 2 <-> 3 <-> 4, where Node 1 and 4 simultaneously communicate with each other through two relay nodes 2 and 3. Each node only communica"},"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":"1212.1198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-05T22:48:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a3cb3aabd705ce45c23ea7a411e6ea78164cfaa4ecd2179430eceabbaded2359","abstract_canon_sha256":"cd06be3eb9228d77d544a83b42a6b41890cfbe13d3f8f9a7985f46182d283d07"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:42.758217Z","signature_b64":"JYG0JeBvqNsgSicPWk1YB3+SYlit3bVtFwS7m+cZ0TlXZlhXyfBWQ/lHfhBlke3drr+tAhG1pF7nt7ZhdUnvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4fe35632c9cf38210fd029f97608c9f16ccd37fb3d7a1edf1332b192c060736","last_reissued_at":"2026-05-18T00:58:42.757845Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:42.757845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lattice Coding for the Two-way Two-relay Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chiu Ngo, Huai-Rong Shao, Natasha Devroye, Yiwei Song","submitted_at":"2012-12-05T22:48:39Z","abstract_excerpt":"Lattice coding techniques may be used to derive achievable rate regions which outperform known independent, identically distributed (i.i.d.) random codes in multi-source relay networks and in particular the two-way relay channel. Gains stem from the ability to decode the sum of codewords (or messages) using lattice codes at higher rates than possible with i.i.d. random codes. Here we develop a novel lattice coding scheme for the Two-way Two-relay Channel: 1 <-> 2 <-> 3 <-> 4, where Node 1 and 4 simultaneously communicate with each other through two relay nodes 2 and 3. Each node only communica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1198","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":"1212.1198","created_at":"2026-05-18T00:58:42.757904+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.1198v1","created_at":"2026-05-18T00:58:42.757904+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1198","created_at":"2026-05-18T00:58:42.757904+00:00"},{"alias_kind":"pith_short_12","alias_value":"6T7DKYZMTTZY","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"6T7DKYZMTTZYEEH5","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"6T7DKYZM","created_at":"2026-05-18T12:26:56.085431+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/6T7DKYZMTTZYEEH5AKPZOYEMT4","json":"https://pith.science/pith/6T7DKYZMTTZYEEH5AKPZOYEMT4.json","graph_json":"https://pith.science/api/pith-number/6T7DKYZMTTZYEEH5AKPZOYEMT4/graph.json","events_json":"https://pith.science/api/pith-number/6T7DKYZMTTZYEEH5AKPZOYEMT4/events.json","paper":"https://pith.science/paper/6T7DKYZM"},"agent_actions":{"view_html":"https://pith.science/pith/6T7DKYZMTTZYEEH5AKPZOYEMT4","download_json":"https://pith.science/pith/6T7DKYZMTTZYEEH5AKPZOYEMT4.json","view_paper":"https://pith.science/paper/6T7DKYZM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.1198&json=true","fetch_graph":"https://pith.science/api/pith-number/6T7DKYZMTTZYEEH5AKPZOYEMT4/graph.json","fetch_events":"https://pith.science/api/pith-number/6T7DKYZMTTZYEEH5AKPZOYEMT4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6T7DKYZMTTZYEEH5AKPZOYEMT4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6T7DKYZMTTZYEEH5AKPZOYEMT4/action/storage_attestation","attest_author":"https://pith.science/pith/6T7DKYZMTTZYEEH5AKPZOYEMT4/action/author_attestation","sign_citation":"https://pith.science/pith/6T7DKYZMTTZYEEH5AKPZOYEMT4/action/citation_signature","submit_replication":"https://pith.science/pith/6T7DKYZMTTZYEEH5AKPZOYEMT4/action/replication_record"}},"created_at":"2026-05-18T00:58:42.757904+00:00","updated_at":"2026-05-18T00:58:42.757904+00:00"}