{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:W74F3FNNKEKGSKUNY6WBENSZU2","short_pith_number":"pith:W74F3FNN","schema_version":"1.0","canonical_sha256":"b7f85d95ad5114692a8dc7ac123659a6b212ead88780bf5fda734e6844f34ab2","source":{"kind":"arxiv","id":"1304.7971","version":2},"attestation_state":"computed","paper":{"title":"Adaptive Mode Selection and Power Allocation in Bidirectional Buffer-aided Relay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aissa Ikhlef, Nikola Zlatanov, Robert Schober, Vahid Jamali","submitted_at":"2013-04-30T12:18:54Z","abstract_excerpt":"In this paper, we consider the problem of sum rate maximization in a bidirectional relay network with fading. Hereby, user 1 and user 2 communicate with each other only through a relay, i.e., a direct link between user 1 and user 2 is not present. In this network, there exist six possible transmission modes: four point-to-point modes (user 1-to-relay, user 2-to-relay, relay-to-user 1, relay-to-user 2), a multiple access mode (both users to the relay), and a broadcast mode (the relay to both users). Most existing protocols assume a fixed schedule of using a subset of the aforementioned transmis"},"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":"1304.7971","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-30T12:18:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"757cd583fc2a3868bf58ec7aa4136020cf86bb2754cd34b187f29755c95a373c","abstract_canon_sha256":"14db928748e0e46a78bc99e84458693449b05975a767f7f27e5a76454259e89d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:11.527015Z","signature_b64":"gBoPY3EsncSqnyOcezbbc2HFrGgjNWzZoU0S/iHASWGLjzy5oKtiuBp8lA8AxaoIrKGKGpi/6EYQIRcJE3XuAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7f85d95ad5114692a8dc7ac123659a6b212ead88780bf5fda734e6844f34ab2","last_reissued_at":"2026-05-18T03:21:11.526329Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:11.526329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Mode Selection and Power Allocation in Bidirectional Buffer-aided Relay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aissa Ikhlef, Nikola Zlatanov, Robert Schober, Vahid Jamali","submitted_at":"2013-04-30T12:18:54Z","abstract_excerpt":"In this paper, we consider the problem of sum rate maximization in a bidirectional relay network with fading. Hereby, user 1 and user 2 communicate with each other only through a relay, i.e., a direct link between user 1 and user 2 is not present. In this network, there exist six possible transmission modes: four point-to-point modes (user 1-to-relay, user 2-to-relay, relay-to-user 1, relay-to-user 2), a multiple access mode (both users to the relay), and a broadcast mode (the relay to both users). Most existing protocols assume a fixed schedule of using a subset of the aforementioned transmis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7971","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":"1304.7971","created_at":"2026-05-18T03:21:11.526450+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.7971v2","created_at":"2026-05-18T03:21:11.526450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7971","created_at":"2026-05-18T03:21:11.526450+00:00"},{"alias_kind":"pith_short_12","alias_value":"W74F3FNNKEKG","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"W74F3FNNKEKGSKUN","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"W74F3FNN","created_at":"2026-05-18T12:28:04.890932+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/W74F3FNNKEKGSKUNY6WBENSZU2","json":"https://pith.science/pith/W74F3FNNKEKGSKUNY6WBENSZU2.json","graph_json":"https://pith.science/api/pith-number/W74F3FNNKEKGSKUNY6WBENSZU2/graph.json","events_json":"https://pith.science/api/pith-number/W74F3FNNKEKGSKUNY6WBENSZU2/events.json","paper":"https://pith.science/paper/W74F3FNN"},"agent_actions":{"view_html":"https://pith.science/pith/W74F3FNNKEKGSKUNY6WBENSZU2","download_json":"https://pith.science/pith/W74F3FNNKEKGSKUNY6WBENSZU2.json","view_paper":"https://pith.science/paper/W74F3FNN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.7971&json=true","fetch_graph":"https://pith.science/api/pith-number/W74F3FNNKEKGSKUNY6WBENSZU2/graph.json","fetch_events":"https://pith.science/api/pith-number/W74F3FNNKEKGSKUNY6WBENSZU2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W74F3FNNKEKGSKUNY6WBENSZU2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W74F3FNNKEKGSKUNY6WBENSZU2/action/storage_attestation","attest_author":"https://pith.science/pith/W74F3FNNKEKGSKUNY6WBENSZU2/action/author_attestation","sign_citation":"https://pith.science/pith/W74F3FNNKEKGSKUNY6WBENSZU2/action/citation_signature","submit_replication":"https://pith.science/pith/W74F3FNNKEKGSKUNY6WBENSZU2/action/replication_record"}},"created_at":"2026-05-18T03:21:11.526450+00:00","updated_at":"2026-05-18T03:21:11.526450+00:00"}