{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:UUGBYOMFF5CK6IDOBPUGRO6ZRG","short_pith_number":"pith:UUGBYOMF","canonical_record":{"source":{"id":"1304.5790","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-21T19:58:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"099a59bcae6dee6831bbf12805d431f7cceb3de05237403793cf3c8b1aca7a60","abstract_canon_sha256":"392ce83cedd1ae3eac92f3c699e7ca82b0fa3e573d792e15fc38896d2c13dad6"},"schema_version":"1.0"},"canonical_sha256":"a50c1c39852f44af206e0be868bbd989b60156ec97493e3208c7d9ce6585afc9","source":{"kind":"arxiv","id":"1304.5790","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5790","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5790v2","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5790","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"pith_short_12","alias_value":"UUGBYOMFF5CK","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UUGBYOMFF5CK6IDO","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UUGBYOMF","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:UUGBYOMFF5CK6IDOBPUGRO6ZRG","target":"record","payload":{"canonical_record":{"source":{"id":"1304.5790","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-21T19:58:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"099a59bcae6dee6831bbf12805d431f7cceb3de05237403793cf3c8b1aca7a60","abstract_canon_sha256":"392ce83cedd1ae3eac92f3c699e7ca82b0fa3e573d792e15fc38896d2c13dad6"},"schema_version":"1.0"},"canonical_sha256":"a50c1c39852f44af206e0be868bbd989b60156ec97493e3208c7d9ce6585afc9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:04.119883Z","signature_b64":"jX3cQdvx9ZbAKkcEt2Rrsyyc4JC5MSwcUCsGq9ul3Kc48I0mkmwvNEzVzcEwzYqppsIDR9DeZsUYq9p3gTOaDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a50c1c39852f44af206e0be868bbd989b60156ec97493e3208c7d9ce6585afc9","last_reissued_at":"2026-05-18T00:59:04.119139Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:04.119139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.5790","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-18T00:59:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2voe2aR0RHeRcY9iSExs8ASI5WCCaKwFsm2MhZDB78kpLF2PLjJ7cD30qKQ+eUp4lopXpSiaTihUq1guYpyzCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T05:17:45.233996Z"},"content_sha256":"1e6ddd3ca7ebbac0d522af135c5d952fe68cff8306dbb73c593cdae71f74952b","schema_version":"1.0","event_id":"sha256:1e6ddd3ca7ebbac0d522af135c5d952fe68cff8306dbb73c593cdae71f74952b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:UUGBYOMFF5CK6IDOBPUGRO6ZRG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gaussian Half-Duplex Relay Networks: improved constant gap and connections with the assignment problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniela Tuninetti, Martina Cardone, Raymond Knopp, Umer Salim","submitted_at":"2013-04-21T19:58:38Z","abstract_excerpt":"This paper considers a general Gaussian relay network where a source transmits a message to a destination with the help of N half-duplex relays. It proves that the information theoretic cut-set upper bound to the capacity can be achieved to within 2:021(N +2) bits with noisy network coding, thereby reducing the previously known gap. Further improved gap results are presented for more structured networks like diamond networks. It is then shown that the generalized Degrees-of-Freedom of a general Gaussian half-duplex relay network is the solution of a linear program, where the coefficients of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5790","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-18T00:59:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PI89jJSyuxuJrxrper6uPysc6JlGpZZ2yvzYzr+t58x9X/OF/EoShd8oZbwA1ItmFhtgxY1BrbpP/TNrYm9SCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T05:17:45.234738Z"},"content_sha256":"f09113366189f3f7144ca66d4a855e2d1bfd5ef4a7a6e3562d3c449536b2ec56","schema_version":"1.0","event_id":"sha256:f09113366189f3f7144ca66d4a855e2d1bfd5ef4a7a6e3562d3c449536b2ec56"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UUGBYOMFF5CK6IDOBPUGRO6ZRG/bundle.json","state_url":"https://pith.science/pith/UUGBYOMFF5CK6IDOBPUGRO6ZRG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UUGBYOMFF5CK6IDOBPUGRO6ZRG/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-08T05:17:45Z","links":{"resolver":"https://pith.science/pith/UUGBYOMFF5CK6IDOBPUGRO6ZRG","bundle":"https://pith.science/pith/UUGBYOMFF5CK6IDOBPUGRO6ZRG/bundle.json","state":"https://pith.science/pith/UUGBYOMFF5CK6IDOBPUGRO6ZRG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UUGBYOMFF5CK6IDOBPUGRO6ZRG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:UUGBYOMFF5CK6IDOBPUGRO6ZRG","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":"392ce83cedd1ae3eac92f3c699e7ca82b0fa3e573d792e15fc38896d2c13dad6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-21T19:58:38Z","title_canon_sha256":"099a59bcae6dee6831bbf12805d431f7cceb3de05237403793cf3c8b1aca7a60"},"schema_version":"1.0","source":{"id":"1304.5790","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5790","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5790v2","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5790","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"pith_short_12","alias_value":"UUGBYOMFF5CK","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UUGBYOMFF5CK6IDO","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UUGBYOMF","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:f09113366189f3f7144ca66d4a855e2d1bfd5ef4a7a6e3562d3c449536b2ec56","target":"graph","created_at":"2026-05-18T00:59:04Z","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 considers a general Gaussian relay network where a source transmits a message to a destination with the help of N half-duplex relays. It proves that the information theoretic cut-set upper bound to the capacity can be achieved to within 2:021(N +2) bits with noisy network coding, thereby reducing the previously known gap. Further improved gap results are presented for more structured networks like diamond networks. It is then shown that the generalized Degrees-of-Freedom of a general Gaussian half-duplex relay network is the solution of a linear program, where the coefficients of th","authors_text":"Daniela Tuninetti, Martina Cardone, Raymond Knopp, Umer Salim","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-21T19:58:38Z","title":"Gaussian Half-Duplex Relay Networks: improved constant gap and connections with the assignment problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5790","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:1e6ddd3ca7ebbac0d522af135c5d952fe68cff8306dbb73c593cdae71f74952b","target":"record","created_at":"2026-05-18T00:59:04Z","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":"392ce83cedd1ae3eac92f3c699e7ca82b0fa3e573d792e15fc38896d2c13dad6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-21T19:58:38Z","title_canon_sha256":"099a59bcae6dee6831bbf12805d431f7cceb3de05237403793cf3c8b1aca7a60"},"schema_version":"1.0","source":{"id":"1304.5790","kind":"arxiv","version":2}},"canonical_sha256":"a50c1c39852f44af206e0be868bbd989b60156ec97493e3208c7d9ce6585afc9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a50c1c39852f44af206e0be868bbd989b60156ec97493e3208c7d9ce6585afc9","first_computed_at":"2026-05-18T00:59:04.119139Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:04.119139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jX3cQdvx9ZbAKkcEt2Rrsyyc4JC5MSwcUCsGq9ul3Kc48I0mkmwvNEzVzcEwzYqppsIDR9DeZsUYq9p3gTOaDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:04.119883Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.5790","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e6ddd3ca7ebbac0d522af135c5d952fe68cff8306dbb73c593cdae71f74952b","sha256:f09113366189f3f7144ca66d4a855e2d1bfd5ef4a7a6e3562d3c449536b2ec56"],"state_sha256":"9584f08aca1b6ac44a10af75acb95dd2d3572b3b9905b9f7be13d4ebd6eb0102"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f6KRwd0lnT0+2oRCYGZD/7JEtwewozmddEOK1Iz7UmqqACWiExzzqIC+R8QQbm4e6M/Xb9bFne/z7lRSmc65DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T05:17:45.238582Z","bundle_sha256":"43a32ce9419e8935f427220b57ef97e1639ec5ef6eb543f066de10de71cee560"}}