{"id":"W4238973496","doi":"10.7287/peerj.preprints.27434","title":"A local search algorithm for the constrained max cut problem on hypergraphs.","year":2018,"lang":"en","type":"preprint","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); 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031162,0.0002898001,0.0002401082,0.0001181251,0.0001122105,0.0001340457,0.0003402467,0.0002972372,0.0004225479],"category_scores_gemma":[0.000007699447,0.0002032244,0.0001618507,0.000120122,0.0001762788,0.00002364468,0.000116066,0.0004828903,0.00008276582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005237708,"about_ca_system_score_gemma":0.00007406988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000303247,"about_ca_topic_score_gemma":0.00001915596,"domain_scores_codex":[0.9988388,0.00002488178,0.0002647551,0.0003139251,0.0002151698,0.0003424826],"domain_scores_gemma":[0.9991316,0.0001710737,0.00003020355,0.0004349804,0.0001494008,0.00008279939],"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.000008293887,0.00002671805,0.000005122673,0.0002621894,0.0002200999,0.000001160217,0.000230098,0.82977,0.000006919928,0.002082802,0.01759037,0.1497962],"study_design_scores_gemma":[0.000356113,0.00006804142,0.000005738058,0.0001162768,0.00003014611,0.000005069267,0.00005785859,0.9765364,0.0005206107,0.001043572,0.02097952,0.0002806371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002924586,0.0001029817,0.9522383,0.0004091587,0.0007835119,0.00126371,0.0001238465,0.0005851539,0.04446406],"genre_scores_gemma":[0.2804675,0.001151099,0.697169,0.001372776,0.001371561,0.001764181,0.0007272607,0.0005214608,0.01545516],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2804382,"threshold_uncertainty_score":0.8287252,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02488506606751511,"score_gpt":0.2558612088613268,"score_spread":0.2309761427938117,"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."}}