{"id":"W1514904414","doi":"10.1609/socs.v2i1.18196","title":"Predicting Solution Cost with Conditional Probabilities","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Alberta Innovates; University of Regina","keywords":"Heuristic; Consistent heuristic; Path (computing); Incremental heuristic search; Mathematical optimization; Computer science; Bidirectional search; Algorithm; Bounded function; Best-first search; Search algorithm; Beam search; Mathematics","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.0005589072,0.0001282326,0.000131091,0.0000565614,0.000272415,0.0002665465,0.001094671,0.00006402838,0.00001648806],"category_scores_gemma":[0.0001834851,0.00009743241,0.00007186906,0.0003163657,0.0001024368,0.0004351654,0.000417651,0.0003100704,0.000006764418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001937478,"about_ca_system_score_gemma":0.0002221527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000576529,"about_ca_topic_score_gemma":0.000002484789,"domain_scores_codex":[0.9979724,0.00002396877,0.0002435518,0.0003516353,0.001170136,0.0002383153],"domain_scores_gemma":[0.9981703,0.0002301398,0.0001534061,0.0001416532,0.00124124,0.00006323173],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001160543,0.0002111374,0.04158414,0.00005919299,0.00008002871,0.000002816933,0.0006690625,0.0008870425,0.0199007,0.9351592,0.001041945,0.0002886527],"study_design_scores_gemma":[0.003826174,0.001001925,0.009831894,0.001285974,0.00003792527,0.0002098508,0.0003862861,0.0749075,0.7209611,0.1774659,0.009405069,0.0006804414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8972421,0.00004990516,0.005563898,0.04247907,0.005655099,0.000808098,0.00005958712,0.0002757254,0.04786656],"genre_scores_gemma":[0.9974534,0.000003489864,0.001567476,0.0001382691,0.000294999,0.00003705696,0.00001110473,0.00001019242,0.0004840172],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7576934,"threshold_uncertainty_score":0.3973178,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01576057319684234,"score_gpt":0.2408829389124096,"score_spread":0.2251223657155672,"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."}}