{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008481123,0.0001229663,0.0001792015,0.0000862612,0.0008039384,0.0001603568,0.003172544,0.00004374096,0.00001480058],"category_scores_gemma":[0.0006930798,0.00008523618,0.00009415727,0.0001996169,0.0008861991,0.0003443692,0.0006611826,0.0002773489,0.00005361178],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002250898,"about_ca_system_score_gemma":0.00003480926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002907291,"about_ca_topic_score_gemma":0.00000539439,"domain_scores_codex":[0.9986377,0.0001611731,0.0001793103,0.0003046874,0.0004055794,0.0003115523],"domain_scores_gemma":[0.9969332,0.0004496129,0.0002157075,0.002166872,0.000158144,0.0000765267],"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.00001173435,0.00006069717,0.0007393513,0.000005211622,0.00001529995,0.000007087536,0.0001145864,0.000001517579,0.0004141505,0.9945975,0.0004234112,0.003609441],"study_design_scores_gemma":[0.0003302631,0.000121752,0.006092677,0.00002844134,0.000001932616,0.000002930963,0.0000147997,0.000643832,0.006933463,0.9855946,0.0001336661,0.0001016828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9717023,0.00005755733,0.001771057,0.004586621,0.001672451,0.0003894355,0.000004795003,0.0001205479,0.01969521],"genre_scores_gemma":[0.9984145,0.00001119377,0.001348589,0.0001146755,0.000002689512,0.00001359518,4.299422e-7,0.000009643825,0.00008475463],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02671211,"threshold_uncertainty_score":0.6183325,"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."}}