{"id":"W1970669897","doi":"10.1016/j.ipl.2011.07.018","title":"How many oblivious robots can explore a line","year":2011,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais; University of Ottawa","funders":"Agence Nationale de la Recherche","keywords":"Asynchronous communication; Robot; Impossibility; Computer science; Line (geometry); Theoretical computer science; Mobile robot; Node (physics); Combinatorics; Distributed computing; Artificial intelligence; Mathematics; Computer network; Physics","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.000182362,0.0001210362,0.00009545462,0.0002469417,0.0001881983,0.0008709763,0.0005447038,0.00004380798,0.00001159495],"category_scores_gemma":[0.00003730012,0.0001094693,0.000032369,0.0004564126,0.00004436968,0.005991455,0.0001034986,0.000134659,0.00005034006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004105688,"about_ca_system_score_gemma":0.00007358736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001393519,"about_ca_topic_score_gemma":0.000001792835,"domain_scores_codex":[0.999011,0.00002438526,0.0002437726,0.0001321099,0.0003164781,0.0002721973],"domain_scores_gemma":[0.9992952,0.00000849706,0.0001766908,0.0002476126,0.000169126,0.0001028213],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002314263,0.0001186451,0.0006807061,0.0004285962,0.00003515571,0.00002382833,0.1454022,0.01322974,0.001143007,0.0149489,0.01085044,0.8131157],"study_design_scores_gemma":[0.001479787,0.0001533098,0.001569493,0.0002006022,0.00001042546,0.00007583824,0.001201466,0.9712354,0.005835868,0.001456687,0.01591752,0.0008635778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00278315,0.00001449721,0.9806233,0.0140455,0.0001285395,0.0001521453,9.619714e-7,0.0003607599,0.001891144],"genre_scores_gemma":[0.8133296,0.000009370269,0.1706893,0.01568128,0.00004005836,0.00004852412,0.00002061521,0.000009482251,0.0001718029],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9580057,"threshold_uncertainty_score":0.8398845,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05675376930657339,"score_gpt":0.2349867679873912,"score_spread":0.1782329986808179,"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."}}