{"id":"W2591604206","doi":"","title":"On the complexity of recognizing tenacious graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","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.002091029,0.0009730648,0.00161246,0.001852679,0.003080525,0.007104116,0.003531457,0.003086255,0.01863997],"category_scores_gemma":[0.0326358,0.0009770069,0.002006359,0.003426194,0.003670341,0.02140483,0.005742499,0.006088676,0.003027256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003007238,"about_ca_system_score_gemma":0.001938379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005132969,"about_ca_topic_score_gemma":0.006402235,"domain_scores_codex":[0.9958826,0.001098448,0.0003382906,0.001033534,0.001023388,0.0006237398],"domain_scores_gemma":[0.9527164,0.03887897,0.001769793,0.003856044,0.001596538,0.001182335],"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.0007728317,0.0004456442,0.006962182,0.001114625,0.0002136218,0.0007413691,0.001701997,0.04440171,0.003732903,0.7579363,0.06860338,0.1133735],"study_design_scores_gemma":[0.00002960853,0.00002269979,0.0006900278,0.00004264556,0.00003740279,0.0002799805,0.0003516453,0.04399325,0.0009731309,0.9473974,0.006153269,0.00002903126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4468191,0.007149053,0.3558162,0.03405434,0.001348139,0.0005462525,0.009056445,0.003262669,0.1419479],"genre_scores_gemma":[0.8564023,0.002823688,0.1003824,0.002454506,0.0009846553,0.0003592483,0.01179125,0.0008700906,0.02393185],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01863997,"threshold_uncertainty_score":0.06235683,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07314943444469264,"score_gpt":0.3133339493372381,"score_spread":0.2401845148925454,"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."}}