{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00285337,0.0009530249,0.001100831,0.0003862955,0.0004250027,0.001201143,0.00132203,0.00168897,0.002504347],"category_scores_gemma":[0.006726263,0.0004956543,0.0004478599,0.0006179673,0.00160457,0.001606103,0.001214622,0.001472308,0.0001915946],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001437699,"about_ca_system_score_gemma":0.001399675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004732368,"about_ca_topic_score_gemma":0.003475526,"domain_scores_codex":[0.999019,0.0005507725,0.00002329909,0.0001294406,0.0001698643,0.0001076363],"domain_scores_gemma":[0.9940464,0.00513895,0.0002448026,0.0001463001,0.0002964755,0.0001269471],"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.00003019217,0.00003170728,0.00009579792,0.00002634757,0.00001183588,0.00001616091,0.0000114331,0.9876446,0.000304772,0.00894946,0.0001981346,0.002679638],"study_design_scores_gemma":[0.000006578272,0.000009389847,0.00001163026,0.000001273438,8.483169e-7,0.00000114132,0.000002562866,0.99766,0.0000733749,0.002187123,0.00004524784,8.783258e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1424064,0.0005928474,0.8477656,0.001387506,0.00008514675,0.000117145,0.000119119,0.0002542034,0.007272008],"genre_scores_gemma":[0.8081878,0.0001741399,0.186363,0.0003143733,0.00005043863,0.0002515991,0.0001437637,0.00009828989,0.004416525],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004732368,"threshold_uncertainty_score":0.01509023,"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."}}