{"id":"W4386974086","doi":"10.1007/978-3-031-43380-1","title":"Graph-Theoretic Concepts in Computer Science","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Sorbonne Université; Masarykova Univerzita; Université de Fribourg; Universidad de Chile; Université d'Orléans; Ben-Gurion University of the Negev; Massachusetts Institute of Technology; Università degli Studi di Parma; Victoria University of Wellington; Durham University; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; University of California, Irvine; American University of Beirut; McGill University; Victoria University; Univerzita Karlova v Praze; Iowa State University; Università Bocconi; National Science Foundation","keywords":"Computer science; Theoretical computer science; Graph","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002594581,0.001301782,0.0008938471,0.002818084,0.001007317,0.002744303,0.00119181,0.0008139237,0.02969552],"category_scores_gemma":[0.0009562306,0.0004522826,0.0005192984,0.006034455,0.001997106,0.005776597,0.001054987,0.002632322,0.01299401],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0015341,"about_ca_system_score_gemma":0.0007344812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000875313,"about_ca_topic_score_gemma":0.001366936,"domain_scores_codex":[0.9997481,0.0000495899,0.000009705283,0.000054662,0.000117207,0.00002090711],"domain_scores_gemma":[0.999622,0.0002117517,0.00001808953,0.0000473473,0.00006417169,0.00003654246],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000004928069,0.00001707578,0.0000341738,0.0002696525,0.000007975158,0.00002527741,0.0001022099,0.0007631513,0.0004169902,0.8231117,0.1117493,0.06349754],"study_design_scores_gemma":[0.000003696307,0.000006248023,0.00008720427,0.00009243959,0.000008319309,0.0001060774,0.00005634307,0.001414721,0.0002019453,0.674696,0.3233209,0.000006044679],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.003491066,0.07006422,0.2051068,0.008020054,0.007822033,0.0001251773,0.0009403795,0.001073372,0.703357],"genre_scores_gemma":[0.07583113,0.09843095,0.144853,0.005258043,0.008996167,0.0005018563,0.002153664,0.001595145,0.66238],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.02969552,"threshold_uncertainty_score":0.09934139,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01146616151542521,"score_gpt":0.2570400876866447,"score_spread":0.2455739261712195,"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."}}