{"id":"W2070526994","doi":"10.1016/j.tcs.2008.02.035","title":"Time constrained graph searching","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Visibility; Computer science; Graph; Combinatorics; Theoretical computer science; Mathematics; Geography","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001395841,0.0001404224,0.00016172,0.0002718022,0.0008504889,0.0002927867,0.002365052,0.00003568075,0.0001585693],"category_scores_gemma":[0.00009541131,0.0001157556,0.0000609759,0.001573928,0.00649863,0.0008231164,0.000930095,0.0002241452,0.0004253817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003112128,"about_ca_system_score_gemma":0.0002648052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001321475,"about_ca_topic_score_gemma":5.056094e-8,"domain_scores_codex":[0.9975052,0.0001449599,0.0002217464,0.0006005248,0.0008816345,0.0006459465],"domain_scores_gemma":[0.998452,0.0002182115,0.00003796396,0.0006507965,0.0002233965,0.0004176156],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002160152,0.00003905762,0.0000183295,0.000002086022,0.000002214327,0.00003129462,0.0006814873,0.001307308,0.0006170187,0.9889128,0.0001344714,0.008251815],"study_design_scores_gemma":[0.0002164816,0.0001297955,0.0001967565,0.00001080748,6.997487e-7,0.0001773825,0.000002259078,0.9379362,0.0009408384,0.06010943,0.0001050965,0.0001742814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01226456,0.00000769871,0.9705285,0.00156495,0.0001766579,0.0001518697,7.872529e-7,0.0003555423,0.01494945],"genre_scores_gemma":[0.7038587,0.000006278718,0.2953712,0.000655563,0.00004424954,0.000002992779,5.783941e-7,0.000004870537,0.00005563231],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9366289,"threshold_uncertainty_score":0.9962051,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01572114620622418,"score_gpt":0.2531572785783627,"score_spread":0.2374361323721385,"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."}}