{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":195,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":195,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"866aad7d93e9","filters":{"venue":"Mathematical Programming"}},"results":[{"id":"W1980450998","doi":"10.1007/s10107-002-0349-3","title":"On implementing a primal-dual interior-point method for conic quadratic optimization","year":2003,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":664,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Interior point method; Conic section; Conic optimization; Quadratic equation; Mathematics; Quadratic programming; Mathematical optimization; Dual (grammatical number); Quadratic unconstrained binary optimization; Optimization problem; Extension (predicate logic); Algorithm; Computer science; Convex optimization; Geometry","authors":[{"name":"Erling D. Andersen","is_ca":false},{"name":"C. Roos","is_ca":false},{"name":"Tamás Terlaky","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06817259144325699,"gpt":0.4259764846376932,"spread":0.3578038931944362,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001647343,0.0009196089,0.001129623,0.0006030529,0.0009454465,0.001004325,0.001469717,0.001141672,0.005782886],"category_scores_gemma":[0.00397144,0.0005163309,0.0005911663,0.0009830217,0.0009133318,0.0013338,0.001679185,0.002169607,0.001601113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004510003,"about_ca_system_score_gemma":0.001029473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003599539,"about_ca_topic_score_gemma":0.004360995,"domain_scores_codex":[0.999325,0.0002575829,0.00002562631,0.0000585743,0.0002734227,0.00005978691],"domain_scores_gemma":[0.9991633,0.0003726352,0.00003918948,0.000138869,0.0002448451,0.00004114973],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003927441,0.0002574052,0.0005477981,0.000193993,0.000048468,0.0001066731,0.0001964427,0.5582108,0.008008554,0.1044054,0.005999732,0.321632],"study_design_scores_gemma":[0.00002367819,0.0000275489,0.00003244132,0.000008724744,0.000004496264,0.00001725532,0.00001158262,0.9873077,0.001383116,0.009405501,0.001772692,0.000005165731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004728652,0.00005141807,0.9913799,0.00007696392,0.00004698263,0.00003660281,0.00001350398,0.0003639069,0.003302027],"genre_scores_gemma":[0.08223605,0.0001019741,0.9137229,0.00009546362,0.00003080988,0.0001351567,0.00007347453,0.0002420419,0.003362083],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005782886,"threshold_uncertainty_score":0.01934564,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075660001","doi":"10.1007/s10107-014-0800-2","title":"On the complexity analysis of randomized block-coordinate descent methods","year":2014,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":215,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Convex function; Separable space; Block (permutation group theory); Convex optimization; Combinatorics; Coordinate descent; Rate of convergence; Convergence (economics); Function (biology); Regular polygon; Sequence (biology); Descent (aeronautics); Convex analysis; Applied mathematics; Mathematical optimization; Computer science; Mathematical analysis","authors":[{"name":"Zhaosong Lu","is_ca":true},{"name":"Lin Xiao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05267368180101976,"gpt":0.3311871699736866,"spread":0.2785134881726669,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008267175,0.002239938,0.002736044,0.001917812,0.001393267,0.003359248,0.003089527,0.002789018,0.006650513],"category_scores_gemma":[0.04935519,0.001259454,0.001634921,0.002348431,0.003697788,0.007766523,0.004730847,0.007768802,0.001069632],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003467527,"about_ca_system_score_gemma":0.004020049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004932976,"about_ca_topic_score_gemma":0.004760074,"domain_scores_codex":[0.9938149,0.0031556,0.0002223863,0.0005141101,0.001873461,0.0004194728],"domain_scores_gemma":[0.9493425,0.04294986,0.001806749,0.002309727,0.002702427,0.0008887617],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003043475,0.0001567134,0.001060026,0.0003197157,0.00009874386,0.0001035979,0.0001439271,0.3368514,0.001472077,0.6201964,0.00822258,0.03107046],"study_design_scores_gemma":[0.00002476031,0.00003304065,0.0001905877,0.00002690427,0.00001420505,0.00001904392,0.00001135391,0.8420123,0.0003054271,0.1563769,0.0009699143,0.00001542248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01048274,0.001550974,0.9782543,0.002235275,0.0002412655,0.00008903632,0.0001890597,0.0002211871,0.006736066],"genre_scores_gemma":[0.4548116,0.004925225,0.5113168,0.001812479,0.001916536,0.001483189,0.001230384,0.001334881,0.02116888],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008267175,"threshold_uncertainty_score":0.04372156,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2112079301","doi":"10.1007/s101070200296","title":"Self-regular functions and new search directions for linear and semidefinite optimization","year":2002,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":210,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Combinatorics; Degree (music); Function (biology); Upper and lower bounds; Kernel (algebra); Interior point method; Polynomial; Semidefinite programming; Discrete mathematics; Algorithm; Mathematical analysis; Mathematical optimization","authors":[{"name":"Jiming Peng","is_ca":true},{"name":"C. Roos","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1030337261159072,"gpt":0.3484202648766631,"spread":0.2453865387607559,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002241482,0.00118356,0.0009643128,0.001221795,0.0005803807,0.001391944,0.001215729,0.001545905,0.003254542],"category_scores_gemma":[0.005989776,0.0007603865,0.0008562706,0.0007592816,0.00182569,0.002956893,0.001437837,0.00282768,0.00074273],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005788018,"about_ca_system_score_gemma":0.000657821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005278587,"about_ca_topic_score_gemma":0.001023022,"domain_scores_codex":[0.9995106,0.0002597993,0.0000253236,0.00006303257,0.0001174638,0.00002371855],"domain_scores_gemma":[0.9982563,0.0009019821,0.0001613043,0.000157486,0.000386953,0.0001359705],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001276415,0.0001150842,0.0002604884,0.0002246805,0.00004418219,0.00006717757,0.0001583319,0.09089096,0.002731304,0.8342783,0.007497545,0.0636043],"study_design_scores_gemma":[0.00003857623,0.00006829792,0.00009260232,0.00004491454,0.00001544494,0.00005374583,0.00003883095,0.5026067,0.0006879062,0.4894374,0.006889701,0.00002581228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01326203,0.001457128,0.9750857,0.000948915,0.000258536,0.00003267916,0.00005641296,0.0001240229,0.008774552],"genre_scores_gemma":[0.2724754,0.003893733,0.6922397,0.001047841,0.0009300672,0.0003837307,0.0003707681,0.0005141636,0.02814451],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003254542,"threshold_uncertainty_score":0.01185423,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1530501119","doi":"10.1007/s101079900106","title":"A branch and cut algorithm for nonconvex quadratically constrained quadratic programming","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":183,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Quadratic growth; Mathematics; Tree (set theory); Linearization; Mathematical optimization; Quadratic programming; Quadratic equation; Node (physics); Quadratically constrained quadratic program; Branch and cut; Second-order cone programming; Algorithm; Linear programming; Combinatorics; Convex optimization; Nonlinear system","authors":[{"name":"Charles Audet","is_ca":false},{"name":"Pierre Hansen","is_ca":false},{"name":"Brigitte Jaumard","is_ca":true},{"name":"Gilles Savard","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03949063608831347,"gpt":0.3537206788466457,"spread":0.3142300427583322,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00144356,0.001212079,0.001778485,0.001206032,0.0009482417,0.001234931,0.001765559,0.002258352,0.007754014],"category_scores_gemma":[0.004658587,0.001009384,0.0007664801,0.001959278,0.0009093366,0.001513507,0.001865227,0.003522258,0.001608102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007934156,"about_ca_system_score_gemma":0.001783268,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003748431,"about_ca_topic_score_gemma":0.005178853,"domain_scores_codex":[0.9992907,0.0002074557,0.00002862278,0.00009681411,0.0003129761,0.00006350636],"domain_scores_gemma":[0.9983032,0.001096781,0.00006838516,0.00009839737,0.0003421851,0.00009101101],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003292231,0.0002578297,0.0003733341,0.0002246974,0.0000833788,0.0001087442,0.000111895,0.4169171,0.004449695,0.06466906,0.01577404,0.496701],"study_design_scores_gemma":[0.00005032679,0.00003601056,0.00006467827,0.00001574259,0.000009746008,0.00002209772,0.000008438965,0.9774302,0.0005657231,0.01964753,0.00214192,0.000007607512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002301384,0.0001586696,0.9951733,0.0001328611,0.0000629458,0.00005095738,0.0000451497,0.0002609335,0.001813794],"genre_scores_gemma":[0.03269897,0.0001704469,0.9636718,0.00009115249,0.00006700198,0.0002048171,0.0001824531,0.0002095059,0.002703794],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007754014,"threshold_uncertainty_score":0.02593982,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2042860556","doi":"10.1007/s10107-008-0261-6","title":"Primal-dual first-order methods with $${\\mathcal {O}(1/\\epsilon)}$$ iteration-complexity for cone programming","year":2009,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":154,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Semidefinite programming; Second-order cone programming; Linear programming; Cone (formal languages); Convex optimization; Rank (graph theory); Regular polygon; Combinatorics; Mathematical optimization; Discrete mathematics; Algorithm","authors":[{"name":"Guanghui Lan","is_ca":false},{"name":"Zhaosong Lu","is_ca":true},{"name":"Renato D. C. Monteiro","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04902607468451811,"gpt":0.3262534941219266,"spread":0.2772274194374085,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004369251,0.002529753,0.00171495,0.001080839,0.001013545,0.002637667,0.002736154,0.002194354,0.01298257],"category_scores_gemma":[0.01636166,0.000917559,0.001214336,0.001334474,0.002562608,0.003425905,0.003283538,0.008854479,0.002809998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002281171,"about_ca_system_score_gemma":0.003585122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004430411,"about_ca_topic_score_gemma":0.008190772,"domain_scores_codex":[0.9983374,0.0007364145,0.00006498906,0.000138021,0.0005909075,0.0001323313],"domain_scores_gemma":[0.9920667,0.006144964,0.0002697514,0.0005811114,0.0006896323,0.0002477726],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00033493,0.0004157904,0.000424219,0.0004741124,0.00006514291,0.0001132164,0.0001697067,0.2961376,0.001548022,0.5682063,0.01720364,0.1149075],"study_design_scores_gemma":[0.00003833136,0.00003029078,0.00005130546,0.00003229047,0.000008100727,0.00002591669,0.00001789438,0.8937531,0.0004963892,0.1030397,0.002494893,0.00001188986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002039945,0.0003683254,0.9907013,0.0006580886,0.0001494447,0.00007256313,0.00008957838,0.0002370918,0.005683643],"genre_scores_gemma":[0.08920204,0.0006511151,0.8926027,0.0004495247,0.0002763906,0.000837933,0.0002867866,0.0008298001,0.01486371],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01298257,"threshold_uncertainty_score":0.04343104,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2063761188","doi":"10.1007/s10107-013-0722-4","title":"Iterative reweighted minimization methods for $$l_p$$ l p regularized unconstrained nonlinear programming","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":141,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Lipschitz continuity; Mathematics; Minification; Sequence (biology); Convergence (economics); Iterative method; Stationary point; Combinatorics; Applied mathematics; Nonlinear system; Linear programming; Algorithm; Mathematical optimization; Mathematical analysis; Physics","authors":[{"name":"Zhaosong Lu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02348848813503768,"gpt":0.3072439672906072,"spread":0.2837554791555695,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002437649,0.001908203,0.001393882,0.000972059,0.0005773993,0.001672499,0.002442308,0.00260132,0.006233483],"category_scores_gemma":[0.009634188,0.001085022,0.001021197,0.001179254,0.001885732,0.002146362,0.002730688,0.003111875,0.001958728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009340352,"about_ca_system_score_gemma":0.001843663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003407365,"about_ca_topic_score_gemma":0.004736338,"domain_scores_codex":[0.9988772,0.0005485584,0.00004767246,0.0001759307,0.0002981467,0.00005247713],"domain_scores_gemma":[0.9971656,0.001869868,0.0001704561,0.000229984,0.000486747,0.00007725408],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009431022,0.000121297,0.0002533628,0.0005254612,0.0001081274,0.0001378454,0.0001400634,0.6840877,0.004001985,0.1662543,0.01351351,0.1307621],"study_design_scores_gemma":[0.000006506311,0.00001166719,0.00001890456,0.00001416817,0.000005233056,0.00001591287,0.000009243683,0.9807141,0.0004959094,0.01682057,0.001880638,0.000007152882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005849657,0.00009638225,0.9980508,0.0001315058,0.00003536873,0.00002161113,0.00002790074,0.00007475645,0.0009767497],"genre_scores_gemma":[0.04140506,0.0004140677,0.9490022,0.0002238658,0.000163693,0.000410675,0.0002593827,0.0004055341,0.007715438],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006233483,"threshold_uncertainty_score":0.0208531,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1965094948","doi":"10.1007/s10107-006-0039-7","title":"Reduction of symmetric semidefinite programs using the regular $$\\ast$$ -representation","year":2006,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":129,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Mathematics; Combinatorics; Semidefinite programming; Centralizer and normalizer; Bipartite graph; Matrix (chemical analysis); Order (exchange); Permutation (music); Permutation matrix; Permutation group; Upper and lower bounds; Discrete mathematics; Physics; Graph; Mathematical analysis","authors":[{"name":"Etienne de Klerk","is_ca":false},{"name":"Dmitrii V. Ṗasechnik","is_ca":false},{"name":"Alexander Schrijver","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09965246932807036,"gpt":0.3762481850279963,"spread":0.276595715699926,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007477133,0.000862722,0.0009486733,0.0006531193,0.0005938904,0.001813699,0.001225897,0.0006126325,0.008577839],"category_scores_gemma":[0.001808953,0.0003313709,0.001661551,0.0006098037,0.001141054,0.001960834,0.002059993,0.003028314,0.00191705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006811877,"about_ca_system_score_gemma":0.001084412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006621523,"about_ca_topic_score_gemma":0.0008974432,"domain_scores_codex":[0.9992762,0.0002043498,0.00002891376,0.0001144819,0.0002707544,0.0001052589],"domain_scores_gemma":[0.999562,0.0001544049,0.0000347645,0.0001046968,0.00009530547,0.00004876086],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007531278,0.0001855953,0.00008349494,0.00009300349,0.00002495097,0.00008419877,0.0001140452,0.0214873,0.002204006,0.9156582,0.01127409,0.04871596],"study_design_scores_gemma":[0.00002943379,0.0000556184,0.00006297379,0.00001364284,0.00001409301,0.00006768433,0.00004060442,0.11218,0.002078866,0.8792875,0.006153877,0.00001560673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04503731,0.0002148139,0.8838515,0.0009562363,0.0004430604,0.0001555635,0.0004238788,0.0006482268,0.0682694],"genre_scores_gemma":[0.5921814,0.0006164794,0.3425891,0.0008668072,0.000553234,0.0003904127,0.001427395,0.001385835,0.0599893],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008577839,"threshold_uncertainty_score":0.02869576,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964191135","doi":"10.1007/s10107-005-0578-3","title":"Cuts for mixed 0-1 conic programming","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":120,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Conic section; Semidefinite programming; Mathematics; Conic optimization; Linear programming; Mathematical optimization; Convex optimization; Rank (graph theory); Regular polygon; Travelling salesman problem; Quadratic programming; Combinatorics; Convex analysis; Geometry","authors":[{"name":"Mehmet Tolga Cezik","is_ca":true},{"name":"Garud Iyengar","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07451220809616238,"gpt":0.3946342440206426,"spread":0.3201220359244802,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002384134,0.001780634,0.001263398,0.002006775,0.001462884,0.003370384,0.001882965,0.001529153,0.008260891],"category_scores_gemma":[0.007855499,0.0009684708,0.0009459588,0.002250969,0.002402697,0.003473814,0.002206924,0.005295396,0.0009087261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002131881,"about_ca_system_score_gemma":0.0009717473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002133038,"about_ca_topic_score_gemma":0.002995015,"domain_scores_codex":[0.9986205,0.0005855392,0.0000519217,0.0001854852,0.0004149719,0.0001415938],"domain_scores_gemma":[0.9978492,0.001371582,0.0001879436,0.0001543166,0.0002568231,0.0001801457],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008053933,0.000034317,0.000164778,0.0001121331,0.00002138821,0.00003404144,0.00008830857,0.02145333,0.000638295,0.9395847,0.004360306,0.03342786],"study_design_scores_gemma":[0.00001703415,0.00002601104,0.0001194794,0.00003416329,0.0000110366,0.00003885889,0.0000277081,0.06315036,0.0002795394,0.9316743,0.004611312,0.00001029871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0294543,0.00146441,0.9180783,0.001033976,0.0003357121,0.0001078295,0.0003085595,0.0002751518,0.04894189],"genre_scores_gemma":[0.3488433,0.001699496,0.5943332,0.0008293212,0.0006826866,0.0005993256,0.001144672,0.0005879787,0.05127991],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008260891,"threshold_uncertainty_score":0.0276354,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116616571","doi":"10.1007/s10107-011-0459-x","title":"Nuclear norm minimization for the planted clique and biclique problems","year":2011,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":119,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Complete bipartite graph; Mathematics; Combinatorics; Bipartite graph; Clique problem; Clique; Matrix norm; Generalization; Discrete mathematics; Minification; Graph; Mathematical optimization; Line graph; Pathwidth","authors":[{"name":"Brendan Ames","is_ca":true},{"name":"Stephen A. Vavasis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04039522035801042,"gpt":0.2216688850264545,"spread":0.1812736646684441,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003277177,0.001381983,0.001926695,0.001232781,0.0009968142,0.00229636,0.002968277,0.003147675,0.005903425],"category_scores_gemma":[0.0156144,0.001027201,0.0009008556,0.001982713,0.003294548,0.004220735,0.002882087,0.004238251,0.000676272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002354746,"about_ca_system_score_gemma":0.002162471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004527499,"about_ca_topic_score_gemma":0.006285412,"domain_scores_codex":[0.9984195,0.0008413153,0.00003591126,0.000271857,0.0003166915,0.0001146168],"domain_scores_gemma":[0.9928531,0.005503605,0.0004679832,0.0002950621,0.0005222,0.0003580782],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009414746,0.0001039647,0.0003513764,0.0002450241,0.00004861136,0.00006191099,0.0001294021,0.2594862,0.0007522504,0.7115536,0.007569819,0.01960371],"study_design_scores_gemma":[0.00001809061,0.00002019509,0.0001225488,0.00002278887,0.000006302221,0.00002880749,0.00004119814,0.6255973,0.0001781498,0.3724661,0.001482957,0.00001564409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01711004,0.0006193087,0.9703078,0.002109628,0.00009957933,0.000063375,0.0003365272,0.00007628404,0.009277417],"genre_scores_gemma":[0.4093917,0.002396411,0.5488406,0.001088431,0.0007916455,0.0009752117,0.001737247,0.0005328671,0.03424605],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005903425,"threshold_uncertainty_score":0.01974893,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104417092","doi":"10.1007/s10107-011-0452-4","title":"An augmented Lagrangian approach for sparse principal component analysis","year":2011,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":110,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Sparse PCA; Principal component analysis; Mathematics; Orthogonality; Dimension (graph theory); Algorithm; Uncorrelated; Dimensionality reduction; Applied mathematics; Computer science; Pattern recognition (psychology); Combinatorics; Artificial intelligence; Statistics; Geometry","authors":[{"name":"Zhaosong Lu","is_ca":true},{"name":"Yong Zhang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05386574135832146,"gpt":0.2661403389646625,"spread":0.2122745976063411,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001248914,0.0009059954,0.001053802,0.0008160115,0.0004358258,0.001184431,0.001274034,0.001086675,0.002872517],"category_scores_gemma":[0.003565019,0.0006468543,0.000862854,0.001071346,0.001098195,0.001463132,0.001767342,0.002116847,0.0007124966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004956822,"about_ca_system_score_gemma":0.001321621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002144972,"about_ca_topic_score_gemma":0.002975113,"domain_scores_codex":[0.999494,0.0002368638,0.00001969675,0.00004932381,0.0001701643,0.00003009103],"domain_scores_gemma":[0.9989404,0.0006664029,0.00007781787,0.00007568357,0.0001954789,0.00004425315],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003562189,0.00006182313,0.0001824085,0.0001963562,0.00004486619,0.00009105766,0.00008271286,0.6013916,0.00235468,0.3202765,0.005223833,0.07005864],"study_design_scores_gemma":[0.000004202398,0.00001111441,0.00001854146,0.000007170616,0.000004282636,0.00001287411,0.000005569451,0.9656085,0.0001722473,0.03278374,0.001366943,0.000004801556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006163192,0.00007070782,0.9983621,0.00009811961,0.00001982274,0.000007820737,0.00001917676,0.00002368924,0.0007823154],"genre_scores_gemma":[0.06705213,0.0006854304,0.9253128,0.0001649743,0.0001616446,0.0002289159,0.0001977541,0.0001333368,0.006062986],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002872517,"threshold_uncertainty_score":0.00960958,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007277085","doi":"10.1007/s10107-007-0124-6","title":"Computing proximal points of nonconvex functions","year":2007,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Subgradient method; Proximal Gradient Methods; Bounded function; Lipschitz continuity; Mathematical optimization; Regular polygon; Function (biology); Convex optimization; Applied mathematics; Mathematical analysis; Geometry","authors":[{"name":"Warren Hare","is_ca":true},{"name":"Claudia Sagastizábal","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01754484837312971,"gpt":0.2718162145073227,"spread":0.254271366134193,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003272704,0.001674006,0.002331113,0.002393982,0.0008578717,0.002074282,0.001934479,0.002355682,0.003878951],"category_scores_gemma":[0.01484975,0.001610487,0.001049029,0.001345334,0.002179017,0.00269776,0.003305448,0.002781397,0.0009230926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001350963,"about_ca_system_score_gemma":0.001715785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002108754,"about_ca_topic_score_gemma":0.002840691,"domain_scores_codex":[0.9989915,0.0004349057,0.00004163534,0.0001616673,0.000275979,0.00009421655],"domain_scores_gemma":[0.9953566,0.003293465,0.0002605364,0.0002317166,0.0005637776,0.0002938966],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000392842,0.0002069897,0.001141046,0.000404827,0.0001081695,0.000165694,0.0002742788,0.7614292,0.004592224,0.1262148,0.002682743,0.1023872],"study_design_scores_gemma":[0.00002693314,0.00008904053,0.000168909,0.00002961067,0.0000166913,0.00003195335,0.0000488529,0.917621,0.002147291,0.07898521,0.0008217303,0.00001276451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02668675,0.0001915643,0.9712435,0.0001375324,0.00003451077,0.00005199628,0.00004299742,0.0001848599,0.001426325],"genre_scores_gemma":[0.3506562,0.0004649781,0.6420283,0.0000680438,0.00007884657,0.0002142861,0.0002952776,0.0003879066,0.005806265],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003878951,"threshold_uncertainty_score":0.01730788,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2016019828","doi":"10.1007/s101070100278","title":"On error bounds for lower semicontinuous functions","year":2002,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Banach space; Subderivative; Function (biology); Upper and lower bounds; Space (punctuation); Regular polygon; Normed vector space; Metric space; Pure mathematics; Convex function; Discrete mathematics; Mathematical analysis; Applied mathematics; Convex optimization; Geometry","authors":[{"name":"Zili Wu","is_ca":true},{"name":"Jane J. Ye","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03133459075991703,"gpt":0.2601535055372161,"spread":0.2288189147772991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02346814,0.00478363,0.004160792,0.005353895,0.001879805,0.006130626,0.005568291,0.005779,0.00823218],"category_scores_gemma":[0.08017739,0.001802839,0.002826075,0.004349193,0.007664478,0.01258109,0.01070687,0.01580351,0.001391504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005266225,"about_ca_system_score_gemma":0.00232114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005571954,"about_ca_topic_score_gemma":0.003056789,"domain_scores_codex":[0.9909343,0.003691013,0.0005136548,0.001102905,0.002844424,0.0009138163],"domain_scores_gemma":[0.9180068,0.06723677,0.002251999,0.003718081,0.006469704,0.002316818],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005771983,0.0002112152,0.001297708,0.0009544217,0.0002096584,0.0002518354,0.0008261199,0.1500593,0.004131104,0.7771025,0.006931085,0.05744796],"study_design_scores_gemma":[0.00003280279,0.0001164721,0.0006401644,0.0003451558,0.00007628348,0.00009745552,0.0001267329,0.4832416,0.001990837,0.5081217,0.005153092,0.00005765514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02232997,0.01141285,0.9375955,0.003269446,0.0009364318,0.00009546582,0.0002551717,0.0003150133,0.02379017],"genre_scores_gemma":[0.5417029,0.02087679,0.3678924,0.003951257,0.003377546,0.0009704095,0.00188049,0.002766552,0.05658168],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02346814,"threshold_uncertainty_score":0.1241129,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170006979","doi":"10.1007/s10107-010-0349-7","title":"An improved column generation algorithm for minimum sum-of-squares clustering","year":2010,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Column (typography); Cluster analysis; Explained sum of squares; Bottleneck; Algorithm; Column generation; Set (abstract data type); Centroid; Point (geometry); Combinatorics; Square (algebra); Euclidean space; Mathematical optimization; Computer science; Statistics; Geometry","authors":[{"name":"Daniel Aloise","is_ca":false},{"name":"Pierre Hansen","is_ca":true},{"name":"Leo Liberti","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03302216249232391,"gpt":0.335101045809392,"spread":0.3020788833170681,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001159601,0.0013974,0.00162508,0.001464652,0.001007512,0.001197399,0.002356344,0.001482266,0.006680382],"category_scores_gemma":[0.004282257,0.0007582605,0.001121118,0.002248078,0.0005750618,0.001305334,0.00165254,0.001946191,0.003642429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005814551,"about_ca_system_score_gemma":0.00183452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004198098,"about_ca_topic_score_gemma":0.006472728,"domain_scores_codex":[0.998771,0.0003660323,0.00006949514,0.0002040674,0.0004929037,0.00009645069],"domain_scores_gemma":[0.9978067,0.000796723,0.00008672343,0.0003054456,0.0009109185,0.00009346567],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004176755,0.0002183435,0.0005699699,0.0002733566,0.0001323848,0.000136743,0.0001518879,0.2388581,0.01886011,0.01491297,0.021307,0.7041615],"study_design_scores_gemma":[0.00005099477,0.00005515674,0.0001721725,0.000008438884,0.00002013929,0.00008388034,0.00001731992,0.9870062,0.004079745,0.005413801,0.00306755,0.00002456686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002446406,0.0001028646,0.9956158,0.00008537916,0.00008953609,0.00005068462,0.00007600191,0.0009261004,0.0006072658],"genre_scores_gemma":[0.02419648,0.00007065656,0.9729873,0.0001225087,0.00006430586,0.0001556695,0.0004321508,0.0002736644,0.001697276],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006680382,"threshold_uncertainty_score":0.02234805,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963292690","doi":"10.1007/s10107-013-0714-4","title":"Iterative hard thresholding methods for $$l_0$$ l 0 regularized convex cone programming","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":96,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Regular polygon; Convex optimization; Relaxation (psychology); Mathematical optimization; Quadratic programming; Sequence (biology); Convex cone; Cone (formal languages); Thresholding; Iterative method; Limit point; Interior point method; Applied mathematics; Algorithm; Convex analysis; Computer science; Mathematical analysis; Geometry; Image (mathematics); Artificial intelligence","authors":[{"name":"Zhaosong Lu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04073664706120077,"gpt":0.3230238328338438,"spread":0.282287185772643,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003192274,0.001722784,0.001456516,0.00100328,0.0005921718,0.002496455,0.002509252,0.00204849,0.005797528],"category_scores_gemma":[0.01351622,0.001025335,0.001241262,0.001295184,0.002586376,0.00239052,0.003099614,0.005043057,0.001231096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001430198,"about_ca_system_score_gemma":0.002445495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003701512,"about_ca_topic_score_gemma":0.003783921,"domain_scores_codex":[0.9985337,0.0007209682,0.00006102703,0.0001989404,0.0003921238,0.00009324591],"domain_scores_gemma":[0.9952691,0.003399751,0.000239036,0.0002321368,0.0006990158,0.0001607986],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000763504,0.0001293531,0.0002515589,0.0003846152,0.00006728627,0.0001074613,0.0001972864,0.4184717,0.002639299,0.4753771,0.01010127,0.09219667],"study_design_scores_gemma":[0.000007080496,0.00001362476,0.00002808127,0.00001824391,0.000005027791,0.000013158,0.00001355263,0.943028,0.0003760839,0.05508315,0.001404847,0.000009225158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001024027,0.0001523704,0.9961748,0.0002063242,0.00005313732,0.0000267182,0.0000318205,0.0000644773,0.00226635],"genre_scores_gemma":[0.1136646,0.0008745695,0.8681259,0.0004497761,0.0003402002,0.0005313003,0.0003295559,0.0005333551,0.01515074],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005797528,"threshold_uncertainty_score":0.0193947,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053944393","doi":"10.1007/s101070050007","title":"A branch-and-cut algorithm for the Undirected Rural Postman Problem","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":96,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algorithm; Binary number; Undirected graph; Combinatorics; Mathematical optimization; Graph; Arithmetic","authors":[{"name":"Gianpaolo Ghiani","is_ca":true},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01295668653358123,"gpt":0.2600114274650466,"spread":0.2470547409314654,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001150971,0.001229996,0.001858307,0.001208953,0.001208429,0.001372921,0.00218237,0.002274615,0.0102365],"category_scores_gemma":[0.002494635,0.0008951178,0.0008857057,0.002033645,0.000797225,0.001942057,0.00158347,0.002129437,0.001275323],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001225373,"about_ca_system_score_gemma":0.002561286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006260364,"about_ca_topic_score_gemma":0.008134841,"domain_scores_codex":[0.9995233,0.000154594,0.00001666641,0.0001096529,0.0001060909,0.00008976447],"domain_scores_gemma":[0.9989311,0.0006951186,0.00008095292,0.00006245929,0.0001329516,0.00009742881],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002027451,0.0003740473,0.0005526784,0.0001747604,0.00006758276,0.0001039498,0.0001019518,0.6915604,0.001497274,0.04527624,0.01215893,0.2479295],"study_design_scores_gemma":[0.0000619132,0.00005438851,0.00009651905,0.00001424044,0.00001666506,0.00003016983,0.00002456163,0.9734308,0.0003328321,0.02357662,0.002353496,0.000007752428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01222443,0.0002059314,0.9803004,0.0003599077,0.00006884655,0.0001637628,0.0001822723,0.0003905076,0.006103921],"genre_scores_gemma":[0.08050849,0.0002357562,0.9106948,0.0001494849,0.00006361561,0.0003164502,0.0004839569,0.0001970157,0.007350426],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0102365,"threshold_uncertainty_score":0.03424454,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2600745543","doi":"10.1007/s10107-017-1135-6","title":"Binary decision rules for multistage adaptive mixed-integer optimization","year":2017,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":91,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Scalability; Mathematical optimization; Binary number; Decision rule; Binary decision diagram; Computer science; Decision problem; Optimal decision; Optimization problem; Toolbox; Decision tree; Mathematics; Data mining; Algorithm; Artificial intelligence","authors":[{"name":"Dimitris Bertsimas","is_ca":false},{"name":"Angelos Georghiou","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1174915938561726,"gpt":0.405470753576911,"spread":0.2879791597207385,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005718672,0.001092215,0.001883307,0.000924774,0.0005036065,0.002818773,0.001876694,0.00147212,0.00402793],"category_scores_gemma":[0.0156926,0.0009895707,0.0009412465,0.001085914,0.001078375,0.002060663,0.00150251,0.002788335,0.0007482418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001044967,"about_ca_system_score_gemma":0.001170098,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002197674,"about_ca_topic_score_gemma":0.002304466,"domain_scores_codex":[0.997211,0.001431749,0.0001590235,0.0002668158,0.0007243439,0.0002070597],"domain_scores_gemma":[0.9931847,0.005175057,0.0005070951,0.0002344226,0.0006989603,0.0001996595],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001222037,0.0001392616,0.0005523273,0.0001462848,0.00006692539,0.00006226115,0.0000570268,0.8393366,0.0009576893,0.1113163,0.00150754,0.04573555],"study_design_scores_gemma":[0.00001411438,0.00001822657,0.00004478237,0.00001534377,0.000008014173,0.000007693783,0.000003590599,0.9685826,0.0002281218,0.0307266,0.0003453101,0.000005613843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01089101,0.0003098628,0.9845539,0.0002499973,0.00008688425,0.00007571301,0.00007117778,0.00007620182,0.003685403],"genre_scores_gemma":[0.5426312,0.000730177,0.4470708,0.0002719627,0.0001398588,0.0005952409,0.000322387,0.0001090229,0.00812934],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005718672,"threshold_uncertainty_score":0.03024364,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1544526981","doi":"10.1007/s101079900111","title":"A non–interior predictor–corrector path following algorithm for the monotone linear complementarity problem","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":90,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Predictor–corrector method; Interior point method; Monotone polygon; Monotonic function; Quadratic growth; Path (computing); Smoothing; Linear complementarity problem; Mathematical optimization; Convergence (economics); Complementarity (molecular biology); Applied mathematics; Algorithm; Nonlinear system; Mathematical analysis; Computer science; Geometry; Statistics","authors":[{"name":"Jim Burke","is_ca":false},{"name":"Song Xu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04868698048524479,"gpt":0.3654539087922773,"spread":0.3167669283070325,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009038067,0.0006565271,0.001073663,0.0005881896,0.0008811674,0.0007877771,0.001553517,0.001708224,0.007511001],"category_scores_gemma":[0.002895418,0.0005854548,0.0004771118,0.0007162874,0.0007027377,0.0009598534,0.001615858,0.002065524,0.001316739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006938319,"about_ca_system_score_gemma":0.002818306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004042245,"about_ca_topic_score_gemma":0.00585579,"domain_scores_codex":[0.99962,0.00009146698,0.00001906335,0.00008558734,0.0001419327,0.00004201648],"domain_scores_gemma":[0.9991193,0.000408479,0.00006720286,0.0000914332,0.0002471571,0.00006647754],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003767984,0.0002796399,0.000861666,0.000181509,0.00007273691,0.0001479786,0.000169561,0.443638,0.008781691,0.06004815,0.007967577,0.4774747],"study_design_scores_gemma":[0.00004706957,0.00004361543,0.00007744956,0.0000112598,0.00000641127,0.00003112616,0.000007851553,0.9903543,0.0009475935,0.006930633,0.001532161,0.00001052068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003803048,0.00005773833,0.9941208,0.0001026203,0.00005293508,0.00005363328,0.00002525296,0.0003736579,0.001410307],"genre_scores_gemma":[0.08809227,0.00007961877,0.9065218,0.0001162249,0.00003058707,0.0002659941,0.0001226572,0.0001461205,0.004624764],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007511001,"threshold_uncertainty_score":0.02512676,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119673940","doi":"10.1007/s10107-008-0234-9","title":"The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm","year":2008,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":84,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Travelling salesman problem; Pickup; Vertex (graph theory); Mathematics; Branch and cut; Bottleneck traveling salesman problem; Algorithm; Dimension (graph theory); Graph; Polytope; Combinatorics; Integer programming; Mathematical optimization; Computer science","authors":[{"name":"Irina Dumitrescu","is_ca":false},{"name":"Stefan Røpke","is_ca":true},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01627718973430905,"gpt":0.2294317008849779,"spread":0.2131545111506688,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003522883,0.002971921,0.004061852,0.002993619,0.002008955,0.004467258,0.004329426,0.004368691,0.009658637],"category_scores_gemma":[0.009763055,0.002813678,0.003014998,0.005961609,0.003232838,0.006441248,0.002433333,0.005773183,0.001755552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003278224,"about_ca_system_score_gemma":0.00341902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0114583,"about_ca_topic_score_gemma":0.007125769,"domain_scores_codex":[0.9981949,0.0006413171,0.00006112418,0.0002765119,0.0006294053,0.000196781],"domain_scores_gemma":[0.9963606,0.002786933,0.0002407327,0.0001328533,0.0003301725,0.0001486654],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001135224,0.0001930414,0.0002062476,0.0002321636,0.00005850388,0.00005636349,0.00008366455,0.795244,0.0004667885,0.1551543,0.006120426,0.04207089],"study_design_scores_gemma":[0.0000238968,0.00002799303,0.00005007846,0.00003887941,0.00002293524,0.00002552781,0.00002017041,0.9190938,0.0002196166,0.0786225,0.00184167,0.00001298128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003617407,0.001031496,0.9851953,0.0005012313,0.000120234,0.00009887171,0.0001263492,0.00008429473,0.009224836],"genre_scores_gemma":[0.1203651,0.004571186,0.8563206,0.0003572946,0.0004193806,0.0006432474,0.0005683586,0.0003642094,0.0163906],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0114583,"threshold_uncertainty_score":0.03231138,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005509629","doi":"10.1007/s10107-002-0370-6","title":"Approximating disjoint-path problems using packing integer programs","year":2004,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Disjoint sets; Mathematics; Bin packing problem; Combinatorics; Integer (computer science); Path (computing); Approximation algorithm; Packing problems; Vertex (graph theory); Integer programming; Discrete mathematics; Mathematical optimization; Algorithm; Computer science; Bin; Graph","authors":[{"name":"Stavros G. Kolliopoulos","is_ca":true},{"name":"Clifford Stein","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05865507247347649,"gpt":0.2737072331314133,"spread":0.2150521606579368,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002199297,0.001800108,0.002185839,0.001825357,0.0009319551,0.003349136,0.00247736,0.002049816,0.007081305],"category_scores_gemma":[0.0151786,0.001304174,0.001488001,0.003632956,0.001168211,0.008684224,0.00238716,0.003566096,0.0008050535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002228769,"about_ca_system_score_gemma":0.00161413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002982309,"about_ca_topic_score_gemma":0.004472892,"domain_scores_codex":[0.9980078,0.0006947898,0.00009157098,0.0003315426,0.0005284661,0.0003457834],"domain_scores_gemma":[0.9912845,0.006932795,0.0005267375,0.000711725,0.0003072445,0.0002370599],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004536496,0.000469961,0.001639068,0.0002974857,0.0000803123,0.00008265262,0.0001709166,0.7905889,0.001352103,0.0895649,0.006372939,0.1089271],"study_design_scores_gemma":[0.00003089202,0.00004266788,0.0001138993,0.00001616009,0.00001735538,0.00002674081,0.0000433862,0.9333862,0.0006011259,0.06467263,0.001043329,0.000005640134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1294774,0.001473473,0.8473102,0.00142149,0.0001808645,0.0001747325,0.0004493527,0.001261897,0.01825047],"genre_scores_gemma":[0.4364617,0.001074938,0.5536785,0.0002805067,0.0001861544,0.0003227593,0.001094161,0.0004908002,0.006410656],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007081305,"threshold_uncertainty_score":0.02368933,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1996676734","doi":"10.1007/s10107-013-0633-4","title":"On solving simple bilevel programs with a nonconvex lower level program","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Mathematical optimization; Bilevel optimization; Limit point; Smoothing; Stationary point; Constraint (computer-aided design); Feasible region; Convex optimization; Sequence (biology); Limit (mathematics); Interior point method; Variational inequality; Optimization problem; Regular polygon; Bounded function; Simple (philosophy); Penalty method; Limit of a sequence","authors":[{"name":"Gui-Hua Lin","is_ca":false},{"name":"Mengwei Xu","is_ca":false},{"name":"Jane J. Ye","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03310765846871954,"gpt":0.2614845383108118,"spread":0.2283768798420922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002064913,0.00138958,0.001775226,0.0007026269,0.0007249207,0.001891523,0.001395506,0.002255389,0.005514376],"category_scores_gemma":[0.00932856,0.001055966,0.001266153,0.001413101,0.002087611,0.00287218,0.00350551,0.002873906,0.0005570695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007955218,"about_ca_system_score_gemma":0.001010543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002151273,"about_ca_topic_score_gemma":0.002571686,"domain_scores_codex":[0.9991006,0.0004534419,0.00003713618,0.0001321474,0.0002043805,0.00007227351],"domain_scores_gemma":[0.9971197,0.002328058,0.0001340505,0.0001555155,0.0001544805,0.0001082316],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009633649,0.000159046,0.0003417954,0.0002755549,0.00004954393,0.00008692784,0.000162253,0.7404262,0.001307674,0.213715,0.00236713,0.04101242],"study_design_scores_gemma":[0.00001170058,0.00002986413,0.00003389824,0.00001283816,0.000005879827,0.00001062343,0.00001322211,0.9350828,0.0001774813,0.06388531,0.0007309836,0.000005459984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01450419,0.0001882465,0.9769531,0.0004036672,0.00005929629,0.00007495932,0.00004643601,0.0001000414,0.00766998],"genre_scores_gemma":[0.3196015,0.0005883798,0.6636315,0.0003958597,0.0001797869,0.0005024292,0.0002115291,0.0003848578,0.01450418],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005514376,"threshold_uncertainty_score":0.01844746,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159874655","doi":"10.1007/s10107-013-0735-z","title":"First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Complementarity (molecular biology); Cone (formal languages); Second-order cone programming; Stationary point; Complementarity theory; Positive-definite matrix; Limiting; Mathematical optimization; Applied mathematics; Semidefinite programming; Mathematical analysis; Algorithm; Regular polygon; Convex optimization; Geometry; Nonlinear system","authors":[{"name":"Chao Ding","is_ca":false},{"name":"Defeng Sun","is_ca":false},{"name":"Jane J. Ye","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0369526614574933,"gpt":0.2794488674892481,"spread":0.2424962060317548,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003810283,0.002531754,0.001764665,0.002400722,0.001259073,0.004584034,0.00175557,0.002228284,0.01348905],"category_scores_gemma":[0.01154894,0.00137109,0.001585086,0.001848335,0.002992243,0.005308438,0.00193214,0.007761954,0.002048074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002604183,"about_ca_system_score_gemma":0.004332084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003477462,"about_ca_topic_score_gemma":0.004183489,"domain_scores_codex":[0.9981668,0.0005582462,0.0001106633,0.0002674877,0.0005997436,0.0002970577],"domain_scores_gemma":[0.9908896,0.006195677,0.0006366677,0.0002827995,0.001624965,0.0003702053],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004680292,0.0001093337,0.0001382259,0.0002332655,0.00002064206,0.0001145432,0.0002334932,0.05791335,0.002074257,0.9251007,0.004390125,0.009625213],"study_design_scores_gemma":[0.00003517821,0.00007441805,0.0002191258,0.0001229812,0.00002084755,0.00009686996,0.0001130139,0.3152808,0.002108454,0.6760441,0.005840315,0.00004388998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01709412,0.0008485169,0.9276854,0.001229619,0.0002983666,0.0001878692,0.0007546183,0.0001801599,0.05172141],"genre_scores_gemma":[0.5720803,0.004136856,0.3670968,0.00121866,0.000988147,0.001523729,0.002405562,0.001090325,0.0494595],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01348905,"threshold_uncertainty_score":0.04512531,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2028549267","doi":"10.1007/s10107-010-0380-8","title":"LP-based approximation algorithms for capacitated facility location","year":2010,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":63,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Facility location problem; Linear programming relaxation; Rounding; Approximation algorithm; 1-center problem; Set (abstract data type); Theory of computation; Mathematics; Linear programming; Relaxation (psychology); Metric space; Mathematical optimization; Metric (unit); Constant (computer programming); Computer science; Algorithm; Discrete mathematics","authors":[{"name":"Retsef Levi","is_ca":false},{"name":"David B. Shmoys","is_ca":false},{"name":"Chaitanya Swamy","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0454707412042015,"gpt":0.270299497597183,"spread":0.2248287563929815,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004071536,0.001902957,0.002958786,0.00168729,0.0009907287,0.003018216,0.004395025,0.003070772,0.007718015],"category_scores_gemma":[0.01548868,0.001735394,0.001567001,0.003347392,0.001695745,0.003788561,0.002536688,0.005362208,0.001348868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00380572,"about_ca_system_score_gemma":0.003182683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01290093,"about_ca_topic_score_gemma":0.008926773,"domain_scores_codex":[0.9981045,0.0009727222,0.00007840757,0.0002403667,0.0003808712,0.0002231876],"domain_scores_gemma":[0.9893185,0.008495176,0.0004383221,0.0004480474,0.000977351,0.0003225391],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009533324,0.00009641193,0.0002121063,0.00009104503,0.00003561001,0.00002239556,0.00004827693,0.9441409,0.0001958924,0.02316416,0.002956676,0.02894118],"study_design_scores_gemma":[0.000008924533,0.000007581351,0.00001690656,0.000006286366,0.000004202982,0.000003913913,0.00000712972,0.9905612,0.00005957527,0.009081434,0.00023964,0.000003123442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004461269,0.0003619878,0.9918013,0.0003361058,0.00006570682,0.00003313157,0.000104396,0.0002933349,0.002542713],"genre_scores_gemma":[0.2840198,0.0008298551,0.7048551,0.0003781581,0.0002668436,0.00055996,0.0008280065,0.0004438814,0.007818376],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01290093,"threshold_uncertainty_score":0.02761263,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971200627","doi":"10.1007/s10107-003-0484-5","title":"Generalized pattern searches with derivative information","year":2003,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":60,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Iterated function; Polling; Function (biology); Mathematics; Convergence (economics); Mathematical optimization; Derivative (finance); Pattern search; Global Positioning System; Algorithm; Computer science","authors":[{"name":"Mark A. Abramson","is_ca":false},{"name":"Charles Audet","is_ca":true},{"name":"J. E. Dennis","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0657266595787926,"gpt":0.3467628791557739,"spread":0.2810362195769813,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001274249,0.0006014835,0.001718979,0.001223765,0.0005567162,0.001351387,0.001806788,0.001763613,0.008337486],"category_scores_gemma":[0.007807274,0.0007206959,0.0007577546,0.002142467,0.001009183,0.003471123,0.002364271,0.001255098,0.001151953],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000391501,"about_ca_system_score_gemma":0.0007611818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005658096,"about_ca_topic_score_gemma":0.001035546,"domain_scores_codex":[0.9992798,0.000282819,0.0000394404,0.0001152153,0.0002194256,0.00006336554],"domain_scores_gemma":[0.9982224,0.0008588628,0.0001129138,0.0005310194,0.0002005504,0.00007429627],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000730239,0.0001954885,0.001771742,0.0004769965,0.0002211137,0.0003219886,0.0001577962,0.2203289,0.007434571,0.3728541,0.01022586,0.3852812],"study_design_scores_gemma":[0.00009066155,0.00007070668,0.0002105762,0.00002059152,0.00003017416,0.0001341241,0.00002355901,0.7653481,0.001740418,0.2301252,0.002190422,0.00001546369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04240591,0.0004360541,0.9478039,0.0004096338,0.0001240493,0.00007052707,0.0001043865,0.0004934053,0.008152175],"genre_scores_gemma":[0.4313684,0.0003320815,0.554927,0.0003685525,0.0001088155,0.0002214483,0.0002850873,0.0003954357,0.01199325],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008337486,"threshold_uncertainty_score":0.0278917,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115871049","doi":"10.1007/s10107-002-0365-3","title":"Multiobjective optimization problem with variational inequality constraints","year":2003,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Variational inequality; Mathematical optimization; Inequality; Numerical analysis; Multi-objective optimization; Variational analysis; Applied mathematics; Mathematical economics; Mathematical analysis","authors":[{"name":"Jane J. Ye","is_ca":true},{"name":"Qiji Jim Zhu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01709248525124503,"gpt":0.2509153616108618,"spread":0.2338228763596167,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001883031,0.001331681,0.001637636,0.0009418408,0.0006176676,0.00204694,0.001562965,0.002467255,0.003673572],"category_scores_gemma":[0.003739831,0.0008078711,0.0009832226,0.001424784,0.0008950543,0.001874175,0.002389185,0.001582972,0.0004426716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000953639,"about_ca_system_score_gemma":0.0009829374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00132583,"about_ca_topic_score_gemma":0.00119163,"domain_scores_codex":[0.9990937,0.0003322926,0.00004229161,0.0001735711,0.0002799052,0.00007835493],"domain_scores_gemma":[0.9991065,0.0005659509,0.0001014377,0.0000486945,0.0001198121,0.00005757083],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007960848,0.00009347372,0.0003536277,0.0002857237,0.0001202201,0.0002518083,0.00006518407,0.794762,0.004688161,0.1479297,0.002722187,0.04864839],"study_design_scores_gemma":[0.00001772806,0.00003979159,0.0001356932,0.00002443947,0.00002088689,0.00005778219,0.00001428244,0.9533873,0.001116993,0.04286921,0.002304841,0.00001097124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009854377,0.0004650787,0.981576,0.0003996856,0.00009121848,0.00004650914,0.0001056423,0.00005507433,0.007406494],"genre_scores_gemma":[0.4757987,0.0008704435,0.5007185,0.0003591421,0.0001961392,0.0004810019,0.0003359889,0.0002250347,0.02101503],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003673572,"threshold_uncertainty_score":0.01228935,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017712277","doi":"10.1007/pl00011408","title":"On the generic properties of convex optimization problems in conic form","year":2001,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":56,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Conic optimization; Conic section; Convex analysis; Regular polygon; Complementarity (molecular biology); Subderivative; Convex optimization; Convex set; Mathematical optimization; Geometry","authors":[{"name":"Gábor Pataki","is_ca":false},{"name":"Levent Tunçel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1177119500563265,"gpt":0.2917388044788278,"spread":0.1740268544225013,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006661294,0.001824825,0.002687543,0.003504851,0.002464397,0.004853033,0.002579749,0.003130568,0.005907318],"category_scores_gemma":[0.02118238,0.000987211,0.003117672,0.005925778,0.008975197,0.01454065,0.005366288,0.009210597,0.0008088964],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002551145,"about_ca_system_score_gemma":0.001110582,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001700751,"about_ca_topic_score_gemma":0.001187098,"domain_scores_codex":[0.997407,0.0009295382,0.000170718,0.0005458129,0.0006384819,0.0003083495],"domain_scores_gemma":[0.9885691,0.007328819,0.001202228,0.001106642,0.001129847,0.0006633442],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009420407,0.000007869979,0.0001004603,0.00003362845,0.000007873162,0.00002913558,0.00007165565,0.002429473,0.0001220661,0.9938996,0.0006690002,0.002619929],"study_design_scores_gemma":[0.000008305242,0.00001335624,0.0001689521,0.00002060313,0.000009687954,0.00005947617,0.00004271099,0.01613549,0.0001067967,0.9814301,0.001995435,0.00000919189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06525591,0.004508927,0.8361481,0.005457999,0.0002618397,0.0001241605,0.0005343944,0.0002364356,0.08747225],"genre_scores_gemma":[0.7919317,0.01096265,0.1712141,0.001883507,0.001848979,0.0005081814,0.00119716,0.00052388,0.01992984],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006661294,"threshold_uncertainty_score":0.03522873,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2061237693","doi":"10.1007/s10107-005-0649-5","title":"Independent packings in structured graphs","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; Wilfrid Laurier University","funders":"","keywords":"Chordal graph; Combinatorics; Indifference graph; Pathwidth; Mathematics; Cograph; Clique-sum; Split graph; 1-planar graph; Maximal independent set; Modular decomposition; Disjoint sets; Discrete mathematics; Interval graph; Treewidth; Partial k-tree; Graph; Line graph","authors":[{"name":"Kathie Cameron","is_ca":true},{"name":"Pavol Hell","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02153618353391824,"gpt":0.3025726694849464,"spread":0.2810364859510282,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00113807,0.0009032221,0.0014403,0.00280279,0.001916987,0.004409209,0.001889388,0.002214507,0.008522787],"category_scores_gemma":[0.008069434,0.002237722,0.001457289,0.00390013,0.002858932,0.007931883,0.002706013,0.00390689,0.001259595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001126811,"about_ca_system_score_gemma":0.000590687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000705414,"about_ca_topic_score_gemma":0.001130412,"domain_scores_codex":[0.998852,0.0003676076,0.00006571654,0.0002163751,0.000338278,0.0001599914],"domain_scores_gemma":[0.9936941,0.00405974,0.0009184103,0.000509718,0.0003333405,0.00048465],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004752861,0.00006972908,0.0004031584,0.0000946503,0.00002342815,0.0001134694,0.0003376452,0.01375525,0.0005110442,0.9690699,0.003667235,0.01190695],"study_design_scores_gemma":[0.0000120045,0.00001190977,0.000117427,0.00001579465,0.00001118448,0.00006431706,0.00007970171,0.03169609,0.000232189,0.9666857,0.001067586,0.000006193667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3506495,0.00115236,0.5818549,0.002244528,0.0002609834,0.0001741732,0.0005350356,0.0005171574,0.06261131],"genre_scores_gemma":[0.7716635,0.001588158,0.1858468,0.0007713171,0.0006192485,0.0003811592,0.001356688,0.0005100138,0.03726307],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008522787,"threshold_uncertainty_score":0.02851152,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068133968","doi":"10.1007/s10107-006-0009-0","title":"Active-constraint variable ordering for faster feasibility of mixed integer linear programs","year":2006,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":56,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; Nortel (Canada)","funders":"","keywords":"Mathematics; Integer (computer science); Integer programming; Variable (mathematics); Constraint (computer-aided design); Linear programming; Mathematical optimization; Numerical analysis; Combinatorics; Discrete mathematics; Applied mathematics; Computer science; Mathematical analysis; Geometry","authors":[{"name":"Jagat Patel","is_ca":true},{"name":"John W. Chinneck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08992158410743467,"gpt":0.371748535160172,"spread":0.2818269510527374,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003335945,0.001839431,0.001462028,0.001823661,0.001067649,0.002319151,0.001771274,0.0008499766,0.01817049],"category_scores_gemma":[0.01129321,0.0009590348,0.001003411,0.002649366,0.0009168049,0.00387679,0.001694523,0.004581421,0.00252767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008259097,"about_ca_system_score_gemma":0.002370088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00304759,"about_ca_topic_score_gemma":0.006433477,"domain_scores_codex":[0.9978359,0.001047639,0.0001228312,0.0001702862,0.000566888,0.0002563183],"domain_scores_gemma":[0.992587,0.004881821,0.0003168339,0.000912926,0.001084929,0.0002164522],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00134621,0.0005433627,0.0006827036,0.0006531673,0.00007207945,0.0001855345,0.0002584045,0.1942118,0.01331434,0.2493811,0.01673098,0.5226204],"study_design_scores_gemma":[0.0002004719,0.0001456629,0.0001581178,0.00008712922,0.00003331394,0.00005212095,0.00006013393,0.8603231,0.00897588,0.1196122,0.01032036,0.00003152194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009736371,0.0002775861,0.9808624,0.0002267206,0.0001628766,0.0001417367,0.000214105,0.0009310725,0.00744707],"genre_scores_gemma":[0.1103197,0.0002411142,0.8843786,0.000190822,0.0001074229,0.0002659439,0.000612238,0.0006291262,0.003254977],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01817049,"threshold_uncertainty_score":0.06078643,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083246371","doi":"10.1007/s10107-013-0703-7","title":"New approaches to multi-objective optimization","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Matroid; Mathematics; Mathematical optimization; Matching (statistics); Spanning tree; Bipartite graph; Approximation algorithm; Rounding; Combinatorics; Computer science; Graph","authors":[{"name":"Fabrizio Grandoni","is_ca":false},{"name":"R. Ravi","is_ca":false},{"name":"Mohit Singh","is_ca":true},{"name":"Rico Zenklusen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1149013214391176,"gpt":0.2635967916886539,"spread":0.1486954702495363,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002290973,0.001741847,0.001565109,0.001981143,0.0006986424,0.003114387,0.002896252,0.001482538,0.005479633],"category_scores_gemma":[0.007463758,0.0009144738,0.001706965,0.002410975,0.001992721,0.005542716,0.002822292,0.00556162,0.0008338836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001828611,"about_ca_system_score_gemma":0.001064921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001104784,"about_ca_topic_score_gemma":0.001779336,"domain_scores_codex":[0.9983503,0.0006506655,0.00007369098,0.0002123656,0.0006438789,0.00006917077],"domain_scores_gemma":[0.9963708,0.00253031,0.0002651435,0.0002933413,0.0004055552,0.0001349298],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002442565,0.00007737062,0.0002425929,0.0003061098,0.00009430575,0.00004167448,0.0001031616,0.1662533,0.0006542691,0.7741138,0.00483876,0.05325031],"study_design_scores_gemma":[0.00001372807,0.00001398364,0.00008585924,0.00003649383,0.00002135156,0.00002973547,0.00002399048,0.4321668,0.0001987522,0.5588407,0.008554425,0.0000142622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001630868,0.00193111,0.9891129,0.0008395584,0.0002351777,0.00002093547,0.0000381262,0.00005034545,0.006141104],"genre_scores_gemma":[0.1178921,0.007280678,0.8563565,0.0009727235,0.00215114,0.0003605907,0.0002107897,0.0002745907,0.01450083],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005479633,"threshold_uncertainty_score":0.01833123,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2559883687","doi":"10.1007/s10107-016-1095-2","title":"A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables","year":2016,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Office of the Secretary of Defense; Air Force Office of Scientific Research; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Semidefinite programming; Bounded function; Quadratically constrained quadratic program; Mathematical optimization; Quadratic growth; Quadratic programming; Hermitian matrix; Rank (graph theory); Feasible region; Second-order cone programming; Trust region; Constraint (computer-aided design); Convex optimization; Regular polygon; Algorithm; Combinatorics; Computer science","authors":[{"name":"Chen Chen","is_ca":false},{"name":"Alper Atamtürk","is_ca":false},{"name":"Shmuel S. Oren","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07666032763318521,"gpt":0.3906559550134406,"spread":0.3139956273802554,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001156788,0.0009260689,0.001266848,0.0006241198,0.0004856694,0.001139453,0.001327663,0.001851209,0.007971744],"category_scores_gemma":[0.002256212,0.0005418904,0.0007476755,0.0009352468,0.0007844599,0.001095489,0.001679891,0.002048513,0.0008446428],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000692546,"about_ca_system_score_gemma":0.00166104,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003191205,"about_ca_topic_score_gemma":0.003796482,"domain_scores_codex":[0.9997109,0.0001010754,0.00001084556,0.00003718843,0.0001140847,0.0000259091],"domain_scores_gemma":[0.9992119,0.0004697334,0.00003681539,0.00003914761,0.0001881829,0.00005419977],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001635027,0.0001054491,0.0002347005,0.000348671,0.00006301174,0.0001310965,0.00008086533,0.7698966,0.004163825,0.1009257,0.01063819,0.1132483],"study_design_scores_gemma":[0.000008760125,0.00001260869,0.00001486926,0.000008983983,0.000004041424,0.000009471646,0.000004589196,0.9928365,0.0001525909,0.005986508,0.0009578782,0.000003156241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001480859,0.0001930138,0.9949222,0.0001667163,0.00007443432,0.00003228441,0.0000438253,0.00006297856,0.003023595],"genre_scores_gemma":[0.1202794,0.0007058608,0.8672884,0.0004075528,0.0002229358,0.0004197641,0.0002801649,0.0002818059,0.01011418],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007971744,"threshold_uncertainty_score":0.02666813,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069154666","doi":"10.1007/s10107-012-0594-z","title":"Improved semidefinite bounding procedure for solving Max-Cut problems to optimality","year":2012,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Bounding overwatch; Semidefinite programming; Mathematics; Embedding; Maximum cut; Quadratic programming; Semidefinite embedding; Quadratic equation; Regularization (linguistics); Relaxation (psychology); Mathematical optimization; Upper and lower bounds; Algorithm; Quadratically constrained quadratic program; Computer science; Combinatorics","authors":[{"name":"Nathan Krislock","is_ca":true},{"name":"Jérôme Malick","is_ca":false},{"name":"Frédéric Roupin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09471068804463127,"gpt":0.3899677218371838,"spread":0.2952570337925525,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003722232,0.002163315,0.001769435,0.00136658,0.0008913675,0.0020076,0.002434095,0.001797755,0.01124417],"category_scores_gemma":[0.009795479,0.0009685825,0.001392371,0.001669814,0.001325775,0.00219952,0.002520617,0.005889762,0.002520187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001172161,"about_ca_system_score_gemma":0.002060988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002664533,"about_ca_topic_score_gemma":0.003432945,"domain_scores_codex":[0.9981256,0.0007705016,0.00007103844,0.0002125832,0.0006781365,0.0001421931],"domain_scores_gemma":[0.9957234,0.002574342,0.0001693201,0.0005620272,0.0008259808,0.0001450134],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003042732,0.0003663121,0.0003168531,0.0004769668,0.0001038693,0.0001993604,0.0002581218,0.5417978,0.01092601,0.2481619,0.02043219,0.1766565],"study_design_scores_gemma":[0.00001724258,0.00002284046,0.00005444592,0.00002521383,0.000009603112,0.0000293309,0.000008559466,0.9594752,0.001481811,0.0367714,0.002093699,0.00001067215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001089299,0.00008139182,0.9958642,0.00007541906,0.00004250174,0.00003148372,0.00005242787,0.0002144546,0.002548747],"genre_scores_gemma":[0.09317889,0.0003063093,0.8963793,0.0002836417,0.0001159453,0.0005403737,0.0004408465,0.0006538008,0.008100918],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01124417,"threshold_uncertainty_score":0.03761554,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2117319367","doi":"10.1007/s10107-011-0497-4","title":"Improved lower bounds and exact algorithm for the capacitated arc routing problem","year":2011,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Arc routing; Column generation; Bounding overwatch; Benchmark (surveying); Mathematical optimization; Mathematics; Undirected graph; Set (abstract data type); Upper and lower bounds; Algorithm; Vehicle routing problem; Arc (geometry); Routing (electronic design automation); Graph; Computer science; Combinatorics; Artificial intelligence","authors":[{"name":"Enrico Bartolini","is_ca":true},{"name":"Jean-François Cordeau","is_ca":true},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03169759203907864,"gpt":0.258755181753461,"spread":0.2270575897143823,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003196622,0.002276201,0.00207285,0.002548871,0.001041078,0.003917069,0.004580826,0.00255753,0.01646158],"category_scores_gemma":[0.01437723,0.001302192,0.001674819,0.003726151,0.001440621,0.005193988,0.003117798,0.005986896,0.003415245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003306512,"about_ca_system_score_gemma":0.003636626,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005464592,"about_ca_topic_score_gemma":0.007044054,"domain_scores_codex":[0.9968816,0.0008705944,0.0001210844,0.0004295064,0.00131343,0.0003838234],"domain_scores_gemma":[0.9940124,0.003629848,0.0002578581,0.0009573814,0.0009732467,0.0001692998],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003586181,0.0003906994,0.0003898331,0.0003214222,0.00008047476,0.00007153097,0.0001446623,0.6220709,0.002603433,0.1372105,0.0198993,0.2164587],"study_design_scores_gemma":[0.00004932966,0.00003346679,0.0001085068,0.00002959852,0.00001879623,0.00003096123,0.00001701059,0.9423397,0.0007982882,0.05297862,0.003578509,0.00001716877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005524793,0.0007915018,0.9807755,0.0004609822,0.0002274604,0.00007509244,0.0001917622,0.000870471,0.01108248],"genre_scores_gemma":[0.1210908,0.0009563486,0.8645887,0.0004054994,0.0003824787,0.0004830007,0.0007652846,0.0007689095,0.01055893],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01646158,"threshold_uncertainty_score":0.05506945,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2287259016","doi":"10.1007/s10107-015-0965-3","title":"A family of second-order methods for convex $$\\ell _1$$-regularized optimization","year":2015,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; Google; U.S. Department of Energy; National Science Foundation","keywords":"Orthant; Mathematics; Mathematical optimization; Proximal gradient methods for learning; Regularization (linguistics); Convex function; Regular polygon; Convex optimization; Applied mathematics; Algorithm; Subderivative; Computer science; Artificial intelligence","authors":[{"name":"Richard H. Byrd","is_ca":false},{"name":"Gillian M. Chin","is_ca":false},{"name":"Jorge Nocedal","is_ca":false},{"name":"Figen Öztoprak","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05664813614882776,"gpt":0.3321507346713604,"spread":0.2755025985225327,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003137779,0.002846253,0.001790348,0.001770321,0.0007076579,0.001929847,0.002805631,0.002846434,0.005861186],"category_scores_gemma":[0.0082468,0.001169471,0.002636102,0.001812689,0.002071859,0.002159005,0.003397042,0.006436788,0.003035683],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001055447,"about_ca_system_score_gemma":0.002055346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00246148,"about_ca_topic_score_gemma":0.00407951,"domain_scores_codex":[0.9984832,0.0007021769,0.00007327511,0.0001655594,0.0004984086,0.00007737136],"domain_scores_gemma":[0.9973168,0.001526513,0.0001729512,0.000323405,0.0004904809,0.0001698017],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001434479,0.0001764009,0.0003465551,0.0007628885,0.0001904101,0.0001259652,0.0001981224,0.2760501,0.00674636,0.4973283,0.02673999,0.1911915],"study_design_scores_gemma":[0.00001451646,0.0000485477,0.00006107316,0.00004641396,0.00001779011,0.00005858635,0.000015539,0.9311756,0.001162802,0.05405569,0.01331801,0.00002551686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003540506,0.0003415885,0.9972073,0.0001768618,0.0001269263,0.00002721506,0.00005236762,0.00009645972,0.001617029],"genre_scores_gemma":[0.02747015,0.001899245,0.9496026,0.0005458233,0.0004888845,0.0005161766,0.0003806278,0.0007467424,0.01834974],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005861186,"threshold_uncertainty_score":0.01960766,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3124850851","doi":"10.1007/s10107-002-0328-8","title":"Easy and difficult objective functions for max cut","year":2003,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Orthant; Mathematics; Combinatorics; Maximum cut; Function (biology); Sign (mathematics); Matching (statistics); Key (lock); Boundary (topology); Basis (linear algebra); Discrete mathematics; Graph; Mathematical analysis; Computer science; Statistics; Geometry","authors":[{"name":"S. Thomas McCormick","is_ca":true},{"name":"M. R. Rao","is_ca":false},{"name":"Giovanni Rinaldi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01349676825050008,"gpt":0.2318726012653425,"spread":0.2183758330148425,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003449066,0.001967537,0.001094626,0.001296233,0.001079601,0.002811446,0.001672032,0.001884322,0.009800022],"category_scores_gemma":[0.01264973,0.0009445867,0.001076841,0.001492918,0.001819915,0.005754023,0.002325273,0.005162787,0.001309881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009203834,"about_ca_system_score_gemma":0.0006744965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006902323,"about_ca_topic_score_gemma":0.0007613047,"domain_scores_codex":[0.9984888,0.0006721338,0.00005780749,0.000182572,0.0004625746,0.0001361214],"domain_scores_gemma":[0.994393,0.004311988,0.0003146002,0.0004528093,0.0003592089,0.0001684497],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002653002,0.0001692852,0.0007991312,0.0005587381,0.00005643819,0.0001806634,0.0002051212,0.1317244,0.002619332,0.667149,0.0233052,0.1729674],"study_design_scores_gemma":[0.00002723283,0.00004641862,0.0003443735,0.00008386924,0.00001980595,0.0001496675,0.00006237676,0.232107,0.001434181,0.7585444,0.00715152,0.00002907241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01830169,0.002010999,0.9549553,0.001725682,0.0002800544,0.00008813994,0.0002914495,0.000365402,0.02198129],"genre_scores_gemma":[0.3802423,0.002610124,0.5829161,0.0007873263,0.0009799018,0.0005305651,0.000944279,0.001106423,0.02988301],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009800022,"threshold_uncertainty_score":0.03278434,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2057459863","doi":"10.1007/s10107-008-0254-5","title":"Multi-phase dynamic constraint aggregation for set partitioning type problems","year":2008,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Constraint (computer-aided design); Disjoint sets; Computation; Relaxation (psychology); Set (abstract data type); Computer science; Mathematics; Local consistency; Scheduling (production processes); Algorithm; Constraint satisfaction problem; Probabilistic logic","authors":[{"name":"Issmail Elhallaoui","is_ca":true},{"name":"Abdelmoutalib Metrane","is_ca":true},{"name":"François Soumis","is_ca":true},{"name":"Guy Desaulniers","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06582903588106113,"gpt":0.3370300050388169,"spread":0.2712009691577557,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002353491,0.001015165,0.001433397,0.0009245186,0.0008500261,0.001754878,0.001559451,0.001013657,0.003651099],"category_scores_gemma":[0.004848335,0.0009834606,0.001023114,0.002114562,0.0006306881,0.002647098,0.001906654,0.001548033,0.0002855329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009562693,"about_ca_system_score_gemma":0.001006868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002742024,"about_ca_topic_score_gemma":0.003796608,"domain_scores_codex":[0.9989284,0.0005170565,0.00004531669,0.0001470231,0.0002566249,0.0001055225],"domain_scores_gemma":[0.9980978,0.001295831,0.0001686364,0.0001669425,0.000208662,0.00006208071],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007080337,0.00006268394,0.0002117478,0.0001135815,0.00004802121,0.00006066151,0.00006472829,0.9211106,0.001286057,0.03794512,0.0017306,0.03729537],"study_design_scores_gemma":[0.000009072844,0.00001859879,0.00005459558,0.000007955251,0.000007267058,0.00001393936,0.00001219992,0.9862293,0.0003799412,0.01254779,0.0007150859,0.00000432094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008578612,0.0001738776,0.9885937,0.0001373961,0.00003476782,0.00005671322,0.0000623,0.00005337946,0.002309318],"genre_scores_gemma":[0.3751153,0.000468847,0.6179766,0.0001721938,0.0001082985,0.0004404704,0.0004176892,0.0001681097,0.005132487],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003651099,"threshold_uncertainty_score":0.01244658,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1936234780","doi":"10.1007/s10107-013-0733-1","title":"Convex optimization for the planted k-disjoint-clique problem","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Disjoint sets; Mathematics; Combinatorics; Clique; Cluster analysis; Partition (number theory); Discrete mathematics","authors":[{"name":"Brendan Ames","is_ca":false},{"name":"Stephen A. Vavasis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01551004089108949,"gpt":0.2234298615200835,"spread":0.207919820628994,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002979068,0.001747856,0.002276352,0.0009951784,0.0008069797,0.002519963,0.003323807,0.002818398,0.007349325],"category_scores_gemma":[0.01466301,0.001160542,0.001168709,0.00211476,0.002589006,0.004421868,0.002575909,0.004202854,0.0009046781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002540173,"about_ca_system_score_gemma":0.002285821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005338043,"about_ca_topic_score_gemma":0.006912726,"domain_scores_codex":[0.9983879,0.0007912889,0.00004422045,0.0003360415,0.00029325,0.000147252],"domain_scores_gemma":[0.991868,0.006668621,0.0004369362,0.0003244279,0.0004265598,0.0002754768],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001631379,0.0001757257,0.0005156469,0.0004457484,0.00009775217,0.0001314159,0.0001175754,0.6667061,0.001039123,0.2939577,0.01327936,0.02337071],"study_design_scores_gemma":[0.00002452825,0.00001626695,0.0001174288,0.00001988658,0.000009526098,0.00002778342,0.00002993351,0.8712849,0.0001563267,0.1272399,0.001063491,0.00001001718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01199312,0.0006746595,0.9763997,0.001935738,0.00009826358,0.00008177441,0.000564316,0.0001245739,0.008127845],"genre_scores_gemma":[0.4592068,0.002702078,0.5098284,0.001042486,0.0007706004,0.000893043,0.002147679,0.0006694013,0.02273952],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007349325,"threshold_uncertainty_score":0.0245859,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015024493","doi":"10.1007/s10107-003-0469-4","title":"The integration of an interior-point cutting plane method within a branch-and-price algorithm","year":2004,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Cutting-plane method; Column generation; Branch and bound; Bin packing problem; Algorithm; Interior point method; Mathematics; Bin; Mathematical optimization; Branching (polymer chemistry); Point (geometry); Dual (grammatical number); Plane (geometry); Tree (set theory); Computer science; Integer programming; Geometry; Combinatorics","authors":[{"name":"Samir Elhedhli","is_ca":true},{"name":"Jean‐Louis Goffin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01704059943685375,"gpt":0.275635538636096,"spread":0.2585949391992423,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001882198,0.001057659,0.002485543,0.001312739,0.0006643473,0.001304224,0.002091643,0.001866475,0.005321627],"category_scores_gemma":[0.003741961,0.0008432893,0.001073321,0.001764115,0.000902435,0.00170449,0.001251983,0.002508574,0.00199097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005667587,"about_ca_system_score_gemma":0.001458131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002871365,"about_ca_topic_score_gemma":0.002586182,"domain_scores_codex":[0.9990916,0.0002531562,0.00003799885,0.00008528015,0.0004781997,0.00005373107],"domain_scores_gemma":[0.9988418,0.0006753478,0.00006193756,0.00009543738,0.0002740207,0.00005151653],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001580733,0.0003241677,0.0004741013,0.0002512508,0.00007777944,0.0001120412,0.0001300971,0.5493877,0.008833712,0.08633695,0.003505153,0.3504089],"study_design_scores_gemma":[0.00001414037,0.0000319025,0.00004961459,0.00001146028,0.00001277459,0.00002798919,0.000004365486,0.9912144,0.0007059639,0.006167457,0.00175282,0.00000714195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001040775,0.00006606267,0.9974359,0.00002821847,0.00003730288,0.00001851543,0.000004953056,0.0001069022,0.001261404],"genre_scores_gemma":[0.03663776,0.0001985536,0.960685,0.00003834581,0.00006108289,0.0001416003,0.000033205,0.0001681983,0.002036248],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005321627,"threshold_uncertainty_score":0.0178026,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975952334","doi":"10.1007/pl00011384","title":"Conditions ensuring the applicability of cutting-plane methods for solving variational inequalities","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Monotonic function; Cutting-plane method; Variational inequality; Regular polygon; Plane (geometry); Set (abstract data type); Order (exchange); Applied mathematics; Inequality; Variational analysis; Mathematical optimization; Mathematical analysis; Geometry; Computer science","authors":[{"name":"Jean-Pierre Crouzeix","is_ca":false},{"name":"Patrice Marcotte","is_ca":true},{"name":"Daoli Zhu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0348545579723836,"gpt":0.348124457870492,"spread":0.3132698998981084,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01015732,0.002648021,0.002418681,0.002897103,0.001971778,0.003977945,0.002936694,0.003590003,0.006234088],"category_scores_gemma":[0.06786124,0.001051577,0.001938239,0.002265497,0.003903711,0.003952492,0.005060454,0.008037418,0.002496634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008857939,"about_ca_system_score_gemma":0.003641495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002717254,"about_ca_topic_score_gemma":0.001362496,"domain_scores_codex":[0.9956026,0.00133498,0.0004234517,0.0005303809,0.001697342,0.0004113043],"domain_scores_gemma":[0.9727972,0.01807837,0.001622719,0.001463031,0.005282216,0.0007564335],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005349977,0.0002486744,0.001156782,0.001085935,0.000162634,0.0006217228,0.0006845855,0.1708055,0.03125654,0.7232897,0.008855352,0.0612976],"study_design_scores_gemma":[0.00014723,0.0001874593,0.000869313,0.0004996812,0.00008642535,0.000367912,0.0003295363,0.4940956,0.01840771,0.4727092,0.01220542,0.00009440996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01607947,0.0006717611,0.9624991,0.0006776163,0.0002268953,0.000317916,0.0005759308,0.0002308963,0.01872045],"genre_scores_gemma":[0.3865513,0.004754763,0.5901939,0.0009041762,0.0009079345,0.002211293,0.00296827,0.0011402,0.01036818],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01015732,"threshold_uncertainty_score":0.05371773,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964852627","doi":"10.1007/s10107-012-0626-8","title":"A stabilized structured Dantzig–Wolfe decomposition method","year":2012,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Polyhedron; Column generation; Mathematics; Decomposition; Mathematical optimization; Extreme point; Variable (mathematics); Linear programming; Scheme (mathematics); Decomposition method (queueing theory); Combinatorics; Discrete mathematics","authors":[{"name":"Antonio Frangioni","is_ca":false},{"name":"Bernard Gendron","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03506220635162111,"gpt":0.3820592189595333,"spread":0.3469970126079122,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005390091,0.000770856,0.0006932833,0.000852821,0.000501046,0.0008699304,0.0009687953,0.001108297,0.008842523],"category_scores_gemma":[0.001204807,0.0004246907,0.0006984557,0.0006095259,0.0006668367,0.0009349813,0.001406581,0.001548459,0.002668775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003114731,"about_ca_system_score_gemma":0.0006357278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004130741,"about_ca_topic_score_gemma":0.0006142664,"domain_scores_codex":[0.9997684,0.00009285686,0.000007176691,0.00003547636,0.00007628849,0.00001981342],"domain_scores_gemma":[0.9997599,0.00006851845,0.00001720241,0.00004555759,0.00007503831,0.00003379672],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009603093,0.0001385363,0.0002028223,0.0001563381,0.00006255697,0.00009303439,0.00010349,0.1215621,0.01166926,0.7420187,0.01053623,0.113361],"study_design_scores_gemma":[0.00003125779,0.0000412488,0.00007126991,0.00002512396,0.00001538867,0.00004942988,0.00001842869,0.7358601,0.001675699,0.2546248,0.00757367,0.00001358817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004224367,0.0001312166,0.9858803,0.0001474095,0.0001329133,0.00003334774,0.00005068743,0.00008659221,0.009313216],"genre_scores_gemma":[0.1870813,0.000637017,0.7703568,0.0004934198,0.0002872285,0.0004443241,0.0003759589,0.0004339807,0.03989],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008842523,"threshold_uncertainty_score":0.02958119,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155466993","doi":"10.1007/s101070100256","title":"Matching, matroids, and extensions","year":2002,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Mathematics; Intersection (aeronautics); Matching (statistics); Jump; Path (computing); Mathematical optimization; Matroid partitioning; Combinatorial optimization; Combinatorics; Computer science; Graphic matroid","authors":[{"name":"William H. Cunningham","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03674678384377213,"gpt":0.2923804867600973,"spread":0.2556337029163252,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002051391,0.0007065301,0.001147966,0.001968279,0.001684591,0.004414753,0.001220772,0.001739094,0.006776209],"category_scores_gemma":[0.006549703,0.0006244557,0.0007473799,0.004144934,0.004497645,0.01135185,0.002439415,0.003620907,0.0007895684],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001563539,"about_ca_system_score_gemma":0.0009044813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001066161,"about_ca_topic_score_gemma":0.001348305,"domain_scores_codex":[0.9988409,0.0004118912,0.00006604729,0.0002992226,0.0002518342,0.000130138],"domain_scores_gemma":[0.9965204,0.001867313,0.0006048886,0.000390968,0.0002865697,0.0003298579],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001832394,0.0000269066,0.0002095043,0.00004165603,0.000005513486,0.00001826743,0.00008046336,0.001051402,0.0001101143,0.9880661,0.001674246,0.008697555],"study_design_scores_gemma":[0.000003341859,0.000004194798,0.0000570285,0.000007465494,0.00000353878,0.00003137463,0.00003289919,0.00129419,0.0000259997,0.9965469,0.001990666,0.000002405633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3214448,0.03917622,0.3944667,0.0243193,0.001070414,0.0001431942,0.001217185,0.0003922554,0.21777],"genre_scores_gemma":[0.8651308,0.01854768,0.06231584,0.001793661,0.003224026,0.000272135,0.0007391578,0.0001107373,0.04786596],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006776209,"threshold_uncertainty_score":0.02266872,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3020603765","doi":"10.1007/s10107-020-01500-6","title":"Generalized monotone operators and their averaged resolvents","year":2020,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"","keywords":"Mathematics; Resolvent; Monotonic function; Monotone polygon; Operator (biology); Convergence (economics); Set (abstract data type); Scaling; Class (philosophy); Applied mathematics; Pure mathematics; Discrete mathematics; Mathematical analysis; Computer science","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Walaa M. Moursi","is_ca":true},{"name":"Xianfu Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02656643460086841,"gpt":0.2442747187091969,"spread":0.2177082841083285,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002687369,0.001245831,0.001240889,0.002588346,0.001098448,0.002607005,0.001864758,0.00187302,0.005460251],"category_scores_gemma":[0.00932462,0.0007817757,0.001385211,0.00133505,0.00292076,0.006446569,0.002696723,0.002864538,0.0004698873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001166924,"about_ca_system_score_gemma":0.0008720277,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005555257,"about_ca_topic_score_gemma":0.0005171941,"domain_scores_codex":[0.9987814,0.0004383094,0.00006734159,0.0002221998,0.0003427969,0.0001479941],"domain_scores_gemma":[0.9967636,0.001509281,0.0004840714,0.0002326954,0.0005351043,0.0004753064],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001431745,0.00001442936,0.00009121504,0.00003043134,0.00002004292,0.00005201655,0.0000983244,0.003374547,0.0009152247,0.991872,0.0004420823,0.003075267],"study_design_scores_gemma":[0.000005666625,0.00001637184,0.0001413587,0.000009212332,0.000007891073,0.00009675315,0.00003178144,0.04462321,0.0002906038,0.9539451,0.0008203522,0.00001162002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1949862,0.003040235,0.7613516,0.001597692,0.0004841205,0.00007608745,0.0002439975,0.0002349107,0.03798529],"genre_scores_gemma":[0.8510844,0.00219904,0.1150309,0.0006290677,0.0009893273,0.0001895569,0.0002165119,0.0003113864,0.02934985],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005460251,"threshold_uncertainty_score":0.01826638,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W68594018","doi":"10.1007/s101070050009","title":"The global linear convergence of an infeasible non-interior path-following algorithm for complementarity problems with uniform P -functions","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":46,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Iterated function; Mathematics; Smoothing; Path (computing); Mathematical optimization; Complementarity (molecular biology); Algorithm; Linear complementarity problem; Convergence (economics); Mixed complementarity problem; Nonlinear system; Applied mathematics; Computer science; Mathematical analysis","authors":[{"name":"Song Xu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04428689343166729,"gpt":0.3637298191637047,"spread":0.3194429257320374,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003761365,0.001180116,0.0009393624,0.0007367294,0.0009732489,0.001190277,0.001485495,0.001897262,0.004030326],"category_scores_gemma":[0.01300587,0.0008436293,0.0008100048,0.0006698983,0.002197754,0.001843776,0.002463756,0.002717708,0.0005118979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009812906,"about_ca_system_score_gemma":0.002295834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003639653,"about_ca_topic_score_gemma":0.002956442,"domain_scores_codex":[0.9989729,0.0005179793,0.00003456001,0.0001530594,0.0002177321,0.000103888],"domain_scores_gemma":[0.9942378,0.004511186,0.0003003076,0.0002477601,0.0005481708,0.0001547744],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004179645,0.00008622003,0.0005244225,0.0001685727,0.00004613253,0.0000645911,0.0001670783,0.8936955,0.002196294,0.05380585,0.00198105,0.04684646],"study_design_scores_gemma":[0.00001845319,0.00004504122,0.00005825071,0.00001239996,0.000004864414,0.00001332849,0.000009550674,0.9905334,0.0003954977,0.008621041,0.0002826674,0.000005542439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0166147,0.0001344538,0.9774779,0.0002180572,0.00005003965,0.00005895352,0.00002677719,0.0001570615,0.005261957],"genre_scores_gemma":[0.4108582,0.000242046,0.5809348,0.0002621745,0.0000458535,0.0004301226,0.0001586682,0.0003160574,0.006751969],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004030326,"threshold_uncertainty_score":0.01989222,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013333510","doi":"10.1007/s10107-014-0812-y","title":"Modified orbital branching for structured symmetry with an application to unit commitment","year":2014,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimal Power Flow Distribution","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; University of Guelph; Group for Research in Decision Analysis","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Branching (polymer chemistry); Integer programming; Symmetry breaking; Symmetry group; Symmetry (geometry); Graph; Combinatorics; Symmetry operation; Symmetry number; Global symmetry; Mathematical optimization; Geometry; Physics; Quantum mechanics; Spontaneous symmetry breaking","authors":[{"name":"James Ostrowski","is_ca":false},{"name":"Miguel F. Anjos","is_ca":true},{"name":"Anthony Vannelli","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01238110498595243,"gpt":0.2528350784160875,"spread":0.2404539734301351,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001860035,0.0007867572,0.001076113,0.0007010996,0.0007229776,0.001320256,0.001638021,0.001257858,0.008979104],"category_scores_gemma":[0.005997711,0.0004833883,0.001165737,0.001311919,0.00165877,0.001998222,0.001917933,0.002801557,0.0007603434],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009157883,"about_ca_system_score_gemma":0.001102756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001591927,"about_ca_topic_score_gemma":0.001857223,"domain_scores_codex":[0.9995201,0.000261595,0.00001435555,0.00005461416,0.0001057252,0.00004372972],"domain_scores_gemma":[0.9984204,0.001016078,0.0001181138,0.0001409882,0.0001588446,0.0001456267],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006264861,0.00009834264,0.000261168,0.00005885892,0.00001886377,0.0001225168,0.00008529917,0.2892154,0.001078687,0.6835835,0.002214695,0.02320007],"study_design_scores_gemma":[0.00001475798,0.00002055897,0.00003682049,0.000007607683,0.000004461966,0.00001612701,0.00001266705,0.7884519,0.0001797797,0.2104259,0.0008223918,0.000007124463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01639154,0.0001088051,0.9719148,0.0002749007,0.0001145224,0.00005848784,0.00006393623,0.0001061229,0.01096679],"genre_scores_gemma":[0.4693304,0.0004642148,0.5098907,0.0003118181,0.0002600267,0.0003357278,0.0002060111,0.0004471313,0.01875403],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008979104,"threshold_uncertainty_score":0.03003812,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2765403799","doi":"10.1007/pl00011389","title":"The packing property","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Clutter; Matrix (chemical analysis); Disjoint sets; Incidence matrix; Vertex (graph theory); Set (abstract data type); Matching (statistics); Algorithm; Graph; Computer science; Radar","authors":[{"name":"Gérard Cornuéjols","is_ca":false},{"name":"Bertrand Guenin","is_ca":true},{"name":"François Margot","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008940437827761731,"gpt":0.1975003397861044,"spread":0.1885599019583426,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005313304,0.0008847719,0.001469185,0.001340144,0.001969419,0.003592549,0.001065266,0.001947422,0.02033858],"category_scores_gemma":[0.004860973,0.0007923997,0.001072273,0.001950823,0.002570989,0.007450823,0.002988845,0.005510235,0.004162386],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006325051,"about_ca_system_score_gemma":0.0006217613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006596944,"about_ca_topic_score_gemma":0.0004274888,"domain_scores_codex":[0.9990785,0.0001627572,0.00003919531,0.0003239941,0.0002368363,0.000158661],"domain_scores_gemma":[0.9980556,0.0009204155,0.0001793552,0.0003994327,0.000272947,0.0001723098],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001463722,0.00001372689,0.00009407119,0.0000386003,0.000008069122,0.0000434114,0.000064571,0.0005364994,0.0004847307,0.9816782,0.006248363,0.01077518],"study_design_scores_gemma":[0.000004990088,0.000008363586,0.0001304096,0.00001498401,0.00000556373,0.0001619874,0.00003161153,0.002906062,0.0004236356,0.9888205,0.007485407,0.000006502029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.0806046,0.002525018,0.41502,0.008898988,0.001607435,0.0001252863,0.001353728,0.0005347276,0.4893304],"genre_scores_gemma":[0.7741303,0.004563248,0.07047098,0.006008275,0.00293406,0.0005151994,0.002008976,0.001004761,0.1383642],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02033858,"threshold_uncertainty_score":0.0680393,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2578607773","doi":"10.1007/s10107-018-1339-4","title":"Two-stage linear decision rules for multi-stage stochastic programming","year":2018,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":43,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"U.S. Department of Energy; National Science Foundation","keywords":"Mathematics; Upper and lower bounds; Linear programming; Mathematical optimization; Stochastic programming; Value (mathematics); Function (biology); Dual (grammatical number); Affine transformation; Bellman equation; Statistics; Pure mathematics","authors":[{"name":"Merve Bodur","is_ca":true},{"name":"James Luedtke","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1949070732070776,"gpt":0.4531267254404512,"spread":0.2582196522333736,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01070137,0.001574942,0.003240915,0.0009355498,0.0005852504,0.00321063,0.002688579,0.002813874,0.005155334],"category_scores_gemma":[0.02078857,0.001666403,0.002300192,0.001137429,0.001467348,0.003358975,0.001905991,0.004743412,0.0008645951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001799479,"about_ca_system_score_gemma":0.001993095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003312581,"about_ca_topic_score_gemma":0.00370794,"domain_scores_codex":[0.9948311,0.002968919,0.0003098131,0.0006655462,0.0008283118,0.0003964264],"domain_scores_gemma":[0.9852059,0.01229521,0.0005665004,0.0005085428,0.001098132,0.0003256409],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001312627,0.0001341947,0.0005779399,0.0001733461,0.0001159422,0.0001089149,0.00009688734,0.8200045,0.0008592158,0.1474735,0.001150437,0.02917391],"study_design_scores_gemma":[0.00001707425,0.00003218059,0.00006254125,0.0000158744,0.00001852484,0.00001317228,0.000004040006,0.9629531,0.0002903244,0.03613892,0.0004406874,0.00001359992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004776278,0.000268018,0.9930478,0.0001577058,0.00004187532,0.00005796506,0.00006287147,0.00005659801,0.001530962],"genre_scores_gemma":[0.4824359,0.0009435961,0.5035158,0.00022498,0.0001624426,0.0007930833,0.0004605385,0.0001289108,0.01133462],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01070137,"threshold_uncertainty_score":0.05659497,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980307085","doi":"10.1007/pl00011394","title":"Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Discretization; Relaxation (psychology); Convex hull; Convex optimization; Linear programming relaxation; Quadratic equation; Semidefinite programming; Quadratic programming; Linear programming; Function (biology); Mathematical optimization; Finite set; Feasible region; Applied mathematics; Regular polygon; Combinatorics; Mathematical analysis; Geometry","authors":[{"name":"Masakazu Kojima","is_ca":false},{"name":"Levent Tunçel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04527866346224898,"gpt":0.4310191315799686,"spread":0.3857404681177197,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002368377,0.0008763766,0.0008826841,0.0006269912,0.0005004746,0.001169499,0.001404533,0.001369852,0.002632791],"category_scores_gemma":[0.009657412,0.0007552333,0.0008353621,0.0009444255,0.002230418,0.002268553,0.001857435,0.002791682,0.0004887571],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000781604,"about_ca_system_score_gemma":0.001127955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003189601,"about_ca_topic_score_gemma":0.003427936,"domain_scores_codex":[0.9991048,0.0005263031,0.00003813127,0.0001026307,0.0001819511,0.00004616379],"domain_scores_gemma":[0.9966233,0.002582193,0.0001855152,0.0002161616,0.0003106345,0.00008222851],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001865744,0.00008885543,0.0004575267,0.0003709894,0.00005754055,0.00009845496,0.0002828755,0.6299353,0.005509822,0.2882291,0.003515194,0.07126786],"study_design_scores_gemma":[0.000009323694,0.00002141052,0.00003663498,0.00001303848,0.000004350331,0.00001332521,0.00001405232,0.9734379,0.0005487284,0.02474919,0.001145049,0.000006964782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002909457,0.0003051676,0.9951178,0.0001984917,0.0000785594,0.00001611062,0.0000116922,0.00004046816,0.001322235],"genre_scores_gemma":[0.2572363,0.001212387,0.7298312,0.0003120865,0.0002356503,0.0002974465,0.0001713167,0.000306287,0.01039728],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003189601,"threshold_uncertainty_score":0.01252532,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994002660","doi":"10.1007/s10107-008-0242-9","title":"Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization","year":2008,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Fleischer; Mathematics; Submodular set function; Algorithm; Function (biology); Minification; Polynomial; Combinatorial algorithms; Time complexity; Extension (predicate logic); Combinatorics; Discrete mathematics; Computer science; Mathematical optimization","authors":[{"name":"S. Thomas McCormick","is_ca":true},{"name":"Satoru Fujishige","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03894664690511204,"gpt":0.2594211731772316,"spread":0.2204745262721196,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003035475,0.002244497,0.001983083,0.001522326,0.002223142,0.00564871,0.005332076,0.00276996,0.01399928],"category_scores_gemma":[0.01911188,0.001358394,0.002538298,0.003044388,0.00343672,0.01389834,0.00563289,0.009339146,0.002352411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004052667,"about_ca_system_score_gemma":0.003846864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002916374,"about_ca_topic_score_gemma":0.005600083,"domain_scores_codex":[0.9968483,0.001160856,0.000123598,0.0007154365,0.0007030213,0.0004488313],"domain_scores_gemma":[0.9877431,0.008532858,0.0005843768,0.001946421,0.0007087254,0.0004844286],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005168336,0.0005451869,0.0008370996,0.0004172553,0.00008468943,0.00005611462,0.0003278609,0.06231426,0.001912319,0.8002453,0.02472439,0.1080186],"study_design_scores_gemma":[0.00007302088,0.0000379497,0.0001824185,0.00003039047,0.00003249656,0.00004872913,0.00006084876,0.151387,0.0008718615,0.8443739,0.002881991,0.00001947172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04233226,0.0009476809,0.9149286,0.004359715,0.0002240326,0.0002285698,0.0007719238,0.001293894,0.03491344],"genre_scores_gemma":[0.3932998,0.001347986,0.5698802,0.001744364,0.0007164936,0.001014274,0.002386935,0.001377743,0.02823214],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01399928,"threshold_uncertainty_score":0.04683226,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058753381","doi":"10.1007/s10107-004-0542-7","title":"Capacitated transit assignment with loading priorities","year":2004,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":40,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Queue; Position (finance); Transit (satellite); Variational inequality; Mathematical optimization; Set (abstract data type); Node (physics); Residual; Order (exchange); Preference; Computer science; Mathematics; Operations research; Public transport; Transport engineering; Computer network; Algorithm; Engineering","authors":[{"name":"Younes Hamdouch","is_ca":true},{"name":"Patrice Marcotte","is_ca":true},{"name":"Sang Quang Nguyen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0237641230072467,"gpt":0.2759974946328648,"spread":0.252233371625618,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001982455,0.001338485,0.001729991,0.001478349,0.001102897,0.002742428,0.00303819,0.001476864,0.008275271],"category_scores_gemma":[0.005466889,0.001516271,0.001240553,0.004076254,0.000759982,0.002936102,0.001532532,0.001634228,0.001032594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002358722,"about_ca_system_score_gemma":0.002376422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005867438,"about_ca_topic_score_gemma":0.006180096,"domain_scores_codex":[0.9984119,0.000620053,0.00006296771,0.000254177,0.0003227489,0.0003281624],"domain_scores_gemma":[0.9982452,0.0009344479,0.0002064943,0.0001429383,0.0003064352,0.0001645385],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002005063,0.0001271764,0.0003586816,0.0001980668,0.00004548963,0.000132564,0.00008303715,0.8931744,0.0008857976,0.06438001,0.003140398,0.03727389],"study_design_scores_gemma":[0.00001819947,0.00005247741,0.00009290862,0.00000943025,0.00002363845,0.00003752141,0.00002551951,0.9646223,0.0005212771,0.03340274,0.001181919,0.00001208617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02310228,0.0002008725,0.9653386,0.0002926269,0.0001122841,0.0001595667,0.0002748496,0.000249034,0.01026991],"genre_scores_gemma":[0.642033,0.000621971,0.3329771,0.000158514,0.0002725536,0.0004183688,0.0004598885,0.0002032999,0.02285526],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008275271,"threshold_uncertainty_score":0.02768356,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144300893","doi":"10.1007/s10107-005-0588-1","title":"The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Heuristic; Scheduling (production processes); Probabilistic logic; Bounded function; Mathematical optimization; Computer science; Mathematics; Algorithm; Competitive analysis; Job shop scheduling; Job scheduler; Upper and lower bounds; Schedule; Artificial intelligence","authors":[{"name":"Mabel C. Chou","is_ca":false},{"name":"Maurice Queyranne","is_ca":true},{"name":"David Simchi‐Levi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01570442300364627,"gpt":0.2486639467360451,"spread":0.2329595237323988,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008807912,0.002013146,0.001480712,0.001266654,0.000920172,0.002471604,0.002162049,0.001938584,0.004582961],"category_scores_gemma":[0.04251846,0.0006234222,0.0005343072,0.001272825,0.001935245,0.004029292,0.001882232,0.002048951,0.001133262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00240513,"about_ca_system_score_gemma":0.002922812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001641337,"about_ca_topic_score_gemma":0.001109806,"domain_scores_codex":[0.9939039,0.00306574,0.0001693266,0.0005916372,0.001471534,0.0007977628],"domain_scores_gemma":[0.9685637,0.02436183,0.001530686,0.002808902,0.00200287,0.0007319926],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.004016107,0.0004498062,0.002529873,0.0003380801,0.0001283254,0.000127485,0.0001790038,0.8208567,0.01384185,0.03935036,0.006234821,0.1119476],"study_design_scores_gemma":[0.00005456738,0.0001771845,0.0002790905,0.00001479051,0.00002187998,0.00004282336,0.00002210621,0.9888211,0.00252558,0.0077248,0.0003063425,0.000009783429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2157676,0.002204564,0.749945,0.001425651,0.0003059805,0.0001586537,0.000184892,0.002843412,0.02716429],"genre_scores_gemma":[0.8656532,0.0005555207,0.1281489,0.0003718539,0.0002745687,0.0001875565,0.0002927739,0.0009444398,0.003571196],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008807912,"threshold_uncertainty_score":0.04658127,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1604898370","doi":"10.1007/s10107-003-0407-5","title":"The stable set problem and the lift-and-project ranks of graphs","year":2003,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Subdivision; Vertex (graph theory); Pathwidth; Cograph; Graph; Discrete mathematics; Split graph; Line graph","authors":[{"name":"L�szl� Lipt�k","is_ca":true},{"name":"Levent Tun�el","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02837370701248726,"gpt":0.3029111102361365,"spread":0.2745374032236492,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003703738,0.001104995,0.002711502,0.003478465,0.004999145,0.008327276,0.003251349,0.003516274,0.01771668],"category_scores_gemma":[0.0194893,0.001152022,0.001761797,0.003713053,0.00763656,0.01766288,0.005022196,0.006451017,0.001575874],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002249198,"about_ca_system_score_gemma":0.00182602,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001588562,"about_ca_topic_score_gemma":0.001828972,"domain_scores_codex":[0.9970023,0.001095987,0.0001308155,0.0004705412,0.0007909401,0.0005093774],"domain_scores_gemma":[0.9887449,0.007701597,0.0008837822,0.0007904147,0.0006716353,0.001207682],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003368077,0.00002523793,0.0001405891,0.00003513051,0.000006284423,0.0000253298,0.0001551535,0.002040319,0.000117091,0.9910204,0.001204121,0.005196714],"study_design_scores_gemma":[0.000008519331,0.000005670288,0.00004220221,0.000006437066,0.000003200537,0.00001270865,0.00005168844,0.003932216,0.00008192191,0.995359,0.0004903883,0.000006048829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4802715,0.001513986,0.3944311,0.01203338,0.0005126492,0.0001563054,0.0008127256,0.0005328279,0.1097355],"genre_scores_gemma":[0.9233297,0.001041452,0.04403659,0.0005120421,0.0009386232,0.0001741824,0.0005786014,0.0002756747,0.02911301],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01771668,"threshold_uncertainty_score":0.05926818,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001944732","doi":"10.1007/pl00011428","title":"Concavity cuts for disjoint bilinear programming","year":2001,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Disjoint sets; Bilinear interpolation; Mathematics; Mathematical optimization; Linear programming; Degenerate energy levels; Optimization problem; Nonlinear programming; Combinatorics; Nonlinear system","authors":[{"name":"Stéphane Alarie","is_ca":true},{"name":"Charles Audet","is_ca":true},{"name":"Brigitte Jaumard","is_ca":true},{"name":"Gilles Savard","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04709839733559648,"gpt":0.3024123968041444,"spread":0.2553139994685479,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003430294,0.001286789,0.001888825,0.001592878,0.002592685,0.006038712,0.002741828,0.001567169,0.009054913],"category_scores_gemma":[0.0170298,0.001633629,0.001684206,0.002490662,0.004935509,0.01294229,0.006031566,0.01118301,0.001000207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003437508,"about_ca_system_score_gemma":0.002056094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002377848,"about_ca_topic_score_gemma":0.002180903,"domain_scores_codex":[0.9969627,0.001091939,0.0001404535,0.0005841968,0.0008399819,0.0003806747],"domain_scores_gemma":[0.9852628,0.01045997,0.0009025921,0.001205789,0.001126713,0.00104209],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000687518,0.00004473159,0.0001765444,0.00006872008,0.00001553322,0.00001942021,0.000165113,0.006516576,0.0003286306,0.9823723,0.002109552,0.008114064],"study_design_scores_gemma":[0.000009647522,0.00001066883,0.000059384,0.000009981724,0.000006762332,0.00001831339,0.00003144856,0.02106578,0.0002202729,0.9770789,0.001480793,0.000008098873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08702057,0.001034958,0.8668405,0.003381365,0.0002552381,0.0001364438,0.000487365,0.000300757,0.04054284],"genre_scores_gemma":[0.6829575,0.001770761,0.2667013,0.001269995,0.0008622137,0.000700104,0.001142174,0.0005740488,0.04402201],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009054913,"threshold_uncertainty_score":0.03029168,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}