{"id":"W2029877651","doi":"10.1016/j.tcs.2015.04.027","title":"On the complexity of neighbourhood learning in radio networks","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Neighbourhood (mathematics); Schedule; Node (physics); Class (philosophy); Generalization; Radio networks; Upper and lower bounds; Degree (music); Binary logarithm; Graph; Algorithm; Theoretical computer science; Discrete mathematics; Combinatorics; Mathematics; Wireless network; Artificial intelligence; Wireless; Telecommunications","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.004114425,0.001066725,0.003167278,0.002068477,0.001872397,0.004054124,0.004277674,0.003875728,0.007683186],"category_scores_gemma":[0.0585735,0.001173189,0.001436582,0.002519399,0.005433593,0.01069546,0.0060888,0.005021834,0.0006272048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003383568,"about_ca_system_score_gemma":0.001615944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003284522,"about_ca_topic_score_gemma":0.0031374,"domain_scores_codex":[0.9960665,0.002028461,0.0001750657,0.0005058963,0.0008077549,0.0004163509],"domain_scores_gemma":[0.8742948,0.113179,0.004277618,0.003533488,0.002097797,0.002617217],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003010402,0.0001248563,0.002296133,0.0003254548,0.0001010055,0.000146147,0.0003441575,0.3628449,0.0006693169,0.6083723,0.006147946,0.01832677],"study_design_scores_gemma":[0.00004053659,0.00003445996,0.0003509026,0.00003066979,0.00001771921,0.00005792142,0.00005455633,0.4284514,0.0001375717,0.57013,0.0006712927,0.00002291336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2532892,0.005510765,0.6889266,0.01249148,0.0004634227,0.0001742505,0.001284136,0.0004402834,0.0374199],"genre_scores_gemma":[0.9474435,0.003384806,0.03686055,0.0006634142,0.0008058361,0.0002731229,0.0007225143,0.000238075,0.0096082],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007683186,"threshold_uncertainty_score":0.02570283,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06630140433264756,"score_gpt":0.2858921960271714,"score_spread":0.2195907916945239,"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."}}