{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.003554842,0.0004020599,0.0003653474,0.001340121,0.00125842,0.0003733191,0.002733354,0.0003191475,0.0001428882],"category_scores_gemma":[0.0002096179,0.0003335464,0.0002300389,0.001218677,0.001002377,0.0003322974,0.003043743,0.003305746,0.00006673019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000314634,"about_ca_system_score_gemma":0.0006798664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001364301,"about_ca_topic_score_gemma":0.00002873876,"domain_scores_codex":[0.9941386,0.001054288,0.0002139931,0.001386639,0.002169026,0.001037446],"domain_scores_gemma":[0.9959578,0.001156242,0.0001508762,0.001922219,0.0004422908,0.0003706],"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.0009780556,0.0005310418,0.0002166927,0.0001929368,0.0002153677,0.001877146,0.0005700127,0.02304387,0.0001501911,0.964196,0.002227693,0.005800982],"study_design_scores_gemma":[0.002275226,0.00186143,0.001657516,0.0007259224,0.00004464381,0.00003362312,0.001188772,0.200899,0.001265554,0.7862927,0.002632652,0.001122921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2794581,0.0002433673,0.5483038,0.01235029,0.001250428,0.007265312,0.0002760976,0.001348758,0.1495038],"genre_scores_gemma":[0.9947887,0.0001230571,0.001599867,0.0001648487,0.00008008345,0.00002362358,0.00003548307,0.00004405603,0.003140286],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7153306,"threshold_uncertainty_score":0.9999117,"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."}}