{"id":"W2075240586","doi":"10.1002/net.21505","title":"Optimal edge‐coloring with edge rate constraints","year":2013,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Time complexity; Mathematics; Discrete mathematics; Indifference graph; Pooling; Sequence (biology); Matching (statistics); Chordal graph; Pathwidth; Computer science; Graph; Line graph","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.0003568587,0.0001515731,0.0001542161,0.00007484403,0.0001680617,0.0002233525,0.0008571767,0.00007027969,0.0001425847],"category_scores_gemma":[0.00002287969,0.00012168,0.00003747001,0.000497209,0.0003151647,0.0006919837,0.0002995477,0.0003698624,0.0002242376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003137388,"about_ca_system_score_gemma":0.00005263981,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005252537,"about_ca_topic_score_gemma":0.000002486136,"domain_scores_codex":[0.9985254,0.0001103218,0.0001449297,0.0003994026,0.0001959696,0.0006239901],"domain_scores_gemma":[0.9988388,0.0002227063,0.00005471918,0.0005506049,0.0001376428,0.0001955525],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008035345,0.0001265265,0.003858483,0.00002203932,0.0001140301,0.0001859299,0.0005614057,0.2914138,0.0008369469,0.2247699,0.006316654,0.471714],"study_design_scores_gemma":[0.001278293,0.0004254518,0.007874878,0.00009819348,0.000007477408,0.00009331664,0.00009980063,0.9736472,0.001061491,0.01132099,0.003438309,0.0006545903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04963983,0.0001243192,0.9410361,0.0002475885,0.0002667291,0.0003348654,3.416346e-7,0.0001955151,0.008154732],"genre_scores_gemma":[0.9458643,0.00001642217,0.05299336,0.0002131777,0.0001883211,0.00008699101,0.000001252116,0.00001693248,0.000619202],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8962245,"threshold_uncertainty_score":0.4961965,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01747177441735967,"score_gpt":0.2579535936966993,"score_spread":0.2404818192793397,"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."}}