{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001428001,0.00009345078,0.00007471839,0.00004720267,0.0001063548,0.00004297602,0.0001068725,0.00005164224,0.0003555854],"category_scores_gemma":[0.000004004501,0.00006147099,0.00004314393,0.0001448756,0.0001286098,0.00003196596,0.0000103944,0.00008266239,0.00009632779],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001459089,"about_ca_system_score_gemma":0.00001549278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001076244,"about_ca_topic_score_gemma":0.00001851769,"domain_scores_codex":[0.9994674,0.00000902966,0.0001079261,0.0001069625,0.0001006772,0.0002079518],"domain_scores_gemma":[0.9996386,0.00009387425,0.000006978975,0.0001419379,0.00007214701,0.00004649908],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001733879,0.00004423451,0.0000261838,0.00006097645,0.0001392116,0.000001190519,0.0006217819,0.1906846,0.0001948213,0.0200747,0.02751615,0.7606187],"study_design_scores_gemma":[0.0003706642,0.0001176035,0.00001114403,0.00001359013,0.00000676598,0.000004651302,0.00008958101,0.9601693,0.00240934,0.0002222248,0.03648267,0.0001024449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0000734567,0.00002306661,0.9419655,0.0003771016,0.0001947247,0.0003736879,0.00001334302,0.0002897285,0.05668935],"genre_scores_gemma":[0.8419749,0.00006050933,0.1509948,0.0008286491,0.0002808831,0.0001235952,0.0000223261,0.00007249498,0.00564191],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8419014,"threshold_uncertainty_score":0.389341,"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."}}