{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:XINTKCWQSZ3QBYJ5HW7QYCP6NJ","short_pith_number":"pith:XINTKCWQ","canonical_record":{"source":{"id":"1111.0084","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-01T00:12:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"401809d5e90b9a4290b08058cf06cd11bc85dfdc627a4cc6c5051df52344f71f","abstract_canon_sha256":"6f9af5510a712b70a884fc37aa787a49157890e3d87de2166d1484821c25fade"},"schema_version":"1.0"},"canonical_sha256":"ba1b350ad0967700e13d3dbf0c09fe6a719082865d4daa5201c9e27b4934ee53","source":{"kind":"arxiv","id":"1111.0084","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.0084","created_at":"2026-05-18T03:42:44Z"},{"alias_kind":"arxiv_version","alias_value":"1111.0084v2","created_at":"2026-05-18T03:42:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0084","created_at":"2026-05-18T03:42:44Z"},{"alias_kind":"pith_short_12","alias_value":"XINTKCWQSZ3Q","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"XINTKCWQSZ3QBYJ5","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"XINTKCWQ","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:XINTKCWQSZ3QBYJ5HW7QYCP6NJ","target":"record","payload":{"canonical_record":{"source":{"id":"1111.0084","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-01T00:12:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"401809d5e90b9a4290b08058cf06cd11bc85dfdc627a4cc6c5051df52344f71f","abstract_canon_sha256":"6f9af5510a712b70a884fc37aa787a49157890e3d87de2166d1484821c25fade"},"schema_version":"1.0"},"canonical_sha256":"ba1b350ad0967700e13d3dbf0c09fe6a719082865d4daa5201c9e27b4934ee53","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:44.690373Z","signature_b64":"SF+6hj1essoq5/Mkkih5EMhZCkTlTEWTD7YcCwbyd5AvhvzfnsSvh4l39nENJCfhv5VsO279fXPXh04nB70KDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba1b350ad0967700e13d3dbf0c09fe6a719082865d4daa5201c9e27b4934ee53","last_reissued_at":"2026-05-18T03:42:44.689928Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:44.689928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.0084","source_version":2,"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:42:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lSCZ/Abvmdwc+eY4q1QA+OtAzze7jcxlOPyrap20GQBfePKY9EQLe0LfPM5k6iBdzFkdSu5uuGKuDxRJ2En0BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:14:37.666491Z"},"content_sha256":"fa479b8f9494c17f3b2d1c9323988022e8c3f4774d96a16d722772cd602fdcec","schema_version":"1.0","event_id":"sha256:fa479b8f9494c17f3b2d1c9323988022e8c3f4774d96a16d722772cd602fdcec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:XINTKCWQSZ3QBYJ5HW7QYCP6NJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lattice codes for the Gaussian relay channel: Decode-and-Forward and Compress-and-Forward","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Natasha Devroye, Yiwei Song","submitted_at":"2011-11-01T00:12:38Z","abstract_excerpt":"Lattice codes are known to achieve capacity in the Gaussian point-to-point channel, achieving the same rates as independent, identically distributed (i.i.d.) random Gaussian codebooks. Lattice codes are also known to outperform random codes for certain channel models that are able to exploit their linearity. In this work, we show that lattice codes may be used to achieve the same performance as known i.i.d. Gaussian random coding techniques for the Gaussian relay channel, and show several examples of how this may be combined with the linearity of lattices codes in multi-source relay networks. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0084","kind":"arxiv","version":2},"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:42:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eygR7f92fmB2DM2R9z4bHjrFWogugxAjuCM7jd3Uc2pRSKqu6ghfmmBro6yoyHI1w9fYzPdQ8dIkkq2/EGaaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:14:37.666836Z"},"content_sha256":"aa5fba0fccd1a23d3b0b1de40eea16908e22499fa3a72111561e08897d9e97ac","schema_version":"1.0","event_id":"sha256:aa5fba0fccd1a23d3b0b1de40eea16908e22499fa3a72111561e08897d9e97ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XINTKCWQSZ3QBYJ5HW7QYCP6NJ/bundle.json","state_url":"https://pith.science/pith/XINTKCWQSZ3QBYJ5HW7QYCP6NJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XINTKCWQSZ3QBYJ5HW7QYCP6NJ/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-28T14:14:37Z","links":{"resolver":"https://pith.science/pith/XINTKCWQSZ3QBYJ5HW7QYCP6NJ","bundle":"https://pith.science/pith/XINTKCWQSZ3QBYJ5HW7QYCP6NJ/bundle.json","state":"https://pith.science/pith/XINTKCWQSZ3QBYJ5HW7QYCP6NJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XINTKCWQSZ3QBYJ5HW7QYCP6NJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:XINTKCWQSZ3QBYJ5HW7QYCP6NJ","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":"6f9af5510a712b70a884fc37aa787a49157890e3d87de2166d1484821c25fade","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-01T00:12:38Z","title_canon_sha256":"401809d5e90b9a4290b08058cf06cd11bc85dfdc627a4cc6c5051df52344f71f"},"schema_version":"1.0","source":{"id":"1111.0084","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.0084","created_at":"2026-05-18T03:42:44Z"},{"alias_kind":"arxiv_version","alias_value":"1111.0084v2","created_at":"2026-05-18T03:42:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0084","created_at":"2026-05-18T03:42:44Z"},{"alias_kind":"pith_short_12","alias_value":"XINTKCWQSZ3Q","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"XINTKCWQSZ3QBYJ5","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"XINTKCWQ","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:aa5fba0fccd1a23d3b0b1de40eea16908e22499fa3a72111561e08897d9e97ac","target":"graph","created_at":"2026-05-18T03:42:44Z","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":"Lattice codes are known to achieve capacity in the Gaussian point-to-point channel, achieving the same rates as independent, identically distributed (i.i.d.) random Gaussian codebooks. Lattice codes are also known to outperform random codes for certain channel models that are able to exploit their linearity. In this work, we show that lattice codes may be used to achieve the same performance as known i.i.d. Gaussian random coding techniques for the Gaussian relay channel, and show several examples of how this may be combined with the linearity of lattices codes in multi-source relay networks. ","authors_text":"Natasha Devroye, Yiwei Song","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-01T00:12:38Z","title":"Lattice codes for the Gaussian relay channel: Decode-and-Forward and Compress-and-Forward"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0084","kind":"arxiv","version":2},"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:fa479b8f9494c17f3b2d1c9323988022e8c3f4774d96a16d722772cd602fdcec","target":"record","created_at":"2026-05-18T03:42:44Z","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":"6f9af5510a712b70a884fc37aa787a49157890e3d87de2166d1484821c25fade","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-01T00:12:38Z","title_canon_sha256":"401809d5e90b9a4290b08058cf06cd11bc85dfdc627a4cc6c5051df52344f71f"},"schema_version":"1.0","source":{"id":"1111.0084","kind":"arxiv","version":2}},"canonical_sha256":"ba1b350ad0967700e13d3dbf0c09fe6a719082865d4daa5201c9e27b4934ee53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba1b350ad0967700e13d3dbf0c09fe6a719082865d4daa5201c9e27b4934ee53","first_computed_at":"2026-05-18T03:42:44.689928Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:44.689928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SF+6hj1essoq5/Mkkih5EMhZCkTlTEWTD7YcCwbyd5AvhvzfnsSvh4l39nENJCfhv5VsO279fXPXh04nB70KDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:44.690373Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.0084","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa479b8f9494c17f3b2d1c9323988022e8c3f4774d96a16d722772cd602fdcec","sha256:aa5fba0fccd1a23d3b0b1de40eea16908e22499fa3a72111561e08897d9e97ac"],"state_sha256":"cbae0705d6daa619991f38c77e58e8e98a4001a585ec208897b68116ab3ae5e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G0ol9plNhyrJ/N+WaUKV/NoAIIq35TCdIXrahRkryOr2/W+Agq+U+8NlylFT/8SiEYBYjRd3Whpn7gxLzy8dDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T14:14:37.669124Z","bundle_sha256":"7b5cd1a6d1ce10e9e468566b84584d6ff3fecadb14d8f6a1d6c44ca92dd1debb"}}