{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.004749096,0.00227465,0.00118577,0.001257288,0.003534481,0.002994019,0.006892463,0.003831455,0.04079021],"category_scores_gemma":[0.004597777,0.003741434,0.003762058,0.003055949,0.006131425,0.003009647,0.006583895,0.003994609,0.004306504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005291455,"about_ca_system_score_gemma":0.002590121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007291121,"about_ca_topic_score_gemma":0.0008723333,"domain_scores_codex":[0.979624,0.0007518755,0.004554628,0.003969271,0.005899028,0.005201244],"domain_scores_gemma":[0.979621,0.005662549,0.004126631,0.007543608,0.0005476575,0.002498558],"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.001733491,0.0009857189,0.00001077608,0.003977095,0.002492609,0.00119963,0.003645081,0.002473768,0.005561507,0.9335893,0.04184845,0.002482558],"study_design_scores_gemma":[0.003351159,0.001953115,0.00003819485,0.002342765,0.002208814,0.002103241,0.003315181,0.5394583,0.4318634,0.007107697,0.00336832,0.002889778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7150432,0.001363007,0.02434282,0.001067074,0.004037931,0.000235282,0.001536966,0.0007872875,0.2515864],"genre_scores_gemma":[0.9489768,0.001694025,0.03900299,0.001635848,0.002330092,0.002690053,0.001718753,0.001583733,0.000367702],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9264816,"threshold_uncertainty_score":0.9989992,"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."}}