{"id":"W2101752896","doi":"10.1016/s0166-218x(02)00251-2","title":"Finding paths in graphs avoiding forbidden transitions","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Discrete mathematics; Graph; Graph isomorphism; Line 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.0005353668,0.0001914014,0.0002509914,0.0003456493,0.0002328763,0.0001269833,0.000847257,0.00007323929,0.00006528434],"category_scores_gemma":[0.00005366772,0.0001814049,0.00009159929,0.001006527,0.00008130609,0.0003396843,0.000160527,0.0003656725,0.0001438154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004539502,"about_ca_system_score_gemma":0.000009522886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001047165,"about_ca_topic_score_gemma":0.000005658987,"domain_scores_codex":[0.9983257,0.00003771856,0.0003678436,0.0003665286,0.0003796447,0.0005225614],"domain_scores_gemma":[0.9988008,0.0003129653,0.00008524851,0.0006671441,0.00002413844,0.0001097351],"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.000001488255,0.00007998509,0.00001429249,0.00006060227,0.000009259914,0.00001609834,0.007170449,0.0001269562,0.005127475,0.9838012,0.00006708132,0.003525067],"study_design_scores_gemma":[0.0004656943,0.00002602507,0.00004394865,0.00007352354,0.000006336509,0.00001249565,0.001326381,0.0931583,0.002490135,0.9019639,0.0001154707,0.0003178223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03325857,0.00008340773,0.9275686,0.0003184317,0.00005146334,0.0005029645,0.000007359583,0.0002205984,0.03798867],"genre_scores_gemma":[0.8483989,0.00003132109,0.1512546,0.00005994062,0.000013207,0.0001107498,0.000002794314,0.00002405403,0.0001044423],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8151403,"threshold_uncertainty_score":0.7397479,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04135075435661177,"score_gpt":0.2841048643191326,"score_spread":0.2427541099625208,"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."}}