{"id":"W4282936435","doi":"10.1007/s10898-022-01183-7","title":"A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis","year":2022,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Mathematics; Hypergraph; Combinatorics; Maximum cut; Vertex (graph theory); Disjoint sets; Semidefinite programming; Discrete mathematics; Mathematical optimization; Graph","routes":{"ca_aff":true,"ca_fund":true,"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.003824684,0.002133202,0.003048533,0.002134791,0.00121247,0.00454715,0.005141767,0.004275725,0.008719335],"category_scores_gemma":[0.02450177,0.001331837,0.001944578,0.004087681,0.001801004,0.008078615,0.002986481,0.004308162,0.0006423542],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003291541,"about_ca_system_score_gemma":0.00293425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004643791,"about_ca_topic_score_gemma":0.004860673,"domain_scores_codex":[0.9981522,0.0006066596,0.00006561253,0.0003915924,0.0004399838,0.000343931],"domain_scores_gemma":[0.9822193,0.01470046,0.00103606,0.000662067,0.0007302495,0.000651852],"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.0007776478,0.0004549203,0.002282454,0.0006427417,0.0001638287,0.0002485912,0.0002016008,0.8321986,0.001670295,0.09299884,0.01337401,0.05498647],"study_design_scores_gemma":[0.00003549937,0.00003989296,0.0001972547,0.00003222682,0.00002611443,0.00008232766,0.00005670527,0.9562773,0.0002252183,0.0424671,0.000551312,0.00000901014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1100425,0.003447176,0.8628239,0.004177507,0.0003249447,0.0003579283,0.001039474,0.0004795054,0.01730696],"genre_scores_gemma":[0.6339762,0.002445086,0.3498771,0.0007829011,0.0006820501,0.0005302969,0.001471548,0.0004720815,0.009762685],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008719335,"threshold_uncertainty_score":0.02916902,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007454803762989175,"score_gpt":0.2133350397246548,"score_spread":0.2058802359616656,"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."}}