{"id":"W7125790666","doi":"10.21428/594757db.f73769f4","title":"Topology-Driven Solver Selection for Stochastic Shortest Path MDPs via Explainable Machine Learning","year":2025,"lang":"en","type":"article","venue":"","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Solver; Shortest path problem; Counterfactual thinking; Scheduling (production processes); Markov decision process; Selection (genetic algorithm); Robotics; Classifier (UML)","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00186565,0.0009797063,0.001018168,0.0009415618,0.0005976022,0.001219057,0.001414522,0.001231348,0.002174131],"category_scores_gemma":[0.01144887,0.0005229406,0.0008583062,0.0006075505,0.001241999,0.001511336,0.001452666,0.001727286,0.0003460297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0014916,"about_ca_system_score_gemma":0.002568076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004172453,"about_ca_topic_score_gemma":0.006657595,"domain_scores_codex":[0.9991087,0.0003685248,0.00005001384,0.0001947712,0.0001688027,0.0001091913],"domain_scores_gemma":[0.9924184,0.005957853,0.0006166365,0.0004000924,0.0003781659,0.0002288636],"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.00003833856,0.00002619104,0.001554238,0.00005147463,0.00001905859,0.00003235948,0.00003157568,0.9753937,0.000313398,0.009270702,0.0006020278,0.01266687],"study_design_scores_gemma":[0.00000508463,0.000007057135,0.00004335195,0.000002993367,0.000001618004,0.000002624517,0.00000353137,0.9942326,0.0001169922,0.005501618,0.00008119371,0.000001392779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1442997,0.0004502975,0.8486264,0.001210689,0.00005288723,0.0001381972,0.0003702517,0.001372182,0.003479386],"genre_scores_gemma":[0.8512717,0.0001744833,0.1459223,0.0001763921,0.00004804454,0.0002255053,0.0007143645,0.0001804249,0.001286735],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004172453,"threshold_uncertainty_score":0.01082242,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01200291125055762,"score_gpt":0.2676481952313067,"score_spread":0.2556452839807491,"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."}}