{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"PeterY. Zhang","is_ca":true},{"name":"David A. Romero","is_ca":true},{"name":"J. Christopher Beck","is_ca":true},{"name":"CristinaH. Amon","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002554971,0.002110423,0.001610972,0.0008761863,0.0005429009,0.002285104,0.001412482,0.002105533,0.004919298],"category_scores_gemma":[0.006857059,0.001288862,0.001426191,0.001952419,0.000822279,0.001610239,0.001209029,0.002417045,0.0004608681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0012364,"about_ca_system_score_gemma":0.002190952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01115879,"about_ca_topic_score_gemma":0.01082453,"domain_scores_codex":[0.9985818,0.0009007819,0.00004767518,0.0001636702,0.0001568646,0.0001493387],"domain_scores_gemma":[0.9935748,0.005638961,0.0003192165,0.0001116409,0.0002459731,0.0001093946],"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.00002211562,0.00003881728,0.0001836303,0.00005680784,0.0000208408,0.00003629286,0.00001250508,0.9875628,0.00009776324,0.006014114,0.0006804817,0.005273803],"study_design_scores_gemma":[0.000009546122,0.00001022334,0.00003122677,0.000006987483,0.000004083225,0.000005277242,0.000008231823,0.9966528,0.00006307704,0.00295106,0.0002552058,0.000002307264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05481408,0.001135794,0.9278715,0.001370039,0.0001269976,0.0002279656,0.0009765158,0.0004226897,0.01305441],"genre_scores_gemma":[0.4271358,0.001014715,0.5620339,0.0004261908,0.0001750919,0.0009935829,0.001009356,0.000287712,0.006923638],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01115879,"threshold_uncertainty_score":0.02218771,"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)","authors":[{"name":"Bernard Gendron","is_ca":true},{"name":"Mathieu T. Larose","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001087686,0.001062717,0.000929559,0.0006434114,0.0007029367,0.0009004608,0.001120951,0.0009930624,0.004922758],"category_scores_gemma":[0.002893714,0.0005293079,0.000640566,0.001379221,0.0007076306,0.0007682139,0.0008386848,0.001374307,0.0003990101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001343912,"about_ca_system_score_gemma":0.001657071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006008831,"about_ca_topic_score_gemma":0.006972932,"domain_scores_codex":[0.9994957,0.0002571696,0.00001414777,0.00005892341,0.0001104002,0.00006357265],"domain_scores_gemma":[0.9986982,0.0009976563,0.00007982996,0.00008922278,0.00007923834,0.00005564405],"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.00004376979,0.00006223494,0.0001849379,0.00007285264,0.00001513674,0.00004092583,0.00002277205,0.9471849,0.0006107811,0.007211308,0.001232587,0.04331765],"study_design_scores_gemma":[0.00002027055,0.00002923991,0.00003906673,0.000004337011,0.000004019914,0.00001076658,0.000006816515,0.9928804,0.0002730568,0.006290868,0.0004383593,0.000002838393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03066949,0.0003955292,0.9627535,0.000295321,0.00003271345,0.0002068433,0.0001289663,0.0005073486,0.005010242],"genre_scores_gemma":[0.3401514,0.0002884827,0.6563271,0.00008181186,0.00003386817,0.0004918131,0.0003248953,0.0001622296,0.002138396],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006008831,"threshold_uncertainty_score":0.01646823,"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","authors":[{"name":"Pierre Hansen","is_ca":true},{"name":"Nenad Mladenović","is_ca":false},{"name":"Raca Todosijević","is_ca":false},{"name":"Saïd Hanafi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001018461,0.0004258576,0.0007000663,0.0006804042,0.0004094847,0.001166392,0.001447072,0.0007875736,0.002234309],"category_scores_gemma":[0.00267111,0.0003714281,0.0005569755,0.001932947,0.001091851,0.001635803,0.001303748,0.001088232,0.0006088931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006973622,"about_ca_system_score_gemma":0.0006220132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002640713,"about_ca_topic_score_gemma":0.002365265,"domain_scores_codex":[0.9992412,0.0002285103,0.00004478849,0.0001382765,0.0002868852,0.00006037259],"domain_scores_gemma":[0.9994579,0.0002240192,0.00005258661,0.0001273326,0.0001071326,0.00003110399],"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.0001189264,0.0000548834,0.0009504282,0.0002330343,0.00005248055,0.00006773118,0.0002173171,0.2401643,0.003321876,0.4826618,0.003545562,0.2686116],"study_design_scores_gemma":[0.00004107835,0.0001256614,0.0005076218,0.00008811383,0.00003377582,0.0003109248,0.00006234938,0.7261574,0.002615752,0.218094,0.05192655,0.00003680751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008806678,0.004250977,0.970742,0.0002297813,0.0001209421,0.00007396257,0.00008863234,0.0002455388,0.01544148],"genre_scores_gemma":[0.3124068,0.00565527,0.6668451,0.0001703303,0.0002599351,0.0002607142,0.000300926,0.0002441353,0.01385675],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002640713,"threshold_uncertainty_score":0.007474482,"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","authors":[{"name":"Dalia Attia","is_ca":true},{"name":"Reinhard Bürgy","is_ca":true},{"name":"Guy Desaulniers","is_ca":true},{"name":"François Soumis","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001842179,0.002167419,0.002129475,0.001197651,0.0008201969,0.001265952,0.001890873,0.001910628,0.004183034],"category_scores_gemma":[0.003371292,0.0009375231,0.001718702,0.001505922,0.0007501685,0.001281556,0.001469326,0.002079261,0.0005785978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001750179,"about_ca_system_score_gemma":0.002920317,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008825459,"about_ca_topic_score_gemma":0.008344289,"domain_scores_codex":[0.998896,0.0004977888,0.00004831285,0.0001609083,0.0001318105,0.0002651036],"domain_scores_gemma":[0.9973724,0.001858258,0.000195225,0.0001171224,0.0001922916,0.0002646936],"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.0001195398,0.0002043766,0.000370609,0.0001276053,0.0000503438,0.00009324527,0.00005788372,0.9732978,0.001064317,0.002993251,0.001376544,0.0202445],"study_design_scores_gemma":[0.00005280265,0.00005408793,0.00009190933,0.00001299397,0.00001684135,0.00001554291,0.00003801996,0.996439,0.0002167865,0.002608089,0.000447609,0.00000640283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.102641,0.001406312,0.8823543,0.0006669057,0.0001560048,0.000556189,0.0004935566,0.0009681472,0.01075751],"genre_scores_gemma":[0.448301,0.0006260036,0.5460439,0.0003310317,0.00007714844,0.0007258746,0.001203506,0.0002725048,0.002418859],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008825459,"threshold_uncertainty_score":0.01754814,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002298321,0.001129529,0.0009973614,0.001031942,0.0004798904,0.001272905,0.001352248,0.001015638,0.005099852],"category_scores_gemma":[0.008859816,0.0005302315,0.001060715,0.001487807,0.0009182011,0.001654496,0.001762276,0.003510194,0.000785322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001477504,"about_ca_system_score_gemma":0.001814097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007190138,"about_ca_topic_score_gemma":0.008764623,"domain_scores_codex":[0.9987062,0.00048114,0.00005309168,0.0001277703,0.0004788941,0.0001529224],"domain_scores_gemma":[0.997084,0.001592405,0.0001818754,0.0003917196,0.0005806719,0.0001693882],"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.0000825009,0.00008850971,0.0005998498,0.00024121,0.00003446534,0.00007974999,0.0001362174,0.7497516,0.001019822,0.2040254,0.004817341,0.03912338],"study_design_scores_gemma":[0.000005685569,0.00001220124,0.00003918989,0.0000191595,0.000002577803,0.00000914254,0.00001573077,0.9780219,0.0001294865,0.02010245,0.001639428,0.000003078854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01197368,0.0009510981,0.9709236,0.0004647754,0.0001083546,0.00007763958,0.000237307,0.0002111344,0.01505248],"genre_scores_gemma":[0.3733504,0.001839194,0.6138009,0.0005872363,0.0001996479,0.000425856,0.0009515559,0.0002741959,0.008570961],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007190138,"threshold_uncertainty_score":0.01706076,"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","authors":[{"name":"Mounira Groiez","is_ca":true},{"name":"Guy Desaulniers","is_ca":true},{"name":"Ahmed Hadjar","is_ca":true},{"name":"Odile Marcotte","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004302044,0.001791326,0.001209239,0.001213179,0.0008765031,0.001994642,0.001994302,0.001130804,0.003590578],"category_scores_gemma":[0.01216928,0.000676494,0.001391336,0.001670281,0.001157244,0.002925245,0.001737589,0.0021937,0.0003574878],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001556066,"about_ca_system_score_gemma":0.004048198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00582814,"about_ca_topic_score_gemma":0.007396356,"domain_scores_codex":[0.9979743,0.0008771404,0.0001110143,0.0002160283,0.0004902682,0.0003311795],"domain_scores_gemma":[0.9914252,0.006571488,0.0007176591,0.0004024548,0.000590805,0.0002924679],"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.0003877689,0.0003030309,0.001553884,0.0003058626,0.00007366256,0.0002403586,0.0002032599,0.7753823,0.003173685,0.1223943,0.002802213,0.09317977],"study_design_scores_gemma":[0.00005805954,0.00007439766,0.0002136092,0.00002647698,0.00002230223,0.00003912995,0.00004735714,0.9224998,0.001990441,0.07342277,0.001588189,0.00001736525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05487125,0.0003619791,0.9384971,0.0004293714,0.00006128613,0.0002345167,0.0003271463,0.000138819,0.005078619],"genre_scores_gemma":[0.3910528,0.0009016459,0.6024135,0.000299825,0.00009942903,0.000416104,0.0009397449,0.0002197583,0.003657155],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00582814,"threshold_uncertainty_score":0.02275163,"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","authors":[{"name":"Jean‐Charles Grégoire","is_ca":true},{"name":"AngèleM. Hamel","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002435006,0.002696019,0.00199351,0.001270751,0.0009471754,0.003277142,0.004814866,0.003628061,0.0158168],"category_scores_gemma":[0.007808974,0.001200147,0.001521772,0.002292676,0.001354496,0.003625595,0.001759682,0.002979058,0.002066474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004138857,"about_ca_system_score_gemma":0.001907283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01508661,"about_ca_topic_score_gemma":0.01109863,"domain_scores_codex":[0.9985141,0.0005750546,0.00007012397,0.0002405447,0.0002874041,0.0003127374],"domain_scores_gemma":[0.9967756,0.002106646,0.0003209992,0.0001634997,0.0003353297,0.0002980766],"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.00006196307,0.00005416548,0.0002785118,0.0001030149,0.00002695446,0.0001015405,0.00005746776,0.853755,0.0002627549,0.1360805,0.004317969,0.00490022],"study_design_scores_gemma":[0.00002082801,0.00001379693,0.0001319498,0.00001441793,0.00001015938,0.00002204495,0.00001946206,0.9434554,0.00005028662,0.05344166,0.002808289,0.00001176763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03462062,0.003438131,0.8996765,0.005127135,0.0006319521,0.0003571374,0.002703679,0.0005487355,0.05289611],"genre_scores_gemma":[0.7236654,0.005597062,0.1598658,0.0009444754,0.0009286292,0.001512713,0.002520391,0.0006872502,0.1042783],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0158168,"threshold_uncertainty_score":0.05291247,"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)","authors":[{"name":"François Lamothe","is_ca":false},{"name":"Alain Haït","is_ca":false},{"name":"Emmanuel Rachelson","is_ca":false},{"name":"Claudio Contardo","is_ca":true},{"name":"Bernard Gendron","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003509834,0.001324088,0.001351193,0.001693206,0.000757219,0.001649924,0.00107091,0.0009958295,0.004143158],"category_scores_gemma":[0.007738203,0.0005996756,0.001438029,0.00109796,0.002237064,0.003223235,0.003182843,0.003362305,0.0009357188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001131234,"about_ca_system_score_gemma":0.001558309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001738203,"about_ca_topic_score_gemma":0.002158553,"domain_scores_codex":[0.9987208,0.0005015424,0.00004622688,0.0001726425,0.0004132762,0.0001454994],"domain_scores_gemma":[0.998349,0.0007794395,0.0001583093,0.0003052801,0.0002492022,0.0001588132],"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.0001048723,0.00008677012,0.0006912641,0.0001234762,0.00004418132,0.0001154223,0.0002522001,0.2317776,0.005066003,0.6515973,0.002318496,0.1078225],"study_design_scores_gemma":[0.00001828445,0.00005876334,0.0001530257,0.000054517,0.00001579241,0.000062212,0.0000450543,0.7980855,0.002439244,0.192431,0.006617049,0.00001957177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007892172,0.000272967,0.9862705,0.0001520613,0.00005238652,0.00003414641,0.00002093796,0.0001381493,0.005166689],"genre_scores_gemma":[0.1671095,0.0007059536,0.8251157,0.000275741,0.000115159,0.0002626198,0.0001297287,0.000329064,0.005956453],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004143158,"threshold_uncertainty_score":0.01856202,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}