{"id":"W4385489671","doi":"10.32920/23823903","title":"An arc search interior-point algorithm for monotone linear complementarity problems over symmetric cones","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Interior point method; Monotone polygon; Mathematics; Arc (geometry); Complementarity (molecular biology); Combinatorics; Algorithm; Ellipse; Path (computing); Convergence (economics); Geometry; 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002152765,0.0006975351,0.001132021,0.001201648,0.000288893,0.0003168983,0.001260605,0.0004634775,0.001220832],"category_scores_gemma":[0.0006417966,0.0006712011,0.0003539571,0.0008690393,0.0002225242,0.0002910931,0.002495416,0.001426836,0.0001131392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000612487,"about_ca_system_score_gemma":0.0003534585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009471537,"about_ca_topic_score_gemma":0.0003313321,"domain_scores_codex":[0.9945343,0.0003025505,0.001332605,0.001463753,0.001267406,0.001099456],"domain_scores_gemma":[0.9948889,0.001419766,0.0003731269,0.001608638,0.001274007,0.0004355336],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009109093,0.01084955,0.002864391,0.02796301,0.007557653,0.0002856177,0.01465254,0.2307514,0.002362618,0.1374978,0.05753025,0.5067744],"study_design_scores_gemma":[0.001459151,0.0003205175,0.00009452417,0.0001958745,0.0000586729,0.000004806163,0.0004870419,0.89519,0.001334479,0.09924917,0.0009088214,0.0006969505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001543864,0.00004377019,0.9878936,0.0005427126,0.0005388664,0.006621812,0.001550649,0.0009308939,0.0003338084],"genre_scores_gemma":[0.001977407,0.0002545691,0.9876029,0.0001161097,0.0004512322,0.001863057,0.001806617,0.0003575902,0.005570507],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6644387,"threshold_uncertainty_score":0.9996922,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1995643351739061,"score_gpt":0.4501301531394958,"score_spread":0.2505658179655897,"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."}}