{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006636655,0.0001894904,0.0002216536,0.000172658,0.0002476599,0.0001755285,0.0008099668,0.00009902383,0.00001617065],"category_scores_gemma":[0.0001056889,0.0001724223,0.0001147204,0.0006366316,0.00005598434,0.000298033,0.0002313397,0.0002028654,0.0004046481],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001657211,"about_ca_system_score_gemma":0.00002977795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004164344,"about_ca_topic_score_gemma":0.000001116216,"domain_scores_codex":[0.9983105,0.000103969,0.0002821373,0.0005406544,0.000344802,0.0004179269],"domain_scores_gemma":[0.9985227,0.0001281891,0.0001114512,0.0008876923,0.0001661249,0.000183848],"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.000001681749,0.00005771126,0.001425201,0.000008098244,0.00001532927,0.000004022921,0.0002893232,0.000003229528,0.0009832586,0.9713839,0.0177764,0.008051878],"study_design_scores_gemma":[0.0006455988,0.0001188859,0.0004599481,0.00002722355,0.000008064405,0.0000153023,0.000006515146,0.00352186,0.003262367,0.9834999,0.008176377,0.0002579868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9729799,0.000466541,0.002482176,0.004204714,0.007389188,0.0002403591,0.000001914976,0.001086829,0.0111484],"genre_scores_gemma":[0.9881666,0.00002545069,0.008896566,0.002551749,0.000002129598,0.00001221696,0.000001847781,0.00001780465,0.0003255995],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01518676,"threshold_uncertainty_score":0.7031178,"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."}}