{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006666135,0.0002028417,0.0001467098,0.0001060061,0.0008154583,0.0003561933,0.001240495,0.0000645394,0.000002359942],"category_scores_gemma":[0.00004131074,0.0001372816,0.0001723797,0.0005405883,0.0002304778,0.0004888934,0.0001783762,0.000203462,0.00004942552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009031494,"about_ca_system_score_gemma":0.00007807605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001517154,"about_ca_topic_score_gemma":0.00001824596,"domain_scores_codex":[0.9979717,0.00008568925,0.0002624267,0.0005487416,0.0004730284,0.0006584134],"domain_scores_gemma":[0.9984477,0.0002791052,0.00009544867,0.0008749784,0.0001442896,0.0001584442],"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.00004398705,0.00005084137,0.000009340132,0.00001239486,0.00002290121,0.000005325031,0.0002146577,0.00133397,0.002252988,0.983965,0.0002920724,0.01179655],"study_design_scores_gemma":[0.0009397931,0.0006960255,0.0000526656,0.00004044922,0.000006178296,0.00001086254,0.00004305682,0.006389538,0.01743832,0.9602301,0.01388537,0.0002676638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001330701,0.000215665,0.9690411,0.0214399,0.0006116871,0.001461153,0.00003458641,0.0003633865,0.005501797],"genre_scores_gemma":[0.7363243,0.0007491141,0.2542,0.001452155,0.0005814186,0.002907464,0.00006851648,0.0001442417,0.003572754],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7349936,"threshold_uncertainty_score":0.6271929,"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."}}