{"id":"W3013871422","doi":"10.4230/dagrep.9.9.135","title":"Comparative Theory for Graph Polynomials (Dagstuhl Seminar 19401)","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Birkbeck, University of London; Royal Holloway, University of London; National Research University Higher School of Economics; Universität des Saarlandes; Centre National de la Recherche Scientifique; University of Waterloo; Université de Bordeaux; Universiteit van Amsterdam; Monash University; Louisiana State University; Deakin University; U.S. Naval Academy; Durham University; Universiteit Leiden; University of North Texas; University of North Florida; Queen Mary University of London; Seoul National University; University of South Florida; York University; Aix-Marseille Université; Université de Montpellier; Univerzita Karlova v Praze","keywords":"Mathematics; Graph; Computer science; Discrete mathematics","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.003311014,0.0006643948,0.0006468241,0.002847457,0.002153424,0.003505492,0.000738556,0.001554682,0.01321102],"category_scores_gemma":[0.004365917,0.0003327387,0.001043181,0.002768775,0.003860808,0.00470831,0.002146112,0.003337711,0.002481757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007323357,"about_ca_system_score_gemma":0.001257181,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002366749,"about_ca_topic_score_gemma":0.002040472,"domain_scores_codex":[0.9981047,0.0009674916,0.0000591732,0.0002792089,0.00039796,0.0001915015],"domain_scores_gemma":[0.9986888,0.0008498958,0.00009735687,0.00009629441,0.0001758658,0.00009183291],"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.00001233815,0.000006111847,0.00005216457,0.00003780875,0.000005956242,0.00002227236,0.0001415332,0.0003034137,0.0001194304,0.9704041,0.01844107,0.01045371],"study_design_scores_gemma":[0.000009730558,0.00001483207,0.000339952,0.00006931304,0.00000720142,0.00005260285,0.00005677141,0.0005127706,0.0001521695,0.8967158,0.1020581,0.00001066149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.03036144,0.1279434,0.1928632,0.1111282,0.009113455,0.00009376616,0.001899094,0.0006233453,0.5259741],"genre_scores_gemma":[0.7375675,0.03886519,0.09319208,0.01160809,0.007145709,0.0005283792,0.00168014,0.0005360291,0.1088768],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01321102,"threshold_uncertainty_score":0.05313492,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04844326896163092,"score_gpt":0.3205833275791981,"score_spread":0.2721400586175671,"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."}}