{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":21,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":21,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"cb388db2bcac","filters":{"venue":"Mathematical Programming Computation"}},"results":[{"id":"W2080484716","doi":"10.1007/s12532-012-0047-y","title":"The time dependent traveling salesman problem: polyhedra and algorithm","year":2012,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":87,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Travelling salesman problem; Polytope; Bottleneck traveling salesman problem; Polyhedron; Theory of computation; Mathematics; Combinatorics; Generalization; Dimension (graph theory); Heuristics; Traveling purchaser problem; Combinatorial optimization; Algorithm; Computer science; Mathematical optimization","authors":[{"name":"Hernán Abeledo","is_ca":false},{"name":"Ricardo Fukasawa","is_ca":true},{"name":"Artur Alves Pessoa","is_ca":false},{"name":"Eduardo Uchoa","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01327064375382853,"gpt":0.2620524660477406,"spread":0.248781822293912,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001338856,0.001042943,0.001622733,0.00111375,0.001113349,0.002899801,0.002311798,0.002244476,0.005411271],"category_scores_gemma":[0.004457389,0.001090654,0.001507058,0.002321959,0.001678938,0.003885322,0.001967703,0.003299382,0.001073345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001798805,"about_ca_system_score_gemma":0.0022715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00734591,"about_ca_topic_score_gemma":0.005695086,"domain_scores_codex":[0.9993609,0.0002602022,0.00002566424,0.0001181091,0.0001826766,0.00005260267],"domain_scores_gemma":[0.9986737,0.0008633873,0.00009581899,0.0001157109,0.0001861422,0.00006518205],"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.00004604608,0.00008392947,0.0002624466,0.0001466002,0.00003350716,0.00003507621,0.00007904213,0.6569155,0.0004291825,0.2784089,0.007432478,0.05612717],"study_design_scores_gemma":[0.000008134808,0.000009314256,0.00003719245,0.00001665136,0.000006138186,0.00001270231,0.00002140213,0.8961737,0.0001457302,0.1003536,0.003208429,0.000006999639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003546724,0.0006747264,0.9893828,0.0004439824,0.00009736721,0.00003076182,0.00007147463,0.00007748487,0.005674632],"genre_scores_gemma":[0.1447851,0.003112264,0.8365493,0.0002377201,0.0002814255,0.0003498748,0.0004829236,0.0003082646,0.01389308],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00734591,"threshold_uncertainty_score":0.01810247,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2790891482","doi":"10.1007/s12532-018-0147-4","title":"QPLIB: a library of quadratic programming instances","year":2018,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Process Optimization and Integration","field":"Engineering","cited_by":82,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Engineering and Physical Sciences Research Council; Bundesministerium für Bildung und Forschung","keywords":"Undecidable problem; Computer science; Quadratic programming; Variety (cybernetics); Integer programming; Selection (genetic algorithm); Quadratic equation; Combinatorial optimization; Class (philosophy); Set (abstract data type); Theoretical computer science; Mathematical optimization; Mathematics; Algorithm; Programming language; Artificial intelligence; Decidability","authors":[{"name":"Fabio Furini","is_ca":false},{"name":"Pietro Belotti","is_ca":false},{"name":"Antonio Frangioni","is_ca":false},{"name":"Ambros Gleixner","is_ca":false},{"name":"Leo Liberti","is_ca":false},{"name":"Andrea Lodi","is_ca":true},{"name":"Ruth Misener","is_ca":false},{"name":"Hans D. Mittelmann","is_ca":false},{"name":"Nikolaos V. Sahinidis","is_ca":false},{"name":"Stefan Vigerske","is_ca":false},{"name":"Angelika Wiegele","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0133077586837698,"gpt":0.2487562590210415,"spread":0.2354485003372717,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001110858,0.001630578,0.001455715,0.001332967,0.0006727929,0.00242961,0.003585406,0.00145046,0.04179859],"category_scores_gemma":[0.008860269,0.001137823,0.001620457,0.002844912,0.0005570294,0.002227088,0.001667724,0.003171691,0.01082984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007704283,"about_ca_system_score_gemma":0.002262366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004089947,"about_ca_topic_score_gemma":0.006108177,"domain_scores_codex":[0.9990903,0.0002513869,0.00007863951,0.0001444913,0.0003407154,0.00009444322],"domain_scores_gemma":[0.998347,0.0008933971,0.00008365775,0.0002976156,0.0003010549,0.00007722561],"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.0003791769,0.0003528199,0.0009089732,0.001693767,0.000177771,0.000196111,0.0001067277,0.3371553,0.001792614,0.1433523,0.2227762,0.2911083],"study_design_scores_gemma":[0.0001945352,0.00003895318,0.0001763358,0.00009320326,0.00003489707,0.0000943782,0.00002768764,0.8539919,0.002559113,0.08329414,0.05946204,0.00003285349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005110618,0.00074938,0.9310133,0.0006025069,0.0002645894,0.0002597956,0.00914865,0.02057157,0.03227964],"genre_scores_gemma":[0.07806848,0.0007764358,0.8868526,0.000337712,0.0001174173,0.0008462223,0.01249129,0.008898295,0.0116116],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04179859,"threshold_uncertainty_score":0.1398302,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2033477411","doi":"10.1007/s12532-012-0035-2","title":"A primal–dual regularized interior-point method for convex quadratic programs","year":2012,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":79,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; University of British Columbia","funders":"","keywords":"Interior point method; Regularization (linguistics); Mathematics; Theory of computation; Quadratic programming; Mathematical optimization; Regular polygon; Rank (graph theory); Linear programming; Applied mathematics; Quadratic equation; Convex optimization; Dual (grammatical number); Algorithm; Computer science; Combinatorics; Artificial intelligence; Geometry","authors":[{"name":"Michael P. Friedlander","is_ca":true},{"name":"Dominique Orban","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09562827335959624,"gpt":0.4280854122017906,"spread":0.3324571388421944,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002045682,0.001076211,0.0018059,0.0007545344,0.0005982835,0.001152967,0.001953959,0.00193656,0.006875933],"category_scores_gemma":[0.003852877,0.0008132763,0.001159287,0.0007958148,0.001120039,0.001129228,0.002319866,0.003071892,0.001702664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005819777,"about_ca_system_score_gemma":0.001634848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001728837,"about_ca_topic_score_gemma":0.001703093,"domain_scores_codex":[0.999235,0.0003535913,0.00002708311,0.00008982849,0.0002522575,0.00004218697],"domain_scores_gemma":[0.9991133,0.0004305991,0.00004902866,0.00008597284,0.0002478535,0.00007317828],"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.0002554488,0.0003154348,0.0003170259,0.0004454388,0.0001049038,0.0001497619,0.0001571441,0.6974571,0.007610157,0.1123079,0.008498156,0.1723814],"study_design_scores_gemma":[0.00001769354,0.00002193728,0.0000187637,0.000009360253,0.000005131966,0.00001386399,0.000004469159,0.9916319,0.0003665757,0.00648827,0.001416779,0.000005179922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001261765,0.00007208517,0.9972016,0.00007453551,0.00006470824,0.00003193234,0.00001770171,0.00007759794,0.00119811],"genre_scores_gemma":[0.05999633,0.0001734029,0.9343708,0.000127952,0.0001311864,0.0002854409,0.0001327563,0.0002601372,0.004521925],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006875933,"threshold_uncertainty_score":0.02300227,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2677624263","doi":"10.1007/s12532-019-00172-4","title":"A rotation-based branch-and-price approach for the nurse scheduling problem","year":2019,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"Agence Nationale de la Recherche","keywords":"Theory of computation; Nurse scheduling problem; Embedding; Scheduling (production processes); Time horizon; Computer science; Mathematical optimization; Mathematics; Mathematical economics; Job shop scheduling; Algorithm; Artificial intelligence; Schedule; Flow shop scheduling","authors":[{"name":"Antoine Legrain","is_ca":true},{"name":"Jérémy Omer","is_ca":false},{"name":"Samuel Rosat","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07469503885769585,"gpt":0.3679291525926293,"spread":0.2932341137349334,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001523275,0.0008938306,0.002050997,0.001131817,0.0008996234,0.001374089,0.002161911,0.001348347,0.01131102],"category_scores_gemma":[0.004306309,0.0007870601,0.001182973,0.002057059,0.0008635367,0.001699814,0.001309147,0.001910805,0.001329516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001615184,"about_ca_system_score_gemma":0.003604387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01607482,"about_ca_topic_score_gemma":0.01172083,"domain_scores_codex":[0.9993024,0.0002804291,0.00002483274,0.00008100332,0.0001893787,0.0001220054],"domain_scores_gemma":[0.9987742,0.0008306128,0.00007377812,0.00007634218,0.0001625632,0.00008242358],"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.0001238305,0.0001074783,0.0002272497,0.00008379988,0.00002398422,0.00004020705,0.00003845441,0.8920215,0.0009629243,0.02284783,0.002742036,0.08078065],"study_design_scores_gemma":[0.00001705462,0.00001739144,0.00003431907,0.00000361661,0.000005834367,0.000005814226,0.000005830017,0.9943177,0.0001146004,0.005073975,0.000400671,0.000003163845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008407208,0.0002387749,0.9860029,0.0002938172,0.00008738691,0.0001174819,0.00007729369,0.0002054365,0.004569669],"genre_scores_gemma":[0.2624535,0.0007257344,0.7287619,0.0002019966,0.0002048964,0.0005371405,0.0002940744,0.0002691202,0.006551573],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01607482,"threshold_uncertainty_score":0.03783917,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2138131169","doi":"10.1007/s12532-013-0052-9","title":"Local cuts for mixed-integer programming","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Cutting-plane method; Integer programming; Travelling salesman problem; Mathematics; Linear programming relaxation; Context (archaeology); Mathematical optimization; Relaxation (psychology); Theory of computation; Space (punctuation); Integer (computer science); Hyperplane; Point (geometry); Plane (geometry); Range (aeronautics); Linear programming; Algorithm; Computer science; Combinatorics; Geometry","authors":[{"name":"Vašek Chvátal","is_ca":true},{"name":"William J. Cook","is_ca":false},{"name":"Daniel Espinoza","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02548378838351857,"gpt":0.3091325737675542,"spread":0.2836487853840356,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004407053,0.001542634,0.001801639,0.001461615,0.0009469264,0.002799402,0.002469993,0.001416784,0.007773428],"category_scores_gemma":[0.01691112,0.001170643,0.001140956,0.001556105,0.002290601,0.003371033,0.002647557,0.0056101,0.001157301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00160505,"about_ca_system_score_gemma":0.001234293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001914486,"about_ca_topic_score_gemma":0.002390515,"domain_scores_codex":[0.9979425,0.001137441,0.00006156287,0.0002400187,0.000490567,0.0001279012],"domain_scores_gemma":[0.9923564,0.005969016,0.0004119141,0.0004349705,0.0005844935,0.0002431685],"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.0002710079,0.0001210531,0.0004071568,0.0005138464,0.00009210817,0.00007757995,0.0001764164,0.2496991,0.001297006,0.6487225,0.008171437,0.09045078],"study_design_scores_gemma":[0.00003929618,0.00003828896,0.00007729185,0.00006282501,0.00002203305,0.00002391763,0.00002809773,0.5720349,0.000469445,0.4229816,0.004208935,0.00001340482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002986517,0.0006497258,0.9919613,0.0002404837,0.00008160031,0.00003557799,0.00005882188,0.0001422076,0.003843761],"genre_scores_gemma":[0.1477129,0.0009001528,0.8399299,0.0003151307,0.0002574412,0.0006790247,0.000381142,0.0005476119,0.009276628],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007773428,"threshold_uncertainty_score":0.02600473,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976845059","doi":"10.1007/s12532-014-0065-z","title":"An exact cooperative method for the uncapacitated facility location problem","year":2014,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Subgradient method; Mathematical optimization; Branch and bound; Tabu search; Node (physics); Upper and lower bounds; Computer science; Facility location problem; Dual (grammatical number); Process (computing); Bundle; Mathematics","authors":[{"name":"Marius Posta","is_ca":true},{"name":"Jacques A. Ferland","is_ca":true},{"name":"Philippe Michelon","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03929983688559276,"gpt":0.3069045975542264,"spread":0.2676047606686336,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001063145,0.0006106255,0.00100297,0.0006590585,0.0005889539,0.001020299,0.002159075,0.001218658,0.006574322],"category_scores_gemma":[0.003938043,0.0005040209,0.0007854357,0.001194742,0.0008404608,0.001450051,0.001644702,0.001239839,0.0006999543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001024259,"about_ca_system_score_gemma":0.002254715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01027512,"about_ca_topic_score_gemma":0.0110952,"domain_scores_codex":[0.9995117,0.000141449,0.00001564903,0.00007231663,0.000185365,0.00007355513],"domain_scores_gemma":[0.9986173,0.000814068,0.0000684282,0.00013614,0.000291631,0.00007244248],"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.00005937759,0.00006540039,0.0002278374,0.00008195203,0.00002458758,0.00007586287,0.00007410176,0.8992186,0.0007968856,0.05912199,0.002548357,0.037705],"study_design_scores_gemma":[0.000008292433,0.000006660591,0.00001874961,0.000003652164,0.000002766313,0.000006953497,0.000007235783,0.9916661,0.0000652752,0.007689113,0.0005228721,0.00000223211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005466018,0.0001135015,0.9887177,0.0001674206,0.00007556731,0.00003000836,0.00004149131,0.0001010967,0.005287181],"genre_scores_gemma":[0.4414003,0.0003308287,0.5419339,0.0002691079,0.0001421432,0.0003426244,0.0001789095,0.0002181248,0.01518415],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01027512,"threshold_uncertainty_score":0.02199334,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400792608","doi":"10.1007/s12532-024-00255-x","title":"PyEPO: a PyTorch-based end-to-end predict-then-optimize library for linear and integer programming","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Integer programming; End-to-end principle; Computer science; Linear programming; Theory of computation; Integer (computer science); Parallel computing; Algorithm; Artificial intelligence; Programming language","authors":[{"name":"Bo Tang","is_ca":true},{"name":"Elias B. Khalil","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02221699247781377,"gpt":0.2937117696713729,"spread":0.2714947771935591,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001195851,0.003167456,0.002007185,0.001396934,0.001027252,0.002419493,0.004371014,0.001421377,0.1101248],"category_scores_gemma":[0.00549874,0.001982301,0.002538071,0.001622592,0.0009243393,0.003011967,0.003022337,0.004953391,0.05178763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00125846,"about_ca_system_score_gemma":0.002987527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00554982,"about_ca_topic_score_gemma":0.01113591,"domain_scores_codex":[0.9990178,0.0001261382,0.00006609624,0.0002008237,0.0003748321,0.0002142652],"domain_scores_gemma":[0.9986781,0.0005785094,0.00007457629,0.0002930333,0.000263987,0.0001118648],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001661656,0.0004463761,0.003201205,0.001840421,0.0004436345,0.0004394223,0.0003606302,0.05505156,0.009806685,0.033753,0.5965641,0.2964312],"study_design_scores_gemma":[0.0008774325,0.0001309524,0.00142071,0.0001979059,0.0001118765,0.0002780602,0.00008692864,0.686221,0.04028845,0.06609128,0.2040575,0.0002378993],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.002485374,0.0003479841,0.5097507,0.0001881384,0.0002283156,0.0001453197,0.007516213,0.4684347,0.01090321],"genre_scores_gemma":[0.08049659,0.0008205062,0.6310338,0.001185114,0.0002236963,0.00129318,0.03321954,0.2193673,0.03236015],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.1101248,"threshold_uncertainty_score":0.368404,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2045811671","doi":"10.1007/s12532-014-0067-x","title":"Optimization of algorithms with OPAL","year":2014,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Theory of computation; Computer science; Algorithm; Parallel computing","authors":[{"name":"Charles Audet","is_ca":true},{"name":"Kien-Cong Dang","is_ca":true},{"name":"Dominique Orban","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04018985705435785,"gpt":0.3494476894717266,"spread":0.3092578324173688,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003003802,0.001175875,0.001270082,0.001326166,0.0008536601,0.002939641,0.001655268,0.001081271,0.01169078],"category_scores_gemma":[0.01695778,0.0006370643,0.001236821,0.001532537,0.002330487,0.00335547,0.003609237,0.002890175,0.002321464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001546794,"about_ca_system_score_gemma":0.001986688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001844972,"about_ca_topic_score_gemma":0.002559684,"domain_scores_codex":[0.9973148,0.001198822,0.0001103534,0.000261477,0.0008955149,0.0002191675],"domain_scores_gemma":[0.9962547,0.002117086,0.0002126365,0.0007700209,0.0005308717,0.0001147049],"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.0001600786,0.00008179907,0.0003545827,0.0002336011,0.00005882761,0.00004262658,0.00007382133,0.2183862,0.0007232439,0.6288739,0.007558132,0.1434532],"study_design_scores_gemma":[0.00002602589,0.00003919577,0.00006446428,0.00003519654,0.00001842884,0.00002737245,0.00001693324,0.7615733,0.001090623,0.2264428,0.01065711,0.000008485011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002399337,0.0002929081,0.9829596,0.0003086267,0.0001509335,0.00003390964,0.00004982612,0.0003556051,0.01344921],"genre_scores_gemma":[0.2293143,0.0006606005,0.7477399,0.0003978933,0.000404681,0.000342414,0.0002302364,0.0008888895,0.02002111],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01169078,"threshold_uncertainty_score":0.03910953,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976836184","doi":"10.1007/s12532-014-0076-9","title":"The strength of multi-row models","year":2014,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Row; Cutting-plane method; Intersection (aeronautics); Theory of computation; Integer programming; Facet (psychology); Mathematics; Integer (computer science); Row and column spaces; Set (abstract data type); Relaxation (psychology); Mathematical optimization; Combinatorics; Algorithm; Computer science","authors":[{"name":"Quentin Louveaux","is_ca":false},{"name":"Laurent Poirrier","is_ca":true},{"name":"Domenico Salvagnin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03047758135400954,"gpt":0.2884824426648527,"spread":0.2580048613108432,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001590761,0.0009046074,0.001420598,0.0004106324,0.000767849,0.00261417,0.003275034,0.001516621,0.01082511],"category_scores_gemma":[0.009168427,0.0008645131,0.001244056,0.0007608315,0.001190204,0.005166707,0.001772376,0.003314509,0.003991931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005583349,"about_ca_system_score_gemma":0.001243428,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003198318,"about_ca_topic_score_gemma":0.003314106,"domain_scores_codex":[0.9985595,0.0006898199,0.00005226329,0.0002264309,0.000392644,0.00007942993],"domain_scores_gemma":[0.9949875,0.002238823,0.0003171854,0.001629095,0.0006641091,0.0001633399],"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.00008588774,0.0000842184,0.0007463006,0.0002085483,0.0001202847,0.00006944386,0.00008544225,0.4878322,0.001021522,0.4577625,0.00868133,0.04330238],"study_design_scores_gemma":[0.000009877002,0.00002753367,0.00007204503,0.0000241331,0.00001988629,0.00003185754,0.00002243809,0.851375,0.0003973817,0.1412562,0.006747231,0.00001643388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006493467,0.0006601142,0.9727545,0.001997569,0.0003747712,0.00002612257,0.0001876563,0.0003086267,0.01719727],"genre_scores_gemma":[0.5680534,0.003174558,0.391562,0.001709269,0.00125983,0.0002254509,0.0005598081,0.0007610588,0.03269465],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01082511,"threshold_uncertainty_score":0.03621364,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3128841739","doi":"10.1007/s12532-020-00200-8","title":"Design and implementation of a modular interior-point solver for linear optimization","year":2021,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Interior point method; Solver; Computer science; Linear algebra; Linear programming; Benchmark (surveying); Speedup; Modular design; Context (archaeology); Mathematical optimization; Parallel computing; Point (geometry); Theoretical computer science; Algorithm; Mathematics; Programming language","authors":[{"name":"Mathieu Tanneau","is_ca":true},{"name":"Miguel F. Anjos","is_ca":false},{"name":"Andrea Lodi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.068070465368407,"gpt":0.4068720588175621,"spread":0.3388015934491551,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008160644,0.0009106364,0.0007360353,0.0006154619,0.0004960454,0.0009334872,0.002413731,0.0009358846,0.01084555],"category_scores_gemma":[0.002423143,0.0005395776,0.0006672341,0.0005858531,0.0004956616,0.0006570466,0.001340843,0.001269789,0.004012479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004572004,"about_ca_system_score_gemma":0.001699395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001136304,"about_ca_topic_score_gemma":0.001515739,"domain_scores_codex":[0.9994078,0.0001021341,0.00003367997,0.0000910596,0.0002882182,0.00007712769],"domain_scores_gemma":[0.9992421,0.0001886547,0.00007453845,0.0001447008,0.0002872079,0.00006284026],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004659407,0.0003155249,0.002013987,0.0005008774,0.0001333308,0.0002539793,0.0002760556,0.479469,0.06270322,0.05215285,0.01490239,0.386813],"study_design_scores_gemma":[0.00008668705,0.0001066389,0.0001688339,0.00001819694,0.00002054428,0.00007369556,0.00002089905,0.9636596,0.02054738,0.004263114,0.01101835,0.000016052],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003915571,0.00003515449,0.9905202,0.00005965906,0.00003206811,0.00009507269,0.00005011775,0.00223474,0.003057414],"genre_scores_gemma":[0.1030863,0.00006876591,0.8926486,0.00009702386,0.00002729576,0.0003678132,0.000227046,0.000649988,0.002827046],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01084555,"threshold_uncertainty_score":0.03628194,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1678874697","doi":"10.1007/s12532-018-0145-6","title":"Enumeration of 2-level polytopes","year":2018,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Polytope; Enumeration; Facet (psychology); Combinatorics; Hyperplane; Mathematics; Dimension (graph theory); Polytope model; Regular polygon; Convex polytope; Polyhedral combinatorics; Birkhoff polytope; Discrete mathematics; Convex set; Convex optimization; Geometry","authors":[{"name":"Adam Bohn","is_ca":false},{"name":"Yuri Faenza","is_ca":false},{"name":"Samuel Fiorini","is_ca":false},{"name":"Vissarion Fisikopoulos","is_ca":false},{"name":"Marco Macchia","is_ca":false},{"name":"Kanstantsin Pashkovich","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05674897302707881,"gpt":0.3476662067615719,"spread":0.2909172337344931,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003826574,0.0006677738,0.0009522997,0.001474903,0.001179114,0.003571334,0.00161603,0.001336781,0.03066769],"category_scores_gemma":[0.002824087,0.0007775816,0.001280794,0.002217968,0.0008574083,0.003304139,0.002330565,0.002580022,0.004422521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008467141,"about_ca_system_score_gemma":0.0005315634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009841893,"about_ca_topic_score_gemma":0.002089757,"domain_scores_codex":[0.9993337,0.0001523094,0.00003977797,0.000126586,0.0001916117,0.0001560134],"domain_scores_gemma":[0.9988347,0.0005492799,0.00009455143,0.0002170238,0.0001704833,0.0001340113],"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.0001593203,0.0002366303,0.001588883,0.0004695265,0.00005429097,0.000215538,0.0004071103,0.03840957,0.005464865,0.8382889,0.01937982,0.09532552],"study_design_scores_gemma":[0.0000445271,0.00004963823,0.0008461136,0.00008941045,0.0000294638,0.0002297851,0.0002283844,0.1037588,0.003226286,0.870416,0.02105383,0.00002782048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2328577,0.000446465,0.6644281,0.001331613,0.0001809123,0.0001936016,0.002586527,0.00103536,0.09693968],"genre_scores_gemma":[0.4715624,0.000501717,0.4742354,0.0004659191,0.0001056665,0.0004242571,0.005762008,0.0007914651,0.04615118],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03066769,"threshold_uncertainty_score":0.1025937,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4387845108","doi":"10.1007/s12532-023-00248-2","title":"Domain-Driven Solver (DDS) Version 2.1: a MATLAB-based software package for convex optimization problems in domain-driven form","year":2023,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Solver; Second-order cone programming; Mathematical optimization; Mathematics; Linear programming; Convex optimization; Semidefinite programming; Computer science; Applied mathematics; Quadratic programming; Algorithm; Regular polygon","authors":[{"name":"Mehdi Karimi","is_ca":false},{"name":"Levent Tunçel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05031470689977383,"gpt":0.3484830661823973,"spread":0.2981683592826235,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001243485,0.001279023,0.00122378,0.0007999727,0.0004411697,0.001558445,0.002120964,0.001424349,0.06617115],"category_scores_gemma":[0.005662321,0.0008163308,0.0009800853,0.0008648987,0.0005357203,0.001195018,0.001930794,0.003325017,0.01959971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003975861,"about_ca_system_score_gemma":0.002286995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002004203,"about_ca_topic_score_gemma":0.003267117,"domain_scores_codex":[0.9994337,0.0001231368,0.0000597681,0.00006782644,0.0002583458,0.00005720766],"domain_scores_gemma":[0.997843,0.001244998,0.0001268853,0.0001960941,0.0005082879,0.00008071874],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002455701,0.0001975489,0.001493476,0.002520395,0.0002377972,0.0005546699,0.0003439361,0.2900209,0.0150304,0.1304583,0.3012559,0.257641],"study_design_scores_gemma":[0.0001592308,0.00004421857,0.0002700372,0.0001584274,0.00003782755,0.0003567871,0.00005226943,0.7792358,0.01302517,0.03954533,0.1670564,0.00005837297],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.001130021,0.0001954051,0.9702472,0.0001746273,0.00009943627,0.00009698732,0.001938243,0.01762055,0.008497493],"genre_scores_gemma":[0.02748177,0.0005089202,0.9377512,0.0003622519,0.000062744,0.0009163906,0.004657572,0.01687253,0.01138672],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.06617115,"threshold_uncertainty_score":0.2213645,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111997007","doi":"10.1007/s12532-012-0050-3","title":"Trajectory-following methods for large-scale degenerate convex quadratic programming","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Mathematical optimization; Degenerate energy levels; Mathematics; Complementarity (molecular biology); Quadratic programming; Regular polygon; Complementarity theory; Degeneracy (biology); Convex optimization; Quadratic growth; Convergence (economics); Applied mathematics; Computer science; Algorithm; Geometry","authors":[{"name":"Nicholas I. M. Gould","is_ca":false},{"name":"Dominique Orban","is_ca":true},{"name":"Daniel P. Robinson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06588397214478896,"gpt":0.4300520505632912,"spread":0.3641680784185022,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001643923,0.0009794543,0.001174346,0.0007227021,0.0008379571,0.001008929,0.001873134,0.001630904,0.004785594],"category_scores_gemma":[0.006265415,0.000633161,0.0008811028,0.0008251113,0.001456865,0.001859171,0.002880444,0.002628309,0.0007389318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001138849,"about_ca_system_score_gemma":0.001681368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006755725,"about_ca_topic_score_gemma":0.0066091,"domain_scores_codex":[0.9995794,0.0001774584,0.00002035761,0.0000595341,0.0001329633,0.00003031682],"domain_scores_gemma":[0.9980648,0.001149714,0.0001369657,0.0001455273,0.0003573774,0.0001456276],"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.0000823091,0.0000624132,0.0003697248,0.0001790326,0.00005008441,0.00007617808,0.0001362402,0.7816197,0.001353681,0.1702067,0.003759856,0.04210421],"study_design_scores_gemma":[0.000003475009,0.000005704917,0.000016528,0.000004622804,0.000001519865,0.000004562119,0.000005003923,0.9836758,0.00006663299,0.01573981,0.0004733602,0.000002969613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002401149,0.0001754519,0.9951284,0.0001787449,0.00005829078,0.00002412214,0.00002969617,0.00007467558,0.001929455],"genre_scores_gemma":[0.3341577,0.000738156,0.6420344,0.0003759734,0.0002323446,0.0005354392,0.0003999135,0.0006443351,0.02088173],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006755725,"threshold_uncertainty_score":0.01600939,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4396927647","doi":"10.1007/s12532-024-00253-z","title":"Progressively strengthening and tuning MIP solvers for reoptimization","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Parallel computing; Theory of computation; Operations management; Operations research; Mathematical optimization; Mathematics; Algorithm; Economics","authors":[{"name":"Krunal Kishor Patel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03303405857604129,"gpt":0.3292207379324631,"spread":0.2961866793564218,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005248784,0.002316304,0.001677419,0.001628712,0.0008196868,0.002443807,0.003308618,0.001673947,0.007371332],"category_scores_gemma":[0.03066584,0.001162848,0.001544488,0.001092797,0.001143513,0.003694429,0.003400606,0.004238436,0.002352135],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009654468,"about_ca_system_score_gemma":0.002780479,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00240652,"about_ca_topic_score_gemma":0.003510841,"domain_scores_codex":[0.9966248,0.001507749,0.0002189276,0.0005075154,0.000845928,0.0002950962],"domain_scores_gemma":[0.9892377,0.004999409,0.0006017286,0.002972998,0.00198095,0.0002072472],"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.0002815171,0.0004494143,0.002701282,0.0004730296,0.0002381777,0.0001345201,0.0003009005,0.6236253,0.01627942,0.02691076,0.008975065,0.3196306],"study_design_scores_gemma":[0.00002415316,0.00005437852,0.0001817984,0.00005154886,0.00004747052,0.00002605668,0.00005282498,0.9851367,0.002570435,0.00833227,0.003510997,0.00001122528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03594234,0.001099878,0.9455032,0.0007341312,0.0003995408,0.0002162376,0.0001100212,0.003030027,0.01296465],"genre_scores_gemma":[0.320287,0.0005303347,0.673322,0.0006992915,0.0002626944,0.0003076363,0.0004373889,0.001326023,0.00282764],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007371332,"threshold_uncertainty_score":0.02775854,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4286984759","doi":"10.1007/s12532-024-00274-8","title":"LinA: a faster approach to piecewise linear approximations using corridors and its application to mixed-integer optimization","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Integer (computer science); Piecewise linear function; Mathematical optimization; Integer programming; Piecewise; Mathematics; Approximations of π; Applied mathematics; Computer science; Mathematical analysis","authors":[{"name":"Julien Codsi","is_ca":true},{"name":"Sandra Ulrich Ngueveu","is_ca":false},{"name":"Bernard Gendron","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05488586377177668,"gpt":0.3800281116634619,"spread":0.3251422478916852,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00211673,0.001691979,0.001705076,0.001671353,0.0009293482,0.002083029,0.002991699,0.001690868,0.02106675],"category_scores_gemma":[0.008705581,0.001177175,0.002024902,0.002163613,0.0008043438,0.002946872,0.003234687,0.004816303,0.005762213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009109123,"about_ca_system_score_gemma":0.001896821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006005952,"about_ca_topic_score_gemma":0.008899318,"domain_scores_codex":[0.9988557,0.0004307657,0.00005582856,0.0001116674,0.0004398633,0.0001061199],"domain_scores_gemma":[0.9970582,0.001568551,0.0001615765,0.0005170701,0.0005353707,0.0001594322],"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.0004099997,0.0002151222,0.0007239331,0.0004119278,0.0001561596,0.0001604381,0.0002003731,0.5487089,0.005051121,0.08387144,0.01268927,0.3474013],"study_design_scores_gemma":[0.00001434305,0.0000233546,0.00003123889,0.000022661,0.000008869912,0.00002062049,0.00001436728,0.9841541,0.0008581316,0.01021165,0.004630068,0.00001055452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001573534,0.0001402767,0.9949338,0.00006472681,0.00008861587,0.00002559415,0.00006501944,0.001250619,0.001857835],"genre_scores_gemma":[0.04490624,0.0002097453,0.9480002,0.0001610334,0.00007981643,0.0002357924,0.0002527949,0.001406705,0.004747705],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02106675,"threshold_uncertainty_score":0.07047534,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3215819884","doi":"10.1007/s12532-024-00254-y","title":"Nonlinear conjugate gradient for smooth convex functions","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Nonlinear system; Nonlinear conjugate gradient method; Mathematics; Conjugate; Regular polygon; Mathematical analysis; Computer science; Physics; Geometry; Gradient descent; Artificial intelligence","authors":[{"name":"Sahar Karimi","is_ca":true},{"name":"Stephen A. Vavasis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07001615077258662,"gpt":0.3931760246580674,"spread":0.3231598738854808,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001779469,0.001045902,0.001050294,0.001029617,0.0005806996,0.00189351,0.0008708378,0.001251412,0.003563256],"category_scores_gemma":[0.009631488,0.0006216292,0.0006441016,0.001055749,0.002599853,0.00261469,0.002149238,0.002552966,0.001019842],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001103312,"about_ca_system_score_gemma":0.000935397,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00180483,"about_ca_topic_score_gemma":0.001912633,"domain_scores_codex":[0.9994047,0.0003242607,0.00001841433,0.00006898776,0.0001511513,0.00003248111],"domain_scores_gemma":[0.9981934,0.0011542,0.0001062631,0.0001605025,0.0002903912,0.00009527525],"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.0001259404,0.00005084533,0.0003383131,0.0002680348,0.00006085818,0.0001057682,0.0001390918,0.1900641,0.003048142,0.758549,0.005689982,0.0415599],"study_design_scores_gemma":[0.00001424875,0.00002182256,0.0001107611,0.00001729099,0.00000795653,0.00003033567,0.00001609552,0.694882,0.0006894395,0.3016251,0.002574735,0.00001013624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008852541,0.0006903007,0.9846591,0.0006492833,0.0001629555,0.00002576168,0.00003792326,0.00008275362,0.004839347],"genre_scores_gemma":[0.430963,0.002862255,0.5197719,0.0005732824,0.0006364294,0.000303438,0.0003215893,0.0006185554,0.04394956],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003563256,"threshold_uncertainty_score":0.01192027,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2910526083","doi":"10.1007/s12532-020-00180-9","title":"Split cuts from sparse disjunctions","year":2020,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Exploit; Theory of computation; Simplex; Integer (computer science); Mathematics; Class (philosophy); Algorithm; Computer science; Mathematical optimization; Cutting-plane method; Integer programming; Combinatorics; Artificial intelligence","authors":[{"name":"Ricardo Fukasawa","is_ca":true},{"name":"Laurent Poirrier","is_ca":true},{"name":"Shenghao Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03308505023616477,"gpt":0.2367454607671191,"spread":0.2036604105309543,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001687546,0.0009562343,0.00150959,0.001957861,0.0007151489,0.002363048,0.001410252,0.001417982,0.01218888],"category_scores_gemma":[0.01278373,0.00133641,0.00135938,0.002607886,0.001363457,0.004389462,0.002232801,0.004277695,0.001241373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009404297,"about_ca_system_score_gemma":0.0006084539,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001109616,"about_ca_topic_score_gemma":0.0021466,"domain_scores_codex":[0.9984776,0.0004378062,0.00007800706,0.0003050109,0.0005854492,0.0001160403],"domain_scores_gemma":[0.9940358,0.004472052,0.0002900022,0.0005565115,0.0005110854,0.0001345735],"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.0003422954,0.0001846367,0.0007928628,0.0005039998,0.0001285191,0.0002819459,0.000306934,0.2590182,0.003217587,0.4560371,0.02127048,0.2579155],"study_design_scores_gemma":[0.00002493851,0.00003290832,0.0002055393,0.00006081111,0.00002588774,0.0001148468,0.00006227809,0.4780933,0.001641835,0.5148885,0.004839528,0.000009699667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02048111,0.0004515578,0.9690754,0.0004458039,0.0001102856,0.00008990217,0.0004186042,0.000353671,0.008573442],"genre_scores_gemma":[0.2442432,0.0006245607,0.7406033,0.0003697904,0.0002400749,0.0002755277,0.002434179,0.0006177876,0.01059166],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01218888,"threshold_uncertainty_score":0.0407759,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4399389097","doi":"10.1007/s12532-024-00256-w","title":"The MIP Workshop 2023 Computational Competition on reoptimization","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Benchmark (surveying); Theory of computation; Competition (biology); Computer science; Integer programming; Integer (computer science); Linear programming; Mathematical optimization; Operations research; Algorithm; Mathematics; Programming language","authors":[{"name":"Suresh Bolusani","is_ca":false},{"name":"Mathieu Besançon","is_ca":false},{"name":"Ambros Gleixner","is_ca":false},{"name":"Timo Berthold","is_ca":false},{"name":"Claudia D’Ambrosio","is_ca":false},{"name":"Gonzalo Muñoz","is_ca":false},{"name":"Joseph Paat","is_ca":true},{"name":"Dimitri Thomopulos","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1145559480526452,"gpt":0.4124956066924428,"spread":0.2979396586397977,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01513332,0.002200084,0.002190533,0.001257152,0.001754875,0.00567064,0.003924562,0.002818556,0.02145428],"category_scores_gemma":[0.02459959,0.0006001859,0.002416768,0.001977203,0.001627235,0.003078678,0.003751938,0.006339456,0.00335502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004764409,"about_ca_system_score_gemma":0.006424141,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007572696,"about_ca_topic_score_gemma":0.009594891,"domain_scores_codex":[0.9903243,0.004150772,0.0003453724,0.001325643,0.002588471,0.001265479],"domain_scores_gemma":[0.9846656,0.007471982,0.0004411635,0.002477292,0.003167049,0.001776886],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0009948276,0.0007601918,0.0007114043,0.0004712878,0.0001685581,0.0002851111,0.0001068352,0.2013574,0.001406693,0.1260086,0.5695581,0.09817106],"study_design_scores_gemma":[0.0006630488,0.0004943571,0.001507634,0.0002692687,0.00006307659,0.0001867894,0.0003124348,0.6548291,0.005697617,0.1008366,0.2350498,0.00009042976],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.1497633,0.006800741,0.4224169,0.07488228,0.01642261,0.002637805,0.02685183,0.008276008,0.2919485],"genre_scores_gemma":[0.5076101,0.001495981,0.381084,0.00869516,0.002654101,0.002440245,0.03763937,0.003538787,0.05484239],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.02145428,"threshold_uncertainty_score":0.0800336,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4406597533","doi":"10.1007/s12532-024-00266-8","title":"On the B-differential of the componentwise minimum of two affine vector functions","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Mathematics; Hyperplane; Affine transformation; Matroid; Discrete mathematics; Reachability; Affine space; Applied mathematics; Combinatorics; Pure mathematics","authors":[{"name":"Jean‐Pierre Dussault","is_ca":true},{"name":"Jean Charles Gilbert","is_ca":true},{"name":"Baptiste Plaquevent-Jourdain","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01875176774441866,"gpt":0.2757400987812019,"spread":0.2569883310367832,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00128068,0.0006876877,0.0008822137,0.001983593,0.000546671,0.001645131,0.001041633,0.001144414,0.004105246],"category_scores_gemma":[0.005185874,0.0004223685,0.0004702841,0.001157216,0.002214655,0.002032895,0.001649904,0.002003402,0.0005156487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001227092,"about_ca_system_score_gemma":0.0007178683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001877004,"about_ca_topic_score_gemma":0.00180149,"domain_scores_codex":[0.9996284,0.0001472187,0.000017397,0.00007147974,0.00009476663,0.00004076562],"domain_scores_gemma":[0.9987722,0.0007397496,0.0001199227,0.00004136162,0.0002098638,0.0001168917],"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.0001175126,0.00005038715,0.0006881412,0.0001661884,0.00002949291,0.0001185153,0.0002386993,0.05155797,0.005217473,0.9086641,0.003023973,0.03012754],"study_design_scores_gemma":[0.00002033492,0.00006607077,0.000621341,0.00006844453,0.00001500198,0.0001391259,0.0001117813,0.4618564,0.001736207,0.5317895,0.003546169,0.00002966274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.152604,0.001593197,0.8134287,0.001384972,0.0002941718,0.00005780296,0.0001554382,0.0001453137,0.03033636],"genre_scores_gemma":[0.857181,0.001533567,0.1184316,0.0004127783,0.0002274712,0.0001120906,0.0002770496,0.0003797767,0.02144473],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004105246,"threshold_uncertainty_score":0.01373339,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4403238270","doi":"10.1007/s12532-024-00262-y","title":"Local elimination in the traveling salesman problem","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Rheinische Friedrich-Wilhelms-Universität Bonn; Deutsche Forschungsgemeinschaft","keywords":"Travelling salesman problem; Theory of computation; Mathematical optimization; Computer science; Mathematics; Algorithm","authors":[{"name":"William J. Cook","is_ca":true},{"name":"Keld Helsgaun","is_ca":false},{"name":"Stefan Hougardy","is_ca":false},{"name":"Rasmus T. Schroeder","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02071651806296831,"gpt":0.2932313392360823,"spread":0.272514821173114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001115142,0.0005014557,0.001039742,0.0007503068,0.0005987281,0.0008591093,0.001273724,0.0004523042,0.004011905],"category_scores_gemma":[0.003069822,0.0003099207,0.00102705,0.0009424835,0.0008776656,0.0009961777,0.001045867,0.001345546,0.0005504408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007150239,"about_ca_system_score_gemma":0.001043687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004497722,"about_ca_topic_score_gemma":0.004910377,"domain_scores_codex":[0.9990214,0.0005253942,0.0000195356,0.0001026625,0.0001867281,0.0001442506],"domain_scores_gemma":[0.9984842,0.001117226,0.00009074799,0.0001202667,0.0001361959,0.00005141157],"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.0003535782,0.0003886374,0.001769662,0.0003764242,0.0001479386,0.0004488404,0.0002619616,0.8125944,0.004263073,0.08585709,0.007748975,0.08578947],"study_design_scores_gemma":[0.0001246368,0.0001335057,0.0003865801,0.00001957764,0.00004466488,0.00008451021,0.00008297592,0.9497409,0.002608574,0.04325055,0.003511817,0.00001161936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2471818,0.000575062,0.7326786,0.0007041495,0.00004498718,0.0002130182,0.0002279234,0.0006687824,0.01770565],"genre_scores_gemma":[0.7763413,0.0003832231,0.2129454,0.0001655188,0.00004959167,0.0002311316,0.000613019,0.0001711932,0.009099566],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004497722,"threshold_uncertainty_score":0.01342112,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1907633005","doi":"10.1007/s12532-015-0091-5","title":"Communication protocols for options and results in a distributed optimization environment","year":2015,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Solver; Computer science; Theory of computation; Generator (circuit theory); Software; Representation (politics); Integer programming; Mathematical optimization; Nonlinear programming; Theoretical computer science; Distributed computing; Parallel computing; Nonlinear system; Programming language; Algorithm; Mathematics; Power (physics)","authors":[{"name":"Horand I. Gassmann","is_ca":true},{"name":"Jun Ma","is_ca":false},{"name":"Kipp Martin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06033538304376564,"gpt":0.320157506209477,"spread":0.2598221231657114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072908,0.0008172998,0.00103792,0.001127833,0.002540147,0.004837585,0.002610654,0.001836919,0.009964839],"category_scores_gemma":[0.02044579,0.0007561903,0.001025843,0.001669397,0.002914834,0.006778985,0.006596443,0.004427325,0.001633427],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001457998,"about_ca_system_score_gemma":0.002192373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009311621,"about_ca_topic_score_gemma":0.001163275,"domain_scores_codex":[0.9955741,0.002125358,0.0003057272,0.0003899443,0.001346034,0.0002587805],"domain_scores_gemma":[0.991193,0.005295285,0.0003874765,0.002147544,0.0006823855,0.0002943983],"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.0001187913,0.00004861628,0.0001247733,0.00005326327,0.00002302229,0.00006119414,0.0001958295,0.04610021,0.0006074563,0.9243276,0.003193123,0.02514631],"study_design_scores_gemma":[0.00006293289,0.00002587788,0.00005107229,0.00002495251,0.00001968171,0.00003481612,0.00005872013,0.2138232,0.001142292,0.7758818,0.008855647,0.00001902609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00941025,0.0001925025,0.9740484,0.00143233,0.0002029659,0.0001320149,0.00009421336,0.0003479257,0.01413942],"genre_scores_gemma":[0.3983984,0.0005157574,0.5713708,0.0005328459,0.0003201742,0.001165933,0.0003322291,0.0005924291,0.02677129],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009964839,"threshold_uncertainty_score":0.03855789,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}