{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WGOPQPFI7NVH2D5FCKAERFFR3J","short_pith_number":"pith:WGOPQPFI","canonical_record":{"source":{"id":"1407.3841","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-14T22:52:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a1564a77aa7dca816fb33141c263671b78201779f56b0f049ce97f158a7c64f2","abstract_canon_sha256":"a86a74d6d94d17aa4e2941be9fc84ada611ca5eae245e8b183a91697c1a59e6b"},"schema_version":"1.0"},"canonical_sha256":"b19cf83ca8fb6a7d0fa512804894b1da5f236872b8a786b8abe7e63d1c1f6d7a","source":{"kind":"arxiv","id":"1407.3841","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3841","created_at":"2026-05-18T01:36:51Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3841v3","created_at":"2026-05-18T01:36:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3841","created_at":"2026-05-18T01:36:51Z"},{"alias_kind":"pith_short_12","alias_value":"WGOPQPFI7NVH","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WGOPQPFI7NVH2D5F","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WGOPQPFI","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WGOPQPFI7NVH2D5FCKAERFFR3J","target":"record","payload":{"canonical_record":{"source":{"id":"1407.3841","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-14T22:52:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a1564a77aa7dca816fb33141c263671b78201779f56b0f049ce97f158a7c64f2","abstract_canon_sha256":"a86a74d6d94d17aa4e2941be9fc84ada611ca5eae245e8b183a91697c1a59e6b"},"schema_version":"1.0"},"canonical_sha256":"b19cf83ca8fb6a7d0fa512804894b1da5f236872b8a786b8abe7e63d1c1f6d7a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:51.663207Z","signature_b64":"jkylW6J3xU6sZmUpkmLVdUj1VIAUA9/fnOkXBmNysfmB8pDh8KuH1tC6xAfSDsmTMCCr6qc0a4dMQEJ3X6UoBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b19cf83ca8fb6a7d0fa512804894b1da5f236872b8a786b8abe7e63d1c1f6d7a","last_reissued_at":"2026-05-18T01:36:51.662546Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:51.662546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.3841","source_version":3,"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-18T01:36:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nOCqUkSB3w9JYfqEeGB5G9wYn9Cy+JTn8fE/acV/a8fy9FwXi9bx1L7623DUfQAX7O8GkvV7UaxPfZTZXXSjCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:03:17.220475Z"},"content_sha256":"e9dc0a6aad7ba7697fac7bb4de96c280cfcdfad4511d15e66c481e5fafe7c1ee","schema_version":"1.0","event_id":"sha256:e9dc0a6aad7ba7697fac7bb4de96c280cfcdfad4511d15e66c481e5fafe7c1ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WGOPQPFI7NVH2D5FCKAERFFR3J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Capacity Approximations for Gaussian Relay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abbas El Gamal, Ayfer \\\"Ozg\\\"ur, Ritesh Kolte","submitted_at":"2014-07-14T22:52:11Z","abstract_excerpt":"Consider a Gaussian relay network where a source node communicates to a destination node with the help of several layers of relays. Recent work has shown that compress-and-forward based strategies can achieve the capacity of this network within an additive gap. Here, the relays quantize their received signals at the noise level and map them to random Gaussian codebooks. The resultant gap to capacity is independent of the SNRs of the channels in the network and the topology but is linear in the total number of nodes.\n  In this paper, we provide an improved lower bound on the rate achieved by co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3841","kind":"arxiv","version":3},"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-18T01:36:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QhN7CQvarC4xJp4NERNSX0iKTu2YjObYF808oBLQLMYZNxr0UOa6aaSUlOpyqOefaRdYJKK1erGl7qcZAtMoCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:03:17.221454Z"},"content_sha256":"a20cd6cc48b93708e668d61c6b7492d4709335fe8641e30e215c8b1a17418ecc","schema_version":"1.0","event_id":"sha256:a20cd6cc48b93708e668d61c6b7492d4709335fe8641e30e215c8b1a17418ecc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WGOPQPFI7NVH2D5FCKAERFFR3J/bundle.json","state_url":"https://pith.science/pith/WGOPQPFI7NVH2D5FCKAERFFR3J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WGOPQPFI7NVH2D5FCKAERFFR3J/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-02T22:03:17Z","links":{"resolver":"https://pith.science/pith/WGOPQPFI7NVH2D5FCKAERFFR3J","bundle":"https://pith.science/pith/WGOPQPFI7NVH2D5FCKAERFFR3J/bundle.json","state":"https://pith.science/pith/WGOPQPFI7NVH2D5FCKAERFFR3J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WGOPQPFI7NVH2D5FCKAERFFR3J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WGOPQPFI7NVH2D5FCKAERFFR3J","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":"a86a74d6d94d17aa4e2941be9fc84ada611ca5eae245e8b183a91697c1a59e6b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-14T22:52:11Z","title_canon_sha256":"a1564a77aa7dca816fb33141c263671b78201779f56b0f049ce97f158a7c64f2"},"schema_version":"1.0","source":{"id":"1407.3841","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3841","created_at":"2026-05-18T01:36:51Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3841v3","created_at":"2026-05-18T01:36:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3841","created_at":"2026-05-18T01:36:51Z"},{"alias_kind":"pith_short_12","alias_value":"WGOPQPFI7NVH","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WGOPQPFI7NVH2D5F","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WGOPQPFI","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:a20cd6cc48b93708e668d61c6b7492d4709335fe8641e30e215c8b1a17418ecc","target":"graph","created_at":"2026-05-18T01:36:51Z","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":"Consider a Gaussian relay network where a source node communicates to a destination node with the help of several layers of relays. Recent work has shown that compress-and-forward based strategies can achieve the capacity of this network within an additive gap. Here, the relays quantize their received signals at the noise level and map them to random Gaussian codebooks. The resultant gap to capacity is independent of the SNRs of the channels in the network and the topology but is linear in the total number of nodes.\n  In this paper, we provide an improved lower bound on the rate achieved by co","authors_text":"Abbas El Gamal, Ayfer \\\"Ozg\\\"ur, Ritesh Kolte","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-14T22:52:11Z","title":"Capacity Approximations for Gaussian Relay Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3841","kind":"arxiv","version":3},"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:e9dc0a6aad7ba7697fac7bb4de96c280cfcdfad4511d15e66c481e5fafe7c1ee","target":"record","created_at":"2026-05-18T01:36:51Z","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":"a86a74d6d94d17aa4e2941be9fc84ada611ca5eae245e8b183a91697c1a59e6b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-14T22:52:11Z","title_canon_sha256":"a1564a77aa7dca816fb33141c263671b78201779f56b0f049ce97f158a7c64f2"},"schema_version":"1.0","source":{"id":"1407.3841","kind":"arxiv","version":3}},"canonical_sha256":"b19cf83ca8fb6a7d0fa512804894b1da5f236872b8a786b8abe7e63d1c1f6d7a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b19cf83ca8fb6a7d0fa512804894b1da5f236872b8a786b8abe7e63d1c1f6d7a","first_computed_at":"2026-05-18T01:36:51.662546Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:51.662546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jkylW6J3xU6sZmUpkmLVdUj1VIAUA9/fnOkXBmNysfmB8pDh8KuH1tC6xAfSDsmTMCCr6qc0a4dMQEJ3X6UoBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:51.663207Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.3841","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9dc0a6aad7ba7697fac7bb4de96c280cfcdfad4511d15e66c481e5fafe7c1ee","sha256:a20cd6cc48b93708e668d61c6b7492d4709335fe8641e30e215c8b1a17418ecc"],"state_sha256":"ad7aafe5ec722fffae6f0927fc3b811be21643e5c190ece9dfd097beee2e2d0f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YpuOtdIZGdymMRK9LQXmEPSD+gllsV7Wjilb14/LQSo9+ayGkztsPDCDSr1uCvd18NCTSfa/u6GR2wrTRb8qBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:03:17.223422Z","bundle_sha256":"ef30131fe109f3e15978d6e198e9cc428d835214f67901d37810d4d257de6b7c"}}