{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003258945,0.000119399,0.0001791899,0.0001232796,0.0002663704,0.0001803512,0.002985739,0.00002980298,0.00003352482],"category_scores_gemma":[0.0003314181,0.00007944577,0.00003872172,0.001627481,0.003424998,0.0002542239,0.001259952,0.0004217075,0.00001617837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006711945,"about_ca_system_score_gemma":0.0001261967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000270724,"about_ca_topic_score_gemma":0.000003040525,"domain_scores_codex":[0.9980654,0.0005105202,0.0002619296,0.0003402218,0.0004774012,0.0003445972],"domain_scores_gemma":[0.9980804,0.000635372,0.00008021642,0.0008449967,0.0002004536,0.0001585576],"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.000006199193,0.00004179765,0.0001338228,6.021198e-7,0.000001224963,0.000001410913,0.0006373544,0.01374565,0.00002023454,0.9679894,0.00005950982,0.01736272],"study_design_scores_gemma":[0.0001834474,0.0001602686,0.002575534,0.00003107305,6.360353e-7,0.00000466776,0.00001077586,0.853053,0.0001973575,0.143645,0.00004769088,0.00009052511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0270597,0.00007157199,0.9580583,0.004387183,0.0002326017,0.0001311747,1.011473e-7,0.00007366991,0.009985712],"genre_scores_gemma":[0.985111,0.00001648936,0.01419063,0.0006276139,0.00003997816,0.000004209008,2.590315e-7,0.000003910165,0.000005932213],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9580513,"threshold_uncertainty_score":0.9992871,"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."}}