{"id":"W1781781209","doi":"10.1016/j.ejc.2016.12.005","title":"Hardness of computing clique number and chromatic number for Cayley graphs","year":2017,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Circulant matrix; Mathematics; Cayley graph; Discrete mathematics; Chordal graph; Clique; Indifference graph; Quotient; Clique problem; Pathwidth; Graph; 1-planar graph; Line graph","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002257864,0.0003178954,0.0008388184,0.0001142503,0.0001184201,0.0001235651,0.00066482,0.0001137455,0.000007502963],"category_scores_gemma":[0.0001369695,0.0003056756,0.0003331693,0.0000693879,0.00009177211,0.0001081667,0.0002045415,0.0007187161,0.000007615189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003949917,"about_ca_system_score_gemma":0.00004233397,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001857626,"about_ca_topic_score_gemma":2.38453e-7,"domain_scores_codex":[0.9979714,0.0003544171,0.001021162,0.0001648553,0.0002539237,0.0002342627],"domain_scores_gemma":[0.9977224,0.0001512377,0.00114357,0.0004630297,0.0003678678,0.0001519063],"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.0006600196,0.00163147,0.1239348,0.07918575,0.01075768,0.00209303,0.03697564,0.0352866,0.004257296,0.6197873,0.06382965,0.02160075],"study_design_scores_gemma":[0.01800355,0.001310171,0.08980755,0.033393,0.00253804,0.004998566,0.001787229,0.02050483,0.007217,0.7732967,0.04150384,0.00563958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9639211,0.0008019553,0.01242854,0.0000148885,0.006701509,0.0002761204,0.00002164612,0.00005403384,0.01578023],"genre_scores_gemma":[0.9988245,0.000214844,0.0005634715,0.000006215258,0.0001921166,0.00000151138,0.000003934765,0.0001040654,0.0000893511],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1535093,"threshold_uncertainty_score":0.9999396,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01679333746574768,"score_gpt":0.2496986862510314,"score_spread":0.2329053487852837,"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."}}