{"meta":{"query_hash":"ac6550139867","filters":{"venue":"EURO Journal on Computational Optimization"},"cohort_total":8,"direct_labels_cover":0,"predictions_cover":8,"exported":8,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/ac6550139867","api":"https://metacan.xera.ac/api/v1/cohort?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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011485571970848154,"score_gpt":0.20813855197444717,"score_spread":0.19665298000359901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021523863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054814078,0.0011357935,0.9278715,0.0013700388,0.00012699758,0.00022796559,0.00097651576,0.00042268966,0.013054415],"genre_scores_gemma":[0.4271358,0.0010147147,0.5620339,0.00042619082,0.00017509195,0.0009935829,0.0010093561,0.00028771203,0.006923638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858177,0.00090078195,0.00004767518,0.00016367016,0.00015686463,0.00014933865],"domain_scores_gemma":[0.9935748,0.0056389607,0.00031921655,0.00011164093,0.00024597306,0.00010939457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025549715,0.0021104228,0.0016109723,0.0008761863,0.00054290093,0.0022851035,0.0014124822,0.002105533,0.0049192975],"category_scores_gemma":[0.006857059,0.0012888623,0.0014261914,0.0019524186,0.000822279,0.0016102386,0.0012090292,0.0024170452,0.00046086812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022115624,0.000038817278,0.00018363031,0.00005680784,0.000020840798,0.00003629286,0.000012505081,0.9875628,0.00009776324,0.0060141142,0.0006804817,0.005273803],"study_design_scores_gemma":[0.000009546122,0.000010223343,0.000031226766,0.000006987483,0.0000040832247,0.0000052772416,0.000008231823,0.9966528,0.00006307704,0.00295106,0.0002552058,0.000002307264],"about_ca_topic_score_codex":0.0111587895,"about_ca_topic_score_gemma":0.010824533,"teacher_disagreement_score":0.0111587895,"about_ca_system_score_codex":0.0012364002,"about_ca_system_score_gemma":0.0021909517,"threshold_uncertainty_score":0.02218771},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.018767236074810463,"score_gpt":0.23482112105970493,"score_spread":0.21605388498489447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030995871","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030669492,0.00039552923,0.96275353,0.00029532096,0.00003271345,0.00020684332,0.00012896635,0.0005073486,0.005010242],"genre_scores_gemma":[0.34015143,0.00028848273,0.65632707,0.00008181186,0.00003386817,0.00049181306,0.00032489529,0.00016222961,0.0021383963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949574,0.0002571696,0.0000141477685,0.00005892341,0.00011040019,0.00006357265],"domain_scores_gemma":[0.99869823,0.0009976563,0.00007982996,0.00008922278,0.000079238336,0.000055644046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010876864,0.0010627173,0.000929559,0.0006434114,0.0007029367,0.0009004608,0.0011209506,0.0009930624,0.0049227583],"category_scores_gemma":[0.002893714,0.00052930793,0.000640566,0.0013792207,0.0007076306,0.0007682139,0.00083868485,0.001374307,0.0003990101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043769793,0.00006223494,0.00018493793,0.00007285264,0.00001513674,0.000040925832,0.000022772054,0.9471849,0.00061078114,0.0072113085,0.0012325875,0.043317653],"study_design_scores_gemma":[0.00002027055,0.00002923991,0.000039066734,0.0000043370114,0.0000040199143,0.000010766584,0.000006816515,0.9928804,0.0002730568,0.006290868,0.00043835927,0.0000028383934],"about_ca_topic_score_codex":0.006008831,"about_ca_topic_score_gemma":0.006972932,"teacher_disagreement_score":0.006008831,"about_ca_system_score_codex":0.0013439116,"about_ca_system_score_gemma":0.0016570708,"threshold_uncertainty_score":0.016468227},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03596227856412682,"score_gpt":0.2892528394277084,"score_spread":0.2532905608635816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035888716","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05487125,0.00036197912,0.93849707,0.00042937143,0.00006128613,0.00023451674,0.0003271463,0.00013881901,0.0050786193],"genre_scores_gemma":[0.3910528,0.00090164586,0.60241354,0.00029982504,0.00009942903,0.00041610395,0.0009397449,0.00021975828,0.003657155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797434,0.00087714044,0.000111014306,0.00021602833,0.00049026817,0.00033117947],"domain_scores_gemma":[0.99142516,0.0065714875,0.0007176591,0.00040245484,0.00059080496,0.00029246786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043020444,0.0017913261,0.0012092389,0.0012131793,0.0008765031,0.0019946424,0.0019943025,0.0011308043,0.0035905784],"category_scores_gemma":[0.012169282,0.00067649403,0.0013913355,0.0016702812,0.0011572444,0.0029252449,0.0017375886,0.0021937003,0.0003574878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038776893,0.00030303086,0.0015538835,0.00030586257,0.00007366256,0.00024035858,0.00020325989,0.7753823,0.0031736854,0.12239426,0.0028022127,0.09317977],"study_design_scores_gemma":[0.00005805954,0.000074397656,0.0002136092,0.00002647698,0.00002230223,0.000039129955,0.000047357138,0.9224998,0.0019904405,0.073422775,0.0015881894,0.000017365253],"about_ca_topic_score_codex":0.0058281403,"about_ca_topic_score_gemma":0.0073963557,"teacher_disagreement_score":0.0058281403,"about_ca_system_score_codex":0.0015560655,"about_ca_system_score_gemma":0.0040481985,"threshold_uncertainty_score":0.02275163},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02936711467459411,"score_gpt":0.2708885565075921,"score_spread":0.24152144183299798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2273888011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034620617,0.0034381307,0.8996765,0.005127135,0.00063195213,0.0003571374,0.0027036793,0.0005487355,0.05289611],"genre_scores_gemma":[0.7236654,0.005597062,0.15986578,0.0009444754,0.0009286292,0.0015127128,0.0025203913,0.0006872502,0.10427829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985141,0.0005750546,0.00007012397,0.00024054469,0.00028740408,0.00031273736],"domain_scores_gemma":[0.99677557,0.0021066456,0.00032099924,0.00016349973,0.00033532968,0.00029807663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024350062,0.0026960187,0.0019935102,0.0012707508,0.00094717543,0.0032771418,0.004814866,0.003628061,0.015816802],"category_scores_gemma":[0.0078089735,0.0012001472,0.0015217722,0.002292676,0.0013544958,0.0036255952,0.0017596822,0.0029790578,0.002066474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061963074,0.000054165477,0.00027851184,0.00010301491,0.00002695446,0.00010154052,0.000057467758,0.853755,0.00026275488,0.13608046,0.0043179686,0.00490022],"study_design_scores_gemma":[0.000020828013,0.000013796929,0.00013194981,0.000014417928,0.000010159382,0.000022044947,0.000019462059,0.9434554,0.00005028662,0.053441662,0.0028082887,0.000011767625],"about_ca_topic_score_codex":0.015086608,"about_ca_topic_score_gemma":0.011098626,"teacher_disagreement_score":0.015816802,"about_ca_system_score_codex":0.004138857,"about_ca_system_score_gemma":0.0019072826,"threshold_uncertainty_score":0.052912474},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02770844702848207,"score_gpt":0.2690038019831024,"score_spread":0.24129535495462034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2327951994","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008806678,0.0042509767,0.97074205,0.00022978126,0.00012094207,0.00007396257,0.00008863234,0.00024553877,0.015441475],"genre_scores_gemma":[0.31240678,0.00565527,0.66684514,0.00017033031,0.00025993507,0.00026071415,0.00030092595,0.00024413528,0.013856747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924123,0.0002285103,0.00004478849,0.0001382765,0.00028688522,0.000060372593],"domain_scores_gemma":[0.9994579,0.00022401921,0.000052586613,0.00012733263,0.00010713263,0.00003110399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010184612,0.00042585758,0.00070006633,0.0006804042,0.0004094847,0.0011663918,0.0014470718,0.00078757363,0.0022343092],"category_scores_gemma":[0.00267111,0.00037142812,0.00055697554,0.0019329468,0.0010918513,0.001635803,0.0013037483,0.0010882319,0.00060889305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011892636,0.0000548834,0.0009504282,0.00023303433,0.000052480547,0.000067731184,0.00021731712,0.24016432,0.003321876,0.48266184,0.003545562,0.26861158],"study_design_scores_gemma":[0.00004107835,0.00012566139,0.0005076218,0.00008811383,0.000033775825,0.00031092478,0.00006234938,0.72615737,0.0026157522,0.21809398,0.051926553,0.000036807505],"about_ca_topic_score_codex":0.0026407135,"about_ca_topic_score_gemma":0.002365265,"teacher_disagreement_score":0.0026407135,"about_ca_system_score_codex":0.0006973622,"about_ca_system_score_gemma":0.00062201323,"threshold_uncertainty_score":0.007474482},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06303692224109246,"score_gpt":0.37694731334257414,"score_spread":0.31391039110148167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563370187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011973678,0.0009510981,0.9709236,0.00046477537,0.00010835463,0.00007763958,0.00023730696,0.00021113442,0.015052484],"genre_scores_gemma":[0.37335035,0.0018391937,0.61380094,0.00058723625,0.00019964794,0.00042585604,0.0009515559,0.00027419592,0.008570961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987062,0.00048113996,0.000053091684,0.00012777033,0.00047889407,0.00015292235],"domain_scores_gemma":[0.99708396,0.0015924049,0.00018187542,0.0003917196,0.0005806719,0.00016938821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022983206,0.001129529,0.0009973614,0.0010319424,0.00047989035,0.0012729046,0.001352248,0.0010156381,0.005099852],"category_scores_gemma":[0.008859816,0.00053023145,0.0010607152,0.001487807,0.0009182011,0.0016544957,0.0017622756,0.003510194,0.000785322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082500905,0.00008850971,0.0005998498,0.00024121003,0.000034465338,0.00007974999,0.00013621741,0.7497516,0.001019822,0.20402539,0.004817341,0.039123382],"study_design_scores_gemma":[0.000005685569,0.000012201237,0.00003918989,0.000019159503,0.0000025778031,0.00000914254,0.000015730775,0.97802186,0.00012948652,0.020102454,0.0016394283,0.000003078854],"about_ca_topic_score_codex":0.007190138,"about_ca_topic_score_gemma":0.008764623,"teacher_disagreement_score":0.007190138,"about_ca_system_score_codex":0.0014775039,"about_ca_system_score_gemma":0.0018140967,"threshold_uncertainty_score":0.017060757},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"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","score_opus":0.05109040726476697,"score_gpt":0.3510804581731453,"score_spread":0.2999900509083783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914964871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10264104,0.0014063116,0.8823543,0.00066690566,0.00015600483,0.000556189,0.0004935566,0.0009681472,0.010757509],"genre_scores_gemma":[0.44830105,0.0006260036,0.54604393,0.00033103174,0.00007714844,0.00072587456,0.0012035061,0.00027250475,0.0024188587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998896,0.0004977888,0.000048312846,0.00016090833,0.0001318105,0.00026510356],"domain_scores_gemma":[0.9973724,0.0018582578,0.00019522497,0.000117122414,0.00019229161,0.00026469363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018421786,0.0021674186,0.0021294754,0.0011976509,0.00082019693,0.0012659518,0.0018908727,0.0019106278,0.0041830344],"category_scores_gemma":[0.0033712923,0.0009375231,0.001718702,0.001505922,0.0007501685,0.0012815564,0.0014693261,0.0020792612,0.00057859777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001195398,0.00020437659,0.00037060902,0.00012760528,0.000050343802,0.00009324527,0.00005788372,0.97329783,0.0010643172,0.0029932512,0.0013765442,0.020244503],"study_design_scores_gemma":[0.00005280265,0.00005408793,0.00009190933,0.000012993973,0.000016841353,0.000015542912,0.000038019956,0.996439,0.00021678649,0.002608089,0.00044760897,0.0000064028295],"about_ca_topic_score_codex":0.008825459,"about_ca_topic_score_gemma":0.008344289,"teacher_disagreement_score":0.008825459,"about_ca_system_score_codex":0.0017501785,"about_ca_system_score_gemma":0.0029203172,"threshold_uncertainty_score":0.017548144},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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)","score_opus":0.03781785189837309,"score_gpt":0.361781206708843,"score_spread":0.3239633548104699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415897674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007892172,0.00027296698,0.98627055,0.00015206133,0.000052386516,0.000034146407,0.000020937958,0.00013814928,0.0051666894],"genre_scores_gemma":[0.1671095,0.0007059536,0.8251157,0.00027574104,0.00011515905,0.0002626198,0.0001297287,0.00032906403,0.005956453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987208,0.0005015424,0.00004622688,0.00017264247,0.00041327617,0.00014549938],"domain_scores_gemma":[0.99834895,0.0007794395,0.00015830927,0.00030528006,0.00024920225,0.00015881324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035098337,0.0013240882,0.0013511928,0.0016932059,0.000757219,0.0016499237,0.0010709098,0.0009958295,0.0041431575],"category_scores_gemma":[0.007738203,0.0005996756,0.0014380285,0.0010979599,0.0022370643,0.003223235,0.0031828433,0.003362305,0.00093571877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104872255,0.00008677012,0.00069126405,0.0001234762,0.000044181324,0.00011542233,0.00025220006,0.23177758,0.005066003,0.6515973,0.0023184964,0.10782246],"study_design_scores_gemma":[0.000018284452,0.000058763337,0.00015302567,0.000054517,0.00001579241,0.000062212,0.000045054298,0.7980855,0.0024392442,0.19243096,0.0066170488,0.000019571766],"about_ca_topic_score_codex":0.0017382031,"about_ca_topic_score_gemma":0.0021585533,"teacher_disagreement_score":0.0041431575,"about_ca_system_score_codex":0.0011312336,"about_ca_system_score_gemma":0.001558309,"threshold_uncertainty_score":0.018562019},"labels":[],"label_agreement":null}]}