{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009802175,0.001490616,0.001671393,0.000960956,0.0009280983,0.002743344,0.001219374,0.004475804,0.005192594],"category_scores_gemma":[0.007096973,0.000805014,0.0008791416,0.001006356,0.001647235,0.004031429,0.003505379,0.002366572,0.001483987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001040256,"about_ca_system_score_gemma":0.001272674,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003469851,"about_ca_topic_score_gemma":0.001719143,"domain_scores_codex":[0.9991329,0.0002101768,0.00004197535,0.0002665993,0.0002036606,0.000144749],"domain_scores_gemma":[0.9979001,0.001492668,0.0001858702,0.0001462012,0.0001661874,0.0001090118],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001766602,0.0002362962,0.001520482,0.0005824724,0.0002101628,0.0006976284,0.0004220283,0.7393417,0.01348021,0.1785718,0.0084474,0.05472322],"study_design_scores_gemma":[0.00008531028,0.0001381487,0.000330491,0.00004143445,0.00002845655,0.0001339324,0.000125028,0.8589654,0.002812976,0.1358323,0.001478141,0.00002841885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1045862,0.0005822816,0.8444349,0.002461367,0.0001824774,0.0001479724,0.0005982263,0.0005067512,0.04649986],"genre_scores_gemma":[0.7874898,0.0007594771,0.1881009,0.0005824912,0.0001743803,0.0002998963,0.000870531,0.0002745286,0.02144796],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005192594,"threshold_uncertainty_score":0.017371,"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."}}