{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003625437,0.0003080731,0.0003755423,0.00007973945,0.0003600047,0.0002884364,0.001332297,0.0002027613,0.0002685506],"category_scores_gemma":[0.00001455585,0.0003129822,0.0004203448,0.0007395499,0.0001515607,0.0006152579,0.0004642199,0.0004519662,0.0006384352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008585768,"about_ca_system_score_gemma":0.00007141077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002180873,"about_ca_topic_score_gemma":0.00001428474,"domain_scores_codex":[0.9977015,0.00009810328,0.0003418163,0.0007315528,0.0005425703,0.0005844351],"domain_scores_gemma":[0.9982728,0.0002259325,0.0001566969,0.001072673,0.0001096203,0.000162213],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005224233,0.0006783422,0.01273706,0.0003605768,0.0004031668,0.00007500086,0.004955832,0.001711457,0.006030954,0.8220804,0.1325789,0.01833607],"study_design_scores_gemma":[0.002873973,0.0005006312,0.02441885,0.0002435383,0.00004765427,0.0001343768,0.0002980023,0.3966101,0.002828,0.3208688,0.2493033,0.001872858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1577526,0.000778618,0.7940574,0.006733199,0.004917248,0.001231005,0.0001404751,0.001809198,0.03258023],"genre_scores_gemma":[0.6644601,0.00008767431,0.3260302,0.00559798,0.0007690564,0.00004390958,0.0002337676,0.00005961339,0.002717725],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5067075,"threshold_uncertainty_score":0.9999322,"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."}}