{"id":"W2578103029","doi":"","title":"Tournaments whose indecomposability graph admits a vertex cover of size 2.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph; Vertex (graph theory); Vertex cover; Cover (algebra); Discrete mathematics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002577308,0.000471494,0.0004997567,0.0005683546,0.001723392,0.002544364,0.0007868891,0.001135962,0.01357586],"category_scores_gemma":[0.001903167,0.0004049483,0.0005746419,0.0007336574,0.0006425471,0.001444483,0.000804348,0.001010802,0.0007054974],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006468666,"about_ca_system_score_gemma":0.0003535114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001534293,"about_ca_topic_score_gemma":0.002360416,"domain_scores_codex":[0.9995859,0.00007677089,0.0000200035,0.0001067685,0.00006508573,0.0001454652],"domain_scores_gemma":[0.9983189,0.0008027242,0.0002709398,0.0002102635,0.00009487546,0.0003023296],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.003464723,0.0007835898,0.02729116,0.0007102538,0.0004412141,0.007691139,0.001619329,0.02303185,0.07791676,0.7245506,0.05951145,0.072988],"study_design_scores_gemma":[0.0006432064,0.0004826768,0.02463504,0.00009853599,0.0002829131,0.005994154,0.001182764,0.08167344,0.02110788,0.8153208,0.04847805,0.0001004582],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9216397,0.0002857565,0.01814358,0.001337442,0.0001229241,0.00005569816,0.001984579,0.0003931234,0.0560372],"genre_scores_gemma":[0.9845024,0.0001212809,0.00532634,0.0001576612,0.00006380097,0.00003360572,0.001504827,0.00004773566,0.008242283],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01357586,"threshold_uncertainty_score":0.04541576,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01407229554217121,"score_gpt":0.2799166196258348,"score_spread":0.2658443240836636,"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."}}