{"id":"W2963996369","doi":"10.1016/j.tcs.2017.08.018","title":"Compressed cliques graphs, clique coverings and positive zero forcing","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Clique problem; Clique graph; Clique-sum; Clique; Uniqueness; Discrete mathematics; Split graph; Vertex (graph theory); Forcing (mathematics); Chordal graph; Graph; Line graph; 1-planar graph; Voltage graph; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":["sts"],"category_scores_codex":[0.002068175,0.0002579756,0.0003090293,0.0002467143,0.002265846,0.00209035,0.004906761,0.0000722085,0.000007224949],"category_scores_gemma":[0.0002969541,0.0002211446,0.00007580281,0.0003885722,0.009195416,0.002519438,0.004309311,0.0003799472,0.00001678852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004891345,"about_ca_system_score_gemma":0.00009844611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001775674,"about_ca_topic_score_gemma":0.00000135604,"domain_scores_codex":[0.9968785,0.0001633336,0.0002713706,0.001070907,0.0007533107,0.0008625988],"domain_scores_gemma":[0.996726,0.0005186308,0.0001564284,0.001816318,0.000320763,0.0004619071],"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.00002428143,0.00002753877,0.0003964884,0.000008011561,0.000005748052,0.00003075555,0.0003294355,0.00003237481,0.002245439,0.9734128,0.00001322749,0.02347392],"study_design_scores_gemma":[0.0003012589,0.0002627893,0.008888208,0.00006724676,0.000002888895,0.00005345776,0.000002894768,0.1827513,0.01778507,0.7895756,0.00003552465,0.0002737314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1078691,0.00004212603,0.8865219,0.0011325,0.0002773154,0.0002551418,0.000003885663,0.000188879,0.003709151],"genre_scores_gemma":[0.8776349,0.00002655373,0.1218012,0.0004643664,0.00004121991,0.000008256954,4.628872e-7,0.0000116847,0.00001141642],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7697658,"threshold_uncertainty_score":0.9990331,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01414367894132812,"score_gpt":0.3054709132743144,"score_spread":0.2913272343329862,"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."}}