{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002342168,0.001900573,0.001632814,0.003255622,0.002285736,0.004701968,0.004995864,0.002001613,0.02246764],"category_scores_gemma":[0.01221046,0.0008795522,0.001387844,0.003642358,0.002799967,0.008300598,0.004600831,0.0052934,0.004785344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003872255,"about_ca_system_score_gemma":0.002191406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003324715,"about_ca_topic_score_gemma":0.007535802,"domain_scores_codex":[0.9976497,0.0004056647,0.0001009044,0.000610825,0.0007419656,0.0004908883],"domain_scores_gemma":[0.9875437,0.008053807,0.00045358,0.002422116,0.0007353565,0.0007914982],"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.00182143,0.0008654763,0.005094712,0.001227265,0.000191731,0.0005035998,0.0006012652,0.07640873,0.04083679,0.6299368,0.0844368,0.1580755],"study_design_scores_gemma":[0.0001892805,0.0002351148,0.003969841,0.0002039748,0.0002594348,0.0007886986,0.0002521065,0.2641934,0.01410235,0.6676144,0.04803896,0.0001524692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2170053,0.006305671,0.486318,0.006637072,0.002305471,0.0004841968,0.006028734,0.004870466,0.270045],"genre_scores_gemma":[0.6869196,0.00234291,0.2727903,0.001787192,0.001097114,0.0004797783,0.004454729,0.001278721,0.02884968],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02246764,"threshold_uncertainty_score":0.07516176,"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."}}