{"id":"W4255497863","doi":"10.1007/978-3-319-70151-6_5","title":"Graphs and Trees","year":2018,"lang":"en","type":"book-chapter","venue":"Undergraduate topics in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary; Brock University","funders":"","keywords":"Tree traversal; Graph traversal; Floyd–Warshall algorithm; Dijkstra's algorithm; Computer science; Enhanced Data Rates for GSM Evolution; Combinatorics; Breadth-first search; Mathematics; Algorithm; Discrete mathematics; Shortest path problem; Theoretical computer science; Graph; Artificial intelligence","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.0008008166,0.0004039689,0.0003811524,0.0008640899,0.0003127874,0.0005858336,0.002497017,0.0001731545,0.00001559738],"category_scores_gemma":[0.00001344729,0.0003794413,0.00009692413,0.0004242852,0.001563596,0.0007110159,0.001478345,0.0004129095,0.00005560695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007056381,"about_ca_system_score_gemma":0.000186675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006019224,"about_ca_topic_score_gemma":0.00003695031,"domain_scores_codex":[0.9971144,0.00003169709,0.0004002527,0.001289538,0.0006316492,0.0005325162],"domain_scores_gemma":[0.9982068,0.0001037959,0.0001781202,0.00115475,0.0001496754,0.000206873],"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":[9.946848e-7,0.00001210791,0.00002607592,0.00001042406,0.000006865113,0.00004470132,0.000267176,0.00001559438,0.000004143282,0.8932783,0.0002308859,0.1061027],"study_design_scores_gemma":[0.0001938636,0.0001478112,0.0001703141,0.0001355768,0.000004691853,0.00005708914,0.000001151095,0.03917237,0.00006087551,0.9493178,0.01029439,0.0004441132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008530573,0.0004908821,0.8729582,0.003197588,0.003714286,0.0004013255,0.000005582423,0.0003753209,0.1180038],"genre_scores_gemma":[0.07484898,0.001508069,0.6614543,0.003601439,0.001467964,0.00002530239,0.00001012547,0.0001233224,0.2569605],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2115039,"threshold_uncertainty_score":0.9998658,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01808639222079604,"score_gpt":0.2351433232438299,"score_spread":0.2170569310230339,"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."}}