{"id":"W12912828","doi":"10.1007/978-1-4471-4069-6_5","title":"Graphs and Trees","year":2012,"lang":"en","type":"book-chapter","venue":"Undergraduate topics in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"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; Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Breadth-first search; 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.001118778,0.0004356228,0.0004309074,0.001234477,0.0002976971,0.0004540387,0.002997477,0.0001845533,0.000009741909],"category_scores_gemma":[0.00002638053,0.0004186279,0.0000953401,0.0005577806,0.001480446,0.001245169,0.00247105,0.0007281925,0.00005194028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001668578,"about_ca_system_score_gemma":0.0002392276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008319232,"about_ca_topic_score_gemma":0.00004483139,"domain_scores_codex":[0.9963561,0.00004617736,0.0004275998,0.001256906,0.001025657,0.000887606],"domain_scores_gemma":[0.9976217,0.0002108914,0.0001757932,0.001472915,0.0001654701,0.0003532478],"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.000001392988,0.00001329857,0.0001063898,0.0000136028,0.000005570695,0.00002836055,0.0001202282,0.00003834451,0.0000106172,0.7574387,0.00006078347,0.2421628],"study_design_scores_gemma":[0.0002113544,0.00008638717,0.0003934161,0.0001052892,0.000003897017,0.00006016078,8.135363e-7,0.01519923,0.00007467709,0.9672418,0.01613991,0.0004831101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002864826,0.002697313,0.8789641,0.004062342,0.001949712,0.000618579,0.000005184418,0.0003685879,0.1110477],"genre_scores_gemma":[0.1289563,0.005736188,0.6732304,0.001795363,0.0009508357,0.00004906808,0.000009787886,0.0001704123,0.1891017],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2416797,"threshold_uncertainty_score":0.9998266,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03443815039716676,"score_gpt":0.2848112662453842,"score_spread":0.2503731158482174,"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."}}