{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":21,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":21,"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":"cb388db2bcac","filters":{"venue":"Mathematical Programming Computation"}},"results":[{"id":"W2080484716","doi":"10.1007/s12532-012-0047-y","title":"The time dependent traveling salesman problem: polyhedra and algorithm","year":2012,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":87,"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":"Travelling salesman problem; Polytope; Bottleneck traveling salesman problem; Polyhedron; Theory of computation; Mathematics; Combinatorics; Generalization; Dimension (graph theory); Heuristics; Traveling purchaser problem; Combinatorial optimization; Algorithm; Computer science; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.01327064375382853,"gpt":0.2620524660477406,"spread":0.248781822293912,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001063575,0.0001402565,0.0001425555,0.0000331321,0.0002134526,0.0001747061,0.0000797638,0.00006638483,0.000006933495],"category_scores_gemma":[0.00007713698,0.0001100297,0.00003093589,0.0001394687,0.00005462104,0.0001473699,0.00003583114,0.000148031,0.00006479768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004204294,"about_ca_system_score_gemma":0.000005508367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.894317e-7,"about_ca_topic_score_gemma":1.594508e-7,"domain_scores_codex":[0.9989232,0.00008266327,0.0003129728,0.0001126399,0.0002082547,0.0003602461],"domain_scores_gemma":[0.9992922,0.0004061742,0.0000479612,0.0001013699,0.00003768688,0.0001146242],"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.000001370772,0.00004126991,0.00006068383,0.0001124173,0.00003254871,8.626291e-7,0.001172606,0.02672487,0.0001554982,0.001561052,0.00002868728,0.9701082],"study_design_scores_gemma":[0.0001500004,0.00001616215,0.0001264611,0.00003598403,0.00002533448,0.00003465897,0.00008278693,0.9935784,0.0001865292,0.005355887,0.0002626256,0.0001451616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01010128,0.0002644177,0.9878296,0.00008346677,0.00008701938,0.00035348,6.307391e-7,0.0004938216,0.0007862769],"genre_scores_gemma":[0.2512236,0.000006191541,0.7485319,0.000009563853,0.00009205664,0.00003174607,0.000006326331,0.00003833262,0.00006031785],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.969963,"threshold_uncertainty_score":0.448688,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2790891482","doi":"10.1007/s12532-018-0147-4","title":"QPLIB: a library of quadratic programming instances","year":2018,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Process Optimization and Integration","field":"Engineering","cited_by":82,"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":"Engineering and Physical Sciences Research Council; Bundesministerium für Bildung und Forschung","keywords":"Undecidable problem; Computer science; Quadratic programming; Variety (cybernetics); Integer programming; Selection (genetic algorithm); Quadratic equation; Combinatorial optimization; Class (philosophy); Set (abstract data type); Theoretical computer science; Mathematical optimization; Mathematics; Algorithm; Programming language; Artificial intelligence; Decidability","retraction":null,"screen_n_in":null,"score":{"opus":0.0133077586837698,"gpt":0.2487562590210415,"spread":0.2354485003372717,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001147142,0.0001394144,0.0001972086,0.0001160962,0.00006307806,0.0001142125,0.0001136649,0.00006950918,0.00007349779],"category_scores_gemma":[0.00007054651,0.0001250551,0.00004816023,0.0004509237,0.0001226254,0.0004723699,0.00001996921,0.00008690259,0.00005569835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000182608,"about_ca_system_score_gemma":0.00002067791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.293564e-7,"about_ca_topic_score_gemma":0.000001215698,"domain_scores_codex":[0.9990153,0.00002178055,0.0004352945,0.0001382372,0.0002008922,0.0001884548],"domain_scores_gemma":[0.9995847,0.00006961613,0.00008381874,0.0001042952,0.00009742647,0.00006014012],"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.00002778656,0.0004005662,0.000181772,0.001919363,0.00008567575,0.000002234254,0.004496833,0.0123768,0.0005723858,0.04742175,0.00102596,0.9314889],"study_design_scores_gemma":[0.00023743,0.0002180728,0.00003278229,0.0002335903,0.00002107265,0.000005401174,0.0002946402,0.973829,0.005335133,0.01682598,0.002767938,0.0001989455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03189544,0.00008938384,0.9592262,0.00005439579,0.0001182054,0.0003731524,0.000001181925,0.0009203388,0.007321731],"genre_scores_gemma":[0.7240819,0.000004467635,0.275712,0.00001503702,0.00006096634,0.00003722402,0.00002149753,0.00002922617,0.00003772806],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9614522,"threshold_uncertainty_score":0.50996,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2033477411","doi":"10.1007/s12532-012-0035-2","title":"A primal–dual regularized interior-point method for convex quadratic programs","year":2012,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":79,"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; University of British Columbia","funders":"","keywords":"Interior point method; Regularization (linguistics); Mathematics; Theory of computation; Quadratic programming; Mathematical optimization; Regular polygon; Rank (graph theory); Linear programming; Applied mathematics; Quadratic equation; Convex optimization; Dual (grammatical number); Algorithm; Computer science; Combinatorics; Artificial intelligence; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.09562827335959624,"gpt":0.4280854122017906,"spread":0.3324571388421944,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002594527,0.0003547596,0.0006601395,0.0001882527,0.0002721062,0.0002410334,0.0002122011,0.0001835067,0.0001010796],"category_scores_gemma":[0.002643682,0.0003134595,0.000227899,0.000461097,0.0001551593,0.0004788875,0.0001501294,0.0002847281,0.00007183749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001962738,"about_ca_system_score_gemma":0.00006338169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001863629,"about_ca_topic_score_gemma":9.289905e-7,"domain_scores_codex":[0.9967003,0.000310319,0.0009704152,0.0004221429,0.0006755339,0.0009212752],"domain_scores_gemma":[0.9968646,0.001620623,0.0003694081,0.0003604587,0.0004530569,0.000331896],"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.0002048951,0.002142065,0.00004797123,0.003050341,0.0002615548,0.000005675303,0.008425599,0.0002644344,0.0006582281,0.358044,0.0004931227,0.6264021],"study_design_scores_gemma":[0.00147139,0.0003241865,0.000005993871,0.0001917892,0.0001100802,0.00007356144,0.0008541739,0.5836284,0.000610851,0.4113083,0.001007793,0.0004134533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002009174,0.00003591812,0.9925333,0.0004090253,0.0001736288,0.003891138,0.000003409795,0.0005866286,0.0003577556],"genre_scores_gemma":[0.04447594,8.329831e-7,0.9534963,0.00005201012,0.0002146022,0.001185344,0.00007797664,0.0001131575,0.0003837745],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6259887,"threshold_uncertainty_score":0.9999318,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2677624263","doi":"10.1007/s12532-019-00172-4","title":"A rotation-based branch-and-price approach for the nurse scheduling problem","year":2019,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":38,"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; Polytechnique Montréal","funders":"Agence Nationale de la Recherche","keywords":"Theory of computation; Nurse scheduling problem; Embedding; Scheduling (production processes); Time horizon; Computer science; Mathematical optimization; Mathematics; Mathematical economics; Job shop scheduling; Algorithm; Artificial intelligence; Schedule; Flow shop scheduling","retraction":null,"screen_n_in":null,"score":{"opus":0.07469503885769585,"gpt":0.3679291525926293,"spread":0.2932341137349334,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003851781,0.0001586173,0.0002736264,0.0001547373,0.0004079153,0.0006601935,0.0003272981,0.00007972008,0.00003170396],"category_scores_gemma":[0.002586626,0.00009954677,0.0001449862,0.0007105147,0.0001161833,0.0001704416,0.00002500046,0.0001657419,0.0001626943],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002758073,"about_ca_system_score_gemma":0.00007676028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004685643,"about_ca_topic_score_gemma":4.405537e-7,"domain_scores_codex":[0.9977126,0.0001200745,0.0006007347,0.0004637601,0.0007703848,0.0003324116],"domain_scores_gemma":[0.9924667,0.006464712,0.0002535549,0.0003237948,0.0003975519,0.00009364764],"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.00006955005,0.0005027994,0.001846114,0.0002843819,0.00007881199,2.95903e-7,0.002353306,0.5921149,0.0001186174,0.08387021,0.0001371901,0.3186238],"study_design_scores_gemma":[0.0005491513,0.00006476489,0.0002981056,0.00003528554,0.00004160931,0.000004281791,0.0007592711,0.9079281,0.00002588293,0.0897793,0.0003883564,0.000125914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03796949,0.0001069283,0.9579964,0.001197266,0.0001086404,0.001616943,0.000002123508,0.0001408391,0.0008613262],"genre_scores_gemma":[0.5531111,1.321097e-7,0.4464511,0.00007646673,0.00003868052,0.0001569257,0.000008814191,0.00001249047,0.0001442791],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5151416,"threshold_uncertainty_score":0.6366261,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2138131169","doi":"10.1007/s12532-013-0052-9","title":"Local cuts for mixed-integer programming","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Cutting-plane method; Integer programming; Travelling salesman problem; Mathematics; Linear programming relaxation; Context (archaeology); Mathematical optimization; Relaxation (psychology); Theory of computation; Space (punctuation); Integer (computer science); Hyperplane; Point (geometry); Plane (geometry); Range (aeronautics); Linear programming; Algorithm; Computer science; Combinatorics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02548378838351857,"gpt":0.3091325737675542,"spread":0.2836487853840356,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005897023,0.0002305857,0.0003263492,0.00009238558,0.0001890703,0.0006548927,0.0004813069,0.00009537105,0.0000145623],"category_scores_gemma":[0.0002519881,0.0001856345,0.0001676983,0.000431875,0.0001128094,0.0005060687,0.0001644851,0.0001617466,0.0002396748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005447877,"about_ca_system_score_gemma":0.00002979789,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000012017,"about_ca_topic_score_gemma":3.276001e-7,"domain_scores_codex":[0.9979713,0.00009957097,0.0004988388,0.0004927666,0.0003640567,0.0005734657],"domain_scores_gemma":[0.9983757,0.0007143529,0.0001489815,0.0002858748,0.0002559784,0.0002191368],"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.000001540677,0.0001906729,0.000004523333,0.0001139705,0.00001514411,0.000001731536,0.0001979607,0.0001611513,0.00002788012,0.06263632,0.0003096269,0.9363395],"study_design_scores_gemma":[0.0002469706,0.0002122143,0.00002947314,0.0000507851,0.00000995716,0.00001619358,0.00008217083,0.7313723,0.0002202682,0.2621396,0.005400869,0.0002191432],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004648862,0.000032576,0.9958323,0.001132006,0.0002766699,0.001439667,4.402967e-7,0.0005761315,0.0002453253],"genre_scores_gemma":[0.1208558,3.157134e-7,0.8782083,0.000122767,0.00007963993,0.0006061547,0.000005802419,0.00002361603,0.00009749244],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9361203,"threshold_uncertainty_score":0.7569954,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976845059","doi":"10.1007/s12532-014-0065-z","title":"An exact cooperative method for the uncapacitated facility location problem","year":2014,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":23,"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":"Subgradient method; Mathematical optimization; Branch and bound; Tabu search; Node (physics); Upper and lower bounds; Computer science; Facility location problem; Dual (grammatical number); Process (computing); Bundle; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03929983688559276,"gpt":0.3069045975542264,"spread":0.2676047606686336,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00215134,0.0001782579,0.0001848285,0.00008821372,0.0004273135,0.0004461721,0.0002130993,0.00005151851,0.00008142195],"category_scores_gemma":[0.0005138177,0.0001274006,0.00006525223,0.0004851324,0.00006887013,0.0006078435,0.00003989174,0.00009142826,0.0002453626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003601509,"about_ca_system_score_gemma":0.00001191508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001480935,"about_ca_topic_score_gemma":0.00006631463,"domain_scores_codex":[0.9986447,0.00006769464,0.0004287751,0.0003325485,0.000276546,0.000249701],"domain_scores_gemma":[0.9987946,0.0002607338,0.000109276,0.000251919,0.0005638156,0.00001971609],"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.00004258835,0.0004224055,0.000054912,0.00105805,0.00005459883,9.754467e-8,0.0006102482,0.1404477,0.00006648048,0.2658931,0.0008807056,0.5904692],"study_design_scores_gemma":[0.0003133784,0.00004549319,0.0002499686,0.00002093602,0.00006531401,2.946532e-7,0.0004844817,0.9317363,0.0000169886,0.04977382,0.01713107,0.0001619877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0032747,0.000007556482,0.9917386,0.001793853,0.0001308948,0.001741799,0.000001649276,0.0003003691,0.001010604],"genre_scores_gemma":[0.886898,3.25448e-7,0.1115589,0.0006084035,0.0001820122,0.0004407262,0.0002114078,0.00001600178,0.0000842369],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8836233,"threshold_uncertainty_score":0.5195246,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400792608","doi":"10.1007/s12532-024-00255-x","title":"PyEPO: a PyTorch-based end-to-end predict-then-optimize library for linear and integer programming","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":22,"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":"","keywords":"Integer programming; End-to-end principle; Computer science; Linear programming; Theory of computation; Integer (computer science); Parallel computing; Algorithm; Artificial intelligence; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02221699247781377,"gpt":0.2937117696713729,"spread":0.2714947771935591,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007274102,0.0003005492,0.0003347059,0.0003556827,0.0002068329,0.001323428,0.0004573341,0.0001338642,0.00001026227],"category_scores_gemma":[0.0002152038,0.0002660294,0.0001402964,0.0007412543,0.000108232,0.0005661843,0.0002534493,0.0002289441,0.00002725725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004428636,"about_ca_system_score_gemma":0.0001240213,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002429248,"about_ca_topic_score_gemma":2.098146e-7,"domain_scores_codex":[0.9977546,0.0000987556,0.0005704798,0.0007286005,0.0003762304,0.000471292],"domain_scores_gemma":[0.9983186,0.0009213412,0.0001011888,0.0003082638,0.0001122777,0.0002383606],"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.00002905004,0.0002451333,0.00001989552,0.0008027559,0.00005882465,0.0000193842,0.001808192,0.02248469,0.00002363088,0.06005704,0.001965043,0.9124864],"study_design_scores_gemma":[0.0002678439,0.0003636533,0.000008849169,0.000464851,0.00002676608,0.00001954621,0.00002136229,0.9650657,0.00034789,0.02223977,0.010874,0.0002997796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007722651,0.0002006024,0.9909075,0.002148175,0.0001927568,0.001504254,0.000006085318,0.004061749,0.0002065549],"genre_scores_gemma":[0.1504163,0.000002420374,0.8487081,0.0002236674,0.0001247394,0.000299893,0.00005134423,0.00005428393,0.0001192693],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.942581,"threshold_uncertainty_score":0.9999792,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2045811671","doi":"10.1007/s12532-014-0067-x","title":"Optimization of algorithms with OPAL","year":2014,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":19,"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":"Theory of computation; Computer science; Algorithm; Parallel computing","retraction":null,"screen_n_in":null,"score":{"opus":0.04018985705435785,"gpt":0.3494476894717266,"spread":0.3092578324173688,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006478122,0.0001809958,0.0003461493,0.0001591429,0.00009714557,0.0000594326,0.0001615439,0.0000789645,0.00006645242],"category_scores_gemma":[0.0008800981,0.0001458668,0.00005574652,0.0005031053,0.0001644935,0.0001821942,0.00005531149,0.0001475497,0.00001453634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004402579,"about_ca_system_score_gemma":0.0000278392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001651959,"about_ca_topic_score_gemma":6.063954e-7,"domain_scores_codex":[0.9981503,0.0001294715,0.0005185714,0.0002696918,0.0006437173,0.0002882237],"domain_scores_gemma":[0.9981276,0.0008285198,0.0002706725,0.0002373549,0.0004274275,0.0001083563],"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.00005784801,0.0006691723,0.00004688703,0.0007329526,0.00006295256,0.000003083702,0.0007462752,0.6457129,0.00002824575,0.1107945,0.00005458594,0.2410906],"study_design_scores_gemma":[0.0006644024,0.0002718766,0.000008000239,0.0001069035,0.00002764881,0.00001586631,0.00009392016,0.8927227,0.000205304,0.1056377,0.00008594315,0.0001598124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001925808,0.000005298952,0.9953927,0.0001037687,0.00002661023,0.0005971025,0.000001253362,0.0002206495,0.001726778],"genre_scores_gemma":[0.09526724,9.690992e-7,0.9044411,0.00001120343,0.00004408633,0.0000497562,0.00002449153,0.00004771376,0.0001134661],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2470098,"threshold_uncertainty_score":0.5948274,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976836184","doi":"10.1007/s12532-014-0076-9","title":"The strength of multi-row models","year":2014,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":15,"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":"Row; Cutting-plane method; Intersection (aeronautics); Theory of computation; Integer programming; Facet (psychology); Mathematics; Integer (computer science); Row and column spaces; Set (abstract data type); Relaxation (psychology); Mathematical optimization; Combinatorics; Algorithm; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03047758135400954,"gpt":0.2884824426648527,"spread":0.2580048613108432,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000716851,0.00009577681,0.0001418907,0.00003367853,0.00008369556,0.00005724465,0.0001145486,0.00004770482,0.000003169683],"category_scores_gemma":[0.0002234519,0.00007294361,0.00004521989,0.0001352178,0.00005565437,0.00006909439,0.00002215925,0.00009429947,0.00001223944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001879988,"about_ca_system_score_gemma":0.000004707099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.235768e-7,"about_ca_topic_score_gemma":5.886224e-7,"domain_scores_codex":[0.999146,0.00008688009,0.0003316546,0.00009164027,0.0001743482,0.0001694579],"domain_scores_gemma":[0.9990571,0.0006247258,0.00006168519,0.0001417388,0.00007248954,0.00004229114],"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.000001000306,0.00002838318,0.000007521944,0.00009906803,0.00001192912,6.603559e-8,0.000278442,0.6579093,0.00004027888,0.01592158,0.00001521596,0.3256872],"study_design_scores_gemma":[0.0001701132,0.00001940253,0.00002055601,0.00002965794,0.00001078084,0.000001406136,0.00004543386,0.9761719,0.0003147736,0.02299393,0.0001459981,0.00007607861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009897942,0.00003616126,0.9885188,0.00003740634,0.00007226304,0.0001840906,3.69268e-7,0.0003228357,0.0009301134],"genre_scores_gemma":[0.5166249,0.000001481367,0.4833145,0.000002820799,0.00001445355,0.00001039185,0.000002154982,0.00001621435,0.00001308025],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.506727,"threshold_uncertainty_score":0.2974554,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3128841739","doi":"10.1007/s12532-020-00200-8","title":"Design and implementation of a modular interior-point solver for linear optimization","year":2021,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":13,"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":"Interior point method; Solver; Computer science; Linear algebra; Linear programming; Benchmark (surveying); Speedup; Modular design; Context (archaeology); Mathematical optimization; Parallel computing; Point (geometry); Theoretical computer science; Algorithm; Mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.068070465368407,"gpt":0.4068720588175621,"spread":0.3388015934491551,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006373938,0.0001429077,0.0002868478,0.0001027543,0.00009520367,0.00006381176,0.0000660572,0.00006997138,0.00006927577],"category_scores_gemma":[0.0007165634,0.0001426143,0.00006240603,0.0002584384,0.00006809116,0.000199023,0.00007491824,0.00007846877,0.000001883155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005319225,"about_ca_system_score_gemma":0.00006669262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.721839e-7,"about_ca_topic_score_gemma":6.462969e-7,"domain_scores_codex":[0.9985201,0.0001203178,0.0005719034,0.00027342,0.0002913843,0.0002228494],"domain_scores_gemma":[0.9980971,0.0008352595,0.0002191014,0.0001477892,0.0006287973,0.00007195908],"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.0001168785,0.0005810289,0.00002442976,0.003249957,0.0002124635,0.00001016224,0.005234756,0.6769036,0.002496557,0.05001707,0.0001395333,0.2610135],"study_design_scores_gemma":[0.0008218889,0.0001428874,0.000002786638,0.00007918165,0.00004183874,0.0000138027,0.0007141383,0.8761483,0.006599347,0.1152935,0.00002101746,0.0001212779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003050319,0.00003093372,0.9952024,0.0001993766,0.00003121386,0.001376966,0.000003822777,0.00008748785,0.00001751794],"genre_scores_gemma":[0.03231473,0.000007929542,0.9673293,0.00001629158,0.00002478287,0.0001705349,0.00005741192,0.00003983568,0.0000392109],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2608923,"threshold_uncertainty_score":0.5815641,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1678874697","doi":"10.1007/s12532-018-0145-6","title":"Enumeration of 2-level polytopes","year":2018,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"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":"Polytope; Enumeration; Facet (psychology); Combinatorics; Hyperplane; Mathematics; Dimension (graph theory); Polytope model; Regular polygon; Convex polytope; Polyhedral combinatorics; Birkhoff polytope; Discrete mathematics; Convex set; Convex optimization; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.05674897302707881,"gpt":0.3476662067615719,"spread":0.2909172337344931,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005327046,0.00009549752,0.00015235,0.0001352591,0.0001129002,0.00009680404,0.0003770568,0.00004223841,0.00001521789],"category_scores_gemma":[0.0002300383,0.00008484123,0.00004904884,0.0005233992,0.0001991463,0.0003593815,0.0001402623,0.00007906411,0.000110953],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002076123,"about_ca_system_score_gemma":0.00002968922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000211012,"about_ca_topic_score_gemma":9.208975e-7,"domain_scores_codex":[0.9987702,0.00008672828,0.0003074382,0.0002323673,0.0003766143,0.0002266192],"domain_scores_gemma":[0.9990407,0.0002404208,0.0001122859,0.0002619977,0.0002783695,0.00006621446],"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.000007079727,0.0001163112,0.00003585035,0.00005663419,0.00001070036,0.000001226745,0.0009210332,0.00005178278,0.001338515,0.5302108,0.00002971869,0.4672204],"study_design_scores_gemma":[0.0002351145,0.0003302898,0.0002793052,0.00005218019,0.000004755666,0.00001293888,0.00004247078,0.2889409,0.01368481,0.6960236,0.0002584142,0.0001352407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01574677,0.00001527377,0.9824948,0.0002134754,0.00006774025,0.0002566386,5.760738e-7,0.0001501199,0.001054559],"genre_scores_gemma":[0.5573875,2.320967e-7,0.4425058,0.00001634116,0.00003114045,0.00001026874,0.000001668542,0.000005378676,0.00004169272],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5416407,"threshold_uncertainty_score":0.3459725,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4387845108","doi":"10.1007/s12532-023-00248-2","title":"Domain-Driven Solver (DDS) Version 2.1: a MATLAB-based software package for convex optimization problems in domain-driven form","year":2023,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":10,"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":"Solver; Second-order cone programming; Mathematical optimization; Mathematics; Linear programming; Convex optimization; Semidefinite programming; Computer science; Applied mathematics; Quadratic programming; Algorithm; Regular polygon","retraction":null,"screen_n_in":null,"score":{"opus":0.05031470689977383,"gpt":0.3484830661823973,"spread":0.2981683592826235,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001083586,0.0004022188,0.0006159082,0.0006337785,0.0003262476,0.0002242397,0.000344881,0.0002805266,0.0001035672],"category_scores_gemma":[0.0010392,0.0003927878,0.0002012688,0.001477794,0.0001686373,0.0003903274,0.0001657148,0.0003225438,0.0001701963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004053535,"about_ca_system_score_gemma":0.0001257977,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002281347,"about_ca_topic_score_gemma":0.000007037403,"domain_scores_codex":[0.9963643,0.0001673163,0.0009976863,0.0006587203,0.0009253583,0.0008866395],"domain_scores_gemma":[0.9964206,0.002088941,0.0003710958,0.000400147,0.0005101459,0.000209065],"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.0001302281,0.0008400594,0.0003004708,0.003084076,0.00006751094,0.00002812482,0.003200843,0.9676204,0.0001020239,0.01291825,0.001259949,0.01044808],"study_design_scores_gemma":[0.002835359,0.0002008581,0.00001882595,0.0003693626,0.00002551022,0.000004749478,0.0004317152,0.7645928,0.00007880302,0.2305379,0.0005502759,0.0003538342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008066807,0.000007823443,0.9858714,0.0005095426,0.0001101425,0.004325085,0.00002737581,0.0009514603,0.0001303769],"genre_scores_gemma":[0.01824838,0.000004564092,0.979584,0.00005217754,0.00006336174,0.0009966979,0.0007244619,0.0001575673,0.000168744],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2176197,"threshold_uncertainty_score":0.9998524,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111997007","doi":"10.1007/s12532-012-0050-3","title":"Trajectory-following methods for large-scale degenerate convex quadratic programming","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":7,"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":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Mathematical optimization; Degenerate energy levels; Mathematics; Complementarity (molecular biology); Quadratic programming; Regular polygon; Complementarity theory; Degeneracy (biology); Convex optimization; Quadratic growth; Convergence (economics); Applied mathematics; Computer science; Algorithm; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.06588397214478896,"gpt":0.4300520505632912,"spread":0.3641680784185022,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002109003,0.000403283,0.0007059093,0.0002256745,0.0004710189,0.0005090873,0.0003041766,0.0002013346,0.0001235888],"category_scores_gemma":[0.00236474,0.0003668642,0.0003319917,0.0006265629,0.00008807512,0.0005038466,0.0001084984,0.000310884,0.0001222252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000157889,"about_ca_system_score_gemma":0.00007757299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003614056,"about_ca_topic_score_gemma":0.000002384417,"domain_scores_codex":[0.9964116,0.000394326,0.001036196,0.0006154565,0.0005536961,0.0009887178],"domain_scores_gemma":[0.9962233,0.002264732,0.0003148064,0.0003696622,0.0005270584,0.0003004747],"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.00002798628,0.001454616,0.00006428789,0.002001228,0.0002679926,0.000006098116,0.004978357,0.002521791,0.0008781272,0.03916806,0.0005582945,0.9480731],"study_design_scores_gemma":[0.001043667,0.0001623665,0.000008739647,0.000115789,0.00008383405,0.000009928768,0.001042516,0.7603317,0.0006873612,0.234953,0.001159957,0.0004010225],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006828111,0.00007816758,0.9869622,0.000278872,0.0001956681,0.004773234,0.000002916485,0.0006724117,0.0002084103],"genre_scores_gemma":[0.02870823,0.000001290037,0.9681252,0.00005763853,0.0001184353,0.002290406,0.00006208887,0.0001395488,0.0004971173],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9476721,"threshold_uncertainty_score":0.9998783,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4396927647","doi":"10.1007/s12532-024-00253-z","title":"Progressively strengthening and tuning MIP solvers for reoptimization","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":6,"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":"Computer science; Parallel computing; Theory of computation; Operations management; Operations research; Mathematical optimization; Mathematics; Algorithm; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.03303405857604129,"gpt":0.3292207379324631,"spread":0.2961866793564218,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000820865,0.000153798,0.0001801534,0.0002274572,0.0002053253,0.001293726,0.0002245459,0.00006621142,0.000007457251],"category_scores_gemma":[0.0005559293,0.0001387218,0.00005573603,0.0005189631,0.00007559974,0.0005088676,0.0001306798,0.0001351616,0.00001572802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004667383,"about_ca_system_score_gemma":0.00006778147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.234061e-7,"about_ca_topic_score_gemma":1.006814e-7,"domain_scores_codex":[0.9984037,0.00007420351,0.0003698666,0.0004596783,0.0003797253,0.0003127889],"domain_scores_gemma":[0.9985914,0.0008575394,0.00007687893,0.000155927,0.0001956922,0.0001225676],"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.000004567558,0.00005933332,0.000006517638,0.0006427824,0.00003959108,0.00001082259,0.001668605,0.008392298,0.0000321599,0.1428087,0.0001559427,0.8461787],"study_design_scores_gemma":[0.0002068883,0.0001052775,0.000006416414,0.0001839466,0.00001697534,0.00002073063,0.00005643896,0.9673411,0.00005780472,0.03088472,0.0009728216,0.0001468719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003724827,0.0002003618,0.9968648,0.0007507458,0.0001500722,0.0008105586,0.000001057538,0.0006039552,0.0002459629],"genre_scores_gemma":[0.08276449,0.000005599068,0.9168085,0.00001899505,0.00005573291,0.0001449555,0.00002091823,0.00002391323,0.0001568791],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9589488,"threshold_uncertainty_score":0.999743,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4286984759","doi":"10.1007/s12532-024-00274-8","title":"LinA: a faster approach to piecewise linear approximations using corridors and its application to mixed-integer optimization","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":6,"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":"Integer (computer science); Piecewise linear function; Mathematical optimization; Integer programming; Piecewise; Mathematics; Approximations of π; Applied mathematics; Computer science; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.05488586377177668,"gpt":0.3800281116634619,"spread":0.3251422478916852,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006735156,0.0003074636,0.0004254258,0.0005955923,0.0003190587,0.0001980961,0.000227336,0.0001555438,0.000009401065],"category_scores_gemma":[0.00156257,0.0003045372,0.00006679402,0.00163991,0.00005607799,0.0002777042,0.0002570783,0.0002374136,0.00004641443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002095459,"about_ca_system_score_gemma":0.00006741726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002488119,"about_ca_topic_score_gemma":9.658866e-7,"domain_scores_codex":[0.9975249,0.0001356501,0.0007550225,0.0006369376,0.000503378,0.0004441436],"domain_scores_gemma":[0.9981109,0.0004787775,0.0001687765,0.0003206724,0.0006517854,0.0002691201],"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.00002927191,0.0004862598,0.000007649037,0.0006065337,0.00003568157,6.034261e-7,0.0009887944,0.9281734,0.00008295415,0.04310899,0.00009231608,0.02638751],"study_design_scores_gemma":[0.0004067062,0.00005796722,0.000005173865,0.0001808991,0.00005902003,0.000009903776,0.0004150178,0.9739695,0.0001763625,0.02427388,0.0001770044,0.0002685936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003473335,0.0000225562,0.990921,0.0004830986,0.0000722557,0.003745244,0.000006151845,0.0003533251,0.0009230258],"genre_scores_gemma":[0.07382511,0.000001501112,0.9249133,0.000137123,0.00005385571,0.000610223,0.00004926166,0.00006113832,0.0003484516],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.07035178,"threshold_uncertainty_score":0.9999407,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3215819884","doi":"10.1007/s12532-024-00254-y","title":"Nonlinear conjugate gradient for smooth convex functions","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"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":"Nonlinear system; Nonlinear conjugate gradient method; Mathematics; Conjugate; Regular polygon; Mathematical analysis; Computer science; Physics; Geometry; Gradient descent; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.07001615077258662,"gpt":0.3931760246580674,"spread":0.3231598738854808,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006417985,0.0002119131,0.0002974388,0.0002008997,0.0002133918,0.0003183533,0.0001301804,0.00009682833,0.0001007787],"category_scores_gemma":[0.0009061849,0.0001864851,0.0001593347,0.000468525,0.000129342,0.0002031522,0.00005511742,0.0002202916,0.0002248885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001228229,"about_ca_system_score_gemma":0.00007065851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.702965e-7,"about_ca_topic_score_gemma":0.000001091581,"domain_scores_codex":[0.998161,0.00005755125,0.0005400235,0.0004070894,0.0004149086,0.0004194345],"domain_scores_gemma":[0.9975067,0.001778326,0.00007849342,0.0001974023,0.000289445,0.0001496778],"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.0000616136,0.0009893629,0.000005732868,0.004311553,0.0002491753,0.00002959299,0.001923704,0.004806417,0.0001129262,0.492443,0.005742484,0.4893244],"study_design_scores_gemma":[0.0002898162,0.0001359458,7.538422e-7,0.0001316438,0.00004708031,0.00001384399,0.0001463718,0.6659167,0.00008046546,0.318826,0.01425431,0.0001569877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001435247,0.00009150671,0.9942684,0.0006990337,0.0002962852,0.00161901,0.00002325698,0.000898373,0.0006689093],"genre_scores_gemma":[0.02709973,0.000003826726,0.9702567,0.00003726598,0.0002095581,0.0004967949,0.0001267466,0.00009782566,0.001671551],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6611103,"threshold_uncertainty_score":0.7604642,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2910526083","doi":"10.1007/s12532-020-00180-9","title":"Split cuts from sparse disjunctions","year":2020,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":3,"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":"Exploit; Theory of computation; Simplex; Integer (computer science); Mathematics; Class (philosophy); Algorithm; Computer science; Mathematical optimization; Cutting-plane method; Integer programming; Combinatorics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03308505023616477,"gpt":0.2367454607671191,"spread":0.2036604105309543,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005098523,0.0001171546,0.0001413752,0.00002777467,0.000056499,0.0001154824,0.00006860789,0.00005352976,0.0001770616],"category_scores_gemma":[0.00005231305,0.0001159828,0.00004659074,0.0002197498,0.00002370112,0.00009762894,0.0000184178,0.0001171162,0.0005538582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001958663,"about_ca_system_score_gemma":0.000005535278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001995367,"about_ca_topic_score_gemma":8.892522e-7,"domain_scores_codex":[0.9993007,0.00001686021,0.000239117,0.0001444246,0.0001451907,0.0001536945],"domain_scores_gemma":[0.9996561,0.00008243022,0.00002758042,0.00007701149,0.00003017075,0.0001266979],"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.000009334015,0.0001206785,0.000241502,0.0003907438,0.00009451109,0.000007162207,0.003996484,0.841768,0.0001892912,0.01267334,0.004758365,0.1357506],"study_design_scores_gemma":[0.0001886991,0.00002504104,0.00009269689,0.00003404372,0.00002267905,0.000001323591,0.00005445337,0.9844247,0.00006480724,0.008635174,0.00631284,0.0001436047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009291808,0.00002615991,0.9849083,0.0005575264,0.0001292935,0.0002310803,0.000004427606,0.001111434,0.003739995],"genre_scores_gemma":[0.770285,0.000002789394,0.2292413,0.0001530226,0.000122261,0.00002352961,0.0000945291,0.00003677545,0.00004082507],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7609932,"threshold_uncertainty_score":0.7118911,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4399389097","doi":"10.1007/s12532-024-00256-w","title":"The MIP Workshop 2023 Computational Competition on reoptimization","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Benchmark (surveying); Theory of computation; Competition (biology); Computer science; Integer programming; Integer (computer science); Linear programming; Mathematical optimization; Operations research; Algorithm; Mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.1145559480526452,"gpt":0.4124956066924428,"spread":0.2979396586397977,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003815879,0.0001779471,0.0002050539,0.0002864856,0.0008169955,0.002353489,0.0003415766,0.00009284249,0.0001045125],"category_scores_gemma":[0.003847372,0.0001130351,0.0001725506,0.00156432,0.0001936804,0.0002330592,0.00005976274,0.0002975867,0.002839154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008489951,"about_ca_system_score_gemma":0.00008144041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002362467,"about_ca_topic_score_gemma":0.00000334524,"domain_scores_codex":[0.9966004,0.0002818631,0.0007847264,0.0004963106,0.001494602,0.0003420207],"domain_scores_gemma":[0.9885874,0.01049971,0.0001416866,0.000290473,0.0003701155,0.0001105559],"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.00001632019,0.0001062514,0.000009547225,0.00002028755,0.00003258551,0.000005198813,0.0003328224,0.3528131,0.000002596851,0.4088742,0.004193039,0.2335941],"study_design_scores_gemma":[0.000080779,0.00003980362,0.00007896649,0.00009588605,0.00001515925,0.00001097629,0.0001796446,0.590021,0.000003293381,0.4035251,0.005863115,0.00008630675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004598975,0.0002217033,0.983202,0.007224213,0.0007897646,0.0003799492,0.000004738773,0.0004261454,0.003152497],"genre_scores_gemma":[0.8935397,0.000004328403,0.1041067,0.0001195288,0.000234062,0.00006301166,0.00006818146,0.00002683909,0.001837672],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8889408,"threshold_uncertainty_score":0.9986821,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4406597533","doi":"10.1007/s12532-024-00266-8","title":"On the B-differential of the componentwise minimum of two affine vector functions","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Mathematics; Hyperplane; Affine transformation; Matroid; Discrete mathematics; Reachability; Affine space; Applied mathematics; Combinatorics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01875176774441866,"gpt":0.2757400987812019,"spread":0.2569883310367832,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003128322,0.0001128983,0.0001747131,0.0001157119,0.000174056,0.00006572773,0.000429429,0.00003360134,0.00001715971],"category_scores_gemma":[0.0002220118,0.00006807509,0.000131234,0.0008384121,0.0001061387,0.00007252956,0.0001671273,0.0001148739,0.00001000685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002641242,"about_ca_system_score_gemma":0.00006036211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003846805,"about_ca_topic_score_gemma":0.000001677885,"domain_scores_codex":[0.9987387,0.0001524008,0.0004184547,0.0001909028,0.000369362,0.0001301751],"domain_scores_gemma":[0.9982643,0.001017416,0.0001985832,0.0003166205,0.0001788689,0.00002427441],"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.00001459615,0.0004778632,0.00002758045,0.0001030019,0.00004939103,2.156824e-7,0.0003192105,0.01493505,0.003616073,0.9313906,0.0005743192,0.04849212],"study_design_scores_gemma":[0.0005404862,0.0001143474,0.001440926,0.0001778504,0.00004335517,0.000002820378,0.00003492391,0.7804369,0.007710994,0.2091863,0.0002113888,0.00009967195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1964882,0.00001469941,0.8004023,0.001759333,0.0003486224,0.000390655,0.000001548588,0.000042131,0.000552548],"genre_scores_gemma":[0.9808899,2.203315e-7,0.01879379,0.00007573121,0.00002978825,0.00002885059,0.000006430027,0.000004238824,0.0001710716],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7844017,"threshold_uncertainty_score":0.2776022,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4403238270","doi":"10.1007/s12532-024-00262-y","title":"Local elimination in the traveling salesman problem","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Rheinische Friedrich-Wilhelms-Universität Bonn; Deutsche Forschungsgemeinschaft","keywords":"Travelling salesman problem; Theory of computation; Mathematical optimization; Computer science; Mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02071651806296831,"gpt":0.2932313392360823,"spread":0.272514821173114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001184483,0.0001228032,0.0001192763,0.0001071909,0.00005018604,0.0003321679,0.0001090606,0.00007033758,0.000006590903],"category_scores_gemma":[0.00005639661,0.00009651205,0.00004383359,0.0005569336,0.00003920152,0.0001924101,0.00001156708,0.0002374422,0.00004733158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008132537,"about_ca_system_score_gemma":0.00001138317,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001198357,"about_ca_topic_score_gemma":0.000001438659,"domain_scores_codex":[0.9989378,0.0001057592,0.0003505385,0.0001563332,0.0002417119,0.0002078724],"domain_scores_gemma":[0.9993854,0.0004541098,0.00001766173,0.00008761892,0.00002776325,0.00002751868],"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":[8.663873e-7,0.00002917499,0.000005201965,0.0005202824,0.000008290336,0.000008798793,0.003109994,0.4972065,0.00003576117,0.02255349,0.00003416882,0.4764875],"study_design_scores_gemma":[0.00008373784,0.0000201266,0.00009246627,0.0002014031,0.00001461039,0.00002428154,0.0003635208,0.9757786,0.00006880039,0.02299553,0.0002477604,0.0001090999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008115669,0.0001151553,0.9887057,0.0003151612,0.00009092921,0.0004058605,3.821202e-7,0.000690215,0.001560949],"genre_scores_gemma":[0.6905298,0.000001925215,0.3093243,0.00001348405,0.00003303849,0.000049711,0.0000117406,0.00002505197,0.0000108707],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6824142,"threshold_uncertainty_score":0.3935647,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1907633005","doi":"10.1007/s12532-015-0091-5","title":"Communication protocols for options and results in a distributed optimization environment","year":2015,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Solver; Computer science; Theory of computation; Generator (circuit theory); Software; Representation (politics); Integer programming; Mathematical optimization; Nonlinear programming; Theoretical computer science; Distributed computing; Parallel computing; Nonlinear system; Programming language; Algorithm; Mathematics; Power (physics)","retraction":null,"screen_n_in":null,"score":{"opus":0.06033538304376564,"gpt":0.320157506209477,"spread":0.2598221231657114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001374377,0.000124707,0.0001868449,0.00007980022,0.0001016237,0.0003123907,0.0002752486,0.00006776048,3.380628e-7],"category_scores_gemma":[0.0003073005,0.0001205086,0.00003064435,0.0002460959,0.00004573438,0.0002523091,0.0001363861,0.00008282321,0.000007361544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009640145,"about_ca_system_score_gemma":0.00003566142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006215998,"about_ca_topic_score_gemma":9.374796e-7,"domain_scores_codex":[0.9985471,0.0001522101,0.0005772483,0.0002952501,0.0002168175,0.00021141],"domain_scores_gemma":[0.9990045,0.0002902796,0.000207241,0.0002922645,0.00009632949,0.0001093454],"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.00004369671,0.0004762619,0.00005808187,0.0001355609,0.00001378844,0.000001678859,0.002261743,0.9005988,0.0000032125,0.05913436,0.0003438462,0.036929],"study_design_scores_gemma":[0.001314137,0.0001511968,0.00007819395,0.0001185951,0.000004618321,0.000009859418,0.0000711651,0.9618961,0.000004460778,0.03406865,0.002151301,0.0001317458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004934177,0.00003488767,0.9925005,0.0008308348,0.00002306759,0.00581688,0.00001042282,0.0001684822,0.0001214424],"genre_scores_gemma":[0.2756293,0.000001058533,0.7217579,0.00001187787,0.00001467653,0.002326746,0.000238183,0.000007800091,0.00001249343],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2751358,"threshold_uncertainty_score":0.4914198,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}