{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":8,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":8,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"ac6550139867","filters":{"venue":"EURO Journal on Computational Optimization"}},"results":[{"id":"W2021523863","doi":"10.1007/s13675-014-0024-5","title":"Solving wind farm layout optimization with mixed integer programs and constraint programs","year":2014,"lang":"en","type":"article","venue":"EURO Journal on Computational Optimization","topic":"Wind Energy Research and Development","field":"Engineering","cited_by":58,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical optimization; Integer programming; Nonlinear programming; Constraint (computer-aided design); Wind power; Computer science; Stochastic programming; Nonlinear system; Linear programming; Profit (economics); Optimization problem; Mathematics; Engineering; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.01148557197084815,"gpt":0.2081385519744472,"spread":0.196652980003599,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003289403,0.00020283,0.0001698754,0.0001986591,0.0002049012,0.0003791883,0.00009337253,0.00005980714,0.00002974193],"category_scores_gemma":[0.00005056151,0.0001683308,0.00003341788,0.0002549453,0.00007343316,0.0002254927,0.00002137679,0.000287166,0.000005879431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008920793,"about_ca_system_score_gemma":0.00006972894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000011806,"about_ca_topic_score_gemma":0.000002187305,"domain_scores_codex":[0.998639,0.00008439025,0.0003216586,0.000192218,0.0004759167,0.000286816],"domain_scores_gemma":[0.9992341,0.00008191948,0.00009249388,0.00007083137,0.0002996284,0.0002210451],"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.00004230404,0.00005552355,0.0005461905,0.00001510953,0.00005529355,0.00001111375,0.0001314967,0.9641613,0.000002622832,0.0006243534,0.00006415151,0.03429054],"study_design_scores_gemma":[0.0008997298,0.000365407,0.0006523037,0.0001333439,0.00001026003,0.0002006229,0.00005629293,0.9965488,0.00001248605,0.0001386819,0.0007703237,0.0002117873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01659134,0.00003822233,0.980615,0.0002554417,0.0001984357,0.0001990292,9.975851e-7,0.0001511804,0.001950332],"genre_scores_gemma":[0.6826509,0.0000326152,0.3168005,0.0001033475,0.0001532465,0.000009283953,0.0001587534,0.00004669768,0.00004469193],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6660595,"threshold_uncertainty_score":0.6864329,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030995871","doi":"10.1007/s13675-014-0020-9","title":"Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design","year":2014,"lang":"en","type":"article","venue":"EURO Journal on Computational Optimization","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Column generation; Mathematics; Mathematical optimization; Lagrangian relaxation; Flow network; Fixed charge; Relaxation (psychology); Scale (ratio); Flow (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.01876723607481046,"gpt":0.2348211210597049,"spread":0.2160538849848945,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006605585,0.0001718751,0.0002076615,0.00009659999,0.0003147403,0.0001687776,0.00006895055,0.00006976942,0.0000450658],"category_scores_gemma":[0.0002254671,0.0001656518,0.00005093915,0.0001452312,0.00002388713,0.0002155436,0.00001617769,0.0001968987,0.000009825107],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003468415,"about_ca_system_score_gemma":0.0000121515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.130815e-7,"about_ca_topic_score_gemma":2.251355e-7,"domain_scores_codex":[0.9989108,0.0001156063,0.0003671268,0.0001561219,0.0001938729,0.0002564668],"domain_scores_gemma":[0.9987413,0.0007338625,0.0001092648,0.00006621382,0.0001819997,0.0001673657],"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.00002665506,0.00003946948,0.0000204381,0.00003572661,0.00002549868,5.026171e-7,0.0001513721,0.9915869,0.000005836347,0.004702344,0.001265787,0.002139496],"study_design_scores_gemma":[0.001072221,0.0001253363,0.00009053305,0.00004824897,0.00002311116,0.00002958389,0.000007677701,0.9923862,0.00001771978,0.004490466,0.001532198,0.0001767392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001236444,0.00005646738,0.9972929,0.0003504067,0.0003106345,0.0002995218,0.000007377043,0.0001564833,0.0002897949],"genre_scores_gemma":[0.2309849,0.00006306647,0.7680709,0.0004607088,0.0002503662,0.00001536862,0.00005533162,0.00005285429,0.0000464718],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2297485,"threshold_uncertainty_score":0.6755084,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2327951994","doi":"10.1007/s13675-016-0075-x","title":"Variable neighborhood search: basics and variants","year":2016,"lang":"en","type":"article","venue":"EURO Journal on Computational Optimization","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Variable neighborhood search; Heuristics; Metaheuristic; Implementation; Mathematical optimization; Variable (mathematics); Computer science; Local search (optimization); Mathematics; Perturbation (astronomy); Theoretical computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02770844702848207,"gpt":0.2690038019831024,"spread":0.2412953549546203,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001033294,0.0001819329,0.0001845275,0.0004068255,0.0003722173,0.0005823226,0.0005369987,0.00006267439,0.0002875272],"category_scores_gemma":[0.0008361213,0.0001328156,0.00004216319,0.0007047562,0.00006314542,0.001064625,0.0001865765,0.0002425073,0.00008625077],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001013198,"about_ca_system_score_gemma":0.0003310665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.348061e-7,"about_ca_topic_score_gemma":3.023797e-8,"domain_scores_codex":[0.9973584,0.0004207295,0.0004494701,0.0004077649,0.001028566,0.0003351072],"domain_scores_gemma":[0.9974454,0.0008860011,0.0002483676,0.0002548326,0.0008353905,0.0003300302],"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.00001607059,0.0000686209,0.0001064515,0.000003344727,0.00002233559,0.00002686474,0.00004054753,0.7909808,0.00001180614,0.1877529,0.0004122965,0.02055787],"study_design_scores_gemma":[0.001143645,0.0002004796,0.001490205,0.00004797567,0.000005363493,0.000285851,0.000003081289,0.9788544,0.00001544239,0.01687005,0.0009103182,0.0001732567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000628156,0.00003619576,0.9904571,0.006248801,0.0004373027,0.000148737,0.000009217891,0.00008055953,0.002519243],"genre_scores_gemma":[0.03243023,0.0001338127,0.9657378,0.0008257723,0.0002009538,0.000003796779,0.00000832082,0.00002753081,0.000631757],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1878735,"threshold_uncertainty_score":0.561535,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2914964871","doi":"10.1007/s13675-019-00119-3","title":"A decomposition-based heuristic for large employee scheduling problems with inter-department transfers","year":2019,"lang":"en","type":"article","venue":"EURO Journal on Computational Optimization","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"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":"Scheduling (production processes); Computer science; Job shop scheduling; Heuristic; Schedule; Time horizon; Mathematical optimization; Operations research; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.05109040726476697,"gpt":0.3510804581731453,"spread":0.2999900509083783,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001775797,0.0002034227,0.000280719,0.0005347648,0.0005043208,0.0005583478,0.0003108272,0.00005600595,0.0002438674],"category_scores_gemma":[0.000542196,0.0001543595,0.000187526,0.0006500126,0.00002887383,0.0003145209,0.00001287915,0.0002505964,0.0001479159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001109164,"about_ca_system_score_gemma":0.000311171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.309611e-7,"about_ca_topic_score_gemma":0.000001547893,"domain_scores_codex":[0.9971209,0.0002248159,0.0007416664,0.0004270226,0.001159735,0.0003258636],"domain_scores_gemma":[0.9959865,0.00205018,0.0003575607,0.0001957269,0.001231912,0.0001780965],"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.0002722616,0.0001956447,0.002583174,0.000006806935,0.0000458828,0.000003629169,0.0000895694,0.9944141,0.000006694566,0.001782205,0.0002413983,0.0003586223],"study_design_scores_gemma":[0.002750919,0.001070593,0.001353801,0.0001262829,0.00003906856,0.00004526712,0.00005105884,0.9898967,0.00002003529,0.003661687,0.0007863134,0.0001982841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08073811,0.00002727032,0.9157385,0.002203931,0.0005151149,0.0004990496,0.00006164749,0.00005759712,0.0001587242],"genre_scores_gemma":[0.7099619,0.00000185833,0.2889912,0.0006845733,0.00009621201,0.00001840784,0.0001181839,0.00002708628,0.0001005941],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6292238,"threshold_uncertainty_score":0.6294596,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2563370187","doi":"10.1007/s13675-018-0101-2","title":"Alternative SDP and SOCP approximations for polynomial optimization","year":2018,"lang":"en","type":"article","venue":"EURO Journal on Computational Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Division of Civil, Mechanical and Manufacturing Innovation","keywords":"Semidefinite programming; Set (abstract data type); Polynomial; Explained sum of squares; Linear programming; Optimization problem; Second-order cone programming","retraction":null,"screen_n_in":null,"score":{"opus":0.06303692224109246,"gpt":0.3769473133425741,"spread":0.3139103911014817,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005988026,0.0002518697,0.0002603165,0.0004854424,0.0008812897,0.0002935758,0.000205553,0.00009717324,0.0002628697],"category_scores_gemma":[0.001547876,0.0002474593,0.00008940794,0.0004362482,0.0001897634,0.0006594807,0.00006067946,0.0002697929,0.00001354696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001846854,"about_ca_system_score_gemma":0.0001622676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.977019e-7,"about_ca_topic_score_gemma":4.815045e-7,"domain_scores_codex":[0.9978311,0.0001946517,0.0006406059,0.0003753245,0.0006370893,0.0003212023],"domain_scores_gemma":[0.9962019,0.001112623,0.0005121488,0.0001501106,0.001818379,0.0002048325],"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.0001827867,0.0001396858,0.000009705452,0.00001902845,0.00005308321,0.000002376857,0.0002773938,0.9776669,0.000003234829,0.01761979,0.002192539,0.001833459],"study_design_scores_gemma":[0.001905211,0.000462994,0.00002301713,0.00004948814,0.00002506675,0.00008881429,0.00005316057,0.9559799,0.000050269,0.04038565,0.0007427785,0.0002336169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004405944,0.00002056454,0.9957344,0.001645542,0.0004572623,0.0007031211,0.00005329251,0.00009337439,0.0008518404],"genre_scores_gemma":[0.01118565,0.00005385902,0.9864866,0.0004492403,0.001094415,0.00004250259,0.0001301408,0.00008285495,0.0004746919],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02276586,"threshold_uncertainty_score":0.9999978,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035888716","doi":"10.1007/s13675-013-0012-1","title":"Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem","year":2013,"lang":"en","type":"article","venue":"EURO Journal on Computational Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Kronos (Canada); Group for Research in Decision Analysis; Université du Québec à Montréal; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Depot; Mathematical optimization; Scheduling (production processes); Multi-commodity flow problem; Computer science; Flow network; Column generation; Set (abstract data type); Mathematics; Operations research","retraction":null,"screen_n_in":null,"score":{"opus":0.03596227856412682,"gpt":0.2892528394277084,"spread":0.2532905608635816,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007499827,0.0002064431,0.0001883646,0.0001388826,0.0005945988,0.0004841136,0.0001491425,0.0000694719,0.00004940549],"category_scores_gemma":[0.0004570101,0.000174938,0.00006891959,0.0002441421,0.00003857182,0.0005059649,0.00003198683,0.0002917591,0.00001136099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007282359,"about_ca_system_score_gemma":0.00003968032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004180284,"about_ca_topic_score_gemma":5.895095e-7,"domain_scores_codex":[0.9984651,0.0001874301,0.0005706673,0.0001886952,0.0003206556,0.0002674771],"domain_scores_gemma":[0.997314,0.00185548,0.0002084324,0.0001041988,0.0004082909,0.0001095468],"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.00001327349,0.00001542781,0.0004347948,0.00003211233,0.00004589224,7.633175e-7,0.0004667925,0.9946454,0.00009152549,0.0005224018,0.0002871951,0.003444383],"study_design_scores_gemma":[0.0008468358,0.00007172333,0.0009926172,0.00005844208,0.00002141974,0.00004220438,0.0001760028,0.9960214,0.0001162212,0.001284502,0.0001690464,0.0001996029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05651757,0.0001882964,0.9412881,0.0008707733,0.000289341,0.0004937843,0.00001100348,0.0001685869,0.0001725527],"genre_scores_gemma":[0.4465862,0.00004405027,0.5527569,0.0002561139,0.000205854,0.00003704308,0.00003104835,0.00005123164,0.00003159959],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3900686,"threshold_uncertainty_score":0.7133764,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2273888011","doi":"10.1007/s13675-015-0059-2","title":"Models for video-on-demand scheduling with costs","year":2016,"lang":"en","type":"article","venue":"EURO Journal on Computational Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University; Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Video on demand; Flexibility (engineering); Server; Scheduling (production processes); On demand; Service provider; Bandwidth (computing); Duration (music); Computer network; Service (business); Multimedia; Operations management","retraction":null,"screen_n_in":null,"score":{"opus":0.02936711467459411,"gpt":0.2708885565075921,"spread":0.241521441832998,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005202586,0.0001768576,0.000157018,0.000302945,0.0003902682,0.0003797223,0.0003958934,0.00004028874,0.00002552948],"category_scores_gemma":[0.0001413513,0.0001140826,0.00006889219,0.0003254743,0.00003660074,0.001153483,0.00003917466,0.0001429544,0.00002669204],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001449705,"about_ca_system_score_gemma":0.0001999996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.909267e-7,"about_ca_topic_score_gemma":1.435639e-7,"domain_scores_codex":[0.9982453,0.0001373952,0.0003564944,0.0003455148,0.0006460089,0.0002693159],"domain_scores_gemma":[0.997875,0.0006777882,0.0002691752,0.0001753723,0.0008056645,0.0001970021],"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.0001072008,0.00007187335,0.00001385473,0.000003227359,0.00002076026,0.000007250288,0.00004814709,0.889484,0.000007803845,0.1052003,0.0005109323,0.004524637],"study_design_scores_gemma":[0.002102515,0.0006944296,0.00003286934,0.0001582568,0.000004516286,0.00007416205,0.000003781658,0.9833651,0.00004467868,0.01287923,0.0004601493,0.0001802673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003142616,0.00001732282,0.9904282,0.007564805,0.0002425031,0.0003190725,0.000006689411,0.00009500692,0.001012148],"genre_scores_gemma":[0.1343914,0.00003551518,0.8626408,0.002524608,0.0001520192,0.00001884611,0.00001125962,0.00002992137,0.0001955916],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1340771,"threshold_uncertainty_score":0.4652154,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4415897674","doi":"10.1016/j.ejco.2025.100122","title":"On the integration of Dantzig-Wolfe and Fenchel decompositions via directional normalizations","year":2025,"lang":"en","type":"article","venue":"EURO Journal on Computational Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National d’Etudes Spatiales","keywords":"Normalization (sociology); Linear programming; Integer programming; Integer (computer science); Decomposition; Convergence (economics); Dual (grammatical number)","retraction":null,"screen_n_in":null,"score":{"opus":0.03781785189837309,"gpt":0.361781206708843,"spread":0.3239633548104699,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005258655,0.0001802793,0.0001960479,0.0005529388,0.0007197713,0.0001234357,0.0001779971,0.00006580569,0.0002213568],"category_scores_gemma":[0.001378488,0.0001404408,0.00008048211,0.0008647134,0.0001299448,0.0002848576,0.00004820317,0.0003813384,0.000006401468],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001359515,"about_ca_system_score_gemma":0.0001663159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001408134,"about_ca_topic_score_gemma":0.00000142376,"domain_scores_codex":[0.9980719,0.0003236587,0.0006172599,0.0002164224,0.0006084188,0.0001623508],"domain_scores_gemma":[0.995661,0.002706223,0.0003555437,0.0001606844,0.001040067,0.00007643885],"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.00005360185,0.0001780502,0.00002562136,0.000008738247,0.00004355469,0.000001423259,0.00008544865,0.7654067,0.00005232953,0.2313382,0.001597572,0.001208794],"study_design_scores_gemma":[0.000518924,0.0001255613,0.0005513402,0.000134689,0.00002688057,0.00004351931,0.00005117754,0.8527537,0.0002935547,0.1452646,0.0001290909,0.000106981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002487771,0.0000324826,0.9895934,0.004233747,0.0002476152,0.0003272317,0.00002316765,0.00004438606,0.003010242],"genre_scores_gemma":[0.2195449,0.000163863,0.7772589,0.001435674,0.0001326649,0.00004345064,0.0001719115,0.00005205741,0.001196562],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2170571,"threshold_uncertainty_score":0.5727008,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}