{"id":"W2949907273","doi":"10.48550/arxiv.1212.4211","title":"The quadratic balanced optimization problem","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Knapsack problem; Heuristic; Pairwise comparison; Mathematical optimization; Simple (philosophy); Quadratic equation; Quadratic assignment problem; Mathematics; Continuous knapsack problem; Optimization problem; Matrix (chemical analysis); Quadratic programming; Sequence (biology); Computer science; Algorithm","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.0005069771,0.0002397235,0.0001987405,0.0001172069,0.0004563943,0.0003931906,0.001968693,0.0002010376,0.00004308424],"category_scores_gemma":[0.00003783196,0.0002060139,0.0001226718,0.0005884698,0.0001114505,0.0005631063,0.001489328,0.0004838318,0.0001110287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001562367,"about_ca_system_score_gemma":0.0002235238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003119748,"about_ca_topic_score_gemma":0.00001631095,"domain_scores_codex":[0.9982806,0.0002681507,0.0002195505,0.0006354802,0.0001349739,0.0004612186],"domain_scores_gemma":[0.9980083,0.0001433462,0.0002518018,0.00116231,0.0002440375,0.0001902772],"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.000005104821,0.00003422068,0.0002129673,0.00002509599,0.00002672156,0.000006350337,0.0001690706,0.8043536,0.000002233845,0.1943457,0.0003403245,0.000478648],"study_design_scores_gemma":[0.0002420555,0.00001799321,0.00008785332,0.00003674222,0.00001743716,0.000001646384,0.00002932347,0.983392,0.00001148145,0.01487711,0.001029958,0.0002563757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005410931,0.0001069657,0.9891285,0.000553756,0.0005080964,0.0005419591,0.000003293643,0.000291756,0.008324596],"genre_scores_gemma":[0.9497107,0.0008232569,0.04374338,0.0001513536,0.000088687,0.000006066409,0.00002813499,0.00002366382,0.005424798],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9491696,"threshold_uncertainty_score":0.8401001,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06536104432498288,"score_gpt":0.1930957332266853,"score_spread":0.1277346889017024,"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."}}