{"id":"W4401269927","doi":"10.1016/j.tcs.2024.114761","title":"Overcoming probabilistic faults in disoriented linear search","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Fields Institute for Research in Mathematical Sciences; Toronto Metropolitan University","keywords":"Probabilistic logic; Competitive analysis; Randomized algorithm; Deterministic algorithm; Mathematics; Algorithm; Path (computing); Constant (computer programming); Computer science; Leverage (statistics); Mathematical optimization; Upper and lower bounds; Artificial intelligence","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.003036739,0.0005993802,0.001124984,0.0008022231,0.0006677388,0.001540538,0.002047044,0.001556833,0.002731528],"category_scores_gemma":[0.02622009,0.0006420342,0.0004112102,0.001150585,0.001964875,0.003905209,0.002292024,0.002057378,0.0003918813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001263557,"about_ca_system_score_gemma":0.001602208,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002370902,"about_ca_topic_score_gemma":0.002698539,"domain_scores_codex":[0.9982861,0.0006483775,0.0001104062,0.0002255257,0.0005321427,0.0001973476],"domain_scores_gemma":[0.985324,0.01013412,0.001033169,0.001875907,0.001239818,0.0003930509],"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.000974144,0.000127342,0.003676384,0.0002702694,0.00006441471,0.0002552287,0.0003014205,0.7384797,0.003002783,0.1000047,0.003341812,0.1495018],"study_design_scores_gemma":[0.0000378468,0.0001000078,0.0002547112,0.00001631611,0.00001852637,0.0000760761,0.00004299165,0.914182,0.001022288,0.08337068,0.0008672763,0.00001126177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1979513,0.001400498,0.7879021,0.001692824,0.000263225,0.0000746209,0.00008665162,0.002311947,0.00831677],"genre_scores_gemma":[0.9085351,0.0002569155,0.0877177,0.000277284,0.00008216473,0.00005831716,0.00007318637,0.0002251167,0.002774294],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003036739,"threshold_uncertainty_score":0.01605999,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01692713087326652,"score_gpt":0.2977233039082169,"score_spread":0.2807961730349504,"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."}}