{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001234039,0.0005806731,0.0008612834,0.0006046218,0.0004336421,0.001161444,0.001820069,0.0009578682,0.003704751],"category_scores_gemma":[0.008677918,0.0004440359,0.0003503222,0.001120291,0.001249303,0.002875241,0.001785311,0.001726286,0.0005485968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009178604,"about_ca_system_score_gemma":0.0009585356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001641653,"about_ca_topic_score_gemma":0.002220208,"domain_scores_codex":[0.999236,0.0002152132,0.00004732126,0.0001022346,0.0002984203,0.0001009486],"domain_scores_gemma":[0.9955413,0.002967768,0.0002910811,0.0006604024,0.0003956491,0.0001438201],"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.0005648161,0.00007845274,0.001109434,0.000307977,0.00004513337,0.0001677124,0.0001834669,0.5941389,0.004425224,0.1100201,0.005631237,0.2833276],"study_design_scores_gemma":[0.00002592548,0.00007485886,0.0001504955,0.00002014461,0.00001636522,0.00008425443,0.00003395681,0.9027672,0.001526526,0.09316217,0.002128093,0.000009937794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07054213,0.001841601,0.9104122,0.0007823115,0.0002490313,0.00005878151,0.00007725763,0.003180629,0.01285605],"genre_scores_gemma":[0.7743045,0.0007009227,0.2150515,0.0003197213,0.0001385584,0.00008180733,0.0001449595,0.0005194561,0.008738753],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003704751,"threshold_uncertainty_score":0.01239365,"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."}}