{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.005172697,0.0009353693,0.0009968448,0.004359842,0.0006685135,0.001468579,0.01131655,0.0004406307,0.00001709128],"category_scores_gemma":[0.0002469325,0.0008685141,0.0002617177,0.01087088,0.007206905,0.001616771,0.004031339,0.001721479,0.0002148114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007159723,"about_ca_system_score_gemma":0.002837866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002116785,"about_ca_topic_score_gemma":0.00005873931,"domain_scores_codex":[0.9907381,0.0002337833,0.0009949992,0.003597123,0.002324799,0.002111218],"domain_scores_gemma":[0.9946647,0.00136842,0.0004031583,0.002703108,0.0004110147,0.0004495785],"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.00001221016,0.0001486565,0.0002607388,0.0001343851,0.00001529283,0.0007996525,0.004473942,0.09972322,0.0002151243,0.1139541,0.0001410337,0.7801216],"study_design_scores_gemma":[0.0003966538,0.0001983117,0.000470463,0.000574235,0.000004674221,0.00007480212,4.687638e-7,0.4595968,0.0007449962,0.5370045,0.0001060284,0.0008281427],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009070484,0.000259287,0.9895025,0.0004789859,0.006777218,0.0006705206,0.000009167783,0.0005063166,0.0008889734],"genre_scores_gemma":[0.3500707,0.0001405833,0.6414792,0.004860128,0.001915273,0.00009574427,0.00002174231,0.0001742065,0.001242468],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7792935,"threshold_uncertainty_score":0.999568,"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."}}