{"id":"W1982050567","doi":"10.1007/s00373-012-1270-z","title":"Solving Partition Problems with Colour-Bipartitions","year":2012,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Chordal graph; Combinatorics; Mathematics; Indifference graph; Pathwidth; Discrete mathematics; Homomorphism; Partition (number theory); Vertex (graph theory); Time complexity; Graph; Line 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.0003261789,0.0001101118,0.0001086753,0.0001242954,0.000331422,0.0001061773,0.0002413386,0.00004162731,0.000006149268],"category_scores_gemma":[0.00001572252,0.00009131969,0.00002803492,0.0007799004,0.0001035234,0.0008522482,0.0001251935,0.0001532117,0.00001143254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001970006,"about_ca_system_score_gemma":0.00002071385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004741816,"about_ca_topic_score_gemma":0.000003233157,"domain_scores_codex":[0.9989301,0.00005671553,0.0001148359,0.0002034776,0.0002462277,0.0004486275],"domain_scores_gemma":[0.9992671,0.00007421549,0.00005033561,0.0003046597,0.00009515343,0.0002085123],"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.000002932704,0.0001136558,0.02426392,0.0000140359,0.000009621242,0.000001997882,0.0003197326,0.00001098231,0.0001235496,0.9740009,0.0001513389,0.0009873655],"study_design_scores_gemma":[0.0004772874,0.0002858512,0.01292892,0.00002968601,0.000009293566,0.00003966162,0.00008067975,0.001137368,0.0006921797,0.9798524,0.004222712,0.0002439167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7064463,0.002403841,0.2819968,0.0007915616,0.0005707342,0.0005940239,0.000004975457,0.0005170755,0.006674643],"genre_scores_gemma":[0.9971389,0.000111857,0.002478829,0.00006069262,0.00001012929,0.00007326618,0.000002140739,0.000009072332,0.0001150675],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2906926,"threshold_uncertainty_score":0.3723909,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0214241067806624,"score_gpt":0.2481203241596899,"score_spread":0.2266962173790275,"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."}}