{"id":"W2405623444","doi":"","title":"An improved upper bound on the adjacent vertex distinguishing edge chromatic number of a simple graph.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Windmill graph; Chromatic scale; Combinatorics; Edge contraction; Simple graph; Simple (philosophy); Graph; Upper and lower bounds; Enhanced Data Rates for GSM Evolution; Friendship graph; Edge coloring; Line graph; Graph power; Computer science; Mathematical analysis; Telecommunications","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004598748,0.0001879363,0.000223115,0.00005993526,0.0002746055,0.000284391,0.00096804,0.00006671467,0.00006818106],"category_scores_gemma":[0.0001871019,0.0001292461,0.00009876525,0.0004438101,0.000101648,0.0003574962,0.0001760193,0.0001899314,0.0001285279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002656091,"about_ca_system_score_gemma":0.00004921065,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005053641,"about_ca_topic_score_gemma":0.000004443266,"domain_scores_codex":[0.9984436,0.0001440197,0.0003439763,0.0003740271,0.0003344407,0.000359955],"domain_scores_gemma":[0.9980872,0.0002853157,0.0001787998,0.001103426,0.0002037805,0.0001414562],"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.000002548561,0.0002723771,0.003234904,0.00002049706,0.00002597569,0.000001518089,0.0007985181,0.000006621435,0.00498991,0.9852692,0.00414592,0.001231957],"study_design_scores_gemma":[0.0004818008,0.0001716234,0.005382712,0.00005992284,0.000009189138,0.000004259485,0.00006595955,0.0256815,0.002539883,0.9653186,0.00009563389,0.000188894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9964306,0.00004987968,0.0001261539,0.0005455252,0.001257687,0.0003244688,0.00000141178,0.0001407755,0.001123539],"genre_scores_gemma":[0.9984635,0.000003420937,0.0009775435,0.0004575118,0.000002204879,0.00004383014,0.000003409162,0.00001650595,0.00003209361],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02567488,"threshold_uncertainty_score":0.5270503,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01140893842510403,"score_gpt":0.2397127613633554,"score_spread":0.2283038229382514,"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."}}