{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XVYQ5G6VBDUGMGGZJJHHJ5NLV2","short_pith_number":"pith:XVYQ5G6V","canonical_record":{"source":{"id":"1711.01007","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-03T03:16:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6ec772d537245c7825ccabad2d23e2214c156ac237ca1695f7bf3db988ef8509","abstract_canon_sha256":"1cb818a1f443fd9032ef3efc51e6f10e090fcb50709e8ece56482818f41b401a"},"schema_version":"1.0"},"canonical_sha256":"bd710e9bd508e86618d94a4e74f5abae8c91aed658fc5aeecb31e9a24ccf1e1a","source":{"kind":"arxiv","id":"1711.01007","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01007","created_at":"2026-05-18T00:31:24Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01007v1","created_at":"2026-05-18T00:31:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01007","created_at":"2026-05-18T00:31:24Z"},{"alias_kind":"pith_short_12","alias_value":"XVYQ5G6VBDUG","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XVYQ5G6VBDUGMGGZ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XVYQ5G6V","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XVYQ5G6VBDUGMGGZJJHHJ5NLV2","target":"record","payload":{"canonical_record":{"source":{"id":"1711.01007","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-03T03:16:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6ec772d537245c7825ccabad2d23e2214c156ac237ca1695f7bf3db988ef8509","abstract_canon_sha256":"1cb818a1f443fd9032ef3efc51e6f10e090fcb50709e8ece56482818f41b401a"},"schema_version":"1.0"},"canonical_sha256":"bd710e9bd508e86618d94a4e74f5abae8c91aed658fc5aeecb31e9a24ccf1e1a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:24.294564Z","signature_b64":"i95FdnpeXjudNKefqHuIJi/1sBbeBoxvQuQiMmr+GYjuE/3SLZ0X/R/23fPlpUPOIP+FNI6DovilK5xBMGQ8BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd710e9bd508e86618d94a4e74f5abae8c91aed658fc5aeecb31e9a24ccf1e1a","last_reissued_at":"2026-05-18T00:31:24.294066Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:24.294066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.01007","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-18T00:31:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xGvukBf/8QH1wwGsD4EaP+eNaBPwPY2vZ2IHpSxug/lAL0qL9fsS4PaaBACsA7HFxQ8S87XfMSWdU3Q/QXviDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T12:15:47.560777Z"},"content_sha256":"e8fa80e392575fc748c22f8a99f2a150b76f5a5129e37643acaa5f342cf4b387","schema_version":"1.0","event_id":"sha256:e8fa80e392575fc748c22f8a99f2a150b76f5a5129e37643acaa5f342cf4b387"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XVYQ5G6VBDUGMGGZJJHHJ5NLV2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Wireless Network Simplification: The Performance of Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ayan Sengupta, Christina Fragouli, Yahya H. Ezzeldin","submitted_at":"2017-11-03T03:16:51Z","abstract_excerpt":"Consider a wireless Gaussian network where a source wishes to communicate with a destination with the help of N full-duplex relay nodes. Most practical systems today route information from the source to the destination using the best path that connects them. In this paper, we show that routing can in the worst case result in an unbounded gap from the network capacity - or reversely, physical layer cooperation can offer unbounded gains over routing. More specifically, we show that for $N$-relay Gaussian networks with an arbitrary topology, routing can in the worst case guarantee an approximate "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01007","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-18T00:31:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"swyCLLia5WWXtz2YlwYMjvjxDPG7uRPI/Jmx2UGOtq/epMAsDm2SPpf4HJA1l5KnHrCmDmSMjmfiQ1Un6YYICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T12:15:47.561128Z"},"content_sha256":"7642a38cb3e965919d300d05342a7319f594aa42afcb23d2f0630a4d8dd15c97","schema_version":"1.0","event_id":"sha256:7642a38cb3e965919d300d05342a7319f594aa42afcb23d2f0630a4d8dd15c97"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XVYQ5G6VBDUGMGGZJJHHJ5NLV2/bundle.json","state_url":"https://pith.science/pith/XVYQ5G6VBDUGMGGZJJHHJ5NLV2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XVYQ5G6VBDUGMGGZJJHHJ5NLV2/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-25T12:15:47Z","links":{"resolver":"https://pith.science/pith/XVYQ5G6VBDUGMGGZJJHHJ5NLV2","bundle":"https://pith.science/pith/XVYQ5G6VBDUGMGGZJJHHJ5NLV2/bundle.json","state":"https://pith.science/pith/XVYQ5G6VBDUGMGGZJJHHJ5NLV2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XVYQ5G6VBDUGMGGZJJHHJ5NLV2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XVYQ5G6VBDUGMGGZJJHHJ5NLV2","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":"1cb818a1f443fd9032ef3efc51e6f10e090fcb50709e8ece56482818f41b401a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-03T03:16:51Z","title_canon_sha256":"6ec772d537245c7825ccabad2d23e2214c156ac237ca1695f7bf3db988ef8509"},"schema_version":"1.0","source":{"id":"1711.01007","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01007","created_at":"2026-05-18T00:31:24Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01007v1","created_at":"2026-05-18T00:31:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01007","created_at":"2026-05-18T00:31:24Z"},{"alias_kind":"pith_short_12","alias_value":"XVYQ5G6VBDUG","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XVYQ5G6VBDUGMGGZ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XVYQ5G6V","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:7642a38cb3e965919d300d05342a7319f594aa42afcb23d2f0630a4d8dd15c97","target":"graph","created_at":"2026-05-18T00:31:24Z","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 wireless Gaussian network where a source wishes to communicate with a destination with the help of N full-duplex relay nodes. Most practical systems today route information from the source to the destination using the best path that connects them. In this paper, we show that routing can in the worst case result in an unbounded gap from the network capacity - or reversely, physical layer cooperation can offer unbounded gains over routing. More specifically, we show that for $N$-relay Gaussian networks with an arbitrary topology, routing can in the worst case guarantee an approximate ","authors_text":"Ayan Sengupta, Christina Fragouli, Yahya H. Ezzeldin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-03T03:16:51Z","title":"Wireless Network Simplification: The Performance of Routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01007","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:e8fa80e392575fc748c22f8a99f2a150b76f5a5129e37643acaa5f342cf4b387","target":"record","created_at":"2026-05-18T00:31:24Z","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":"1cb818a1f443fd9032ef3efc51e6f10e090fcb50709e8ece56482818f41b401a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-03T03:16:51Z","title_canon_sha256":"6ec772d537245c7825ccabad2d23e2214c156ac237ca1695f7bf3db988ef8509"},"schema_version":"1.0","source":{"id":"1711.01007","kind":"arxiv","version":1}},"canonical_sha256":"bd710e9bd508e86618d94a4e74f5abae8c91aed658fc5aeecb31e9a24ccf1e1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd710e9bd508e86618d94a4e74f5abae8c91aed658fc5aeecb31e9a24ccf1e1a","first_computed_at":"2026-05-18T00:31:24.294066Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:24.294066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i95FdnpeXjudNKefqHuIJi/1sBbeBoxvQuQiMmr+GYjuE/3SLZ0X/R/23fPlpUPOIP+FNI6DovilK5xBMGQ8BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:24.294564Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.01007","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8fa80e392575fc748c22f8a99f2a150b76f5a5129e37643acaa5f342cf4b387","sha256:7642a38cb3e965919d300d05342a7319f594aa42afcb23d2f0630a4d8dd15c97"],"state_sha256":"eaaf8d9814e743d9d1298f017d99d4a08346be29c3a44a1bce6d84bf80d499dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KPMASHrFYnOHQEp8PT/mzB7VBYHCYJl6TtrA7Qs+JxDs0Fn15mvF8qD9aq+Fwntf90AT4eTr+GP45wN8IBHTCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T12:15:47.563587Z","bundle_sha256":"45c7fa51da73fae8906c432009e12504632a6f7f6584712a3e9ec43422878985"}}