{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005208254,0.0008955137,0.0008133352,0.001571123,0.0008678226,0.004126047,0.002038993,0.001085758,0.51149],"category_scores_gemma":[0.003279058,0.0006711957,0.00053924,0.002874829,0.0006658629,0.00501944,0.00148984,0.002370452,0.3049635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001651219,"about_ca_system_score_gemma":0.0007123129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004846771,"about_ca_topic_score_gemma":0.006669705,"domain_scores_codex":[0.9996927,0.0000456915,0.00001949894,0.0000683833,0.0001328829,0.00004085511],"domain_scores_gemma":[0.9984078,0.0006072253,0.0001009648,0.0004014378,0.0003305602,0.000152115],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000790296,0.00004760392,0.0002523014,0.0001564416,0.000007129017,0.00004555772,0.00008494226,0.0005780645,0.001710761,0.07062168,0.8688717,0.05754473],"study_design_scores_gemma":[0.00006834718,0.00003191536,0.001637291,0.00008575591,0.00001147452,0.0002525622,0.00014483,0.007518118,0.007337857,0.1487145,0.8341426,0.00005485589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.004750993,0.0004631611,0.1066846,0.008437116,0.001252031,0.0001687432,0.04398904,0.02980682,0.8044475],"genre_scores_gemma":[0.0853553,0.002307557,0.1088164,0.002447064,0.001168481,0.0004536952,0.0771561,0.03575648,0.6865389],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.51149,"threshold_uncertainty_score":0.6968002,"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."}}