{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2328577,0.000446465,0.6644281,0.0013316127,0.00018091228,0.00019360156,0.0025865266,0.0010353603,0.096939676],"genre_scores_gemma":[0.47156245,0.000501717,0.47423536,0.0004659191,0.00010566649,0.0004242571,0.0057620085,0.0007914651,0.04615118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993337,0.0001523094,0.00003977797,0.00012658603,0.0001916117,0.0001560134],"domain_scores_gemma":[0.99883467,0.00054927985,0.000094551426,0.00021702376,0.00017048334,0.00013401134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038265742,0.0006677738,0.0009522997,0.0014749026,0.0011791144,0.0035713336,0.0016160305,0.0013367814,0.030667692],"category_scores_gemma":[0.002824087,0.0007775816,0.0012807937,0.0022179678,0.0008574083,0.0033041385,0.0023305647,0.0025800217,0.0044225208],"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.00015932033,0.00023663034,0.0015888829,0.00046952645,0.000054290966,0.00021553802,0.00040711026,0.038409572,0.005464865,0.8382889,0.019379817,0.09532552],"study_design_scores_gemma":[0.000044527096,0.000049638234,0.0008461136,0.00008941045,0.000029463805,0.00022978506,0.00022838442,0.103758834,0.003226286,0.870416,0.021053834,0.000027820477],"about_ca_topic_score_codex":0.0009841893,"about_ca_topic_score_gemma":0.0020897565,"teacher_disagreement_score":0.030667692,"about_ca_system_score_codex":0.00084671413,"about_ca_system_score_gemma":0.00053156336,"threshold_uncertainty_score":0.10259366},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00941025,0.00019250248,0.9740484,0.0014323296,0.0002029659,0.00013201487,0.000094213356,0.00034792567,0.0141394185],"genre_scores_gemma":[0.39839837,0.0005157574,0.57137084,0.00053284585,0.00032017418,0.0011659332,0.00033222913,0.0005924291,0.02677129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955741,0.0021253577,0.00030572715,0.00038994433,0.0013460335,0.00025878052],"domain_scores_gemma":[0.991193,0.005295285,0.0003874765,0.002147544,0.0006823855,0.0002943983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072907996,0.00081729976,0.0010379204,0.0011278329,0.0025401467,0.0048375847,0.0026106543,0.0018369193,0.009964839],"category_scores_gemma":[0.020445788,0.0007561903,0.0010258425,0.0016693972,0.0029148336,0.006778985,0.006596443,0.004427325,0.0016334265],"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.00011879128,0.000048616275,0.0001247733,0.00005326327,0.000023022287,0.000061194136,0.00019582946,0.046100207,0.0006074563,0.92432755,0.003193123,0.025146313],"study_design_scores_gemma":[0.00006293289,0.00002587788,0.000051072286,0.000024952511,0.00001968171,0.00003481612,0.000058720132,0.21382324,0.0011422916,0.77588177,0.008855647,0.000019026094],"about_ca_topic_score_codex":0.0009311621,"about_ca_topic_score_gemma":0.001163275,"teacher_disagreement_score":0.009964839,"about_ca_system_score_codex":0.0014579978,"about_ca_system_score_gemma":0.0021923732,"threshold_uncertainty_score":0.038557887},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006493467,0.0006601142,0.97275454,0.0019975686,0.0003747712,0.000026122567,0.00018765626,0.00030862665,0.017197266],"genre_scores_gemma":[0.5680534,0.0031745578,0.391562,0.0017092691,0.0012598302,0.00022545093,0.0005598081,0.00076105876,0.032694645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855953,0.00068981986,0.000052263287,0.00022643089,0.000392644,0.00007942993],"domain_scores_gemma":[0.9949875,0.002238823,0.00031718545,0.0016290952,0.00066410913,0.0001633399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015907609,0.0009046074,0.0014205985,0.0004106324,0.00076784904,0.00261417,0.0032750336,0.0015166209,0.010825114],"category_scores_gemma":[0.0091684265,0.0008645131,0.0012440557,0.0007608315,0.0011902042,0.0051667066,0.0017723764,0.003314509,0.003991931],"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.00008588774,0.0000842184,0.0007463006,0.00020854833,0.00012028472,0.00006944386,0.00008544225,0.48783225,0.0010215224,0.4577625,0.00868133,0.04330238],"study_design_scores_gemma":[0.0000098770015,0.000027533673,0.00007204503,0.0000241331,0.000019886287,0.000031857544,0.000022438086,0.851375,0.00039738166,0.14125617,0.006747231,0.00001643388],"about_ca_topic_score_codex":0.0031983184,"about_ca_topic_score_gemma":0.0033141058,"teacher_disagreement_score":0.010825114,"about_ca_system_score_codex":0.0005583349,"about_ca_system_score_gemma":0.0012434277,"threshold_uncertainty_score":0.036213636},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005466018,0.00011350154,0.9887177,0.00016742061,0.00007556731,0.000030008361,0.00004149131,0.000101096695,0.005287181],"genre_scores_gemma":[0.44140026,0.00033082868,0.5419339,0.00026910793,0.0001421432,0.0003426244,0.00017890954,0.00021812477,0.01518415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995117,0.000141449,0.000015649026,0.00007231663,0.000185365,0.00007355513],"domain_scores_gemma":[0.9986173,0.00081406796,0.0000684282,0.00013613999,0.000291631,0.000072442475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010631451,0.0006106255,0.00100297,0.00065905845,0.0005889539,0.0010202992,0.0021590753,0.001218658,0.0065743225],"category_scores_gemma":[0.0039380435,0.0005040209,0.00078543567,0.001194742,0.0008404608,0.0014500513,0.0016447017,0.0012398391,0.0006999543],"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.000059377595,0.00006540039,0.0002278374,0.00008195203,0.000024587578,0.000075862874,0.000074101765,0.8992186,0.00079688564,0.059121992,0.0025483565,0.037704997],"study_design_scores_gemma":[0.000008292433,0.0000066605908,0.000018749606,0.0000036521642,0.0000027663134,0.000006953497,0.0000072357834,0.99166614,0.0000652752,0.007689113,0.0005228721,0.0000022321103],"about_ca_topic_score_codex":0.010275118,"about_ca_topic_score_gemma":0.011095204,"teacher_disagreement_score":0.010275118,"about_ca_system_score_codex":0.0010242586,"about_ca_system_score_gemma":0.002254715,"threshold_uncertainty_score":0.021993339},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012617654,0.000072085175,0.99720156,0.000074535514,0.00006470824,0.000031932344,0.000017701708,0.000077597935,0.0011981096],"genre_scores_gemma":[0.059996333,0.00017340294,0.93437076,0.00012795202,0.00013118645,0.00028544085,0.00013275626,0.00026013717,0.004521925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923503,0.00035359134,0.000027083113,0.00008982849,0.00025225745,0.00004218697],"domain_scores_gemma":[0.99911326,0.0004305991,0.00004902866,0.00008597284,0.00024785352,0.00007317828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020456822,0.0010762105,0.0018059004,0.0007545344,0.0005982835,0.0011529675,0.001953959,0.0019365601,0.0068759327],"category_scores_gemma":[0.0038528773,0.0008132763,0.0011592866,0.00079581485,0.0011200395,0.0011292277,0.0023198659,0.0030718923,0.0017026642],"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.0002554488,0.00031543477,0.0003170259,0.0004454388,0.00010490378,0.00014976187,0.00015714408,0.69745713,0.0076101567,0.11230791,0.0084981555,0.17238145],"study_design_scores_gemma":[0.000017693541,0.000021937278,0.000018763698,0.000009360253,0.0000051319657,0.000013863987,0.0000044691587,0.9916319,0.0003665757,0.00648827,0.0014167785,0.000005179922],"about_ca_topic_score_codex":0.0017288374,"about_ca_topic_score_gemma":0.0017030931,"teacher_disagreement_score":0.0068759327,"about_ca_system_score_codex":0.00058197766,"about_ca_system_score_gemma":0.0016348478,"threshold_uncertainty_score":0.023002267},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023993368,0.00029290805,0.9829596,0.00030862674,0.00015093353,0.00003390964,0.00004982612,0.0003556051,0.013449205],"genre_scores_gemma":[0.22931427,0.00066060055,0.7477399,0.00039789325,0.00040468096,0.00034241402,0.00023023637,0.0008888895,0.020021114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731475,0.0011988216,0.000110353394,0.00026147702,0.00089551485,0.00021916754],"domain_scores_gemma":[0.9962547,0.002117086,0.00021263647,0.00077002094,0.00053087174,0.00011470493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030038017,0.0011758746,0.0012700822,0.0013261662,0.00085366005,0.002939641,0.0016552678,0.0010812706,0.011690778],"category_scores_gemma":[0.016957777,0.00063706434,0.0012368213,0.0015325368,0.0023304871,0.00335547,0.003609237,0.0028901747,0.0023214642],"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.0001600786,0.000081799066,0.00035458273,0.00023360105,0.000058827605,0.000042626583,0.00007382133,0.21838616,0.00072324387,0.62887394,0.007558132,0.14345318],"study_design_scores_gemma":[0.000026025886,0.000039195773,0.00006446428,0.000035196535,0.00001842884,0.000027372454,0.000016933236,0.7615733,0.0010906229,0.22644281,0.010657107,0.000008485011],"about_ca_topic_score_codex":0.0018449717,"about_ca_topic_score_gemma":0.0025596838,"teacher_disagreement_score":0.011690778,"about_ca_system_score_codex":0.0015467935,"about_ca_system_score_gemma":0.0019866875,"threshold_uncertainty_score":0.039109528},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035467243,0.0006747264,0.9893828,0.00044398237,0.000097367214,0.000030761825,0.000071474635,0.00007748487,0.005674632],"genre_scores_gemma":[0.1447851,0.0031122637,0.83654934,0.00023772006,0.0002814255,0.00034987484,0.00048292355,0.0003082646,0.013893078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936086,0.00026020216,0.000025664236,0.00011810908,0.00018267657,0.000052602674],"domain_scores_gemma":[0.9986737,0.0008633873,0.00009581899,0.0001157109,0.00018614224,0.00006518205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013388558,0.0010429427,0.0016227328,0.00111375,0.001113349,0.0028998014,0.002311798,0.0022444765,0.0054112715],"category_scores_gemma":[0.004457389,0.0010906538,0.001507058,0.0023219592,0.0016789376,0.0038853218,0.0019677035,0.003299382,0.0010733446],"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.000046046076,0.000083929466,0.0002624466,0.00014660021,0.000033507156,0.000035076206,0.00007904213,0.65691555,0.00042918252,0.27840886,0.0074324775,0.05612717],"study_design_scores_gemma":[0.000008134808,0.000009314256,0.00003719245,0.000016651364,0.0000061381857,0.000012702312,0.000021402133,0.8961737,0.0001457302,0.10035357,0.0032084289,0.0000069996395],"about_ca_topic_score_codex":0.00734591,"about_ca_topic_score_gemma":0.005695086,"teacher_disagreement_score":0.00734591,"about_ca_system_score_codex":0.0017988048,"about_ca_system_score_gemma":0.0022715004,"threshold_uncertainty_score":0.018102467},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024011494,0.00017545192,0.9951284,0.00017874493,0.00005829078,0.000024122142,0.000029696166,0.00007467558,0.001929455],"genre_scores_gemma":[0.3341577,0.000738156,0.6420344,0.00037597335,0.00023234464,0.00053543923,0.0003999135,0.0006443351,0.020881733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957937,0.0001774584,0.000020357613,0.000059534104,0.00013296332,0.000030316818],"domain_scores_gemma":[0.9980648,0.0011497145,0.00013696573,0.00014552727,0.00035737737,0.00014562764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016439228,0.0009794543,0.0011743457,0.00072270207,0.0008379571,0.0010089292,0.001873134,0.0016309036,0.004785594],"category_scores_gemma":[0.006265415,0.000633161,0.00088110275,0.0008251113,0.0014568648,0.0018591707,0.0028804443,0.0026283094,0.0007389318],"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.000082309096,0.0000624132,0.00036972485,0.0001790326,0.000050084414,0.00007617808,0.00013624018,0.78161967,0.0013536811,0.17020665,0.003759856,0.042104214],"study_design_scores_gemma":[0.0000034750092,0.0000057049174,0.000016528,0.0000046228038,0.0000015198647,0.000004562119,0.000005003923,0.9836758,0.000066632994,0.015739806,0.00047336018,0.0000029696128],"about_ca_topic_score_codex":0.006755725,"about_ca_topic_score_gemma":0.0066091004,"teacher_disagreement_score":0.006755725,"about_ca_system_score_codex":0.0011388492,"about_ca_system_score_gemma":0.0016813682,"threshold_uncertainty_score":0.01600939},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029865166,0.00064972584,0.9919613,0.00024048366,0.00008160031,0.000035577992,0.000058821875,0.00014220763,0.003843761],"genre_scores_gemma":[0.14771287,0.00090015284,0.83992994,0.00031513066,0.00025744116,0.0006790247,0.000381142,0.00054761185,0.0092766285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979425,0.0011374406,0.000061562874,0.0002400187,0.000490567,0.00012790124],"domain_scores_gemma":[0.9923564,0.0059690163,0.00041191414,0.00043497054,0.0005844935,0.00024316846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044070533,0.0015426339,0.0018016385,0.0014616151,0.00094692636,0.0027994025,0.0024699934,0.0014167839,0.007773428],"category_scores_gemma":[0.016911115,0.0011706431,0.0011409557,0.0015561047,0.0022906011,0.003371033,0.0026475566,0.0056101,0.0011573005],"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.00027100794,0.000121053126,0.00040715677,0.0005138464,0.000092108174,0.00007757995,0.00017641636,0.24969915,0.001297006,0.64872247,0.008171437,0.09045078],"study_design_scores_gemma":[0.000039296185,0.000038288963,0.00007729185,0.00006282501,0.000022033051,0.000023917632,0.000028097726,0.5720349,0.00046944505,0.42298162,0.0042089354,0.000013404821],"about_ca_topic_score_codex":0.0019144864,"about_ca_topic_score_gemma":0.002390515,"teacher_disagreement_score":0.007773428,"about_ca_system_score_codex":0.00160505,"about_ca_system_score_gemma":0.0012342933,"threshold_uncertainty_score":0.026004732},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008407208,0.00023877487,0.9860029,0.00029381717,0.000087386914,0.000117481875,0.00007729369,0.00020543653,0.004569669],"genre_scores_gemma":[0.26245353,0.0007257344,0.72876185,0.00020199662,0.00020489644,0.0005371405,0.0002940744,0.00026912024,0.0065515726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993024,0.0002804291,0.00002483274,0.00008100332,0.00018937868,0.00012200544],"domain_scores_gemma":[0.99877423,0.00083061284,0.000073778116,0.000076342185,0.00016256323,0.000082423576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001523275,0.00089383055,0.0020509972,0.0011318172,0.0008996234,0.0013740892,0.0021619115,0.0013483467,0.011311018],"category_scores_gemma":[0.0043063094,0.00078706007,0.0011829727,0.0020570592,0.00086353667,0.0016998136,0.0013091473,0.0019108051,0.0013295163],"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.0001238305,0.00010747832,0.0002272497,0.00008379988,0.000023984216,0.00004020705,0.000038454407,0.89202154,0.0009629243,0.022847826,0.0027420358,0.08078065],"study_design_scores_gemma":[0.000017054625,0.000017391443,0.00003431907,0.0000036166102,0.0000058343667,0.000005814226,0.000005830017,0.9943177,0.000114600436,0.005073975,0.00040067098,0.0000031638453],"about_ca_topic_score_codex":0.016074818,"about_ca_topic_score_gemma":0.011720826,"teacher_disagreement_score":0.016074818,"about_ca_system_score_codex":0.0016151845,"about_ca_system_score_gemma":0.0036043872,"threshold_uncertainty_score":0.037839174},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005110618,0.00074938004,0.93101335,0.00060250686,0.00026458938,0.0002597956,0.00914865,0.020571573,0.032279637],"genre_scores_gemma":[0.07806848,0.0007764358,0.88685256,0.000337712,0.00011741727,0.00084622233,0.012491289,0.0088982945,0.011611598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990903,0.0002513869,0.00007863951,0.0001444913,0.0003407154,0.00009444322],"domain_scores_gemma":[0.99834704,0.0008933971,0.000083657746,0.00029761562,0.00030105488,0.00007722561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011108577,0.0016305783,0.001455715,0.0013329668,0.0006727929,0.0024296101,0.0035854059,0.0014504596,0.041798588],"category_scores_gemma":[0.008860269,0.0011378233,0.0016204572,0.0028449125,0.00055702945,0.002227088,0.0016677236,0.0031716905,0.0108298445],"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.00037917687,0.00035281994,0.00090897316,0.0016937668,0.00017777103,0.00019611102,0.000106727726,0.33715528,0.0017926135,0.14335234,0.22277617,0.2911083],"study_design_scores_gemma":[0.00019453517,0.00003895318,0.00017633582,0.000093203256,0.000034897068,0.0000943782,0.000027687636,0.8539919,0.0025591133,0.08329414,0.059462044,0.00003285349],"about_ca_topic_score_codex":0.0040899473,"about_ca_topic_score_gemma":0.006108177,"teacher_disagreement_score":0.041798588,"about_ca_system_score_codex":0.0007704283,"about_ca_system_score_gemma":0.0022623655,"threshold_uncertainty_score":0.13983023},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020481113,0.00045155777,0.96907544,0.00044580392,0.00011028562,0.00008990217,0.00041860418,0.00035367103,0.008573442],"genre_scores_gemma":[0.24424319,0.0006245607,0.74060327,0.0003697904,0.00024007489,0.0002755277,0.002434179,0.0006177876,0.010591657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847764,0.0004378062,0.00007800706,0.00030501094,0.0005854492,0.00011604034],"domain_scores_gemma":[0.99403584,0.0044720517,0.00029000224,0.00055651146,0.0005110854,0.00013457346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016875457,0.0009562343,0.0015095903,0.001957861,0.0007151489,0.0023630476,0.0014102517,0.0014179818,0.012188879],"category_scores_gemma":[0.012783734,0.0013364104,0.0013593795,0.0026078855,0.0013634572,0.004389462,0.0022328014,0.0042776945,0.0012413734],"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.00034229536,0.00018463671,0.00079286285,0.00050399976,0.00012851914,0.0002819459,0.000306934,0.2590182,0.0032175872,0.4560371,0.021270478,0.25791547],"study_design_scores_gemma":[0.000024938512,0.00003290832,0.00020553927,0.000060811115,0.000025887743,0.000114846756,0.00006227809,0.47809327,0.0016418352,0.51488847,0.0048395284,0.000009699667],"about_ca_topic_score_codex":0.0011096157,"about_ca_topic_score_gemma":0.0021465998,"teacher_disagreement_score":0.012188879,"about_ca_system_score_codex":0.00094042975,"about_ca_system_score_gemma":0.0006084539,"threshold_uncertainty_score":0.040775895},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003915571,0.000035154495,0.99052024,0.000059659058,0.000032068114,0.00009507269,0.000050117753,0.0022347402,0.0030574144],"genre_scores_gemma":[0.10308634,0.00006876591,0.8926486,0.00009702386,0.000027295757,0.00036781316,0.00022704604,0.000649988,0.002827046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99940777,0.00010213414,0.000033679975,0.0000910596,0.00028821817,0.00007712769],"domain_scores_gemma":[0.99924207,0.00018865473,0.00007453845,0.00014470081,0.00028720795,0.00006284026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081606436,0.0009106364,0.0007360353,0.0006154619,0.0004960454,0.0009334872,0.0024137306,0.0009358846,0.010845548],"category_scores_gemma":[0.0024231432,0.00053957757,0.00066723407,0.0005858531,0.0004956616,0.00065704656,0.0013408433,0.001269789,0.0040124785],"study_design_candidate":"bench_or_experimental","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.00046594065,0.00031552493,0.002013987,0.00050087745,0.0001333308,0.00025397932,0.00027605557,0.47946897,0.06270322,0.052152846,0.014902389,0.38681296],"study_design_scores_gemma":[0.00008668705,0.000106638894,0.00016883388,0.000018196935,0.00002054428,0.000073695555,0.000020899051,0.96365964,0.02054738,0.004263114,0.011018349,0.000016052001],"about_ca_topic_score_codex":0.0011363042,"about_ca_topic_score_gemma":0.0015157394,"teacher_disagreement_score":0.010845548,"about_ca_system_score_codex":0.00045720043,"about_ca_system_score_gemma":0.0016993952,"threshold_uncertainty_score":0.036281943},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0088525405,0.0006903007,0.9846591,0.0006492833,0.0001629555,0.000025761676,0.000037923262,0.00008275362,0.004839347],"genre_scores_gemma":[0.43096304,0.0028622546,0.5197719,0.00057328236,0.0006364294,0.00030343805,0.00032158932,0.0006185554,0.043949556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940467,0.0003242607,0.000018414328,0.000068987756,0.0001511513,0.00003248111],"domain_scores_gemma":[0.99819344,0.0011541996,0.0001062631,0.00016050252,0.0002903912,0.000095275245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017794694,0.0010459018,0.0010502943,0.0010296166,0.00058069965,0.0018935095,0.00087083783,0.0012514121,0.0035632555],"category_scores_gemma":[0.009631488,0.0006216292,0.00064410164,0.001055749,0.0025998533,0.00261469,0.0021492376,0.0025529661,0.0010198419],"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.00012594038,0.000050845327,0.00033831308,0.00026803484,0.000060858183,0.000105768224,0.00013909178,0.19006412,0.0030481417,0.75854903,0.0056899823,0.0415599],"study_design_scores_gemma":[0.000014248746,0.000021822556,0.00011076111,0.000017290991,0.00000795653,0.000030335666,0.000016095519,0.69488204,0.0006894395,0.30162513,0.002574735,0.000010136244],"about_ca_topic_score_codex":0.0018048297,"about_ca_topic_score_gemma":0.001912633,"teacher_disagreement_score":0.0035632555,"about_ca_system_score_codex":0.0011033125,"about_ca_system_score_gemma":0.000935397,"threshold_uncertainty_score":0.011920273},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015735338,0.00014027668,0.9949338,0.00006472681,0.00008861587,0.000025594152,0.00006501944,0.0012506194,0.0018578352],"genre_scores_gemma":[0.044906244,0.00020974531,0.9480002,0.00016103339,0.00007981643,0.0002357924,0.0002527949,0.0014067051,0.004747705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988557,0.0004307657,0.00005582856,0.000111667396,0.00043986333,0.000106119944],"domain_scores_gemma":[0.99705815,0.0015685512,0.00016157646,0.00051707006,0.00053537067,0.00015943217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021167295,0.0016919787,0.0017050763,0.0016713525,0.0009293482,0.0020830294,0.0029916994,0.0016908676,0.021066748],"category_scores_gemma":[0.008705581,0.0011771747,0.0020249016,0.0021636134,0.0008043438,0.0029468716,0.0032346866,0.004816303,0.005762213],"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.00040999975,0.00021512217,0.0007239331,0.0004119278,0.00015615956,0.00016043813,0.00020037312,0.5487089,0.005051121,0.08387144,0.012689265,0.34740126],"study_design_scores_gemma":[0.000014343046,0.000023354603,0.000031238887,0.000022661005,0.000008869912,0.00002062049,0.000014367278,0.9841541,0.00085813156,0.010211647,0.004630068,0.000010554519],"about_ca_topic_score_codex":0.006005952,"about_ca_topic_score_gemma":0.008899318,"teacher_disagreement_score":0.021066748,"about_ca_system_score_codex":0.0009109123,"about_ca_system_score_gemma":0.0018968207,"threshold_uncertainty_score":0.07047534},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011300207,0.00019540514,0.9702472,0.0001746273,0.00009943627,0.00009698732,0.0019382432,0.017620552,0.008497493],"genre_scores_gemma":[0.027481772,0.00050892023,0.9377512,0.00036225189,0.000062744,0.0009163906,0.004657572,0.016872535,0.011386718],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994337,0.00012313681,0.000059768096,0.00006782644,0.00025834583,0.000057207664],"domain_scores_gemma":[0.997843,0.001244998,0.00012688525,0.00019609407,0.0005082879,0.00008071874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012434846,0.0012790229,0.0012237797,0.0007999727,0.00044116966,0.0015584454,0.002120964,0.0014243495,0.06617115],"category_scores_gemma":[0.005662321,0.0008163308,0.0009800853,0.00086489867,0.00053572026,0.001195018,0.0019307939,0.0033250167,0.019599713],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00024557006,0.00019754893,0.0014934755,0.0025203947,0.00023779723,0.0005546699,0.00034393612,0.29002088,0.015030397,0.13045833,0.30125594,0.257641],"study_design_scores_gemma":[0.0001592308,0.00004421857,0.00027003718,0.0001584274,0.000037827554,0.00035678715,0.000052269428,0.77923584,0.013025175,0.039545327,0.16705643,0.00005837297],"about_ca_topic_score_codex":0.002004203,"about_ca_topic_score_gemma":0.0032671168,"teacher_disagreement_score":0.06617115,"about_ca_system_score_codex":0.00039758606,"about_ca_system_score_gemma":0.0022869948,"threshold_uncertainty_score":0.2213645},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035942342,0.001099878,0.9455032,0.0007341312,0.00039954085,0.00021623756,0.00011002116,0.0030300275,0.012964651],"genre_scores_gemma":[0.32028705,0.0005303347,0.673322,0.0006992915,0.00026269438,0.0003076363,0.0004373889,0.0013260234,0.0028276402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966248,0.0015077493,0.00021892761,0.0005075154,0.00084592804,0.00029509616],"domain_scores_gemma":[0.98923767,0.004999409,0.00060172856,0.0029729982,0.0019809501,0.0002072472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052487836,0.0023163038,0.001677419,0.0016287116,0.0008196868,0.0024438074,0.0033086182,0.0016739474,0.007371332],"category_scores_gemma":[0.030665841,0.0011628479,0.001544488,0.0010927973,0.0011435128,0.0036944286,0.003400606,0.0042384365,0.0023521348],"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.0002815171,0.0004494143,0.002701282,0.00047302962,0.00023817769,0.0001345201,0.00030090052,0.6236253,0.016279422,0.026910756,0.008975065,0.31963062],"study_design_scores_gemma":[0.000024153162,0.00005437852,0.0001817984,0.00005154886,0.000047470516,0.000026056685,0.000052824984,0.98513675,0.0025704352,0.00833227,0.0035109967,0.000011225281],"about_ca_topic_score_codex":0.0024065203,"about_ca_topic_score_gemma":0.0035108412,"teacher_disagreement_score":0.007371332,"about_ca_system_score_codex":0.00096544676,"about_ca_system_score_gemma":0.0027804794,"threshold_uncertainty_score":0.027758539},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14976326,0.0068007414,0.42241693,0.074882284,0.016422613,0.0026378052,0.026851833,0.008276008,0.29194847],"genre_scores_gemma":[0.5076101,0.0014959815,0.38108397,0.00869516,0.0026541005,0.0024402454,0.03763937,0.003538787,0.054842394],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99032426,0.0041507715,0.00034537236,0.001325643,0.0025884714,0.0012654791],"domain_scores_gemma":[0.98466563,0.0074719824,0.00044116346,0.0024772917,0.0031670486,0.0017768862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015133322,0.0022000836,0.0021905329,0.001257152,0.0017548751,0.0056706397,0.003924562,0.0028185558,0.021454282],"category_scores_gemma":[0.024599595,0.0006001859,0.002416768,0.001977203,0.0016272352,0.0030786784,0.0037519382,0.0063394564,0.0033550202],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0009948276,0.0007601918,0.00071140425,0.00047128784,0.0001685581,0.0002851111,0.00010683522,0.20135738,0.0014066931,0.12600857,0.56955814,0.098171055],"study_design_scores_gemma":[0.0006630488,0.0004943571,0.0015076343,0.00026926873,0.000063076586,0.00018678942,0.0003124348,0.6548291,0.005697617,0.10083655,0.23504975,0.000090429756],"about_ca_topic_score_codex":0.0075726956,"about_ca_topic_score_gemma":0.009594891,"teacher_disagreement_score":0.021454282,"about_ca_system_score_codex":0.0047644093,"about_ca_system_score_gemma":0.006424141,"threshold_uncertainty_score":0.0800336},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024853738,0.0003479841,0.5097507,0.00018813842,0.00022831564,0.00014531972,0.0075162128,0.4684347,0.010903206],"genre_scores_gemma":[0.080496594,0.00082050625,0.63103384,0.0011851143,0.00022369635,0.0012931799,0.033219542,0.21936731,0.032360148],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99901783,0.00012613817,0.00006609624,0.00020082374,0.0003748321,0.00021426521],"domain_scores_gemma":[0.99867815,0.00057850935,0.00007457629,0.00029303326,0.00026398696,0.00011186476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001195851,0.0031674556,0.0020071846,0.0013969337,0.0010272523,0.0024194932,0.0043710144,0.0014213767,0.11012477],"category_scores_gemma":[0.00549874,0.0019823008,0.0025380708,0.0016225923,0.00092433934,0.0030119668,0.003022337,0.004953391,0.051787626],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0016616562,0.00044637607,0.0032012053,0.001840421,0.0004436345,0.00043942232,0.00036063016,0.055051558,0.009806685,0.033753,0.5965641,0.29643124],"study_design_scores_gemma":[0.0008774325,0.00013095238,0.0014207095,0.00019790593,0.00011187648,0.00027806024,0.00008692864,0.686221,0.040288452,0.066091284,0.2040575,0.00023789934],"about_ca_topic_score_codex":0.0055498197,"about_ca_topic_score_gemma":0.011135909,"teacher_disagreement_score":0.11012477,"about_ca_system_score_codex":0.0012584602,"about_ca_system_score_gemma":0.0029875266,"threshold_uncertainty_score":0.36840403},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2471818,0.000575062,0.7326786,0.00070414954,0.000044987177,0.00021301824,0.00022792337,0.00066878245,0.017705647],"genre_scores_gemma":[0.77634126,0.00038322312,0.21294537,0.00016551884,0.000049591672,0.00023113163,0.00061301904,0.0001711932,0.009099566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990214,0.00052539416,0.000019535604,0.0001026625,0.0001867281,0.00014425059],"domain_scores_gemma":[0.9984842,0.0011172257,0.00009074799,0.00012026673,0.00013619587,0.000051411567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011151423,0.00050145574,0.0010397418,0.0007503068,0.00059872813,0.00085910934,0.0012737238,0.0004523042,0.004011905],"category_scores_gemma":[0.0030698222,0.0003099207,0.0010270497,0.00094248354,0.0008776656,0.0009961777,0.001045867,0.0013455458,0.0005504408],"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.00035357822,0.0003886374,0.0017696624,0.00037642423,0.00014793861,0.00044884038,0.00026196163,0.81259435,0.0042630727,0.085857086,0.0077489754,0.08578947],"study_design_scores_gemma":[0.00012463682,0.00013350567,0.00038658013,0.000019577636,0.00004466488,0.00008451021,0.000082975916,0.94974095,0.0026085735,0.04325055,0.0035118167,0.000011619361],"about_ca_topic_score_codex":0.004497722,"about_ca_topic_score_gemma":0.0049103773,"teacher_disagreement_score":0.004497722,"about_ca_system_score_codex":0.0007150239,"about_ca_system_score_gemma":0.0010436872,"threshold_uncertainty_score":0.013421118},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15260395,0.0015931968,0.8134287,0.0013849725,0.0002941718,0.000057802965,0.00015543822,0.00014531372,0.030336356],"genre_scores_gemma":[0.857181,0.001533567,0.11843155,0.00041277835,0.0002274712,0.000112090616,0.00027704964,0.0003797767,0.021444727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996284,0.00014721874,0.000017396997,0.000071479735,0.000094766634,0.00004076562],"domain_scores_gemma":[0.9987722,0.00073974964,0.000119922726,0.00004136162,0.00020986382,0.00011689173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012806803,0.00068768766,0.0008822137,0.0019835928,0.00054667104,0.0016451307,0.0010416331,0.0011444144,0.004105246],"category_scores_gemma":[0.005185874,0.00042236852,0.00047028408,0.0011572157,0.0022146546,0.0020328949,0.001649904,0.002003402,0.0005156487],"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.000117512594,0.000050387152,0.0006881412,0.00016618845,0.00002949291,0.00011851528,0.00023869934,0.05155797,0.005217473,0.9086641,0.0030239732,0.030127542],"study_design_scores_gemma":[0.00002033492,0.00006607077,0.000621341,0.00006844453,0.000015001982,0.00013912587,0.00011178129,0.4618564,0.0017362066,0.5317895,0.0035461686,0.000029662739],"about_ca_topic_score_codex":0.0018770044,"about_ca_topic_score_gemma":0.0018014902,"teacher_disagreement_score":0.004105246,"about_ca_system_score_codex":0.0012270918,"about_ca_system_score_gemma":0.0007178683,"threshold_uncertainty_score":0.013733387},"labels":[],"label_agreement":null}]}