{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:D27NLC2644OTGZZQJUHTRXR7RQ","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":"5d8c0121206f6e5a2431f21bac3fcc0690cc18ffe850ca6cf6cb9139e74fe31a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-15T09:03:07Z","title_canon_sha256":"53378a466cb6cd55691b0de581d95ae54eb7e37145bf8f874e2c95a44065f16a"},"schema_version":"1.0","source":{"id":"1401.3520","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3520","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3520v2","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3520","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"pith_short_12","alias_value":"D27NLC2644OT","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"D27NLC2644OTGZZQ","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"D27NLC26","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:46774925cc6a4a253c7ce0496c6207e7687f481960555035ccb09bd796688eb6","target":"graph","created_at":"2026-05-18T00:59:03Z","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":"In this paper, we consider the problem of sum throughput maximization for bidirectional relay networks with block fading. Thereby, user 1 and user 2 exchange information only via a relay node, i.e., a direct link between both users is not present. We assume that channel state information at the transmitter (CSIT) is not available and/or only one coding and modulation scheme is used at the transmitters due to complexity constraints. Thus, the nodes transmit with a fixed predefined rate regardless of the channel state information (CSI). In general, the nodes in the network can assume one of thre","authors_text":"Nikola Zlatanov, Robert Schober, Vahid Jamali","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-15T09:03:07Z","title":"Adaptive Mode Selection for Bidirectional Relay Networks -- Fixed Rate Transmission"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3520","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:bb2c37242b05fdfe64f12e3d7bd2f8a084bad50b4a91bd8473f050e7c333d3b7","target":"record","created_at":"2026-05-18T00:59:03Z","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":"5d8c0121206f6e5a2431f21bac3fcc0690cc18ffe850ca6cf6cb9139e74fe31a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-15T09:03:07Z","title_canon_sha256":"53378a466cb6cd55691b0de581d95ae54eb7e37145bf8f874e2c95a44065f16a"},"schema_version":"1.0","source":{"id":"1401.3520","kind":"arxiv","version":2}},"canonical_sha256":"1ebed58b5ee71d3367304d0f38de3f8c079dedc8cb48c4254b986922b5dabde7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ebed58b5ee71d3367304d0f38de3f8c079dedc8cb48c4254b986922b5dabde7","first_computed_at":"2026-05-18T00:59:03.387413Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:03.387413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kv79vap0dF8+Wm19ymPxRvRDL4EIWzk/IMxRrk7IhensyO9ao2qnuDN1ziYBfpS7sUJhuUNjHv6ccjkP88fCCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:03.388119Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3520","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb2c37242b05fdfe64f12e3d7bd2f8a084bad50b4a91bd8473f050e7c333d3b7","sha256:46774925cc6a4a253c7ce0496c6207e7687f481960555035ccb09bd796688eb6"],"state_sha256":"83557defb7a2c4de9a176d6049ee19d4eba817ce76ec64c7d40f7d12bb507ce0"}