{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CEJRO2UCHNUFN444OKXIRWCLNW","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":"3b2730ff651b2c09f2e8cd05000fe21908f9d88d0230536a14964816b2bd453c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-21T20:38:59Z","title_canon_sha256":"194ec45019ff0eddc7880549a0df6e9a80ea397f077478cc0d9b3aa32712f4f9"},"schema_version":"1.0","source":{"id":"1601.05776","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05776","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05776v2","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05776","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"pith_short_12","alias_value":"CEJRO2UCHNUF","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CEJRO2UCHNUFN444","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CEJRO2UC","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:c1a8fb8a724e638efa164a3e94194341e651bd1342c4adc3ce6179792304cc00","target":"graph","created_at":"2026-05-18T00:03:25Z","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 consider an arbitrary layered Gaussian relay network with $L$ layers of $N$ relays each, from which we select subnetworks with $K$ relays per layer. We prove that: (i) For arbitrary $L, N$ and $K = 1$, there always exists a subnetwork that approximately achieves $\\frac{2}{(L-1)N + 4}$ $\\left(\\mbox{resp.}\\frac{2}{LN+2}\\right)$ of the network capacity for odd $L$ (resp. even $L$), (ii) For $L = 2, N = 3, K = 2$, there always exists a subnetwork that approximately achieves $\\frac{1}{2}$ of the network capacity. We also provide example networks where even the best subnetworks achieve exactly th","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":"2016-01-21T20:38:59Z","title":"Wireless Network Simplification : Beyond Diamond Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05776","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:003d6557c7cba8eac9023251ed5f228121cabd7636f6f1a29836547e4ee4220c","target":"record","created_at":"2026-05-18T00:03:25Z","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":"3b2730ff651b2c09f2e8cd05000fe21908f9d88d0230536a14964816b2bd453c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-21T20:38:59Z","title_canon_sha256":"194ec45019ff0eddc7880549a0df6e9a80ea397f077478cc0d9b3aa32712f4f9"},"schema_version":"1.0","source":{"id":"1601.05776","kind":"arxiv","version":2}},"canonical_sha256":"1113176a823b6856f39c72ae88d84b6d92f9730f3a9041cd27428a5d0db6bb4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1113176a823b6856f39c72ae88d84b6d92f9730f3a9041cd27428a5d0db6bb4f","first_computed_at":"2026-05-18T00:03:25.433594Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:25.433594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IeizDKPSQYI4ckM1xn86LHvbc9H+T9L1g9UcEVuTUnP4UMbSoGAezjwhQDDh6cdOIZ7S1/lcKhZNI+Np5RkLDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:25.434214Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.05776","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:003d6557c7cba8eac9023251ed5f228121cabd7636f6f1a29836547e4ee4220c","sha256:c1a8fb8a724e638efa164a3e94194341e651bd1342c4adc3ce6179792304cc00"],"state_sha256":"ebf014e46a4c02b11100cec427e484d104925405000aa9c5398076dfab9e48d0"}