{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001120449,0.0005111062,0.001081942,0.001489339,0.002763097,0.002665684,0.001447724,0.001443115,0.01324235],"category_scores_gemma":[0.009781233,0.0006767372,0.0008604004,0.001778868,0.004264145,0.005123146,0.003412247,0.002861991,0.000732406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001613173,"about_ca_system_score_gemma":0.001118369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001794978,"about_ca_topic_score_gemma":0.002785781,"domain_scores_codex":[0.9986956,0.0003842004,0.00003943054,0.000316028,0.0003080443,0.0002568133],"domain_scores_gemma":[0.9900427,0.006571151,0.0008863641,0.001234186,0.0005193307,0.0007463628],"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.0001410662,0.00003170772,0.0003992841,0.00006581788,0.000012281,0.00006727457,0.0002286976,0.006792284,0.001263531,0.9811608,0.003264661,0.006572574],"study_design_scores_gemma":[0.00002811116,0.00001123043,0.0002272961,0.00001284793,0.000007764793,0.00007788699,0.0000721843,0.01683871,0.0004734271,0.9804613,0.001777442,0.00001190651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5405872,0.001227611,0.3488209,0.008341766,0.0004343629,0.0001205362,0.001547007,0.0009358461,0.09798487],"genre_scores_gemma":[0.9551351,0.0003581105,0.0261611,0.0006937151,0.0003933056,0.0001270058,0.000795909,0.0002374334,0.01609824],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01324235,"threshold_uncertainty_score":0.04430014,"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."}}