{"id":"W2153068117","doi":"10.5555/982792.982848","title":"The list partition problem for graphs","year":2004,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Partition (number theory); Mathematics; Clique problem; Time complexity; Skew; Discrete mathematics; Clique; Chordal graph; Graph; Computer science; 1-planar 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":[],"consensus_categories":[],"category_scores_codex":[0.001117267,0.00136578,0.001150844,0.001288584,0.002213105,0.004003813,0.002120111,0.002593096,0.01140723],"category_scores_gemma":[0.005069124,0.0008206982,0.001382822,0.00337659,0.001539002,0.009277414,0.002346797,0.001916787,0.002213048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002236474,"about_ca_system_score_gemma":0.001531791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003493821,"about_ca_topic_score_gemma":0.003619576,"domain_scores_codex":[0.9984456,0.0004382656,0.00009645669,0.0003855311,0.0003030568,0.0003311526],"domain_scores_gemma":[0.9978384,0.001346554,0.0002358913,0.0002655978,0.0001600837,0.000153488],"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.001017177,0.0004226065,0.00202781,0.001804055,0.0001843484,0.0007324087,0.001451734,0.2314336,0.00815865,0.4754367,0.07488298,0.2024478],"study_design_scores_gemma":[0.0002302384,0.0002107922,0.0009055639,0.000132943,0.0001031034,0.0008900459,0.0007916805,0.260617,0.005825143,0.6764539,0.05376376,0.00007589663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1484032,0.002947337,0.8052334,0.004281789,0.0003398799,0.0007719126,0.003576027,0.002158055,0.03228825],"genre_scores_gemma":[0.5231116,0.003788009,0.4277956,0.001090438,0.0005915525,0.0007882745,0.01211244,0.0008061172,0.02991603],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01140723,"threshold_uncertainty_score":0.03816098,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01577628640029533,"score_gpt":0.2901337696210354,"score_spread":0.2743574832207401,"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."}}