{"id":"W2613720717","doi":"10.1016/j.dam.2018.09.037","title":"Solving the clique cover problem on (bull, <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" overflow=\"scroll\" id=\"d1e19\" altimg=\"si5.gif\"><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 graphs","year":2018,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Cover (algebra); Mathematics; Graph; Clique; 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","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.003665297,0.001199994,0.0005128109,0.0006163855,0.002476802,0.00232477,0.005498332,0.001942445,0.1441864],"category_scores_gemma":[0.00169502,0.001846432,0.001687228,0.001914784,0.003248638,0.001585448,0.004788475,0.002406623,0.003592259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002811603,"about_ca_system_score_gemma":0.001429654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003279166,"about_ca_topic_score_gemma":0.000600465,"domain_scores_codex":[0.987937,0.0004507563,0.002262479,0.002329956,0.003737278,0.003282538],"domain_scores_gemma":[0.9878533,0.003108617,0.002425989,0.005188375,0.0002681685,0.001155475],"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.0009978634,0.0003785646,0.00000388859,0.001549747,0.001079489,0.0004797307,0.004893974,0.001200298,0.003068988,0.8291553,0.1558192,0.001372958],"study_design_scores_gemma":[0.002030916,0.001781971,0.00002767612,0.001638129,0.0008583856,0.0006674497,0.002468542,0.1802613,0.7962552,0.008858795,0.003250022,0.001901615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2824058,0.0007591122,0.02574804,0.001133607,0.001989625,0.0001900721,0.0005017297,0.0004186785,0.6868533],"genre_scores_gemma":[0.9659088,0.0008870228,0.02565994,0.002108504,0.001609267,0.001868291,0.0006019443,0.0009089314,0.0004473535],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8202965,"threshold_uncertainty_score":0.9998949,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01958138159627362,"score_gpt":0.2581497852349101,"score_spread":0.2385684036386364,"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."}}