{"id":"W2133707704","doi":"","title":"On the Chromatic Uniqueness of Edge-Gluing of Complete Bipartite Graphs and Cycles.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Uniqueness; Chromatic scale; Graph; Foster graph; Chromatic polynomial; Enhanced Data Rates for GSM Evolution; Complete bipartite graph; Friendship graph; Windmill graph; Discrete mathematics; Line graph; Voltage graph; Mathematical analysis; Computer science","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006742741,0.0002981975,0.0003824898,0.0007663994,0.001810081,0.00147096,0.0007682633,0.0007195666,0.003802677],"category_scores_gemma":[0.004622051,0.0003051923,0.0005128674,0.001008847,0.002828592,0.003078234,0.001602922,0.001134645,0.0004837697],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009213898,"about_ca_system_score_gemma":0.0007647288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00217219,"about_ca_topic_score_gemma":0.002285605,"domain_scores_codex":[0.9994443,0.0001369749,0.0000177739,0.0001710168,0.00009144645,0.0001384301],"domain_scores_gemma":[0.9984279,0.0007527904,0.0002316208,0.0002473035,0.0001594792,0.0001809785],"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.0001236674,0.00002148205,0.002715545,0.00007790289,0.00001663317,0.0001552335,0.0005246841,0.00738144,0.003161623,0.9674227,0.001551106,0.01684816],"study_design_scores_gemma":[0.00002153726,0.00007766124,0.002438457,0.00003579058,0.00003487292,0.0006735538,0.0006070202,0.03086878,0.004963785,0.9508526,0.009365059,0.00006100441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7056333,0.001395647,0.2378316,0.0008174975,0.0002112756,0.00006235504,0.0003494282,0.0002402503,0.05345873],"genre_scores_gemma":[0.9756257,0.0003740019,0.01844668,0.00009524273,0.00006631611,0.00002357567,0.000182217,0.00007715257,0.005109158],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003802677,"threshold_uncertainty_score":0.01272124,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03988452569176727,"score_gpt":0.2837049346007079,"score_spread":0.2438204089089406,"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."}}