{"id":"W2055120783","doi":"10.1016/j.jctb.2005.04.002","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi mathvariant=\"normal\">Δ</mml:mi><mml:mo>+</mml:mo><mml:mn>300</mml:mn></mml:math> is a bound on the adjacent vertex distinguishing edge chromatic number","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":126,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Vertex (graph theory); Graph; Edge coloring; Mathematics; Scroll; Combinatorics; Algorithm; Line graph","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":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003267499,0.000472975,0.0003633133,0.0001717591,0.001319211,0.001412263,0.001775999,0.000507179,0.0007461085],"category_scores_gemma":[0.00123622,0.0005097427,0.0007277389,0.0005565927,0.0005251939,0.001447507,0.0008383782,0.001089694,0.0006035693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004368086,"about_ca_system_score_gemma":0.000592258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008883815,"about_ca_topic_score_gemma":0.00001715442,"domain_scores_codex":[0.9952109,0.0004202127,0.00125286,0.0006043679,0.00157857,0.0009330475],"domain_scores_gemma":[0.9956917,0.001042065,0.001481848,0.001098096,0.0002521696,0.0004341912],"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.0006166212,0.0003010777,0.000005315101,0.0001379755,0.0003998851,0.000263666,0.002897115,0.0003133361,0.0007265059,0.9780723,0.01514173,0.001124469],"study_design_scores_gemma":[0.005548268,0.003643219,0.00008586237,0.002921598,0.0008767057,0.004029308,0.001962497,0.2502629,0.1596322,0.5325967,0.03650763,0.001933055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9785516,0.0004947809,0.0006978294,0.001414942,0.007053411,0.00006054145,0.00002594987,0.0001486694,0.0115523],"genre_scores_gemma":[0.9948043,0.0001902437,0.002103257,0.001644208,0.0009325395,0.00005668965,0.00001424661,0.0001274381,0.0001270321],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4454756,"threshold_uncertainty_score":0.9999809,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01303425814486328,"score_gpt":0.2276126112042378,"score_spread":0.2145783530593746,"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."}}