{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ZA4DK2Q65FX4J3D4WGRDECHC4H","short_pith_number":"pith:ZA4DK2Q6","schema_version":"1.0","canonical_sha256":"c838356a1ee96fc4ec7cb1a23208e2e1cefaa8f48965ff4b951f65679d198cea","source":{"kind":"arxiv","id":"1311.5360","version":1},"attestation_state":"computed","paper":{"title":"Achievable Rate Regions for Two-Way Relay Channel using Nested Lattice Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abdellatif Zaidi, Mireille Sarkiss, Mohamed Kamoun, Pierre Duhamel, Sinda Smirani","submitted_at":"2013-11-21T10:46:45Z","abstract_excerpt":"This paper studies Gaussian Two-Way Relay Channel where two communication nodes exchange messages with each other via a relay. It is assumed that all nodes operate in half duplex mode without any direct link between the communication nodes. A compress-and-forward relaying strategy using nested lattice codes is first proposed. Then, the proposed scheme is improved by performing a layered coding : a common layer is decoded by both receivers and a refinement layer is recovered only by the receiver which has the best channel conditions. The achievable rates of the new scheme are characterized and "},"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":"1311.5360","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-21T10:46:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ac914333ed49766a88e495917c4364c445bbeabff368bfc0ade6f8101511553f","abstract_canon_sha256":"0fb2389b175427764306c0c087fa88f81303003bdc70f2142ddc4ca4d0d368d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:16.614594Z","signature_b64":"t4sA2i1hjdbcGOBGuKRTnxVGkkMZhyC0unLS0+AMB+F+p6BaNYO3QryIDIPQRAEusDtsBuMuYXb5WcyuUkD6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c838356a1ee96fc4ec7cb1a23208e2e1cefaa8f48965ff4b951f65679d198cea","last_reissued_at":"2026-05-18T00:58:16.613866Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:16.613866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Achievable Rate Regions for Two-Way Relay Channel using Nested Lattice Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abdellatif Zaidi, Mireille Sarkiss, Mohamed Kamoun, Pierre Duhamel, Sinda Smirani","submitted_at":"2013-11-21T10:46:45Z","abstract_excerpt":"This paper studies Gaussian Two-Way Relay Channel where two communication nodes exchange messages with each other via a relay. It is assumed that all nodes operate in half duplex mode without any direct link between the communication nodes. A compress-and-forward relaying strategy using nested lattice codes is first proposed. Then, the proposed scheme is improved by performing a layered coding : a common layer is decoded by both receivers and a refinement layer is recovered only by the receiver which has the best channel conditions. The achievable rates of the new scheme are characterized and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5360","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":"1311.5360","created_at":"2026-05-18T00:58:16.613980+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.5360v1","created_at":"2026-05-18T00:58:16.613980+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5360","created_at":"2026-05-18T00:58:16.613980+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZA4DK2Q65FX4","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZA4DK2Q65FX4J3D4","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZA4DK2Q6","created_at":"2026-05-18T12:28:09.283467+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/ZA4DK2Q65FX4J3D4WGRDECHC4H","json":"https://pith.science/pith/ZA4DK2Q65FX4J3D4WGRDECHC4H.json","graph_json":"https://pith.science/api/pith-number/ZA4DK2Q65FX4J3D4WGRDECHC4H/graph.json","events_json":"https://pith.science/api/pith-number/ZA4DK2Q65FX4J3D4WGRDECHC4H/events.json","paper":"https://pith.science/paper/ZA4DK2Q6"},"agent_actions":{"view_html":"https://pith.science/pith/ZA4DK2Q65FX4J3D4WGRDECHC4H","download_json":"https://pith.science/pith/ZA4DK2Q65FX4J3D4WGRDECHC4H.json","view_paper":"https://pith.science/paper/ZA4DK2Q6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.5360&json=true","fetch_graph":"https://pith.science/api/pith-number/ZA4DK2Q65FX4J3D4WGRDECHC4H/graph.json","fetch_events":"https://pith.science/api/pith-number/ZA4DK2Q65FX4J3D4WGRDECHC4H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZA4DK2Q65FX4J3D4WGRDECHC4H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZA4DK2Q65FX4J3D4WGRDECHC4H/action/storage_attestation","attest_author":"https://pith.science/pith/ZA4DK2Q65FX4J3D4WGRDECHC4H/action/author_attestation","sign_citation":"https://pith.science/pith/ZA4DK2Q65FX4J3D4WGRDECHC4H/action/citation_signature","submit_replication":"https://pith.science/pith/ZA4DK2Q65FX4J3D4WGRDECHC4H/action/replication_record"}},"created_at":"2026-05-18T00:58:16.613980+00:00","updated_at":"2026-05-18T00:58:16.613980+00:00"}