{"id":"W1990809933","doi":"10.1016/s0166-218x(01)00237-2","title":"On the computational complexity of strong edge coloring","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Mathematics; Edge coloring; Combinatorics; Computational complexity theory; Graph coloring; Time complexity; Graph; Completeness (order theory); Matching (statistics); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Algorithm; Graph power; Artificial intelligence; Computer science; Line graph","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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.0003557556,0.0001302426,0.0001898591,0.00006986892,0.0001727176,0.0000543002,0.0009613517,0.00002972179,0.000100213],"category_scores_gemma":[0.00006184299,0.00009034327,0.0000611644,0.0003405512,0.000339583,0.00008943562,0.0002731648,0.0001821976,0.0001031372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002577003,"about_ca_system_score_gemma":0.00001011374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.019513e-7,"about_ca_topic_score_gemma":4.715394e-7,"domain_scores_codex":[0.9987306,0.00003013094,0.0002760584,0.0002103501,0.0005026659,0.000250189],"domain_scores_gemma":[0.9982096,0.0009277225,0.0001486267,0.0006011159,0.00005735206,0.00005556623],"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.000003001816,0.00007650763,0.00000247065,0.0000327752,0.00001570425,8.11342e-7,0.0008875059,0.0024845,0.000265606,0.9953597,0.0001955474,0.000675822],"study_design_scores_gemma":[0.000144893,0.00003103413,0.00003198936,0.00001729657,0.000002626076,0.000001789046,0.0001565099,0.2642678,0.001148616,0.7340795,0.00003476579,0.00008319946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02010338,0.00001495242,0.9212214,0.0004474554,0.00003409481,0.0003772667,0.000009036296,0.00007722725,0.05771514],"genre_scores_gemma":[0.8502447,0.000001879516,0.1495678,0.0000653949,0.0000123542,0.00003453415,0.000001850258,0.00001100071,0.00006053157],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8301413,"threshold_uncertainty_score":0.3684092,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09358971132498799,"score_gpt":0.3031898687250434,"score_spread":0.2096001574000554,"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."}}