{"meta":{"query_hash":"a8563e9b44bc","filters":{"venue":"Optimization Letters"},"cohort_total":79,"direct_labels_cover":1,"predictions_cover":79,"exported":79,"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/a8563e9b44bc","api":"https://metacan.xera.ac/api/v1/cohort?venue=Optimization+Letters"},"results":[{"id":"W1100220100","doi":"10.1007/s11590-015-0927-y","title":"Circulant weighing matrices: a demanding challenge for parallel optimization metaheuristics","year":2015,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Transport Systems and Technology","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Western Canada Research Grid","keywords":"Circulant matrix; Computational intelligence; Metaheuristic; Computer science; Mathematical optimization; Mathematics; Algebra over a field; Theoretical computer science; Algorithm; Artificial intelligence; Pure mathematics","score_opus":0.023703231626806712,"score_gpt":0.21130793611003193,"score_spread":0.18760470448322522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1100220100","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.0070098643,0.0006764082,0.98236084,0.0015630579,0.00030491388,0.00005683678,0.00009426004,0.00035524004,0.0075786174],"genre_scores_gemma":[0.15408279,0.0014163916,0.83294886,0.0009458996,0.00073827227,0.00028837772,0.0002709045,0.000644602,0.008663898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990545,0.00038175742,0.000039030285,0.00011337752,0.00034619815,0.000065085565],"domain_scores_gemma":[0.9957587,0.0025260523,0.00021785215,0.00055406475,0.00080219685,0.00014115513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021748357,0.0011095601,0.00157529,0.0006027633,0.0010652306,0.0020252003,0.0015967048,0.0020323978,0.0057064975],"category_scores_gemma":[0.012607752,0.00077820907,0.0005754662,0.0014225845,0.0009917425,0.002896379,0.0015887817,0.0031129215,0.0017466213],"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.00013869432,0.00018188718,0.0004089347,0.0003788668,0.000121420475,0.00013487054,0.000089560934,0.5759858,0.0048238374,0.18806243,0.023797614,0.20587605],"study_design_scores_gemma":[0.000026294183,0.000025181056,0.000060281043,0.000016716533,0.000012939198,0.000025408632,0.000019503854,0.9175806,0.00072926644,0.07719849,0.004293317,0.000012096402],"about_ca_topic_score_codex":0.0039647343,"about_ca_topic_score_gemma":0.00701598,"teacher_disagreement_score":0.0057064975,"about_ca_system_score_codex":0.000755989,"about_ca_system_score_gemma":0.0021775642,"threshold_uncertainty_score":0.019090116},"labels":[],"label_agreement":null},{"id":"W1148679896","doi":"10.1007/s11590-015-0939-7","title":"Machine scheduling with a maintenance interval and job delivery coordination","year":2015,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Job shop scheduling; Computer science; Computational intelligence; Mathematical optimization; Scheduling (production processes); Distribution center; Interval (graph theory); Distributed computing; Artificial intelligence; Mathematics; Embedded system","score_opus":0.009302570831021779,"score_gpt":0.19525225775025798,"score_spread":0.1859496869192362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1148679896","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.07304999,0.0004730707,0.91791993,0.000499288,0.00032036135,0.000115256196,0.00015487747,0.00044415245,0.0070231142],"genre_scores_gemma":[0.86899024,0.00021912843,0.12532276,0.000091246635,0.00033136035,0.00011469192,0.00010021511,0.00011394991,0.0047164215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986607,0.0004908103,0.000058714828,0.00031784797,0.00026582787,0.00020616634],"domain_scores_gemma":[0.9973895,0.0014134082,0.0004213101,0.00035870454,0.00018483741,0.00023224168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026982427,0.00081020663,0.0016030091,0.0006839982,0.0006758319,0.0016207518,0.0021945492,0.0013188142,0.0028795172],"category_scores_gemma":[0.006410673,0.00067292596,0.00080844556,0.0013339403,0.0007285168,0.0015245911,0.0009805555,0.0017201377,0.00037283116],"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.0007477716,0.00015743836,0.00052314624,0.00008602691,0.000054427714,0.00016088474,0.000040612213,0.93457603,0.0034400558,0.036547825,0.0016268676,0.022038834],"study_design_scores_gemma":[0.000042503547,0.00012996154,0.00026859454,0.0000032268654,0.000015950507,0.00003776733,0.0000065868176,0.9889953,0.0006866313,0.00933489,0.00046866311,0.000009832673],"about_ca_topic_score_codex":0.0013657608,"about_ca_topic_score_gemma":0.00077445136,"teacher_disagreement_score":0.0028795172,"about_ca_system_score_codex":0.0010031974,"about_ca_system_score_gemma":0.0011876549,"threshold_uncertainty_score":0.014269829},"labels":[],"label_agreement":null},{"id":"W1929806008","doi":"10.1007/s11590-015-0920-5","title":"On the order of the operators in the Douglas–Rachford algorithm","year":2015,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computational intelligence; Order (exchange); Computer science; Mathematics; Algorithm; Artificial intelligence; Economics","score_opus":0.015303671949726535,"score_gpt":0.21836981839208475,"score_spread":0.2030661464423582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1929806008","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.060242906,0.0013128141,0.9080439,0.0020241265,0.00048262716,0.000091425056,0.00012438561,0.00024619358,0.027431546],"genre_scores_gemma":[0.54382,0.0016119545,0.41932616,0.000997106,0.0004987139,0.00018738622,0.00033767754,0.0010797975,0.032141153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99756145,0.0013647672,0.000090747424,0.00016572428,0.0005594928,0.00025783383],"domain_scores_gemma":[0.98516417,0.01039078,0.00048473716,0.0013950375,0.0017832221,0.0007820266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008390945,0.0008866684,0.001071424,0.0012850338,0.0014003122,0.0026931828,0.0018693525,0.001992389,0.006277263],"category_scores_gemma":[0.026056608,0.00067049847,0.00073050894,0.0010530525,0.0034233627,0.004229241,0.0020926422,0.0042400127,0.0011686744],"study_design_candidate":"not_applicable","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.0002813592,0.00008225798,0.00095034274,0.00010457794,0.00001776048,0.00005893116,0.00019835454,0.063323185,0.0022252619,0.90386,0.0031966565,0.025701344],"study_design_scores_gemma":[0.000053281095,0.000095611635,0.0003555874,0.000057440695,0.000015174687,0.00004891722,0.00005952518,0.55723906,0.0020542233,0.43611115,0.0038739357,0.00003611494],"about_ca_topic_score_codex":0.005853076,"about_ca_topic_score_gemma":0.0071466086,"teacher_disagreement_score":0.008390945,"about_ca_system_score_codex":0.0019554454,"about_ca_system_score_gemma":0.0030857949,"threshold_uncertainty_score":0.044376135},"labels":[],"label_agreement":null},{"id":"W1966840469","doi":"10.1007/s11590-008-0109-2","title":"On the upper bounds of the minimum number of rows of disjunct matrices","year":2008,"lang":"en","type":"article","venue":"Optimization Letters","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Row; Disjunct; Column (typography); Row and column spaces; Combinatorics; Matrix (chemical analysis); Mathematics; Upper and lower bounds; Value (mathematics); Chemistry; Geometry; Computer science; Statistics; Connection (principal bundle); Population; Chromatography; Mathematical analysis","score_opus":0.005580011362657026,"score_gpt":0.17649678357502357,"score_spread":0.17091677221236654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966840469","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.087843,0.006487411,0.8324038,0.0055740797,0.00068190304,0.00016600406,0.0021806855,0.00079938606,0.06386385],"genre_scores_gemma":[0.61449397,0.0056293323,0.35747164,0.0017295684,0.0013388713,0.0006848186,0.0024359382,0.0009957099,0.015220223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944555,0.0017327176,0.00024898053,0.0010514391,0.0016438876,0.0008674592],"domain_scores_gemma":[0.92999035,0.05834629,0.0023098213,0.004563676,0.003191205,0.0015986029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050211307,0.0033320198,0.002457016,0.0024539137,0.0015427242,0.0060343114,0.004284478,0.002577212,0.015001841],"category_scores_gemma":[0.046713583,0.0018791266,0.0013545152,0.002824569,0.0036808741,0.010221397,0.0040463917,0.0071032317,0.0027446148],"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.0019747273,0.00046580125,0.0021152722,0.0012615327,0.00024368073,0.00036886305,0.0005988189,0.3466372,0.02585592,0.49253,0.022946905,0.105001345],"study_design_scores_gemma":[0.00008952892,0.00021188655,0.0009698547,0.00022233446,0.000065823624,0.00029745768,0.00014549284,0.5695942,0.00836858,0.41477308,0.0051852963,0.0000764328],"about_ca_topic_score_codex":0.001186739,"about_ca_topic_score_gemma":0.0026785708,"teacher_disagreement_score":0.015001841,"about_ca_system_score_codex":0.0022450022,"about_ca_system_score_gemma":0.0019289909,"threshold_uncertainty_score":0.050186157},"labels":[],"label_agreement":null},{"id":"W1977873546","doi":"10.1007/s11590-006-0032-3","title":"On pitfalls in computing the geodetic number of a graph","year":2006,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Geodetic datum; Combinatorics; Mathematics; Shortest path problem; Graph; Geodesic; Discrete mathematics","score_opus":0.004860542944742337,"score_gpt":0.20948864178880877,"score_spread":0.20462809884406644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977873546","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.11017132,0.0036105784,0.86737853,0.007332401,0.0006277123,0.00012589987,0.0006143494,0.0018621129,0.0082770875],"genre_scores_gemma":[0.502406,0.0016379069,0.488871,0.00095919,0.0006516591,0.00016713963,0.00084379787,0.00077736605,0.0036859126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99290717,0.0033410524,0.000436987,0.0010479374,0.0018003338,0.0004665624],"domain_scores_gemma":[0.95686305,0.03276382,0.0013167472,0.0064016986,0.0019139291,0.0007406445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072887084,0.0013846324,0.002661586,0.0034769713,0.0028196094,0.0040361374,0.003294778,0.0024178214,0.0047890088],"category_scores_gemma":[0.05751175,0.0013448463,0.0011607617,0.0070275003,0.004176221,0.01331789,0.005559639,0.004248525,0.001089318],"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.0012001416,0.00018906075,0.007457885,0.00034263372,0.00017719215,0.00027435567,0.0005293478,0.5308233,0.0022387155,0.20157824,0.018671755,0.23651746],"study_design_scores_gemma":[0.000056449,0.000058569512,0.0005865515,0.000039074126,0.000028083768,0.00008551529,0.00010435171,0.73969793,0.0011865678,0.25577077,0.0023623488,0.000023666344],"about_ca_topic_score_codex":0.011695214,"about_ca_topic_score_gemma":0.016859071,"teacher_disagreement_score":0.011695214,"about_ca_system_score_codex":0.0024840366,"about_ca_system_score_gemma":0.0022457372,"threshold_uncertainty_score":0.03854686},"labels":[],"label_agreement":null},{"id":"W1977899896","doi":"10.1007/s11590-013-0688-4","title":"A variance-based method to rank input variables of the Mesh Adaptive Direct Search algorithm","year":2013,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Variance (accounting); Mathematical optimization; Rank (graph theory); Mathematics; Function (biology); Divergence (linguistics); Computational intelligence; Computer science; Artificial intelligence","score_opus":0.012320311983936696,"score_gpt":0.25321201544526784,"score_spread":0.24089170346133115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977899896","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.00093794364,0.000060605944,0.9981109,0.000028865636,0.00004197082,0.000014460807,0.000012950129,0.000109827575,0.0006824665],"genre_scores_gemma":[0.07069675,0.00015123971,0.9248469,0.000093445895,0.00009262864,0.00023694214,0.00012798328,0.00026069826,0.003493467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992182,0.00028532746,0.000034848454,0.00007402197,0.0003500342,0.000037419148],"domain_scores_gemma":[0.9987941,0.00055288116,0.000056578483,0.00012669807,0.00043293994,0.000036840658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013319459,0.00077241566,0.00093803066,0.0007929364,0.00042145135,0.0009130338,0.0012738464,0.0010220556,0.0046579875],"category_scores_gemma":[0.0051957825,0.00051573274,0.0006147783,0.0007386936,0.00056775275,0.0008509539,0.0010794121,0.0015924847,0.0013567527],"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.00027858827,0.00013400578,0.0006788806,0.00025829131,0.00013041483,0.000087288165,0.00007500237,0.48407677,0.017633261,0.06531556,0.006011309,0.42532066],"study_design_scores_gemma":[0.000012063972,0.000019428577,0.00006089758,0.0000066174875,0.0000058135897,0.000013046678,0.0000028189947,0.9951755,0.0011363839,0.0025515414,0.0010077679,0.000008260428],"about_ca_topic_score_codex":0.0022256433,"about_ca_topic_score_gemma":0.0032269154,"teacher_disagreement_score":0.0046579875,"about_ca_system_score_codex":0.0003160781,"about_ca_system_score_gemma":0.00136105,"threshold_uncertainty_score":0.015582502},"labels":[],"label_agreement":null},{"id":"W1983531822","doi":"10.1007/s11590-014-0828-5","title":"On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances","year":2014,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computational intelligence; Euclidean geometry; Mathematical optimization; Mathematics; Computer science; Artificial intelligence","score_opus":0.10348452853156816,"score_gpt":0.2886102378094453,"score_spread":0.18512570927787714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983531822","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7444499,0.012912606,0.1803985,0.02128839,0.001313579,0.000517686,0.008749088,0.0047720587,0.025598215],"genre_scores_gemma":[0.9007234,0.0014765648,0.08411177,0.001230419,0.0006298213,0.00027848486,0.006553142,0.0012521682,0.0037442045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9833129,0.008427324,0.0013207631,0.0025697632,0.0028639182,0.0015053733],"domain_scores_gemma":[0.6414585,0.33585054,0.0045484044,0.011756404,0.0036900798,0.0026960769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014400963,0.0019076169,0.0025998831,0.002824843,0.0015986939,0.0040032505,0.0043791295,0.0035222634,0.011426044],"category_scores_gemma":[0.1498153,0.0013642613,0.0021610844,0.004853383,0.0036394296,0.009169211,0.003290903,0.005791498,0.001213276],"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.0043629017,0.001520179,0.030682698,0.0015456105,0.0006556922,0.00037019714,0.00042943333,0.7593332,0.0024742354,0.032521386,0.033026952,0.13307756],"study_design_scores_gemma":[0.00035551446,0.00028339433,0.0043938123,0.00007196223,0.00011699296,0.00026361103,0.0002839254,0.9676138,0.0011200065,0.02425292,0.0012106786,0.000033337525],"about_ca_topic_score_codex":0.011300886,"about_ca_topic_score_gemma":0.014400766,"teacher_disagreement_score":0.014400963,"about_ca_system_score_codex":0.0046118153,"about_ca_system_score_gemma":0.0061271875,"threshold_uncertainty_score":0.07616049},"labels":[],"label_agreement":null},{"id":"W2004594161","doi":"10.1007/s11590-015-0859-6","title":"A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines","year":2015,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Job shop scheduling; Computer science; Scheduling (production processes); Computational intelligence; Mathematical optimization; Job scheduler; Algorithm; Mathematics; Artificial intelligence; Schedule","score_opus":0.016414328054018552,"score_gpt":0.242009478236808,"score_spread":0.22559515018278944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004594161","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.0017877074,0.0012438765,0.9815979,0.002391696,0.0032225356,0.00012734681,0.00012445035,0.0010853041,0.008419126],"genre_scores_gemma":[0.03339738,0.0011705098,0.9475207,0.0009980765,0.0018569225,0.00017917888,0.00020595865,0.0006629692,0.014008387],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916613,0.00024558592,0.000082784325,0.00016862541,0.00028624525,0.000050644925],"domain_scores_gemma":[0.9987012,0.00068499806,0.000037112877,0.000290213,0.00024113439,0.000045345198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001422101,0.001043643,0.000707614,0.00064104516,0.00094938034,0.0014955841,0.0018377423,0.0015800453,0.011918425],"category_scores_gemma":[0.0055444827,0.00039483636,0.001143357,0.0010059213,0.0010658219,0.0023328264,0.0013464309,0.0039494,0.0045367456],"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.0006590238,0.00017079127,0.0005961471,0.00063372444,0.00011749882,0.0010204245,0.0001678185,0.09869913,0.019726349,0.1754601,0.087349534,0.61539954],"study_design_scores_gemma":[0.00016241355,0.0002597732,0.0010148503,0.0001627264,0.00006326148,0.0011867227,0.000054809992,0.52150905,0.012695043,0.22609764,0.23662898,0.00016476317],"about_ca_topic_score_codex":0.0037359365,"about_ca_topic_score_gemma":0.005804978,"teacher_disagreement_score":0.011918425,"about_ca_system_score_codex":0.0009635846,"about_ca_system_score_gemma":0.0013095739,"threshold_uncertainty_score":0.039871097},"labels":[],"label_agreement":null},{"id":"W2010081598","doi":"10.1007/s11590-013-0641-6","title":"The NC-proximal average for multiple functions","year":2013,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Banach Space Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital","funders":"","keywords":"Mathematical proof; Discontinuity (linguistics); Computational intelligence; Function (biology); Finite set","score_opus":0.01758841269589743,"score_gpt":0.25589790954997943,"score_spread":0.238309496854082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010081598","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.013535067,0.0012651733,0.9727913,0.0007033481,0.00032441746,0.000016613647,0.00008085561,0.00012724183,0.011155978],"genre_scores_gemma":[0.596266,0.004483637,0.3397364,0.0008516181,0.0017712028,0.00020689562,0.000492966,0.00048252143,0.055708703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998103,0.00063100574,0.00007716537,0.00042288538,0.000581129,0.00018475208],"domain_scores_gemma":[0.99506134,0.0025709202,0.00032375552,0.0005755093,0.0009897277,0.00047877335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00428944,0.0013946022,0.0019384107,0.002027363,0.0009327146,0.0020859137,0.0026070485,0.0022266982,0.0047789086],"category_scores_gemma":[0.015576049,0.0007433036,0.0011060849,0.002286836,0.0027907155,0.005120361,0.002924534,0.003026905,0.00090636924],"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.00011088684,0.000030557225,0.00033268952,0.00015938752,0.000070785005,0.00008355144,0.000074167896,0.11935808,0.0014992383,0.8444996,0.0043600313,0.029421033],"study_design_scores_gemma":[0.000010477747,0.000047152676,0.00028259127,0.000032008564,0.000031217267,0.00010665635,0.000027099177,0.49653727,0.00087179855,0.49684137,0.005182629,0.00002971186],"about_ca_topic_score_codex":0.0026615772,"about_ca_topic_score_gemma":0.002376859,"teacher_disagreement_score":0.0047789086,"about_ca_system_score_codex":0.0024692582,"about_ca_system_score_gemma":0.002080327,"threshold_uncertainty_score":0.022684991},"labels":[],"label_agreement":null},{"id":"W2014643492","doi":"10.1007/s11590-009-0144-7","title":"An efficient string sorting algorithm for weighing matrices of small weight","year":2009,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Wilfrid Laurier University","keywords":"Sorting; String (physics); Computational intelligence; Algorithm; Mathematics; Connection (principal bundle); Range (aeronautics); Combinatorics; Computer science; Artificial intelligence","score_opus":0.009961612166301382,"score_gpt":0.2369741017125232,"score_spread":0.22701248954622183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014643492","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.011405794,0.00017293474,0.9829434,0.00017680615,0.00016623059,0.00014263151,0.00021060884,0.0020152815,0.002766316],"genre_scores_gemma":[0.04062585,0.00012909425,0.9527642,0.00012523452,0.0000804476,0.00018104578,0.0005507653,0.00023671422,0.005306697],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888235,0.0001420375,0.000107726235,0.00017148128,0.00059306424,0.00010329053],"domain_scores_gemma":[0.99835783,0.00057151937,0.000107638356,0.00036687215,0.0005149047,0.00008128294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068555505,0.001275167,0.0011737875,0.0017518445,0.0010673943,0.0017114452,0.0016493103,0.0012627702,0.010467031],"category_scores_gemma":[0.0044118785,0.00057430315,0.00072802237,0.00419124,0.00054203614,0.0023636827,0.0019814172,0.001452051,0.004501879],"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.00031937924,0.00016159858,0.00036485406,0.00017654711,0.00003966698,0.00011653458,0.00010642985,0.025336586,0.03140592,0.031340577,0.01361236,0.8970195],"study_design_scores_gemma":[0.00025039495,0.0003557632,0.0007381053,0.000060555307,0.00006295507,0.0006236245,0.0001705475,0.7871998,0.05389024,0.12766632,0.028884819,0.00009689297],"about_ca_topic_score_codex":0.002106943,"about_ca_topic_score_gemma":0.0042419173,"teacher_disagreement_score":0.010467031,"about_ca_system_score_codex":0.00080254383,"about_ca_system_score_gemma":0.0017559688,"threshold_uncertainty_score":0.035015702},"labels":[],"label_agreement":null},{"id":"W2022954527","doi":"10.1007/s11590-006-0024-3","title":"Disjunctive cuts for continuous linear bilevel programming","year":2006,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Air Force Office of Scientific Research","keywords":"Bilevel optimization; Linear programming; Duality (order theory); Relaxation (psychology); Mathematical optimization; Computational intelligence; Computer science; Mathematics; Linear programming relaxation; Domain (mathematical analysis); Optimization problem; Artificial intelligence; Discrete mathematics","score_opus":0.007874505805032505,"score_gpt":0.21972093456933942,"score_spread":0.2118464287643069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022954527","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.0047809836,0.00055545015,0.98943394,0.0002472463,0.00006184967,0.000038863353,0.000097543074,0.00009597387,0.0046881507],"genre_scores_gemma":[0.19590595,0.0011162547,0.79058623,0.0002950886,0.00023728205,0.00046803057,0.00080006354,0.00039032203,0.010200796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998162,0.0007120977,0.00008676333,0.00031570977,0.00058896065,0.00013453413],"domain_scores_gemma":[0.99610907,0.0029364428,0.00017604606,0.00022622295,0.00038351686,0.00016862138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034974073,0.0014522176,0.0018628184,0.0011143119,0.0008230382,0.0032534346,0.0022238079,0.001743192,0.006783388],"category_scores_gemma":[0.010850091,0.0015345783,0.0010861596,0.0018058429,0.0022829932,0.003757755,0.0029082804,0.0070482437,0.0007293087],"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.00023997936,0.00013957961,0.00031546014,0.00045877957,0.00009607083,0.00009451268,0.00024496016,0.20012757,0.0018952887,0.67645484,0.0066011953,0.11333177],"study_design_scores_gemma":[0.000039292772,0.000043096516,0.00010445786,0.000053307507,0.00002279661,0.000037670554,0.00003614704,0.48170835,0.00047334904,0.51359147,0.0038752,0.000014841861],"about_ca_topic_score_codex":0.0022962026,"about_ca_topic_score_gemma":0.0027786316,"teacher_disagreement_score":0.006783388,"about_ca_system_score_codex":0.0017611922,"about_ca_system_score_gemma":0.001054904,"threshold_uncertainty_score":0.02269274},"labels":[],"label_agreement":null},{"id":"W2030454071","doi":"10.1007/s11590-011-0428-6","title":"Efficient use of parallelism in algorithmic parameter optimization applications","year":2011,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Parallelism (grammar); Computer science; Solver; Computational intelligence; Context (archaeology); Task (project management); Minification; Identification (biology); Mathematical optimization; Optimization problem; Algorithm; Parallel computing; Artificial intelligence; Mathematics","score_opus":0.08854811697420045,"score_gpt":0.31406325915510647,"score_spread":0.22551514218090601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030454071","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.1192847,0.00102832,0.8588762,0.00071022456,0.00013546867,0.00008521061,0.00010480144,0.0009252114,0.018849779],"genre_scores_gemma":[0.775928,0.0003557249,0.21962263,0.00013331632,0.00007999013,0.000107328735,0.00013367712,0.00022974903,0.003409534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989531,0.00040268,0.000061313185,0.00012397362,0.00033916347,0.000119727876],"domain_scores_gemma":[0.99794656,0.00095181266,0.000115023184,0.000690126,0.00022957528,0.000066879504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001083182,0.0006567727,0.00070704916,0.00065849157,0.0008030821,0.0009967487,0.0012266149,0.0005877889,0.002373333],"category_scores_gemma":[0.0057468317,0.00045134913,0.0005026655,0.0012734449,0.00080625265,0.001844594,0.0018573896,0.0011358248,0.00070629857],"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.0007826369,0.00031336898,0.0024713601,0.00019282184,0.000101481935,0.00033251903,0.000257657,0.49298343,0.027970124,0.123772055,0.0059421435,0.34488046],"study_design_scores_gemma":[0.000048576432,0.00007570852,0.00024480716,0.00001174689,0.000016198823,0.000067022105,0.00002631486,0.88662124,0.007053346,0.102754235,0.0030694942,0.000011400068],"about_ca_topic_score_codex":0.0009756795,"about_ca_topic_score_gemma":0.0021978824,"teacher_disagreement_score":0.002373333,"about_ca_system_score_codex":0.00043595562,"about_ca_system_score_gemma":0.0011378559,"threshold_uncertainty_score":0.007939577},"labels":[],"label_agreement":null},{"id":"W2031089199","doi":"10.1007/s11590-014-0789-8","title":"Characterizing the optimality gap and the optimal packings for the bin packing problem","year":2014,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bin packing problem; Column generation; Benchmark (surveying); Mathematical optimization; Bin; Heuristic; Set (abstract data type); Lagrangian relaxation; Column (typography); Relaxation (psychology); Packing problems; Mathematics; Set packing; Computer science; Algorithm","score_opus":0.011155338939447047,"score_gpt":0.202790661698188,"score_spread":0.19163532275874096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031089199","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.16805014,0.005808266,0.75085175,0.005760178,0.0005690313,0.00019059177,0.001046431,0.0003147807,0.06740885],"genre_scores_gemma":[0.8382918,0.0045447787,0.14170502,0.0009393593,0.00092398847,0.00039874332,0.0011728625,0.000583769,0.011439669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964766,0.0013679703,0.00017434784,0.0004679738,0.00092767924,0.00058542826],"domain_scores_gemma":[0.9789464,0.017059851,0.0012972085,0.00089600426,0.0010942039,0.00070643343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005183872,0.0015532544,0.0028089243,0.0028574618,0.0013896166,0.004984097,0.0023951102,0.002996428,0.010018743],"category_scores_gemma":[0.036168814,0.0014056333,0.0010727078,0.003496233,0.003508423,0.010594514,0.0039272234,0.004866849,0.00092809694],"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.0004289437,0.00022079897,0.0008255948,0.00037913542,0.000045229004,0.000099555305,0.00025660073,0.16427955,0.0015406098,0.79043233,0.009249244,0.032242343],"study_design_scores_gemma":[0.000025030487,0.000074051575,0.00040479883,0.000081628285,0.000015379917,0.00009021358,0.0001461401,0.3219482,0.0005311844,0.67434,0.0023221513,0.000021248043],"about_ca_topic_score_codex":0.0014170024,"about_ca_topic_score_gemma":0.0008102167,"teacher_disagreement_score":0.010018743,"about_ca_system_score_codex":0.0023435715,"about_ca_system_score_gemma":0.0019639127,"threshold_uncertainty_score":0.03351599},"labels":[],"label_agreement":null},{"id":"W2040539280","doi":"10.1007/s11590-013-0672-z","title":"A fluence map optimization model for restoring traditional fractionation in IMRT treatment planning","year":2013,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Radiotherapy Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Radiation treatment planning; Radiation therapy; Dose fractionation; Fraction (chemistry); Medicine; Fractionation; Fluence; Nuclear medicine; Dosimetry; Computer science; Medical physics; Radiology; Irradiation; Chemistry","score_opus":0.028989465033733973,"score_gpt":0.2778612898883049,"score_spread":0.2488718248545709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040539280","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.022633491,0.00061966415,0.9620535,0.0005738375,0.00008212085,0.00008050753,0.00032020218,0.00064571743,0.012990953],"genre_scores_gemma":[0.83718234,0.00047591512,0.14840512,0.0002487503,0.00006798225,0.00021160288,0.00031812268,0.00054604805,0.012544154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983037,0.000053553606,0.000007076128,0.000027672395,0.000060081158,0.000021299978],"domain_scores_gemma":[0.99968624,0.00017431658,0.000029447445,0.000023016317,0.00006858029,0.000018516614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005267238,0.0005463116,0.00077698723,0.00039231803,0.00038342352,0.0010070807,0.0011954585,0.0014226157,0.003172253],"category_scores_gemma":[0.0019044398,0.00071872975,0.00067882286,0.0006992569,0.0004274297,0.0007679731,0.000617982,0.00085732254,0.00043057042],"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.0000075271078,0.0000032704452,0.000031164054,0.0000064865762,0.000002679556,0.0000062499053,0.0000052154714,0.9971187,0.00011260172,0.0010815379,0.00015230988,0.0014722403],"study_design_scores_gemma":[0.0000019037556,0.0000023857049,0.000019567864,0.0000016060458,0.0000015538238,0.000002822526,0.0000010772184,0.999255,0.0000643415,0.00047407512,0.00017411579,0.0000014984561],"about_ca_topic_score_codex":0.020055827,"about_ca_topic_score_gemma":0.010294474,"teacher_disagreement_score":0.020055827,"about_ca_system_score_codex":0.0014279583,"about_ca_system_score_gemma":0.0013297107,"threshold_uncertainty_score":0.03987819},"labels":[],"label_agreement":null},{"id":"W2043873753","doi":"10.1007/s11590-010-0185-y","title":"A note on diameters of point sets","year":2010,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Equilateral triangle; Mathematics; Combinatorics; Plane (geometry); RADIUS; Point (geometry); Set (abstract data type); Geometry; Computer science","score_opus":0.021376411838199372,"score_gpt":0.2896799265772811,"score_spread":0.2683035147390817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043873753","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.049120955,0.043669526,0.65257317,0.03922561,0.016303984,0.00014462676,0.0018058064,0.0007126671,0.19644372],"genre_scores_gemma":[0.50283545,0.043405045,0.3369209,0.011170427,0.030653665,0.00076166616,0.0016533573,0.0020502089,0.07054926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994919,0.0015361449,0.00042375384,0.0012600097,0.0014452278,0.00041590774],"domain_scores_gemma":[0.95228314,0.03886301,0.001326351,0.0028923915,0.002398174,0.0022369039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006080493,0.0021118824,0.0039289994,0.0051420545,0.0037869758,0.005579674,0.0049381144,0.0033387644,0.009499334],"category_scores_gemma":[0.041357648,0.001988568,0.0035664942,0.00505791,0.009789906,0.020005073,0.009434712,0.014379713,0.0020091399],"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.00006597575,0.000009791953,0.0003923385,0.00015281954,0.000015398455,0.000094027266,0.00028040507,0.0020013503,0.0007125143,0.97456115,0.0103292195,0.011385018],"study_design_scores_gemma":[0.00002102094,0.00005829285,0.00081894355,0.000086362335,0.000034612945,0.00032951252,0.00014853539,0.009487843,0.00069588964,0.9402856,0.047989365,0.000043917193],"about_ca_topic_score_codex":0.002079655,"about_ca_topic_score_gemma":0.0013431784,"teacher_disagreement_score":0.009499334,"about_ca_system_score_codex":0.0037603264,"about_ca_system_score_gemma":0.0009579541,"threshold_uncertainty_score":0.032157123},"labels":[],"label_agreement":null},{"id":"W2044674112","doi":"10.1007/s11590-006-0001-x","title":"A counterexample to the dominating set conjecture","year":2006,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Conjecture; Combinatorics; Counterexample; Mathematics; Polytope; Vertex (graph theory); Polyhedron; Convex polytope; Discrete mathematics; Regular polygon; Graph; Convex set; Geometry","score_opus":0.016348271983206406,"score_gpt":0.2627674421359366,"score_spread":0.2464191701527302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044674112","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36813816,0.0055246055,0.21203625,0.11537375,0.002516852,0.00011444748,0.0019049167,0.001195418,0.29319566],"genre_scores_gemma":[0.940448,0.0022945337,0.026664209,0.0073518124,0.002155785,0.00016566386,0.0008956592,0.00022790993,0.019796543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737996,0.00074711756,0.0001079081,0.0006615565,0.0008170901,0.00028635902],"domain_scores_gemma":[0.97959614,0.01659751,0.0007168641,0.0014912268,0.00072519144,0.0008730269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030534777,0.0006263171,0.0019768472,0.0019489715,0.003044254,0.005812157,0.002738503,0.0041215406,0.008215978],"category_scores_gemma":[0.017534725,0.0008173855,0.0010246056,0.003342003,0.005584147,0.011325057,0.0051940843,0.004877345,0.0009735637],"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.000102654514,0.000041176052,0.00035960335,0.000077194716,0.000015321031,0.00012134073,0.00017508227,0.0018463394,0.0004278679,0.97959524,0.010933746,0.0063044047],"study_design_scores_gemma":[0.000033641245,0.000010007618,0.00011343173,0.000016451771,0.0000082531715,0.00015362118,0.000049635244,0.005907878,0.00021052644,0.98948824,0.004000933,0.0000074124882],"about_ca_topic_score_codex":0.00079847954,"about_ca_topic_score_gemma":0.00073408236,"teacher_disagreement_score":0.008215978,"about_ca_system_score_codex":0.001933558,"about_ca_system_score_gemma":0.00087407907,"threshold_uncertainty_score":0.027485132},"labels":[],"label_agreement":null},{"id":"W2051095135","doi":"10.1007/s11590-012-0538-9","title":"On the Weber facility location problem with limited distances and side constraints","year":2012,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Facility location problem; 1-center problem; Limit (mathematics); Mathematical optimization; Computer science; Computational intelligence; Constant (computer programming); Function (biology); Upper and lower bounds; Optimization problem; Mathematics; Artificial intelligence; Mathematical analysis","score_opus":0.015008318441302869,"score_gpt":0.19076410873708835,"score_spread":0.17575579029578547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051095135","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.16880873,0.005998788,0.6681808,0.0129321525,0.0007135305,0.00024749924,0.0014683136,0.00019658635,0.14145362],"genre_scores_gemma":[0.86861765,0.0049979743,0.07622323,0.0008614067,0.0005998636,0.00029127038,0.0006673591,0.00024828428,0.047493026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917173,0.00045565955,0.000027557022,0.000113002636,0.0001021029,0.00013005902],"domain_scores_gemma":[0.9946684,0.0045044627,0.0003103941,0.0001018903,0.00017130461,0.00024340792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018545523,0.00130102,0.0024135294,0.0015162685,0.00086736964,0.0030375794,0.0018057672,0.0028395755,0.014464497],"category_scores_gemma":[0.010816036,0.00091735146,0.0009929158,0.0026246407,0.0023694704,0.004067954,0.002504417,0.0020925952,0.0005351632],"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.00023651955,0.00008227783,0.0005759637,0.000257524,0.00005538653,0.00028622977,0.0001019797,0.60304934,0.00028165127,0.37525597,0.007988972,0.01182819],"study_design_scores_gemma":[0.0000800544,0.000053172134,0.0003793429,0.0000810346,0.000029334184,0.000074939184,0.00017192498,0.696769,0.00013294622,0.29810557,0.0040833782,0.000039433726],"about_ca_topic_score_codex":0.011297689,"about_ca_topic_score_gemma":0.007959525,"teacher_disagreement_score":0.014464497,"about_ca_system_score_codex":0.003334399,"about_ca_system_score_gemma":0.0017833309,"threshold_uncertainty_score":0.04838854},"labels":[],"label_agreement":null},{"id":"W2053680637","doi":"10.1007/s11590-015-0874-7","title":"An information theoretic based integer linear programming approach for the discrete search path planning problem","year":2015,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal; Defence Research and Development Canada","funders":"","keywords":"Mathematical optimization; Computer science; Motion planning; Heuristics; Integer programming; Heuristic; Entropy (arrow of time); Mathematics; Artificial intelligence","score_opus":0.03145900289209521,"score_gpt":0.2827877760298572,"score_spread":0.25132877313776203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053680637","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.0015684438,0.00023936332,0.9936993,0.00033247715,0.000048961214,0.000030329415,0.000069572525,0.000052036103,0.0039594565],"genre_scores_gemma":[0.3064874,0.0016043585,0.67877233,0.0004666519,0.00037105416,0.000543939,0.0003959343,0.00020992589,0.011148378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986557,0.000499388,0.00005440501,0.0001851543,0.00049908925,0.00010627186],"domain_scores_gemma":[0.99719125,0.002234171,0.00016203939,0.00010222377,0.00023016916,0.000080151774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020376686,0.0012357474,0.0018452782,0.0017073471,0.0006165169,0.0023392932,0.0024484734,0.0017821853,0.0057256734],"category_scores_gemma":[0.0059846286,0.0010920458,0.0013051791,0.0024204003,0.0015112141,0.0032187812,0.0017261673,0.003343811,0.00065925356],"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.000031445907,0.000054902135,0.00008196973,0.00010667497,0.000027425043,0.000037365236,0.00004139364,0.8450701,0.0003491688,0.13440242,0.0015545002,0.01824254],"study_design_scores_gemma":[0.0000069159373,0.000015763517,0.000018180988,0.000011676395,0.000005972689,0.000008042422,0.000005002218,0.96344525,0.00007646332,0.03588248,0.0005182461,0.000005954013],"about_ca_topic_score_codex":0.0046929233,"about_ca_topic_score_gemma":0.0046820203,"teacher_disagreement_score":0.0057256734,"about_ca_system_score_codex":0.0024723078,"about_ca_system_score_gemma":0.0023658324,"threshold_uncertainty_score":0.01915431},"labels":[],"label_agreement":null},{"id":"W2059147749","doi":"10.1007/s11590-008-0083-8","title":"Regular exceptional family of elements with respect to isotone projection cones in Hilbert spaces and complementarity problems","year":2008,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Hilbert space; Complementarity (molecular biology); Cone (formal languages); Pure mathematics; Rigged Hilbert space; Projection (relational algebra); Mathematical analysis; Reproducing kernel Hilbert space; Algorithm","score_opus":0.0203606626991976,"score_gpt":0.23197117013080876,"score_spread":0.21161050743161117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059147749","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6336613,0.0007996089,0.31094617,0.001601033,0.0002751655,0.000071545655,0.00029637563,0.0002883392,0.052060436],"genre_scores_gemma":[0.96093327,0.00045705124,0.024204161,0.0001985839,0.00026397288,0.00009529351,0.00034757578,0.00014416265,0.013356002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908566,0.00022705739,0.000040156214,0.00014337302,0.00030563588,0.00019813365],"domain_scores_gemma":[0.9967553,0.0009879774,0.0003094821,0.00016827215,0.00059088663,0.0011879897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019479934,0.00090368744,0.0014917935,0.0027689845,0.0027677196,0.003996632,0.0013000241,0.0012134885,0.0036544774],"category_scores_gemma":[0.004940266,0.00060794,0.001035622,0.001218108,0.00431125,0.0039812317,0.0027471075,0.0035236296,0.00028925628],"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.000047850925,0.000025344916,0.00033339817,0.000018467714,0.000012895125,0.00010490369,0.00015280815,0.0012635223,0.0006724043,0.99508935,0.00049636257,0.0017826178],"study_design_scores_gemma":[0.000014466275,0.000024339277,0.00033373138,0.000013008285,0.000008255112,0.00017054586,0.00013657402,0.015148344,0.00043248577,0.9825883,0.0011149765,0.000014969832],"about_ca_topic_score_codex":0.0011464625,"about_ca_topic_score_gemma":0.0011779554,"teacher_disagreement_score":0.003996632,"about_ca_system_score_codex":0.0015404476,"about_ca_system_score_gemma":0.0010783544,"threshold_uncertainty_score":0.012225449},"labels":[],"label_agreement":null},{"id":"W2066043589","doi":"10.1007/s11590-007-0068-z","title":"A simpler and tighter redundant Klee–Minty construction","year":2007,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Canada Research Chairs","keywords":"Hyperplane; Mathematics; Dimension (graph theory); Combinatorics; Bent molecular geometry; Computational intelligence; Path (computing); Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.0056916164472046015,"score_gpt":0.21211858192349364,"score_spread":0.20642696547628905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066043589","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.017241338,0.0002913176,0.92947835,0.0011411504,0.00073161116,0.0001109509,0.00030015426,0.0009989687,0.049706228],"genre_scores_gemma":[0.27751788,0.00044846622,0.6616796,0.0012300925,0.0003866345,0.00042004418,0.0009213854,0.0025441335,0.05485181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984016,0.00030863928,0.00007974949,0.00033678504,0.0006836399,0.00018964658],"domain_scores_gemma":[0.99864644,0.00026903857,0.000058225414,0.00073636783,0.00017598893,0.00011400112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001473371,0.001102712,0.001675137,0.0015995937,0.0020317924,0.001969148,0.002570654,0.001753397,0.03159206],"category_scores_gemma":[0.0050706295,0.0009760402,0.0017879835,0.0011801127,0.0022590228,0.005156912,0.00585865,0.006557281,0.0075424993],"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.00023020497,0.000165384,0.00024741824,0.00032631625,0.000052490577,0.00017856406,0.00029298093,0.011873816,0.019209474,0.84440106,0.016338043,0.10668415],"study_design_scores_gemma":[0.00012325456,0.00019163641,0.0004568,0.00008568819,0.00006921706,0.0005325011,0.0001333147,0.054233473,0.017719237,0.84842855,0.07793057,0.00009574508],"about_ca_topic_score_codex":0.00039547487,"about_ca_topic_score_gemma":0.0008189291,"teacher_disagreement_score":0.03159206,"about_ca_system_score_codex":0.0006848717,"about_ca_system_score_gemma":0.0009854485,"threshold_uncertainty_score":0.10568601},"labels":[],"label_agreement":null},{"id":"W2071575532","doi":"10.1007/s11590-006-0027-0","title":"An ILP based hierarchical global routing approach for VLSI ASIC design","year":2006,"lang":"en","type":"article","venue":"Optimization Letters","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"","keywords":"Routing (electronic design automation); Computer science; Very-large-scale integration; Integer programming; Rounding; Heuristic; Physical design; Parallel computing; Application-specific integrated circuit; Circuit design; Embedded system; Algorithm","score_opus":0.010559122700771837,"score_gpt":0.21219346988723609,"score_spread":0.20163434718646425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071575532","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.012234108,0.00036161023,0.97708875,0.00012820434,0.000048988302,0.000048844853,0.00006419837,0.0012930207,0.0087322565],"genre_scores_gemma":[0.36475828,0.00046318423,0.62667674,0.00021331837,0.000056703106,0.0001476102,0.00026368324,0.00024162896,0.007178849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987996,0.000029701627,0.0000061419623,0.000017556962,0.000048857564,0.0000176659],"domain_scores_gemma":[0.9998933,0.000024001416,0.00001255204,0.000032514694,0.000031834,0.0000057803486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019000127,0.0004544281,0.00033950678,0.00039689496,0.00032409426,0.00049927155,0.0008899112,0.00031474177,0.003547034],"category_scores_gemma":[0.00027392842,0.00027965746,0.00035830526,0.00046645838,0.00022488718,0.00057123235,0.00048771786,0.0004851512,0.00057289074],"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.00013850738,0.00009436577,0.0004252336,0.0003238209,0.00007693988,0.0001954742,0.00013945294,0.4535854,0.093207456,0.035797883,0.009956916,0.40605858],"study_design_scores_gemma":[0.000032268876,0.00025358668,0.0002744403,0.000025149679,0.000050518403,0.00014413672,0.000033645323,0.94816023,0.022505475,0.018212061,0.010292823,0.000015684147],"about_ca_topic_score_codex":0.0009655769,"about_ca_topic_score_gemma":0.0040264823,"teacher_disagreement_score":0.003547034,"about_ca_system_score_codex":0.00042271795,"about_ca_system_score_gemma":0.0005266879,"threshold_uncertainty_score":0.011866033},"labels":[],"label_agreement":null},{"id":"W2073491843","doi":"10.1007/s11590-008-0089-2","title":"Mesh adaptive direct search algorithms for mixed variable optimization","year":2008,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":false,"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":"Subsequence; Variable (mathematics); Algorithm; Iterated function; Convergence (economics); Mathematics; Categorical variable; Mathematical optimization; Class (philosophy); Computer science; Artificial intelligence","score_opus":0.04295862349070323,"score_gpt":0.27375931317915003,"score_spread":0.2308006896884468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073491843","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.004479685,0.0008708935,0.98831534,0.00017772292,0.00015224601,0.0000301686,0.000033430173,0.00017664906,0.005763876],"genre_scores_gemma":[0.22986719,0.0010545108,0.75481224,0.0002431503,0.00023943403,0.00051097403,0.00017535352,0.00029830175,0.012798886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996264,0.00018205403,0.000014095233,0.000028607257,0.00012683509,0.000022053566],"domain_scores_gemma":[0.99884415,0.00082231767,0.00006386678,0.000089422894,0.00015032654,0.000029998888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008223174,0.00076489896,0.0009776424,0.0007214831,0.00043658967,0.00089168304,0.0013236615,0.0014914995,0.0049794717],"category_scores_gemma":[0.0048743603,0.0005448836,0.00054539536,0.0010398775,0.0006807603,0.0010064834,0.0014501668,0.001704527,0.00089512975],"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.000111777794,0.0000495522,0.00033657538,0.00013996976,0.000080345155,0.000045264413,0.000061024122,0.8044745,0.0014973441,0.057954144,0.004506757,0.13074265],"study_design_scores_gemma":[0.000013370253,0.000009456747,0.000030329113,0.0000062773083,0.0000040792174,0.0000064508167,0.000003668841,0.9884343,0.00014018676,0.010167592,0.0011814145,0.0000028412505],"about_ca_topic_score_codex":0.0022948224,"about_ca_topic_score_gemma":0.0027518913,"teacher_disagreement_score":0.0049794717,"about_ca_system_score_codex":0.00049382285,"about_ca_system_score_gemma":0.00052001094,"threshold_uncertainty_score":0.016657948},"labels":[],"label_agreement":null},{"id":"W2074030523","doi":"10.1007/s11590-014-0788-9","title":"A general variable neighborhood search variants for the travelling salesman problem with draft limits","year":2014,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Travelling salesman problem; Traveling purchaser problem; Variable neighborhood search; Descent (aeronautics); 2-opt; Mathematical optimization; Computational intelligence; Variable (mathematics); Set (abstract data type); Computer science; Limit (mathematics); Extension (predicate logic); Bottleneck traveling salesman problem; Context (archaeology); Mathematics; Metaheuristic; Artificial intelligence","score_opus":0.012782624187917832,"score_gpt":0.22573323936400003,"score_spread":0.2129506151760822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074030523","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.018117988,0.00085949985,0.96656144,0.00059972436,0.00018615396,0.00005611125,0.000104370156,0.0000598033,0.013454858],"genre_scores_gemma":[0.46663994,0.0018358174,0.48429665,0.00035932267,0.00037653281,0.00039865117,0.0005028224,0.00033457516,0.045255795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923146,0.00039002165,0.000023910368,0.0001322507,0.00015819885,0.00006415085],"domain_scores_gemma":[0.9987697,0.0007178618,0.0001064131,0.00011941354,0.00020155698,0.00008499857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019642445,0.0007054389,0.0011291642,0.00067035406,0.00053332595,0.0016161874,0.0024121671,0.0016719326,0.004967948],"category_scores_gemma":[0.0051230653,0.0005109186,0.0011471459,0.001140883,0.0010376188,0.0025071441,0.0016370985,0.0018685696,0.00053760066],"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.00008122796,0.00007299422,0.00038055045,0.00010845718,0.00004464644,0.00012273902,0.00008022277,0.6408227,0.00091768254,0.32848525,0.004887786,0.023995822],"study_design_scores_gemma":[0.000009532207,0.000022955352,0.000055305438,0.000008139345,0.000006031769,0.000026228663,0.0000113002425,0.96484494,0.00009626526,0.03291005,0.0020032881,0.000006052622],"about_ca_topic_score_codex":0.0041373875,"about_ca_topic_score_gemma":0.0030886126,"teacher_disagreement_score":0.004967948,"about_ca_system_score_codex":0.000998771,"about_ca_system_score_gemma":0.001135204,"threshold_uncertainty_score":0.016619503},"labels":[],"label_agreement":null},{"id":"W2077382842","doi":"10.1007/s11590-013-0621-x","title":"A locally optimal hierarchical divisive heuristic for bipartite modularity maximization","year":2013,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Bipartite graph; Heuristic; Modularity (biology); Mathematics; Combinatorics; Maximization; Hierarchical clustering; Partition (number theory); Cluster analysis; Theoretical computer science; Computer science; Graph; Mathematical optimization; Statistics","score_opus":0.007227211670618004,"score_gpt":0.22886043147526455,"score_spread":0.22163321980464654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077382842","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.014845723,0.00016885682,0.981492,0.0002232007,0.00004609874,0.00014202093,0.00008629051,0.0005859266,0.0024098756],"genre_scores_gemma":[0.18504009,0.000099361416,0.8093056,0.00031282264,0.00008073967,0.0003965707,0.0002935604,0.0004099587,0.0040612975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918324,0.00030806867,0.000034526365,0.00018515391,0.00018433889,0.00010454883],"domain_scores_gemma":[0.9972874,0.0017180685,0.0001490052,0.00028175247,0.00037505763,0.00018876573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018840663,0.0012028664,0.0017455386,0.0018259273,0.0011403608,0.0011632334,0.0038236808,0.0028242078,0.0063800025],"category_scores_gemma":[0.0067914305,0.0010595431,0.0010814726,0.0015157827,0.0013353201,0.0019307386,0.0025553654,0.0015788977,0.00109941],"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.0002294739,0.00022055538,0.0005663594,0.00018571936,0.00008684491,0.00008629177,0.00017093138,0.8013068,0.004302572,0.024486864,0.005962858,0.16239476],"study_design_scores_gemma":[0.000024110795,0.000016175987,0.000043772787,0.0000073546607,0.000007649337,0.000011622783,0.000012152633,0.9921497,0.00038631304,0.007038165,0.00029742706,0.000005564093],"about_ca_topic_score_codex":0.0076380707,"about_ca_topic_score_gemma":0.015995076,"teacher_disagreement_score":0.0076380707,"about_ca_system_score_codex":0.0017789885,"about_ca_system_score_gemma":0.0024761904,"threshold_uncertainty_score":0.021343172},"labels":[],"label_agreement":null},{"id":"W2078847524","doi":"10.1007/s11590-015-0890-7","title":"Optimal task allocation in multi-human multi-robot interaction","year":2015,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Human-Automation Interaction and Safety","field":"Psychology","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Air Force Research Laboratory; Air Force Office of Scientific Research; National Institute of Food and Agriculture","keywords":"Computer science; Task (project management); Robot; Computational intelligence; Key (lock); Human–robot interaction; Artificial intelligence; Information exchange; Distributed computing; Engineering; Computer security; Systems engineering","score_opus":0.07855689840505382,"score_gpt":0.3867542891530454,"score_spread":0.3081973907479916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078847524","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.15949424,0.00037669955,0.8293243,0.0009742869,0.000091814625,0.00011710769,0.000048089416,0.00014808233,0.009425389],"genre_scores_gemma":[0.9489658,0.00015361673,0.04756513,0.00008468413,0.000035047062,0.00015136122,0.00002506703,0.000055347078,0.0029639301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986873,0.0007684117,0.000050795377,0.00015179819,0.0001464623,0.00019523567],"domain_scores_gemma":[0.99665254,0.0025400193,0.00021976752,0.00014087888,0.00024140126,0.00020540592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016173435,0.0007799523,0.001398553,0.0006616827,0.0006169019,0.0012435587,0.00079712976,0.0010854929,0.0035159378],"category_scores_gemma":[0.007844636,0.0008927908,0.00044112423,0.00057798816,0.0010946597,0.0014873078,0.001680624,0.0007861003,0.00031486392],"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.00062504277,0.00024426702,0.001086766,0.00013135964,0.00012871895,0.00008434224,0.00028578797,0.91301537,0.004775532,0.03703968,0.0013212812,0.041261885],"study_design_scores_gemma":[0.00003931769,0.00010302418,0.0010550043,0.000008469338,0.000012642695,0.000013177364,0.00008602667,0.9580163,0.00046526024,0.039907366,0.00028063884,0.000012942878],"about_ca_topic_score_codex":0.0035206173,"about_ca_topic_score_gemma":0.0021282912,"teacher_disagreement_score":0.0035206173,"about_ca_system_score_codex":0.00092011376,"about_ca_system_score_gemma":0.0013141062,"threshold_uncertainty_score":0.011761963},"labels":[],"label_agreement":null},{"id":"W2080943874","doi":"10.1007/s11590-015-0869-4","title":"Solving the clique partitioning problem as a maximally diverse grouping problem","year":2015,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Clique; Heuristic; Variable neighborhood search; Mathematical optimization; Local search (optimization); Computer science; Mathematics; Diversification (marketing strategy); Metaheuristic; Combinatorics","score_opus":0.02134978858238772,"score_gpt":0.2425588380450419,"score_spread":0.22120904946265418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080943874","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.026141547,0.0002082745,0.96554804,0.00053334923,0.000050713374,0.000087425185,0.00015510184,0.000116745316,0.007158713],"genre_scores_gemma":[0.29752824,0.00034663995,0.69000053,0.00033993743,0.00015754596,0.00037819057,0.00089190516,0.00028352055,0.010073446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988889,0.0005767278,0.000025144349,0.00025208973,0.00015420066,0.00010300171],"domain_scores_gemma":[0.9985613,0.00097457774,0.000089248926,0.00015545143,0.00013245094,0.0000868922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014390019,0.00095700903,0.0013671005,0.000776633,0.0009703688,0.0014178441,0.0020987343,0.002244577,0.0060154675],"category_scores_gemma":[0.0038368625,0.00075876655,0.001002057,0.0015020139,0.00084175955,0.0021838008,0.0018175261,0.0015728635,0.0006730555],"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.000113707974,0.00015256582,0.0006301986,0.00023861724,0.00010471884,0.00015482657,0.00018894837,0.8136861,0.0028208103,0.10688394,0.010142248,0.06488337],"study_design_scores_gemma":[0.000026748867,0.00003189888,0.00016851125,0.000014353348,0.000014324016,0.000047023423,0.00007649035,0.93210256,0.00047236762,0.0646105,0.002426038,0.000009202169],"about_ca_topic_score_codex":0.0027361547,"about_ca_topic_score_gemma":0.0039932663,"teacher_disagreement_score":0.0060154675,"about_ca_system_score_codex":0.0007884578,"about_ca_system_score_gemma":0.001023211,"threshold_uncertainty_score":0.02012378},"labels":[],"label_agreement":null},{"id":"W2090646187","doi":"10.1007/s11590-008-0106-5","title":"Sufficiency of linear transformations on Euclidean Jordan algebras","year":2008,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Convexity; Mathematics; Euclidean geometry; Complementarity (molecular biology); Linear map; Jordan algebra; Commutative property; Linear complementarity problem; Euclidean distance; Pure mathematics; Transformation (genetics); Computational intelligence; Combinatorics; Euclidean distance matrix; Property (philosophy); Applied mathematics; Algebra over a field; Nonlinear system; Computer science; Algebra representation; Geometry","score_opus":0.01178637397763147,"score_gpt":0.21714134833001084,"score_spread":0.20535497435237937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090646187","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.26427788,0.002562604,0.5659728,0.0037142804,0.0004742837,0.00013989134,0.0009299087,0.0006110183,0.16131727],"genre_scores_gemma":[0.94517684,0.001150321,0.032489736,0.0012382742,0.00048865005,0.00017817794,0.00094139075,0.00025848328,0.018078018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973717,0.001126703,0.000167074,0.0003766538,0.0005866861,0.0003713062],"domain_scores_gemma":[0.9899095,0.00636957,0.0007911461,0.0007814702,0.001397885,0.000750426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029923369,0.00094137114,0.0013707719,0.002391227,0.0014970917,0.0028555794,0.0015994263,0.0015446115,0.010510438],"category_scores_gemma":[0.013165319,0.00093435525,0.0010597233,0.0014937083,0.0035164107,0.0056829047,0.0034831644,0.00331579,0.0016769782],"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.00008976678,0.000031069052,0.0002758837,0.000081506674,0.000016208309,0.000091894835,0.000132712,0.0016447689,0.0011003282,0.9889426,0.001993643,0.0055995435],"study_design_scores_gemma":[0.000024566643,0.000033550386,0.00020548045,0.00002067127,0.000008385116,0.000109925786,0.00007404764,0.0086637,0.00092852506,0.9881748,0.0017432749,0.000012977194],"about_ca_topic_score_codex":0.00038333033,"about_ca_topic_score_gemma":0.00042392235,"teacher_disagreement_score":0.010510438,"about_ca_system_score_codex":0.00066306733,"about_ca_system_score_gemma":0.0008596698,"threshold_uncertainty_score":0.03516096},"labels":[],"label_agreement":null},{"id":"W2093976283","doi":"10.1007/s11590-013-0662-1","title":"Service network design models for two-tier city logistics","year":2013,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Canada Research Chairs","keywords":"Flexibility (engineering); Computer science; Traffic management; Service (business); Tier 2 network; Network planning and design; Tier 1 network; Fleet management; Transport engineering; Operations research; Telecommunications; Business; Marketing","score_opus":0.04759172000207915,"score_gpt":0.19713150017476389,"score_spread":0.14953978017268474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093976283","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.045498583,0.0007202856,0.9332287,0.00093036087,0.00011754797,0.00017262703,0.00082152814,0.00027091973,0.018239401],"genre_scores_gemma":[0.8654961,0.0014509591,0.089788295,0.00028390618,0.00011006742,0.0004088748,0.0008327295,0.00020363058,0.041425467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868363,0.0005173061,0.000040451097,0.0001705535,0.00021804807,0.00036988113],"domain_scores_gemma":[0.9985671,0.00073549064,0.00015186764,0.000052245647,0.00033840653,0.00015476286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023290352,0.0019039016,0.0017709024,0.0013547487,0.000858622,0.0029824064,0.00245958,0.0027254038,0.010386967],"category_scores_gemma":[0.0036179363,0.0011515252,0.0016736701,0.0025534823,0.0011698606,0.002219831,0.0016880328,0.0015103006,0.0011956721],"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.000028237175,0.000015389169,0.00012291562,0.000024736124,0.000011755716,0.000023687802,0.000017208049,0.98671246,0.00018134816,0.010158494,0.0006045971,0.0020992234],"study_design_scores_gemma":[0.0000047888957,0.000009568356,0.000037994996,0.000002808505,0.0000050441176,0.0000058472233,0.000011993695,0.9957991,0.000033852994,0.0038010331,0.00028399422,0.000003995122],"about_ca_topic_score_codex":0.031760454,"about_ca_topic_score_gemma":0.029759865,"teacher_disagreement_score":0.031760454,"about_ca_system_score_codex":0.0050235637,"about_ca_system_score_gemma":0.0026862796,"threshold_uncertainty_score":0.06315118},"labels":[],"label_agreement":null},{"id":"W2095616212","doi":"10.1007/s11590-010-0264-0","title":"New weighing matrices constructed from two circulant submatrices","year":2010,"lang":"en","type":"article","venue":"Optimization Letters","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Circulant matrix; Computational intelligence; Mathematics; Block matrix; Combinatorics; Block (permutation group theory); Matrix (chemical analysis); Algebra over a field; Discrete mathematics; Computer science; Pure mathematics; Eigenvalues and eigenvectors; Artificial intelligence; Physics; Chemistry","score_opus":0.0025580334296203483,"score_gpt":0.1698387427357697,"score_spread":0.16728070930614936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095616212","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.028905742,0.00020390627,0.96097946,0.00020011861,0.00040054074,0.00006356387,0.00011651505,0.00041749683,0.008712712],"genre_scores_gemma":[0.25913432,0.00032716387,0.72314787,0.00030821847,0.00018718766,0.00010853228,0.00029025722,0.00021954796,0.016276855],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971133,0.000071413706,0.0000118847265,0.00005377178,0.00012385326,0.000027736894],"domain_scores_gemma":[0.99948186,0.00014278243,0.000047817917,0.00010966224,0.00015483612,0.00006306659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004259128,0.00082787126,0.000461936,0.0006451317,0.0003599859,0.0007145181,0.00072900957,0.0008532623,0.004751847],"category_scores_gemma":[0.0015476259,0.00031730332,0.00043664334,0.00097592775,0.00039501936,0.0007176241,0.00048862176,0.0008521796,0.0012863018],"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.0004990506,0.0002671944,0.000689658,0.00026704717,0.00011650894,0.0004929177,0.000129066,0.1022891,0.1877337,0.32926363,0.012725336,0.36552668],"study_design_scores_gemma":[0.00009826195,0.00019109347,0.00081624667,0.000036223504,0.00009520924,0.00067025033,0.000037947826,0.85156566,0.038866784,0.0849362,0.022578705,0.00010744662],"about_ca_topic_score_codex":0.00048375243,"about_ca_topic_score_gemma":0.0013848704,"teacher_disagreement_score":0.004751847,"about_ca_system_score_codex":0.00028951478,"about_ca_system_score_gemma":0.00047218218,"threshold_uncertainty_score":0.015896559},"labels":[],"label_agreement":null},{"id":"W2120279149","doi":"10.1007/s11590-008-0085-6","title":"On a posterior evaluation of a simple greedy method for set packing","year":2008,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Simple (philosophy); Set packing; Mathematics; Mathematical optimization; Set (abstract data type); Upper and lower bounds; Greedy algorithm; Relaxation (psychology); Packing problems; Function (biology); Linear programming relaxation; Combinatorics; Computer science; Linear programming","score_opus":0.04883040661566376,"score_gpt":0.2983069939448683,"score_spread":0.24947658732920455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120279149","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.011917014,0.0003949759,0.98125273,0.00047621157,0.00014220786,0.00010220903,0.00008696036,0.0005490291,0.0050786985],"genre_scores_gemma":[0.22455095,0.00047284956,0.76269174,0.00046264066,0.000400724,0.00037534445,0.00047582155,0.00088730006,0.00968255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99530727,0.0023045142,0.0001627065,0.00039067125,0.0015020155,0.00033288935],"domain_scores_gemma":[0.9841728,0.012269727,0.00034702924,0.001158303,0.0016112777,0.00044076523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007143022,0.0016599629,0.002363025,0.0015515382,0.0011274273,0.0027945747,0.0026672182,0.0027509427,0.013315578],"category_scores_gemma":[0.029261822,0.0010999643,0.0013104035,0.0017597291,0.0022520262,0.004111235,0.0038629798,0.0031018266,0.0016783336],"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.0013987473,0.00025514205,0.0015302065,0.00045234393,0.00017185525,0.00014636568,0.00019823042,0.53632104,0.0059941323,0.15711863,0.014945519,0.28146774],"study_design_scores_gemma":[0.00004053775,0.000051315525,0.00016720491,0.000026535732,0.00001737702,0.00004349601,0.000014135044,0.9705574,0.0008141797,0.02739308,0.0008601687,0.000014699858],"about_ca_topic_score_codex":0.005488798,"about_ca_topic_score_gemma":0.007758,"teacher_disagreement_score":0.013315578,"about_ca_system_score_codex":0.0021228509,"about_ca_system_score_gemma":0.0031291815,"threshold_uncertainty_score":0.044545054},"labels":[],"label_agreement":null},{"id":"W2121788643","doi":"10.1007/s11590-011-0412-1","title":"Incorporating the threat of terrorist attacks in the design of public service facility networks","year":2011,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Tabu search; Planner; Computer science; Heuristic; Operations research; Service (business); Maximization; Service level; Computational intelligence; Bilevel optimization; Facility location problem; Network planning and design; Level of service; Mathematical optimization; Transport engineering; Optimization problem; Business; Engineering; Computer network; Mathematics; Marketing; Artificial intelligence","score_opus":0.09519457258726062,"score_gpt":0.22391906770479125,"score_spread":0.12872449511753065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121788643","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.16748628,0.000707968,0.8073288,0.0018797871,0.0001405496,0.000106414336,0.00013910809,0.0001887111,0.022022387],"genre_scores_gemma":[0.97779316,0.0002176324,0.019572474,0.00007473157,0.000035276025,0.000040663486,0.000031101812,0.00004097538,0.002193957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988875,0.00064315536,0.000021275731,0.00008540856,0.00014955286,0.0002131303],"domain_scores_gemma":[0.99749434,0.001704019,0.00029988575,0.00006868582,0.00029239434,0.00014072705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017410682,0.0010288699,0.0012313847,0.0006369896,0.00064043084,0.0017414048,0.0011717895,0.0018506064,0.0032755798],"category_scores_gemma":[0.006598437,0.0010345619,0.0005960768,0.0007672438,0.0009470775,0.0018079722,0.0010802298,0.0013354104,0.0002343605],"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.00001139546,0.0000036666488,0.000084453015,0.0000059124172,0.000005346112,0.000008830967,0.000005043422,0.9977254,0.000050673087,0.001128791,0.00008049684,0.00088990503],"study_design_scores_gemma":[0.0000039976276,0.000015257046,0.000049147588,0.000002252886,0.0000044667977,0.0000040095747,0.000008657436,0.99862504,0.00003907286,0.001093618,0.00015218832,0.0000024069484],"about_ca_topic_score_codex":0.009769261,"about_ca_topic_score_gemma":0.010489968,"teacher_disagreement_score":0.009769261,"about_ca_system_score_codex":0.002245193,"about_ca_system_score_gemma":0.0018288498,"threshold_uncertainty_score":0.019424796},"labels":[],"label_agreement":null},{"id":"W2124982716","doi":"10.1007/s11590-008-0076-7","title":"Comments on “Dual methods for nonconvex spectrum optimization of multicarrier systems”","year":2008,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Mitacs","keywords":"Convexity; Property (philosophy); Dual (grammatical number); Duality (order theory); Scope (computer science); Mathematics; Computational intelligence; Spectrum (functional analysis); Mathematical optimization; Mathematical economics; Optimization problem; Applied mathematics; Computer science; Pure mathematics; Economics; Artificial intelligence; Physics","score_opus":0.016784445877630002,"score_gpt":0.27271200015331154,"score_spread":0.25592755427568153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124982716","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006184373,0.0025831913,0.008209842,0.9092518,0.07104598,0.000040896583,0.00032176537,0.00010634457,0.007821748],"genre_scores_gemma":[0.012268041,0.0021905727,0.005896083,0.88365674,0.07935019,0.00017412422,0.00012546507,0.00018369482,0.01615513],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9906351,0.0029678629,0.0008522786,0.0011610144,0.0036409986,0.00074264326],"domain_scores_gemma":[0.9637933,0.02379602,0.0016567921,0.0009950099,0.009025402,0.0007335421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009102315,0.0013544699,0.0016048951,0.0011859135,0.0038522698,0.0034838545,0.0049550342,0.02725276,0.007902927],"category_scores_gemma":[0.059938315,0.0008663206,0.002174128,0.0015113472,0.005240815,0.004870319,0.0023820025,0.027267748,0.0041937083],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00008380992,0.000018550976,0.00011827538,0.0001336078,0.00002553137,0.0001829734,0.00014364034,0.00078779226,0.00029172775,0.03031002,0.963511,0.0043930267],"study_design_scores_gemma":[0.0001693397,0.000052531534,0.0010539013,0.00044757602,0.00006714869,0.00026655488,0.000251372,0.007618049,0.0017496282,0.08201235,0.9060923,0.00021937606],"about_ca_topic_score_codex":0.013482882,"about_ca_topic_score_gemma":0.010677406,"teacher_disagreement_score":0.02725276,"about_ca_system_score_codex":0.0037280966,"about_ca_system_score_gemma":0.0035346164,"threshold_uncertainty_score":0.0481382},"labels":[],"label_agreement":null},{"id":"W2127758564","doi":"10.1007/s11590-015-0959-3","title":"On the cardinality of positively linearly independent sets","year":2015,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences","keywords":"Cardinality (data modeling); Combinatorics; Mathematics; Set (abstract data type); Upper and lower bounds; Computational intelligence; Independent set; Discrete mathematics; Computer science; Graph; Artificial intelligence; Data mining","score_opus":0.09613552248103259,"score_gpt":0.35432996337673606,"score_spread":0.2581944408957035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127758564","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57517165,0.002679752,0.3132027,0.014871384,0.0006082866,0.0001728231,0.0035686078,0.00029714077,0.089427635],"genre_scores_gemma":[0.9445992,0.0027353077,0.03762277,0.0010809199,0.0017349174,0.00049389456,0.002282007,0.00030220998,0.009148809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99188143,0.0039404677,0.00035732475,0.0008802263,0.0019945167,0.00094601436],"domain_scores_gemma":[0.8482083,0.13208108,0.0064612576,0.0045537017,0.0044843256,0.004211315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0093678655,0.0017581233,0.0028169507,0.0031937414,0.0026125943,0.005850199,0.004273257,0.0021283117,0.008167682],"category_scores_gemma":[0.06310712,0.0016687417,0.0015728942,0.0030214738,0.008754755,0.011121028,0.0066561946,0.0076731467,0.00082264113],"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.0010590651,0.0001526011,0.0046845693,0.0003166268,0.00014174615,0.0002566838,0.00058988563,0.034064166,0.002064991,0.9389548,0.0066097267,0.011105185],"study_design_scores_gemma":[0.00009895243,0.0000728435,0.0018925247,0.00015175084,0.000048387257,0.00024525527,0.00025409847,0.09354014,0.0012106325,0.90068877,0.0017398014,0.000056964935],"about_ca_topic_score_codex":0.00087919144,"about_ca_topic_score_gemma":0.00058175134,"teacher_disagreement_score":0.0093678655,"about_ca_system_score_codex":0.0024045648,"about_ca_system_score_gemma":0.0016603644,"threshold_uncertainty_score":0.049542606},"labels":[],"label_agreement":null},{"id":"W2152831483","doi":"10.1007/s11590-011-0383-2","title":"Every maximally monotone operator of Fitzpatrick–Phelps type is actually of dense type","year":2011,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Pseudo-monotone operator; Mathematics; Type (biology); Monotonic function; Monotone polygon; Banach space; Operator (biology); Pure mathematics; Space (punctuation); Discrete mathematics; Finite-rank operator; Operator space; Computer science; Mathematical analysis","score_opus":0.023883726949208324,"score_gpt":0.2162120690726145,"score_spread":0.1923283421234062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152831483","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.1787419,0.00062113925,0.7114796,0.0039918832,0.0010149732,0.00011473277,0.0005195889,0.00044152484,0.10307462],"genre_scores_gemma":[0.8240342,0.00069233205,0.12600343,0.002149895,0.0009132074,0.00027193734,0.00044834628,0.0003403622,0.045146346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898976,0.00019448037,0.000046142857,0.0002530293,0.0002803208,0.00023629863],"domain_scores_gemma":[0.99801886,0.0007462588,0.00018740603,0.00022340607,0.00045081179,0.00037335334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015773936,0.00089955056,0.0010972086,0.0014345769,0.0019956136,0.0020527109,0.0013876508,0.0019971689,0.009915958],"category_scores_gemma":[0.00415698,0.00060608494,0.0009698749,0.0009413908,0.0036971923,0.0056146937,0.003293227,0.0034217623,0.0006969201],"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.000036621586,0.000017987799,0.00010637643,0.0000530418,0.000012846709,0.00007411103,0.00011089114,0.00030580582,0.002686654,0.99039406,0.0012015122,0.005000115],"study_design_scores_gemma":[0.000020240868,0.000043422882,0.00025721992,0.000015449925,0.000007104874,0.00039166375,0.00012870671,0.0060466817,0.0016030264,0.9876272,0.0038373386,0.000021900045],"about_ca_topic_score_codex":0.0005559839,"about_ca_topic_score_gemma":0.00046421503,"teacher_disagreement_score":0.009915958,"about_ca_system_score_codex":0.0007067601,"about_ca_system_score_gemma":0.0007882573,"threshold_uncertainty_score":0.03317213},"labels":[],"label_agreement":null},{"id":"W2234116669","doi":"10.1007/s11590-007-0074-1","title":"Exact L 2-norm plane separation","year":2008,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"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; Polytechnique Montréal","funders":"","keywords":"Norm (philosophy); Quadratic equation; Computation; Exact solutions in general relativity; Mathematics; Regular polygon; Heuristic; Plane (geometry); Mathematical optimization; Applied mathematics; Combinatorics; Computer science; Algorithm; Mathematical analysis; Geometry","score_opus":0.047499468453573064,"score_gpt":0.3420442142460877,"score_spread":0.29454474579251466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2234116669","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.0049334536,0.00027869377,0.98326564,0.00040443402,0.00016947908,0.000013755595,0.00014920064,0.0004601301,0.010325231],"genre_scores_gemma":[0.23106642,0.00056933257,0.7477355,0.00066842244,0.0002679475,0.00008035451,0.0007176415,0.00056218414,0.018332276],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990165,0.00025968472,0.00004726856,0.00016289864,0.0003963788,0.00011731896],"domain_scores_gemma":[0.9994229,0.00014919187,0.000038714756,0.0002170021,0.00013504134,0.000037215857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009752598,0.0010945664,0.0009999493,0.0006409764,0.00051503733,0.002389883,0.0010199536,0.0016543139,0.011315119],"category_scores_gemma":[0.0028644009,0.0005272444,0.0005366062,0.0011078417,0.0008073162,0.003671534,0.0033272284,0.0022299064,0.003783403],"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.001023123,0.00014505726,0.00062782783,0.00026648326,0.00015878273,0.00021397996,0.0001436788,0.1842022,0.021566771,0.27573663,0.030300325,0.48561513],"study_design_scores_gemma":[0.000086047185,0.000062520296,0.0002452119,0.000028793076,0.000025871015,0.0002873195,0.00006646707,0.753341,0.0134690795,0.214604,0.017744878,0.00003886704],"about_ca_topic_score_codex":0.0007999357,"about_ca_topic_score_gemma":0.0011395812,"teacher_disagreement_score":0.011315119,"about_ca_system_score_codex":0.00049622793,"about_ca_system_score_gemma":0.0009482535,"threshold_uncertainty_score":0.037852824},"labels":[],"label_agreement":null},{"id":"W2239439492","doi":"10.1007/s11590-016-1023-7","title":"On the convergence rate of grid search for polynomial optimization over the simplex","year":2016,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Simplex; Mathematics; Polynomial; Grid; Convergence (economics); Minification; Computational intelligence; Simplex algorithm; Rate of convergence; Combinatorics; Mathematical optimization; Applied mathematics; Linear programming; Mathematical analysis; Geometry; Computer science","score_opus":0.048723286617892415,"score_gpt":0.33309953971401396,"score_spread":0.2843762530961215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2239439492","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.07996948,0.0063684625,0.87829244,0.0032257289,0.0005926723,0.0002097407,0.0004054756,0.00090147683,0.030034428],"genre_scores_gemma":[0.7627598,0.0036002067,0.2201892,0.00097050896,0.00034004904,0.00056504324,0.00070006977,0.0015876201,0.009287437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934742,0.0040369704,0.00022211725,0.00047630753,0.0011733507,0.00061720336],"domain_scores_gemma":[0.9004463,0.08822175,0.0016311272,0.004375123,0.0041965386,0.0011291078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016855309,0.0014433785,0.0021417416,0.002167169,0.0012176005,0.0022388177,0.0026371442,0.002054859,0.0067807278],"category_scores_gemma":[0.11247627,0.0007346019,0.0013084935,0.002309583,0.004321899,0.0045766504,0.004388747,0.0052036257,0.0011896741],"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.0018973029,0.00016735266,0.0054616253,0.00068691775,0.00018422282,0.00018585511,0.00045014813,0.6186938,0.002998773,0.28449336,0.010557287,0.07422327],"study_design_scores_gemma":[0.000055842036,0.00007871408,0.00038227256,0.00008977308,0.000023756482,0.00004999398,0.000060680388,0.948267,0.0008135525,0.049160793,0.0010013182,0.000016404789],"about_ca_topic_score_codex":0.006687081,"about_ca_topic_score_gemma":0.0040552486,"teacher_disagreement_score":0.016855309,"about_ca_system_score_codex":0.0017663663,"about_ca_system_score_gemma":0.002545691,"threshold_uncertainty_score":0.089140475},"labels":[],"label_agreement":null},{"id":"W2269669929","doi":"10.1007/s11590-015-0973-5","title":"A basic variable neighborhood search heuristic for the uncapacitated multiple allocation p-hub center problem","year":2015,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Royal Ottawa Mental Health Centre","funders":"Russian Science Foundation; National Research University Higher School of Economics; Agence Nationale de la Recherche","keywords":"Variable neighborhood search; Heuristics; Mathematical optimization; Heuristic; Benchmark (surveying); Solver; Pairwise comparison; Computational intelligence; Local search (optimization); Computer science; Set (abstract data type); Variable (mathematics); Metaheuristic; Mathematics; Artificial intelligence","score_opus":0.029756073684588987,"score_gpt":0.24712882116455606,"score_spread":0.21737274747996707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269669929","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.01901876,0.0003123075,0.97098416,0.00018403944,0.000093217655,0.000091272144,0.00007663482,0.00022807824,0.0090115415],"genre_scores_gemma":[0.4202371,0.0002976932,0.5705297,0.0001547474,0.00007534366,0.00029756827,0.00022078418,0.0001905356,0.00799654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997453,0.00010628842,0.000006315228,0.00003900509,0.00006418598,0.00003883761],"domain_scores_gemma":[0.9996493,0.00020886917,0.00002931995,0.000026223597,0.00006111204,0.000025226394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005980141,0.0004890705,0.00095719687,0.00056930986,0.00047963523,0.0005934719,0.0014165823,0.00093969266,0.004524682],"category_scores_gemma":[0.0015242812,0.0003612302,0.00044870982,0.0009150159,0.000430338,0.00083902566,0.0007236487,0.00069483503,0.0004328982],"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.000087077424,0.00005891729,0.00014663972,0.0000454749,0.000017828363,0.000031651398,0.000024930952,0.93187153,0.0007136066,0.019174153,0.0028496722,0.044978518],"study_design_scores_gemma":[0.000012507559,0.000019190871,0.00003388991,0.0000041938447,0.0000033822575,0.000008033478,0.000005828616,0.9962483,0.00012985633,0.0029409775,0.0005910306,0.0000028621637],"about_ca_topic_score_codex":0.004383552,"about_ca_topic_score_gemma":0.005481663,"teacher_disagreement_score":0.004524682,"about_ca_system_score_codex":0.0007298545,"about_ca_system_score_gemma":0.0011113326,"threshold_uncertainty_score":0.01513654},"labels":[],"label_agreement":null},{"id":"W2269671001","doi":"10.1007/s11590-016-1081-x","title":"On a linearization technique for solving the quadratic set covering problem and variations","year":2016,"lang":"en","type":"preprint","venue":"Optimization Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Linearization; Heuristic; Class (philosophy); Mathematical optimization; Set (abstract data type); Quadratic equation; Mathematics; Quadratic model; Computer science; Algorithm; Nonlinear system; Artificial intelligence; Statistics","score_opus":0.015207257924394528,"score_gpt":0.2564950073204825,"score_spread":0.241287749396088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269671001","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.0019284582,0.00027193778,0.9922396,0.00015182371,0.00006578165,0.000025568186,0.000030393012,0.000100838595,0.0051855636],"genre_scores_gemma":[0.2513999,0.0020405368,0.7153126,0.00068567647,0.000497669,0.00037740235,0.00032350552,0.00056763017,0.028795138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969625,0.00012241221,0.000011182186,0.000046228626,0.00010202594,0.00002194617],"domain_scores_gemma":[0.9996495,0.00021949364,0.000024769923,0.0000343313,0.00005613351,0.000015713458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063810614,0.0010314363,0.000699066,0.00074138114,0.00037739426,0.00060518505,0.0007665842,0.0007716623,0.005110375],"category_scores_gemma":[0.0017637913,0.0004018172,0.0010408711,0.00089803943,0.00087864255,0.0011170758,0.0016220115,0.0020354495,0.0010921354],"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.00007740371,0.00012368514,0.00030740647,0.0004534983,0.000090518195,0.00016919937,0.00037027185,0.4497974,0.017298255,0.32718143,0.013409135,0.19072187],"study_design_scores_gemma":[0.000009452879,0.00007858891,0.000110004774,0.000027858214,0.000017119792,0.0000644244,0.00003705221,0.9217087,0.0017985372,0.067542754,0.008586194,0.000019367211],"about_ca_topic_score_codex":0.0022952284,"about_ca_topic_score_gemma":0.0024185565,"teacher_disagreement_score":0.005110375,"about_ca_system_score_codex":0.000498711,"about_ca_system_score_gemma":0.0004503967,"threshold_uncertainty_score":0.017095923},"labels":[],"label_agreement":null},{"id":"W2273624835","doi":"10.1007/s11590-016-0998-4","title":"A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem","year":2016,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lagrangian relaxation; Mathematical optimization; Heuristic; Facility location problem; Lagrangian; Branch and bound; Computational intelligence; Upper and lower bounds; Mathematics; Minification; Set (abstract data type); Computer science; Integer (computer science); Applied mathematics; Artificial intelligence","score_opus":0.015758639424597435,"score_gpt":0.20261033103535744,"score_spread":0.18685169161076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2273624835","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.019568393,0.000508382,0.96626496,0.0009105065,0.00011436463,0.00015675173,0.0002163213,0.00023089405,0.012029426],"genre_scores_gemma":[0.35252047,0.000579764,0.63614756,0.00040740293,0.00012603469,0.00037634527,0.00045616567,0.00023215819,0.009154157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903715,0.0005367567,0.000024885316,0.000102359096,0.00015375037,0.00014513185],"domain_scores_gemma":[0.9979195,0.0015556902,0.00011790725,0.00008895295,0.00017604086,0.00014193387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018184591,0.0009531094,0.0017473124,0.0011804755,0.00070418743,0.001784467,0.0021767386,0.0026301877,0.006214733],"category_scores_gemma":[0.0044059134,0.0008787057,0.0010064418,0.0018505157,0.0011824764,0.0015841374,0.0015388737,0.001738266,0.00064710435],"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.000100797275,0.00010399791,0.00022261757,0.000102234044,0.000025482625,0.00008766243,0.000047891644,0.94506705,0.00039694656,0.02384244,0.004603372,0.025399407],"study_design_scores_gemma":[0.00004635601,0.000030073752,0.00006261569,0.000015638898,0.000008216368,0.000019403988,0.000022041806,0.99082875,0.00011955572,0.007818725,0.0010217468,0.000006891915],"about_ca_topic_score_codex":0.009209069,"about_ca_topic_score_gemma":0.010662928,"teacher_disagreement_score":0.009209069,"about_ca_system_score_codex":0.0019650552,"about_ca_system_score_gemma":0.0033912738,"threshold_uncertainty_score":0.020790398},"labels":[],"label_agreement":null},{"id":"W2290361605","doi":"10.1007/s11590-015-0989-x","title":"An approximation algorithm for the nth power metric facility location problem with linear penalties","year":2015,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Facility location problem; Metric (unit); Mathematics; Linear programming; Approximation algorithm; Power (physics); Algorithm; Combinatorics; Mathematical optimization; Physics","score_opus":0.02564185914331807,"score_gpt":0.23210823795748256,"score_spread":0.2064663788141645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290361605","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.01122407,0.00038575183,0.9801819,0.0006048488,0.00013604271,0.000111904825,0.00018512872,0.0005545788,0.0066158324],"genre_scores_gemma":[0.2010615,0.0003928697,0.78825915,0.00031338262,0.00015453745,0.00041846855,0.00070908683,0.00025187508,0.008439105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902785,0.00027815474,0.000045915906,0.0001764254,0.00026438307,0.00020723701],"domain_scores_gemma":[0.99802077,0.0012252921,0.00012652345,0.00018582318,0.00029246946,0.00014923626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015039967,0.001443567,0.0020261025,0.00095205475,0.0007846771,0.001921269,0.0033001003,0.0025524052,0.009454474],"category_scores_gemma":[0.005557815,0.0008135205,0.0010492392,0.0020463383,0.000901476,0.0022219687,0.0021617643,0.002699237,0.0015542739],"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.0002338525,0.00019537934,0.0005099203,0.00013658067,0.000040152885,0.00008004477,0.000080756625,0.86868405,0.0008753005,0.022537995,0.0076257344,0.09900019],"study_design_scores_gemma":[0.000039319923,0.000021620584,0.0000580934,0.000008765265,0.0000058687306,0.00002331613,0.000017435934,0.9922166,0.00013623825,0.0068143914,0.000653662,0.0000046007162],"about_ca_topic_score_codex":0.013751049,"about_ca_topic_score_gemma":0.015824778,"teacher_disagreement_score":0.013751049,"about_ca_system_score_codex":0.0025903129,"about_ca_system_score_gemma":0.0039022202,"threshold_uncertainty_score":0.03162831},"labels":[],"label_agreement":null},{"id":"W2469651670","doi":"10.1007/s11590-016-1004-x","title":"General variable neighborhood search for the uncapacitated single allocation p-hub center problem","year":2016,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Royal Ottawa Mental Health Centre","funders":"Natural Sciences and Engineering Research Council of Canada; National Research University Higher School of Economics; Russian Science Foundation","keywords":"Benchmark (surveying); Variable neighborhood search; Heuristic; Mathematical optimization; Variable (mathematics); Descent (aeronautics); Computer science; Local search (optimization); Ant colony optimization algorithms; Mathematics; Metaheuristic; Engineering","score_opus":0.018576060220996726,"score_gpt":0.23410725908140795,"score_spread":0.21553119886041122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2469651670","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.03106746,0.00061317533,0.95566165,0.00063407625,0.0000794858,0.00006935208,0.0001333514,0.00010587473,0.01163553],"genre_scores_gemma":[0.6880848,0.00074348686,0.28777832,0.0002731826,0.00012715165,0.00046618452,0.00040159572,0.00022613902,0.021899194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971265,0.0001484234,0.0000058779337,0.000051541534,0.000047792484,0.000033717086],"domain_scores_gemma":[0.9990706,0.00069564173,0.00007276035,0.000032604956,0.0000849847,0.000043399603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011205444,0.00060723734,0.0012255049,0.0006243393,0.00043856894,0.00092876574,0.0014071172,0.0011172025,0.0043856413],"category_scores_gemma":[0.0030906084,0.0004996167,0.000511189,0.00089140487,0.0006639758,0.001129002,0.0009970659,0.00090748916,0.00029956407],"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.000046843423,0.000031688196,0.00017291133,0.00004508739,0.000021075519,0.000024455378,0.000016998747,0.959724,0.00016728562,0.029263442,0.0018054874,0.008680658],"study_design_scores_gemma":[0.0000070033375,0.000005856102,0.000025940477,0.0000026207574,0.0000019885451,0.0000032795758,0.00000460744,0.99341077,0.000027179476,0.0062896386,0.00021967884,0.0000014695734],"about_ca_topic_score_codex":0.00553575,"about_ca_topic_score_gemma":0.0056730704,"teacher_disagreement_score":0.00553575,"about_ca_system_score_codex":0.0010302259,"about_ca_system_score_gemma":0.0012582301,"threshold_uncertainty_score":0.014671445},"labels":[],"label_agreement":null},{"id":"W2507740005","doi":"10.1007/s11590-016-1080-y","title":"Exact two steps SOCP/SDP formulation for a modified conic trust region subproblem","year":2016,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; University of Guilan","keywords":"Trust region; Conic section; Mathematical optimization; Lemma (botany); Parametrization (atmospheric modeling); Mathematics; Computational intelligence; Class (philosophy); Nonlinear system; Relaxation (psychology); Nonlinear programming; Computer science; Applied mathematics; Artificial intelligence","score_opus":0.06480907493608071,"score_gpt":0.34428207647009645,"score_spread":0.2794730015340158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507740005","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.00943867,0.000145765,0.9797538,0.00025951493,0.000102065744,0.00010515352,0.00013334474,0.00017499608,0.009886606],"genre_scores_gemma":[0.43831125,0.00019370764,0.5457121,0.00025660015,0.00013007098,0.0004873536,0.00039791132,0.00032545347,0.014185565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953127,0.000116010786,0.000019828905,0.000075173775,0.00018158228,0.000076229604],"domain_scores_gemma":[0.99899894,0.00048965414,0.000056189074,0.00012140972,0.00026703198,0.00006683667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008735433,0.0008833021,0.0011815807,0.00036725384,0.00043229962,0.0014306334,0.0011947829,0.0018597497,0.010830953],"category_scores_gemma":[0.002550374,0.00054018915,0.0007139872,0.00053466967,0.0006586466,0.00096300856,0.0015262252,0.0017563642,0.0011145454],"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.00007478615,0.000037116853,0.00015966935,0.000097452496,0.000015059841,0.00011727538,0.000029726945,0.9588129,0.0010866988,0.016937872,0.0026689498,0.019962592],"study_design_scores_gemma":[0.00000640054,0.000008302313,0.000016369577,0.0000031237591,0.000001985959,0.000008442687,0.000005783857,0.9975904,0.0001441847,0.0018795306,0.0003335687,0.0000019123916],"about_ca_topic_score_codex":0.0069714203,"about_ca_topic_score_gemma":0.007963159,"teacher_disagreement_score":0.010830953,"about_ca_system_score_codex":0.00081334414,"about_ca_system_score_gemma":0.0018116591,"threshold_uncertainty_score":0.036233127},"labels":[],"label_agreement":null},{"id":"W2515178122","doi":"10.1007/s11590-017-1226-6","title":"Robust optimization of noisy blackbox problems using the Mesh Adaptive Direct Search algorithm","year":2018,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Computer science; Algorithm; Noise (video); Computational intelligence; Mathematical optimization; Optimization problem; Resampling; Function (biology); Mathematics; Artificial intelligence; Image (mathematics)","score_opus":0.0369056004540894,"score_gpt":0.2605318215021814,"score_spread":0.223626221048092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2515178122","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.004953342,0.0001512674,0.99309534,0.00010000369,0.00005014718,0.000018059924,0.000019841227,0.00011289101,0.0014989377],"genre_scores_gemma":[0.4004136,0.000360968,0.5924959,0.00017038552,0.00012985582,0.00036827865,0.00015584273,0.00034494975,0.0055602933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993118,0.00034229053,0.000026138629,0.00008586488,0.00019565647,0.000038325747],"domain_scores_gemma":[0.998054,0.0014067454,0.00015678248,0.00012949841,0.0001894219,0.00006348453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020930574,0.0010526689,0.0021057744,0.00060918886,0.00041707457,0.0012471154,0.0014017326,0.0018768231,0.0025987271],"category_scores_gemma":[0.0066590616,0.00070929003,0.000794177,0.0005878183,0.0012373239,0.0013995484,0.002071691,0.0013178737,0.00043925966],"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.00013336443,0.000026163696,0.00016021216,0.00009642666,0.00005855102,0.000047850663,0.000029325658,0.96134424,0.0015190964,0.020711286,0.0007261102,0.015147355],"study_design_scores_gemma":[0.000006615142,0.000005642937,0.000011905472,0.0000032787198,0.0000018434782,0.0000026901967,0.0000011349555,0.9972972,0.00015880232,0.002387419,0.000121296456,0.000002142146],"about_ca_topic_score_codex":0.0019077727,"about_ca_topic_score_gemma":0.0014305495,"teacher_disagreement_score":0.0025987271,"about_ca_system_score_codex":0.0005849392,"about_ca_system_score_gemma":0.0009916291,"threshold_uncertainty_score":0.011069298},"labels":[],"label_agreement":null},{"id":"W2521931003","doi":"10.1007/s11590-016-1083-8","title":"Optimization of covered call strategies","year":2016,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Holland Bloorview Kids Rehabilitation Hospital; University of Toronto","funders":"Mitacs","keywords":"CVAR; Call option; Tail risk; Expected shortfall; Downside risk; Sample (material); Semivariance; Computer science; Econometrics; Optimization problem; Expected utility hypothesis; Asset (computer security); Risk measure; Economics; Financial economics; Risk management; Finance; Mathematics; Statistics","score_opus":0.014390779112488976,"score_gpt":0.19892961808768492,"score_spread":0.18453883897519593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521931003","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.27273247,0.0015941273,0.6734693,0.0024595077,0.00023861577,0.00010967101,0.00038768633,0.00039666248,0.04861195],"genre_scores_gemma":[0.96532726,0.0003843508,0.018970365,0.00014738864,0.00009560736,0.000082725965,0.00018006189,0.00013707168,0.014675042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928445,0.00033577546,0.000021499578,0.000080322,0.00013630203,0.00014175898],"domain_scores_gemma":[0.9978479,0.0015417291,0.00013254554,0.00008675026,0.00017922981,0.00021178697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010562968,0.000990994,0.0012254793,0.0006019042,0.00033865642,0.0024867936,0.000935245,0.001963853,0.0057980088],"category_scores_gemma":[0.006098198,0.0007968271,0.0005697097,0.00064819964,0.0009045303,0.001458388,0.0013077192,0.001125749,0.00062151457],"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.00028567613,0.00008431558,0.00047404115,0.00010483921,0.00007520884,0.0001828137,0.00007112283,0.8966776,0.0030221234,0.08108111,0.003516371,0.014424812],"study_design_scores_gemma":[0.00001880026,0.00002591409,0.00016999149,0.0000083729565,0.0000087317585,0.000021755443,0.000012520783,0.9827345,0.00027413332,0.016308991,0.00041036846,0.0000059039508],"about_ca_topic_score_codex":0.0015007406,"about_ca_topic_score_gemma":0.0010274681,"teacher_disagreement_score":0.0057980088,"about_ca_system_score_codex":0.0012969262,"about_ca_system_score_gemma":0.0009798543,"threshold_uncertainty_score":0.019396305},"labels":[],"label_agreement":null},{"id":"W2589061561","doi":"10.1007/s11590-017-1117-x","title":"Compositions of convex functions and fully linear models","year":2017,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computational intelligence; Regular polygon; Mathematics; Convex analysis; Computer science; Convex optimization; Artificial intelligence; Geometry","score_opus":0.06278987189070842,"score_gpt":0.346609635309974,"score_spread":0.2838197634192656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2589061561","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.033576448,0.000542566,0.9444206,0.0009416343,0.00014085598,0.000034141674,0.00022421288,0.00032145786,0.019798007],"genre_scores_gemma":[0.65308154,0.0016121531,0.27783057,0.000887468,0.0005345542,0.0003398444,0.0013577405,0.00094326754,0.06341286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978606,0.0009600976,0.000109513705,0.00032286986,0.0005361471,0.00021071607],"domain_scores_gemma":[0.9967229,0.0017316596,0.00041069023,0.0004038629,0.0004207644,0.0003102945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028521437,0.0017392401,0.0014271119,0.0011153856,0.0010022284,0.0026803317,0.0016935597,0.0015273053,0.009009792],"category_scores_gemma":[0.010640637,0.0012263563,0.0017231044,0.0010138386,0.002656898,0.005834335,0.0038844196,0.0035530492,0.0016840743],"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.00004739452,0.000026524553,0.00017393676,0.000046777754,0.000029590812,0.000073299525,0.00008200276,0.023897463,0.00058735046,0.9649848,0.0015421571,0.008508719],"study_design_scores_gemma":[0.000009283983,0.000021932863,0.00006645986,0.000012370779,0.000010332033,0.000050741422,0.000027819393,0.11795283,0.00034782747,0.879554,0.0019365242,0.000009917436],"about_ca_topic_score_codex":0.0013581637,"about_ca_topic_score_gemma":0.001426203,"teacher_disagreement_score":0.009009792,"about_ca_system_score_codex":0.0014480547,"about_ca_system_score_gemma":0.0011721094,"threshold_uncertainty_score":0.030140698},"labels":[],"label_agreement":null},{"id":"W2599445248","doi":"10.1007/s11590-017-1135-8","title":"A 5-approximation algorithm for the k-prize-collecting Steiner tree problem","year":2017,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Steiner tree problem; Combinatorics; k-minimum spanning tree; Vertex (graph theory); Mathematics; Spanning tree; Gomory–Hu tree; Tree (set theory); Minimum spanning tree; Graph; Minimum degree spanning tree; Integer (computer science); Discrete mathematics; K-ary tree; Computer science; Tree structure; Binary tree","score_opus":0.02933868493811216,"score_gpt":0.26105253950293705,"score_spread":0.2317138545648249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599445248","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.14965624,0.0019206662,0.7920925,0.005147332,0.0007411355,0.0008541351,0.0028746582,0.0046284585,0.042084925],"genre_scores_gemma":[0.27962592,0.00053544017,0.704816,0.00059831917,0.00019823758,0.00054526574,0.0031459376,0.00046521352,0.010069746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792886,0.0005233692,0.00014888235,0.0003729787,0.00046902202,0.00055677246],"domain_scores_gemma":[0.99720424,0.0012212944,0.00023156474,0.00061302027,0.00033899117,0.00039076162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001994019,0.0015352241,0.0022439214,0.0014548635,0.0016495389,0.0030353174,0.005070372,0.0027604392,0.017451353],"category_scores_gemma":[0.0063162316,0.00076502725,0.0020419066,0.0033626405,0.00089034846,0.004544004,0.003120228,0.003086336,0.003196048],"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.0029846611,0.0016123935,0.0029104797,0.001045969,0.00028037577,0.00030713363,0.000520489,0.33392864,0.0067754174,0.08716663,0.06531628,0.4971515],"study_design_scores_gemma":[0.0004842681,0.0003134187,0.0011037253,0.000080448226,0.00012709635,0.00037625313,0.00026810323,0.8841546,0.0025696033,0.09960035,0.010870486,0.000051641073],"about_ca_topic_score_codex":0.0044736946,"about_ca_topic_score_gemma":0.008048987,"teacher_disagreement_score":0.017451353,"about_ca_system_score_codex":0.0034793182,"about_ca_system_score_gemma":0.0054968363,"threshold_uncertainty_score":0.058380544},"labels":[],"label_agreement":null},{"id":"W2753323787","doi":"10.1007/s11590-017-1185-y","title":"Error bounds for strongly monotone and Lipschitz continuous variational inequalities","year":2017,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Lipschitz continuity; Variational inequality; Monotone polygon; Computational intelligence; Mathematics; Applied mathematics; Strongly monotone; Inequality; Pure mathematics; Mathematical optimization; Mathematical analysis; Computer science; Geometry; Artificial intelligence","score_opus":0.02108588286250277,"score_gpt":0.26382439312384726,"score_spread":0.2427385102613445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753323787","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.023603546,0.005545159,0.9481743,0.0027704106,0.0008365361,0.00011646691,0.00021594744,0.00027491432,0.018462727],"genre_scores_gemma":[0.6767276,0.00824735,0.26350096,0.002107661,0.002381102,0.00090764294,0.0012085816,0.0013914253,0.043527696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937231,0.0025229545,0.00033551586,0.00081073283,0.0019338785,0.00067386596],"domain_scores_gemma":[0.9340242,0.052776463,0.0020656849,0.0022463133,0.00674092,0.0021464233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015140345,0.0054954137,0.003015834,0.004016856,0.0014505569,0.005108344,0.00477062,0.0051944735,0.008076945],"category_scores_gemma":[0.06723038,0.0017295536,0.0022795799,0.0021560623,0.00687944,0.009018012,0.010638389,0.011387361,0.0011436635],"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.00076146406,0.00021401749,0.0013886658,0.0009841998,0.0002470283,0.0002711055,0.00066112925,0.19376886,0.0068378053,0.7464794,0.005466385,0.042919815],"study_design_scores_gemma":[0.00003825442,0.00013483393,0.00040327688,0.0001661812,0.000059108457,0.000090338224,0.0001035084,0.75498784,0.0016591332,0.23996687,0.0023427864,0.000047809222],"about_ca_topic_score_codex":0.0038519183,"about_ca_topic_score_gemma":0.0026310107,"teacher_disagreement_score":0.015140345,"about_ca_system_score_codex":0.0043766936,"about_ca_system_score_gemma":0.0027684858,"threshold_uncertainty_score":0.080070734},"labels":[],"label_agreement":null},{"id":"W2774777068","doi":"10.1007/s11590-018-1325-z","title":"“Active-set complexity” of proximal gradient: How long does it take to find the sparsity pattern?","year":2018,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Separable space; Proximal Gradient Methods; Minification; Convex function; Computational intelligence; Regular polygon; Function (biology); Convex optimization","score_opus":0.0346326266348508,"score_gpt":0.25041753848601944,"score_spread":0.21578491185116866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774777068","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.01321941,0.0027275032,0.9640458,0.012368031,0.00071927166,0.00007041004,0.00020407717,0.0005038152,0.006141669],"genre_scores_gemma":[0.49123102,0.0045402306,0.47741452,0.004850826,0.003506433,0.0006585491,0.0008368465,0.0019195608,0.015042092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99592483,0.0020540634,0.0002113502,0.0006854078,0.0009101357,0.00021426346],"domain_scores_gemma":[0.9211064,0.06655272,0.0018794051,0.004776336,0.0041350285,0.00155015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010158255,0.0014270894,0.0021363003,0.0010918832,0.0013118976,0.00353265,0.0036803198,0.0051226914,0.0081795],"category_scores_gemma":[0.111723214,0.0011819893,0.0012264088,0.001028963,0.005151281,0.020750307,0.0038817043,0.010511108,0.0017034846],"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.0005050176,0.0001902679,0.0025337986,0.0009109496,0.0002109312,0.00023445496,0.00047293596,0.1713699,0.0026538132,0.65220684,0.026017694,0.14269345],"study_design_scores_gemma":[0.000035681885,0.000060756814,0.0003633334,0.00011893973,0.000028191804,0.00007715318,0.00006298465,0.6321417,0.0012464796,0.36318207,0.0026396792,0.00004300914],"about_ca_topic_score_codex":0.0020441904,"about_ca_topic_score_gemma":0.0021281596,"teacher_disagreement_score":0.010158255,"about_ca_system_score_codex":0.0017242578,"about_ca_system_score_gemma":0.0019827867,"threshold_uncertainty_score":0.05372262},"labels":[],"label_agreement":null},{"id":"W2790705522","doi":"10.1007/s11590-018-1234-1","title":"Complementarity problems over a hypermatrix (tensor) set","year":2018,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Uniqueness; Complementarity (molecular biology); Complementarity theory; Tensor (intrinsic definition); Combinatorics; Mathematics; Computational intelligence; Order (exchange); Mathematical physics; Physics; Pure mathematics; Mathematical analysis; Computer science; Quantum mechanics; Artificial intelligence","score_opus":0.05394148092549266,"score_gpt":0.32752160638490413,"score_spread":0.27358012545941146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790705522","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.026457163,0.00057914434,0.9480051,0.001593292,0.00024873935,0.000059822203,0.00038333135,0.00012534183,0.022548009],"genre_scores_gemma":[0.57090366,0.0029782823,0.3651173,0.00097575405,0.0012014916,0.00058696547,0.0007943536,0.00044018024,0.057002075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872535,0.0005156117,0.00006627234,0.00020905858,0.00037722386,0.000106434156],"domain_scores_gemma":[0.99669385,0.0019214704,0.00036351962,0.00027463332,0.00044108744,0.0003053887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020131576,0.0013146289,0.0010361766,0.0016119527,0.0008104174,0.0034398427,0.001203008,0.0016506983,0.0063650208],"category_scores_gemma":[0.0047988114,0.0005019177,0.00079119107,0.0021515817,0.0023302042,0.004168247,0.0026454397,0.0028827295,0.00084816123],"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.000028696131,0.00005117234,0.00018033531,0.0001309586,0.000036511356,0.00011833493,0.00008900942,0.04226353,0.0020438947,0.93740904,0.0033017287,0.01434683],"study_design_scores_gemma":[0.000009749054,0.00003674661,0.000162345,0.000027107242,0.000017473982,0.00011262588,0.00007656255,0.22914584,0.0009371189,0.76517606,0.0042744335,0.000023929655],"about_ca_topic_score_codex":0.0015045597,"about_ca_topic_score_gemma":0.0018006671,"teacher_disagreement_score":0.0063650208,"about_ca_system_score_codex":0.0010446317,"about_ca_system_score_gemma":0.0012046621,"threshold_uncertainty_score":0.021293163},"labels":[],"label_agreement":null},{"id":"W2795727769","doi":"10.1007/s11590-018-1254-x","title":"Experiments on virtual private network design with concave capacity costs","year":2018,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computational intelligence; Upper and lower bounds; Mathematical optimization; Regular polygon; Computer science; Network planning and design; Mathematics; Artificial intelligence; Computer network; Geometry","score_opus":0.03205164889556149,"score_gpt":0.2358185531798449,"score_spread":0.2037669042842834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795727769","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85900104,0.0006656028,0.11630578,0.0018328025,0.00027013107,0.0005254549,0.0008214627,0.000711328,0.01986634],"genre_scores_gemma":[0.9752501,0.00009667334,0.022084014,0.00011709753,0.00003474947,0.0001230737,0.00019626105,0.00007400937,0.0020239218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99351305,0.0043033985,0.00017482734,0.0004694551,0.00066534715,0.0008738916],"domain_scores_gemma":[0.90861195,0.07976057,0.0024480904,0.004810732,0.0028309382,0.0015376924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008422566,0.0014234498,0.0014788643,0.0009658654,0.0009357071,0.001701878,0.002311479,0.0023997037,0.0076488047],"category_scores_gemma":[0.041560218,0.00070913264,0.00068789505,0.0010421193,0.002031598,0.004080856,0.001612715,0.0021715807,0.00042639705],"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.0026134134,0.0010175884,0.0009560393,0.0003039491,0.00007964643,0.000086461325,0.00007587171,0.95889074,0.0022859448,0.016360374,0.0031822152,0.014147724],"study_design_scores_gemma":[0.0006664053,0.00069535227,0.00033904958,0.00002128553,0.000045478908,0.000050473816,0.00007474302,0.9808421,0.0031839055,0.013484971,0.000575334,0.000020900065],"about_ca_topic_score_codex":0.0034602932,"about_ca_topic_score_gemma":0.002158618,"teacher_disagreement_score":0.008422566,"about_ca_system_score_codex":0.0031238876,"about_ca_system_score_gemma":0.0021716014,"threshold_uncertainty_score":0.044543326},"labels":[],"label_agreement":null},{"id":"W2808095563","doi":"10.1007/s11590-018-1285-3","title":"Improved price of anarchy for machine scheduling games with coordination mechanisms","year":2018,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Price of anarchy; Upper and lower bounds; Computational intelligence; Computer science; Scheduling (production processes); Nash equilibrium; Mathematical optimization; Job shop scheduling; Game theory; Mathematical economics; Operations research; Mathematics; Artificial intelligence; Price of stability; Economics; Computer network","score_opus":0.030898114886665475,"score_gpt":0.31826128258026365,"score_spread":0.28736316769359815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808095563","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.105614014,0.0012716732,0.82859576,0.0028749658,0.00086516375,0.00036985893,0.00036797088,0.00063634495,0.05940433],"genre_scores_gemma":[0.88402075,0.0006903204,0.09517037,0.00055356877,0.0005835167,0.0004234171,0.00015684971,0.00032992428,0.018071298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641293,0.0018277152,0.00014365483,0.00042521048,0.0007005076,0.0004901413],"domain_scores_gemma":[0.9814477,0.014178135,0.0008364793,0.0015818565,0.00083174463,0.0011240054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051184837,0.0018545116,0.0037266146,0.0015940032,0.001177883,0.0037407866,0.0052817324,0.004030812,0.0176603],"category_scores_gemma":[0.02343596,0.0011413351,0.0016764004,0.001521,0.0027813995,0.007192773,0.0029754925,0.005614161,0.0010401397],"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.0005847801,0.00034249533,0.00037924334,0.00039486252,0.00012805636,0.0002147975,0.00017141753,0.26434186,0.002624134,0.6971195,0.008892019,0.024806838],"study_design_scores_gemma":[0.00016732259,0.00017941528,0.0001951731,0.000034980294,0.000047124126,0.000085950844,0.000037894562,0.6353971,0.0003529993,0.36180985,0.0016524687,0.000039722097],"about_ca_topic_score_codex":0.0013143058,"about_ca_topic_score_gemma":0.0014217272,"teacher_disagreement_score":0.0176603,"about_ca_system_score_codex":0.0035608353,"about_ca_system_score_gemma":0.0030577616,"threshold_uncertainty_score":0.059079528},"labels":[],"label_agreement":null},{"id":"W2896532202","doi":"10.1007/s11590-018-1338-7","title":"Distance between vertices of lattice polytopes","year":2018,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Combinatorics; Polytope; Mathematics; Convex hull; Convex polytope; Minkowski addition; Conjecture; Lattice (music); Uniform k 21 polytope; Hexagonal lattice; Birkhoff polytope; Regular polygon; Discrete mathematics; Convex set; Geometry; Physics; Condensed matter physics","score_opus":0.033182277450117245,"score_gpt":0.3105982867352557,"score_spread":0.27741600928513843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896532202","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68779564,0.0007489136,0.2598167,0.0010457751,0.0002590741,0.0001477876,0.0017384259,0.0003778163,0.04806992],"genre_scores_gemma":[0.89573675,0.00049464393,0.08719918,0.00018687635,0.00012953488,0.00024134017,0.0021691283,0.000244752,0.013597768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842715,0.0003539947,0.00006700219,0.00027898338,0.00066288543,0.00020999409],"domain_scores_gemma":[0.9954816,0.0024460293,0.0005254323,0.00022081508,0.0004432396,0.00088289106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070480956,0.00079475046,0.0013622061,0.0028010283,0.0013963631,0.004937001,0.0023969156,0.001576149,0.010681511],"category_scores_gemma":[0.008460014,0.00083910965,0.00059233437,0.0016966882,0.0023039882,0.0028857973,0.003258278,0.0028133672,0.0016047995],"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.00087494834,0.00026284007,0.004675398,0.0004588738,0.000096625794,0.00039743606,0.0006800604,0.08628063,0.0071553686,0.8453911,0.0060071414,0.047719598],"study_design_scores_gemma":[0.00011837065,0.00013425168,0.0022060245,0.00009417983,0.000026947817,0.0002660943,0.0006733714,0.17189395,0.0028691592,0.8134745,0.0081828525,0.000060421324],"about_ca_topic_score_codex":0.0016833664,"about_ca_topic_score_gemma":0.0016498717,"teacher_disagreement_score":0.010681511,"about_ca_system_score_codex":0.001399677,"about_ca_system_score_gemma":0.00060936564,"threshold_uncertainty_score":0.035733223},"labels":[],"label_agreement":null},{"id":"W2899401464","doi":"10.1007/s11590-018-1349-4","title":"Oil sands extraction plant debottlenecking: an optimization approach","year":2018,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Reservoir Engineering and Simulation Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; Alberta Innovates - Technology Futures","keywords":"Bottleneck; Mathematical optimization; Computer science; Process (computing); Optimization problem; Nonlinear programming; Process optimization; Parametric programming; Computational intelligence; Identification (biology); Nonlinear system; Parametric statistics; Engineering; Mathematics; Artificial intelligence","score_opus":0.0182091652072934,"score_gpt":0.2529004218391634,"score_spread":0.23469125663187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899401464","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.046995383,0.00039372782,0.9288501,0.0006060479,0.00007691086,0.00016309941,0.00017390444,0.00042371996,0.02231704],"genre_scores_gemma":[0.82664907,0.00042944384,0.1483614,0.00019495375,0.000065324246,0.0003034922,0.00022833826,0.00028597322,0.023482017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999736,0.0000743775,0.000011502383,0.00005616209,0.000067382294,0.00005460304],"domain_scores_gemma":[0.9995555,0.0002557293,0.000046822173,0.000027683025,0.000084178944,0.000030146372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006543576,0.0008943369,0.0018669998,0.0009766025,0.00081726984,0.0016771029,0.0011834917,0.0018967511,0.0065124556],"category_scores_gemma":[0.0013724575,0.001070022,0.0011992634,0.0009219442,0.0006917554,0.0011731538,0.0010459536,0.0010868656,0.000493426],"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.000028592041,0.000020885136,0.00009479166,0.000022433505,0.000010409919,0.000017379465,0.000007186163,0.9919031,0.00052362436,0.0014479388,0.00020001842,0.0057236515],"study_design_scores_gemma":[0.000004021426,0.0000074613736,0.000038675425,0.0000020121986,0.0000046009814,0.00000231859,0.000004136054,0.99912196,0.0002233003,0.0004153209,0.00017344565,0.0000028021782],"about_ca_topic_score_codex":0.015161612,"about_ca_topic_score_gemma":0.012067232,"teacher_disagreement_score":0.015161612,"about_ca_system_score_codex":0.0014679318,"about_ca_system_score_gemma":0.0021771258,"threshold_uncertainty_score":0.030146718},"labels":[],"label_agreement":null},{"id":"W2913674600","doi":"10.1007/s11590-019-01401-4","title":"Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem","year":2019,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lagrangian relaxation; Facility location problem; Mathematical optimization; Flow network; Relaxation (psychology); Convergence (economics); Computer science; Network planning and design; Stochastic programming; Duality (order theory); Stage (stratigraphy); Lagrangian; Subgradient method; Mathematics; Applied mathematics; Economics","score_opus":0.00939775936357898,"score_gpt":0.21357913548204505,"score_spread":0.20418137611846607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913674600","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66562223,0.0013740861,0.27395484,0.003826727,0.00061091606,0.00037879284,0.0010871985,0.0005971713,0.052548084],"genre_scores_gemma":[0.95007056,0.00032779883,0.044577993,0.00032244265,0.00007240745,0.00013393488,0.00038660548,0.00017496146,0.0039333473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967961,0.002006299,0.00006487858,0.000175089,0.00032771102,0.0006299884],"domain_scores_gemma":[0.9534491,0.041334875,0.001980896,0.00059498195,0.0015871065,0.0010530367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066609257,0.0013052629,0.001655412,0.0009932223,0.0010564206,0.0028147697,0.0016545013,0.0022942787,0.010007673],"category_scores_gemma":[0.028578013,0.0012407469,0.0010785157,0.0011930787,0.00171639,0.002017988,0.0011878806,0.0034248126,0.0003043404],"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.001033555,0.00027692268,0.00051095686,0.00010118688,0.000036164587,0.00012554061,0.000048326554,0.97833073,0.00073071825,0.010822597,0.0018596187,0.006123746],"study_design_scores_gemma":[0.00010351107,0.00016168163,0.0005464254,0.00002087316,0.000032785832,0.00001745775,0.000069330075,0.9939207,0.00039825542,0.0044536865,0.00026070946,0.0000144982505],"about_ca_topic_score_codex":0.019893847,"about_ca_topic_score_gemma":0.015119669,"teacher_disagreement_score":0.019893847,"about_ca_system_score_codex":0.0025260143,"about_ca_system_score_gemma":0.0027262191,"threshold_uncertainty_score":0.039556146},"labels":[],"label_agreement":null},{"id":"W2916344177","doi":"10.1007/s11590-019-01412-1","title":"The multi-stage dynamic stochastic decision process with unknown distribution of the random utilities","year":2019,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Transport Canada","funders":"","keywords":"Optimal decision; Mathematical optimization; Multinomial logistic regression; Expected utility hypothesis; Decision rule; Expected value; Probability distribution; Mathematics; Stochastic process; Multinomial distribution; Decision theory; Computer science; Econometrics; Statistics; Decision tree; Artificial intelligence","score_opus":0.04098725591223491,"score_gpt":0.35209518520689387,"score_spread":0.31110792929465897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916344177","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.07779295,0.0006272352,0.9149951,0.0009781629,0.00005794293,0.0001336161,0.0002016552,0.00007034173,0.0051430073],"genre_scores_gemma":[0.9079719,0.00091380376,0.079848446,0.00015027968,0.00008679292,0.00039146497,0.00020539819,0.000032021544,0.010399851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943604,0.0026875315,0.00018027324,0.0012646827,0.0008095332,0.00069763104],"domain_scores_gemma":[0.99499303,0.0035401315,0.00057263725,0.00017546669,0.00038133244,0.00033734392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005311293,0.0013706674,0.0023619528,0.0010586451,0.00094016554,0.0030995172,0.0027072679,0.0024453995,0.003914156],"category_scores_gemma":[0.007936713,0.0010756714,0.001991918,0.0016574061,0.0028268585,0.0032529968,0.002045464,0.002499576,0.00041966047],"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.0001718956,0.00009391458,0.0015427907,0.00020537923,0.00012318848,0.00074551994,0.00022242568,0.7822441,0.0015651876,0.20407806,0.00047004918,0.008537413],"study_design_scores_gemma":[0.00003422219,0.00008125929,0.0003918904,0.000018381306,0.000035279736,0.00008952897,0.00003532748,0.94136584,0.0003539201,0.0570844,0.00047649824,0.000033516168],"about_ca_topic_score_codex":0.00529689,"about_ca_topic_score_gemma":0.0029783568,"teacher_disagreement_score":0.005311293,"about_ca_system_score_codex":0.0027078718,"about_ca_system_score_gemma":0.0017874679,"threshold_uncertainty_score":0.028089166},"labels":[],"label_agreement":null},{"id":"W2928383288","doi":"10.1007/s11590-019-01452-7","title":"Dynamic improvements of static surrogates in direct search optimization","year":2019,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"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":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Multiplicative function; Mathematical optimization; Context (archaeology); Computer science; Variable (mathematics); Quadratic equation; Surrogate model; Algorithm; Mathematics","score_opus":0.008472196214212488,"score_gpt":0.25822590222485003,"score_spread":0.24975370601063754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2928383288","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.07237657,0.0022871515,0.87926614,0.00059493346,0.00070555764,0.000092784896,0.00011007796,0.0006109698,0.043955725],"genre_scores_gemma":[0.8234527,0.0008335768,0.16373351,0.00018353229,0.00016363976,0.00013187906,0.00015139343,0.00026827745,0.011081564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994337,0.00024348397,0.000019777113,0.00004647181,0.00021314112,0.000043414344],"domain_scores_gemma":[0.9989636,0.000519681,0.000070095346,0.00015555929,0.00024396877,0.00004702327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013954266,0.00075299543,0.0009236566,0.0006548461,0.0003765334,0.0010474854,0.0007871268,0.0010220561,0.004513708],"category_scores_gemma":[0.0052173976,0.0004435606,0.0004140346,0.000790558,0.00062082894,0.0011176389,0.0011323134,0.0010904757,0.00077166373],"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.00015982211,0.00008022691,0.00024897442,0.00007848043,0.000026637703,0.000049880673,0.000033444958,0.9074272,0.0022994915,0.023354826,0.0017002497,0.06454073],"study_design_scores_gemma":[0.0000094089855,0.000049330694,0.000048377802,0.00000872534,0.0000051149523,0.000013825737,0.0000040312775,0.9953413,0.0004610351,0.0031916853,0.00086372846,0.0000034661555],"about_ca_topic_score_codex":0.001044173,"about_ca_topic_score_gemma":0.001147536,"teacher_disagreement_score":0.004513708,"about_ca_system_score_codex":0.0005040351,"about_ca_system_score_gemma":0.000586473,"threshold_uncertainty_score":0.015099883},"labels":[],"label_agreement":null},{"id":"W2954701560","doi":"10.1007/s11590-019-01448-3","title":"Uniform simplex of an arbitrary orientation","year":2019,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Mitacs; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Simplex; Simplex algorithm; Convex hull; Combinatorics; Series (stratigraphy); Mathematics; Set (abstract data type); Derivative (finance); Linear programming; Mathematical optimization; Computational intelligence; Regular polygon; Computer science; Discrete mathematics; Geometry; Artificial intelligence","score_opus":0.02430181695925274,"score_gpt":0.33051475612565046,"score_spread":0.3062129391663977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954701560","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.040337335,0.00059139385,0.83781534,0.0006181041,0.0007078933,0.00012456438,0.00083175243,0.000433639,0.11853996],"genre_scores_gemma":[0.55470365,0.0011672209,0.36743987,0.0005470962,0.0003424532,0.00046941263,0.0011549768,0.0011549602,0.07302029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949026,0.00013537086,0.000023911565,0.00012467417,0.0001579359,0.000067778215],"domain_scores_gemma":[0.9994783,0.00012237478,0.000044569297,0.00011371719,0.00017387922,0.000067202585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004453141,0.0009651732,0.0010317267,0.0010082417,0.0007787799,0.0017626935,0.0010081553,0.00082817586,0.012961257],"category_scores_gemma":[0.002194384,0.0004886441,0.0006007915,0.0009430903,0.0011778398,0.0012759779,0.0020852657,0.0014660389,0.0032210695],"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.00023300404,0.00004603782,0.00037854136,0.00016586558,0.000037748887,0.00012765925,0.00008929236,0.039866343,0.008817251,0.8849128,0.011175175,0.05415035],"study_design_scores_gemma":[0.000116209514,0.00016536213,0.0009233385,0.00007699446,0.00003831477,0.00053808396,0.00017958468,0.29426682,0.011794182,0.6212494,0.070558466,0.000093164206],"about_ca_topic_score_codex":0.0011598145,"about_ca_topic_score_gemma":0.0009424588,"teacher_disagreement_score":0.012961257,"about_ca_system_score_codex":0.00063101307,"about_ca_system_score_gemma":0.0005458559,"threshold_uncertainty_score":0.043359756},"labels":[],"label_agreement":null},{"id":"W2987410708","doi":"10.1007/s11590-019-01497-8","title":"Monotonic grey box direct search optimization","year":2019,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Rio Tinto (Canada); Giro (Canada); Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Monotonic function; Mathematical optimization; Computer science; Optimization problem; Computational intelligence; Function (biology); Algorithm; Mathematics; Artificial intelligence","score_opus":0.012358154721532576,"score_gpt":0.24862522730838083,"score_spread":0.23626707258684826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2987410708","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.012248617,0.0013974338,0.90778667,0.0005912645,0.0003134354,0.00011180637,0.0001305746,0.00031927795,0.07710084],"genre_scores_gemma":[0.44923148,0.0013525106,0.465322,0.0006176044,0.00022425414,0.0006017605,0.000260973,0.0004771733,0.08191229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971265,0.00013358584,0.0000095658925,0.000037010428,0.00008969008,0.000017500037],"domain_scores_gemma":[0.99939656,0.000383964,0.000040396746,0.00006451431,0.00008925154,0.00002534448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009811695,0.0006818846,0.0010884637,0.00044547484,0.0003250532,0.0013853565,0.0010199148,0.0015656002,0.014094776],"category_scores_gemma":[0.0031559784,0.00046348458,0.0003902492,0.00065619237,0.0009778892,0.0010184234,0.0013396536,0.00110882,0.0023597325],"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.00016120436,0.00006704819,0.00020949416,0.00041428805,0.0000685595,0.00012230493,0.000060327406,0.6741316,0.0032802525,0.23432589,0.0076405313,0.0795186],"study_design_scores_gemma":[0.000026450347,0.000030753068,0.000048510876,0.000022959077,0.000008451798,0.000022970773,0.0000054870216,0.9761478,0.0005606546,0.020368887,0.0027513823,0.000005757675],"about_ca_topic_score_codex":0.0006869478,"about_ca_topic_score_gemma":0.0007340508,"teacher_disagreement_score":0.014094776,"about_ca_system_score_codex":0.0004741304,"about_ca_system_score_gemma":0.0006942356,"threshold_uncertainty_score":0.047151685},"labels":[],"label_agreement":null},{"id":"W3002304143","doi":"10.1007/s11590-020-01609-9","title":"A perturbation view of level-set methods for convex optimization","year":2020,"lang":"en","type":"preprint","venue":"Optimization Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"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 British Columbia","funders":"Seikei University","keywords":"Parameterized complexity; Duality (order theory); Mathematics; Mathematical optimization; Set (abstract data type); Regular polygon; Convex set; Convex optimization; Constraint (computer-aided design); Limiting; Perturbation (astronomy); Feasible region; Computer science; Combinatorics; Physics; Engineering; Geometry","score_opus":0.07606464728142957,"score_gpt":0.32535259871411815,"score_spread":0.24928795143268856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002304143","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.0013635001,0.00024143046,0.99384016,0.0004537982,0.000056808713,0.000017052173,0.000028941042,0.000063244705,0.003935151],"genre_scores_gemma":[0.33609277,0.0020117941,0.6451648,0.0010441103,0.00055271684,0.00043066472,0.00024233195,0.0005567316,0.013904133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976745,0.0011406362,0.00008419371,0.0001967178,0.0008064729,0.000097475095],"domain_scores_gemma":[0.9951834,0.0033874377,0.0002634496,0.0004498054,0.00050174876,0.00021413194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045860577,0.00090621813,0.0010781119,0.0014978545,0.00058383856,0.0025646202,0.001731036,0.0014185329,0.0059166863],"category_scores_gemma":[0.008746542,0.00077197485,0.0014880167,0.0011193921,0.0034321002,0.0029984785,0.0033359288,0.005616512,0.001338414],"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.00003427015,0.00002728143,0.00014075103,0.00009166655,0.00004255766,0.00005146963,0.00007195703,0.18263848,0.0019033164,0.8017306,0.0017484253,0.011519266],"study_design_scores_gemma":[0.0000075565117,0.000025870211,0.000038465416,0.000027119428,0.0000064561455,0.000021022744,0.0000116064975,0.75802493,0.00082840666,0.23754801,0.0034506856,0.000009905812],"about_ca_topic_score_codex":0.0011451767,"about_ca_topic_score_gemma":0.00071427034,"teacher_disagreement_score":0.0059166863,"about_ca_system_score_codex":0.0017290573,"about_ca_system_score_gemma":0.0010813139,"threshold_uncertainty_score":0.024253666},"labels":[],"label_agreement":null},{"id":"W3007930322","doi":"10.1007/s11590-020-01551-w","title":"Variable neighborhood search based algorithms to solve a rich k-travelling repairmen problem","year":2020,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Variable neighborhood search; Benchmark (surveying); Computational intelligence; Variable (mathematics); Algorithm; Set (abstract data type); Computer science; Mathematical optimization; Database transaction; Local search (optimization); Mathematics; Metaheuristic; Artificial intelligence; Database","score_opus":0.01777942290356581,"score_gpt":0.2336952618307448,"score_spread":0.21591583892717897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007930322","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.023217965,0.0004680719,0.97035855,0.000184822,0.00008466748,0.000051655894,0.00004704902,0.00011562634,0.0054715923],"genre_scores_gemma":[0.4656701,0.00052391767,0.5194028,0.00015576546,0.000087864,0.00034552757,0.00021956179,0.00017972919,0.013414732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996891,0.00015345025,0.000013784205,0.000048465878,0.00006267526,0.000032464373],"domain_scores_gemma":[0.9988753,0.000852941,0.00008048132,0.000045845194,0.00010888384,0.000036496847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012124989,0.0006711668,0.0010264843,0.0007448796,0.0005295534,0.00066074776,0.0015334162,0.0013668344,0.0028995685],"category_scores_gemma":[0.003309021,0.0005221616,0.0007565067,0.00088789203,0.00074443006,0.0010221618,0.0010210936,0.0011323381,0.00034270436],"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.00004023739,0.00003462569,0.00018467395,0.000050897146,0.00003049418,0.000024166147,0.00003343661,0.96266824,0.00031998847,0.017646682,0.0010744752,0.017892186],"study_design_scores_gemma":[0.0000058978794,0.000011426916,0.000027512158,0.0000031457002,0.00000334625,0.0000045092834,0.0000050478607,0.99691075,0.00005096501,0.0027122379,0.0002629951,0.0000020267676],"about_ca_topic_score_codex":0.0057219015,"about_ca_topic_score_gemma":0.006142343,"teacher_disagreement_score":0.0057219015,"about_ca_system_score_codex":0.00068851945,"about_ca_system_score_gemma":0.0007973915,"threshold_uncertainty_score":0.011377156},"labels":[],"label_agreement":null},{"id":"W3044916287","doi":"10.1007/s11590-020-01621-z","title":"Mathematical optimization approach for facility layout on several rows","year":2020,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis","funders":"Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada","keywords":"Row; Integer programming; Integer (computer science); Computer science; Mathematical optimization; Facility location problem; Position (finance); Linear programming; Focus (optics); Row and column spaces; Computational intelligence; Optimization problem; Algorithm; Mathematics; Artificial intelligence; Programming language","score_opus":0.020777797436485286,"score_gpt":0.2077353779526046,"score_spread":0.18695758051611933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044916287","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.009286528,0.000495589,0.980053,0.00047639702,0.000060677503,0.000086579974,0.0002631509,0.0001363187,0.009141786],"genre_scores_gemma":[0.31658348,0.0013190882,0.666359,0.00036486564,0.00022301472,0.0005837346,0.00050450815,0.00018005524,0.013882223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999127,0.0003276054,0.000035459212,0.00020192156,0.00019673607,0.00011128921],"domain_scores_gemma":[0.9986933,0.0008915302,0.00016228516,0.00006166962,0.0001440553,0.000047173933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015472951,0.0012401869,0.0012034504,0.001281474,0.00057444826,0.0020481562,0.0017348891,0.0013203248,0.0066253585],"category_scores_gemma":[0.0027335421,0.0010587889,0.0018369396,0.0018443579,0.0010374652,0.0015311599,0.001157068,0.002135461,0.0009537057],"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.000023332112,0.00004110341,0.00019716544,0.00011088642,0.000034917193,0.00008758413,0.000025513971,0.9473989,0.0006500428,0.043546326,0.0011039277,0.006780304],"study_design_scores_gemma":[0.000007880785,0.000017115493,0.000055618075,0.000009950652,0.000007918454,0.000013047245,0.0000075269727,0.9893951,0.00018054625,0.009246287,0.0010542928,0.000004696471],"about_ca_topic_score_codex":0.005143377,"about_ca_topic_score_gemma":0.004246254,"teacher_disagreement_score":0.0066253585,"about_ca_system_score_codex":0.0021932067,"about_ca_system_score_gemma":0.0017829593,"threshold_uncertainty_score":0.022164047},"labels":[],"label_agreement":null},{"id":"W3096847493","doi":"10.1007/s11590-021-01754-9","title":"Complexity of near-optimal robust versions of multilevel optimization problems","year":2021,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Région Hauts-de-France","keywords":"Robustness (evolution); Computational intelligence; Robust optimization; Computational complexity theory; Optimization problem; Adversarial system","score_opus":0.13047109769552634,"score_gpt":0.3247271779096579,"score_spread":0.19425608021413154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096847493","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.21017335,0.00054473977,0.7763365,0.0016677505,0.000055414992,0.00011279921,0.00036299002,0.00015998352,0.01058646],"genre_scores_gemma":[0.94820315,0.00029692063,0.04699524,0.0001766402,0.00010688093,0.0001678413,0.00037338032,0.00009644622,0.003583453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772245,0.00094325567,0.000112017966,0.00035838535,0.00058988546,0.00027391547],"domain_scores_gemma":[0.9883974,0.008680068,0.0013510685,0.0005926177,0.0005892679,0.00038951793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035254764,0.00083430926,0.0015319386,0.0008358243,0.00046720108,0.0024872725,0.001300325,0.0014825714,0.004825639],"category_scores_gemma":[0.014780394,0.0005534769,0.0013227446,0.00053942023,0.0017807124,0.002888644,0.002767797,0.0025998966,0.0002701748],"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.00013687577,0.000070373,0.0009195805,0.00013181279,0.00007695467,0.00019756613,0.00008365325,0.74924827,0.0013944934,0.2379477,0.001186263,0.008606453],"study_design_scores_gemma":[0.000012070173,0.000030299649,0.00021607139,0.000008733476,0.0000060707175,0.000020345346,0.000016105625,0.8959658,0.00021676901,0.10331545,0.00018354993,0.0000087025965],"about_ca_topic_score_codex":0.0012625855,"about_ca_topic_score_gemma":0.0007517393,"teacher_disagreement_score":0.004825639,"about_ca_system_score_codex":0.0016354681,"about_ca_system_score_gemma":0.00088827114,"threshold_uncertainty_score":0.01864475},"labels":[],"label_agreement":null},{"id":"W3107516874","doi":"10.1007/s11590-020-01675-z","title":"An efficient heuristic for a hub location routing problem","year":2020,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Travelling salesman problem; Mathematical optimization; Heuristic; Variable neighborhood search; Computer science; Computational intelligence; Selection (genetic algorithm); Local search (optimization); Fraction (chemistry); Steiner tree problem; Mathematics; Metaheuristic; Artificial intelligence","score_opus":0.01530435585602781,"score_gpt":0.24606985011928661,"score_spread":0.23076549426325882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107516874","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.023942064,0.00048588397,0.9588479,0.00035714332,0.00021268705,0.0002292043,0.00017672004,0.00038447074,0.015364031],"genre_scores_gemma":[0.27337772,0.0004496345,0.7183431,0.00020576561,0.0001002812,0.00045116345,0.00030527145,0.00017849289,0.006588561],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995291,0.00018045511,0.000016826563,0.00006506974,0.00012345324,0.000085162224],"domain_scores_gemma":[0.9992562,0.0004770397,0.000055546152,0.00006174611,0.00010120305,0.00004821687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008821679,0.0010517316,0.0012615595,0.0013228535,0.00073633104,0.001264142,0.001511671,0.0020631175,0.0062535712],"category_scores_gemma":[0.002451234,0.00075170136,0.0009265684,0.0014887863,0.0007357173,0.00106001,0.0010962976,0.001143681,0.0006639504],"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.00009312381,0.00011290204,0.00015483417,0.0001087641,0.000028865912,0.00009035549,0.000042800708,0.92156947,0.0014285507,0.017647298,0.0031742984,0.0555488],"study_design_scores_gemma":[0.000039726183,0.0000312822,0.000055631685,0.0000127592075,0.000012191941,0.00002217443,0.000017249069,0.9924206,0.00024602027,0.0059307683,0.0012051252,0.0000063932985],"about_ca_topic_score_codex":0.005159768,"about_ca_topic_score_gemma":0.00686917,"teacher_disagreement_score":0.0062535712,"about_ca_system_score_codex":0.0012940869,"about_ca_system_score_gemma":0.0018919295,"threshold_uncertainty_score":0.020920277},"labels":[],"label_agreement":null},{"id":"W3119842321","doi":"10.1007/s11590-020-01677-x","title":"On the approximability of the fixed-tree balanced minimum evolution problem","year":2021,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université Catholique de Louvain; University of British Columbia","keywords":"Tree (set theory); Mathematics; Binary number; Combinatorics; Set (abstract data type); Binary tree; Function (biology); Discrete mathematics; Computer science; Arithmetic; Biology","score_opus":0.005297643925768434,"score_gpt":0.18982560180343933,"score_spread":0.1845279578776709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119842321","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.2002312,0.0014749928,0.7712464,0.0028938414,0.00017433523,0.00007126945,0.00028761596,0.0005823019,0.023038052],"genre_scores_gemma":[0.7739822,0.00087424624,0.21666336,0.00051557313,0.00014269758,0.0001641955,0.0006314031,0.00038984328,0.0066364966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992466,0.00033626036,0.0000264343,0.00013328718,0.00013721973,0.000120222394],"domain_scores_gemma":[0.991102,0.007910261,0.000249662,0.00034327313,0.00024610283,0.0001487539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002165117,0.0007802054,0.0012107262,0.0006610076,0.0006590795,0.0016521284,0.0017205259,0.0017167669,0.005752365],"category_scores_gemma":[0.019730058,0.000391075,0.0008466165,0.00088974467,0.001459,0.002952081,0.0016627405,0.002724568,0.0005178778],"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.00050948106,0.0001172315,0.0014745502,0.000233934,0.000057861384,0.000086460874,0.00024495108,0.75053936,0.001650344,0.1911269,0.004528695,0.049430296],"study_design_scores_gemma":[0.000038662023,0.000029283685,0.00016500398,0.000025144953,0.00001278841,0.000027297687,0.000028834138,0.8937876,0.00027399365,0.104935244,0.0006715868,0.0000045157076],"about_ca_topic_score_codex":0.003879679,"about_ca_topic_score_gemma":0.003486657,"teacher_disagreement_score":0.005752365,"about_ca_system_score_codex":0.0014239841,"about_ca_system_score_gemma":0.0012383962,"threshold_uncertainty_score":0.019243538},"labels":[],"label_agreement":null},{"id":"W3170479471","doi":"10.1007/s11590-021-01745-w","title":"Exploring the tradeoffs among forest planning, roads and wildlife corridors: a new approach","year":2021,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Wildlife-Road Interactions and Conservation","field":"Environmental Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ministry of Natural Resources and Forestry; Natural Resources Canada; Canadian Forest Service","funders":"","keywords":"Woodland caribou; Wildlife; Revenue; Geography; Taiga; Forest management; Environmental resource management; Environmental science; Ecology; Habitat; Forestry; Business","score_opus":0.046256577832037356,"score_gpt":0.21858020585040228,"score_spread":0.17232362801836493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170479471","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.049458873,0.002533782,0.9098381,0.0042669503,0.00022988372,0.00008618946,0.0003924632,0.0000974012,0.03309638],"genre_scores_gemma":[0.6401233,0.0039869915,0.31996235,0.001354454,0.0010615726,0.00046650565,0.0004059094,0.000293858,0.032345034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989962,0.00054532586,0.000035216053,0.00016992133,0.00013670357,0.00011663573],"domain_scores_gemma":[0.99481684,0.004467278,0.0002468849,0.00013114634,0.00016699525,0.00017082618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018165939,0.0015181205,0.0021592057,0.0017201991,0.00071067037,0.0043208953,0.0022724527,0.0028439278,0.010796279],"category_scores_gemma":[0.006190842,0.001182232,0.001633502,0.0024795332,0.0018324824,0.0045562866,0.0023139205,0.0023218014,0.00047672237],"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.00008758774,0.00016035633,0.0011685279,0.00016346044,0.00021085257,0.00010513175,0.000088074485,0.8721235,0.0003671969,0.097716734,0.003440136,0.02436836],"study_design_scores_gemma":[0.00003994958,0.000057569378,0.0003919305,0.000028906981,0.0000434165,0.0000296792,0.00008468012,0.8764072,0.000062728555,0.12046197,0.0023738325,0.00001806944],"about_ca_topic_score_codex":0.008102233,"about_ca_topic_score_gemma":0.009737884,"teacher_disagreement_score":0.010796279,"about_ca_system_score_codex":0.0018733792,"about_ca_system_score_gemma":0.001755606,"threshold_uncertainty_score":0.036117136},"labels":[],"label_agreement":null},{"id":"W3175439022","doi":"10.1007/s11590-022-01896-4","title":"Directional asymptotics of Fejér monotone sequences","year":2022,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Monotone polygon; Mathematics; Monotonic function; Convergence (economics); Mathematical proof; Applied mathematics; Computational intelligence; Mathematical analysis; Computer science","score_opus":0.00684713335480327,"score_gpt":0.20037249911562688,"score_spread":0.1935253657608236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175439022","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.29839042,0.0030881222,0.5861007,0.0041076834,0.000540802,0.00007017844,0.00034763102,0.0004917217,0.10686278],"genre_scores_gemma":[0.8850886,0.0024481043,0.05722647,0.00081734714,0.000608523,0.0001807091,0.0005275942,0.0004136291,0.052689075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991007,0.000361154,0.000032184238,0.000114358816,0.00025643822,0.00013519131],"domain_scores_gemma":[0.991028,0.0049764663,0.0007850326,0.00044517388,0.0017320521,0.0010332682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033785577,0.001033273,0.0009355458,0.0029518984,0.0010145719,0.00194058,0.0015359693,0.0017951988,0.008998857],"category_scores_gemma":[0.020491224,0.00067010714,0.0006597611,0.00093857606,0.002693275,0.0037195098,0.0023093817,0.0026154635,0.0010163598],"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.000060684488,0.00003709611,0.0005764367,0.00006640404,0.000012117433,0.000080509286,0.00014172951,0.012188882,0.002144295,0.9761155,0.0015791232,0.0069971103],"study_design_scores_gemma":[0.000025224319,0.00006482013,0.0011161352,0.00006593992,0.000012040685,0.00021793021,0.0001569959,0.23297203,0.0010252558,0.7611154,0.0031949307,0.000033362598],"about_ca_topic_score_codex":0.0021346493,"about_ca_topic_score_gemma":0.0016998621,"teacher_disagreement_score":0.008998857,"about_ca_system_score_codex":0.0018147368,"about_ca_system_score_gemma":0.0009245437,"threshold_uncertainty_score":0.03010422},"labels":[],"label_agreement":null},{"id":"W3180950260","doi":"10.1007/s11590-021-01773-6","title":"An exact penalty function method for optimal control of a dubins airplane in the presence of moving obstacles","year":2021,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Airplane; Computational intelligence; Penalty method; Mathematical optimization; Optimal control; Function (biology); Mathematics; Control (management); Computer science; Variable (mathematics); Control theory (sociology); Engineering; Artificial intelligence; Mathematical analysis; Aerospace engineering","score_opus":0.015437600586475936,"score_gpt":0.27257816478995295,"score_spread":0.25714056420347703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3180950260","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.010083075,0.00013759249,0.9871573,0.00010058027,0.00007656211,0.000022166038,0.000019341378,0.00009717924,0.0023063193],"genre_scores_gemma":[0.6409571,0.00032643744,0.34727445,0.00014314067,0.00011646536,0.00024880844,0.00014414177,0.00023032888,0.010559202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972886,0.00009360955,0.000009378402,0.000035447698,0.00009776789,0.000034966193],"domain_scores_gemma":[0.9996092,0.00017910186,0.00003100302,0.000028228897,0.00011076762,0.000041736956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069293025,0.0008138379,0.0009576319,0.00040809388,0.00041283315,0.00076556107,0.0009744123,0.0013551835,0.0021302558],"category_scores_gemma":[0.0012017825,0.0003854228,0.00039807893,0.00032676617,0.0006721184,0.00070832786,0.0009940478,0.0009368762,0.00033984517],"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.00007564387,0.00002891261,0.00012227148,0.000060006205,0.000014364647,0.00004930989,0.000033188673,0.96130294,0.0024677047,0.010966494,0.0006778471,0.024201365],"study_design_scores_gemma":[0.0000021381436,0.0000075059083,0.000013233935,0.0000014994104,6.687207e-7,0.0000028509874,0.0000016766195,0.9992945,0.000097293094,0.00039319787,0.00018365082,0.00000171256],"about_ca_topic_score_codex":0.006271498,"about_ca_topic_score_gemma":0.0041751442,"teacher_disagreement_score":0.006271498,"about_ca_system_score_codex":0.00047492603,"about_ca_system_score_gemma":0.0010088822,"threshold_uncertainty_score":0.012470007},"labels":[],"label_agreement":null},{"id":"W4318480902","doi":"10.1007/s11590-023-01973-2","title":"Nicely structured positive bases with maximal cosine measure","year":2023,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of Wollongong","keywords":"Basis (linear algebra); Measure (data warehouse); Algorithm; Trigonometric functions; Computer science; Mathematics; Artificial intelligence; Data mining; Geometry","score_opus":0.03126364182703274,"score_gpt":0.3024735883603846,"score_spread":0.2712099465333519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318480902","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.20404828,0.000966981,0.74785,0.0007246823,0.0003672704,0.00014435916,0.0005776594,0.00066222885,0.04465848],"genre_scores_gemma":[0.8146564,0.0005666182,0.16632445,0.00037830567,0.00043689675,0.00020244456,0.0012769194,0.0003408551,0.015817126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826354,0.00045345022,0.000104170285,0.000310469,0.00066732435,0.00020112081],"domain_scores_gemma":[0.9968959,0.000937482,0.00043972646,0.0005218525,0.00078030466,0.00042480094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014175314,0.0006799738,0.0010863576,0.0021960104,0.0011786192,0.0027825877,0.00092374376,0.0011495923,0.007589065],"category_scores_gemma":[0.0072140624,0.0005661943,0.0006619494,0.0013300737,0.0020575263,0.0027509534,0.0022256635,0.0015369552,0.0021817375],"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.00027053128,0.00007964331,0.0006427174,0.00016353345,0.000025570565,0.00019399419,0.00024556115,0.01574579,0.008910518,0.91981006,0.005050716,0.04886145],"study_design_scores_gemma":[0.000053084816,0.00016660041,0.000479652,0.00007221662,0.000018197266,0.00034883647,0.00017582721,0.15564269,0.0063526393,0.8253473,0.011286421,0.000056577082],"about_ca_topic_score_codex":0.00061076577,"about_ca_topic_score_gemma":0.00054853596,"teacher_disagreement_score":0.007589065,"about_ca_system_score_codex":0.00071617094,"about_ca_system_score_gemma":0.0005695647,"threshold_uncertainty_score":0.025388002},"labels":[],"label_agreement":null},{"id":"W4362596021","doi":"10.1007/s11590-023-02000-0","title":"On the complexity of proportionate open shop and job shop problems","year":2023,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Open shop; Job shop scheduling; Computational intelligence; Job shop; Mathematical proof; Mathematics; Computer science; Time complexity; Mathematical optimization; Combinatorics; Discrete mathematics; Flow shop scheduling; Artificial intelligence","score_opus":0.046146299963866724,"score_gpt":0.24560146784742318,"score_spread":0.19945516788355644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362596021","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.27516183,0.0036126147,0.6708281,0.006004373,0.0003261723,0.00017189825,0.0010430661,0.00024730532,0.042604674],"genre_scores_gemma":[0.89476454,0.0024187928,0.08572107,0.00054453907,0.0005843219,0.00028590357,0.000926605,0.0002614993,0.0144927995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99715984,0.0011805206,0.000114499824,0.00033362512,0.0009180424,0.00029346975],"domain_scores_gemma":[0.96532947,0.031055873,0.0012971227,0.0007524057,0.0008858828,0.0006792066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032352202,0.00096304674,0.0021556488,0.0013504776,0.00090871303,0.0030779277,0.0018912399,0.001476871,0.008221629],"category_scores_gemma":[0.027720664,0.000955812,0.0014510743,0.0017448184,0.0022432168,0.0064531206,0.0032224292,0.0032999245,0.00041943093],"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.00050945673,0.00020135382,0.002416382,0.00036138576,0.00010348831,0.00019256122,0.00032904657,0.51529926,0.0010148003,0.44962677,0.0050327545,0.024912728],"study_design_scores_gemma":[0.00003471883,0.000032467382,0.00062660483,0.00001690617,0.000016145032,0.000043826683,0.0000607917,0.59461963,0.00015556414,0.403304,0.0010746303,0.000014723073],"about_ca_topic_score_codex":0.003295339,"about_ca_topic_score_gemma":0.0026775086,"teacher_disagreement_score":0.008221629,"about_ca_system_score_codex":0.0020452158,"about_ca_system_score_gemma":0.0016241905,"threshold_uncertainty_score":0.027504086},"labels":[],"label_agreement":null},{"id":"W4383065888","doi":"10.1007/s11590-023-02033-5","title":"Detecting negative eigenvalues of exact and approximate Hessian matrices in optimization","year":2023,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Hessian matrix; Eigenvalues and eigenvectors; Block matrix; Mathematics; Curvature; Diagonal; Hessian equation; Quasi-Newton method; Mathematical optimization; Applied mathematics; Matrix (chemical analysis); Function (biology); Diagonal matrix; Algorithm; Computer science; Newton's method; Mathematical analysis; Geometry","score_opus":0.0137678340011307,"score_gpt":0.24152640173663803,"score_spread":0.22775856773550734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383065888","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.046905473,0.0001643339,0.9514221,0.00017989537,0.00003123616,0.000017714377,0.000028721644,0.00032812802,0.00092244573],"genre_scores_gemma":[0.7241208,0.00024136389,0.27245393,0.00011632424,0.000059881848,0.00007555753,0.00011724217,0.00031622755,0.002498619],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850166,0.00067588635,0.00006576771,0.00019377179,0.0004907167,0.000072061615],"domain_scores_gemma":[0.9912847,0.006878543,0.00053192914,0.00051295816,0.0005953961,0.00019659224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023502435,0.0008362696,0.0009823901,0.00087242445,0.00040119505,0.001236832,0.00078451785,0.0013443942,0.0012877426],"category_scores_gemma":[0.021332212,0.00086228765,0.00028995593,0.00057750085,0.0015648297,0.0019565243,0.0012664673,0.0012590338,0.00036626312],"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.0005615334,0.00021981902,0.0036084505,0.00027199843,0.00008832939,0.00016653989,0.000240751,0.73612684,0.021833107,0.08836546,0.0029777272,0.14553946],"study_design_scores_gemma":[0.000008692036,0.000022875409,0.00035239581,0.000005009691,0.0000022411004,0.000026624251,0.000011161456,0.9795251,0.0013733966,0.018509155,0.00015565843,0.000007718253],"about_ca_topic_score_codex":0.0011968736,"about_ca_topic_score_gemma":0.0013580946,"teacher_disagreement_score":0.0023502435,"about_ca_system_score_codex":0.0003951553,"about_ca_system_score_gemma":0.00068427273,"threshold_uncertainty_score":0},"labels":[{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high"},{"model":"grok","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"medium"},{"model":"opus","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"medium"}],"label_agreement":"agree"},{"id":"W4385392424","doi":"10.1007/s11590-023-02036-2","title":"Every proximal mapping is a resolvent of level proximal subdifferential","year":2023,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subderivative; Resolvent; Mathematics; Pure mathematics; Function (biology); Representation (politics); Mathematical analysis; Applied mathematics; Regular polygon; Geometry; Convex optimization","score_opus":0.0362417735556344,"score_gpt":0.2407461680358212,"score_spread":0.20450439448018679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385392424","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.047304537,0.0002959339,0.932591,0.00076335785,0.00022306968,0.000081019796,0.00013062714,0.00023330662,0.018377027],"genre_scores_gemma":[0.6493099,0.0012358746,0.29463285,0.0009943416,0.000531668,0.0004150499,0.00043808704,0.00060356583,0.051838692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990854,0.00021210546,0.000039825507,0.00025134417,0.0002945565,0.00011685983],"domain_scores_gemma":[0.99785244,0.0007267222,0.00017736702,0.00021217203,0.00055907195,0.00047220485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015529512,0.0011093139,0.0011094707,0.0018226365,0.0010875915,0.0021397185,0.0012733715,0.0013663729,0.0050861235],"category_scores_gemma":[0.0055177137,0.00063478516,0.0011603129,0.0007192858,0.0025656705,0.0032132585,0.00487681,0.0048677707,0.0011662635],"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.000064733984,0.00006308456,0.00030602192,0.00011023862,0.000049220816,0.00011756426,0.00032216185,0.0075528054,0.006901031,0.9611106,0.0020769648,0.021325527],"study_design_scores_gemma":[0.00002898565,0.00017235673,0.00041110595,0.000026537058,0.00002737335,0.00040282545,0.00016280556,0.09081586,0.0036909862,0.89432436,0.009900395,0.000036354384],"about_ca_topic_score_codex":0.00043985763,"about_ca_topic_score_gemma":0.00026722104,"teacher_disagreement_score":0.0050861235,"about_ca_system_score_codex":0.0007997753,"about_ca_system_score_gemma":0.0010069697,"threshold_uncertainty_score":0.017014802},"labels":[],"label_agreement":null},{"id":"W4386828169","doi":"10.1007/s11590-023-02058-w","title":"Approximation algorithm for solving the 1-line Steiner tree problem with minimum number of Steiner points","year":2023,"lang":"en","type":"article","venue":"Optimization Letters","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Line (geometry); Constant (computer programming); Approximation algorithm; Line segment; Discrete mathematics; Euclidean geometry; Point (geometry); Tree (set theory); Computer science; Geometry","score_opus":0.010013078112781465,"score_gpt":0.21826461661679858,"score_spread":0.20825153850401712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386828169","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.02898165,0.0005097138,0.9608592,0.00045361955,0.00008994957,0.000097826494,0.00029290473,0.0011217592,0.0075934064],"genre_scores_gemma":[0.2241326,0.00037910967,0.76991254,0.00017882213,0.000063856714,0.00024124107,0.00091002363,0.00016126095,0.004020619],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944216,0.0001427,0.00002838349,0.00009188247,0.00017191119,0.0001229065],"domain_scores_gemma":[0.99923694,0.00041819827,0.000088925925,0.000100708436,0.00011060415,0.00004452234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005639462,0.0009713863,0.0012297361,0.0010753731,0.00061371835,0.0011131909,0.0017843082,0.0014850795,0.008419405],"category_scores_gemma":[0.0024832,0.000535742,0.0007657883,0.0021691395,0.00037672996,0.0018068539,0.0010676892,0.001392894,0.0013018288],"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.0006134434,0.0003027773,0.0010666358,0.00034242807,0.000092615745,0.00015905587,0.00018263621,0.6753863,0.006123317,0.027144818,0.015076218,0.27350977],"study_design_scores_gemma":[0.00008795659,0.00009059489,0.0001999251,0.00001915341,0.000020226427,0.00009667966,0.000049269634,0.9864201,0.00094004185,0.010219359,0.0018475092,0.000009211712],"about_ca_topic_score_codex":0.0038132423,"about_ca_topic_score_gemma":0.0057074195,"teacher_disagreement_score":0.008419405,"about_ca_system_score_codex":0.0012075348,"about_ca_system_score_gemma":0.0015405935,"threshold_uncertainty_score":0.028165698},"labels":[],"label_agreement":null},{"id":"W4391223639","doi":"10.1007/s11590-023-02090-w","title":"Differentially private k-center problems","year":2024,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Science Foundation of Shandong Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Center (category theory); Computational intelligence; Computer science; Mathematics; Artificial intelligence; Chemistry","score_opus":0.01630995703206536,"score_gpt":0.23484497362833928,"score_spread":0.21853501659627392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391223639","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.06383771,0.0017118345,0.8596862,0.014940586,0.00055007025,0.0003307033,0.002145914,0.00071430276,0.056082793],"genre_scores_gemma":[0.8658618,0.0015005808,0.095151864,0.002467949,0.0008440965,0.0005105006,0.0013329969,0.00046188998,0.031868406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958973,0.0015349557,0.00017604641,0.00092973205,0.0007484584,0.00071354915],"domain_scores_gemma":[0.98532933,0.0101086665,0.0007566133,0.0022151656,0.0008778542,0.00071237463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00454516,0.0014726192,0.0031581544,0.001115724,0.001975697,0.0066746254,0.0038076327,0.0042651654,0.016644431],"category_scores_gemma":[0.023102868,0.0007593073,0.0010888195,0.0033590887,0.003641754,0.009389036,0.005784923,0.006080507,0.0028635797],"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.0006541922,0.00022088643,0.00029584294,0.00022776709,0.00006549828,0.00008172424,0.00010986056,0.054499477,0.00077595614,0.90299845,0.01669096,0.023379428],"study_design_scores_gemma":[0.00014982843,0.000034572953,0.00009425495,0.000027184255,0.000018915693,0.00005836393,0.000044357723,0.119661406,0.0010272238,0.87626934,0.0025916651,0.000022872846],"about_ca_topic_score_codex":0.0008302804,"about_ca_topic_score_gemma":0.00089847774,"teacher_disagreement_score":0.016644431,"about_ca_system_score_codex":0.0042431625,"about_ca_system_score_gemma":0.0037772213,"threshold_uncertainty_score":0.05568111},"labels":[],"label_agreement":null},{"id":"W4398144673","doi":"10.1007/s11590-024-02121-0","title":"Comments on finite termination of the generalized Newton method for absolute value equations","year":2024,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Iterative Methods for Nonlinear Equations","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computational intelligence; Mathematics; Applied mathematics; Value (mathematics); Absolute (philosophy); Newton's method; Mathematical analysis; Calculus (dental); Nonlinear system; Computer science; Physics; Statistics; Medicine; Artificial intelligence","score_opus":0.08917482597135298,"score_gpt":0.4120335905499375,"score_spread":0.32285876457858453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398144673","genre_codex":"commentary","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.0051356535,0.009368744,0.33701888,0.43306842,0.087945096,0.00013633945,0.0007501896,0.0015462557,0.12503046],"genre_scores_gemma":[0.20501882,0.010887223,0.20747869,0.28083435,0.13960357,0.0010074736,0.00078040035,0.0058509675,0.14853862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98998356,0.0035427911,0.0006921583,0.0010780693,0.0041887322,0.0005147448],"domain_scores_gemma":[0.9379423,0.046062037,0.0019057177,0.0031795737,0.010183198,0.0007271068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012892243,0.0015418446,0.0015262921,0.0018010349,0.0029022594,0.0030124423,0.0048010987,0.0068303864,0.01826885],"category_scores_gemma":[0.06725521,0.0005818934,0.0024366444,0.0013018883,0.009803423,0.009036953,0.0026329097,0.017541371,0.006392893],"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.00024937314,0.000029730492,0.00021588929,0.00042506366,0.000039417842,0.0005146884,0.000617551,0.004813966,0.0010079681,0.69063807,0.28054324,0.020905074],"study_design_scores_gemma":[0.00009444366,0.000059359474,0.00044165802,0.0005751691,0.000035113222,0.0002557736,0.00016189525,0.017686449,0.002349721,0.6469062,0.33131924,0.00011498469],"about_ca_topic_score_codex":0.0057963077,"about_ca_topic_score_gemma":0.002365324,"teacher_disagreement_score":0.01826885,"about_ca_system_score_codex":0.0035750333,"about_ca_system_score_gemma":0.0017986336,"threshold_uncertainty_score":0.068181515},"labels":[],"label_agreement":null},{"id":"W4404790055","doi":"10.1007/s11590-024-02165-2","title":"Convergence towards a local minimum by direct search methods with a covering step","year":2024,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Iterative Methods for Nonlinear Equations","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Computational intelligence; Convergence (economics); Mathematical optimization; Mathematics; Computer science; Artificial intelligence; Economics","score_opus":0.05197252452228647,"score_gpt":0.39286515572204644,"score_spread":0.34089263119976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404790055","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.023986863,0.00038699617,0.96458215,0.00016732956,0.00006904017,0.00008660263,0.000031235337,0.00031491203,0.010374873],"genre_scores_gemma":[0.39826405,0.00033973574,0.58921087,0.00019568116,0.00006946003,0.0006822327,0.00014550431,0.0006936812,0.01039881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958056,0.00018355278,0.000019311758,0.00006250205,0.00012072613,0.000033398068],"domain_scores_gemma":[0.997804,0.0015658827,0.000107456624,0.00021661693,0.00023271561,0.000073486764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014461605,0.00094102416,0.0009778291,0.00076216675,0.0005901586,0.0008854179,0.0008786496,0.0017542946,0.0037306233],"category_scores_gemma":[0.0075771837,0.0007137212,0.0007896955,0.00052148866,0.0012592108,0.0013874102,0.0019842999,0.0013663463,0.001048259],"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.00032166013,0.00014619708,0.0009248906,0.0007329812,0.00015344968,0.00029176284,0.00041739742,0.7532389,0.015200939,0.11418804,0.006242526,0.108141236],"study_design_scores_gemma":[0.000021566928,0.0000571479,0.00008820836,0.000025329738,0.000010687539,0.000054839857,0.000013043483,0.9853071,0.0017043347,0.011418626,0.0012891197,0.000010049008],"about_ca_topic_score_codex":0.0010415998,"about_ca_topic_score_gemma":0.0014177455,"teacher_disagreement_score":0.0037306233,"about_ca_system_score_codex":0.0004528625,"about_ca_system_score_gemma":0.00064086274,"threshold_uncertainty_score":0.012480199},"labels":[],"label_agreement":null},{"id":"W4407244990","doi":"10.1007/s11590-025-02192-7","title":"A necessary condition for the guarantee of the superiorization method","year":2025,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Cancer Institute; National Institutes of Health; University of Haifa; Israel Science Foundation; National Natural Science Foundation of China; Deutsches Krebsforschungszentrum","keywords":"Iterated function; Sequence (biology); Function (biology); Outcome (game theory); Mathematics; Mathematical optimization; Value (mathematics); Convergence (economics); Initial value problem; Convex function; Rate of convergence; Regular polygon; Algorithm; Gradient descent; Applied mathematics; Computer science; Mathematical economics; Statistics; Mathematical analysis; Channel (broadcasting); Artificial intelligence","score_opus":0.006837686961980912,"score_gpt":0.2661051495676065,"score_spread":0.2592674626056256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407244990","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.042428486,0.00049457845,0.9348804,0.0020046216,0.00016571708,0.00014453246,0.00019163151,0.00056616915,0.019123983],"genre_scores_gemma":[0.8059445,0.00082460133,0.18284617,0.0010769634,0.0004121399,0.00073529145,0.00043694544,0.00072741776,0.006995941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958674,0.0012052045,0.0002391724,0.0009302038,0.0011768066,0.0005811504],"domain_scores_gemma":[0.96683204,0.021982173,0.0028082796,0.0024257717,0.004664549,0.0012872221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067861485,0.0015840462,0.0015367167,0.0009571908,0.001440829,0.0016042932,0.0018572464,0.0024386807,0.007597808],"category_scores_gemma":[0.05333082,0.0007911096,0.0013467266,0.0005673268,0.0047843796,0.0041203434,0.0047358787,0.0050076465,0.0016223204],"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.00053437264,0.00014484953,0.002637642,0.0006688047,0.00010372494,0.00047309126,0.0005893468,0.19548851,0.027146906,0.73544997,0.005671448,0.031091247],"study_design_scores_gemma":[0.0001050875,0.0006129936,0.0007970629,0.00016513941,0.00003610072,0.00046242692,0.00011853136,0.7402276,0.015082692,0.23640893,0.005910231,0.00007321878],"about_ca_topic_score_codex":0.0010770136,"about_ca_topic_score_gemma":0.00049842824,"teacher_disagreement_score":0.007597808,"about_ca_system_score_codex":0.0011160413,"about_ca_system_score_gemma":0.0031653997,"threshold_uncertainty_score":0.03588903},"labels":[],"label_agreement":null},{"id":"W4409067445","doi":"10.1007/s11590-025-02197-2","title":"Publisher Correction: A necessary condition for the guarantee of the superiorization method","year":2025,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Statistical Methods in Clinical Trials","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computational intelligence; Computer science; Artificial intelligence","score_opus":0.17409348746357278,"score_gpt":0.49143962599326285,"score_spread":0.31734613852969007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409067445","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020684027,0.0051705954,0.14319323,0.13841097,0.66786444,0.00020680802,0.0036020814,0.0018965784,0.03758685],"genre_scores_gemma":[0.14131285,0.008712472,0.1411669,0.07743655,0.32424966,0.0010788455,0.0022967295,0.0064613665,0.29728466],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98928505,0.0033079744,0.0018146319,0.001667369,0.0033480118,0.00057695917],"domain_scores_gemma":[0.9151474,0.04120241,0.0031956022,0.012749124,0.026540749,0.0011647603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011839277,0.0019270107,0.0021791728,0.004203056,0.0021754857,0.004204535,0.003637787,0.0054126396,0.07146117],"category_scores_gemma":[0.17015028,0.001431263,0.0020181946,0.0037648755,0.0036926141,0.003899039,0.0022317455,0.010034107,0.034399554],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00023175168,0.00001981539,0.00030104315,0.00055128464,0.00013843014,0.00059160904,0.00011946804,0.00093211525,0.0003178531,0.070871614,0.88476247,0.041162618],"study_design_scores_gemma":[0.00030485727,0.00012089399,0.0019959423,0.00061117543,0.00039079654,0.0026575,0.00011072051,0.011569599,0.0027585863,0.25395164,0.725334,0.00019435355],"about_ca_topic_score_codex":0.002660003,"about_ca_topic_score_gemma":0.00251518,"teacher_disagreement_score":0.07146117,"about_ca_system_score_codex":0.0025179824,"about_ca_system_score_gemma":0.004154707,"threshold_uncertainty_score":0.23906142},"labels":[],"label_agreement":null},{"id":"W4412203422","doi":"10.1007/s11590-025-02220-6","title":"Greedy Newton: Newton’s method with exact line search","year":2025,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Iterative Methods for Nonlinear Equations","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Alberta Medical Association; University of British Columbia","funders":"","keywords":"Newton's method; Line (geometry); Computational intelligence; Mathematics; Quasi-Newton method; Applied mathematics; Mathematical optimization; Line search; Computer science; Artificial intelligence; Nonlinear system; Physics; Geometry","score_opus":0.06196056590926636,"score_gpt":0.4028590808849789,"score_spread":0.34089851497571255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412203422","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.0015013937,0.00021834423,0.992357,0.0001809036,0.00021440243,0.00003474661,0.000052011226,0.0012428386,0.0041983197],"genre_scores_gemma":[0.066029534,0.0003450639,0.9182468,0.00029628814,0.00018720157,0.00018493665,0.00018290516,0.0015451121,0.0129821515],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991499,0.00030792181,0.00003506061,0.000110935405,0.00033842959,0.000057761365],"domain_scores_gemma":[0.99907863,0.00045150938,0.00006428212,0.00015878465,0.00018776488,0.00005892399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009362279,0.0013113987,0.0010935757,0.0009706643,0.0006024942,0.0011731605,0.0016167237,0.0021522432,0.011117236],"category_scores_gemma":[0.004673189,0.0007863929,0.0005638889,0.0015161898,0.0013401335,0.0016469597,0.0019996844,0.0019818367,0.0053444677],"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.00047261448,0.00012681971,0.00059565634,0.00047128042,0.00014421478,0.00025436867,0.00022070845,0.33650938,0.007878785,0.19346723,0.051671553,0.40818754],"study_design_scores_gemma":[0.00005152967,0.00003856822,0.00009246699,0.0000282257,0.000016739927,0.000084770305,0.000013315291,0.9402263,0.0018559876,0.042021375,0.015546552,0.0000241129],"about_ca_topic_score_codex":0.0029170006,"about_ca_topic_score_gemma":0.0045843036,"teacher_disagreement_score":0.011117236,"about_ca_system_score_codex":0.00062107336,"about_ca_system_score_gemma":0.0014119087,"threshold_uncertainty_score":0.037190914},"labels":[],"label_agreement":null},{"id":"W4412793654","doi":"10.1007/s11590-025-02221-5","title":"Computing approximate Nash equilibria for integer programming games","year":2025,"lang":"en","type":"article","venue":"Optimization Letters","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; Computer Research Institute of Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; Université de Toulouse; Institut de Valorisation des Données; Princeton University","keywords":"Integer programming; Computational intelligence; Nash equilibrium; Integer (computer science); Computer science; Mathematical optimization; Game theory; Mathematics; Mathematical economics; Artificial intelligence; Programming language","score_opus":0.03253869857474278,"score_gpt":0.36418847203313565,"score_spread":0.33164977345839286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412793654","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.025854878,0.00007674887,0.97203887,0.000091895185,0.000015163854,0.00004298653,0.00002462029,0.00017104643,0.001683934],"genre_scores_gemma":[0.70785564,0.00011792221,0.28982487,0.00007097306,0.000017832886,0.00015287215,0.000101707075,0.00009343853,0.001764706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869627,0.0006520955,0.000047222864,0.00017441156,0.00028070225,0.00014930508],"domain_scores_gemma":[0.99732804,0.0018790022,0.00021696335,0.00020229594,0.0002643945,0.000109315464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023619325,0.0013731014,0.001394369,0.0009552854,0.00071617874,0.0016642158,0.0013596559,0.0010968711,0.0029404268],"category_scores_gemma":[0.0097496705,0.0006075575,0.000690276,0.00071487913,0.0013092534,0.0020531681,0.001799931,0.0019083149,0.00035756722],"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.000063280466,0.00003091806,0.00031400385,0.000026990627,0.000020978885,0.00003234924,0.00004461879,0.96010494,0.00048319728,0.030954348,0.00015382485,0.007770644],"study_design_scores_gemma":[0.0000038027838,0.000009257457,0.000013719723,0.0000025550219,0.000001649303,0.0000034501527,0.000007905647,0.98956746,0.00016967297,0.01013851,0.00008043069,0.0000015703876],"about_ca_topic_score_codex":0.0053959386,"about_ca_topic_score_gemma":0.0043577496,"teacher_disagreement_score":0.0053959386,"about_ca_system_score_codex":0.0018390503,"about_ca_system_score_gemma":0.001469501,"threshold_uncertainty_score":0.013343334},"labels":[],"label_agreement":null}]}