{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:D3X7CTPZ7ZURIHK7ZVDTMTLIDS","short_pith_number":"pith:D3X7CTPZ","canonical_record":{"source":{"id":"1601.05161","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-20T03:43:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ac6b1365a8a9400b8d14d1fb31b8ddd6e67ebd662ea56cf9b9f457b003fee25a","abstract_canon_sha256":"924638506e2e96434aea104888442a321d5332687d3ecf4c8af9556acede9ea9"},"schema_version":"1.0"},"canonical_sha256":"1eeff14df9fe69141d5fcd47364d681cac88d508a4e1cc6593b06ab0860d7e30","source":{"kind":"arxiv","id":"1601.05161","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05161","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05161v2","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05161","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"pith_short_12","alias_value":"D3X7CTPZ7ZUR","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"D3X7CTPZ7ZURIHK7","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"D3X7CTPZ","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:D3X7CTPZ7ZURIHK7ZVDTMTLIDS","target":"record","payload":{"canonical_record":{"source":{"id":"1601.05161","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-20T03:43:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ac6b1365a8a9400b8d14d1fb31b8ddd6e67ebd662ea56cf9b9f457b003fee25a","abstract_canon_sha256":"924638506e2e96434aea104888442a321d5332687d3ecf4c8af9556acede9ea9"},"schema_version":"1.0"},"canonical_sha256":"1eeff14df9fe69141d5fcd47364d681cac88d508a4e1cc6593b06ab0860d7e30","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:25.441838Z","signature_b64":"7wHU+QryxJI9CyuFkN3T4di10bmxc2aLNMlmMIbs2R73hpR0d4nFFZFt3B9rG6IAk0bE/YAxSIUqQLwAkO5KBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1eeff14df9fe69141d5fcd47364d681cac88d508a4e1cc6593b06ab0860d7e30","last_reissued_at":"2026-05-18T00:03:25.441225Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:25.441225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.05161","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-18T00:03:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RtpBqdGep2Jj/IvBub5WjNpwoE4f1mwVVsAzyJ79YxqwHZS+BtfbeETRmNXuFnM0FmonMoEi7zyv1NcVKewmCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:47:52.680784Z"},"content_sha256":"3e958f8529993fa81ee279b124b4aeef939fd5fde4b0def34c8e4053a51e9999","schema_version":"1.0","event_id":"sha256:3e958f8529993fa81ee279b124b4aeef939fd5fde4b0def34c8e4053a51e9999"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:D3X7CTPZ7ZURIHK7ZVDTMTLIDS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Network Simplification for Gaussian Half-Duplex Diamond Networks","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","submitted_at":"2016-01-20T03:43:12Z","abstract_excerpt":"This paper investigates the simplification problem in Gaussian Half-Duplex (HD) diamond networks. The goal is to answer the following question: what is the minimum (worst-case) fraction of the total HD capacity that one can always achieve by smartly selecting a subset of $k$ relays, out of the $N$ possible ones? We make progress on this problem for $k=1$ and $k=2$ and show that for $N=k+1, \\ k \\in \\{1,2\\}$ at least $\\frac{k}{k+1}$ of the total HD capacity is always {approximately (i.e., up to a constant gap)} achieved. Interestingly, and differently from the Full-Duplex (FD) case, the ratio in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05161","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-18T00:03:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I3Cf0ZY9RY33EXl2OmSWAdMWA+UYfyDKQeUMerTmFA2/8+wZHk/GHQvncdpa/CPSD8JeX40HmFME9mV5efPSBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:47:52.681130Z"},"content_sha256":"cccd9e25abe4c956b2408ed75ae2fd13d567a33c0be881dbbc41c2687e8051e1","schema_version":"1.0","event_id":"sha256:cccd9e25abe4c956b2408ed75ae2fd13d567a33c0be881dbbc41c2687e8051e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D3X7CTPZ7ZURIHK7ZVDTMTLIDS/bundle.json","state_url":"https://pith.science/pith/D3X7CTPZ7ZURIHK7ZVDTMTLIDS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D3X7CTPZ7ZURIHK7ZVDTMTLIDS/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-30T08:47:52Z","links":{"resolver":"https://pith.science/pith/D3X7CTPZ7ZURIHK7ZVDTMTLIDS","bundle":"https://pith.science/pith/D3X7CTPZ7ZURIHK7ZVDTMTLIDS/bundle.json","state":"https://pith.science/pith/D3X7CTPZ7ZURIHK7ZVDTMTLIDS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D3X7CTPZ7ZURIHK7ZVDTMTLIDS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:D3X7CTPZ7ZURIHK7ZVDTMTLIDS","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":"924638506e2e96434aea104888442a321d5332687d3ecf4c8af9556acede9ea9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-20T03:43:12Z","title_canon_sha256":"ac6b1365a8a9400b8d14d1fb31b8ddd6e67ebd662ea56cf9b9f457b003fee25a"},"schema_version":"1.0","source":{"id":"1601.05161","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05161","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05161v2","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05161","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"pith_short_12","alias_value":"D3X7CTPZ7ZUR","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"D3X7CTPZ7ZURIHK7","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"D3X7CTPZ","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:cccd9e25abe4c956b2408ed75ae2fd13d567a33c0be881dbbc41c2687e8051e1","target":"graph","created_at":"2026-05-18T00:03:25Z","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 investigates the simplification problem in Gaussian Half-Duplex (HD) diamond networks. The goal is to answer the following question: what is the minimum (worst-case) fraction of the total HD capacity that one can always achieve by smartly selecting a subset of $k$ relays, out of the $N$ possible ones? We make progress on this problem for $k=1$ and $k=2$ and show that for $N=k+1, \\ k \\in \\{1,2\\}$ at least $\\frac{k}{k+1}$ of the total HD capacity is always {approximately (i.e., up to a constant gap)} achieved. Interestingly, and differently from the Full-Duplex (FD) case, the ratio in","authors_text":"Christina Fragouli, Daniela Tuninetti, Martina Cardone","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-20T03:43:12Z","title":"On Network Simplification for Gaussian Half-Duplex Diamond Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05161","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:3e958f8529993fa81ee279b124b4aeef939fd5fde4b0def34c8e4053a51e9999","target":"record","created_at":"2026-05-18T00:03:25Z","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":"924638506e2e96434aea104888442a321d5332687d3ecf4c8af9556acede9ea9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-20T03:43:12Z","title_canon_sha256":"ac6b1365a8a9400b8d14d1fb31b8ddd6e67ebd662ea56cf9b9f457b003fee25a"},"schema_version":"1.0","source":{"id":"1601.05161","kind":"arxiv","version":2}},"canonical_sha256":"1eeff14df9fe69141d5fcd47364d681cac88d508a4e1cc6593b06ab0860d7e30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1eeff14df9fe69141d5fcd47364d681cac88d508a4e1cc6593b06ab0860d7e30","first_computed_at":"2026-05-18T00:03:25.441225Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:25.441225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7wHU+QryxJI9CyuFkN3T4di10bmxc2aLNMlmMIbs2R73hpR0d4nFFZFt3B9rG6IAk0bE/YAxSIUqQLwAkO5KBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:25.441838Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.05161","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e958f8529993fa81ee279b124b4aeef939fd5fde4b0def34c8e4053a51e9999","sha256:cccd9e25abe4c956b2408ed75ae2fd13d567a33c0be881dbbc41c2687e8051e1"],"state_sha256":"c12c406176b9ef0da60132f971ada351ed50db01feee579885b63ad375415aac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+6aXXIxEq9nWUj8iGqK6hRMWsZHmsW2Ab9Z3VwoYoxlWKKnzACp+LIJF2mtAm7WR6XnOKr6tlKnxBp1SfT+3BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:47:52.683164Z","bundle_sha256":"ff9c59e6cc30e1d795d2eabff11677078afc4200fdf693822b66280d4e303d6c"}}