{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CEJRO2UCHNUFN444OKXIRWCLNW","short_pith_number":"pith:CEJRO2UC","schema_version":"1.0","canonical_sha256":"1113176a823b6856f39c72ae88d84b6d92f9730f3a9041cd27428a5d0db6bb4f","source":{"kind":"arxiv","id":"1601.05776","version":2},"attestation_state":"computed","paper":{"title":"Wireless Network Simplification : Beyond Diamond Networks","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":"2016-01-21T20:38:59Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1601.05776","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-21T20:38:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"194ec45019ff0eddc7880549a0df6e9a80ea397f077478cc0d9b3aa32712f4f9","abstract_canon_sha256":"3b2730ff651b2c09f2e8cd05000fe21908f9d88d0230536a14964816b2bd453c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:25.434214Z","signature_b64":"IeizDKPSQYI4ckM1xn86LHvbc9H+T9L1g9UcEVuTUnP4UMbSoGAezjwhQDDh6cdOIZ7S1/lcKhZNI+Np5RkLDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1113176a823b6856f39c72ae88d84b6d92f9730f3a9041cd27428a5d0db6bb4f","last_reissued_at":"2026-05-18T00:03:25.433594Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:25.433594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Wireless Network Simplification : Beyond Diamond Networks","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":"2016-01-21T20:38:59Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05776","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.05776","created_at":"2026-05-18T00:03:25.433673+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.05776v2","created_at":"2026-05-18T00:03:25.433673+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05776","created_at":"2026-05-18T00:03:25.433673+00:00"},{"alias_kind":"pith_short_12","alias_value":"CEJRO2UCHNUF","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CEJRO2UCHNUFN444","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CEJRO2UC","created_at":"2026-05-18T12:30:09.641336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CEJRO2UCHNUFN444OKXIRWCLNW","json":"https://pith.science/pith/CEJRO2UCHNUFN444OKXIRWCLNW.json","graph_json":"https://pith.science/api/pith-number/CEJRO2UCHNUFN444OKXIRWCLNW/graph.json","events_json":"https://pith.science/api/pith-number/CEJRO2UCHNUFN444OKXIRWCLNW/events.json","paper":"https://pith.science/paper/CEJRO2UC"},"agent_actions":{"view_html":"https://pith.science/pith/CEJRO2UCHNUFN444OKXIRWCLNW","download_json":"https://pith.science/pith/CEJRO2UCHNUFN444OKXIRWCLNW.json","view_paper":"https://pith.science/paper/CEJRO2UC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.05776&json=true","fetch_graph":"https://pith.science/api/pith-number/CEJRO2UCHNUFN444OKXIRWCLNW/graph.json","fetch_events":"https://pith.science/api/pith-number/CEJRO2UCHNUFN444OKXIRWCLNW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CEJRO2UCHNUFN444OKXIRWCLNW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CEJRO2UCHNUFN444OKXIRWCLNW/action/storage_attestation","attest_author":"https://pith.science/pith/CEJRO2UCHNUFN444OKXIRWCLNW/action/author_attestation","sign_citation":"https://pith.science/pith/CEJRO2UCHNUFN444OKXIRWCLNW/action/citation_signature","submit_replication":"https://pith.science/pith/CEJRO2UCHNUFN444OKXIRWCLNW/action/replication_record"}},"created_at":"2026-05-18T00:03:25.433673+00:00","updated_at":"2026-05-18T00:03:25.433673+00:00"}