{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":195,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":195,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"866aad7d93e9","filters":{"venue":"Mathematical Programming"}},"results":[{"id":"W1980450998","doi":"10.1007/s10107-002-0349-3","title":"On implementing a primal-dual interior-point method for conic quadratic optimization","year":2003,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":664,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Interior point method; Conic section; Conic optimization; Quadratic equation; Mathematics; Quadratic programming; Mathematical optimization; Dual (grammatical number); Quadratic unconstrained binary optimization; Optimization problem; Extension (predicate logic); Algorithm; Computer science; Convex optimization; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.06817259144325699,"gpt":0.4259764846376932,"spread":0.3578038931944362,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002623479,0.0003263585,0.0005258485,0.0001821098,0.000330141,0.0002258598,0.0001981624,0.0001252366,0.0009750154],"category_scores_gemma":[0.009862697,0.0002876878,0.0001909774,0.0003807051,0.00008004856,0.0002154226,0.00009735654,0.000280267,0.00003969335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001972795,"about_ca_system_score_gemma":0.00008399964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.467291e-7,"about_ca_topic_score_gemma":0.000001691176,"domain_scores_codex":[0.9968729,0.0002757161,0.0009211889,0.0005104379,0.0005358256,0.0008839234],"domain_scores_gemma":[0.9956991,0.003062261,0.0002977216,0.0004594033,0.0002914919,0.0001900442],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004935411,0.0004465581,0.000002622029,0.0009043054,0.00010024,0.000007095843,0.00104694,0.006106818,0.0001422867,0.9629189,0.000211545,0.02806336],"study_design_scores_gemma":[0.001302806,0.0003399625,1.003146e-7,0.0001889427,0.0000648549,0.00003823508,0.0009470081,0.570731,0.002146063,0.4224487,0.001435737,0.0003565649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003155732,0.00001597285,0.9935948,0.0001994984,0.00005851876,0.002490191,0.000006099114,0.0002685842,0.003050805],"genre_scores_gemma":[0.006132347,0.000001909328,0.9921215,0.00008715472,0.00004111009,0.0008436703,0.00001759741,0.0001141634,0.0006406112],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5646242,"threshold_uncertainty_score":0.9999575,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075660001","doi":"10.1007/s10107-014-0800-2","title":"On the complexity analysis of randomized block-coordinate descent methods","year":2014,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":215,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Convex function; Separable space; Block (permutation group theory); Convex optimization; Combinatorics; Coordinate descent; Rate of convergence; Convergence (economics); Function (biology); Regular polygon; Sequence (biology); Descent (aeronautics); Convex analysis; Applied mathematics; Mathematical optimization; Computer science; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.05267368180101976,"gpt":0.3311871699736866,"spread":0.2785134881726669,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005149773,0.0001515863,0.0007754383,0.0002424474,0.0001089915,0.0001116614,0.0007620528,0.00004657327,0.00004040989],"category_scores_gemma":[0.003678961,0.00008852677,0.0003888361,0.0011814,0.0004049423,0.00005775472,0.0002020074,0.0001204074,0.000007031981],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002394137,"about_ca_system_score_gemma":0.000008192895,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005275939,"about_ca_topic_score_gemma":3.866273e-7,"domain_scores_codex":[0.9978027,0.0007435334,0.0005740855,0.0002719849,0.0003673269,0.00024037],"domain_scores_gemma":[0.9945124,0.004290627,0.000275504,0.0007217432,0.0001299286,0.00006984491],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005467836,0.0001183738,0.000001991212,0.00002013972,0.0002390428,1.925476e-7,0.0004134871,0.000340043,0.00001734136,0.9795969,0.00001240517,0.01918545],"study_design_scores_gemma":[0.001380626,0.0000333488,0.000005244436,0.00002571693,0.0002178633,8.781292e-7,0.00001014635,0.6328008,0.0008000954,0.364635,0.00002017271,0.00007007139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008168597,0.000008067515,0.9955142,0.0008979005,0.0000357045,0.0006780686,3.495782e-7,0.0002404798,0.001808339],"genre_scores_gemma":[0.3785782,3.613583e-7,0.6212274,0.00008218199,0.000004165058,0.00008871078,6.761769e-7,0.00000530046,0.00001291796],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6324608,"threshold_uncertainty_score":0.4404325,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2112079301","doi":"10.1007/s101070200296","title":"Self-regular functions and new search directions for linear and semidefinite optimization","year":2002,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":210,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Combinatorics; Degree (music); Function (biology); Upper and lower bounds; Kernel (algebra); Interior point method; Polynomial; Semidefinite programming; Discrete mathematics; Algorithm; Mathematical analysis; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.1030337261159072,"gpt":0.3484202648766631,"spread":0.2453865387607559,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004187114,0.0001941862,0.0002780098,0.0001683892,0.0004182046,0.0001564103,0.00008692866,0.0001221892,0.0002245133],"category_scores_gemma":[0.001334383,0.0001806973,0.00006037919,0.0004012708,0.0001190408,0.0002365466,0.0001024839,0.0002046383,0.00002267207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004960578,"about_ca_system_score_gemma":0.000019889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002063917,"about_ca_topic_score_gemma":0.0000015437,"domain_scores_codex":[0.9984905,0.00005697416,0.0003718527,0.0003602676,0.0003044927,0.0004159144],"domain_scores_gemma":[0.9981171,0.001076155,0.00006808392,0.0002547448,0.0001857457,0.0002981515],"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.00008024943,0.002674767,0.0002055082,0.005426398,0.0006427486,0.00001662041,0.008944921,0.01947155,0.00009166916,0.2821529,0.004407222,0.6758854],"study_design_scores_gemma":[0.0007230125,0.0001200228,0.000001193155,0.00006615144,0.00008007888,0.00004846415,0.0003688966,0.9571442,0.00005175818,0.03140854,0.009768886,0.0002187872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004592836,0.0003483673,0.9955627,0.0008115657,0.0000318594,0.001211439,0.00000678283,0.0004124869,0.00115555],"genre_scores_gemma":[0.0008771002,0.0001737842,0.9927822,0.0000207012,0.0001132561,0.0001901202,0.00001028937,0.00006683824,0.005765684],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9376727,"threshold_uncertainty_score":0.7368624,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1530501119","doi":"10.1007/s101079900106","title":"A branch and cut algorithm for nonconvex quadratically constrained quadratic programming","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":183,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Quadratic growth; Mathematics; Tree (set theory); Linearization; Mathematical optimization; Quadratic programming; Quadratic equation; Node (physics); Quadratically constrained quadratic program; Branch and cut; Second-order cone programming; Algorithm; Linear programming; Combinatorics; Convex optimization; Nonlinear system","retraction":null,"screen_n_in":null,"score":{"opus":0.03949063608831347,"gpt":0.3537206788466457,"spread":0.3142300427583322,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001177344,0.0004796871,0.0008136349,0.0001516895,0.0004260847,0.0004104083,0.0003278076,0.0002453231,0.001113571],"category_scores_gemma":[0.001676718,0.000424037,0.0001995947,0.000474088,0.0006075249,0.0003512242,0.00008820053,0.0003993522,0.00009663561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008257894,"about_ca_system_score_gemma":0.0001117782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000294683,"about_ca_topic_score_gemma":0.000005720246,"domain_scores_codex":[0.9962547,0.0001335864,0.001078495,0.0007126952,0.0007012106,0.001119287],"domain_scores_gemma":[0.9962541,0.002292949,0.000170611,0.0005170277,0.0002853466,0.0004800093],"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.0000294063,0.0004987181,0.000006698116,0.000754262,0.00008259348,0.00001537597,0.0008869472,0.00001089999,0.00002972481,0.03719576,0.00006663286,0.960423],"study_design_scores_gemma":[0.003291147,0.0006803828,0.000004071868,0.0004351522,0.0001789818,0.0002556017,0.0008975644,0.5156506,0.0003629132,0.4657559,0.01147906,0.001008672],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002803241,0.00009282822,0.9903378,0.0005767021,0.00003932335,0.003673022,0.00001656797,0.0005348636,0.00192564],"genre_scores_gemma":[0.009373119,0.00001600879,0.9863354,0.00009788556,0.0001528887,0.001222635,0.00002262293,0.0001353418,0.00264409],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9594143,"threshold_uncertainty_score":0.9998211,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2042860556","doi":"10.1007/s10107-008-0261-6","title":"Primal-dual first-order methods with $${\\mathcal {O}(1/\\epsilon)}$$ iteration-complexity for cone programming","year":2009,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":154,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Semidefinite programming; Second-order cone programming; Linear programming; Cone (formal languages); Convex optimization; Rank (graph theory); Regular polygon; Combinatorics; Mathematical optimization; Discrete mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.04902607468451811,"gpt":0.3262534941219266,"spread":0.2772274194374085,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004612488,0.0003830988,0.0005202997,0.0001031562,0.0002392339,0.0003062255,0.00019209,0.0001591525,0.00003514462],"category_scores_gemma":[0.0001674359,0.0003154413,0.0001277755,0.0003192088,0.0001443679,0.0002183034,0.0000345927,0.0002708929,0.00001247669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006532593,"about_ca_system_score_gemma":0.00001959199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002780578,"about_ca_topic_score_gemma":0.000005117892,"domain_scores_codex":[0.998141,0.00004426859,0.0005051628,0.0003724582,0.0002748154,0.000662311],"domain_scores_gemma":[0.998872,0.0002932214,0.00008260718,0.000401238,0.0001896676,0.0001611966],"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.0001323243,0.0007299432,0.00005259525,0.0007333074,0.0002520813,0.00004839334,0.00204908,0.001170391,0.00397425,0.1100729,0.0009739037,0.8798108],"study_design_scores_gemma":[0.002186341,0.001923883,0.0002368814,0.001240928,0.0003608957,0.0003763246,0.0003477143,0.7199315,0.03769822,0.1351483,0.09839454,0.002154537],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007425161,0.0001368883,0.9869074,0.0004585004,0.0000637609,0.001534902,0.000002994484,0.002135189,0.001335209],"genre_scores_gemma":[0.2427927,0.000002104686,0.7567074,0.00007276021,0.00009070268,0.0002202182,0.00001955348,0.00005649612,0.00003813983],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8776563,"threshold_uncertainty_score":0.9999298,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2063761188","doi":"10.1007/s10107-013-0722-4","title":"Iterative reweighted minimization methods for $$l_p$$ l p regularized unconstrained nonlinear programming","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":141,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Lipschitz continuity; Mathematics; Minification; Sequence (biology); Convergence (economics); Iterative method; Stationary point; Combinatorics; Applied mathematics; Nonlinear system; Linear programming; Algorithm; Mathematical optimization; Mathematical analysis; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02348848813503768,"gpt":0.3072439672906072,"spread":0.2837554791555695,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000358716,0.000312515,0.000449272,0.0001248571,0.0001371303,0.000305084,0.0001901438,0.0001885484,0.00008725184],"category_scores_gemma":[0.0003766319,0.0002722586,0.00016508,0.0002979919,0.0001149347,0.0002456972,0.00004710273,0.0001938923,0.00002910903],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005383091,"about_ca_system_score_gemma":0.00001630551,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003612576,"about_ca_topic_score_gemma":6.452853e-7,"domain_scores_codex":[0.9983745,0.00008514614,0.0005551054,0.000306563,0.0001581989,0.0005204896],"domain_scores_gemma":[0.9987528,0.000433614,0.00009017176,0.0003416458,0.0002427379,0.0001390463],"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.00001432345,0.0001450475,0.000006534977,0.000327345,0.0001500714,0.000003607697,0.0008291211,0.0001253631,0.01953193,0.006782938,0.0007106686,0.971373],"study_design_scores_gemma":[0.0006269116,0.0001374866,0.000003978063,0.0003176545,0.00008638727,0.00002425715,0.0002581165,0.8787151,0.05508343,0.04628684,0.01795212,0.0005077099],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004585981,0.0001004189,0.9897424,0.0001421114,0.0001095425,0.002288053,0.000002238917,0.001919513,0.001109734],"genre_scores_gemma":[0.04008095,0.00000282881,0.9586083,0.00003941014,0.0001201402,0.0008909689,0.00004660668,0.00008659116,0.0001241615],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9708654,"threshold_uncertainty_score":0.9999729,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1965094948","doi":"10.1007/s10107-006-0039-7","title":"Reduction of symmetric semidefinite programs using the regular $$\\ast$$ -representation","year":2006,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":129,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Mathematics; Combinatorics; Semidefinite programming; Centralizer and normalizer; Bipartite graph; Matrix (chemical analysis); Order (exchange); Permutation (music); Permutation matrix; Permutation group; Upper and lower bounds; Discrete mathematics; Physics; Graph; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.09965246932807036,"gpt":0.3762481850279963,"spread":0.276595715699926,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009694235,0.0002095321,0.0003604454,0.0002435317,0.0002246101,0.0001150669,0.0002783136,0.0001128709,0.00005489793],"category_scores_gemma":[0.001050553,0.0001524412,0.0001590073,0.001806416,0.0003232237,0.0002357194,0.0001238929,0.0002537466,0.00001315495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001058104,"about_ca_system_score_gemma":0.00003964121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003381208,"about_ca_topic_score_gemma":0.000001810894,"domain_scores_codex":[0.9973404,0.0001809101,0.0008238308,0.0003171311,0.0008791568,0.0004585976],"domain_scores_gemma":[0.9980587,0.0005634695,0.0003942322,0.0005544813,0.0003588941,0.00007025279],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000459567,0.001540637,0.0002962991,0.001049828,0.0001155104,0.00001163366,0.0008769238,0.004844458,0.003333939,0.8266974,0.0001620254,0.1610254],"study_design_scores_gemma":[0.0005133846,0.00009133584,0.00001721472,0.0002160128,0.0001134825,0.000112686,0.001283815,0.147995,0.006270287,0.8427826,0.0003397434,0.00026442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07573354,0.0001448623,0.9199219,0.0002037068,0.00007750762,0.001764658,0.000002043119,0.0002488295,0.001902894],"genre_scores_gemma":[0.2485753,0.000004417847,0.7505432,0.000003485541,0.0001397392,0.0001259554,0.00001605857,0.00006224291,0.0005295938],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1728418,"threshold_uncertainty_score":0.6216373,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964191135","doi":"10.1007/s10107-005-0578-3","title":"Cuts for mixed 0-1 conic programming","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":120,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Conic section; Semidefinite programming; Mathematics; Conic optimization; Linear programming; Mathematical optimization; Convex optimization; Rank (graph theory); Regular polygon; Travelling salesman problem; Quadratic programming; Combinatorics; Convex analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.07451220809616238,"gpt":0.3946342440206426,"spread":0.3201220359244802,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001098025,0.0003265296,0.0005138793,0.000151737,0.0003002736,0.00021396,0.0004046592,0.0001718318,0.0002764963],"category_scores_gemma":[0.003233358,0.0002897106,0.0002326179,0.0003994654,0.0001895966,0.000311622,0.000152627,0.0003030912,0.0001998764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000173066,"about_ca_system_score_gemma":0.00006980983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.302417e-7,"about_ca_topic_score_gemma":0.000005954297,"domain_scores_codex":[0.9970057,0.0000713531,0.000784331,0.0004963445,0.0006166788,0.001025586],"domain_scores_gemma":[0.9971573,0.001499133,0.0002010776,0.0005315829,0.0003157696,0.0002951045],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003514439,0.0007814572,0.00001057661,0.0007734984,0.00007887822,0.000005711976,0.0006329665,0.0001268925,0.00007196245,0.2450929,0.00128172,0.7511083],"study_design_scores_gemma":[0.002871394,0.000379227,0.000003077397,0.0003190445,0.0001399836,0.00008555839,0.0009038004,0.1814797,0.003101933,0.4314977,0.3782022,0.001016436],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001692112,0.0001027844,0.9917245,0.001056002,0.00007200777,0.002863476,0.000005982484,0.0007029061,0.00178025],"genre_scores_gemma":[0.01914071,0.000004692783,0.9756967,0.00006195719,0.0002874973,0.001320111,0.00001678548,0.0001268683,0.003344632],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7500919,"threshold_uncertainty_score":0.9999555,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116616571","doi":"10.1007/s10107-011-0459-x","title":"Nuclear norm minimization for the planted clique and biclique problems","year":2011,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":119,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Complete bipartite graph; Mathematics; Combinatorics; Bipartite graph; Clique problem; Clique; Matrix norm; Generalization; Discrete mathematics; Minification; Graph; Mathematical optimization; Line graph; Pathwidth","retraction":null,"screen_n_in":null,"score":{"opus":0.04039522035801042,"gpt":0.2216688850264545,"spread":0.1812736646684441,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001250732,0.0001065952,0.0001210867,0.00002910233,0.00008325454,0.00004926909,0.00009418496,0.00006990187,0.00001575415],"category_scores_gemma":[0.00004948785,0.00007330186,0.00003563434,0.00006117276,0.00005505911,0.00005667123,0.00002848675,0.00008898535,0.000005603719],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008942496,"about_ca_system_score_gemma":0.000002585735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004556476,"about_ca_topic_score_gemma":0.000002925863,"domain_scores_codex":[0.9994783,0.000009454603,0.0001712371,0.000103363,0.00005914685,0.0001784857],"domain_scores_gemma":[0.9996283,0.0001294337,0.00002601122,0.000148266,0.00002981241,0.00003814928],"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.0001620364,0.0006014747,0.0003601443,0.002726824,0.0006100397,0.00002779776,0.02751406,0.0007226024,0.01569671,0.3870978,0.004752451,0.5597281],"study_design_scores_gemma":[0.0004618214,0.0002546109,0.0001793578,0.000523244,0.0001279586,0.00009100972,0.0005505171,0.867628,0.0178882,0.08646192,0.025305,0.0005283513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.054249,0.0002825663,0.9379282,0.0001387828,0.00009216948,0.001735807,0.0000028568,0.0018251,0.003745526],"genre_scores_gemma":[0.8846297,0.00003204309,0.1150798,0.00004284789,0.000035667,0.000116447,0.00000203032,0.00004328945,0.00001816134],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8669054,"threshold_uncertainty_score":0.2989163,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104417092","doi":"10.1007/s10107-011-0452-4","title":"An augmented Lagrangian approach for sparse principal component analysis","year":2011,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":110,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Sparse PCA; Principal component analysis; Mathematics; Orthogonality; Dimension (graph theory); Algorithm; Uncorrelated; Dimensionality reduction; Applied mathematics; Computer science; Pattern recognition (psychology); Combinatorics; Artificial intelligence; Statistics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.05386574135832146,"gpt":0.2661403389646625,"spread":0.2122745976063411,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002257829,0.0001917413,0.0003326647,0.0001559857,0.00007069819,0.00005917565,0.0002159596,0.00008745135,0.0000413603],"category_scores_gemma":[0.00001491823,0.0001699632,0.0001925886,0.0002962389,0.00005121251,0.00008763035,0.00002818863,0.0001053583,0.000008367472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002864989,"about_ca_system_score_gemma":0.000003600074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009650616,"about_ca_topic_score_gemma":0.000003148189,"domain_scores_codex":[0.9989342,0.00002265105,0.0003006323,0.0002278349,0.0001528088,0.000361837],"domain_scores_gemma":[0.9993447,0.0000330149,0.00003899435,0.0003989745,0.0000452801,0.0001390549],"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.0005458124,0.01450162,0.005715102,0.00415667,0.01604318,0.0001829579,0.03434009,0.03576439,0.04852563,0.2898243,0.001657968,0.5487422],"study_design_scores_gemma":[0.0002393324,0.0001160581,0.0002910587,0.00003014716,0.0006106056,0.000007004236,0.0002379537,0.9810743,0.01134473,0.004936017,0.0007590931,0.0003537409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08273065,0.000032292,0.9111983,0.000003106213,0.0000260455,0.0005689012,0.000003268144,0.001472346,0.0039651],"genre_scores_gemma":[0.6042292,7.639287e-7,0.3955726,0.000007711606,0.00001913738,0.0001053847,0.00002685731,0.00002667842,0.00001160294],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9453099,"threshold_uncertainty_score":0.6930897,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007277085","doi":"10.1007/s10107-007-0124-6","title":"Computing proximal points of nonconvex functions","year":2007,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Subgradient method; Proximal Gradient Methods; Bounded function; Lipschitz continuity; Mathematical optimization; Regular polygon; Function (biology); Convex optimization; Applied mathematics; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01754484837312971,"gpt":0.2718162145073227,"spread":0.254271366134193,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008525369,0.00008059157,0.0001603741,0.0001166377,0.000098391,0.00006831909,0.0002610329,0.000040254,0.00006631128],"category_scores_gemma":[0.0001731379,0.00006856425,0.00009043305,0.0006013745,0.00004041569,0.000170992,0.0001190108,0.00007718227,0.00007221723],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001996789,"about_ca_system_score_gemma":0.00002346296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002686266,"about_ca_topic_score_gemma":0.000001533628,"domain_scores_codex":[0.9989009,0.00002220244,0.0003986571,0.0001780433,0.0002892362,0.0002108952],"domain_scores_gemma":[0.9992036,0.0002237687,0.0001323439,0.0002105462,0.0001460482,0.00008368861],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004280042,0.0004334885,0.0008444047,0.00009495413,0.00006885516,0.000004734731,0.0009732347,0.0002450717,0.0001307775,0.8349398,0.00005777448,0.1622027],"study_design_scores_gemma":[0.0004262675,0.0001008551,0.001755101,0.00006881882,0.0000494601,0.00002461753,0.0002352318,0.9655173,0.0009854437,0.02913101,0.00144892,0.0002569116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002055959,0.000008896502,0.9910071,0.0004391444,0.0000486428,0.0001253868,2.828944e-7,0.0001185669,0.006196046],"genre_scores_gemma":[0.4776343,9.451436e-8,0.5221674,0.00004836121,0.00002500927,0.000001730083,0.000001640058,0.000003613459,0.0001178958],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9652723,"threshold_uncertainty_score":0.2795969,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2016019828","doi":"10.1007/s101070100278","title":"On error bounds for lower semicontinuous functions","year":2002,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Banach space; Subderivative; Function (biology); Upper and lower bounds; Space (punctuation); Regular polygon; Normed vector space; Metric space; Pure mathematics; Convex function; Discrete mathematics; Mathematical analysis; Applied mathematics; Convex optimization; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03133459075991703,"gpt":0.2601535055372161,"spread":0.2288189147772991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000175568,0.00009813128,0.000137634,0.00008012187,0.0001938633,0.0002547303,0.0002417936,0.0000454969,0.0004020063],"category_scores_gemma":[0.0002392623,0.00008072194,0.0001328881,0.0003162779,0.00002250994,0.0001682859,0.00004236429,0.00006471978,0.0004295624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002592972,"about_ca_system_score_gemma":0.000006389439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.070983e-7,"about_ca_topic_score_gemma":5.428962e-7,"domain_scores_codex":[0.9991145,0.00001681195,0.0002172429,0.0002358031,0.0002023097,0.0002133837],"domain_scores_gemma":[0.9992676,0.0002424425,0.00005958642,0.0002632137,0.00008654607,0.00008056696],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003560917,0.0006291902,0.000007163751,0.00003124895,0.00004758765,0.000001975427,0.0003979665,0.0005629305,0.00001401992,0.9212629,0.005222405,0.07181905],"study_design_scores_gemma":[0.0002508261,0.0001245693,0.000005229213,0.00001754987,0.00002363816,0.00000510567,0.00002254913,0.9329264,0.00001307997,0.04524856,0.02122078,0.0001417303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003109667,0.00001306673,0.9897662,0.002023532,0.0001136875,0.0002182178,0.000001452829,0.0001997707,0.007353133],"genre_scores_gemma":[0.3965416,8.86072e-7,0.5901344,0.0007179352,0.0001033224,0.0001993381,0.000007544126,0.00001740428,0.01227755],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9323635,"threshold_uncertainty_score":0.5521299,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170006979","doi":"10.1007/s10107-010-0349-7","title":"An improved column generation algorithm for minimum sum-of-squares clustering","year":2010,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Column (typography); Cluster analysis; Explained sum of squares; Bottleneck; Algorithm; Column generation; Set (abstract data type); Centroid; Point (geometry); Combinatorics; Square (algebra); Euclidean space; Mathematical optimization; Computer science; Statistics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03302216249232391,"gpt":0.335101045809392,"spread":0.3020788833170681,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007982343,0.0001830071,0.0002846081,0.0001103113,0.0001941197,0.0003413293,0.0008900949,0.0001254233,0.00001133519],"category_scores_gemma":[0.0002824005,0.0001732182,0.00009593284,0.000259758,0.0001207644,0.0005819192,0.0002733115,0.000253938,0.000007288833],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003067869,"about_ca_system_score_gemma":0.00005622868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009879556,"about_ca_topic_score_gemma":0.00002223739,"domain_scores_codex":[0.9981113,0.00004290709,0.0004613242,0.0004794059,0.0003579977,0.0005470617],"domain_scores_gemma":[0.9983954,0.0002665358,0.0001320264,0.0007561165,0.0002455004,0.0002043828],"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.000002374328,0.0001681135,0.000002708311,0.0001265005,0.00001060646,0.000002329481,0.0004142698,0.00004901692,0.09746256,0.0021291,0.000006235071,0.8996262],"study_design_scores_gemma":[0.0003709161,0.0003609812,0.000006560077,0.00002221,0.000006081903,0.00001985896,0.00005962951,0.9743242,0.02008656,0.004070641,0.0004745788,0.0001977582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01208412,0.00001377127,0.9863195,0.0001072954,0.0002807694,0.0009175584,0.000004337287,0.0002283322,0.00004427244],"genre_scores_gemma":[0.1070602,5.661294e-7,0.8922771,0.00001644231,0.0002230279,0.0002939165,0.000007821333,0.000029252,0.00009175244],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9742752,"threshold_uncertainty_score":0.7063631,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963292690","doi":"10.1007/s10107-013-0714-4","title":"Iterative hard thresholding methods for $$l_0$$ l 0 regularized convex cone programming","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":96,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Regular polygon; Convex optimization; Relaxation (psychology); Mathematical optimization; Quadratic programming; Sequence (biology); Convex cone; Cone (formal languages); Thresholding; Iterative method; Limit point; Interior point method; Applied mathematics; Algorithm; Convex analysis; Computer science; Mathematical analysis; Geometry; Image (mathematics); Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04073664706120077,"gpt":0.3230238328338438,"spread":0.282287185772643,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000588803,0.0003606024,0.0006114008,0.0001151099,0.0001759593,0.0004849969,0.0002649135,0.0001876228,0.000107249],"category_scores_gemma":[0.0003052104,0.0003169203,0.0002090611,0.00021943,0.0001381989,0.0003031024,0.00008692616,0.0002775122,0.00005643566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006321763,"about_ca_system_score_gemma":0.00001174499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005818174,"about_ca_topic_score_gemma":3.603226e-7,"domain_scores_codex":[0.9981271,0.00007484083,0.0005585021,0.0003568031,0.0001857747,0.0006969985],"domain_scores_gemma":[0.9985779,0.0005447884,0.00008887814,0.0004222436,0.0001926107,0.0001735894],"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.00001554182,0.0001307675,0.00001835657,0.0005191463,0.0002516009,0.000006782554,0.001261965,0.00006991094,0.08173627,0.02834312,0.001613479,0.8860331],"study_design_scores_gemma":[0.001123016,0.0002523575,0.00002185904,0.0008204526,0.0001700168,0.00005833486,0.000649845,0.5695806,0.2082975,0.1654391,0.05246056,0.001126447],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01173553,0.0003195176,0.9816753,0.0001682906,0.0001527591,0.002573166,0.000001500125,0.002133837,0.001240128],"genre_scores_gemma":[0.155694,0.000004678885,0.8425121,0.00006796943,0.0001044667,0.00134528,0.00001115472,0.0000965716,0.000163793],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8849066,"threshold_uncertainty_score":0.9999283,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053944393","doi":"10.1007/s101070050007","title":"A branch-and-cut algorithm for the Undirected Rural Postman Problem","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":96,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algorithm; Binary number; Undirected graph; Combinatorics; Mathematical optimization; Graph; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.01295668653358123,"gpt":0.2600114274650466,"spread":0.2470547409314654,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004655029,0.0001564519,0.0001917784,0.00003005622,0.0001634079,0.0001348601,0.0001325211,0.00007420282,0.0001596169],"category_scores_gemma":[0.0000701945,0.0001131315,0.00006649002,0.0001914712,0.00006639097,0.00007756276,0.00001881234,0.0001427054,0.00003269924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002422356,"about_ca_system_score_gemma":0.000006053932,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002647728,"about_ca_topic_score_gemma":9.337284e-7,"domain_scores_codex":[0.9990819,0.00003452073,0.0002740193,0.00012949,0.0001348727,0.0003452565],"domain_scores_gemma":[0.9992023,0.0004864395,0.00002207171,0.0001798486,0.00003216255,0.00007721825],"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.000002539305,0.00002186123,0.000006850051,0.0001253849,0.00004052688,5.069689e-7,0.0004844026,0.002215939,0.00004934879,0.0009985202,0.00004947583,0.9960046],"study_design_scores_gemma":[0.000332499,0.00003434038,0.00003396573,0.00006964974,0.00005337523,0.00003115612,0.00008045428,0.9865022,0.0002473292,0.006034335,0.006394921,0.0001857717],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006513885,0.0002490078,0.9892582,0.0002738142,0.00004440533,0.001004651,0.000003807683,0.0008523359,0.001799928],"genre_scores_gemma":[0.04152529,0.00001975715,0.9574026,0.00004500676,0.00009669993,0.0002843125,0.000006429676,0.00006891181,0.000550929],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9958189,"threshold_uncertainty_score":0.4613369,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2600745543","doi":"10.1007/s10107-017-1135-6","title":"Binary decision rules for multistage adaptive mixed-integer optimization","year":2017,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":91,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Scalability; Mathematical optimization; Binary number; Decision rule; Binary decision diagram; Computer science; Decision problem; Optimal decision; Optimization problem; Toolbox; Decision tree; Mathematics; Data mining; Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.1174915938561726,"gpt":0.405470753576911,"spread":0.2879791597207385,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002541068,0.0002237115,0.0004162289,0.0001932132,0.001057347,0.001452394,0.0009629066,0.0001618707,0.0002151502],"category_scores_gemma":[0.0100774,0.0001582382,0.0002255322,0.0001522926,0.0002176404,0.0008084023,0.0002386863,0.000122811,0.0003030919],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003791359,"about_ca_system_score_gemma":0.00003668138,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007650336,"about_ca_topic_score_gemma":0.000006095699,"domain_scores_codex":[0.9971881,0.00007347385,0.0008416358,0.0005632694,0.0009378302,0.0003956763],"domain_scores_gemma":[0.9958724,0.001760045,0.0006092765,0.001077797,0.0005027956,0.0001777197],"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.0001976869,0.0003056187,0.0005349888,0.00001985788,0.00002702653,0.00001501366,0.0004843555,0.040418,0.00001469341,0.049735,0.002607793,0.9056399],"study_design_scores_gemma":[0.0005636183,0.000150452,0.0002909185,0.00008178245,0.00002883318,0.000007321994,0.0004246375,0.8761134,0.00008279176,0.1097192,0.01230393,0.000233114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007132225,0.00005406853,0.9877816,0.0002697679,0.0003525482,0.0009060056,0.00001858664,0.00009708144,0.003388047],"genre_scores_gemma":[0.2889507,0.00001858545,0.7094857,0.00002442352,0.0001105456,0.0001265436,0.00001755686,0.00003023191,0.001235755],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9054068,"threshold_uncertainty_score":0.9995842,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1544526981","doi":"10.1007/s101079900111","title":"A non–interior predictor–corrector path following algorithm for the monotone linear complementarity problem","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":90,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Predictor–corrector method; Interior point method; Monotone polygon; Monotonic function; Quadratic growth; Path (computing); Smoothing; Linear complementarity problem; Mathematical optimization; Convergence (economics); Complementarity (molecular biology); Applied mathematics; Algorithm; Nonlinear system; Mathematical analysis; Computer science; Geometry; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.04868698048524479,"gpt":0.3654539087922773,"spread":0.3167669283070325,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001276621,0.000383014,0.0005782642,0.00007482631,0.0005927723,0.000209015,0.0006018306,0.0001245217,0.001281462],"category_scores_gemma":[0.0004772807,0.00027015,0.0003894983,0.0003776315,0.0001668413,0.0002406592,0.0001682297,0.000418915,0.0001071289],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001619221,"about_ca_system_score_gemma":0.00006378335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001849306,"about_ca_topic_score_gemma":0.000007201785,"domain_scores_codex":[0.9968186,0.00007732702,0.0008893271,0.0005246667,0.0007669138,0.0009231594],"domain_scores_gemma":[0.9971061,0.001695305,0.0001607023,0.0006418905,0.0001637768,0.0002322052],"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.00007629034,0.0009511423,0.00008596038,0.0006495397,0.0004267285,0.00002464097,0.002623022,0.0002262124,0.00005086999,0.004367486,0.0009826835,0.9895355],"study_design_scores_gemma":[0.001620414,0.0002747042,0.000007754514,0.0002583215,0.0001637034,0.00002171262,0.0006106462,0.9246994,0.0002506126,0.05691045,0.01478411,0.0003981241],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003397505,0.0000546473,0.9901375,0.0003616452,0.0001111114,0.004967909,0.00004184861,0.0003631265,0.0005647326],"genre_scores_gemma":[0.006687519,0.00001056042,0.9882898,0.00008140346,0.000246909,0.002246091,0.0000345566,0.0001261135,0.002276995],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9891373,"threshold_uncertainty_score":0.9999751,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119673940","doi":"10.1007/s10107-008-0234-9","title":"The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm","year":2008,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":84,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Travelling salesman problem; Pickup; Vertex (graph theory); Mathematics; Branch and cut; Bottleneck traveling salesman problem; Algorithm; Dimension (graph theory); Graph; Polytope; Combinatorics; Integer programming; Mathematical optimization; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01627718973430905,"gpt":0.2294317008849779,"spread":0.2131545111506688,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005366976,0.0001792664,0.0002132627,0.0000320962,0.0003565142,0.0001344615,0.0000700516,0.00007090517,0.000001133842],"category_scores_gemma":[0.00009357618,0.0001227931,0.00001942073,0.0001380096,0.0002500841,0.0001040921,0.00005007014,0.0002030032,0.000001896544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001648879,"about_ca_system_score_gemma":0.00001110298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005981047,"about_ca_topic_score_gemma":0.000005017813,"domain_scores_codex":[0.9989334,0.00004873985,0.0003036447,0.0002154617,0.0001693917,0.0003294124],"domain_scores_gemma":[0.9992664,0.000379609,0.00004299599,0.0001493278,0.00003404936,0.0001276326],"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.00004484157,0.00004345289,0.0005547215,0.0004275445,0.0001088486,0.00003277033,0.007087423,0.001296541,0.0001960608,0.002483635,0.00002383551,0.9877003],"study_design_scores_gemma":[0.001690322,0.0001866066,0.001002973,0.0003216783,0.00007580304,0.0009776293,0.0005298785,0.9901802,0.0004469562,0.003088413,0.001004777,0.0004947645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3560822,0.000829045,0.6408272,0.0003034765,0.00002707712,0.0006277902,0.000003402932,0.0004894725,0.0008103335],"genre_scores_gemma":[0.4095145,0.0001072803,0.5902115,0.00001124631,0.00003290287,0.00002658046,0.000001620118,0.00003552372,0.00005894955],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9888837,"threshold_uncertainty_score":0.5007356,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005509629","doi":"10.1007/s10107-002-0370-6","title":"Approximating disjoint-path problems using packing integer programs","year":2004,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Disjoint sets; Mathematics; Bin packing problem; Combinatorics; Integer (computer science); Path (computing); Approximation algorithm; Packing problems; Vertex (graph theory); Integer programming; Discrete mathematics; Mathematical optimization; Algorithm; Computer science; Bin; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.05865507247347649,"gpt":0.2737072331314133,"spread":0.2150521606579368,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008101675,0.000344285,0.0004293181,0.0001417875,0.0004303191,0.0009362872,0.001012553,0.0001116295,0.00001264274],"category_scores_gemma":[0.0001986574,0.0002912682,0.0002304566,0.0009247177,0.0002191977,0.000752129,0.0006624851,0.0004358251,0.00005707399],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001336682,"about_ca_system_score_gemma":0.0000697381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002992531,"about_ca_topic_score_gemma":0.00000441148,"domain_scores_codex":[0.9970406,0.00005979292,0.0007368347,0.0006489364,0.0006231989,0.0008905872],"domain_scores_gemma":[0.9986075,0.0001013361,0.0002392914,0.0007216014,0.0001048663,0.0002254464],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001552446,0.000633675,0.0001253857,0.0004318662,0.00003690584,0.00003527872,0.003495879,0.0004330224,0.0002560095,0.6153402,0.000002029669,0.3792082],"study_design_scores_gemma":[0.0004969479,0.0001593604,0.000007923297,0.001177838,0.00002141257,0.0002311736,0.0006156147,0.3379313,0.0004482233,0.6577611,0.0005955417,0.0005535701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01337527,0.0001029375,0.9833881,0.000392808,0.0001608065,0.0008411355,4.43202e-7,0.0008422073,0.0008963377],"genre_scores_gemma":[0.3314866,8.05484e-7,0.6682701,0.00005586886,0.00006552057,0.00008125153,0.000002331494,0.00002613095,0.00001141342],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3786546,"threshold_uncertainty_score":0.9999539,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1996676734","doi":"10.1007/s10107-013-0633-4","title":"On solving simple bilevel programs with a nonconvex lower level program","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Mathematical optimization; Bilevel optimization; Limit point; Smoothing; Stationary point; Constraint (computer-aided design); Feasible region; Convex optimization; Sequence (biology); Limit (mathematics); Interior point method; Variational inequality; Optimization problem; Regular polygon; Bounded function; Simple (philosophy); Penalty method; Limit of a sequence","retraction":null,"screen_n_in":null,"score":{"opus":0.03310765846871954,"gpt":0.2614845383108118,"spread":0.2283768798420922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002851333,0.0002631092,0.0003021426,0.0001365081,0.0002207977,0.001041273,0.0005954218,0.00008565806,0.0003626011],"category_scores_gemma":[0.0001306994,0.0001784843,0.0001302486,0.0008609645,0.00008442385,0.0006002779,0.000162495,0.0001876567,0.0007085066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005088078,"about_ca_system_score_gemma":0.00005885368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002371658,"about_ca_topic_score_gemma":0.00000553647,"domain_scores_codex":[0.9978411,0.00004926194,0.0004069745,0.0005136663,0.0006415988,0.0005474121],"domain_scores_gemma":[0.99859,0.0001968811,0.0001510336,0.0005431403,0.000277841,0.000241098],"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.000005617965,0.001566803,0.0001755921,0.00007108576,0.00008406521,0.00001010861,0.0003826213,0.0002080824,0.00001100952,0.2245823,0.0002126095,0.7726901],"study_design_scores_gemma":[0.0005528395,0.001018258,0.0004333242,0.0001413436,0.00004171127,0.00002590241,0.00009207772,0.8769525,0.0000709775,0.1176394,0.00244387,0.0005878147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003644996,0.000005094059,0.9892941,0.00157299,0.00003792857,0.001327959,6.809934e-7,0.0006937358,0.003422485],"genre_scores_gemma":[0.4076272,3.37279e-7,0.5910476,0.0002308602,0.00003157614,0.0006431341,0.000009473716,0.0000198307,0.0003900309],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8767444,"threshold_uncertainty_score":0.9999958,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159874655","doi":"10.1007/s10107-013-0735-z","title":"First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Complementarity (molecular biology); Cone (formal languages); Second-order cone programming; Stationary point; Complementarity theory; Positive-definite matrix; Limiting; Mathematical optimization; Applied mathematics; Semidefinite programming; Mathematical analysis; Algorithm; Regular polygon; Convex optimization; Geometry; Nonlinear system","retraction":null,"screen_n_in":null,"score":{"opus":0.0369526614574933,"gpt":0.2794488674892481,"spread":0.2424962060317548,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004023571,0.0002454861,0.0004035879,0.00008417424,0.0004147176,0.0006979351,0.0004575868,0.00007653503,0.001442813],"category_scores_gemma":[0.0002214694,0.0001861175,0.0001313371,0.0005658781,0.0003279886,0.000516528,0.0001442342,0.0001359776,0.0002964019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005253444,"about_ca_system_score_gemma":0.00006512881,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001875188,"about_ca_topic_score_gemma":0.00001297201,"domain_scores_codex":[0.9979646,0.00005143898,0.0005969612,0.0004500051,0.0004412458,0.0004957818],"domain_scores_gemma":[0.998005,0.0005742438,0.0001888633,0.0004391156,0.0005485935,0.0002442092],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004229765,0.0008972181,0.0003201882,0.0002625781,0.0001628458,0.000002232543,0.0004194857,0.0002507406,0.00001038311,0.9899462,0.0002275102,0.00749632],"study_design_scores_gemma":[0.001042059,0.0002087677,0.0002637989,0.0001263359,0.0001004419,0.00004298867,0.0002684866,0.7677755,0.00002238162,0.228337,0.001408778,0.0004034571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001050038,0.000004421602,0.9908273,0.003892777,0.00002107996,0.001739783,0.00001373743,0.0003006358,0.002150262],"genre_scores_gemma":[0.2175397,4.969851e-7,0.7808929,0.0002581243,0.00002210551,0.001034649,0.0000959617,0.00001572165,0.0001403155],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7675248,"threshold_uncertainty_score":0.99947,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2028549267","doi":"10.1007/s10107-010-0380-8","title":"LP-based approximation algorithms for capacitated facility location","year":2010,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":63,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Facility location problem; Linear programming relaxation; Rounding; Approximation algorithm; 1-center problem; Set (abstract data type); Theory of computation; Mathematics; Linear programming; Relaxation (psychology); Metric space; Mathematical optimization; Metric (unit); Constant (computer programming); Computer science; Algorithm; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0454707412042015,"gpt":0.270299497597183,"spread":0.2248287563929815,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009913419,0.0001847197,0.0001871603,0.0001501988,0.0002375606,0.0002811605,0.0002013842,0.00009183296,0.0003787752],"category_scores_gemma":[0.0008582314,0.0001691289,0.00009837198,0.000453234,0.0000913563,0.0005223898,0.0000427078,0.0001505688,0.0006326085],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002473398,"about_ca_system_score_gemma":0.0000177959,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009099307,"about_ca_topic_score_gemma":0.0001024911,"domain_scores_codex":[0.9985928,0.000007785436,0.0004454778,0.0003259792,0.0002965582,0.0003314116],"domain_scores_gemma":[0.9991186,0.00005217113,0.00009283787,0.0003357103,0.0003753292,0.00002535573],"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.00008474781,0.001649657,0.0006347965,0.007967938,0.00007256751,0.000001342307,0.000313796,0.001621621,0.002060548,0.4037628,0.002274357,0.5795557],"study_design_scores_gemma":[0.0006902567,0.00001765643,0.0003204512,0.00003484175,0.0000678558,3.959555e-7,0.0002868007,0.8938335,0.0003066057,0.03066321,0.07342723,0.0003512314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05792947,0.000005847045,0.9350706,0.001807516,0.0004403268,0.001862323,0.000005459878,0.0005123716,0.002366134],"genre_scores_gemma":[0.9341025,1.300755e-7,0.06402015,0.0004446952,0.0002510019,0.0006794226,0.0002815574,0.00001997716,0.0002005597],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8922119,"threshold_uncertainty_score":0.8131113,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971200627","doi":"10.1007/s10107-003-0484-5","title":"Generalized pattern searches with derivative information","year":2003,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":60,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Iterated function; Polling; Function (biology); Mathematics; Convergence (economics); Mathematical optimization; Derivative (finance); Pattern search; Global Positioning System; Algorithm; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.0657266595787926,"gpt":0.3467628791557739,"spread":0.2810362195769813,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006871289,0.0002213084,0.0003023349,0.0001377848,0.0001799628,0.0001851936,0.0001801757,0.00008317879,0.0005179042],"category_scores_gemma":[0.001982334,0.0001628446,0.0000589482,0.0004656611,0.0001621037,0.0006109377,0.00005694834,0.000265785,0.0001694099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009140364,"about_ca_system_score_gemma":0.00006778796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002157676,"about_ca_topic_score_gemma":0.000002015626,"domain_scores_codex":[0.9979704,0.0001634455,0.0004442249,0.0002006756,0.0006942889,0.0005269893],"domain_scores_gemma":[0.9985056,0.000528342,0.0001440507,0.0003469824,0.0002929737,0.000182051],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005258745,0.0005959594,0.000353567,0.001067922,0.0001780286,0.00003580231,0.005432541,0.0004121399,0.00004204351,0.7731363,0.0003353254,0.2183578],"study_design_scores_gemma":[0.00505612,0.0006384497,0.00004308496,0.0004818107,0.0001048439,0.0002957761,0.005803439,0.06094715,0.009215861,0.8853449,0.03057486,0.001493697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008693698,0.00001098452,0.9841135,0.0001768871,0.00001572356,0.0008946836,0.000002442356,0.0002407065,0.005851415],"genre_scores_gemma":[0.06997479,0.000003440896,0.9291537,0.00008321377,0.00001962883,0.0002730833,0.0000121649,0.00004582504,0.0004341683],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2168641,"threshold_uncertainty_score":0.6640609,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115871049","doi":"10.1007/s10107-002-0365-3","title":"Multiobjective optimization problem with variational inequality constraints","year":2003,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Variational inequality; Mathematical optimization; Inequality; Numerical analysis; Multi-objective optimization; Variational analysis; Applied mathematics; Mathematical economics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01709248525124503,"gpt":0.2509153616108618,"spread":0.2338228763596167,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005964764,0.0001372964,0.0001771637,0.000090919,0.00017383,0.0002491541,0.0001969327,0.00005552267,0.0003177623],"category_scores_gemma":[0.0002993866,0.0001063865,0.0000536718,0.0006519866,0.00007438933,0.0004405679,0.00003676223,0.00009593,0.00004076951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005446086,"about_ca_system_score_gemma":0.0001055616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002495935,"about_ca_topic_score_gemma":0.000001055741,"domain_scores_codex":[0.9985921,0.000141215,0.0003216392,0.0003183226,0.0004068729,0.0002198775],"domain_scores_gemma":[0.9990397,0.0001959044,0.0001478324,0.00022478,0.0002896482,0.0001021029],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002479565,0.0002380727,0.0002000702,0.00002285331,0.00004921115,0.000001897794,0.0004457156,0.06782138,0.000002888811,0.9259078,0.000005526008,0.005302137],"study_design_scores_gemma":[0.0005817955,0.00006208823,0.000134705,0.00002803252,0.00002958965,0.00002842899,0.0000919036,0.9499975,0.00005806883,0.04851205,0.0002376217,0.000238192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005204474,0.000004141299,0.9872732,0.0003752699,0.00001948387,0.0003118255,0.000001265813,0.0001677173,0.01179507],"genre_scores_gemma":[0.1912858,4.335827e-7,0.8084434,0.00009510443,0.00001064507,0.00005978685,0.000009816519,0.000007259654,0.00008776924],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8821762,"threshold_uncertainty_score":0.4338317,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017712277","doi":"10.1007/pl00011408","title":"On the generic properties of convex optimization problems in conic form","year":2001,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":56,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Conic optimization; Conic section; Convex analysis; Regular polygon; Complementarity (molecular biology); Subderivative; Convex optimization; Convex set; Mathematical optimization; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.1177119500563265,"gpt":0.2917388044788278,"spread":0.1740268544225013,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009853044,0.0001664702,0.0003501732,0.0001499917,0.00007232746,0.00005868891,0.0002232158,0.00007761858,0.0002005691],"category_scores_gemma":[0.001945227,0.00009578033,0.00007641705,0.000705777,0.000125668,0.000113337,0.00006156446,0.0001598973,0.00001632959],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004313664,"about_ca_system_score_gemma":0.00003234477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000105684,"about_ca_topic_score_gemma":0.000004596318,"domain_scores_codex":[0.9984435,0.00005296087,0.0006307125,0.0001682899,0.0003540815,0.0003504785],"domain_scores_gemma":[0.9987261,0.0006507523,0.0002010359,0.0002729148,0.000108084,0.00004116938],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004047642,0.0009885181,0.0001149499,0.003070668,0.00005565213,0.000005728771,0.007538083,0.001674468,0.00009496722,0.9766958,0.00006635569,0.009654381],"study_design_scores_gemma":[0.0007703674,0.0003664592,0.000007512295,0.001382346,0.00005050421,0.00003786833,0.003212913,0.08445483,0.00187864,0.906452,0.001000551,0.0003859976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7049628,0.0006428466,0.2806452,0.001597668,0.00007715797,0.002387512,0.000002371821,0.0002008469,0.009483542],"genre_scores_gemma":[0.9850742,0.00002974015,0.01410323,0.0000885087,0.00002421697,0.000227684,0.000001457447,0.00002726714,0.00042369],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2801114,"threshold_uncertainty_score":0.3905809,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2061237693","doi":"10.1007/s10107-005-0649-5","title":"Independent packings in structured graphs","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; Wilfrid Laurier University","funders":"","keywords":"Chordal graph; Combinatorics; Indifference graph; Pathwidth; Mathematics; Cograph; Clique-sum; Split graph; 1-planar graph; Maximal independent set; Modular decomposition; Disjoint sets; Discrete mathematics; Interval graph; Treewidth; Partial k-tree; Graph; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.02153618353391824,"gpt":0.3025726694849464,"spread":0.2810364859510282,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007594596,0.0001605936,0.0002190542,0.0002656396,0.00008007073,0.0002015238,0.0009285206,0.00007999114,0.00005394005],"category_scores_gemma":[0.000214599,0.0001362094,0.00008302814,0.0007752351,0.0001045408,0.0005227067,0.0003497062,0.000363596,0.000121521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007076866,"about_ca_system_score_gemma":0.00002334357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002223022,"about_ca_topic_score_gemma":0.00001629338,"domain_scores_codex":[0.9980272,0.00008056299,0.0003456389,0.0003993621,0.0005350449,0.0006121962],"domain_scores_gemma":[0.9989996,0.000196358,0.00006040961,0.0005454216,0.00004469312,0.0001534984],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004619879,0.0000963061,0.0002490872,0.0000299527,0.000005263128,0.00002057983,0.0007146178,0.00003454784,0.0002588429,0.6618151,0.000007134613,0.3367639],"study_design_scores_gemma":[0.000417987,0.00006516153,0.0004172879,0.0000573342,0.000002175077,0.00004179875,0.00009599166,0.01791756,0.00211476,0.976449,0.002185342,0.0002356597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1210345,0.0001420183,0.8739942,0.000980369,0.00005891974,0.0006693223,4.633225e-7,0.0003854811,0.002734678],"genre_scores_gemma":[0.6980745,0.000001595415,0.3017081,0.00006405286,0.00001927916,0.00004766318,4.586337e-7,0.00001153294,0.00007284326],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5770399,"threshold_uncertainty_score":0.5554457,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068133968","doi":"10.1007/s10107-006-0009-0","title":"Active-constraint variable ordering for faster feasibility of mixed integer linear programs","year":2006,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":56,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; Nortel (Canada)","funders":"","keywords":"Mathematics; Integer (computer science); Integer programming; Variable (mathematics); Constraint (computer-aided design); Linear programming; Mathematical optimization; Numerical analysis; Combinatorics; Discrete mathematics; Applied mathematics; Computer science; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.08992158410743467,"gpt":0.371748535160172,"spread":0.2818269510527374,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001006602,0.0002740508,0.0005788704,0.0001113543,0.0001227527,0.00007034266,0.0002777682,0.0001598488,0.0001757349],"category_scores_gemma":[0.002031428,0.0002335526,0.0001886148,0.0004289681,0.0003126922,0.0002013527,0.0001458963,0.0002630383,0.00001209433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000116992,"about_ca_system_score_gemma":0.00007511998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000742199,"about_ca_topic_score_gemma":0.000006363201,"domain_scores_codex":[0.9974672,0.00007997391,0.0008903231,0.0004313203,0.0004797538,0.0006513847],"domain_scores_gemma":[0.9975967,0.001014704,0.0002665027,0.0004830195,0.0005166691,0.0001223388],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003237754,0.006051296,0.0005668802,0.007083346,0.0002303924,0.0000095991,0.0009911726,0.001277151,0.001978174,0.6930682,0.0001346193,0.2882854],"study_design_scores_gemma":[0.002043607,0.000375162,0.00001700182,0.000468419,0.00009457608,0.00002584555,0.001027749,0.156991,0.006721255,0.8297562,0.001930078,0.0005491379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0134672,0.00001240716,0.9815734,0.00007628508,0.00005071482,0.002704216,0.00001401188,0.0002252254,0.001876536],"genre_scores_gemma":[0.09557659,3.899252e-7,0.9031565,0.000004679875,0.00008118602,0.0004717448,0.0000270677,0.00007016152,0.0006117441],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2877363,"threshold_uncertainty_score":0.9523998,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083246371","doi":"10.1007/s10107-013-0703-7","title":"New approaches to multi-objective optimization","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Matroid; Mathematics; Mathematical optimization; Matching (statistics); Spanning tree; Bipartite graph; Approximation algorithm; Rounding; Combinatorics; Computer science; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.1149013214391176,"gpt":0.2635967916886539,"spread":0.1486954702495363,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001815285,0.0001411834,0.0001690726,0.00009690101,0.000126202,0.0004740547,0.0005880952,0.00005048281,0.0001198565],"category_scores_gemma":[0.000111527,0.0001205149,0.00007050097,0.0005239461,0.00003125459,0.0004388316,0.0003193713,0.0001156022,0.0004457767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002776543,"about_ca_system_score_gemma":0.00002505289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002905111,"about_ca_topic_score_gemma":0.000001650806,"domain_scores_codex":[0.9988368,0.00003393738,0.0002243918,0.0003399907,0.0002308841,0.000333992],"domain_scores_gemma":[0.999185,0.0001041407,0.00004386644,0.0003868657,0.00003409522,0.0002460339],"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":[8.256861e-7,0.000184162,0.0000167615,0.00003468061,0.00001644966,0.000001825938,0.002600784,0.002400974,0.000008788343,0.3470771,0.0001996316,0.647458],"study_design_scores_gemma":[0.0001725707,0.00006731327,0.00006936483,0.00003565731,0.000004470322,0.00001047936,0.0001306835,0.8930049,0.0001879271,0.105657,0.000453249,0.0002064075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002006663,0.00001797225,0.9956871,0.001567013,0.00007340178,0.0006999707,1.587347e-7,0.0003254557,0.001428213],"genre_scores_gemma":[0.02076829,2.650541e-7,0.9785606,0.0001098955,0.00005132093,0.0001295791,9.28056e-7,0.00001080305,0.0003683681],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.890604,"threshold_uncertainty_score":0.5729707,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2559883687","doi":"10.1007/s10107-016-1095-2","title":"A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables","year":2016,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Office of the Secretary of Defense; Air Force Office of Scientific Research; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Semidefinite programming; Bounded function; Quadratically constrained quadratic program; Mathematical optimization; Quadratic growth; Quadratic programming; Hermitian matrix; Rank (graph theory); Feasible region; Second-order cone programming; Trust region; Constraint (computer-aided design); Convex optimization; Regular polygon; Algorithm; Combinatorics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.07666032763318521,"gpt":0.3906559550134406,"spread":0.3139956273802554,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00100253,0.0002860677,0.0005503048,0.000106162,0.0002385087,0.0001494473,0.0002320683,0.0001232981,0.0003863254],"category_scores_gemma":[0.00201505,0.0001715902,0.00008710234,0.0002082617,0.0002778554,0.0002026685,0.0001319893,0.0001367044,0.00002655768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008189345,"about_ca_system_score_gemma":0.00006869569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006897086,"about_ca_topic_score_gemma":0.00001742593,"domain_scores_codex":[0.9977649,0.0001129738,0.0005058868,0.0004686632,0.0004931022,0.0006544621],"domain_scores_gemma":[0.9952734,0.003644354,0.0001731231,0.000404818,0.0002677842,0.0002365563],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002109666,0.0004876335,0.00005055996,0.001322033,0.0001984817,0.00001030193,0.0006970474,0.000008991032,0.001395908,0.4816242,0.0002653472,0.5137285],"study_design_scores_gemma":[0.003343964,0.0004150762,0.000009517919,0.0003695532,0.0001045502,0.00009350951,0.0001631946,0.0747885,0.002111548,0.9091142,0.009032388,0.0004539516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004314515,0.00001336025,0.9955583,0.001050325,0.00002362547,0.001687851,0.0000157689,0.0002633854,0.0009559781],"genre_scores_gemma":[0.01475369,0.000003723262,0.9832174,0.0000595903,0.0001071476,0.0005638541,0.000006024205,0.00009522614,0.001193401],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5132746,"threshold_uncertainty_score":0.6997246,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069154666","doi":"10.1007/s10107-012-0594-z","title":"Improved semidefinite bounding procedure for solving Max-Cut problems to optimality","year":2012,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Bounding overwatch; Semidefinite programming; Mathematics; Embedding; Maximum cut; Quadratic programming; Semidefinite embedding; Quadratic equation; Regularization (linguistics); Relaxation (psychology); Mathematical optimization; Upper and lower bounds; Algorithm; Quadratically constrained quadratic program; Computer science; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.09471068804463127,"gpt":0.3899677218371838,"spread":0.2952570337925525,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002467118,0.0003955696,0.0005901487,0.0001940235,0.0004448335,0.0003001126,0.0004001509,0.0001947262,0.0001387017],"category_scores_gemma":[0.007827175,0.0003509865,0.0001967003,0.0005944418,0.000105838,0.0005654493,0.0003054445,0.0003666904,0.00008647138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002486975,"about_ca_system_score_gemma":0.00007044718,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001919817,"about_ca_topic_score_gemma":0.000003232586,"domain_scores_codex":[0.9963607,0.00005655469,0.000865771,0.0005088685,0.000594804,0.001613357],"domain_scores_gemma":[0.9969068,0.001326149,0.0002328677,0.0005543115,0.0003414631,0.0006384629],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003538223,0.005985353,0.001188678,0.02772163,0.0005726495,0.00001152085,0.02946118,0.001542064,0.01161148,0.7369493,0.003077412,0.1815248],"study_design_scores_gemma":[0.003229363,0.0008467011,0.00003053527,0.00191922,0.0003352988,0.0001859439,0.003938606,0.4026566,0.0119849,0.5407906,0.03118405,0.00289813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00631804,0.00008319323,0.9867674,0.0004846555,0.0001208933,0.004555604,0.00001203982,0.0005449929,0.001113145],"genre_scores_gemma":[0.06719346,0.000002506818,0.9288529,0.00009858086,0.0002708996,0.00212052,0.00001455827,0.0001565471,0.001289995],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4011146,"threshold_uncertainty_score":0.9998942,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2117319367","doi":"10.1007/s10107-011-0497-4","title":"Improved lower bounds and exact algorithm for the capacitated arc routing problem","year":2011,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Arc routing; Column generation; Bounding overwatch; Benchmark (surveying); Mathematical optimization; Mathematics; Undirected graph; Set (abstract data type); Upper and lower bounds; Algorithm; Vehicle routing problem; Arc (geometry); Routing (electronic design automation); Graph; Computer science; Combinatorics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03169759203907864,"gpt":0.258755181753461,"spread":0.2270575897143823,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001041248,0.0001996692,0.000225178,0.00004214807,0.0002036267,0.0001442127,0.0001574415,0.00009683042,0.00003912918],"category_scores_gemma":[0.0002402894,0.0001450125,0.00007243138,0.0001776908,0.0001095546,0.0001194871,0.00004727764,0.0002012792,0.000005421942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003433709,"about_ca_system_score_gemma":0.000009495166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005682898,"about_ca_topic_score_gemma":0.000001113836,"domain_scores_codex":[0.9988196,0.00003613649,0.0003707642,0.000202062,0.0001208647,0.0004505914],"domain_scores_gemma":[0.9990694,0.0004773428,0.00005871189,0.0002299771,0.00006773342,0.00009686197],"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.000008145646,0.00008610311,0.00003990787,0.0003661904,0.0001380671,0.000002744009,0.00412125,0.0003336624,0.0005980683,0.004175756,0.00003243864,0.9900976],"study_design_scores_gemma":[0.0003144723,0.00006856392,0.00001932359,0.00006287597,0.0000607372,0.00001789782,0.0003704442,0.9935008,0.0007465067,0.004120925,0.0005069691,0.000210534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003098756,0.00008970134,0.993977,0.00003469069,0.0001035874,0.0009139939,0.000002712589,0.000547642,0.001231939],"genre_scores_gemma":[0.1426646,0.000003799034,0.8568762,0.00001752977,0.00005506791,0.000226306,0.000002185089,0.0000675741,0.00008679146],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9931671,"threshold_uncertainty_score":0.5913437,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2287259016","doi":"10.1007/s10107-015-0965-3","title":"A family of second-order methods for convex $$\\ell _1$$-regularized optimization","year":2015,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; Google; U.S. Department of Energy; National Science Foundation","keywords":"Orthant; Mathematics; Mathematical optimization; Proximal gradient methods for learning; Regularization (linguistics); Convex function; Regular polygon; Convex optimization; Applied mathematics; Algorithm; Subderivative; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.05664813614882776,"gpt":0.3321507346713604,"spread":0.2755025985225327,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004864702,0.0001443591,0.0003383193,0.00006671895,0.00002312298,0.00003755132,0.0001216095,0.0001080937,0.00002682208],"category_scores_gemma":[0.000251134,0.0001315945,0.00007978652,0.000161266,0.00005559326,0.00007261581,0.00003435705,0.00008359306,0.000003993863],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002438123,"about_ca_system_score_gemma":0.00001715516,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001448769,"about_ca_topic_score_gemma":2.608043e-7,"domain_scores_codex":[0.9991559,0.00004091006,0.0003354658,0.0001330535,0.0001132979,0.0002214155],"domain_scores_gemma":[0.9992425,0.0001902205,0.00005798659,0.0002292745,0.0001929546,0.00008699254],"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.0001908444,0.0007292264,0.00003089514,0.00290144,0.0007167984,0.00001085481,0.004369482,0.1009219,0.1224529,0.0623826,0.006381478,0.6989116],"study_design_scores_gemma":[0.0004729043,0.00008242224,0.000001276259,0.00009739169,0.00004799961,0.000005848278,0.0001424592,0.9262865,0.03639708,0.02960479,0.006676693,0.0001845887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003042338,0.0002078293,0.9926226,0.0000186403,0.0000841925,0.000565552,0.000001515805,0.0005653125,0.002892092],"genre_scores_gemma":[0.05268314,0.000002105634,0.9470481,0.00002198851,0.00003088502,0.00008786208,0.000007566858,0.00004399765,0.0000743063],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8253646,"threshold_uncertainty_score":0.5366267,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3124850851","doi":"10.1007/s10107-002-0328-8","title":"Easy and difficult objective functions for max cut","year":2003,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Orthant; Mathematics; Combinatorics; Maximum cut; Function (biology); Sign (mathematics); Matching (statistics); Key (lock); Boundary (topology); Basis (linear algebra); Discrete mathematics; Graph; Mathematical analysis; Computer science; Statistics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01349676825050008,"gpt":0.2318726012653425,"spread":0.2183758330148425,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001263661,0.0001041539,0.0001267968,0.00003581573,0.00009579308,0.00006871633,0.00003150747,0.00005829044,0.00003627019],"category_scores_gemma":[0.0002968109,0.00009169154,0.0000375473,0.0001348893,0.00003163232,0.00005056886,0.000006320596,0.0000788471,0.00002750262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002026998,"about_ca_system_score_gemma":0.000005806132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.598802e-7,"about_ca_topic_score_gemma":5.992283e-7,"domain_scores_codex":[0.9994524,0.000009904126,0.0001462167,0.0001207715,0.00007323346,0.0001975453],"domain_scores_gemma":[0.9996367,0.0001312465,0.00001359122,0.00008883876,0.00004870909,0.00008097461],"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.00004403631,0.001175914,0.0009857501,0.003510986,0.0008247023,0.00001658925,0.008341586,0.08209219,0.0006334525,0.4151391,0.001676098,0.4855596],"study_design_scores_gemma":[0.001234561,0.0001253694,0.00006024638,0.0001153213,0.0001245477,0.00006894075,0.00218914,0.9599948,0.001478774,0.01606041,0.01793522,0.0006126813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006514114,0.0001360385,0.9873355,0.00002378876,0.0001283554,0.0003574157,0.000002563359,0.0004065566,0.00509564],"genre_scores_gemma":[0.2469595,0.000004957028,0.7518733,0.00001879432,0.00005676493,0.0002496276,0.000008056129,0.00004444879,0.000784574],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8779026,"threshold_uncertainty_score":0.3739072,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2057459863","doi":"10.1007/s10107-008-0254-5","title":"Multi-phase dynamic constraint aggregation for set partitioning type problems","year":2008,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Constraint (computer-aided design); Disjoint sets; Computation; Relaxation (psychology); Set (abstract data type); Computer science; Mathematics; Local consistency; Scheduling (production processes); Algorithm; Constraint satisfaction problem; Probabilistic logic","retraction":null,"screen_n_in":null,"score":{"opus":0.06582903588106113,"gpt":0.3370300050388169,"spread":0.2712009691577557,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004198052,0.0001527086,0.0002067618,0.00006139293,0.0001717538,0.00005153574,0.00008374156,0.00009123457,0.0000468355],"category_scores_gemma":[0.000458814,0.0001538602,0.00006494767,0.0002153738,0.00008929833,0.0001134865,0.00001610004,0.000127441,0.00003889615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006710739,"about_ca_system_score_gemma":0.0000184967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.557235e-7,"about_ca_topic_score_gemma":9.783391e-7,"domain_scores_codex":[0.9989583,0.00003253727,0.0003800118,0.0001720669,0.0001330542,0.0003239997],"domain_scores_gemma":[0.9994086,0.0001872618,0.00005602924,0.0001599303,0.00009455295,0.00009360432],"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.00005043673,0.001183999,0.0004248156,0.004568772,0.0003337069,0.00004468283,0.01211763,0.4520324,0.01479087,0.0112702,0.0003212001,0.5028613],"study_design_scores_gemma":[0.0008281136,0.00006719124,0.0000104173,0.0001213597,0.00002171444,0.00005211833,0.0001013309,0.9958166,0.0007063675,0.001371148,0.0007129631,0.0001906999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04529796,0.00007061542,0.9528617,0.00003700899,0.00009522898,0.0007540706,0.000005852877,0.0007221323,0.0001554753],"genre_scores_gemma":[0.37877,0.000005226801,0.6209518,0.000008289862,0.00002056988,0.000124861,0.00003006415,0.00003748826,0.0000517847],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5437841,"threshold_uncertainty_score":0.6274236,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1936234780","doi":"10.1007/s10107-013-0733-1","title":"Convex optimization for the planted k-disjoint-clique problem","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Disjoint sets; Mathematics; Combinatorics; Clique; Cluster analysis; Partition (number theory); Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01551004089108949,"gpt":0.2234298615200835,"spread":0.207919820628994,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001229197,0.0001264039,0.0001515688,0.00002851823,0.00008684217,0.0001350152,0.0001356073,0.00006918565,0.0001150348],"category_scores_gemma":[0.00005892085,0.00008401171,0.00006072382,0.00008022906,0.00004515296,0.00008918858,0.00002575987,0.0001061517,0.00004180556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001694363,"about_ca_system_score_gemma":0.000004595287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005530804,"about_ca_topic_score_gemma":6.860181e-7,"domain_scores_codex":[0.9993228,0.00001114961,0.000219321,0.0001085039,0.00009413744,0.0002441159],"domain_scores_gemma":[0.9994141,0.0002511254,0.00002996069,0.0001949709,0.00006567619,0.00004415926],"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.00003506379,0.000415037,0.00006082822,0.001993203,0.0006088013,0.00001059385,0.002775693,0.186506,0.008945514,0.1106021,0.04347454,0.6445727],"study_design_scores_gemma":[0.0001108827,0.00003019852,0.000004227613,0.0001117416,0.0000230838,0.00001060729,0.00009063938,0.9740744,0.004170225,0.01785327,0.003385768,0.0001349195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001529104,0.00009547771,0.9937694,0.0002766815,0.00004826107,0.001454211,0.000001059985,0.001063488,0.001762322],"genre_scores_gemma":[0.5135566,0.0000114495,0.4852526,0.00007313133,0.00007419876,0.0008931449,0.000009369924,0.00005110127,0.00007838647],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7875684,"threshold_uncertainty_score":0.3425898,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015024493","doi":"10.1007/s10107-003-0469-4","title":"The integration of an interior-point cutting plane method within a branch-and-price algorithm","year":2004,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Cutting-plane method; Column generation; Branch and bound; Bin packing problem; Algorithm; Interior point method; Mathematics; Bin; Mathematical optimization; Branching (polymer chemistry); Point (geometry); Dual (grammatical number); Plane (geometry); Tree (set theory); Computer science; Integer programming; Geometry; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01704059943685375,"gpt":0.275635538636096,"spread":0.2585949391992423,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007315122,0.0001236921,0.0001728125,0.00004180088,0.00009284289,0.0001202649,0.0001071786,0.00005974937,0.00001028503],"category_scores_gemma":[0.0001417148,0.00008609775,0.00003473627,0.0001455377,0.00005555286,0.0001338257,0.00002823972,0.0001723761,0.000006223951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002783488,"about_ca_system_score_gemma":0.00000847879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007526978,"about_ca_topic_score_gemma":0.000007782868,"domain_scores_codex":[0.9991521,0.00003727309,0.0003763422,0.0001176883,0.0001356857,0.0001809097],"domain_scores_gemma":[0.999515,0.0001512572,0.00006898249,0.0001593739,0.00003746419,0.00006793807],"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.000007816571,0.00005619296,0.000004898748,0.0003657395,0.00005298563,0.000002939484,0.01099408,0.0179323,0.003268261,0.03544141,0.000004366319,0.931869],"study_design_scores_gemma":[0.0004836683,0.0001424102,0.00001105212,0.0004587414,0.00003237633,0.00009300052,0.001338924,0.9308717,0.01923033,0.04673723,0.0003591634,0.0002414514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009144701,0.00008410742,0.9893991,0.00008345889,0.00007808447,0.0002456758,0.00000116866,0.00022511,0.0007386126],"genre_scores_gemma":[0.220061,0.000008423529,0.7798103,0.00001489879,0.00002674175,0.00002679579,0.000004981977,0.00002581825,0.00002096475],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9316276,"threshold_uncertainty_score":0.3510964,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975952334","doi":"10.1007/pl00011384","title":"Conditions ensuring the applicability of cutting-plane methods for solving variational inequalities","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Monotonic function; Cutting-plane method; Variational inequality; Regular polygon; Plane (geometry); Set (abstract data type); Order (exchange); Applied mathematics; Inequality; Variational analysis; Mathematical optimization; Mathematical analysis; Geometry; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.0348545579723836,"gpt":0.348124457870492,"spread":0.3132698998981084,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001928855,0.00009257369,0.00019501,0.00004450179,0.0002578722,0.0001232595,0.000357448,0.00004009492,0.0003621203],"category_scores_gemma":[0.0005474849,0.00006601508,0.0001225792,0.0003053971,0.00006771968,0.0001669651,0.00005583448,0.00006948144,0.00001207386],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001898602,"about_ca_system_score_gemma":0.00003275431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007346613,"about_ca_topic_score_gemma":5.645089e-7,"domain_scores_codex":[0.9988359,0.0001276217,0.0004537886,0.0002023585,0.0002010497,0.0001792421],"domain_scores_gemma":[0.99694,0.002459274,0.0001256081,0.0002859066,0.0001440015,0.00004523187],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002431412,0.000121477,0.00002887394,0.00008338496,0.00004638972,7.002716e-8,0.001006198,0.001647787,0.00008230611,0.8935432,0.00001715732,0.1034208],"study_design_scores_gemma":[0.0001371069,0.00001942303,0.0001438089,0.00001724436,0.00003261305,0.000003893342,0.00009291872,0.7451814,0.0002870728,0.2518659,0.002125059,0.00009360183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004674915,0.00001572034,0.996447,0.001202189,0.00001994153,0.0003325105,0.000006688788,0.00008229799,0.001426119],"genre_scores_gemma":[0.1383611,0.000001032594,0.8611262,0.00008682882,0.00003814956,0.0001661412,0.00001645007,0.000005558256,0.0001985113],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7435336,"threshold_uncertainty_score":0.3964963,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964852627","doi":"10.1007/s10107-012-0626-8","title":"A stabilized structured Dantzig–Wolfe decomposition method","year":2012,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Polyhedron; Column generation; Mathematics; Decomposition; Mathematical optimization; Extreme point; Variable (mathematics); Linear programming; Scheme (mathematics); Decomposition method (queueing theory); Combinatorics; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03506220635162111,"gpt":0.3820592189595333,"spread":0.3469970126079122,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00173066,0.0001984232,0.0002943344,0.0001338912,0.0001955664,0.0002043413,0.0007565245,0.0000833146,0.0001033119],"category_scores_gemma":[0.0003665713,0.0001603557,0.0001223657,0.0005848758,0.00009900724,0.0008634276,0.000394573,0.0002744264,0.0001373765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006843029,"about_ca_system_score_gemma":0.00002278836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001266918,"about_ca_topic_score_gemma":4.902488e-7,"domain_scores_codex":[0.997572,0.0003227567,0.0003559882,0.0003454438,0.0005397126,0.0008640832],"domain_scores_gemma":[0.9981045,0.0006715137,0.00009173057,0.0007082554,0.00008222475,0.0003418206],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001394361,0.0002062782,0.0001204275,0.0000967186,0.00002278858,0.000004664934,0.00130013,0.000007939369,0.004752842,0.7385894,0.00001443315,0.2548704],"study_design_scores_gemma":[0.0006804078,0.0001360111,0.0001978174,0.00006603547,0.00002278662,0.0001723057,0.0002310043,0.03937012,0.01912745,0.9352514,0.004261123,0.0004835258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0104658,0.0001336815,0.9870231,0.0002034086,0.0001058269,0.0005376109,9.205896e-7,0.0003962344,0.001133467],"genre_scores_gemma":[0.3198299,7.423878e-7,0.6799406,0.0000402656,0.00004946748,0.00007791687,0.000001875169,0.00001618317,0.00004305636],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3093641,"threshold_uncertainty_score":0.6539117,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155466993","doi":"10.1007/s101070100256","title":"Matching, matroids, and extensions","year":2002,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Mathematics; Intersection (aeronautics); Matching (statistics); Jump; Path (computing); Mathematical optimization; Matroid partitioning; Combinatorial optimization; Combinatorics; Computer science; Graphic matroid","retraction":null,"screen_n_in":null,"score":{"opus":0.03674678384377213,"gpt":0.2923804867600973,"spread":0.2556337029163252,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003650503,0.0001264199,0.000168523,0.00008926821,0.0002053761,0.0002352398,0.0004503419,0.00004407496,0.0001010121],"category_scores_gemma":[0.0001228512,0.0001029518,0.00004940806,0.0002958639,0.0001437323,0.0003348941,0.0004070876,0.0002014089,0.0003156834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001284763,"about_ca_system_score_gemma":0.00000338283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001106732,"about_ca_topic_score_gemma":4.211711e-7,"domain_scores_codex":[0.9986939,0.00005607458,0.0002007508,0.0003221983,0.0002981989,0.0004288416],"domain_scores_gemma":[0.9989765,0.0002696671,0.00003745674,0.0004862956,0.00003769038,0.0001923873],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[7.140889e-7,0.00008502819,0.00001188428,0.00004678502,0.000006351653,0.00002697506,0.0008254477,0.000001843513,0.0004298041,0.8136287,0.00006297431,0.1848735],"study_design_scores_gemma":[0.0001691976,0.00006488729,0.00002379563,0.00005047045,0.000004400011,0.0001661593,0.0001270064,0.02864275,0.0002185754,0.9678823,0.002469232,0.0001812033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0227023,0.0003877573,0.9718021,0.0009523254,0.00003446501,0.0002730313,3.028896e-7,0.0003807093,0.003466988],"genre_scores_gemma":[0.4663865,0.00001303957,0.5328885,0.00008520607,0.00002065588,0.00003629862,1.925303e-7,0.00001393191,0.0005556981],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4436842,"threshold_uncertainty_score":0.4198254,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3020603765","doi":"10.1007/s10107-020-01500-6","title":"Generalized monotone operators and their averaged resolvents","year":2020,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"","keywords":"Mathematics; Resolvent; Monotonic function; Monotone polygon; Operator (biology); Convergence (economics); Set (abstract data type); Scaling; Class (philosophy); Applied mathematics; Pure mathematics; Discrete mathematics; Mathematical analysis; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02656643460086841,"gpt":0.2442747187091969,"spread":0.2177082841083285,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001688558,0.0001031376,0.0001747764,0.00003240136,0.0001176331,0.0002605262,0.0002439849,0.00003383998,0.00006243225],"category_scores_gemma":[0.0001311722,0.00007500343,0.00005522288,0.0003321348,0.00002285009,0.0001982515,0.0001689457,0.00007329183,0.00004449557],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008604778,"about_ca_system_score_gemma":0.00001258386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001873828,"about_ca_topic_score_gemma":2.04459e-7,"domain_scores_codex":[0.9991925,0.00005257238,0.0002138623,0.0002434653,0.0001484393,0.0001491363],"domain_scores_gemma":[0.9995349,0.00006000394,0.00004524348,0.0001486489,0.00004405985,0.0001671193],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009430123,0.0001838397,0.0002533451,0.00009381996,0.0001199728,0.00000931071,0.006696657,0.000555981,0.0005605022,0.911284,0.000200851,0.08003232],"study_design_scores_gemma":[0.0003169867,0.00003426461,0.000046792,0.0000100238,0.000009326686,0.000003285989,0.00005647278,0.9831577,0.0004811057,0.01315087,0.002597886,0.0001353023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009135985,0.00004456171,0.9853509,0.00477859,0.0000144856,0.0001520975,6.154208e-7,0.0001494219,0.0003733284],"genre_scores_gemma":[0.556264,0.000005811853,0.4424324,0.001157968,0.00003667225,0.00002234461,0.000003500481,0.000008019138,0.0000692015],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9826017,"threshold_uncertainty_score":0.3058551,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W68594018","doi":"10.1007/s101070050009","title":"The global linear convergence of an infeasible non-interior path-following algorithm for complementarity problems with uniform P -functions","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":46,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Iterated function; Mathematics; Smoothing; Path (computing); Mathematical optimization; Complementarity (molecular biology); Algorithm; Linear complementarity problem; Convergence (economics); Mixed complementarity problem; Nonlinear system; Applied mathematics; Computer science; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.04428689343166729,"gpt":0.3637298191637047,"spread":0.3194429257320374,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008909804,0.0002528511,0.0004077509,0.00003783681,0.0005462279,0.0001186672,0.0004120551,0.0000780273,0.0002697441],"category_scores_gemma":[0.0002422233,0.0001700297,0.0001582459,0.0004807645,0.0002750207,0.0003183967,0.00008071088,0.0001950977,0.00002253007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001449319,"about_ca_system_score_gemma":0.0001029396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002667821,"about_ca_topic_score_gemma":0.00006547565,"domain_scores_codex":[0.9976555,0.00006038378,0.000706352,0.0003377683,0.0006139495,0.0006260522],"domain_scores_gemma":[0.9982875,0.0005222515,0.0001815732,0.0005196607,0.0002884002,0.0002006097],"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.0001636304,0.001430596,0.0005161797,0.0008923479,0.0003733293,0.00001304289,0.00120211,0.0007126738,0.00003117745,0.02499614,0.00007272363,0.969596],"study_design_scores_gemma":[0.002083775,0.001164752,0.00002351549,0.0003537182,0.0001415431,0.00004008624,0.001846526,0.8853069,0.0003818872,0.103392,0.004845159,0.0004201388],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0187742,0.00001632749,0.977729,0.0001225641,0.00005263397,0.00244602,0.0000594617,0.0001438172,0.0006559229],"genre_scores_gemma":[0.01656674,0.00000601378,0.9821502,0.00001627559,0.00005022375,0.0005728299,0.00003994712,0.00004870385,0.0005490435],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9691759,"threshold_uncertainty_score":0.693361,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013333510","doi":"10.1007/s10107-014-0812-y","title":"Modified orbital branching for structured symmetry with an application to unit commitment","year":2014,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimal Power Flow Distribution","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; University of Guelph; Group for Research in Decision Analysis","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Branching (polymer chemistry); Integer programming; Symmetry breaking; Symmetry group; Symmetry (geometry); Graph; Combinatorics; Symmetry operation; Symmetry number; Global symmetry; Mathematical optimization; Geometry; Physics; Quantum mechanics; Spontaneous symmetry breaking","retraction":null,"screen_n_in":null,"score":{"opus":0.01238110498595243,"gpt":0.2528350784160875,"spread":0.2404539734301351,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002560449,0.0001786354,0.0002126332,0.00005356304,0.00009162254,0.0001083828,0.0001541357,0.00007156537,0.000005134806],"category_scores_gemma":[0.00006466246,0.0001535724,0.00003847434,0.0001762851,0.00002340149,0.0001317313,0.00002217389,0.0001125179,0.00002240443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006315849,"about_ca_system_score_gemma":0.000004465493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002965529,"about_ca_topic_score_gemma":0.000007120889,"domain_scores_codex":[0.9990301,0.00001669348,0.0002408172,0.0002080668,0.0001766904,0.000327657],"domain_scores_gemma":[0.9993665,0.00008586724,0.00002998002,0.00029757,0.00004902197,0.0001711172],"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.0001963528,0.0004312146,0.000181997,0.001831496,0.0001609072,0.0000021779,0.001283352,0.09807898,0.005695927,0.3427323,0.000119839,0.5492854],"study_design_scores_gemma":[0.0007744454,0.0006320415,0.0002024736,0.00008843092,0.00006286465,0.00001344397,0.0001805269,0.9722167,0.002973866,0.01991276,0.002492572,0.0004498284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2502328,0.00000492216,0.7479963,0.00003728861,0.00003125179,0.0008981272,0.000009424255,0.0003751168,0.0004147576],"genre_scores_gemma":[0.8142982,4.125756e-8,0.1851762,0.00001712097,0.00006233052,0.0003180222,0.00008227917,0.00004088392,0.00000497163],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8741378,"threshold_uncertainty_score":0.6262501,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2765403799","doi":"10.1007/pl00011389","title":"The packing property","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Clutter; Matrix (chemical analysis); Disjoint sets; Incidence matrix; Vertex (graph theory); Set (abstract data type); Matching (statistics); Algorithm; Graph; Computer science; Radar","retraction":null,"screen_n_in":null,"score":{"opus":0.008940437827761731,"gpt":0.1975003397861044,"spread":0.1885599019583426,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003858139,0.0001108757,0.0001161221,0.00001233828,0.0002146548,0.0001471353,0.0001699276,0.00004378407,0.0002744788],"category_scores_gemma":[0.00002680159,0.00005331078,0.00006633321,0.0001239217,0.00007013761,0.00006381506,0.000009707261,0.0001314149,0.0006276844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001318395,"about_ca_system_score_gemma":0.000002520366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.428077e-7,"about_ca_topic_score_gemma":0.000001126668,"domain_scores_codex":[0.9992099,0.00003099045,0.0002151204,0.00009067671,0.000137056,0.0003162781],"domain_scores_gemma":[0.9995801,0.0001081737,0.00001025338,0.0002292713,0.000009909799,0.00006231802],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000004260548,0.00002355968,0.00001785398,0.0001422648,0.00003157627,0.000005580894,0.0005427032,0.0001430346,0.0001209219,0.03166063,0.0003329089,0.9669747],"study_design_scores_gemma":[0.0002549451,0.00005087258,0.00003161365,0.0002344323,0.00002986044,0.00008778555,0.0006346258,0.04483553,0.0008949037,0.08978018,0.8627369,0.0004283765],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.4267485,0.002162031,0.02241668,0.00053878,0.0006264073,0.002088277,0.000002128321,0.004182384,0.5412347],"genre_scores_gemma":[0.996053,0.00001340982,0.001240746,0.00001272395,0.00007546553,0.0001011762,5.947044e-7,0.00002998557,0.002472938],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9665464,"threshold_uncertainty_score":0.8067822,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2578607773","doi":"10.1007/s10107-018-1339-4","title":"Two-stage linear decision rules for multi-stage stochastic programming","year":2018,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":43,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"U.S. Department of Energy; National Science Foundation","keywords":"Mathematics; Upper and lower bounds; Linear programming; Mathematical optimization; Stochastic programming; Value (mathematics); Function (biology); Dual (grammatical number); Affine transformation; Bellman equation; Statistics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1949070732070776,"gpt":0.4531267254404512,"spread":0.2582196522333736,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004306886,0.0003631338,0.0006021295,0.0003574122,0.0006329505,0.0008160684,0.0008457448,0.0001816123,0.0004270502],"category_scores_gemma":[0.009804679,0.0002608237,0.0003114084,0.000835248,0.0004004738,0.0004726491,0.0002434617,0.0002051646,0.001170956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005171845,"about_ca_system_score_gemma":0.00007709503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001223545,"about_ca_topic_score_gemma":0.00003383341,"domain_scores_codex":[0.9953516,0.0001116315,0.001408848,0.0008693312,0.001417144,0.0008414487],"domain_scores_gemma":[0.9952929,0.002191863,0.0004860699,0.0008790137,0.0008034214,0.0003467187],"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.0001402872,0.0004979669,0.0002521865,0.00004758227,0.0000299422,0.000009126706,0.001411415,0.001346285,0.00006015604,0.03078227,0.0002309962,0.9651918],"study_design_scores_gemma":[0.001707063,0.0004658036,0.00005102417,0.0001413452,0.00005635298,0.00001474778,0.001578384,0.8654474,0.0003164706,0.03133289,0.09835755,0.0005309512],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0330415,0.00006924662,0.9638153,0.00009121723,0.0003408419,0.001784783,0.00002403171,0.0002641134,0.0005689372],"genre_scores_gemma":[0.1339036,0.000003329965,0.8616562,0.00006444234,0.0003994255,0.0002519392,0.00002251154,0.00006297665,0.003635504],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9646608,"threshold_uncertainty_score":0.9999844,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980307085","doi":"10.1007/pl00011394","title":"Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Discretization; Relaxation (psychology); Convex hull; Convex optimization; Linear programming relaxation; Quadratic equation; Semidefinite programming; Quadratic programming; Linear programming; Function (biology); Mathematical optimization; Finite set; Feasible region; Applied mathematics; Regular polygon; Combinatorics; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.04527866346224898,"gpt":0.4310191315799686,"spread":0.3857404681177197,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001275001,0.0002443196,0.0004315631,0.0002147162,0.0002067491,0.0001719169,0.0001439408,0.0001922834,0.0006198169],"category_scores_gemma":[0.003792062,0.0002280544,0.00005850524,0.0006731832,0.0001591442,0.0005427057,0.00004053578,0.0001792729,0.0000108034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001283334,"about_ca_system_score_gemma":0.00004276276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004426189,"about_ca_topic_score_gemma":0.000005186428,"domain_scores_codex":[0.9977283,0.000298949,0.0008095205,0.0004461326,0.0002991916,0.0004179083],"domain_scores_gemma":[0.9972407,0.0019075,0.0002220275,0.0002640762,0.0002324934,0.0001332129],"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.0001514629,0.0005962837,0.0002096708,0.001640774,0.00004821021,0.000004364745,0.00411708,0.1618557,0.00004874557,0.1419473,0.00005100796,0.6893294],"study_design_scores_gemma":[0.0008735012,0.00008183561,0.000005934538,0.0001538698,0.00003004526,0.000005769591,0.0003228505,0.8497804,0.0001678283,0.1479558,0.0004001886,0.0002219676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00061406,0.00007542639,0.9958975,0.0003098825,0.00002983838,0.002208631,0.000002953778,0.0001646814,0.0006970746],"genre_scores_gemma":[0.01660599,0.00004938289,0.9819444,0.00005656027,0.00004406195,0.0006155732,0.00008506767,0.00007562329,0.000523357],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6891074,"threshold_uncertainty_score":0.9299787,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994002660","doi":"10.1007/s10107-008-0242-9","title":"Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization","year":2008,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Fleischer; Mathematics; Submodular set function; Algorithm; Function (biology); Minification; Polynomial; Combinatorial algorithms; Time complexity; Extension (predicate logic); Combinatorics; Discrete mathematics; Computer science; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.03894664690511204,"gpt":0.2594211731772316,"spread":0.2204745262721196,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003128197,0.0001671492,0.0002390922,0.00009807357,0.0004104793,0.0001769417,0.0002904962,0.00009153891,0.000007379198],"category_scores_gemma":[0.0001431431,0.0001580261,0.00009448514,0.0002598412,0.0001505968,0.0004574168,0.0001519409,0.0001140528,0.000007768657],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002576577,"about_ca_system_score_gemma":0.00003560077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002320352,"about_ca_topic_score_gemma":4.779352e-7,"domain_scores_codex":[0.9986123,0.00004068682,0.0003298929,0.0003806291,0.0002874231,0.000349096],"domain_scores_gemma":[0.9991979,0.0002092199,0.00009385109,0.0002791088,0.00009225218,0.0001276631],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004997817,0.0004650903,0.00009610211,0.0001618021,0.00005528892,0.00001185633,0.0009612343,0.00002633174,0.00009099994,0.6793762,0.0005701486,0.3181349],"study_design_scores_gemma":[0.00266195,0.001072666,0.0003734803,0.00006208017,0.00005124039,0.0001599884,0.000115836,0.6707599,0.0004015546,0.3065881,0.01716553,0.0005877447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0178906,0.00006852872,0.9802254,0.0003054364,0.0005842748,0.0005553965,0.000002208482,0.0002426736,0.0001254882],"genre_scores_gemma":[0.3561151,0.000005647114,0.6432174,0.00004969195,0.0003821598,0.0001381048,0.00001050147,0.00001954848,0.00006180001],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6707335,"threshold_uncertainty_score":0.6444117,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058753381","doi":"10.1007/s10107-004-0542-7","title":"Capacitated transit assignment with loading priorities","year":2004,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":40,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Queue; Position (finance); Transit (satellite); Variational inequality; Mathematical optimization; Set (abstract data type); Node (physics); Residual; Order (exchange); Preference; Computer science; Mathematics; Operations research; Public transport; Transport engineering; Computer network; Algorithm; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0237641230072467,"gpt":0.2759974946328648,"spread":0.252233371625618,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003052292,0.0000833215,0.0001150382,0.0000404868,0.0003571095,0.0001193722,0.000072622,0.00005457036,0.00006897651],"category_scores_gemma":[0.00004784365,0.00006888019,0.00002993942,0.0002074432,0.0001794268,0.0001664399,0.000001688294,0.00008665244,0.00002533872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007284784,"about_ca_system_score_gemma":0.00007690179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001259136,"about_ca_topic_score_gemma":0.0001664136,"domain_scores_codex":[0.9990647,0.00002934548,0.0001655091,0.0001303947,0.0003488814,0.0002611104],"domain_scores_gemma":[0.9996796,0.00006094149,0.00004307203,0.00006408674,0.00005100099,0.0001012675],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","study_design_scores_codex":[0.00005107402,0.0003731674,0.001700899,0.0002476663,0.0000801209,0.00006907302,0.2205346,0.01210904,0.0001294973,0.7353474,0.00002270605,0.02933481],"study_design_scores_gemma":[0.01657633,0.00267208,0.005809264,0.007519597,0.001219492,0.0001009209,0.4232255,0.004535765,0.007615819,0.4207439,0.1040907,0.005890668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1311398,0.0000399452,0.8476987,0.001566746,0.00005773572,0.0005507605,0.000001916622,0.0005179375,0.01842647],"genre_scores_gemma":[0.9190246,0.00000295079,0.08061386,0.00003308563,0.00003180098,0.0000284649,0.000005626735,0.00001101788,0.0002486259],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7878848,"threshold_uncertainty_score":0.2808853,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144300893","doi":"10.1007/s10107-005-0588-1","title":"The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Heuristic; Scheduling (production processes); Probabilistic logic; Bounded function; Mathematical optimization; Computer science; Mathematics; Algorithm; Competitive analysis; Job shop scheduling; Job scheduler; Upper and lower bounds; Schedule; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01570442300364627,"gpt":0.2486639467360451,"spread":0.2329595237323988,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000404744,0.0001926302,0.0002197043,0.00005072478,0.0002058746,0.00009336144,0.0001992324,0.00006163369,0.00001257436],"category_scores_gemma":[0.00008648592,0.0001231998,0.00005025797,0.0001715937,0.00008007073,0.0001796758,0.00001583858,0.0001727239,0.00001461225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003237929,"about_ca_system_score_gemma":0.00001816364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.413373e-7,"about_ca_topic_score_gemma":0.000002782286,"domain_scores_codex":[0.9988791,0.00001347081,0.0003895392,0.0001632029,0.0002281642,0.0003265428],"domain_scores_gemma":[0.9991892,0.0002474084,0.00007042729,0.0002922557,0.00008987539,0.0001108397],"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.00002108585,0.00009484519,0.000006408137,0.0001080725,0.00003383682,5.067125e-7,0.000145186,0.5826151,0.000005141703,0.001644684,0.000001474571,0.4153236],"study_design_scores_gemma":[0.0006569481,0.0003344283,0.000003593802,0.0001124509,0.00003290534,0.00001045522,0.0001316572,0.9963385,0.001595934,0.0002960995,0.0003132607,0.0001737929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02626855,0.0001346473,0.9723757,0.000144099,0.00004338739,0.0005165811,0.000004945292,0.0002790414,0.0002330425],"genre_scores_gemma":[0.2080164,0.0000196794,0.7915806,0.0000190022,0.0001065734,0.0001019749,0.00002981637,0.00004541964,0.00008051858],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4151498,"threshold_uncertainty_score":0.502394,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1604898370","doi":"10.1007/s10107-003-0407-5","title":"The stable set problem and the lift-and-project ranks of graphs","year":2003,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Subdivision; Vertex (graph theory); Pathwidth; Cograph; Graph; Discrete mathematics; Split graph; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.02837370701248726,"gpt":0.3029111102361365,"spread":0.2745374032236492,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003505943,0.0001281707,0.0002273163,0.00005453334,0.000400437,0.0002805773,0.000544716,0.00004067597,0.0000030457],"category_scores_gemma":[0.0007024857,0.00006173197,0.00006171012,0.0005189456,0.0009736869,0.0001830983,0.000277281,0.0002297214,0.000003206482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007016472,"about_ca_system_score_gemma":0.00003396827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005034708,"about_ca_topic_score_gemma":0.000002210339,"domain_scores_codex":[0.9983006,0.0003662513,0.0003034655,0.0002535963,0.0003606037,0.0004155104],"domain_scores_gemma":[0.997272,0.001973199,0.00009172441,0.0005222991,0.00007370245,0.00006711654],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000157806,0.00002527631,0.00004115987,0.00009477756,0.00002031135,0.000001327155,0.001349998,0.000001272188,0.00002224271,0.9557232,0.00001678832,0.04268787],"study_design_scores_gemma":[0.0005828764,0.00006431322,0.000004666373,0.00003986237,0.000009317929,0.00003539894,0.000478426,0.00487181,0.000320168,0.9896845,0.003820123,0.000088523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01906542,0.003488831,0.9609573,0.001639647,0.00006837236,0.003146059,0.00000180858,0.0001978286,0.01143471],"genre_scores_gemma":[0.6569813,0.0001449154,0.3420606,0.00005533792,0.000009598617,0.0003360072,3.242075e-7,0.0000232891,0.000388628],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6379159,"threshold_uncertainty_score":0.358759,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001944732","doi":"10.1007/pl00011428","title":"Concavity cuts for disjoint bilinear programming","year":2001,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Disjoint sets; Bilinear interpolation; Mathematics; Mathematical optimization; Linear programming; Degenerate energy levels; Optimization problem; Nonlinear programming; Combinatorics; Nonlinear system","retraction":null,"screen_n_in":null,"score":{"opus":0.04709839733559648,"gpt":0.3024123968041444,"spread":0.2553139994685479,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008464135,0.0002495897,0.0003612819,0.00009982859,0.0003531442,0.0005052782,0.0008648384,0.00009540441,0.00002833833],"category_scores_gemma":[0.0003773208,0.0002120832,0.0002627222,0.0005743382,0.0001821734,0.0003782339,0.0003514878,0.0002098573,0.00006772232],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004438559,"about_ca_system_score_gemma":0.00004099591,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006711507,"about_ca_topic_score_gemma":0.000005037024,"domain_scores_codex":[0.997776,0.00004867554,0.0004885723,0.0005559212,0.00038226,0.0007485403],"domain_scores_gemma":[0.9983942,0.0004597155,0.0001195626,0.0006679401,0.0001280671,0.0002305048],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006884758,0.0003801981,0.0001251298,0.000142057,0.00002203584,0.00002001806,0.0004339933,0.000004197506,0.0000372753,0.2981881,0.00008590671,0.7005543],"study_design_scores_gemma":[0.0009956042,0.0004870931,0.00008759776,0.0001853386,0.00003948204,0.0002063179,0.0002027361,0.2951645,0.0005886141,0.4161063,0.2851992,0.0007372833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004875361,0.00007936033,0.9910973,0.001034391,0.000198956,0.001120478,0.000001807976,0.0006898055,0.0009025519],"genre_scores_gemma":[0.1069741,0.000003595394,0.892061,0.0001308927,0.0001725874,0.0003461844,0.000005545884,0.00002426617,0.0002818247],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6998169,"threshold_uncertainty_score":0.8648503,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}