{"id":"W1996977547","doi":"10.1109/jsac.2013.130816","title":"Buffer-Aided Relaying with Adaptive Link Selection","year":2012,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":245,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Computer science; Computer network; Throughput; Channel state information; Relay channel; Transmission (telecommunications); Queue; Link Access Procedure for Frame Relay; Upper and lower bounds; Schedule; Selection (genetic algorithm); Power (physics); Wireless; Telecommunications; Mathematics","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009728209,0.0002099502,0.0002304558,0.0004279256,0.00101402,0.0002217203,0.002208082,0.0000950902,0.00002002464],"category_scores_gemma":[0.0001853746,0.0001813316,0.00005516609,0.002460227,0.00008814633,0.001124812,0.0002441489,0.001650188,0.00004610257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000411842,"about_ca_system_score_gemma":0.0002378829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008169967,"about_ca_topic_score_gemma":0.0002053341,"domain_scores_codex":[0.9974245,0.001139877,0.0004630406,0.0001943666,0.0003195125,0.0004586934],"domain_scores_gemma":[0.9965786,0.0007729764,0.0003030433,0.001465906,0.0006644666,0.0002149795],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004727105,0.004319935,0.0934171,0.00001780598,0.0006328569,0.00002460343,0.02407205,0.01162668,0.01368227,0.441419,0.008899793,0.4014152],"study_design_scores_gemma":[0.007715466,0.002953546,0.3447489,0.002573062,0.0001601275,0.004523153,0.0008529748,0.5167961,0.01025124,0.005247159,0.1007252,0.003453121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1355911,0.005898416,0.8063682,0.02201725,0.0009796291,0.001015709,0.000003466387,0.0007637064,0.02736252],"genre_scores_gemma":[0.9450136,0.002061664,0.05216305,0.0004060265,0.0001784442,0.00004574483,0.000004192037,0.0000208236,0.0001064137],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8094226,"threshold_uncertainty_score":0.7799124,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07297752707014883,"score_gpt":0.3101918647511244,"score_spread":0.2372143376809756,"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."}}