{"id":"W2143482081","doi":"10.1016/j.ejc.2014.09.009","title":"Decomposition of bounded degree graphs into <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>-free subgraphs","year":2014,"lang":"lv","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Mathematics; Partition (number theory); Combinatorics; Bounded function; Iterated function; Degree (music); Graph; Discrete mathematics; Mathematical analysis; Physics","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.0002816672,0.000454747,0.0002769521,0.001236739,0.0005003256,0.001294557,0.0006917231,0.0003507036,0.02182305],"category_scores_gemma":[0.001448711,0.0002625545,0.0004691191,0.001013653,0.0004183747,0.001584665,0.0009155898,0.0006708094,0.005880793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006873715,"about_ca_system_score_gemma":0.0004681429,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002658114,"about_ca_topic_score_gemma":0.003530685,"domain_scores_codex":[0.9996964,0.00005385524,0.00001830551,0.00007244279,0.00008742962,0.00007153335],"domain_scores_gemma":[0.9989278,0.000295504,0.00007681324,0.0002246591,0.0003369355,0.0001383078],"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.0002981355,0.0001596609,0.001452449,0.0005379432,0.00004098898,0.0004503887,0.0008716434,0.01401982,0.01836351,0.784829,0.04184546,0.137131],"study_design_scores_gemma":[0.00004625206,0.00004985145,0.002114568,0.0001457912,0.00005430634,0.0004220238,0.0003641816,0.03642263,0.008963781,0.8324364,0.1189558,0.00002423031],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1283342,0.0008177399,0.7016626,0.0007095994,0.0002020563,0.0004209601,0.008121663,0.002535096,0.1571961],"genre_scores_gemma":[0.5884139,0.001278496,0.2593285,0.0004866108,0.0001327154,0.0004845797,0.02411355,0.001814735,0.1239469],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02182305,"threshold_uncertainty_score":0.07300538,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01790779142924023,"score_gpt":0.2444638712005761,"score_spread":0.2265560797713358,"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."}}