{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016591344,0.000038222333,0.980615,0.0002554417,0.00019843572,0.00019902921,9.975851e-7,0.00015118043,0.0019503322],"genre_scores_gemma":[0.68265086,0.000032615204,0.3168005,0.00010334752,0.0001532465,0.000009283953,0.00015875338,0.000046697678,0.000044691926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998639,0.000084390245,0.0003216586,0.00019221804,0.00047591675,0.00028681598],"domain_scores_gemma":[0.9992341,0.00008191948,0.00009249388,0.000070831375,0.0002996284,0.00022104506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032894025,0.00020283002,0.00016987538,0.00019865905,0.00020490118,0.0003791883,0.00009337253,0.000059807142,0.000029741926],"category_scores_gemma":[0.000050561513,0.00016833076,0.00003341788,0.00025494533,0.000073433155,0.00022549271,0.000021376785,0.000287166,0.0000058794312],"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.00004230404,0.000055523546,0.0005461905,0.000015109535,0.000055293553,0.000011113749,0.00013149674,0.9641613,0.000002622832,0.00062435336,0.000064151514,0.034290545],"study_design_scores_gemma":[0.00089972984,0.00036540697,0.0006523037,0.00013334388,0.000010260029,0.00020062292,0.000056292934,0.9965488,0.000012486051,0.00013868193,0.0007703237,0.00021178734],"about_ca_topic_score_codex":0.0000011806002,"about_ca_topic_score_gemma":0.000002187305,"teacher_disagreement_score":0.6660595,"about_ca_system_score_codex":0.000089207926,"about_ca_system_score_gemma":0.000069728936,"threshold_uncertainty_score":0.6864329},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012364436,0.00005646738,0.9972929,0.00035040668,0.0003106345,0.00029952184,0.0000073770434,0.00015648326,0.00028979487],"genre_scores_gemma":[0.23098494,0.000063066465,0.7680709,0.00046070878,0.00025036617,0.000015368618,0.00005533162,0.000052854288,0.000046471796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989108,0.00011560631,0.00036712684,0.00015612185,0.00019387293,0.0002564668],"domain_scores_gemma":[0.99874127,0.0007338625,0.00010926478,0.00006621382,0.0001819997,0.00016736571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066055846,0.00017187509,0.00020766155,0.000096599986,0.00031474026,0.00016877757,0.00006895055,0.00006976942,0.000045065804],"category_scores_gemma":[0.00022546707,0.00016565179,0.000050939154,0.00014523121,0.000023887125,0.00021554364,0.000016177688,0.00019689869,0.000009825107],"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.000026655056,0.000039469483,0.000020438101,0.00003572661,0.00002549868,5.026171e-7,0.00015137214,0.99158686,0.000005836347,0.004702344,0.0012657874,0.0021394962],"study_design_scores_gemma":[0.0010722211,0.00012533627,0.000090533045,0.000048248974,0.000023111155,0.000029583889,0.0000076777005,0.99238616,0.000017719784,0.004490466,0.0015321979,0.00017673921],"about_ca_topic_score_codex":1.13081505e-7,"about_ca_topic_score_gemma":2.251355e-7,"teacher_disagreement_score":0.22974849,"about_ca_system_score_codex":0.000034684148,"about_ca_system_score_gemma":0.0000121515,"threshold_uncertainty_score":0.6755084},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056517575,0.00018829637,0.9412881,0.0008707733,0.00028934097,0.00049378426,0.000011003482,0.00016858689,0.0001725527],"genre_scores_gemma":[0.44658616,0.00004405027,0.5527569,0.00025611385,0.00020585395,0.00003704308,0.00003104835,0.00005123164,0.00003159959],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846506,0.0001874301,0.00057066727,0.00018869515,0.00032065558,0.0002674771],"domain_scores_gemma":[0.99731404,0.0018554797,0.00020843236,0.00010419877,0.0004082909,0.000109546796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074998266,0.00020644312,0.00018836457,0.00013888256,0.00059459877,0.00048411358,0.0001491425,0.0000694719,0.000049405488],"category_scores_gemma":[0.0004570101,0.00017493799,0.00006891959,0.00024414208,0.00003857182,0.0005059649,0.000031986834,0.00029175906,0.000011360988],"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.000013273493,0.000015427808,0.00043479484,0.000032112326,0.00004589224,7.633175e-7,0.0004667925,0.9946454,0.000091525486,0.0005224018,0.00028719506,0.003444383],"study_design_scores_gemma":[0.00084683584,0.000071723334,0.0009926172,0.000058442078,0.000021419735,0.000042204378,0.00017600282,0.9960214,0.000116221236,0.0012845017,0.00016904643,0.0001996029],"about_ca_topic_score_codex":0.000004180284,"about_ca_topic_score_gemma":5.8950945e-7,"teacher_disagreement_score":0.3900686,"about_ca_system_score_codex":0.00007282359,"about_ca_system_score_gemma":0.00003968032,"threshold_uncertainty_score":0.7133764},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031426162,0.000017322816,0.9904282,0.0075648054,0.00024250307,0.00031907248,0.000006689411,0.000095006915,0.0010121482],"genre_scores_gemma":[0.13439141,0.000035515175,0.8626408,0.0025246076,0.0001520192,0.000018846107,0.000011259615,0.000029921373,0.00019559156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982453,0.0001373952,0.0003564944,0.00034551477,0.00064600894,0.00026931587],"domain_scores_gemma":[0.997875,0.0006777882,0.00026917516,0.00017537228,0.0008056645,0.00019700207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005202586,0.00017685765,0.00015701797,0.00030294497,0.00039026816,0.00037972227,0.00039589338,0.000040288738,0.000025529482],"category_scores_gemma":[0.00014135132,0.00011408262,0.000068892194,0.00032547428,0.000036600737,0.0011534832,0.000039174658,0.0001429544,0.000026692036],"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.000107200794,0.00007187335,0.0000138547275,0.000003227359,0.000020760262,0.0000072502885,0.00004814709,0.88948405,0.000007803845,0.10520027,0.0005109323,0.0045246365],"study_design_scores_gemma":[0.0021025154,0.0006944296,0.00003286934,0.00015825684,0.000004516286,0.000074162046,0.0000037816576,0.9833651,0.000044678683,0.012879234,0.0004601493,0.00018026729],"about_ca_topic_score_codex":1.9092667e-7,"about_ca_topic_score_gemma":1.4356385e-7,"teacher_disagreement_score":0.13407715,"about_ca_system_score_codex":0.0001449705,"about_ca_system_score_gemma":0.00019999957,"threshold_uncertainty_score":0.4652154},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000628156,0.00003619576,0.9904571,0.0062488005,0.00043730266,0.00014873703,0.000009217891,0.000080559534,0.002519243],"genre_scores_gemma":[0.032430228,0.00013381267,0.9657378,0.0008257723,0.00020095384,0.000003796779,0.00000832082,0.00002753081,0.00063175696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973584,0.00042072948,0.0004494701,0.0004077649,0.0010285657,0.00033510718],"domain_scores_gemma":[0.9974454,0.0008860011,0.00024836758,0.0002548326,0.0008353905,0.00033003016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010332945,0.00018193286,0.00018452754,0.00040682548,0.00037221733,0.0005823226,0.00053699873,0.000062674386,0.00028752716],"category_scores_gemma":[0.0008361213,0.00013281556,0.000042163192,0.00070475624,0.000063145424,0.0010646253,0.00018657654,0.00024250727,0.000086250766],"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.00001607059,0.0000686209,0.000106451465,0.0000033447275,0.000022335587,0.000026864738,0.000040547526,0.7909808,0.00001180614,0.18775295,0.00041229653,0.020557871],"study_design_scores_gemma":[0.0011436451,0.00020047963,0.0014902054,0.000047975675,0.000005363493,0.00028585098,0.0000030812894,0.97885436,0.000015442387,0.01687005,0.00091031817,0.00017325673],"about_ca_topic_score_codex":5.3480613e-7,"about_ca_topic_score_gemma":3.0237974e-8,"teacher_disagreement_score":0.1878735,"about_ca_system_score_codex":0.00010131983,"about_ca_system_score_gemma":0.00033106646,"threshold_uncertainty_score":0.561535},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004405944,0.000020564537,0.9957344,0.0016455424,0.0004572623,0.0007031211,0.00005329251,0.000093374394,0.0008518404],"genre_scores_gemma":[0.011185654,0.000053859017,0.9864866,0.0004492403,0.001094415,0.000042502594,0.00013014078,0.000082854946,0.00047469191],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978311,0.00019465171,0.0006406059,0.00037532445,0.0006370893,0.0003212023],"domain_scores_gemma":[0.99620193,0.0011126227,0.00051214884,0.00015011059,0.0018183794,0.00020483248],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005988026,0.00025186973,0.00026031648,0.00048544243,0.00088128966,0.0002935758,0.00020555303,0.000097173244,0.00026286967],"category_scores_gemma":[0.0015478757,0.00024745928,0.00008940794,0.0004362482,0.0001897634,0.0006594807,0.00006067946,0.00026979294,0.0000135469645],"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.00018278668,0.0001396858,0.000009705452,0.00001902845,0.000053083215,0.0000023768569,0.00027739382,0.9776669,0.0000032348294,0.017619789,0.002192539,0.001833459],"study_design_scores_gemma":[0.0019052112,0.000462994,0.000023017132,0.000049488135,0.000025066754,0.00008881429,0.000053160566,0.95597994,0.000050268998,0.04038565,0.00074277853,0.00023361693],"about_ca_topic_score_codex":6.9770186e-7,"about_ca_topic_score_gemma":4.815045e-7,"teacher_disagreement_score":0.022765858,"about_ca_system_score_codex":0.0001846854,"about_ca_system_score_gemma":0.0001622676,"threshold_uncertainty_score":0.9999978},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08073811,0.000027270318,0.9157385,0.0022039313,0.00051511487,0.0004990496,0.000061647486,0.000057597124,0.00015872416],"genre_scores_gemma":[0.7099619,0.0000018583297,0.2889912,0.00068457326,0.00009621201,0.000018407844,0.00011818391,0.000027086278,0.00010059409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971209,0.0002248159,0.0007416664,0.00042702258,0.0011597349,0.00032586357],"domain_scores_gemma":[0.9959865,0.0020501798,0.00035756073,0.00019572688,0.0012319117,0.00017809651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017757968,0.00020342272,0.000280719,0.0005347648,0.00050432084,0.00055834785,0.00031082722,0.000056005945,0.00024386737],"category_scores_gemma":[0.000542196,0.00015435946,0.00018752602,0.0006500126,0.000028873832,0.0003145209,0.000012879146,0.00025059644,0.00014791588],"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.0002722616,0.00019564466,0.002583174,0.000006806935,0.000045882804,0.0000036291685,0.0000895694,0.9944141,0.000006694566,0.0017822047,0.00024139827,0.00035862226],"study_design_scores_gemma":[0.0027509192,0.0010705931,0.001353801,0.0001262829,0.000039068564,0.00004526712,0.00005105884,0.9898967,0.000020035293,0.0036616873,0.0007863134,0.00019828412],"about_ca_topic_score_codex":6.309611e-7,"about_ca_topic_score_gemma":0.000001547893,"teacher_disagreement_score":0.62922376,"about_ca_system_score_codex":0.00011091642,"about_ca_system_score_gemma":0.00031117097,"threshold_uncertainty_score":0.6294596},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024877705,0.000032482596,0.9895934,0.004233747,0.00024761524,0.00032723165,0.00002316765,0.000044386063,0.0030102415],"genre_scores_gemma":[0.21954486,0.00016386296,0.77725893,0.0014356736,0.00013266488,0.000043450636,0.00017191147,0.000052057407,0.0011965624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980719,0.00032365866,0.0006172599,0.00021642238,0.00060841884,0.00016235084],"domain_scores_gemma":[0.995661,0.0027062234,0.00035554366,0.00016068437,0.0010400673,0.000076438846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052586553,0.00018027927,0.00019604788,0.00055293884,0.00071977125,0.0001234357,0.00017799709,0.00006580569,0.00022135682],"category_scores_gemma":[0.001378488,0.00014044077,0.00008048211,0.0008647134,0.0001299448,0.00028485764,0.000048203172,0.00038133835,0.000006401468],"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.000053601845,0.00017805025,0.00002562136,0.000008738247,0.00004355469,0.0000014232594,0.00008544865,0.76540667,0.000052329535,0.2313382,0.001597572,0.0012087936],"study_design_scores_gemma":[0.000518924,0.0001255613,0.00055134017,0.00013468903,0.000026880565,0.00004351931,0.00005117754,0.8527537,0.0002935547,0.1452646,0.00012909087,0.000106981024],"about_ca_topic_score_codex":0.0000014081339,"about_ca_topic_score_gemma":0.0000014237597,"teacher_disagreement_score":0.2170571,"about_ca_system_score_codex":0.00013595149,"about_ca_system_score_gemma":0.00016631592,"threshold_uncertainty_score":0.5727008},"labels":[],"label_agreement":null}]}