{"id":"W2915063610","doi":"10.7287/peerj.preprints.27434v1","title":"A local search algorithm for the constrained max cut problem on hypergraphs.","year":2018,"lang":"en","type":"article","venue":"","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Western University","funders":"","keywords":"Maximum cut; Combinatorics; Disjoint sets; Mathematics; Cardinality (data modeling); Hypergraph; Partition (number theory); Approximation algorithm; Integer (computer science); Local search (optimization); Set (abstract data type); Discrete mathematics; Algorithm; Graph; Computer science","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.001069819,0.0009344554,0.001242782,0.001097201,0.0007328049,0.001055354,0.002010648,0.001566343,0.008929148],"category_scores_gemma":[0.004209347,0.0006426717,0.0009541847,0.002012431,0.0008274627,0.002854592,0.001884367,0.002028165,0.002127964],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00127493,"about_ca_system_score_gemma":0.001756924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003643331,"about_ca_topic_score_gemma":0.005124993,"domain_scores_codex":[0.9992257,0.000275764,0.00003717517,0.0001928179,0.0001762901,0.00009222889],"domain_scores_gemma":[0.9986417,0.0008458524,0.0001236443,0.000147438,0.0001636803,0.00007766487],"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.0005861101,0.0004175337,0.001136475,0.0005285144,0.0001435025,0.0001962831,0.000312753,0.5986801,0.006564931,0.03959304,0.01962086,0.3322198],"study_design_scores_gemma":[0.0001232627,0.000104209,0.0001390479,0.00003432457,0.00002479066,0.0001124273,0.00006886287,0.9795195,0.001372128,0.01555339,0.002932715,0.00001531848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008591975,0.0004782421,0.9865689,0.0001992243,0.00003077581,0.0001277623,0.0001267019,0.00118109,0.002695424],"genre_scores_gemma":[0.1348757,0.0003344077,0.8582465,0.0002554106,0.00004218114,0.0005983003,0.0007793632,0.0003556184,0.004512417],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008929148,"threshold_uncertainty_score":0.02987105,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01797960096604196,"score_gpt":0.2432199774431537,"score_spread":0.2252403764771117,"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."}}