{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002037687,0.0002364547,0.0002189961,0.0004421067,0.000717843,0.001040153,0.005206808,0.00005197867,0.0002205998],"category_scores_gemma":[0.0003289622,0.0001849021,0.00008074145,0.001943281,0.004350697,0.001479378,0.002176108,0.0005111799,0.002123566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001003909,"about_ca_system_score_gemma":0.0001455586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003480337,"about_ca_topic_score_gemma":1.672255e-7,"domain_scores_codex":[0.9957983,0.000262341,0.0002679371,0.001055238,0.001378951,0.001237267],"domain_scores_gemma":[0.9962541,0.001175022,0.00005051214,0.001531897,0.0003189219,0.0006695022],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005839844,0.00005847162,0.0000155588,0.000003505688,0.000002138082,0.00001077129,0.0001994158,0.0001759541,0.001379458,0.8983589,0.0001920789,0.09959785],"study_design_scores_gemma":[0.0001628852,0.0002338166,0.0004364236,0.00002076301,5.606851e-7,0.00001843041,0.000004347595,0.3815874,0.003751652,0.6135195,0.00007837802,0.0001858332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05812837,0.000009726707,0.9249333,0.001893501,0.0004490537,0.0005121534,8.402552e-7,0.000286209,0.01378687],"genre_scores_gemma":[0.8930429,0.000001942413,0.1055688,0.001186194,0.00009370087,0.00004204988,3.679627e-7,0.0000125142,0.00005153554],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8349146,"threshold_uncertainty_score":0.9999968,"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."}}