{"id":"W4389115885","doi":"10.48550/arxiv.2311.15346","title":"A Primal-Dual Extension of the Goemans--Williamson Algorithm for the Weighted Fractional Cut-Covering Problem","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Maximum cut; Mathematics; Hyperplane; Combinatorics; Semidefinite programming; Duality (order theory); Generalization; Extension (predicate logic); Approximation algorithm; Linear programming relaxation; Relaxation (psychology); Discrete mathematics; Algorithm; Linear programming; Mathematical optimization; Computer science; Graph; Mathematical analysis","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000495212,0.0003160277,0.0003305503,0.0001802303,0.0005796786,0.0001139322,0.002318094,0.0002300355,0.00001199016],"category_scores_gemma":[0.00003844051,0.0002375314,0.0005255849,0.0009528049,0.0002445289,0.0002903414,0.00304958,0.000692432,0.00001365772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001434912,"about_ca_system_score_gemma":0.0002547691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002366519,"about_ca_topic_score_gemma":0.00006215123,"domain_scores_codex":[0.9979721,0.0001231202,0.0003036569,0.0009992323,0.0002281005,0.0003737671],"domain_scores_gemma":[0.9970356,0.000646675,0.000441993,0.001470736,0.0003326518,0.000072342],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001178558,0.0005848368,0.001068415,0.0005159269,0.001060236,0.0001097034,0.0013874,0.324086,0.0002788456,0.5985542,0.004110651,0.06812593],"study_design_scores_gemma":[0.0003746219,0.00004477114,0.002575928,0.0001779633,0.00008346825,0.000007754497,0.00006581069,0.8437903,0.0003305445,0.1494784,0.002799228,0.0002712232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01196946,0.00007016204,0.9840436,0.0006069912,0.001842969,0.0009513412,0.00009552469,0.000217149,0.0002027922],"genre_scores_gemma":[0.9016273,0.0006205526,0.09199859,0.0002332115,0.0006057583,0.00003110459,0.00004876811,0.00008381489,0.004750927],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.892045,"threshold_uncertainty_score":0.9686248,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09324186680180548,"score_gpt":0.2106296667674288,"score_spread":0.1173877999656233,"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."}}