{"id":"W3106348509","doi":"","title":"A Delay-Constrained Protocol with Adaptive Mode Selection for Bidirectional Relay Networks","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Computer science; Computer network; Node (physics); Throughput; Transmission (telecommunications); Upper and lower bounds; Fading; Relay channel; Transmission delay; Queue; Markov chain; Network packet; Wireless; Channel (broadcasting); Telecommunications; Power (physics); Mathematics; Engineering","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001304849,0.0005730098,0.0004990021,0.0004252669,0.0005782463,0.0007666711,0.001410067,0.0007038789,0.0009509542],"category_scores_gemma":[0.003228538,0.0002406752,0.0003012832,0.0005845075,0.0008922313,0.001011678,0.001173822,0.0006437175,0.0001330837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008003524,"about_ca_system_score_gemma":0.001342782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001402185,"about_ca_topic_score_gemma":0.001529711,"domain_scores_codex":[0.9992248,0.0003292534,0.00004266942,0.0001088369,0.0001868644,0.0001075628],"domain_scores_gemma":[0.9983786,0.0009172953,0.0002110343,0.0002213015,0.0001750305,0.00009665031],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006616233,0.0003291309,0.001127812,0.0003465662,0.00009646528,0.000773837,0.0006961109,0.5638729,0.05972951,0.300359,0.001989679,0.07001732],"study_design_scores_gemma":[0.00004201078,0.0001483775,0.00009934771,0.00001281359,0.00002498088,0.0001319773,0.00002905653,0.9717999,0.003827237,0.02245696,0.001399103,0.00002824072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06619267,0.0003243949,0.9298442,0.0002342765,0.00004410077,0.0001917368,0.00006302376,0.000204116,0.002901423],"genre_scores_gemma":[0.8600572,0.0003996897,0.1373451,0.00009600231,0.00003279292,0.0003692734,0.00005949344,0.00002643815,0.001613927],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001410067,"threshold_uncertainty_score":0.006900787,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04503226567097628,"score_gpt":0.312929290050328,"score_spread":0.2678970243793518,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}