{"id":"W2125583143","doi":"10.1016/j.tcs.2013.06.009","title":"On minimum cost edge searching","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Ideal (ethics); Mathematics; Graph; Enhanced Data Rates for GSM Evolution; Best-first search; Mathematical optimization; Beam search; Search algorithm; Computer science; Combinatorics; Artificial intelligence","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00137029,0.001713659,0.002312407,0.002420256,0.001394379,0.002025327,0.004407706,0.003010419,0.02426675],"category_scores_gemma":[0.01458355,0.0009397428,0.001095772,0.004868538,0.002163274,0.006355263,0.004150887,0.00330899,0.002053786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001520775,"about_ca_system_score_gemma":0.001494115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00322212,"about_ca_topic_score_gemma":0.003946162,"domain_scores_codex":[0.9986418,0.0004655051,0.00006389185,0.0002669992,0.0003428304,0.000218971],"domain_scores_gemma":[0.993062,0.005340097,0.0002613875,0.0007311364,0.0003499415,0.0002554825],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001682306,0.0005390727,0.001374959,0.000834159,0.0001567339,0.0001634253,0.0004017457,0.2413691,0.003764747,0.3387612,0.05454126,0.3564112],"study_design_scores_gemma":[0.0002170822,0.0001732355,0.0005646455,0.0001492066,0.00008609991,0.000154494,0.0001549478,0.4432923,0.001236166,0.5437582,0.01018344,0.00003008197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1052434,0.004924318,0.7767037,0.006456039,0.0008730077,0.0004151833,0.001291108,0.001125708,0.1029676],"genre_scores_gemma":[0.3949578,0.003079352,0.5473253,0.001781588,0.000638289,0.0005338374,0.00203722,0.0009715779,0.04867495],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02426675,"threshold_uncertainty_score":0.08118039,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01892972370417491,"score_gpt":0.3038955696370758,"score_spread":0.2849658459329009,"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."}}