{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001179881,0.001211783,0.0008112283,0.000565197,0.0005422462,0.001588581,0.001213615,0.001233675,0.0125684],"category_scores_gemma":[0.003275602,0.0003960316,0.0005543623,0.001170553,0.0008253181,0.002090523,0.001770057,0.001643976,0.002076513],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009822742,"about_ca_system_score_gemma":0.001167266,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002388811,"about_ca_topic_score_gemma":0.001870347,"domain_scores_codex":[0.9986975,0.0004268875,0.00004850844,0.0002897597,0.0003466853,0.0001906332],"domain_scores_gemma":[0.9993352,0.0003170923,0.00007962403,0.00006615123,0.0001295147,0.00007247423],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001515029,0.0001847405,0.0008653736,0.0004081347,0.00006929333,0.0002253483,0.00009627778,0.5609984,0.003804219,0.3051157,0.02924906,0.09883195],"study_design_scores_gemma":[0.00004549681,0.0001145491,0.0003761263,0.00003744126,0.00001627695,0.000166631,0.00005549514,0.7902133,0.0008667541,0.170745,0.03734269,0.00002014879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01342937,0.001013633,0.9465858,0.001204611,0.0002273219,0.0001230264,0.001005018,0.0002684399,0.03614292],"genre_scores_gemma":[0.473866,0.003136321,0.4679025,0.001047523,0.0004373715,0.0007961311,0.004051189,0.0005969745,0.04816586],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0125684,"threshold_uncertainty_score":0.04204553,"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."}}