{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:TNDYYDBPJTES7UTSSMXQK4TKKO","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":"8c4045969da6465683afb89645b8e57c6b3055552d68fdbc49548c8610848e24","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-10T14:25:20Z","title_canon_sha256":"9b109fd64a74e2e97ce46919c5d7cbdce42c31cc5a61a8f4c2ba96a02317ada3"},"schema_version":"1.0","source":{"id":"1103.2046","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.2046","created_at":"2026-05-18T03:40:49Z"},{"alias_kind":"arxiv_version","alias_value":"1103.2046v2","created_at":"2026-05-18T03:40:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2046","created_at":"2026-05-18T03:40:49Z"},{"alias_kind":"pith_short_12","alias_value":"TNDYYDBPJTES","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TNDYYDBPJTES7UTS","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TNDYYDBP","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:55fd4b3453ad3dd12532ea4722db4319fc16f23e31d832739d28a0f2013c0d44","target":"graph","created_at":"2026-05-18T03:40:49Z","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 the Gaussian N-relay diamond network, where a source wants to communicate to a destination node through a layer of N-relay nodes. We investigate the following question: what fraction of the capacity can we maintain by using only k out of the N available relays? We show that independent of the channel configurations and the operating SNR, we can always find a subset of k relays which alone provide a rate (kC/(k+1))-G, where C is the information theoretic cutset upper bound on the capacity of the whole network and G is a constant that depends only on N and k (logarithmic in N and lin","authors_text":"Ayfer Ozgur, Caner Nazaroglu, Christina Fragouli","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-10T14:25:20Z","title":"Wireless Network Simplification: the Gaussian N-Relay Diamond Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2046","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:1708eb4ab65f45a77cc29d19c2aa5b046062a5ceb6aa3dc7cdbfb2aba8caa1e7","target":"record","created_at":"2026-05-18T03:40:49Z","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":"8c4045969da6465683afb89645b8e57c6b3055552d68fdbc49548c8610848e24","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-10T14:25:20Z","title_canon_sha256":"9b109fd64a74e2e97ce46919c5d7cbdce42c31cc5a61a8f4c2ba96a02317ada3"},"schema_version":"1.0","source":{"id":"1103.2046","kind":"arxiv","version":2}},"canonical_sha256":"9b478c0c2f4cc92fd272932f05726a53addb073345b2ff26be497988eca4432c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b478c0c2f4cc92fd272932f05726a53addb073345b2ff26be497988eca4432c","first_computed_at":"2026-05-18T03:40:49.695691Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:40:49.695691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SIkpjbw8VOFib0k5pvNEpHMO4oAcgxI0jxeiIXwbtSog/07iyaESMry7niKg29OswFfhtWvwMpmpmXwqmI8xDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:40:49.696536Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.2046","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1708eb4ab65f45a77cc29d19c2aa5b046062a5ceb6aa3dc7cdbfb2aba8caa1e7","sha256:55fd4b3453ad3dd12532ea4722db4319fc16f23e31d832739d28a0f2013c0d44"],"state_sha256":"692356d787264230ba78bdb6d2c8a3e0f719997c710dffe83a79d2af239ddc50"}