{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:TNDYYDBPJTES7UTSSMXQK4TKKO","short_pith_number":"pith:TNDYYDBP","canonical_record":{"source":{"id":"1103.2046","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-10T14:25:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9b109fd64a74e2e97ce46919c5d7cbdce42c31cc5a61a8f4c2ba96a02317ada3","abstract_canon_sha256":"8c4045969da6465683afb89645b8e57c6b3055552d68fdbc49548c8610848e24"},"schema_version":"1.0"},"canonical_sha256":"9b478c0c2f4cc92fd272932f05726a53addb073345b2ff26be497988eca4432c","source":{"kind":"arxiv","id":"1103.2046","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:TNDYYDBPJTES7UTSSMXQK4TKKO","target":"record","payload":{"canonical_record":{"source":{"id":"1103.2046","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-10T14:25:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9b109fd64a74e2e97ce46919c5d7cbdce42c31cc5a61a8f4c2ba96a02317ada3","abstract_canon_sha256":"8c4045969da6465683afb89645b8e57c6b3055552d68fdbc49548c8610848e24"},"schema_version":"1.0"},"canonical_sha256":"9b478c0c2f4cc92fd272932f05726a53addb073345b2ff26be497988eca4432c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:49.696536Z","signature_b64":"SIkpjbw8VOFib0k5pvNEpHMO4oAcgxI0jxeiIXwbtSog/07iyaESMry7niKg29OswFfhtWvwMpmpmXwqmI8xDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b478c0c2f4cc92fd272932f05726a53addb073345b2ff26be497988eca4432c","last_reissued_at":"2026-05-18T03:40:49.695691Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:49.695691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.2046","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:40:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Z9Q/6vCkCLv3sB9nfM2JYPjteQsa3V27Ssv/Sl7yjbPbYKo/GBCTXALy/EEXIPWjz3TfyPMb8EoMQJXJpkFDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:32:50.413057Z"},"content_sha256":"1708eb4ab65f45a77cc29d19c2aa5b046062a5ceb6aa3dc7cdbfb2aba8caa1e7","schema_version":"1.0","event_id":"sha256:1708eb4ab65f45a77cc29d19c2aa5b046062a5ceb6aa3dc7cdbfb2aba8caa1e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:TNDYYDBPJTES7UTSSMXQK4TKKO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Wireless Network Simplification: the Gaussian N-Relay Diamond Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ayfer Ozgur, Caner Nazaroglu, Christina Fragouli","submitted_at":"2011-03-10T14:25:20Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2046","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:40:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cO7058T6p2CxgwXivMzWEdSrvhAWuJ+xl2QWYAZzrPtvmDd9ixSWz4TJD5nUsoSB4eE/baippLQzJ0qifPRKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:32:50.413420Z"},"content_sha256":"55fd4b3453ad3dd12532ea4722db4319fc16f23e31d832739d28a0f2013c0d44","schema_version":"1.0","event_id":"sha256:55fd4b3453ad3dd12532ea4722db4319fc16f23e31d832739d28a0f2013c0d44"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TNDYYDBPJTES7UTSSMXQK4TKKO/bundle.json","state_url":"https://pith.science/pith/TNDYYDBPJTES7UTSSMXQK4TKKO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TNDYYDBPJTES7UTSSMXQK4TKKO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T13:32:50Z","links":{"resolver":"https://pith.science/pith/TNDYYDBPJTES7UTSSMXQK4TKKO","bundle":"https://pith.science/pith/TNDYYDBPJTES7UTSSMXQK4TKKO/bundle.json","state":"https://pith.science/pith/TNDYYDBPJTES7UTSSMXQK4TKKO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TNDYYDBPJTES7UTSSMXQK4TKKO/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T3v7PMSU9E75L1SnY66K9O7Qx1WcakD7hTqvFtkCtvvRhOKmhf6nA1YtwBgzslRYM3YJ1pX6+bO6j+uW966SDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:32:50.415428Z","bundle_sha256":"10b6bb96342bdafbdd0b070e10aa9d1aa19ad2a4c85808aa5084a34274580f9b"}}