{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IF6I2N3XIJMNXW44YQDITSKUQS","short_pith_number":"pith:IF6I2N3X","schema_version":"1.0","canonical_sha256":"417c8d37774258dbdb9cc40689c95484a233d4f113569230a4c5bd4b335d6b2e","source":{"kind":"arxiv","id":"1701.04426","version":2},"attestation_state":"computed","paper":{"title":"Efficiently Finding Simple Schedules in Gaussian Half-Duplex Relay Line 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, Yahya H. Ezzeldin","submitted_at":"2017-01-16T19:16:47Z","abstract_excerpt":"The problem of operating a Gaussian Half-Duplex (HD) relay network optimally is challenging due to the exponential number of listen/transmit network states that need to be considered. Recent results have shown that, for the class of Gaussian HD networks with N relays, there always exists a simple schedule, i.e., with at most N +1 active states, that is sufficient for approximate (i.e., up to a constant gap) capacity characterization. This paper investigates how to efficiently find such a simple schedule over line networks. Towards this end, a polynomial-time algorithm is designed and proved to"},"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":"1701.04426","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-16T19:16:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1394ba62a536f252f27a03776b7f55cc37da005f04b19621f2bd1f03eb5edadd","abstract_canon_sha256":"525406ef90e5c7cf10d4e3ebdc65cffe799393e92c7df12dea52162ddd49ced1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:25.187940Z","signature_b64":"dZWMzMTSFDCzDdh84+L1V/1rNKM9cLje76UcbJpzHR7vuAhGCwQQGGKj/EQ3Jtc9ufVVnbeQ3rV1/dGYYnrRCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"417c8d37774258dbdb9cc40689c95484a233d4f113569230a4c5bd4b335d6b2e","last_reissued_at":"2026-05-18T00:03:25.187530Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:25.187530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficiently Finding Simple Schedules in Gaussian Half-Duplex Relay Line 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, Yahya H. Ezzeldin","submitted_at":"2017-01-16T19:16:47Z","abstract_excerpt":"The problem of operating a Gaussian Half-Duplex (HD) relay network optimally is challenging due to the exponential number of listen/transmit network states that need to be considered. Recent results have shown that, for the class of Gaussian HD networks with N relays, there always exists a simple schedule, i.e., with at most N +1 active states, that is sufficient for approximate (i.e., up to a constant gap) capacity characterization. This paper investigates how to efficiently find such a simple schedule over line networks. Towards this end, a polynomial-time algorithm is designed and proved to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04426","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":"1701.04426","created_at":"2026-05-18T00:03:25.187588+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.04426v2","created_at":"2026-05-18T00:03:25.187588+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04426","created_at":"2026-05-18T00:03:25.187588+00:00"},{"alias_kind":"pith_short_12","alias_value":"IF6I2N3XIJMN","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IF6I2N3XIJMNXW44","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IF6I2N3X","created_at":"2026-05-18T12:31:21.493067+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/IF6I2N3XIJMNXW44YQDITSKUQS","json":"https://pith.science/pith/IF6I2N3XIJMNXW44YQDITSKUQS.json","graph_json":"https://pith.science/api/pith-number/IF6I2N3XIJMNXW44YQDITSKUQS/graph.json","events_json":"https://pith.science/api/pith-number/IF6I2N3XIJMNXW44YQDITSKUQS/events.json","paper":"https://pith.science/paper/IF6I2N3X"},"agent_actions":{"view_html":"https://pith.science/pith/IF6I2N3XIJMNXW44YQDITSKUQS","download_json":"https://pith.science/pith/IF6I2N3XIJMNXW44YQDITSKUQS.json","view_paper":"https://pith.science/paper/IF6I2N3X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.04426&json=true","fetch_graph":"https://pith.science/api/pith-number/IF6I2N3XIJMNXW44YQDITSKUQS/graph.json","fetch_events":"https://pith.science/api/pith-number/IF6I2N3XIJMNXW44YQDITSKUQS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IF6I2N3XIJMNXW44YQDITSKUQS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IF6I2N3XIJMNXW44YQDITSKUQS/action/storage_attestation","attest_author":"https://pith.science/pith/IF6I2N3XIJMNXW44YQDITSKUQS/action/author_attestation","sign_citation":"https://pith.science/pith/IF6I2N3XIJMNXW44YQDITSKUQS/action/citation_signature","submit_replication":"https://pith.science/pith/IF6I2N3XIJMNXW44YQDITSKUQS/action/replication_record"}},"created_at":"2026-05-18T00:03:25.187588+00:00","updated_at":"2026-05-18T00:03:25.187588+00:00"}