{"id":"W2066522339","doi":"10.1006/jctb.2000.2003","title":"Chromatic Number and the 2-Rank of a Graph","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Chromatic scale; Combinatorics; Graph; Rank (graph theory); Friendship graph; Adjacency matrix; Mathematics; Windmill graph; Discrete mathematics; Line graph; Graph power","routes":{"ca_aff":true,"ca_fund":false,"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":[],"consensus_categories":[],"category_scores_codex":[0.002245939,0.00009841083,0.0003127985,0.00007555349,0.0001091208,0.00007326641,0.0005131003,0.00004412036,0.0000229514],"category_scores_gemma":[0.0002207252,0.00005676023,0.000124321,0.0003410582,0.0004010946,0.0004463756,0.0001040389,0.0001599098,0.000002245197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005915741,"about_ca_system_score_gemma":0.00005057125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004293792,"about_ca_topic_score_gemma":2.130516e-7,"domain_scores_codex":[0.9986598,0.0003315441,0.0004738424,0.00008521704,0.0003199154,0.0001297161],"domain_scores_gemma":[0.9985287,0.0004261986,0.0004541674,0.0002755815,0.0002469716,0.0000683605],"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.0003910064,0.00005026155,0.0001744851,0.00001107223,0.00005446239,0.00001276153,0.001003201,0.000008491044,0.0003354827,0.9969829,0.0002304802,0.0007454404],"study_design_scores_gemma":[0.002595677,0.0002046645,0.0001238794,0.00005953948,0.00002698439,0.0005077641,0.0001195321,0.00005348201,0.0008668986,0.9942819,0.001093673,0.00006602892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9806479,0.001434926,0.006948226,0.002301503,0.005051951,0.0001449515,5.060138e-7,0.00003079852,0.00343919],"genre_scores_gemma":[0.9978619,0.0002651983,0.001644408,0.0001017822,0.00004183247,0.000001140682,5.62106e-8,0.000005215292,0.00007848535],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01721393,"threshold_uncertainty_score":0.2314615,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006015949863867088,"score_gpt":0.2158930395992454,"score_spread":0.2098770897353783,"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."}}