{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:D27NLC2644OTGZZQJUHTRXR7RQ","short_pith_number":"pith:D27NLC26","schema_version":"1.0","canonical_sha256":"1ebed58b5ee71d3367304d0f38de3f8c079dedc8cb48c4254b986922b5dabde7","source":{"kind":"arxiv","id":"1401.3520","version":2},"attestation_state":"computed","paper":{"title":"Adaptive Mode Selection for Bidirectional Relay Networks -- Fixed Rate Transmission","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Nikola Zlatanov, Robert Schober, Vahid Jamali","submitted_at":"2014-01-15T09:03:07Z","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"},"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":"1401.3520","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-15T09:03:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"53378a466cb6cd55691b0de581d95ae54eb7e37145bf8f874e2c95a44065f16a","abstract_canon_sha256":"5d8c0121206f6e5a2431f21bac3fcc0690cc18ffe850ca6cf6cb9139e74fe31a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:03.388119Z","signature_b64":"kv79vap0dF8+Wm19ymPxRvRDL4EIWzk/IMxRrk7IhensyO9ao2qnuDN1ziYBfpS7sUJhuUNjHv6ccjkP88fCCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ebed58b5ee71d3367304d0f38de3f8c079dedc8cb48c4254b986922b5dabde7","last_reissued_at":"2026-05-18T00:59:03.387413Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:03.387413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Mode Selection for Bidirectional Relay Networks -- Fixed Rate Transmission","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Nikola Zlatanov, Robert Schober, Vahid Jamali","submitted_at":"2014-01-15T09:03:07Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3520","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":"1401.3520","created_at":"2026-05-18T00:59:03.387526+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.3520v2","created_at":"2026-05-18T00:59:03.387526+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3520","created_at":"2026-05-18T00:59:03.387526+00:00"},{"alias_kind":"pith_short_12","alias_value":"D27NLC2644OT","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"D27NLC2644OTGZZQ","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"D27NLC26","created_at":"2026-05-18T12:28:25.294606+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/D27NLC2644OTGZZQJUHTRXR7RQ","json":"https://pith.science/pith/D27NLC2644OTGZZQJUHTRXR7RQ.json","graph_json":"https://pith.science/api/pith-number/D27NLC2644OTGZZQJUHTRXR7RQ/graph.json","events_json":"https://pith.science/api/pith-number/D27NLC2644OTGZZQJUHTRXR7RQ/events.json","paper":"https://pith.science/paper/D27NLC26"},"agent_actions":{"view_html":"https://pith.science/pith/D27NLC2644OTGZZQJUHTRXR7RQ","download_json":"https://pith.science/pith/D27NLC2644OTGZZQJUHTRXR7RQ.json","view_paper":"https://pith.science/paper/D27NLC26","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.3520&json=true","fetch_graph":"https://pith.science/api/pith-number/D27NLC2644OTGZZQJUHTRXR7RQ/graph.json","fetch_events":"https://pith.science/api/pith-number/D27NLC2644OTGZZQJUHTRXR7RQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D27NLC2644OTGZZQJUHTRXR7RQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D27NLC2644OTGZZQJUHTRXR7RQ/action/storage_attestation","attest_author":"https://pith.science/pith/D27NLC2644OTGZZQJUHTRXR7RQ/action/author_attestation","sign_citation":"https://pith.science/pith/D27NLC2644OTGZZQJUHTRXR7RQ/action/citation_signature","submit_replication":"https://pith.science/pith/D27NLC2644OTGZZQJUHTRXR7RQ/action/replication_record"}},"created_at":"2026-05-18T00:59:03.387526+00:00","updated_at":"2026-05-18T00:59:03.387526+00:00"}