{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009305842,0.001507651,0.0009218512,0.001049659,0.0006130987,0.001178147,0.001110281,0.001624494,0.009251941],"category_scores_gemma":[0.004039405,0.0006750042,0.000832104,0.0007902989,0.001241166,0.001164985,0.001575163,0.001735643,0.001487752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001830461,"about_ca_system_score_gemma":0.002392012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008476126,"about_ca_topic_score_gemma":0.01004937,"domain_scores_codex":[0.9994531,0.000210386,0.00002190757,0.0001137391,0.0001137243,0.00008709605],"domain_scores_gemma":[0.9986021,0.001059906,0.00009408287,0.00007086721,0.0001153748,0.00005779145],"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.0001748346,0.000117379,0.0006707691,0.0001582851,0.00003979745,0.00007337316,0.00009255822,0.8422663,0.001675616,0.05197796,0.01133191,0.09142125],"study_design_scores_gemma":[0.00002855699,0.00004137208,0.00008773593,0.0000229408,0.000006207591,0.00001974376,0.00001667908,0.9779489,0.0006356279,0.0191659,0.002018514,0.00000787131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02214167,0.000315418,0.9540588,0.0009100961,0.0001189942,0.0002285579,0.0003109971,0.001322313,0.0205931],"genre_scores_gemma":[0.3028021,0.0003616061,0.68205,0.0005020028,0.00005823509,0.0006966004,0.0008273324,0.0009170832,0.01178506],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009251941,"threshold_uncertainty_score":0.03095084,"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."}}