{"id":"W2765981104","doi":"10.1016/j.ipl.2018.04.006","title":"Reaching a target in the plane with no information","year":2018,"lang":"en","type":"preprint","venue":"Information Processing Letters","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Multiplicative function; Plane (geometry); Bounded function; Binary logarithm; Trajectory; Combinatorics; Mathematics; Euclidean geometry; Euclidean distance; Computer science; Discrete mathematics; Physics; Mathematical analysis; Geometry","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":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001144044,0.0002216148,0.0001663791,0.0004673158,0.0002385308,0.002597122,0.0012995,0.0001270667,0.000009829328],"category_scores_gemma":[0.0000914432,0.0001508972,0.0000322015,0.0004529802,0.00007298058,0.009234715,0.0003131946,0.0007009456,0.0002162128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001085452,"about_ca_system_score_gemma":0.000272555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004611515,"about_ca_topic_score_gemma":0.000002941483,"domain_scores_codex":[0.9980975,0.0001056889,0.0006056578,0.0001578387,0.0007285061,0.0003048237],"domain_scores_gemma":[0.9985582,0.00004301823,0.0005648884,0.0004821077,0.0003042563,0.00004747949],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001642291,0.0001214303,0.002084683,0.003901531,0.00007021919,0.00001605541,0.3215685,0.4686757,0.00004233853,0.005290122,0.07019455,0.1278706],"study_design_scores_gemma":[0.0006564698,0.0000675005,0.0007876902,0.0006190859,0.000005282601,0.00003512209,0.0003296302,0.9391353,0.00003595545,0.0005816667,0.05728752,0.0004588049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002850012,0.000009409951,0.9766907,0.009195705,0.0002523352,0.0005965926,0.000008039022,0.000221258,0.01017592],"genre_scores_gemma":[0.4027069,0.00002222283,0.5137765,0.08127652,0.0002891584,0.0004452195,0.001423973,0.00002366894,0.0000357756],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4704596,"threshold_uncertainty_score":0.9984383,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01252332536878354,"score_gpt":0.2312668350467607,"score_spread":0.2187435096779771,"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."}}