{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004458934,0.0009148263,0.0005319621,0.0008453751,0.001635906,0.001120108,0.003258127,0.001267496,0.08597215],"category_scores_gemma":[0.002789445,0.00152798,0.002441419,0.001310857,0.001678847,0.001282737,0.002008204,0.002261726,0.0004305972],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002308647,"about_ca_system_score_gemma":0.0008524816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002016965,"about_ca_topic_score_gemma":0.0002425896,"domain_scores_codex":[0.9901006,0.001286297,0.002813716,0.001131278,0.002883486,0.001784575],"domain_scores_gemma":[0.9894375,0.002110521,0.004183508,0.002669051,0.0004565655,0.001142821],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001541616,0.0005019091,0.00004041078,0.001384408,0.001730289,0.001406999,0.002702192,0.0003460354,0.001378306,0.8299032,0.1574069,0.001657785],"study_design_scores_gemma":[0.005787259,0.005421116,0.0005516838,0.002861224,0.003219891,0.003153915,0.001721508,0.0216114,0.9258394,0.02208249,0.005559462,0.002190666],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6342117,0.001420181,0.001618438,0.0003139189,0.004391959,0.00003522113,0.0001156212,0.00009971522,0.3577932],"genre_scores_gemma":[0.9900359,0.001727372,0.004579564,0.0008495848,0.001513444,0.00007655305,0.0002687042,0.000778973,0.000169916],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9244611,"threshold_uncertainty_score":0.9999169,"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."}}