{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:D3X7CTPZ7ZURIHK7ZVDTMTLIDS","short_pith_number":"pith:D3X7CTPZ","schema_version":"1.0","canonical_sha256":"1eeff14df9fe69141d5fcd47364d681cac88d508a4e1cc6593b06ab0860d7e30","source":{"kind":"arxiv","id":"1601.05161","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.05161","created_at":"2026-05-18T00:03:25.441301+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.05161v2","created_at":"2026-05-18T00:03:25.441301+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05161","created_at":"2026-05-18T00:03:25.441301+00:00"},{"alias_kind":"pith_short_12","alias_value":"D3X7CTPZ7ZUR","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"D3X7CTPZ7ZURIHK7","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"D3X7CTPZ","created_at":"2026-05-18T12:30:09.641336+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/D3X7CTPZ7ZURIHK7ZVDTMTLIDS","json":"https://pith.science/pith/D3X7CTPZ7ZURIHK7ZVDTMTLIDS.json","graph_json":"https://pith.science/api/pith-number/D3X7CTPZ7ZURIHK7ZVDTMTLIDS/graph.json","events_json":"https://pith.science/api/pith-number/D3X7CTPZ7ZURIHK7ZVDTMTLIDS/events.json","paper":"https://pith.science/paper/D3X7CTPZ"},"agent_actions":{"view_html":"https://pith.science/pith/D3X7CTPZ7ZURIHK7ZVDTMTLIDS","download_json":"https://pith.science/pith/D3X7CTPZ7ZURIHK7ZVDTMTLIDS.json","view_paper":"https://pith.science/paper/D3X7CTPZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.05161&json=true","fetch_graph":"https://pith.science/api/pith-number/D3X7CTPZ7ZURIHK7ZVDTMTLIDS/graph.json","fetch_events":"https://pith.science/api/pith-number/D3X7CTPZ7ZURIHK7ZVDTMTLIDS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D3X7CTPZ7ZURIHK7ZVDTMTLIDS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D3X7CTPZ7ZURIHK7ZVDTMTLIDS/action/storage_attestation","attest_author":"https://pith.science/pith/D3X7CTPZ7ZURIHK7ZVDTMTLIDS/action/author_attestation","sign_citation":"https://pith.science/pith/D3X7CTPZ7ZURIHK7ZVDTMTLIDS/action/citation_signature","submit_replication":"https://pith.science/pith/D3X7CTPZ7ZURIHK7ZVDTMTLIDS/action/replication_record"}},"created_at":"2026-05-18T00:03:25.441301+00:00","updated_at":"2026-05-18T00:03:25.441301+00:00"}