{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IYU3WEYYLG5E3WGO5ACDQQICMZ","short_pith_number":"pith:IYU3WEYY","schema_version":"1.0","canonical_sha256":"4629bb131859ba4dd8cee804384102665ced38b1e06071b4976707a3fb47f1c3","source":{"kind":"arxiv","id":"1410.7174","version":1},"attestation_state":"computed","paper":{"title":"The Approximate Optimality of Simple Schedules for Half-Duplex Multi-Relay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniela Tuninetti, Martina Cardone, Raymond Knopp","submitted_at":"2014-10-27T10:31:26Z","abstract_excerpt":"In ISIT'12 Brahma, \\\"{O}zg\\\"{u}r and Fragouli conjectured that in a half-duplex diamond relay network (a Gaussian noise network without a direct source-destination link and with $N$ non-interfering relays) an approximately optimal relay scheduling (achieving the cut-set upper bound to within a constant gap uniformly over all channel gains) exists with at most $N+1$ active states (only $N+1$ out of the $2^N$ possible relay listen-transmit configurations have a strictly positive probability). Such relay scheduling policies are said to be simple. In ITW'13 we conjectured that simple relay policie"},"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":"1410.7174","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-27T10:31:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"257f0a2136d4cbe5207dba07bed8a47d95bd9b85e9402f7fedc3d558d2399d1b","abstract_canon_sha256":"5f0f9563c0868e8adf27696dae11c62fe17b8d0a879057cf2c6fd38de8afb9a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:36.524116Z","signature_b64":"sbX0uskr+k+G/EON22rklqVTrqCWPx2Ns/FkAGxGx/2Ka4LYmfS1lId2Ffana129LgbWlq1APe327ztvyovvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4629bb131859ba4dd8cee804384102665ced38b1e06071b4976707a3fb47f1c3","last_reissued_at":"2026-05-18T00:58:36.523343Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:36.523343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Approximate Optimality of Simple Schedules for Half-Duplex Multi-Relay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniela Tuninetti, Martina Cardone, Raymond Knopp","submitted_at":"2014-10-27T10:31:26Z","abstract_excerpt":"In ISIT'12 Brahma, \\\"{O}zg\\\"{u}r and Fragouli conjectured that in a half-duplex diamond relay network (a Gaussian noise network without a direct source-destination link and with $N$ non-interfering relays) an approximately optimal relay scheduling (achieving the cut-set upper bound to within a constant gap uniformly over all channel gains) exists with at most $N+1$ active states (only $N+1$ out of the $2^N$ possible relay listen-transmit configurations have a strictly positive probability). Such relay scheduling policies are said to be simple. In ITW'13 we conjectured that simple relay policie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7174","kind":"arxiv","version":1},"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":"1410.7174","created_at":"2026-05-18T00:58:36.523478+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.7174v1","created_at":"2026-05-18T00:58:36.523478+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7174","created_at":"2026-05-18T00:58:36.523478+00:00"},{"alias_kind":"pith_short_12","alias_value":"IYU3WEYYLG5E","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IYU3WEYYLG5E3WGO","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IYU3WEYY","created_at":"2026-05-18T12:28:33.132498+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/IYU3WEYYLG5E3WGO5ACDQQICMZ","json":"https://pith.science/pith/IYU3WEYYLG5E3WGO5ACDQQICMZ.json","graph_json":"https://pith.science/api/pith-number/IYU3WEYYLG5E3WGO5ACDQQICMZ/graph.json","events_json":"https://pith.science/api/pith-number/IYU3WEYYLG5E3WGO5ACDQQICMZ/events.json","paper":"https://pith.science/paper/IYU3WEYY"},"agent_actions":{"view_html":"https://pith.science/pith/IYU3WEYYLG5E3WGO5ACDQQICMZ","download_json":"https://pith.science/pith/IYU3WEYYLG5E3WGO5ACDQQICMZ.json","view_paper":"https://pith.science/paper/IYU3WEYY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.7174&json=true","fetch_graph":"https://pith.science/api/pith-number/IYU3WEYYLG5E3WGO5ACDQQICMZ/graph.json","fetch_events":"https://pith.science/api/pith-number/IYU3WEYYLG5E3WGO5ACDQQICMZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IYU3WEYYLG5E3WGO5ACDQQICMZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IYU3WEYYLG5E3WGO5ACDQQICMZ/action/storage_attestation","attest_author":"https://pith.science/pith/IYU3WEYYLG5E3WGO5ACDQQICMZ/action/author_attestation","sign_citation":"https://pith.science/pith/IYU3WEYYLG5E3WGO5ACDQQICMZ/action/citation_signature","submit_replication":"https://pith.science/pith/IYU3WEYYLG5E3WGO5ACDQQICMZ/action/replication_record"}},"created_at":"2026-05-18T00:58:36.523478+00:00","updated_at":"2026-05-18T00:58:36.523478+00:00"}