{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7Z3KHLC5GJ5IQRYOJJIAYORPQQ","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":"04b7afb0317afb9c64b6d01d9b536f5f675cedbf2fd8f825828fc975dbb03c9e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-05T13:25:23Z","title_canon_sha256":"64b27d520555f00f6296b189b0f24214fddfdfd1c97690b7dd375a5df1302868"},"schema_version":"1.0","source":{"id":"1412.1993","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.1993","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"arxiv_version","alias_value":"1412.1993v1","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1993","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"pith_short_12","alias_value":"7Z3KHLC5GJ5I","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7Z3KHLC5GJ5IQRYO","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7Z3KHLC5","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:294df9b1a0435da01fd1767d77cc1b8038d4899fa896cc1c2ee6a2408f477b9f","target":"graph","created_at":"2026-05-18T00:58:11Z","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 studies networks with N half-duplex relays assisting the communication between a source and a destination. In ISIT'12 Brahma, \\\"{O}zg\\\"{u}r and Fragouli conjectured that in Gaussian half-duplex diamond networks (i.e., without a direct link between the source and the destination, and with N non-interfering relays) an approximately optimal relay scheduling policy (i.e., achieving the cut-set upper bound to within a constant gap) has at most N+1 active states (i.e., at most N+1 out of the $2^N$ possible relay listen-transmit states have a strictly positive probability). Such relay sche","authors_text":"Daniela Tuninetti, Martina Cardone, Raymond Knopp","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-05T13:25:23Z","title":"On the Optimality of Simple Schedules for Networks with Multiple Half-Duplex Relays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1993","kind":"arxiv","version":1},"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:efb4b8a182cc38642b4b3c977aeca22280b194f3e50bb356506dd751f5709053","target":"record","created_at":"2026-05-18T00:58:11Z","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":"04b7afb0317afb9c64b6d01d9b536f5f675cedbf2fd8f825828fc975dbb03c9e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-05T13:25:23Z","title_canon_sha256":"64b27d520555f00f6296b189b0f24214fddfdfd1c97690b7dd375a5df1302868"},"schema_version":"1.0","source":{"id":"1412.1993","kind":"arxiv","version":1}},"canonical_sha256":"fe76a3ac5d327a88470e4a500c3a2f84283389b5f40a880345cdc6e9d460d458","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe76a3ac5d327a88470e4a500c3a2f84283389b5f40a880345cdc6e9d460d458","first_computed_at":"2026-05-18T00:58:11.178177Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:11.178177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p+n2mJCISc8dBbbN4w+1pAIazkj/YQER10F4T0uxKR+yl4IZ1JWO9qzaIhhRLJthjwNM8VG+ZhZ/hoPC67GUDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:11.178804Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.1993","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:efb4b8a182cc38642b4b3c977aeca22280b194f3e50bb356506dd751f5709053","sha256:294df9b1a0435da01fd1767d77cc1b8038d4899fa896cc1c2ee6a2408f477b9f"],"state_sha256":"599c467816daf8def44cb9da6621382036d8c24574419ffedecf3c3ccb176b5c"}