{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IDJHY53C43VDDJF5XVBRXNRV5R","short_pith_number":"pith:IDJHY53C","schema_version":"1.0","canonical_sha256":"40d27c7762e6ea31a4bdbd431bb635ec75cd063dfcbd1acef1253190da6bfde8","source":{"kind":"arxiv","id":"1607.01441","version":3},"attestation_state":"computed","paper":{"title":"Network Simplification in Half-Duplex: Building on Submodularity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christina Fragouli, Daniela Tuninetti, Martina Cardone, Yahya H. Ezzeldin","submitted_at":"2016-07-06T00:00:34Z","abstract_excerpt":"This paper explores the {\\it network simplification} problem in the context of Gaussian Half-Duplex (HD) diamond networks. Specifically, given an $N$-relay diamond network, this problem seeks to derive fundamental guarantees on the capacity of the best $k$-relay subnetwork, as a function of the full network capacity. The main focus of this work is on the case when $k=N-1$ relays are selected out of the $N$ possible ones. First, a simple algorithm, which removes the relay with the minimum capacity (i.e., the worst relay), is analyzed and it is shown that the remaining $(N-1)$-relay subnetwork h"},"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":"1607.01441","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-06T00:00:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"09f1805960e134af909bc78ff2102b05a9de055b4eda3c8d6baf356056db30a8","abstract_canon_sha256":"00ede2068e2cd0e49a645d88b41f41f95a3b4969efc45fb34920ae32157b9897"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:41.240151Z","signature_b64":"jn3ymvo8ib9WBfSuwIXj3CLK/uaz5/X7pTlaq3omfvWoHYO+jRyZt4U+qmPgqTPkik9drW+yepiiZdElTfsPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40d27c7762e6ea31a4bdbd431bb635ec75cd063dfcbd1acef1253190da6bfde8","last_reissued_at":"2026-05-18T00:40:41.239451Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:41.239451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Network Simplification in Half-Duplex: Building on Submodularity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christina Fragouli, Daniela Tuninetti, Martina Cardone, Yahya H. Ezzeldin","submitted_at":"2016-07-06T00:00:34Z","abstract_excerpt":"This paper explores the {\\it network simplification} problem in the context of Gaussian Half-Duplex (HD) diamond networks. Specifically, given an $N$-relay diamond network, this problem seeks to derive fundamental guarantees on the capacity of the best $k$-relay subnetwork, as a function of the full network capacity. The main focus of this work is on the case when $k=N-1$ relays are selected out of the $N$ possible ones. First, a simple algorithm, which removes the relay with the minimum capacity (i.e., the worst relay), is analyzed and it is shown that the remaining $(N-1)$-relay subnetwork h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01441","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.01441","created_at":"2026-05-18T00:40:41.239564+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.01441v3","created_at":"2026-05-18T00:40:41.239564+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01441","created_at":"2026-05-18T00:40:41.239564+00:00"},{"alias_kind":"pith_short_12","alias_value":"IDJHY53C43VD","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IDJHY53C43VDDJF5","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IDJHY53C","created_at":"2026-05-18T12:30:22.444734+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/IDJHY53C43VDDJF5XVBRXNRV5R","json":"https://pith.science/pith/IDJHY53C43VDDJF5XVBRXNRV5R.json","graph_json":"https://pith.science/api/pith-number/IDJHY53C43VDDJF5XVBRXNRV5R/graph.json","events_json":"https://pith.science/api/pith-number/IDJHY53C43VDDJF5XVBRXNRV5R/events.json","paper":"https://pith.science/paper/IDJHY53C"},"agent_actions":{"view_html":"https://pith.science/pith/IDJHY53C43VDDJF5XVBRXNRV5R","download_json":"https://pith.science/pith/IDJHY53C43VDDJF5XVBRXNRV5R.json","view_paper":"https://pith.science/paper/IDJHY53C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.01441&json=true","fetch_graph":"https://pith.science/api/pith-number/IDJHY53C43VDDJF5XVBRXNRV5R/graph.json","fetch_events":"https://pith.science/api/pith-number/IDJHY53C43VDDJF5XVBRXNRV5R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IDJHY53C43VDDJF5XVBRXNRV5R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IDJHY53C43VDDJF5XVBRXNRV5R/action/storage_attestation","attest_author":"https://pith.science/pith/IDJHY53C43VDDJF5XVBRXNRV5R/action/author_attestation","sign_citation":"https://pith.science/pith/IDJHY53C43VDDJF5XVBRXNRV5R/action/citation_signature","submit_replication":"https://pith.science/pith/IDJHY53C43VDDJF5XVBRXNRV5R/action/replication_record"}},"created_at":"2026-05-18T00:40:41.239564+00:00","updated_at":"2026-05-18T00:40:41.239564+00:00"}