{"id":"W4416339503","doi":"10.48550/arxiv.2511.10792","title":"$\\rm{A}^{\\rm{SAR}}$: $\\varepsilon$-Optimal Graph Search for Minimum Expected-Detection-Time Paths with Path Budget Constraints for Search and Rescue (SAR)","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Incremental heuristic search; Beam search; Probabilistic logic; Search algorithm; Best-first search; Search and rescue; Heuristic; Path (computing); Graph; Local search (optimization)","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.003803965,0.001642935,0.001883991,0.00153537,0.002202543,0.00153778,0.002854411,0.001231704,0.0002744657],"category_scores_gemma":[0.0005806806,0.001599826,0.0007757999,0.002077888,0.002094142,0.0009960819,0.002858255,0.002260923,0.00008778968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003737905,"about_ca_system_score_gemma":0.003321144,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003162883,"about_ca_topic_score_gemma":0.00007674534,"domain_scores_codex":[0.9876129,0.001059072,0.001981249,0.004716629,0.001696504,0.002933639],"domain_scores_gemma":[0.9897981,0.001831283,0.0004127568,0.002755432,0.00393825,0.00126417],"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.01710401,0.009628884,0.09786559,0.02493208,0.01054561,0.0007224421,0.08300369,0.4149705,0.02721978,0.0205207,0.008130311,0.2853565],"study_design_scores_gemma":[0.01018713,0.005104441,0.004928739,0.001978496,0.0003211706,0.0001558239,0.002220921,0.9503496,0.01777886,0.0006942507,0.00309527,0.00318529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2543525,0.0004441516,0.7305691,0.002137999,0.001019642,0.009243767,0.001200101,0.0004442521,0.0005884169],"genre_scores_gemma":[0.7317888,0.0009334154,0.2543418,0.0007380215,0.0005805392,0.001721993,0.000545376,0.0002481843,0.009101935],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5353792,"threshold_uncertainty_score":0.9996318,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04008118726032491,"score_gpt":0.2925374597434194,"score_spread":0.2524562724830945,"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."}}