{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002158753,0.000149035,0.000154866,0.0004302864,0.0002008003,0.0006036679,0.001791854,0.00004606251,0.00004408159],"category_scores_gemma":[0.0001314428,0.0001190434,0.00004740521,0.00316684,0.0014345,0.0009525199,0.001095613,0.0003640131,0.0001360943],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001216513,"about_ca_system_score_gemma":0.0002509485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007748317,"about_ca_topic_score_gemma":0.000001583634,"domain_scores_codex":[0.997236,0.0001498627,0.0002913121,0.0008366014,0.0008221494,0.0006641012],"domain_scores_gemma":[0.9987045,0.000354375,0.00001381151,0.0005658792,0.000107024,0.000254401],"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.000003367362,0.00005025227,0.0000468015,0.00002735388,0.000001413423,0.00003109369,0.00104431,0.008593124,0.000127844,0.967948,0.00001399759,0.02211249],"study_design_scores_gemma":[0.0001375878,0.0001028993,0.0003262543,0.000103935,8.253531e-7,0.00001681145,0.000005367832,0.9362243,0.0002799421,0.06243779,0.0002149293,0.0001493761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01966169,0.00004180769,0.9749825,0.001732294,0.000549429,0.0002797287,0.000001453584,0.0003440825,0.002407022],"genre_scores_gemma":[0.8819534,0.000007208362,0.1177409,0.0001889021,0.00006263518,0.000009573164,0.000001147991,0.000008005253,0.00002814873],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9276311,"threshold_uncertainty_score":0.5821183,"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."}}