{"id":"W1989358594","doi":"10.1016/j.dam.2014.06.007","title":"Constructions of<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si11.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-critical<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si12.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>-free graphs","year":2014,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Guelph; Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Vertex (graph theory); Graph; Combinatorics; Algorithm; Discrete mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.0009797711,0.0009653314,0.0004743472,0.001774997,0.002556543,0.003035811,0.001831454,0.0008650013,0.09406612],"category_scores_gemma":[0.0035831,0.0009394833,0.001301288,0.002067486,0.001825751,0.00448608,0.003237677,0.002754321,0.03036867],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002219203,"about_ca_system_score_gemma":0.001397371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003083028,"about_ca_topic_score_gemma":0.005880514,"domain_scores_codex":[0.9990877,0.0001997459,0.00006566125,0.0002116493,0.000247466,0.0001878242],"domain_scores_gemma":[0.997638,0.0008881374,0.0001479914,0.0005096881,0.0005654229,0.0002508786],"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.00009145495,0.00004980853,0.0002447331,0.0002026105,0.00001466053,0.0002210266,0.0006639861,0.001447204,0.003496844,0.8842522,0.08789167,0.02142368],"study_design_scores_gemma":[0.00005355494,0.00002947175,0.0004792069,0.0001076986,0.00003829462,0.0003281314,0.0004431749,0.003303171,0.00860891,0.6121449,0.3743942,0.00006922987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.020941,0.0003677831,0.5857102,0.002439194,0.0008453479,0.0004680922,0.009024929,0.006036574,0.3741669],"genre_scores_gemma":[0.3172351,0.001130326,0.3594541,0.001495734,0.0003147711,0.0009314237,0.02539623,0.01329611,0.2807462],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.09406612,"threshold_uncertainty_score":0.3146825,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01820484865332435,"score_gpt":0.2582908532033731,"score_spread":0.2400860045500488,"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."}}