{"id":"W4309986995","doi":"10.21203/rs.3.rs-2129454/v1","title":"Non-convex Quadratic Programming Using Coherent Optical Networks","year":2022,"lang":"en","type":"preprint","venue":"Research Square","topic":"Optical Network Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"QLT (Canada); Perimeter Institute; University of Waterloo","funders":"Institut Périmètre de physique théorique; Government of Canada; Ministry of Colleges and Universities; Innovation, Science and Economic Development Canada; National Science Foundation","keywords":"Regular polygon; Quadratic programming; Quadratic equation; Quadratically constrained quadratic program; Second-order cone programming; Convex optimization; Computer science; Mathematical optimization; Mathematics; Geometry","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001466826,0.0004993244,0.0006975604,0.0005062798,0.0003550835,0.0004516547,0.001256299,0.0008205191,0.0004933722],"category_scores_gemma":[0.0002780102,0.000519617,0.0002434257,0.001031948,0.0004040397,0.0000885433,0.004043359,0.007348693,0.00005531595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001222043,"about_ca_system_score_gemma":0.0001846654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005461458,"about_ca_topic_score_gemma":0.00002151027,"domain_scores_codex":[0.9952213,0.0001780439,0.0005832285,0.0007804152,0.001446234,0.001790732],"domain_scores_gemma":[0.9976812,0.0004115645,0.00004954497,0.00135029,0.0002163423,0.0002910874],"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.00002380641,0.0001130536,0.001196501,0.00190431,0.0001765544,0.0002347817,0.0001072308,0.963351,0.00006799494,0.00212748,0.001590959,0.02910633],"study_design_scores_gemma":[0.0001784709,0.000187431,0.0004184916,0.0007040711,0.00002975837,0.000008298793,0.0006952124,0.9925084,0.00007161222,0.0009876748,0.003647228,0.0005633431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8778859,0.01164075,0.07945169,0.0005566203,0.003505266,0.008949014,0.00005627829,0.006703535,0.01125096],"genre_scores_gemma":[0.971705,0.0004982204,0.02574908,0.000006445012,0.0005167075,0.001121302,0.0001028912,0.0002129102,0.00008747108],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09381908,"threshold_uncertainty_score":0.9997255,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06637864967907937,"score_gpt":0.369543071450281,"score_spread":0.3031644217712016,"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."}}