{"id":"W1542990689","doi":"10.1007/978-3-642-19222-7_7","title":"Shortest Paths between Shortest Paths and Independent Sets","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Control reconfiguration; K shortest path routing; Shortest path problem; Sequence (biology); Yen's algorithm; Shortest Path Faster Algorithm; Floyd–Warshall algorithm; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001886212,0.0008813145,0.0008866345,0.001370087,0.0004521899,0.0006871373,0.005337762,0.0005656894,0.0000400087],"category_scores_gemma":[0.0001659829,0.0008087526,0.0001609219,0.0008766098,0.001792133,0.001135041,0.004295896,0.001890011,0.00007081155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002714849,"about_ca_system_score_gemma":0.0005843672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003142437,"about_ca_topic_score_gemma":0.00009843513,"domain_scores_codex":[0.9932318,0.0001006926,0.0007535612,0.002773696,0.001797164,0.001343026],"domain_scores_gemma":[0.9953023,0.001031967,0.0003165228,0.002393684,0.0003668687,0.0005886247],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007523116,0.00003874992,0.003797038,0.0000312012,0.00002535192,0.0003606939,0.001015216,0.0006388796,0.00007873464,0.0310934,0.00001052961,0.9629027],"study_design_scores_gemma":[0.0004460767,0.0006281747,0.007135137,0.0005144621,0.0000232136,0.0002456891,5.812186e-7,0.04030892,0.001124359,0.9466272,0.001247635,0.001698541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009812762,0.0008392099,0.9920766,0.0002564095,0.0008398558,0.0007079721,0.0000275626,0.0002436746,0.004027379],"genre_scores_gemma":[0.8055206,0.0002064858,0.1926762,0.0006544897,0.0004740115,0.00002876961,0.00001483964,0.00009823428,0.0003263455],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9612042,"threshold_uncertainty_score":0.9994363,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03353041539316524,"score_gpt":0.2815773617864456,"score_spread":0.2480469463932804,"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."}}