{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JKNW2D76BLO2HEMAI2L7GK3BV4","short_pith_number":"pith:JKNW2D76","canonical_record":{"source":{"id":"1301.6291","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-26T21:44:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0f2d76b684b4f477ceb235b99003ab82e62e8d5f84ecec7ad296c657873d381e","abstract_canon_sha256":"a5a0b6bde8d77a563f7a48ab6f5cc7f27684c97b9e18ec8c5b44b3351a32ac14"},"schema_version":"1.0"},"canonical_sha256":"4a9b6d0ffe0adda391804697f32b61af3ce77e163a0bf9eacb7463d76741107f","source":{"kind":"arxiv","id":"1301.6291","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6291","created_at":"2026-05-18T03:35:15Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6291v1","created_at":"2026-05-18T03:35:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6291","created_at":"2026-05-18T03:35:15Z"},{"alias_kind":"pith_short_12","alias_value":"JKNW2D76BLO2","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JKNW2D76BLO2HEMA","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JKNW2D76","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JKNW2D76BLO2HEMAI2L7GK3BV4","target":"record","payload":{"canonical_record":{"source":{"id":"1301.6291","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-26T21:44:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0f2d76b684b4f477ceb235b99003ab82e62e8d5f84ecec7ad296c657873d381e","abstract_canon_sha256":"a5a0b6bde8d77a563f7a48ab6f5cc7f27684c97b9e18ec8c5b44b3351a32ac14"},"schema_version":"1.0"},"canonical_sha256":"4a9b6d0ffe0adda391804697f32b61af3ce77e163a0bf9eacb7463d76741107f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:15.896000Z","signature_b64":"tx5IoUHI6YwTxqMSqaNYql8wtzmKtCa+2U1/lrE6/M1KnwBUlRpM5cqT4zCQvAA14iayXYloo4LFJCvPoQZjBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a9b6d0ffe0adda391804697f32b61af3ce77e163a0bf9eacb7463d76741107f","last_reissued_at":"2026-05-18T03:35:15.895218Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:15.895218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.6291","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-18T03:35:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5tfxQYEoBchcMwqEitVV/K4mEroNbN57wyCqMv4zWSaV25x7FE2y2C0ptX3EMRUBuLyAHq6Hxay5wgHJJ5y6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:14:45.446518Z"},"content_sha256":"c8f55a7a5f3c9be15985690fe490e99aeaca8cd71f648ce9b243a3ee72f1c56b","schema_version":"1.0","event_id":"sha256:c8f55a7a5f3c9be15985690fe490e99aeaca8cd71f648ce9b243a3ee72f1c56b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JKNW2D76BLO2HEMAI2L7GK3BV4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nested Lattice Codes for Gaussian Two-Way Relay Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hamid Behroozi, Shahab Ghasemi-Goojani","submitted_at":"2013-01-26T21:44:39Z","abstract_excerpt":"In this paper, we consider a Gaussian two-way relay channel (GTRC), where two sources exchange messages with each other through a relay. We assume that there is no direct link between sources, and all nodes operate in full-duplex mode. By utilizing nested lattice codes for the uplink (i.e., MAC phase), and structured binning for the downlink (i.e., broadcast phase), we propose two achievable schemes. Scheme 1 is based on compute and forward scheme of [1] while scheme 2 utilizes two different lattices for source nodes based on a three-stage lattice partition chain. We show that scheme 2 can ach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6291","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-18T03:35:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kslnqPP+W4LtQLW5vPatruZKu9elaCthG5Qf21YNl3NfPoFJQKDqyAZqO2SsA5xnM5GekqG4DwJmz4xdtIj3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:14:45.447216Z"},"content_sha256":"deaeeee67e4cd0d3387c98abb88f2497566bf64de37ea4493e7268a946e08401","schema_version":"1.0","event_id":"sha256:deaeeee67e4cd0d3387c98abb88f2497566bf64de37ea4493e7268a946e08401"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JKNW2D76BLO2HEMAI2L7GK3BV4/bundle.json","state_url":"https://pith.science/pith/JKNW2D76BLO2HEMAI2L7GK3BV4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JKNW2D76BLO2HEMAI2L7GK3BV4/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-08T17:14:45Z","links":{"resolver":"https://pith.science/pith/JKNW2D76BLO2HEMAI2L7GK3BV4","bundle":"https://pith.science/pith/JKNW2D76BLO2HEMAI2L7GK3BV4/bundle.json","state":"https://pith.science/pith/JKNW2D76BLO2HEMAI2L7GK3BV4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JKNW2D76BLO2HEMAI2L7GK3BV4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JKNW2D76BLO2HEMAI2L7GK3BV4","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":"a5a0b6bde8d77a563f7a48ab6f5cc7f27684c97b9e18ec8c5b44b3351a32ac14","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-26T21:44:39Z","title_canon_sha256":"0f2d76b684b4f477ceb235b99003ab82e62e8d5f84ecec7ad296c657873d381e"},"schema_version":"1.0","source":{"id":"1301.6291","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6291","created_at":"2026-05-18T03:35:15Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6291v1","created_at":"2026-05-18T03:35:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6291","created_at":"2026-05-18T03:35:15Z"},{"alias_kind":"pith_short_12","alias_value":"JKNW2D76BLO2","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JKNW2D76BLO2HEMA","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JKNW2D76","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:deaeeee67e4cd0d3387c98abb88f2497566bf64de37ea4493e7268a946e08401","target":"graph","created_at":"2026-05-18T03:35:15Z","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":"In this paper, we consider a Gaussian two-way relay channel (GTRC), where two sources exchange messages with each other through a relay. We assume that there is no direct link between sources, and all nodes operate in full-duplex mode. By utilizing nested lattice codes for the uplink (i.e., MAC phase), and structured binning for the downlink (i.e., broadcast phase), we propose two achievable schemes. Scheme 1 is based on compute and forward scheme of [1] while scheme 2 utilizes two different lattices for source nodes based on a three-stage lattice partition chain. We show that scheme 2 can ach","authors_text":"Hamid Behroozi, Shahab Ghasemi-Goojani","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-26T21:44:39Z","title":"Nested Lattice Codes for Gaussian Two-Way Relay Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6291","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:c8f55a7a5f3c9be15985690fe490e99aeaca8cd71f648ce9b243a3ee72f1c56b","target":"record","created_at":"2026-05-18T03:35:15Z","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":"a5a0b6bde8d77a563f7a48ab6f5cc7f27684c97b9e18ec8c5b44b3351a32ac14","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-26T21:44:39Z","title_canon_sha256":"0f2d76b684b4f477ceb235b99003ab82e62e8d5f84ecec7ad296c657873d381e"},"schema_version":"1.0","source":{"id":"1301.6291","kind":"arxiv","version":1}},"canonical_sha256":"4a9b6d0ffe0adda391804697f32b61af3ce77e163a0bf9eacb7463d76741107f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a9b6d0ffe0adda391804697f32b61af3ce77e163a0bf9eacb7463d76741107f","first_computed_at":"2026-05-18T03:35:15.895218Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:15.895218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tx5IoUHI6YwTxqMSqaNYql8wtzmKtCa+2U1/lrE6/M1KnwBUlRpM5cqT4zCQvAA14iayXYloo4LFJCvPoQZjBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:15.896000Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6291","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8f55a7a5f3c9be15985690fe490e99aeaca8cd71f648ce9b243a3ee72f1c56b","sha256:deaeeee67e4cd0d3387c98abb88f2497566bf64de37ea4493e7268a946e08401"],"state_sha256":"d1ffb9c05ad4d6b7e2e9b54431dc577f52c4168198d06a82a06b0ae1b2f0bebb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4LpQe2g4Zzdji221zlC5gVqPdzCzFSWFlVswUdEn0yygg6shQiwxpOpaHcqaGEB4aseoNBKPiH5PjZaulAO6BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T17:14:45.451907Z","bundle_sha256":"ace8130da1c4c5952753ef8eaa245f769613a76e4f1728457639f9bd0a994499"}}