{"id":"W2020715570","doi":"10.1016/j.tcs.2014.04.009","title":"Multi-Path Algorithms for minimum-colour path problems with applications to approximating barrier resilience","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Resilience (materials science); Path (computing); Algorithm; Computer science; Mathematics; Computer network; Physics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002709866,0.0003312421,0.0003582759,0.0002699999,0.001213268,0.0007421509,0.004079094,0.00006861799,0.000007111925],"category_scores_gemma":[0.0001966531,0.0002590808,0.00009388854,0.002126215,0.002111827,0.0006369663,0.001163185,0.0002433494,0.00003712164],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006407405,"about_ca_system_score_gemma":0.0001799262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004649882,"about_ca_topic_score_gemma":0.00000216858,"domain_scores_codex":[0.9959955,0.0001160432,0.0004782553,0.001512341,0.0008756943,0.001022156],"domain_scores_gemma":[0.9967512,0.0005885249,0.000146953,0.001424072,0.000467639,0.0006215548],"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.000008200876,0.0001318325,0.00003718286,0.00003258696,0.000004453794,0.000001253322,0.001033726,0.001403703,0.0007873307,0.8955176,0.00002771619,0.1010144],"study_design_scores_gemma":[0.0004404339,0.0006902352,0.0002622464,0.00007909694,0.000006218806,0.00002937499,0.00002312637,0.903558,0.001171162,0.09242608,0.000898157,0.0004159046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00251794,0.00001234906,0.9941212,0.0008103899,0.0002462448,0.001469637,0.00000960264,0.0003413791,0.0004712736],"genre_scores_gemma":[0.3288484,6.224549e-7,0.6700007,0.0006448575,0.0001312109,0.0003431003,0.000001210953,0.00001299567,0.00001683674],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9021543,"threshold_uncertainty_score":0.9999861,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02049160316399889,"score_gpt":0.2728734248892165,"score_spread":0.2523818217252176,"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."}}