{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003052933,0.001022705,0.0006532372,0.002566569,0.0008009345,0.001533786,0.001093406,0.0007003006,0.01056838],"category_scores_gemma":[0.002091779,0.0006689213,0.0007780211,0.0058178,0.0009663384,0.004042875,0.001303009,0.002333128,0.002462944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009840647,"about_ca_system_score_gemma":0.0006309649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007994027,"about_ca_topic_score_gemma":0.001093262,"domain_scores_codex":[0.999632,0.00005108288,0.00002256794,0.0001097315,0.0001575007,0.00002708488],"domain_scores_gemma":[0.9994484,0.0003225784,0.00004958189,0.00005284694,0.00009331985,0.00003330936],"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.00006550246,0.00003207902,0.0001959608,0.0005879904,0.00005167937,0.0001100326,0.0002750065,0.01778659,0.00186515,0.7825987,0.02356201,0.1728692],"study_design_scores_gemma":[0.00001173134,0.00001782087,0.0001754302,0.000053867,0.00001961087,0.0001346916,0.00005009673,0.007575809,0.0005022577,0.9411019,0.05034449,0.0000122433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03469144,0.01518031,0.722455,0.00162803,0.001407764,0.0002232949,0.003010394,0.0009283066,0.2204756],"genre_scores_gemma":[0.2514833,0.02597977,0.6078677,0.0005659817,0.001522196,0.0006915269,0.007472565,0.0008572909,0.1035596],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01056838,"threshold_uncertainty_score":0.03535473,"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."}}