{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003540718,0.00009926841,0.0002116592,0.0002486923,0.0002389929,0.0001536111,0.0003635801,0.00002338848,0.00001659004],"category_scores_gemma":[0.00001267119,0.00008416277,0.00008947038,0.003203446,0.00003694692,0.000579061,0.000141397,0.0001394191,1.674183e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001053429,"about_ca_system_score_gemma":0.00007129562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009048821,"about_ca_topic_score_gemma":0.000005314353,"domain_scores_codex":[0.9987844,0.0001046793,0.0003113916,0.0001707737,0.0004941557,0.0001346142],"domain_scores_gemma":[0.999057,0.00002314649,0.0004389852,0.0001665881,0.0002409839,0.0000732807],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005617525,0.0001124554,0.01513779,0.000007733992,0.0002355881,0.00001853694,0.0001358663,0.9667426,0.00000460664,0.01109488,0.0001162381,0.006337489],"study_design_scores_gemma":[0.0006599142,0.0004493099,0.00786359,0.00001105948,0.0001706246,0.0003541629,0.00006774758,0.9829683,0.000006486243,0.007056576,0.0002604483,0.0001317466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01896687,0.0001877562,0.9793101,0.0009097468,0.00009492492,0.00009857612,0.000008903929,0.00002944131,0.0003936748],"genre_scores_gemma":[0.4031574,0.00005620999,0.5965714,0.0001596817,0.0000261944,0.000005644384,0.000009981462,0.000003903346,0.00000957527],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3841906,"threshold_uncertainty_score":0.3432058,"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."}}