{"id":"W4377971906","doi":"10.1007/978-3-031-32733-9_23","title":"Overcoming Probabilistic Faults in Disoriented Linear Search","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University; Toronto Metropolitan University","funders":"","keywords":"Probabilistic logic; Computer science; Randomized algorithm; Competitive analysis; Deterministic algorithm; Path (computing); Bernoulli's principle; Constant (computer programming); Algorithm; Leverage (statistics); Mathematics; Mathematical optimization; Combinatorics; Artificial intelligence; Upper and lower bounds","routes":{"ca_aff":true,"ca_fund":false,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001640653,0.0004359567,0.000482911,0.001493159,0.0002100901,0.0003576972,0.003037574,0.000291269,0.00001814158],"category_scores_gemma":[0.000306286,0.0004080996,0.0000985456,0.0019296,0.0005440132,0.0006052174,0.002019826,0.001208046,0.0001216882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00039773,"about_ca_system_score_gemma":0.0006559219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006783534,"about_ca_topic_score_gemma":0.0002830144,"domain_scores_codex":[0.9953495,0.00007952821,0.0006279804,0.001645442,0.001372761,0.0009247321],"domain_scores_gemma":[0.9975028,0.0007115688,0.0001353456,0.001200484,0.0002320248,0.0002177656],"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.000008908822,0.00006062356,0.0002190627,0.0001049011,0.000006785127,0.0001787723,0.002077474,0.7499063,0.00003320605,0.04842349,0.00001360157,0.1989669],"study_design_scores_gemma":[0.000346953,0.0001094011,0.0002146032,0.000465615,0.000001480938,0.00001210056,3.000597e-7,0.9411263,0.00006855552,0.05685141,0.0003720466,0.0004312005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001395063,0.00005428692,0.9947682,0.0009643832,0.001057037,0.0007408247,0.00000692548,0.0002744826,0.001994351],"genre_scores_gemma":[0.1700424,0.0002510795,0.8212786,0.001868804,0.0007091419,0.0000781605,0.00005827428,0.0001881823,0.005525369],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1985357,"threshold_uncertainty_score":0.9998371,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03432631466397401,"score_gpt":0.2869286109457508,"score_spread":0.2526022962817768,"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."}}