{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GMGCJS6EFMFUUS6DP5DPE32P44","short_pith_number":"pith:GMGCJS6E","canonical_record":{"source":{"id":"1307.5483","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-21T00:31:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b8dfb37e07bbd6f44407349ed097935f6716ee53342a850292fd1d6e82d5a327","abstract_canon_sha256":"289b3f7f2d702195b1f0876537c50205528bb2f60fa36c480bd1470312851d42"},"schema_version":"1.0"},"canonical_sha256":"330c24cbc42b0b4a4bc37f46f26f4fe72e5deb4fca33116561a9c3c04b378a53","source":{"kind":"arxiv","id":"1307.5483","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5483","created_at":"2026-05-18T03:13:21Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5483v2","created_at":"2026-05-18T03:13:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5483","created_at":"2026-05-18T03:13:21Z"},{"alias_kind":"pith_short_12","alias_value":"GMGCJS6EFMFU","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GMGCJS6EFMFUUS6D","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GMGCJS6E","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GMGCJS6EFMFUUS6DP5DPE32P44","target":"record","payload":{"canonical_record":{"source":{"id":"1307.5483","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-21T00:31:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b8dfb37e07bbd6f44407349ed097935f6716ee53342a850292fd1d6e82d5a327","abstract_canon_sha256":"289b3f7f2d702195b1f0876537c50205528bb2f60fa36c480bd1470312851d42"},"schema_version":"1.0"},"canonical_sha256":"330c24cbc42b0b4a4bc37f46f26f4fe72e5deb4fca33116561a9c3c04b378a53","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:21.233053Z","signature_b64":"xVVJdoTLcht4hr+JSzvnU25lYRve9i8d9JNZ144UnITAUiYU8htLLkJdhds8+oGaFsAtYRqG8uM4sg6W0aXgDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"330c24cbc42b0b4a4bc37f46f26f4fe72e5deb4fca33116561a9c3c04b378a53","last_reissued_at":"2026-05-18T03:13:21.232530Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:21.232530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.5483","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:13:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zo6mn4LaG8mRE30A3S8TSTvkOmP79wnP3pGYlQN8ZxOkZBcuSM9ybQ6/5GmieX+Ev8ulH0iL2PlKTw/BLD1CBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:25:58.601525Z"},"content_sha256":"33c23bb5425ab1d01e70f7ba2987f8e7091d1871f59b2cbb916a29e7aee82923","schema_version":"1.0","event_id":"sha256:33c23bb5425ab1d01e70f7ba2987f8e7091d1871f59b2cbb916a29e7aee82923"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GMGCJS6EFMFUUS6DP5DPE32P44","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approaching Gaussian Relay Network Capacity in the High SNR Regime: End-to-End Lattice Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Edmund Yeh, Muriel Medard, Yun Xu","submitted_at":"2013-07-21T00:31:32Z","abstract_excerpt":"We present a natural and low-complexity technique for achieving the capacity of the Gaussian relay network in the high SNR regime. Specifically, we propose the use of end-to-end structured lattice codes with the amplify-and-forward strategy, where the source uses a nested lattice code to encode the messages and the destination decodes the messages by lattice decoding. All intermediate relays simply amplify and forward the received signals over the network to the destination. We show that the end-to-end lattice-coded amplify-and-forward scheme approaches the capacity of the layered Gaussian rel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5483","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:13:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v5ccPdGPwLkwWkwPzacmoJ7HDqGt1g+NM6VXGtJjf6/r7NYobhNir+1BuNQCCwoc4E9JOUiIdZRIwf8oeaPFDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:25:58.602220Z"},"content_sha256":"3455c6fe3e8bf8f74e34870533ab7b5c3db391e351cdbdb437419bcf9125c99d","schema_version":"1.0","event_id":"sha256:3455c6fe3e8bf8f74e34870533ab7b5c3db391e351cdbdb437419bcf9125c99d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GMGCJS6EFMFUUS6DP5DPE32P44/bundle.json","state_url":"https://pith.science/pith/GMGCJS6EFMFUUS6DP5DPE32P44/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GMGCJS6EFMFUUS6DP5DPE32P44/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:25:58Z","links":{"resolver":"https://pith.science/pith/GMGCJS6EFMFUUS6DP5DPE32P44","bundle":"https://pith.science/pith/GMGCJS6EFMFUUS6DP5DPE32P44/bundle.json","state":"https://pith.science/pith/GMGCJS6EFMFUUS6DP5DPE32P44/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GMGCJS6EFMFUUS6DP5DPE32P44/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GMGCJS6EFMFUUS6DP5DPE32P44","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":"289b3f7f2d702195b1f0876537c50205528bb2f60fa36c480bd1470312851d42","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-21T00:31:32Z","title_canon_sha256":"b8dfb37e07bbd6f44407349ed097935f6716ee53342a850292fd1d6e82d5a327"},"schema_version":"1.0","source":{"id":"1307.5483","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5483","created_at":"2026-05-18T03:13:21Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5483v2","created_at":"2026-05-18T03:13:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5483","created_at":"2026-05-18T03:13:21Z"},{"alias_kind":"pith_short_12","alias_value":"GMGCJS6EFMFU","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GMGCJS6EFMFUUS6D","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GMGCJS6E","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:3455c6fe3e8bf8f74e34870533ab7b5c3db391e351cdbdb437419bcf9125c99d","target":"graph","created_at":"2026-05-18T03:13:21Z","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":"We present a natural and low-complexity technique for achieving the capacity of the Gaussian relay network in the high SNR regime. Specifically, we propose the use of end-to-end structured lattice codes with the amplify-and-forward strategy, where the source uses a nested lattice code to encode the messages and the destination decodes the messages by lattice decoding. All intermediate relays simply amplify and forward the received signals over the network to the destination. We show that the end-to-end lattice-coded amplify-and-forward scheme approaches the capacity of the layered Gaussian rel","authors_text":"Edmund Yeh, Muriel Medard, Yun Xu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-21T00:31:32Z","title":"Approaching Gaussian Relay Network Capacity in the High SNR Regime: End-to-End Lattice Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5483","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:33c23bb5425ab1d01e70f7ba2987f8e7091d1871f59b2cbb916a29e7aee82923","target":"record","created_at":"2026-05-18T03:13:21Z","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":"289b3f7f2d702195b1f0876537c50205528bb2f60fa36c480bd1470312851d42","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-21T00:31:32Z","title_canon_sha256":"b8dfb37e07bbd6f44407349ed097935f6716ee53342a850292fd1d6e82d5a327"},"schema_version":"1.0","source":{"id":"1307.5483","kind":"arxiv","version":2}},"canonical_sha256":"330c24cbc42b0b4a4bc37f46f26f4fe72e5deb4fca33116561a9c3c04b378a53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"330c24cbc42b0b4a4bc37f46f26f4fe72e5deb4fca33116561a9c3c04b378a53","first_computed_at":"2026-05-18T03:13:21.232530Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:21.232530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xVVJdoTLcht4hr+JSzvnU25lYRve9i8d9JNZ144UnITAUiYU8htLLkJdhds8+oGaFsAtYRqG8uM4sg6W0aXgDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:21.233053Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.5483","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33c23bb5425ab1d01e70f7ba2987f8e7091d1871f59b2cbb916a29e7aee82923","sha256:3455c6fe3e8bf8f74e34870533ab7b5c3db391e351cdbdb437419bcf9125c99d"],"state_sha256":"3c95115a38b83f028a58e00421956f70df6d545bdd5f5746c30087e8e30a286e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TCr04zVqX97R7qKvHA7TRuVMZoUlfvWJRbvs2/vogJVQU90yHpa72SblcX4ybd5eOH5CVeuA1OEHTXcU5/BhAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:25:58.605476Z","bundle_sha256":"79fc837ad6dab2cdba904374136ce38a5063446ee5805e24a5f783ba8d7ba056"}}