{"id":"W1989886714","doi":"10.1016/j.dam.2007.08.045","title":"Digraph searching, directed vertex separation and directed pathwidth","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"","keywords":"Digraph; Vertex (graph theory); Mathematics; Directed graph; Directed acyclic graph; Combinatorics; Strongly connected component; Graph","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":[],"consensus_categories":[],"category_scores_codex":[0.0007119578,0.0001843718,0.0002146843,0.000176882,0.0002117648,0.0002590247,0.0003778083,0.00007867985,0.00001784445],"category_scores_gemma":[0.00006512707,0.0001588728,0.00004135755,0.0005870034,0.00007550732,0.0002474696,0.0002027579,0.0001736541,0.00003474611],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002444001,"about_ca_system_score_gemma":0.00003297235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006634732,"about_ca_topic_score_gemma":0.00001470045,"domain_scores_codex":[0.998455,0.00002666231,0.0003461876,0.000349251,0.0004237036,0.0003991666],"domain_scores_gemma":[0.9989198,0.000236383,0.0001157988,0.0004494159,0.00008135699,0.0001972579],"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.00002189203,0.0002300886,0.0001738728,0.0002020051,0.00006755692,0.00001382804,0.01217637,0.0001814901,0.01424257,0.9381661,0.001266595,0.03325761],"study_design_scores_gemma":[0.001338819,0.0001066283,0.003202407,0.00008456333,0.00002452071,0.00002154912,0.0004274897,0.8894653,0.007423146,0.09494158,0.002231865,0.0007321634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01530726,0.00004580245,0.9461433,0.0001402159,0.0000630421,0.0005072769,0.000003956281,0.0008872418,0.03690195],"genre_scores_gemma":[0.4856763,0.00006930622,0.5135821,0.0001823762,0.00002734568,0.00003526499,0.00003447538,0.00002986665,0.000362958],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8892838,"threshold_uncertainty_score":0.6478645,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01467820838175314,"score_gpt":0.2815725775623087,"score_spread":0.2668943691805555,"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."}}