{"id":"W2405749931","doi":"","title":"Recognizing Tenacious Graphs Is NP-Hard.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","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.0008886775,0.0008703375,0.00113079,0.001498609,0.002408867,0.004752829,0.002047363,0.002142326,0.01045663],"category_scores_gemma":[0.007714207,0.0008314843,0.001598552,0.002490867,0.002170664,0.008153175,0.002605221,0.003959732,0.002335095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001687216,"about_ca_system_score_gemma":0.001326197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004142336,"about_ca_topic_score_gemma":0.008113004,"domain_scores_codex":[0.9983534,0.0003323632,0.0001214004,0.0006346061,0.0003098388,0.0002485302],"domain_scores_gemma":[0.9897225,0.007370162,0.0006077187,0.001337347,0.0005577378,0.0004045165],"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.0004271175,0.0004680324,0.007924597,0.001151522,0.0001698447,0.0006875111,0.001116864,0.03655482,0.006697161,0.6590148,0.09152014,0.1942676],"study_design_scores_gemma":[0.0000241696,0.00002058298,0.0008271025,0.00006639965,0.00003621252,0.0004009203,0.0005644805,0.05778373,0.002901182,0.9201913,0.01715283,0.00003101899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3061697,0.002295964,0.5620031,0.01339734,0.000817763,0.0003867251,0.009481022,0.005576369,0.09987197],"genre_scores_gemma":[0.7623529,0.001015728,0.1996939,0.00154873,0.0002892417,0.0002269216,0.01023314,0.0007360327,0.02390331],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01045663,"threshold_uncertainty_score":0.03498089,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.014142947458738,"score_gpt":0.2192161412132594,"score_spread":0.2050731937545214,"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."}}