{"id":"W2602127376","doi":"","title":"On approximate graph colouring and MAX-k-CUT algorithms based on the theta-function","year":2004,"lang":"en","type":"preprint","venue":"Tilburg University Research Portal","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Technische Universiteit Delft; Universiteit Utrecht; Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Combinatorics; Semidefinite programming; Bounded function; Approximation algorithm; Graph; Relaxation (psychology); Discrete mathematics; Function (biology); Algorithm; Mathematical optimization","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.003474989,0.002341353,0.002199571,0.001226811,0.001286526,0.00332296,0.004243785,0.002832599,0.00725473],"category_scores_gemma":[0.01664943,0.001101139,0.001871258,0.002949826,0.002272128,0.007839709,0.003453002,0.005029297,0.001907511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003507551,"about_ca_system_score_gemma":0.002436179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004022788,"about_ca_topic_score_gemma":0.004387897,"domain_scores_codex":[0.9971635,0.001084746,0.0001282864,0.0006375868,0.0006052784,0.000380564],"domain_scores_gemma":[0.9902238,0.006682716,0.000638144,0.001515798,0.0005987153,0.0003408297],"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.001198045,0.000533917,0.00210074,0.0003772372,0.0001419872,0.0001102251,0.0004559369,0.6607616,0.00531921,0.1672204,0.008691189,0.1530896],"study_design_scores_gemma":[0.00007312355,0.00008826845,0.0002047767,0.00003048522,0.00002289829,0.00006694342,0.00004723066,0.8938667,0.001091736,0.1026967,0.001793229,0.00001798384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03157552,0.001099931,0.9571774,0.001130995,0.00009433734,0.000156679,0.0001894381,0.001231341,0.007344394],"genre_scores_gemma":[0.2792798,0.0009877816,0.7091162,0.0009142454,0.000172221,0.0004681313,0.0009930776,0.0006170807,0.007451454],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00725473,"threshold_uncertainty_score":0.02544922,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05670983328273239,"score_gpt":0.3036296669863463,"score_spread":0.2469198337036139,"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."}}