{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZA4DK2Q65FX4J3D4WGRDECHC4H","short_pith_number":"pith:ZA4DK2Q6","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"},"canonical_sha256":"c838356a1ee96fc4ec7cb1a23208e2e1cefaa8f48965ff4b951f65679d198cea","source":{"kind":"arxiv","id":"1311.5360","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.5360","created_at":"2026-05-18T00:58:16Z"},{"alias_kind":"arxiv_version","alias_value":"1311.5360v1","created_at":"2026-05-18T00:58:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5360","created_at":"2026-05-18T00:58:16Z"},{"alias_kind":"pith_short_12","alias_value":"ZA4DK2Q65FX4","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZA4DK2Q65FX4J3D4","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZA4DK2Q6","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZA4DK2Q65FX4J3D4WGRDECHC4H","target":"record","payload":{"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"},"canonical_sha256":"c838356a1ee96fc4ec7cb1a23208e2e1cefaa8f48965ff4b951f65679d198cea","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"},"source_kind":"arxiv","source_id":"1311.5360","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:58:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZLGIS+0Nxk0Pqp2SmvsVvRw5pdT7Bvc44NoiiBbCzBtn1la/GGXmsKtWiKYgku9PuKwYT3CIeNsF8ltom1sdCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:11:40.045869Z"},"content_sha256":"0111a4a5ce62b7cd42d855071e5d05b7160a329bb0e83ed5a693e6df5e158c1f","schema_version":"1.0","event_id":"sha256:0111a4a5ce62b7cd42d855071e5d05b7160a329bb0e83ed5a693e6df5e158c1f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZA4DK2Q65FX4J3D4WGRDECHC4H","target":"graph","payload":{"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"},"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:58:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vvHRDN4xm5GkF4qbXnwdtx9Ykufr+QYK7iE7I1bVWStO4x9vnLzGRNeh18cECoVyI/Rnhtcnn5PAttbqx4rWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:11:40.046615Z"},"content_sha256":"381714c9ec13feadafe05ac49d38a261515b96667bc3f8d9c996d53f9a9f81c6","schema_version":"1.0","event_id":"sha256:381714c9ec13feadafe05ac49d38a261515b96667bc3f8d9c996d53f9a9f81c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZA4DK2Q65FX4J3D4WGRDECHC4H/bundle.json","state_url":"https://pith.science/pith/ZA4DK2Q65FX4J3D4WGRDECHC4H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZA4DK2Q65FX4J3D4WGRDECHC4H/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-05-25T16:11:40Z","links":{"resolver":"https://pith.science/pith/ZA4DK2Q65FX4J3D4WGRDECHC4H","bundle":"https://pith.science/pith/ZA4DK2Q65FX4J3D4WGRDECHC4H/bundle.json","state":"https://pith.science/pith/ZA4DK2Q65FX4J3D4WGRDECHC4H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZA4DK2Q65FX4J3D4WGRDECHC4H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZA4DK2Q65FX4J3D4WGRDECHC4H","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":"0fb2389b175427764306c0c087fa88f81303003bdc70f2142ddc4ca4d0d368d1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-21T10:46:45Z","title_canon_sha256":"ac914333ed49766a88e495917c4364c445bbeabff368bfc0ade6f8101511553f"},"schema_version":"1.0","source":{"id":"1311.5360","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.5360","created_at":"2026-05-18T00:58:16Z"},{"alias_kind":"arxiv_version","alias_value":"1311.5360v1","created_at":"2026-05-18T00:58:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5360","created_at":"2026-05-18T00:58:16Z"},{"alias_kind":"pith_short_12","alias_value":"ZA4DK2Q65FX4","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZA4DK2Q65FX4J3D4","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZA4DK2Q6","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:381714c9ec13feadafe05ac49d38a261515b96667bc3f8d9c996d53f9a9f81c6","target":"graph","created_at":"2026-05-18T00:58:16Z","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":"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 ","authors_text":"Abdellatif Zaidi, Mireille Sarkiss, Mohamed Kamoun, Pierre Duhamel, Sinda Smirani","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-21T10:46:45Z","title":"Achievable Rate Regions for Two-Way Relay Channel using Nested Lattice Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5360","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:0111a4a5ce62b7cd42d855071e5d05b7160a329bb0e83ed5a693e6df5e158c1f","target":"record","created_at":"2026-05-18T00:58:16Z","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":"0fb2389b175427764306c0c087fa88f81303003bdc70f2142ddc4ca4d0d368d1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-21T10:46:45Z","title_canon_sha256":"ac914333ed49766a88e495917c4364c445bbeabff368bfc0ade6f8101511553f"},"schema_version":"1.0","source":{"id":"1311.5360","kind":"arxiv","version":1}},"canonical_sha256":"c838356a1ee96fc4ec7cb1a23208e2e1cefaa8f48965ff4b951f65679d198cea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c838356a1ee96fc4ec7cb1a23208e2e1cefaa8f48965ff4b951f65679d198cea","first_computed_at":"2026-05-18T00:58:16.613866Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:16.613866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t4sA2i1hjdbcGOBGuKRTnxVGkkMZhyC0unLS0+AMB+F+p6BaNYO3QryIDIPQRAEusDtsBuMuYXb5WcyuUkD6Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:16.614594Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.5360","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0111a4a5ce62b7cd42d855071e5d05b7160a329bb0e83ed5a693e6df5e158c1f","sha256:381714c9ec13feadafe05ac49d38a261515b96667bc3f8d9c996d53f9a9f81c6"],"state_sha256":"8a1700f159ee81ac9d212971c59b89a574647f0929351b080241f49ee72471ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dtNZdU9aGoSx7id+jutAm0R6cZan2oJK5HY7uebIaN6s9nXxaiWhfdDzFRnj3jvAXReixTR4NftZTHuDW/LWBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:11:40.050799Z","bundle_sha256":"5ec0a059e8a0a4d3ed4991611dea347508e9570cca0c06ad164d73e617c49789"}}