{"id":"W3099773693","doi":"","title":"Regular finite decomposition complexity","year":2019,"lang":"en","type":"article","venue":"MPG.PuRe (Max Planck Society)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Decomposition; Algebra over a field; Pure mathematics; Discrete mathematics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008660845,0.0004581805,0.0005195967,0.001783033,0.0009005779,0.002017388,0.0009021771,0.0005351923,0.003606998],"category_scores_gemma":[0.004228362,0.0001873469,0.0009865105,0.001292692,0.002692627,0.004564838,0.002234588,0.001504435,0.0004432307],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001395577,"about_ca_system_score_gemma":0.00042184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007675224,"about_ca_topic_score_gemma":0.0004579127,"domain_scores_codex":[0.9986687,0.0002402211,0.00009155684,0.0003503559,0.0004204395,0.0002287628],"domain_scores_gemma":[0.9968312,0.001003288,0.000354715,0.0007223231,0.0006079712,0.000480451],"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.00002168329,0.00001616785,0.001435299,0.00005916289,0.00001799332,0.000151485,0.0003332148,0.003247352,0.001852277,0.9814612,0.001230351,0.01017383],"study_design_scores_gemma":[0.000005545439,0.00005219048,0.001765998,0.00003527466,0.00001777191,0.00076704,0.0001465858,0.02115067,0.001811591,0.9583147,0.01590482,0.00002770708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4432566,0.001948791,0.4720739,0.001325233,0.0002402651,0.00008160998,0.001271434,0.0005491331,0.07925311],"genre_scores_gemma":[0.9590722,0.0004733446,0.03457514,0.000168805,0.0001657782,0.00008067035,0.0007212483,0.00009743666,0.004645474],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003606998,"threshold_uncertainty_score":0.01206666,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0192326496251091,"score_gpt":0.2463844889245307,"score_spread":0.2271518392994216,"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."}}