{"id":"W3177062893","doi":"10.1609/icaps.v31i1.15964","title":"LM-cut and Operator Counting Heuristics for Optimal Numeric Planning with Simple Conditions","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Heuristic; Operator (biology); Simple (philosophy); State (computer science); Mathematical optimization; Computer science; Consistent heuristic; Algorithm; Mathematics; Null-move heuristic; Constant (computer programming); Incremental heuristic search; Search algorithm; Beam search","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":[],"consensus_categories":[],"category_scores_codex":[0.000324181,0.0001788238,0.0002066602,0.0000959177,0.0004309546,0.0005981335,0.0004310255,0.00007114715,0.000004903727],"category_scores_gemma":[0.0003057976,0.0001423214,0.00003286158,0.0001887793,0.00007193808,0.0003274327,0.0001790137,0.0002378386,6.003897e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002219552,"about_ca_system_score_gemma":0.0001430882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000750013,"about_ca_topic_score_gemma":3.528751e-7,"domain_scores_codex":[0.9988149,0.00001022033,0.000267738,0.0003786205,0.0002956005,0.0002329527],"domain_scores_gemma":[0.9986924,0.000245339,0.000257905,0.00008392642,0.0006473816,0.00007302671],"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.0004471777,0.0002529343,0.2312562,0.0009516104,0.0008951007,0.00008321641,0.01432514,0.1441718,0.1282424,0.4733644,0.003796403,0.002213578],"study_design_scores_gemma":[0.0004835716,0.0001082093,0.001988013,0.001154345,0.0000242496,0.0001200713,0.001122971,0.9814958,0.01204132,0.001059737,0.0001864997,0.0002152294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9699812,0.0001626929,0.02632555,0.001501469,0.0001783091,0.000143968,0.00004381005,0.0002745134,0.001388511],"genre_scores_gemma":[0.9389012,0.000006510352,0.06068641,0.0002377228,0.00004530555,0.00001710293,0.00002086539,0.00001285662,0.00007199252],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.837324,"threshold_uncertainty_score":0.5803698,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0314566558341207,"score_gpt":0.2930029595744092,"score_spread":0.2615463037402885,"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."}}