{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002724304,0.002220197,0.002487246,0.002979944,0.002908688,0.009704218,0.006370542,0.004309732,0.0146336],"category_scores_gemma":[0.02644246,0.001442537,0.002342586,0.004516957,0.004699335,0.01538518,0.004745571,0.005922147,0.001649449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005479597,"about_ca_system_score_gemma":0.004472652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009922018,"about_ca_topic_score_gemma":0.01425344,"domain_scores_codex":[0.9933403,0.0014537,0.0002700029,0.002414183,0.00137696,0.001144863],"domain_scores_gemma":[0.9606627,0.02889283,0.001827978,0.005145499,0.00140871,0.002062391],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.006311054,0.001620855,0.03388958,0.00235558,0.0008675011,0.0008216438,0.002171191,0.4370109,0.0200137,0.2862374,0.07192183,0.1367788],"study_design_scores_gemma":[0.0002438538,0.0001226906,0.003368774,0.00008585287,0.0001208807,0.0002709279,0.0005104651,0.3895388,0.005667033,0.5956789,0.004318945,0.000072934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7144588,0.002528771,0.217041,0.01374876,0.000586209,0.0003249615,0.009981627,0.00376371,0.03756615],"genre_scores_gemma":[0.9360564,0.0006013906,0.0467252,0.001020805,0.0007962132,0.0001613581,0.005481129,0.0006283284,0.008529289],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0146336,"threshold_uncertainty_score":0.04895425,"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."}}