{"meta":{"query_hash":"cb388db2bcac","filters":{"venue":"Mathematical Programming Computation"},"cohort_total":21,"direct_labels_cover":0,"predictions_cover":21,"exported":21,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/cb388db2bcac","api":"https://metacan.xera.ac/api/v1/cohort?venue=Mathematical+Programming+Computation"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.056748973027078806,"score_gpt":0.34766620676157195,"score_spread":0.29091723373449313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1678874697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015746774,0.000015273768,0.98249483,0.00021347536,0.00006774025,0.0002566386,5.7607383e-7,0.00015011986,0.0010545595],"genre_scores_gemma":[0.5573875,2.320967e-7,0.4425058,0.000016341164,0.000031140447,0.000010268744,0.0000016685425,0.000005378676,0.00004169272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877024,0.00008672828,0.00030743817,0.0002323673,0.00037661428,0.00022661916],"domain_scores_gemma":[0.9990407,0.00024042084,0.00011228588,0.00026199766,0.0002783695,0.00006621446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005327046,0.00009549752,0.00015234997,0.00013525915,0.00011290022,0.00009680404,0.0003770568,0.000042238415,0.000015217886],"category_scores_gemma":[0.00023003833,0.00008484123,0.00004904884,0.0005233992,0.00019914632,0.0003593815,0.00014026229,0.000079064106,0.000110953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070797273,0.0001163112,0.000035850346,0.000056634188,0.000010700361,0.0000012267453,0.0009210332,0.00005178278,0.0013385148,0.5302108,0.000029718687,0.46722037],"study_design_scores_gemma":[0.00023511446,0.00033028983,0.0002793052,0.000052180192,0.0000047556664,0.000012938883,0.000042470783,0.28894088,0.013684813,0.6960236,0.00025841416,0.00013524074],"about_ca_topic_score_codex":0.0000021101196,"about_ca_topic_score_gemma":9.2089755e-7,"teacher_disagreement_score":0.5416407,"about_ca_system_score_codex":0.000020761232,"about_ca_system_score_gemma":0.000029689223,"threshold_uncertainty_score":0.34597248},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.060335383043765636,"score_gpt":0.320157506209477,"score_spread":0.2598221231657114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1907633005","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004934177,0.00003488767,0.99250054,0.0008308348,0.000023067592,0.0058168797,0.000010422819,0.00016848216,0.00012144236],"genre_scores_gemma":[0.27562925,0.0000010585335,0.7217579,0.000011877868,0.000014676526,0.0023267455,0.00023818295,0.000007800091,0.000012493427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985471,0.00015221014,0.00057724834,0.0002952501,0.00021681753,0.00021141],"domain_scores_gemma":[0.99900454,0.0002902796,0.00020724101,0.0002922645,0.00009632949,0.00010934541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013743772,0.00012470703,0.00018684486,0.00007980022,0.00010162374,0.00031239068,0.0002752486,0.00006776048,3.3806285e-7],"category_scores_gemma":[0.00030730048,0.0001205086,0.00003064435,0.00024609594,0.00004573438,0.00025230905,0.00013638614,0.00008282321,0.0000073615442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043696713,0.00047626192,0.00005808187,0.0001355609,0.000013788435,0.0000016788588,0.0022617434,0.90059876,0.0000032124997,0.059134357,0.0003438462,0.036929],"study_design_scores_gemma":[0.001314137,0.00015119681,0.00007819395,0.00011859507,0.000004618321,0.000009859418,0.0000711651,0.96189606,0.000004460778,0.03406865,0.0021513011,0.00013174578],"about_ca_topic_score_codex":0.000006215998,"about_ca_topic_score_gemma":9.3747957e-7,"teacher_disagreement_score":0.27513584,"about_ca_system_score_codex":0.00009640145,"about_ca_system_score_gemma":0.00003566142,"threshold_uncertainty_score":0.4914198},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.030477581354009544,"score_gpt":0.28848244266485273,"score_spread":0.2580048613108432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976836184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009897942,0.000036161262,0.98851883,0.000037406342,0.000072263036,0.00018409056,3.69268e-7,0.00032283572,0.0009301134],"genre_scores_gemma":[0.51662487,0.0000014813666,0.4833145,0.0000028207994,0.0000144535525,0.000010391854,0.0000021549824,0.000016214346,0.00001308025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914604,0.00008688009,0.00033165462,0.00009164027,0.00017434821,0.00016945785],"domain_scores_gemma":[0.99905705,0.00062472577,0.00006168519,0.00014173883,0.00007248954,0.000042291136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000716851,0.00009577681,0.00014189068,0.000033678527,0.00008369556,0.00005724465,0.00011454861,0.000047704823,0.0000031696834],"category_scores_gemma":[0.00022345192,0.000072943614,0.00004521989,0.0001352178,0.000055654375,0.000069094385,0.000022159245,0.000094299474,0.000012239442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010003057,0.00002838318,0.0000075219436,0.000099068035,0.00001192912,6.603559e-8,0.000278442,0.6579093,0.000040278883,0.01592158,0.000015215961,0.32568723],"study_design_scores_gemma":[0.00017011318,0.000019402525,0.000020556008,0.00002965794,0.000010780839,0.0000014061358,0.000045433855,0.97617185,0.00031477356,0.02299393,0.00014599813,0.00007607861],"about_ca_topic_score_codex":8.2357684e-7,"about_ca_topic_score_gemma":5.8862236e-7,"teacher_disagreement_score":0.506727,"about_ca_system_score_codex":0.000018799885,"about_ca_system_score_gemma":0.0000047070994,"threshold_uncertainty_score":0.2974554},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03929983688559276,"score_gpt":0.3069045975542264,"score_spread":0.26760476066863365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976845059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032747004,0.000007556482,0.99173856,0.0017938529,0.00013089484,0.0017417994,0.0000016492758,0.00030036908,0.0010106035],"genre_scores_gemma":[0.88689804,3.2544804e-7,0.11155886,0.0006084035,0.00018201218,0.00044072617,0.00021140777,0.000016001779,0.000084236905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986447,0.000067694644,0.00042877512,0.0003325485,0.00027654596,0.00024970097],"domain_scores_gemma":[0.99879456,0.00026073377,0.000109276036,0.00025191903,0.0005638156,0.00001971609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021513402,0.00017825788,0.0001848285,0.000088213725,0.0004273135,0.00044617214,0.00021309925,0.00005151851,0.000081421946],"category_scores_gemma":[0.0005138177,0.0001274006,0.00006525223,0.0004851324,0.000068870126,0.00060784345,0.000039891744,0.00009142826,0.00024536258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004258835,0.00042240552,0.000054911998,0.0010580504,0.000054598833,9.754467e-8,0.0006102482,0.14044766,0.000066480476,0.26589307,0.0008807056,0.5904692],"study_design_scores_gemma":[0.00031337838,0.00004549319,0.0002499686,0.00002093602,0.00006531401,2.9465323e-7,0.00048448172,0.9317363,0.000016988604,0.049773816,0.017131072,0.0001619877],"about_ca_topic_score_codex":0.00014809347,"about_ca_topic_score_gemma":0.00006631463,"teacher_disagreement_score":0.8836233,"about_ca_system_score_codex":0.000036015088,"about_ca_system_score_gemma":0.000011915075,"threshold_uncertainty_score":0.5195246},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09562827335959624,"score_gpt":0.42808541220179064,"score_spread":0.3324571388421944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033477411","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002009174,0.000035918118,0.9925333,0.00040902535,0.00017362877,0.0038911377,0.0000034097952,0.0005866286,0.00035775558],"genre_scores_gemma":[0.04447594,8.329831e-7,0.95349634,0.000052010124,0.00021460217,0.001185344,0.00007797664,0.00011315745,0.00038377446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967003,0.00031031895,0.0009704152,0.00042214294,0.0006755339,0.0009212752],"domain_scores_gemma":[0.99686456,0.0016206229,0.00036940814,0.0003604587,0.0004530569,0.000331896],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002594527,0.00035475957,0.0006601395,0.00018825271,0.00027210618,0.00024103343,0.00021220114,0.00018350665,0.00010107965],"category_scores_gemma":[0.0026436818,0.00031345955,0.00022789904,0.00046109696,0.00015515926,0.00047888752,0.00015012942,0.00028472813,0.00007183749],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020489508,0.0021420647,0.000047971225,0.0030503406,0.00026155481,0.000005675303,0.008425599,0.0002644344,0.00065822806,0.35804403,0.0004931227,0.6264021],"study_design_scores_gemma":[0.0014713896,0.00032418646,0.000005993871,0.0001917892,0.000110080175,0.00007356144,0.0008541739,0.5836284,0.00061085104,0.4113083,0.0010077927,0.0004134533],"about_ca_topic_score_codex":0.0000018636289,"about_ca_topic_score_gemma":9.2899046e-7,"teacher_disagreement_score":0.62598866,"about_ca_system_score_codex":0.00019627379,"about_ca_system_score_gemma":0.00006338169,"threshold_uncertainty_score":0.99993175},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Theory of computation; Computer science; Algorithm; Parallel computing","score_opus":0.04018985705435785,"score_gpt":0.3494476894717266,"score_spread":0.30925783241736876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045811671","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001925808,0.000005298952,0.99539274,0.00010376868,0.000026610232,0.0005971025,0.0000012533624,0.00022064948,0.0017267776],"genre_scores_gemma":[0.095267236,9.690992e-7,0.90444106,0.000011203431,0.00004408633,0.000049756196,0.000024491526,0.00004771376,0.00011346608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815035,0.00012947146,0.00051857135,0.00026969184,0.0006437173,0.00028822367],"domain_scores_gemma":[0.99812764,0.00082851975,0.00027067255,0.0002373549,0.00042742747,0.000108356326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006478122,0.00018099582,0.00034614935,0.0001591429,0.00009714557,0.000059432605,0.00016154388,0.0000789645,0.00006645242],"category_scores_gemma":[0.00088009814,0.00014586677,0.00005574652,0.0005031053,0.00016449353,0.00018219421,0.000055311488,0.00014754974,0.0000145363365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057848007,0.0006691723,0.000046887028,0.0007329526,0.00006295256,0.0000030837016,0.0007462752,0.64571285,0.000028245753,0.11079454,0.00005458594,0.24109063],"study_design_scores_gemma":[0.0006644024,0.00027187663,0.000008000239,0.00010690352,0.000027648812,0.000015866312,0.00009392016,0.89272267,0.00020530402,0.10563767,0.000085943146,0.00015981236],"about_ca_topic_score_codex":0.000001651959,"about_ca_topic_score_gemma":6.0639536e-7,"teacher_disagreement_score":0.24700981,"about_ca_system_score_codex":0.000044025794,"about_ca_system_score_gemma":0.000027839198,"threshold_uncertainty_score":0.5948274},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013270643753828533,"score_gpt":0.2620524660477406,"score_spread":0.24878182229391205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080484716","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010101285,0.00026441773,0.9878296,0.00008346677,0.00008701938,0.00035348002,6.307391e-7,0.0004938216,0.0007862769],"genre_scores_gemma":[0.25122356,0.0000061915407,0.74853194,0.000009563853,0.00009205664,0.00003174607,0.0000063263305,0.000038332615,0.000060317845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892324,0.00008266327,0.00031297278,0.000112639944,0.00020825469,0.0003602461],"domain_scores_gemma":[0.9992922,0.00040617422,0.000047961203,0.00010136992,0.00003768688,0.000114624156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010635748,0.00014025645,0.00014255547,0.000033132103,0.00021345257,0.0001747061,0.0000797638,0.000066384826,0.0000069334947],"category_scores_gemma":[0.00007713698,0.00011002968,0.000030935895,0.00013946873,0.000054621043,0.00014736994,0.00003583114,0.00014803099,0.000064797685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013707719,0.000041269912,0.000060683833,0.000112417256,0.00003254871,8.6262907e-7,0.0011726065,0.026724866,0.00015549824,0.0015610518,0.000028687282,0.97010815],"study_design_scores_gemma":[0.0001500004,0.000016162146,0.00012646113,0.000035984027,0.000025334477,0.000034658966,0.00008278693,0.99357843,0.00018652917,0.0053558866,0.0002626256,0.00014516157],"about_ca_topic_score_codex":7.894317e-7,"about_ca_topic_score_gemma":1.5945083e-7,"teacher_disagreement_score":0.96996295,"about_ca_system_score_codex":0.000042042935,"about_ca_system_score_gemma":0.000005508367,"threshold_uncertainty_score":0.448688},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.06588397214478896,"score_gpt":0.4300520505632912,"score_spread":0.36416807841850224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111997007","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006828111,0.000078167584,0.9869622,0.000278872,0.00019566808,0.0047732336,0.0000029164853,0.0006724117,0.00020841026],"genre_scores_gemma":[0.028708229,0.0000012900374,0.9681252,0.000057638532,0.000118435346,0.0022904065,0.00006208887,0.0001395488,0.00049711735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964116,0.00039432602,0.0010361962,0.00061545655,0.0005536961,0.0009887178],"domain_scores_gemma":[0.9962233,0.0022647318,0.0003148064,0.00036966216,0.00052705844,0.00030047473],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021090033,0.00040328302,0.00070590933,0.00022567454,0.00047101887,0.00050908735,0.00030417656,0.00020133457,0.0001235888],"category_scores_gemma":[0.00236474,0.0003668642,0.00033199173,0.0006265629,0.000088075125,0.0005038466,0.00010849845,0.00031088403,0.00012222523],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027986276,0.0014546156,0.00006428789,0.0020012276,0.0002679926,0.000006098116,0.004978357,0.0025217913,0.0008781272,0.03916806,0.0005582945,0.94807315],"study_design_scores_gemma":[0.0010436674,0.0001623665,0.0000087396475,0.00011578896,0.00008383405,0.000009928768,0.0010425157,0.76033175,0.0006873612,0.23495305,0.0011599571,0.00040102247],"about_ca_topic_score_codex":0.0000036140561,"about_ca_topic_score_gemma":0.0000023844173,"teacher_disagreement_score":0.9476721,"about_ca_system_score_codex":0.00015788896,"about_ca_system_score_gemma":0.000077572986,"threshold_uncertainty_score":0.99987835},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02548378838351857,"score_gpt":0.30913257376755415,"score_spread":0.2836487853840356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138131169","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046488622,0.000032575997,0.9958323,0.0011320056,0.00027666986,0.0014396672,4.4029673e-7,0.00057613145,0.00024532527],"genre_scores_gemma":[0.120855846,3.1571335e-7,0.87820834,0.00012276696,0.00007963993,0.00060615473,0.0000058024193,0.000023616034,0.00009749244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979713,0.00009957097,0.0004988388,0.0004927666,0.00036405673,0.0005734657],"domain_scores_gemma":[0.99837565,0.00071435294,0.00014898146,0.00028587485,0.00025597838,0.00021913677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058970234,0.00023058575,0.00032634923,0.000092385584,0.00018907026,0.0006548927,0.00048130692,0.00009537105,0.000014562298],"category_scores_gemma":[0.0002519881,0.00018563448,0.00016769826,0.000431875,0.00011280939,0.0005060687,0.00016448513,0.00016174662,0.00023967476],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015406767,0.00019067289,0.0000045233332,0.00011397047,0.0000151441145,0.0000017315363,0.0001979607,0.00016115127,0.000027880116,0.062636316,0.0003096269,0.9363395],"study_design_scores_gemma":[0.0002469706,0.00021221432,0.000029473136,0.000050785104,0.00000995716,0.000016193577,0.00008217083,0.7313723,0.00022026822,0.26213965,0.0054008686,0.00021914323],"about_ca_topic_score_codex":0.000012017001,"about_ca_topic_score_gemma":3.2760013e-7,"teacher_disagreement_score":0.93612033,"about_ca_system_score_codex":0.000054478765,"about_ca_system_score_gemma":0.000029797891,"threshold_uncertainty_score":0.7569954},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07469503885769585,"score_gpt":0.36792915259262926,"score_spread":0.2932341137349334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2677624263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03796949,0.00010692832,0.9579964,0.0011972659,0.000108640445,0.0016169432,0.0000021235085,0.00014083911,0.00086132623],"genre_scores_gemma":[0.5531111,1.321097e-7,0.44645113,0.00007646673,0.00003868052,0.00015692574,0.000008814191,0.000012490471,0.00014427905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977126,0.00012007449,0.0006007347,0.00046376005,0.0007703848,0.00033241164],"domain_scores_gemma":[0.99246675,0.006464712,0.0002535549,0.00032379484,0.0003975519,0.00009364764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038517814,0.00015861735,0.00027362644,0.00015473731,0.0004079153,0.0006601935,0.0003272981,0.000079720085,0.00003170396],"category_scores_gemma":[0.0025866255,0.00009954677,0.00014498625,0.00071051467,0.000116183306,0.00017044165,0.000025000463,0.00016574193,0.0001626943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006955005,0.0005027994,0.001846114,0.00028438185,0.00007881199,2.9590296e-7,0.0023533064,0.5921149,0.0001186174,0.08387021,0.00013719015,0.3186238],"study_design_scores_gemma":[0.0005491513,0.00006476489,0.00029810565,0.000035285542,0.000041609313,0.0000042817915,0.0007592711,0.9079281,0.000025882933,0.089779295,0.0003883564,0.00012591404],"about_ca_topic_score_codex":0.000004685643,"about_ca_topic_score_gemma":4.405537e-7,"teacher_disagreement_score":0.5151416,"about_ca_system_score_codex":0.000027580732,"about_ca_system_score_gemma":0.00007676028,"threshold_uncertainty_score":0.6366261},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013307758683769804,"score_gpt":0.24875625902104145,"score_spread":0.23544850033727166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790891482","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031895436,0.000089383844,0.9592262,0.00005439579,0.0001182054,0.0003731524,0.0000011819251,0.0009203388,0.0073217307],"genre_scores_gemma":[0.7240819,0.000004467635,0.27571195,0.000015037024,0.00006096634,0.000037224017,0.000021497533,0.000029226174,0.000037728063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901533,0.000021780548,0.00043529453,0.00013823724,0.00020089216,0.00018845484],"domain_scores_gemma":[0.9995847,0.00006961613,0.00008381874,0.000104295235,0.00009742647,0.000060140115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000114714174,0.00013941439,0.00019720856,0.00011609625,0.00006307806,0.00011421255,0.00011366486,0.00006950918,0.00007349779],"category_scores_gemma":[0.000070546506,0.00012505513,0.000048160233,0.0004509237,0.00012262544,0.0004723699,0.000019969211,0.00008690259,0.00005569835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027786557,0.00040056623,0.00018177196,0.0019193626,0.00008567575,0.0000022342542,0.004496833,0.0123767955,0.0005723858,0.04742175,0.0010259596,0.9314889],"study_design_scores_gemma":[0.00023742998,0.00021807279,0.00003278229,0.00023359027,0.000021072652,0.000005401174,0.00029464017,0.97382903,0.005335133,0.016825983,0.0027679384,0.00019894548],"about_ca_topic_score_codex":6.293564e-7,"about_ca_topic_score_gemma":0.0000012156976,"teacher_disagreement_score":0.9614522,"about_ca_system_score_codex":0.0000182608,"about_ca_system_score_gemma":0.000020677913,"threshold_uncertainty_score":0.50996},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03308505023616477,"score_gpt":0.23674546076711908,"score_spread":0.2036604105309543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910526083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009291808,0.000026159907,0.9849083,0.0005575264,0.00012929352,0.00023108025,0.000004427606,0.001111434,0.0037399952],"genre_scores_gemma":[0.770285,0.0000027893939,0.22924125,0.00015302261,0.00012226104,0.000023529612,0.000094529096,0.000036775447,0.000040825074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993007,0.00001686021,0.00023911695,0.00014442459,0.00014519072,0.00015369452],"domain_scores_gemma":[0.9996561,0.00008243022,0.000027580423,0.000077011486,0.000030170748,0.00012669788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000050985225,0.000117154625,0.0001413752,0.000027774671,0.000056499,0.00011548238,0.000068607886,0.000053529762,0.00017706162],"category_scores_gemma":[0.00005231305,0.00011598283,0.000046590743,0.00021974981,0.00002370112,0.000097628945,0.000018417802,0.000117116164,0.0005538582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009334015,0.00012067845,0.00024150197,0.00039074378,0.00009451109,0.000007162207,0.0039964835,0.84176797,0.00018929118,0.012673341,0.0047583655,0.13575064],"study_design_scores_gemma":[0.00018869906,0.00002504104,0.000092696886,0.00003404372,0.000022679047,0.0000013235907,0.000054453372,0.98442465,0.00006480724,0.0086351745,0.00631284,0.00014360473],"about_ca_topic_score_codex":0.0000019953673,"about_ca_topic_score_gemma":8.8925225e-7,"teacher_disagreement_score":0.7609932,"about_ca_system_score_codex":0.000019586627,"about_ca_system_score_gemma":0.000005535278,"threshold_uncertainty_score":0.7118911},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.068070465368407,"score_gpt":0.40687205881756205,"score_spread":0.33880159344915506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128841739","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030503187,0.00003093372,0.99520236,0.00019937656,0.000031213858,0.001376966,0.0000038227768,0.00008748785,0.00001751794],"genre_scores_gemma":[0.032314725,0.000007929542,0.96732926,0.000016291582,0.000024782874,0.00017053494,0.000057411922,0.00003983568,0.0000392109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852014,0.00012031782,0.0005719034,0.00027341995,0.00029138435,0.00022284941],"domain_scores_gemma":[0.9980971,0.0008352595,0.00021910142,0.00014778916,0.00062879734,0.00007195908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006373938,0.00014290767,0.00028684785,0.00010275433,0.00009520367,0.00006381176,0.0000660572,0.00006997138,0.00006927577],"category_scores_gemma":[0.00071656343,0.00014261426,0.000062406034,0.00025843838,0.00006809116,0.00019902296,0.00007491824,0.00007846877,0.0000018831547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011687849,0.0005810289,0.000024429759,0.0032499565,0.00021246352,0.00001016224,0.005234756,0.6769036,0.002496557,0.05001707,0.00013953328,0.26101354],"study_design_scores_gemma":[0.00082188885,0.00014288744,0.0000027866379,0.00007918165,0.00004183874,0.000013802699,0.00071413827,0.8761483,0.006599347,0.11529353,0.000021017458,0.000121277895],"about_ca_topic_score_codex":9.721839e-7,"about_ca_topic_score_gemma":6.462969e-7,"teacher_disagreement_score":0.26089227,"about_ca_system_score_codex":0.000053192252,"about_ca_system_score_gemma":0.00006669262,"threshold_uncertainty_score":0.58156407},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07001615077258662,"score_gpt":0.3931760246580674,"score_spread":0.3231598738854808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215819884","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014352469,0.000091506714,0.99426836,0.0006990337,0.0002962852,0.0016190101,0.000023256976,0.00089837296,0.00066890934],"genre_scores_gemma":[0.027099734,0.0000038267262,0.9702567,0.000037265978,0.0002095581,0.0004967949,0.00012674656,0.000097825665,0.0016715509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998161,0.00005755125,0.0005400235,0.00040708936,0.00041490863,0.0004194345],"domain_scores_gemma":[0.9975067,0.0017783256,0.000078493424,0.00019740229,0.00028944502,0.0001496778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064179854,0.00021191307,0.0002974388,0.00020089974,0.00021339183,0.0003183533,0.00013018039,0.00009682833,0.00010077874],"category_scores_gemma":[0.0009061849,0.0001864851,0.00015933473,0.00046852496,0.00012934196,0.00020315219,0.000055117423,0.00022029156,0.00022488854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000616136,0.000989363,0.000005732868,0.004311553,0.00024917527,0.000029592988,0.0019237036,0.0048064166,0.00011292618,0.492443,0.005742484,0.48932442],"study_design_scores_gemma":[0.0002898162,0.00013594583,7.538422e-7,0.00013164383,0.00004708031,0.000013843993,0.00014637184,0.66591674,0.00008046546,0.31882602,0.014254313,0.00015698775],"about_ca_topic_score_codex":9.702965e-7,"about_ca_topic_score_gemma":0.000001091581,"teacher_disagreement_score":0.66111034,"about_ca_system_score_codex":0.00012282292,"about_ca_system_score_gemma":0.000070658505,"threshold_uncertainty_score":0.7604642},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05488586377177668,"score_gpt":0.3800281116634619,"score_spread":0.3251422478916852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286984759","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034733352,0.000022556198,0.990921,0.0004830986,0.0000722557,0.0037452444,0.0000061518454,0.00035332507,0.0009230258],"genre_scores_gemma":[0.07382511,0.0000015011121,0.92491335,0.00013712302,0.000053855707,0.00061022304,0.000049261656,0.00006113832,0.00034845158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752486,0.0001356501,0.0007550225,0.00063693756,0.00050337805,0.00044414363],"domain_scores_gemma":[0.9981109,0.00047877748,0.00016877652,0.00032067238,0.0006517854,0.00026912006],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006735156,0.00030746358,0.0004254258,0.00059559225,0.00031905872,0.00019809614,0.000227336,0.0001555438,0.000009401065],"category_scores_gemma":[0.0015625701,0.00030453716,0.00006679402,0.0016399099,0.000056077988,0.00027770424,0.00025707833,0.0002374136,0.000046414432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029271905,0.00048625984,0.000007649037,0.0006065337,0.00003568157,6.0342614e-7,0.0009887944,0.9281734,0.000082954146,0.04310899,0.00009231608,0.02638751],"study_design_scores_gemma":[0.00040670618,0.000057967223,0.000005173865,0.00018089914,0.000059020032,0.000009903776,0.00041501783,0.97396946,0.00017636253,0.024273876,0.00017700439,0.00026859358],"about_ca_topic_score_codex":0.0000024881185,"about_ca_topic_score_gemma":9.658866e-7,"teacher_disagreement_score":0.07035178,"about_ca_system_score_codex":0.0002095459,"about_ca_system_score_gemma":0.000067417255,"threshold_uncertainty_score":0.9999407},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05031470689977383,"score_gpt":0.3484830661823973,"score_spread":0.2981683592826235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387845108","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008066807,0.000007823443,0.9858714,0.00050954265,0.00011014249,0.0043250853,0.000027375812,0.00095146033,0.00013037685],"genre_scores_gemma":[0.01824838,0.0000045640923,0.97958404,0.000052177544,0.00006336174,0.0009966979,0.0007244619,0.0001575673,0.00016874395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963643,0.0001673163,0.0009976863,0.00065872027,0.00092535827,0.00088663946],"domain_scores_gemma":[0.9964206,0.0020889407,0.0003710958,0.00040014696,0.00051014585,0.00020906504],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010835862,0.00040221884,0.00061590824,0.0006337785,0.0003262476,0.00022423967,0.00034488097,0.0002805266,0.00010356722],"category_scores_gemma":[0.0010392003,0.00039278777,0.00020126885,0.001477794,0.00016863733,0.00039032742,0.00016571478,0.0003225438,0.00017019628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013022815,0.0008400594,0.00030047083,0.0030840756,0.00006751094,0.000028124821,0.0032008432,0.9676204,0.00010202388,0.012918248,0.0012599492,0.010448083],"study_design_scores_gemma":[0.0028353592,0.0002008581,0.00001882595,0.00036936265,0.000025510217,0.000004749478,0.00043171522,0.76459277,0.000078803016,0.23053792,0.0005502759,0.00035383424],"about_ca_topic_score_codex":0.0000022813472,"about_ca_topic_score_gemma":0.0000070374026,"teacher_disagreement_score":0.21761967,"about_ca_system_score_codex":0.00040535346,"about_ca_system_score_gemma":0.00012579765,"threshold_uncertainty_score":0.9998524},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03303405857604129,"score_gpt":0.3292207379324631,"score_spread":0.2961866793564218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396927647","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037248273,0.00020036181,0.9968648,0.0007507458,0.00015007218,0.0008105586,0.0000010575384,0.0006039552,0.00024596293],"genre_scores_gemma":[0.08276449,0.000005599068,0.9168085,0.000018995052,0.000055732908,0.0001449555,0.000020918227,0.000023913233,0.00015687908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984037,0.00007420351,0.00036986664,0.00045967827,0.0003797253,0.00031278888],"domain_scores_gemma":[0.9985914,0.0008575394,0.00007687893,0.00015592697,0.00019569222,0.00012256755],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000820865,0.00015379798,0.00018015344,0.00022745722,0.00020532534,0.0012937264,0.00022454593,0.00006621142,0.0000074572513],"category_scores_gemma":[0.0005559293,0.00013872184,0.000055736025,0.00051896315,0.00007559974,0.00050886755,0.00013067982,0.00013516162,0.000015728025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004567558,0.000059333317,0.0000065176378,0.00064278237,0.000039591083,0.000010822586,0.001668605,0.008392298,0.0000321599,0.14280869,0.0001559427,0.8461787],"study_design_scores_gemma":[0.00020688829,0.000105277475,0.0000064164137,0.00018394655,0.00001697534,0.000020730633,0.000056438956,0.9673411,0.00005780472,0.03088472,0.0009728216,0.00014687185],"about_ca_topic_score_codex":7.234061e-7,"about_ca_topic_score_gemma":1.0068143e-7,"teacher_disagreement_score":0.9589488,"about_ca_system_score_codex":0.00004667383,"about_ca_system_score_gemma":0.00006778147,"threshold_uncertainty_score":0.99974304},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.1145559480526452,"score_gpt":0.41249560669244284,"score_spread":0.29793965863979766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399389097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045989747,0.00022170326,0.98320204,0.0072242133,0.00078976457,0.00037994917,0.0000047387734,0.0004261454,0.0031524966],"genre_scores_gemma":[0.8935397,0.000004328403,0.10410668,0.000119528784,0.00023406197,0.000063011656,0.00006818146,0.000026839092,0.0018376721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660045,0.0002818631,0.0007847264,0.0004963106,0.0014946018,0.00034202068],"domain_scores_gemma":[0.98858744,0.010499713,0.00014168659,0.000290473,0.00037011548,0.000110555906],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0038158786,0.00017794706,0.0002050539,0.00028648556,0.00081699545,0.0023534892,0.00034157655,0.000092842485,0.000104512525],"category_scores_gemma":[0.003847372,0.0001130351,0.00017255059,0.0015643198,0.0001936804,0.00023305923,0.000059762737,0.00029758672,0.0028391539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016320195,0.00010625145,0.000009547225,0.00002028755,0.000032585514,0.0000051988127,0.00033282235,0.35281307,0.000002596851,0.40887418,0.0041930387,0.23359409],"study_design_scores_gemma":[0.000080779,0.00003980362,0.00007896649,0.00009588605,0.0000151592485,0.000010976291,0.00017964456,0.590021,0.000003293381,0.40352508,0.0058631147,0.000086306754],"about_ca_topic_score_codex":0.0000023624668,"about_ca_topic_score_gemma":0.0000033452395,"teacher_disagreement_score":0.88894075,"about_ca_system_score_codex":0.00008489951,"about_ca_system_score_gemma":0.00008144041,"threshold_uncertainty_score":0.99868214},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02221699247781377,"score_gpt":0.2937117696713729,"score_spread":0.27149477719355913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400792608","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007722651,0.0002006024,0.99090755,0.0021481754,0.00019275675,0.0015042536,0.000006085318,0.004061749,0.00020655488],"genre_scores_gemma":[0.15041627,0.0000024203737,0.8487081,0.0002236674,0.0001247394,0.00029989303,0.000051344232,0.000054283933,0.00011926934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775463,0.000098755605,0.00057047984,0.00072860054,0.00037623037,0.000471292],"domain_scores_gemma":[0.99831855,0.0009213412,0.00010118883,0.0003082638,0.00011227772,0.00023836056],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007274102,0.00030054923,0.00033470592,0.0003556827,0.00020683293,0.0013234275,0.0004573341,0.00013386422,0.000010262267],"category_scores_gemma":[0.00021520382,0.0002660294,0.00014029638,0.0007412543,0.00010823204,0.00056618435,0.00025344934,0.0002289441,0.000027257245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029050037,0.00024513333,0.000019895522,0.0008027559,0.000058824648,0.0000193842,0.0018081919,0.022484692,0.000023630879,0.06005704,0.0019650431,0.9124864],"study_design_scores_gemma":[0.0002678439,0.00036365326,0.000008849169,0.00046485098,0.00002676608,0.000019546213,0.000021362286,0.9650657,0.00034789005,0.022239769,0.010873999,0.00029977955],"about_ca_topic_score_codex":0.0000024292478,"about_ca_topic_score_gemma":2.0981464e-7,"teacher_disagreement_score":0.942581,"about_ca_system_score_codex":0.00004428636,"about_ca_system_score_gemma":0.00012402135,"threshold_uncertainty_score":0.9999792},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020716518062968307,"score_gpt":0.2932313392360823,"score_spread":0.272514821173114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403238270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008115669,0.00011515527,0.9887057,0.00031516116,0.00009092921,0.00040586045,3.821202e-7,0.00069021503,0.0015609486],"genre_scores_gemma":[0.6905298,0.000001925215,0.30932432,0.000013484046,0.000033038486,0.000049710998,0.0000117406,0.000025051968,0.000010870704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989378,0.000105759165,0.00035053852,0.00015633323,0.00024171191,0.00020787239],"domain_scores_gemma":[0.99938536,0.0004541098,0.000017661729,0.00008761892,0.000027763246,0.000027518681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011844833,0.00012280319,0.000119276265,0.00010719087,0.000050186045,0.00033216787,0.00010906058,0.00007033758,0.0000065909035],"category_scores_gemma":[0.00005639661,0.00009651205,0.00004383359,0.00055693364,0.000039201524,0.00019241011,0.000011567083,0.00023744217,0.00004733158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.663873e-7,0.000029174993,0.0000052019655,0.00052028237,0.000008290336,0.000008798793,0.0031099936,0.49720648,0.00003576117,0.022553487,0.00003416882,0.4764875],"study_design_scores_gemma":[0.00008373784,0.0000201266,0.000092466275,0.00020140306,0.000014610394,0.000024281542,0.0003635208,0.97577864,0.000068800386,0.022995532,0.00024776036,0.000109099914],"about_ca_topic_score_codex":0.0000011983566,"about_ca_topic_score_gemma":0.0000014386588,"teacher_disagreement_score":0.6824142,"about_ca_system_score_codex":0.00008132537,"about_ca_system_score_gemma":0.0000113831675,"threshold_uncertainty_score":0.39356473},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018751767744418665,"score_gpt":0.27574009878120187,"score_spread":0.2569883310367832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406597533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19648819,0.000014699407,0.8004023,0.0017593334,0.00034862236,0.00039065495,0.0000015485876,0.000042131003,0.000552548],"genre_scores_gemma":[0.98088986,2.2033153e-7,0.018793793,0.00007573121,0.000029788253,0.000028850593,0.0000064300266,0.000004238824,0.00017107156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987387,0.0001524008,0.00041845467,0.00019090282,0.000369362,0.00013017509],"domain_scores_gemma":[0.99826425,0.0010174164,0.00019858318,0.0003166205,0.00017886885,0.00002427441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031283216,0.00011289835,0.00017471313,0.000115711904,0.00017405597,0.000065727734,0.000429429,0.000033601344,0.000017159708],"category_scores_gemma":[0.0002220118,0.00006807509,0.00013123396,0.00083841215,0.00010613868,0.00007252956,0.0001671273,0.00011487392,0.00001000685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014596151,0.0004778632,0.000027580445,0.00010300188,0.00004939103,2.1568242e-7,0.00031921052,0.014935051,0.0036160727,0.9313906,0.0005743192,0.048492122],"study_design_scores_gemma":[0.0005404862,0.000114347415,0.0014409265,0.00017785038,0.00004335517,0.0000028203783,0.000034923905,0.78043693,0.007710994,0.20918633,0.00021138885,0.000099671954],"about_ca_topic_score_codex":0.0000038468047,"about_ca_topic_score_gemma":0.0000016778849,"teacher_disagreement_score":0.78440166,"about_ca_system_score_codex":0.000026412416,"about_ca_system_score_gemma":0.000060362112,"threshold_uncertainty_score":0.27760217},"labels":[],"label_agreement":null}]}