{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IF6I2N3XIJMNXW44YQDITSKUQS","short_pith_number":"pith:IF6I2N3X","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"},"canonical_sha256":"417c8d37774258dbdb9cc40689c95484a233d4f113569230a4c5bd4b335d6b2e","source":{"kind":"arxiv","id":"1701.04426","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.04426","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"arxiv_version","alias_value":"1701.04426v2","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04426","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"pith_short_12","alias_value":"IF6I2N3XIJMN","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IF6I2N3XIJMNXW44","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IF6I2N3X","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IF6I2N3XIJMNXW44YQDITSKUQS","target":"record","payload":{"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"},"canonical_sha256":"417c8d37774258dbdb9cc40689c95484a233d4f113569230a4c5bd4b335d6b2e","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"},"source_kind":"arxiv","source_id":"1701.04426","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":"/eNU8vv703RwgdJyd4xUnBtwi/cn8y+KPAaNNMn62TlN4yHxLnMRkh4YMQEWBuiURQSecEI+rIOJ8k7iCbscDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:52:16.075237Z"},"content_sha256":"71c128c415295d736c00e6f15073d39d903ee0f70111c42fdfab2ea51818ac1f","schema_version":"1.0","event_id":"sha256:71c128c415295d736c00e6f15073d39d903ee0f70111c42fdfab2ea51818ac1f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IF6I2N3XIJMNXW44YQDITSKUQS","target":"graph","payload":{"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"},"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":"rcyjfjqCQ5eQLXXj5LY4dtZmvx5e4gHUje7CSjcxAUUixGZPodKy9+G/8eGlTG+V9idlbl/QXoQltb0MjSlYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:52:16.075968Z"},"content_sha256":"057a2c4168335cd149c466a3933253a3af930a0f1a7fb754921ffbfa34aac0ed","schema_version":"1.0","event_id":"sha256:057a2c4168335cd149c466a3933253a3af930a0f1a7fb754921ffbfa34aac0ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IF6I2N3XIJMNXW44YQDITSKUQS/bundle.json","state_url":"https://pith.science/pith/IF6I2N3XIJMNXW44YQDITSKUQS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IF6I2N3XIJMNXW44YQDITSKUQS/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-30T16:52:16Z","links":{"resolver":"https://pith.science/pith/IF6I2N3XIJMNXW44YQDITSKUQS","bundle":"https://pith.science/pith/IF6I2N3XIJMNXW44YQDITSKUQS/bundle.json","state":"https://pith.science/pith/IF6I2N3XIJMNXW44YQDITSKUQS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IF6I2N3XIJMNXW44YQDITSKUQS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IF6I2N3XIJMNXW44YQDITSKUQS","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":"525406ef90e5c7cf10d4e3ebdc65cffe799393e92c7df12dea52162ddd49ced1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-16T19:16:47Z","title_canon_sha256":"1394ba62a536f252f27a03776b7f55cc37da005f04b19621f2bd1f03eb5edadd"},"schema_version":"1.0","source":{"id":"1701.04426","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.04426","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"arxiv_version","alias_value":"1701.04426v2","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04426","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"pith_short_12","alias_value":"IF6I2N3XIJMN","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IF6I2N3XIJMNXW44","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IF6I2N3X","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:057a2c4168335cd149c466a3933253a3af930a0f1a7fb754921ffbfa34aac0ed","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":"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","authors_text":"Christina Fragouli, Daniela Tuninetti, Martina Cardone, Yahya H. Ezzeldin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-16T19:16:47Z","title":"Efficiently Finding Simple Schedules in Gaussian Half-Duplex Relay Line Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04426","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:71c128c415295d736c00e6f15073d39d903ee0f70111c42fdfab2ea51818ac1f","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":"525406ef90e5c7cf10d4e3ebdc65cffe799393e92c7df12dea52162ddd49ced1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-16T19:16:47Z","title_canon_sha256":"1394ba62a536f252f27a03776b7f55cc37da005f04b19621f2bd1f03eb5edadd"},"schema_version":"1.0","source":{"id":"1701.04426","kind":"arxiv","version":2}},"canonical_sha256":"417c8d37774258dbdb9cc40689c95484a233d4f113569230a4c5bd4b335d6b2e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"417c8d37774258dbdb9cc40689c95484a233d4f113569230a4c5bd4b335d6b2e","first_computed_at":"2026-05-18T00:03:25.187530Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:25.187530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dZWMzMTSFDCzDdh84+L1V/1rNKM9cLje76UcbJpzHR7vuAhGCwQQGGKj/EQ3Jtc9ufVVnbeQ3rV1/dGYYnrRCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:25.187940Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.04426","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71c128c415295d736c00e6f15073d39d903ee0f70111c42fdfab2ea51818ac1f","sha256:057a2c4168335cd149c466a3933253a3af930a0f1a7fb754921ffbfa34aac0ed"],"state_sha256":"595f517a48900e33c95d64c61b0a9b4d7e2570641a26484edc7ec8f1aab59a93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+7sL5dUVdR+hf9BiLcz1Yp3DZhOwC0bZN9pBk754KKa2hruy5Kn+DBHcc5iNxVGgJBoigW/4PVg7edbl4F47Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:52:16.079677Z","bundle_sha256":"3a5bc70addde2a69e7ee515d806a772143783a5c5a4b2a7102cfcddfd398cef2"}}