{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001090188,0.0009887367,0.001288049,0.001083959,0.0007254449,0.001118324,0.002011388,0.001671226,0.008958404],"category_scores_gemma":[0.004402192,0.0006738475,0.0009748891,0.002081898,0.0008443447,0.002934789,0.001940468,0.002148679,0.002135026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001285389,"about_ca_system_score_gemma":0.00166799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003156683,"about_ca_topic_score_gemma":0.004395478,"domain_scores_codex":[0.9992072,0.0002806828,0.000037788,0.0002076559,0.0001768021,0.00008998572],"domain_scores_gemma":[0.9986129,0.0008698985,0.0001232993,0.000158116,0.0001588065,0.00007699663],"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.0005491221,0.000420136,0.001104529,0.0005377754,0.0001394719,0.0001918836,0.0003185376,0.6038659,0.006359966,0.04490454,0.01966712,0.321941],"study_design_scores_gemma":[0.000117346,0.0001009818,0.0001358654,0.00003507596,0.00002379818,0.0001096708,0.00006852191,0.9761898,0.001406708,0.01872563,0.003071825,0.00001477437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008368768,0.0004571925,0.9868558,0.0002017537,0.00003040725,0.0001198279,0.0001231511,0.001092389,0.002750619],"genre_scores_gemma":[0.1275238,0.000325954,0.8657858,0.0002498203,0.00004344965,0.0005604954,0.0007300836,0.000359682,0.004420971],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008958404,"threshold_uncertainty_score":0.02996886,"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."}}