{"id":"W2970627438","doi":"10.1016/j.tcs.2019.08.031","title":"Searching for a non-adversarial, uncooperative agent on a cycle","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Perimeter; Position (finance); RADIUS; Computer science; Upper and lower bounds; Constant (computer programming); Turning radius; Mobile robot; Mathematics; Algorithm; Artificial intelligence; Engineering; Geometry; Computer network","routes":{"ca_aff":true,"ca_fund":true,"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.001638057,0.000149955,0.0001776989,0.0001893404,0.000416555,0.0006464,0.00186499,0.00003683101,0.00006201577],"category_scores_gemma":[0.00009699464,0.0001162606,0.00006814244,0.0008329262,0.0007086428,0.000617891,0.0007260254,0.0001854437,0.0003422123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008289854,"about_ca_system_score_gemma":0.0002315889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002768377,"about_ca_topic_score_gemma":2.842813e-7,"domain_scores_codex":[0.9976927,0.0001001745,0.0001958742,0.0007355572,0.0006826073,0.0005930939],"domain_scores_gemma":[0.9983671,0.0004034626,0.00004082119,0.000663296,0.0002533303,0.000271977],"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.00001706255,0.00006020978,0.000007542968,0.000007416531,0.000003419801,0.000001800904,0.001011502,0.025327,0.0005117833,0.9599742,0.00006006293,0.01301797],"study_design_scores_gemma":[0.0005392423,0.000714475,0.00006469686,0.00003249308,0.000001035682,0.000003201654,0.000008696681,0.9463731,0.001926724,0.04985782,0.0003150558,0.0001634539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01591741,0.000001669978,0.971872,0.00172543,0.0006702237,0.0007285218,0.000001622153,0.0001148104,0.008968307],"genre_scores_gemma":[0.7789764,0.000001521643,0.2196022,0.001265108,0.00006702722,0.00001843147,9.064841e-7,0.000006862261,0.0000615014],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9210461,"threshold_uncertainty_score":0.623325,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01357223503755122,"score_gpt":0.2862026288283016,"score_spread":0.2726303937907503,"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."}}