{"id":"W4318953856","doi":"10.1016/j.disc.2023.113342","title":"The r-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Hypergraph; Bounded function; Matching (statistics); Vertex (graph theory); Time complexity; Discrete mathematics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003784496,0.001695238,0.003164705,0.001806126,0.002390201,0.005995682,0.006275889,0.004288438,0.01136951],"category_scores_gemma":[0.0184664,0.002001318,0.002301807,0.003789324,0.003294006,0.01112114,0.003029916,0.003265037,0.001117603],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003518394,"about_ca_system_score_gemma":0.003087003,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005683206,"about_ca_topic_score_gemma":0.005469433,"domain_scores_codex":[0.9969231,0.001348844,0.0001406037,0.0008136924,0.0003370489,0.0004366929],"domain_scores_gemma":[0.9770289,0.01778269,0.001673874,0.001222769,0.000782765,0.001508864],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002361154,0.0009171856,0.003056944,0.001622824,0.0004105085,0.0005592998,0.001092193,0.4808854,0.01088321,0.4154558,0.01980539,0.06294996],"study_design_scores_gemma":[0.0002710146,0.000146271,0.0007015436,0.00006478529,0.00008782887,0.0001505431,0.0003201066,0.5405225,0.002887458,0.453123,0.001672033,0.00005284808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4132356,0.001510325,0.5488155,0.006218235,0.0002529715,0.0005498792,0.002893966,0.001043535,0.0254799],"genre_scores_gemma":[0.7850422,0.001215679,0.1921076,0.0007575066,0.0004702765,0.0004818698,0.002005594,0.0007011652,0.01721803],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01136951,"threshold_uncertainty_score":0.03803474,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01991825721515068,"score_gpt":0.2848979128020826,"score_spread":0.2649796555869319,"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."}}