{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IDJHY53C43VDDJF5XVBRXNRV5R","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":"00ede2068e2cd0e49a645d88b41f41f95a3b4969efc45fb34920ae32157b9897","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-06T00:00:34Z","title_canon_sha256":"09f1805960e134af909bc78ff2102b05a9de055b4eda3c8d6baf356056db30a8"},"schema_version":"1.0","source":{"id":"1607.01441","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01441","created_at":"2026-05-18T00:40:41Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01441v3","created_at":"2026-05-18T00:40:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01441","created_at":"2026-05-18T00:40:41Z"},{"alias_kind":"pith_short_12","alias_value":"IDJHY53C43VD","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IDJHY53C43VDDJF5","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IDJHY53C","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:451b444e808b7688d2bbaa4976a261623fa7b7efff0222407d33137465f9bbcd","target":"graph","created_at":"2026-05-18T00:40:41Z","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 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","authors_text":"Christina Fragouli, Daniela Tuninetti, Martina Cardone, Yahya H. Ezzeldin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-06T00:00:34Z","title":"Network Simplification in Half-Duplex: Building on Submodularity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01441","kind":"arxiv","version":3},"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:3320e6a5f195f93321dde04146c267efc223a797e3de3088cc554c6048f0f317","target":"record","created_at":"2026-05-18T00:40:41Z","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":"00ede2068e2cd0e49a645d88b41f41f95a3b4969efc45fb34920ae32157b9897","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-06T00:00:34Z","title_canon_sha256":"09f1805960e134af909bc78ff2102b05a9de055b4eda3c8d6baf356056db30a8"},"schema_version":"1.0","source":{"id":"1607.01441","kind":"arxiv","version":3}},"canonical_sha256":"40d27c7762e6ea31a4bdbd431bb635ec75cd063dfcbd1acef1253190da6bfde8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40d27c7762e6ea31a4bdbd431bb635ec75cd063dfcbd1acef1253190da6bfde8","first_computed_at":"2026-05-18T00:40:41.239451Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:41.239451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jn3ymvo8ib9WBfSuwIXj3CLK/uaz5/X7pTlaq3omfvWoHYO+jRyZt4U+qmPgqTPkik9drW+yepiiZdElTfsPBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:41.240151Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.01441","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3320e6a5f195f93321dde04146c267efc223a797e3de3088cc554c6048f0f317","sha256:451b444e808b7688d2bbaa4976a261623fa7b7efff0222407d33137465f9bbcd"],"state_sha256":"88beb83def55d2c196c7fed9eec1c445508e4c963a587a9823f8947eb06e09de"}