{"meta":{"query_hash":"a5dc42673ba5","filters":{"venue":"Annals of Operations Research"},"cohort_total":352,"direct_labels_cover":0,"predictions_cover":352,"exported":352,"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/a5dc42673ba5","api":"https://metacan.xera.ac/api/v1/cohort?venue=Annals+of+Operations+Research"},"results":[{"id":"W101737918","doi":"10.1023/a:1026115027615","title":"Aggregation and Surrogation Error in the p-Median Model","year":2003,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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 Alberta","funders":"","keywords":"Computer science; Theory of computation; Algorithm","score_opus":0.36250419437538056,"score_gpt":0.43087589796570797,"score_spread":0.0683717035903274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W101737918","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.09343433,0.00067464804,0.89818424,0.0034503674,0.00017340646,0.000047404832,0.00040439583,0.00041223736,0.0032190434],"genre_scores_gemma":[0.86732405,0.00044586824,0.12590668,0.00039454654,0.00023991219,0.00013075795,0.0005636445,0.00017984759,0.004814794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98205847,0.012914546,0.00067481236,0.0023793012,0.0012323617,0.0007405104],"domain_scores_gemma":[0.84950113,0.13275705,0.0046202764,0.008672349,0.0037184737,0.00073074695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.048242465,0.00088027486,0.0033519794,0.0016515339,0.0017376497,0.0042375633,0.0038162195,0.0038785895,0.0037441275],"category_scores_gemma":[0.13457626,0.0010682788,0.001653443,0.0037245988,0.00368618,0.006167112,0.0040891743,0.0035870709,0.0005217546],"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.0005980543,0.000060395618,0.012183856,0.00008500674,0.0002510537,0.00023927422,0.00025865666,0.7826008,0.00017151474,0.15133591,0.0031962108,0.04901925],"study_design_scores_gemma":[0.00003922562,0.000032803622,0.0008398504,0.000020729849,0.0000337812,0.00007226387,0.0000408234,0.87253135,0.00015582284,0.1257043,0.00050631666,0.00002272156],"about_ca_topic_score_codex":0.009164213,"about_ca_topic_score_gemma":0.0054451623,"teacher_disagreement_score":0.048242465,"about_ca_system_score_codex":0.002390382,"about_ca_system_score_gemma":0.0025253308,"threshold_uncertainty_score":0.25513357},"labels":[],"label_agreement":null},{"id":"W104314163","doi":"10.1023/a:1020759332183","title":"Minmax p-Traveling Salesmen Location Problems on a Tree","year":2002,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Theory of computation; Order (exchange); Time complexity; Mathematics; Combinatorics; Mathematical optimization; Computer science; Tree (set theory); Algorithm","score_opus":0.31706850734061026,"score_gpt":0.4308538352548084,"score_spread":0.11378532791419815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W104314163","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.09350814,0.0015266014,0.87090343,0.002736328,0.0001438979,0.00038901743,0.0019205315,0.00030786695,0.028564183],"genre_scores_gemma":[0.53760135,0.0023421005,0.42043847,0.00042704857,0.0003835003,0.00080679066,0.0020884373,0.00043817543,0.035474207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999215,0.00036234868,0.000044386936,0.00017437006,0.00008130441,0.00012243031],"domain_scores_gemma":[0.997632,0.001838371,0.00018972356,0.00007890653,0.00013306711,0.00012790645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001728914,0.0015218484,0.0021908684,0.0011990954,0.0009466071,0.0025365164,0.0022472665,0.002881407,0.0115095],"category_scores_gemma":[0.005531079,0.001020918,0.001321882,0.0026622482,0.0010392284,0.004952258,0.002103436,0.0019487891,0.0012014507],"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.00042560778,0.00028758953,0.0012650972,0.000671021,0.00012486512,0.00026581113,0.0001611051,0.74597234,0.0016506888,0.15396166,0.0141822165,0.081032],"study_design_scores_gemma":[0.00005088052,0.00012425488,0.00028078363,0.00004137997,0.000033194963,0.00008705474,0.00009123893,0.87986314,0.0006568612,0.115747675,0.0030093822,0.000014185825],"about_ca_topic_score_codex":0.0026703964,"about_ca_topic_score_gemma":0.0034153848,"teacher_disagreement_score":0.0115095,"about_ca_system_score_codex":0.0015704915,"about_ca_system_score_gemma":0.0012061662,"threshold_uncertainty_score":0.03850311},"labels":[],"label_agreement":null},{"id":"W105217302","doi":"10.1023/a:1020901719463","title":"Minisum Location with Closest Euclidean Distances","year":2002,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":25,"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; University of Prince Edward Island; McMaster University; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Facility location problem; Euclidean geometry; Mathematical optimization; 1-center problem; Computer science; Distribution (mathematics); Mathematics; Mathematical economics; Algorithm","score_opus":0.34600776729537713,"score_gpt":0.39895245613588604,"score_spread":0.0529446888405089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W105217302","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.01401865,0.0014513662,0.9711683,0.00046592913,0.00055029336,0.00010256365,0.0008235569,0.0007389452,0.0106803235],"genre_scores_gemma":[0.24473076,0.001964021,0.7245479,0.00032948394,0.0007841977,0.00046466326,0.002735869,0.00040251217,0.024040591],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99476635,0.0018638823,0.00048429737,0.0010219946,0.0014887273,0.00037478298],"domain_scores_gemma":[0.9916432,0.0030076148,0.00052892364,0.0031794081,0.0014687988,0.00017211339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033247264,0.0018999369,0.0028060926,0.005297006,0.0016416806,0.0034708802,0.0041009104,0.0024838226,0.015109972],"category_scores_gemma":[0.027682967,0.00094392354,0.0017285988,0.007052874,0.0015341545,0.007934465,0.0075161452,0.0022263485,0.008756635],"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.0011645659,0.00015926763,0.0018414409,0.0005920361,0.00020187821,0.00019456958,0.000282137,0.17161442,0.0019352504,0.16883801,0.018664828,0.6345116],"study_design_scores_gemma":[0.000069051515,0.00026052105,0.0010629471,0.0001811426,0.000101515616,0.00076071615,0.00031964894,0.5541963,0.0056578736,0.40417275,0.03311259,0.0001048389],"about_ca_topic_score_codex":0.001719279,"about_ca_topic_score_gemma":0.0019228844,"teacher_disagreement_score":0.015109972,"about_ca_system_score_codex":0.0011143002,"about_ca_system_score_gemma":0.0014716961,"threshold_uncertainty_score":0.050547957},"labels":[],"label_agreement":null},{"id":"W107574902","doi":"10.1023/a:1026190322164","title":"Location Among Regions with Varying Norms","year":2003,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":25,"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; Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Computer science; Facility location problem; Mathematical optimization; Variation (astronomy); Plane (geometry); Boundary (topology); Line (geometry); Mathematics; Algorithm; Geometry; Physics","score_opus":0.22963071883579314,"score_gpt":0.3838593657387171,"score_spread":0.15422864690292395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W107574902","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.9939195,0.000084005864,0.00090969965,0.0001594735,0.000007966159,0.000016717024,0.0004345544,0.000012572605,0.004455665],"genre_scores_gemma":[0.9989587,0.000019080444,0.0002914554,0.000015351789,0.0000035893206,0.000007515475,0.00020176783,0.0000049513774,0.0004975571],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99575883,0.0019490392,0.00029809453,0.00081396295,0.0006235772,0.0005565629],"domain_scores_gemma":[0.97602195,0.0101159485,0.00501673,0.0018665045,0.0061428496,0.0008360199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026351707,0.00011774527,0.0003902752,0.0016763948,0.0007505414,0.002203306,0.000619997,0.0003700113,0.0052403403],"category_scores_gemma":[0.025065506,0.000206967,0.00027492057,0.0025908328,0.0011439148,0.0014862841,0.0014092127,0.0004069246,0.00059272605],"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.0006003896,0.000088886096,0.96275216,0.000049036284,0.0001974399,0.00019554558,0.008813767,0.0017115492,0.001176578,0.0076953415,0.0011281099,0.015591245],"study_design_scores_gemma":[0.00004160067,0.00015263038,0.9654376,0.000025988755,0.0001194473,0.00018397329,0.023166489,0.0030960445,0.0007544344,0.0032394559,0.0037236053,0.00005865578],"about_ca_topic_score_codex":0.034979336,"about_ca_topic_score_gemma":0.059932888,"teacher_disagreement_score":0.034979336,"about_ca_system_score_codex":0.0015554589,"about_ca_system_score_gemma":0.00080671144,"threshold_uncertainty_score":0.06955147},"labels":[],"label_agreement":null},{"id":"W109459921","doi":"10.1023/a:1026134121255","title":"A Probabilistic Minimax Location Problem on the Plane","year":2003,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"McMaster University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Solver; Theory of computation; Minimax; Computer science; Mathematical optimization; Regular polygon; Software; Applied mathematics; Function (biology); Mathematics; Algorithm; Geometry","score_opus":0.28902068766505673,"score_gpt":0.3925561140424441,"score_spread":0.10353542637738739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W109459921","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.078415066,0.0016787004,0.901502,0.005505231,0.00015140671,0.000101370075,0.0009083381,0.00020905366,0.0115288785],"genre_scores_gemma":[0.83274555,0.0024875524,0.14680913,0.0005610842,0.0005673934,0.00038936993,0.0012890269,0.00021470714,0.014936221],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849105,0.0007888196,0.00006119833,0.00030787318,0.00020863891,0.00014240685],"domain_scores_gemma":[0.9892267,0.009083732,0.0007390348,0.00025952572,0.00037968493,0.00031124084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033153852,0.0009350855,0.0028229174,0.0012125323,0.00080712896,0.0029851114,0.0022653188,0.003818448,0.006354267],"category_scores_gemma":[0.017097382,0.0013121945,0.0011298083,0.0020976719,0.0020270573,0.0046934956,0.0024335543,0.003023606,0.0004213961],"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.00029806825,0.000067144225,0.00067684404,0.00017584836,0.000083899235,0.00010734426,0.00009784299,0.8171902,0.00034615566,0.16141237,0.005009449,0.014534849],"study_design_scores_gemma":[0.00008757559,0.000059361748,0.00028928206,0.000028908764,0.000020789977,0.000050135317,0.000036429377,0.8126972,0.00012023569,0.18532902,0.001264625,0.000016513333],"about_ca_topic_score_codex":0.0030803883,"about_ca_topic_score_gemma":0.0017649594,"teacher_disagreement_score":0.006354267,"about_ca_system_score_codex":0.0018302518,"about_ca_system_score_gemma":0.001321381,"threshold_uncertainty_score":0.021257162},"labels":[],"label_agreement":null},{"id":"W1182730838","doi":"10.1007/s10479-015-1969-3","title":"Goal programming model for management accounting and auditing: a new typology","year":2015,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","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":"Laurentian University","funders":"","keywords":"Typology; Audit; Compromise; Accounting; Computer science; Field (mathematics); Management accounting; Theory of computation; Guideline; Management science; Aggregate (composite); Business; Economics; Sociology; Political science; Mathematics; Algorithm","score_opus":0.3251146592553192,"score_gpt":0.4538097761543216,"score_spread":0.12869511689900243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1182730838","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.0055469014,0.002887962,0.9357426,0.01225956,0.0004623917,0.000061157974,0.00029023923,0.00016562175,0.0425836],"genre_scores_gemma":[0.5241911,0.011026072,0.42973897,0.0041967905,0.0021075367,0.00085868005,0.0007843845,0.00048451984,0.026612006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761766,0.0012823516,0.00012643194,0.00032891487,0.000454122,0.00019042559],"domain_scores_gemma":[0.9966275,0.0022289634,0.00021392568,0.00032059915,0.00036562717,0.00024341402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003225549,0.0011818307,0.0012218795,0.0023314862,0.0013387469,0.008770922,0.002830919,0.0033911737,0.0056657107],"category_scores_gemma":[0.00509258,0.00056978624,0.0018622112,0.0042580897,0.0069404356,0.009990566,0.0021614528,0.0067130807,0.00086957373],"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.0000038742633,0.0000150592,0.00007024406,0.000023342927,0.000007184147,0.000017539991,0.000058908234,0.0037881092,0.000024536192,0.9922198,0.0012146354,0.0025568104],"study_design_scores_gemma":[0.0000068961203,0.000010065231,0.000051311556,0.00002990583,0.000007812852,0.000031439016,0.00007551912,0.03021051,0.00003019879,0.96199745,0.0075383135,0.000010506196],"about_ca_topic_score_codex":0.0030070606,"about_ca_topic_score_gemma":0.0024231859,"teacher_disagreement_score":0.008770922,"about_ca_system_score_codex":0.00331649,"about_ca_system_score_gemma":0.0032312742,"threshold_uncertainty_score":0.024062932},"labels":[],"label_agreement":null},{"id":"W122108692","doi":"10.1023/a:1020767501233","title":"Location of Preventive Health Care Facilities","year":2002,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":161,"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; McGill University","funders":"U.S. Food and Drug Administration","keywords":"Theory of computation; Facility location problem; Health care; Quality (philosophy); Computer science; Preventive care; Operations research; Mathematics; Economic growth; Economics","score_opus":0.2750182544631937,"score_gpt":0.4196383342786208,"score_spread":0.14462007981542707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W122108692","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.95992565,0.0019493608,0.002324499,0.002516143,0.00012402872,0.00006282408,0.006346348,0.000059231923,0.026691873],"genre_scores_gemma":[0.9969699,0.0003480347,0.00064754573,0.000049216425,0.000046527413,0.000010758137,0.00050678046,0.0000031646937,0.001418097],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986878,0.0005756282,0.00008401039,0.00015781542,0.00024070127,0.0002540274],"domain_scores_gemma":[0.9930078,0.0019259448,0.0027930313,0.00026183005,0.0014193221,0.0005919962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054476236,0.00017868415,0.00021721321,0.0023214081,0.00072281435,0.0015176934,0.0006393623,0.00056307175,0.014218369],"category_scores_gemma":[0.008818933,0.00022760256,0.00028418313,0.0026060876,0.00024179049,0.0009562283,0.00082359486,0.0003203053,0.0012701681],"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.00027434228,0.00014284812,0.92741084,0.00015854185,0.000068733156,0.0004417447,0.0008392072,0.002040683,0.00060622825,0.0036671672,0.006674285,0.057675324],"study_design_scores_gemma":[0.000025429303,0.00024566866,0.9842398,0.0001535389,0.000090147485,0.00086905947,0.003996208,0.0023009982,0.0004639291,0.0013617078,0.006224889,0.000028673452],"about_ca_topic_score_codex":0.022030205,"about_ca_topic_score_gemma":0.040588684,"teacher_disagreement_score":0.022030205,"about_ca_system_score_codex":0.0014095475,"about_ca_system_score_gemma":0.0014471104,"threshold_uncertainty_score":0.047565162},"labels":[],"label_agreement":null},{"id":"W12382059","doi":"10.1023/a:1026130003508","title":"An Efficient Genetic Algorithm for the p-Median Problem","year":2003,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":337,"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","keywords":"Theory of computation; Mathematical optimization; Computer science; Algorithm; Greedy algorithm; Simple (philosophy); Coding (social sciences); Genetic algorithm; Heuristic; Upper and lower bounds; Mathematics","score_opus":0.2023695766391125,"score_gpt":0.414880243875167,"score_spread":0.21251066723605447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W12382059","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.023748714,0.00033982698,0.96813715,0.00052203145,0.00012155497,0.000113408394,0.00011258767,0.00057590404,0.0063289003],"genre_scores_gemma":[0.20558973,0.00023630806,0.7887946,0.0002687968,0.00009475703,0.00031764837,0.0002987339,0.00014378315,0.004255651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950826,0.00017666348,0.000019479085,0.00010811217,0.00010741108,0.00008018232],"domain_scores_gemma":[0.99903715,0.00066534814,0.00005655648,0.000051053365,0.00014182071,0.000048006965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001104252,0.00091162865,0.0015058876,0.0013060581,0.0009708937,0.0012822285,0.0020406274,0.0029562325,0.0042620073],"category_scores_gemma":[0.0033928002,0.00063215045,0.0010088144,0.0016747111,0.0009031176,0.0012304896,0.0013418691,0.0015423577,0.00064001314],"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.00009963821,0.000110767054,0.00050396746,0.000049246795,0.000047366142,0.00006959471,0.000057680194,0.8780097,0.0008369189,0.01339838,0.0030359768,0.10378069],"study_design_scores_gemma":[0.000056349705,0.000032401746,0.00007009604,0.00000807315,0.000010519637,0.000019286452,0.000016588108,0.98995155,0.0001870517,0.008964797,0.0006777711,0.0000056220847],"about_ca_topic_score_codex":0.010846786,"about_ca_topic_score_gemma":0.009104968,"teacher_disagreement_score":0.010846786,"about_ca_system_score_codex":0.0014664242,"about_ca_system_score_gemma":0.0024437227,"threshold_uncertainty_score":0.021567345},"labels":[],"label_agreement":null},{"id":"W131616201","doi":"10.1023/a:1026183515320","title":"Multi-Service Facility Location Models","year":2003,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Urban and Freight Transport Logistics","field":"Engineering","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 Alberta","funders":"Japan Society for the Promotion of Science","keywords":"Service (business); Variety (cybernetics); Business; Computer science; Scale (ratio); Operations management; Environmental economics; Operations research; Marketing; Geography; Economics; Mathematics; Cartography","score_opus":0.5144915647261461,"score_gpt":0.405426362218811,"score_spread":0.10906520250733509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W131616201","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.09024008,0.0022258468,0.87352455,0.0033897862,0.00038007656,0.00017956525,0.0037971265,0.00076037605,0.025502715],"genre_scores_gemma":[0.88161516,0.0021193435,0.046066932,0.0002976468,0.00032781658,0.00030631156,0.0025218017,0.00022172315,0.066523276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981742,0.00075632625,0.00007017621,0.0003783155,0.00019406306,0.00042692327],"domain_scores_gemma":[0.99535996,0.002591822,0.00066825864,0.000401012,0.00055822614,0.0004206451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002505611,0.002245502,0.0030074997,0.0018073424,0.0011134592,0.0037241955,0.005997384,0.0045092897,0.018121276],"category_scores_gemma":[0.007464599,0.0019706357,0.0022018536,0.00502009,0.0018037286,0.00550672,0.002328592,0.002689429,0.0032358246],"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.00007623934,0.00004458063,0.00045753352,0.000036242338,0.000037136422,0.00007020925,0.000027735492,0.95071346,0.00008586088,0.040314443,0.0024574078,0.005679021],"study_design_scores_gemma":[0.00001940328,0.000016743317,0.00009643214,0.000005787423,0.000013744402,0.00001999177,0.00001638639,0.9798213,0.000029656469,0.019107236,0.0008446969,0.00000857953],"about_ca_topic_score_codex":0.022594998,"about_ca_topic_score_gemma":0.016538955,"teacher_disagreement_score":0.022594998,"about_ca_system_score_codex":0.0036725178,"about_ca_system_score_gemma":0.0017655477,"threshold_uncertainty_score":0.06062168},"labels":[],"label_agreement":null},{"id":"W141986059","doi":"10.1023/a:1010917903065","title":"Stability in Linear Programming Models: An Index Set Approach","year":2001,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":10,"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":"Mathematics; Theory of computation; Linear programming; Parametric programming; Mathematical optimization; Stability (learning theory); Applied mathematics; Parametric statistics; Set (abstract data type); Computer science; Algorithm; Statistics","score_opus":0.4544589079224721,"score_gpt":0.47320677683012763,"score_spread":0.018747868907655507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W141986059","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.013550941,0.0018198501,0.9704286,0.0017394767,0.00018679042,0.00004432872,0.00013878703,0.00008788302,0.012003242],"genre_scores_gemma":[0.8028489,0.0058641173,0.17227565,0.0005474772,0.0017936613,0.00063705374,0.00046666557,0.00030828506,0.015258302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967811,0.001765739,0.00016290952,0.00041123998,0.0007291273,0.00014986789],"domain_scores_gemma":[0.98722744,0.0097795725,0.0010432682,0.00057634973,0.001019398,0.00035396995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070099467,0.0013266279,0.0025911618,0.0029494225,0.0015212419,0.0056405417,0.0024987594,0.002268561,0.0051165586],"category_scores_gemma":[0.020416338,0.0009458051,0.002182242,0.0026380748,0.0033159712,0.0074055474,0.0031353484,0.0037868728,0.0005408082],"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.000038412563,0.000058938564,0.0003749986,0.00010667491,0.00009052268,0.000051625513,0.00011749884,0.09583171,0.0005281998,0.8876371,0.002030835,0.013133514],"study_design_scores_gemma":[0.0000069631215,0.000024402807,0.0000813894,0.000023417511,0.000019125397,0.000015734853,0.000025162935,0.42573157,0.00014850432,0.57313615,0.00077412266,0.00001353332],"about_ca_topic_score_codex":0.0009820875,"about_ca_topic_score_gemma":0.0008568942,"teacher_disagreement_score":0.0070099467,"about_ca_system_score_codex":0.002468253,"about_ca_system_score_gemma":0.0015677849,"threshold_uncertainty_score":0.0370726},"labels":[],"label_agreement":null},{"id":"W14474499","doi":"10.1023/a:1020992910050","title":"Recent Developments in the Theory and Applications of Location Models: A Preview","year":2002,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"Computer science","score_opus":0.36558002536392603,"score_gpt":0.4124520385444206,"score_spread":0.046872013180494554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W14474499","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021515267,0.8689503,0.07814961,0.023692172,0.0038198088,0.000017241537,0.00016606305,0.0001344308,0.022918997],"genre_scores_gemma":[0.03379238,0.9160305,0.02466048,0.003987855,0.015528448,0.000032255506,0.0001916892,0.00007711998,0.0056993547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987097,0.0004560186,0.000094188625,0.00022150578,0.00044480633,0.00007379945],"domain_scores_gemma":[0.9861626,0.011003074,0.00051957415,0.00074194855,0.0013042681,0.0002684661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003660996,0.0012189634,0.0013894481,0.004626588,0.00074419315,0.006241274,0.0022195312,0.0029032489,0.008861374],"category_scores_gemma":[0.009315737,0.00074383116,0.0011682109,0.007447234,0.003535006,0.010288505,0.002072492,0.0038345687,0.0028474445],"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.00008539049,0.00015684223,0.0014645727,0.0031023093,0.00008752359,0.0001816962,0.00031958683,0.010198458,0.0006137059,0.53714275,0.048780695,0.39786652],"study_design_scores_gemma":[0.000013906906,0.000070808805,0.0008755098,0.0014836962,0.000052092568,0.0004506962,0.0004106619,0.013713307,0.00035179305,0.38852587,0.5939715,0.00008014802],"about_ca_topic_score_codex":0.0030061603,"about_ca_topic_score_gemma":0.003330848,"teacher_disagreement_score":0.008861374,"about_ca_system_score_codex":0.0021044803,"about_ca_system_score_gemma":0.0018963397,"threshold_uncertainty_score":0.029644191},"labels":[],"label_agreement":null},{"id":"W1493792108","doi":"10.1023/a:1023370211456","title":"Uncertainty and Investment in Electricity Generation with an Application to the Case of Hydro-Québec","year":2003,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Electric Power System Optimization","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Alberta Energy; University of Alberta","funders":"","keywords":"Competition (biology); Restructuring; Theory of computation; Computer science; Operations research; Linear programming; Investment (military); Duration (music); Process (computing); Mathematical optimization; Face (sociological concept); Simple (philosophy); Economics; Mathematics; Finance","score_opus":0.06937511628807928,"score_gpt":0.35677123309641456,"score_spread":0.28739611680833527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493792108","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.9391801,0.0051158206,0.0124064125,0.007413967,0.00012049903,0.00008548281,0.0013408404,0.00010523674,0.034231644],"genre_scores_gemma":[0.9928872,0.0010567277,0.0014043516,0.00007624819,0.000030508076,0.000017065955,0.00014064879,0.000015623486,0.0043716915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994438,0.0002490163,0.00001713078,0.00005520273,0.00006995296,0.0001648398],"domain_scores_gemma":[0.99317086,0.00573018,0.0002578035,0.00010158856,0.00048767182,0.0002519826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020210007,0.00082140265,0.001299532,0.0012807302,0.0019431378,0.0035051906,0.001891456,0.0034151932,0.004329115],"category_scores_gemma":[0.008980054,0.00065797154,0.001060837,0.0029663946,0.0019138714,0.0017589311,0.0012924605,0.0025446392,0.0001251283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017464464,0.00011306703,0.008326829,0.00007103978,0.00008871399,0.0011101725,0.00015996487,0.9281149,0.00017483678,0.054174803,0.0028142207,0.004676714],"study_design_scores_gemma":[0.000057780242,0.000048044792,0.0056536365,0.00003181065,0.00006218602,0.00008120362,0.0005458259,0.9739605,0.00010144443,0.017727887,0.0016582428,0.00007154401],"about_ca_topic_score_codex":0.79677814,"about_ca_topic_score_gemma":0.7806498,"teacher_disagreement_score":0.20322186,"about_ca_system_score_codex":0.0155329555,"about_ca_system_score_gemma":0.00496051,"threshold_uncertainty_score":0.40883732},"labels":[],"label_agreement":null},{"id":"W1502837695","doi":"10.1023/a:1022942825680","title":"An Optimization-Based Approach to the Multiple Static Delivery Technique in Radiation Therapy","year":2003,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Radiotherapy Techniques","field":"Physics and Astronomy","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Tekes; Varian Medical Systems","keywords":"Mathematical optimization; Lipschitz continuity; Computer science; Nonlinear programming; Theory of computation; Global optimization; Nonlinear system; Inverse problem; Mathematics; Applied mathematics; Algorithm","score_opus":0.10552793079532134,"score_gpt":0.428280240282475,"score_spread":0.32275230948715367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502837695","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.0027746132,0.0003384167,0.99355906,0.00016390189,0.00005254796,0.000034997778,0.000020338042,0.00017529154,0.002880816],"genre_scores_gemma":[0.22370726,0.0006936607,0.7670013,0.00016821781,0.00016300156,0.0002360755,0.000098612894,0.00058171595,0.007350151],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994566,0.00020338804,0.000022485485,0.00005174703,0.00022602518,0.000039704668],"domain_scores_gemma":[0.9994671,0.00031941148,0.000053354026,0.00003078098,0.000110627945,0.000018674627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011163433,0.0010425816,0.0014750115,0.0011380396,0.0007073241,0.00097579986,0.0015568279,0.0010552468,0.0037515888],"category_scores_gemma":[0.0020491048,0.0011475885,0.0012849107,0.0013660125,0.0006126258,0.0010731473,0.00094469194,0.0011502967,0.0004994201],"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.000032943924,0.000035092515,0.000094680596,0.000053376818,0.00003336368,0.000023189645,0.000022879582,0.954192,0.0012564937,0.008351143,0.0008379273,0.035066903],"study_design_scores_gemma":[0.000006001305,0.00001176133,0.000047685022,0.000004129619,0.000008715242,0.000010278501,0.0000029504786,0.99679726,0.00026144605,0.0022019094,0.00064235757,0.0000055449404],"about_ca_topic_score_codex":0.0068449154,"about_ca_topic_score_gemma":0.0065224804,"teacher_disagreement_score":0.0068449154,"about_ca_system_score_codex":0.0011283798,"about_ca_system_score_gemma":0.00135547,"threshold_uncertainty_score":0.013610125},"labels":[],"label_agreement":null},{"id":"W1505327332","doi":"10.1023/a:1018925302021","title":"The management of high seas fisheries","year":2000,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Marine and fisheries research","field":"Environmental Science","cited_by":74,"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":"Fish stock; Exclusive economic zone; Fisheries management; Stock (firearms); Negotiation; Fishery; Fishing; United Nations Convention on the Law of the Sea; Geography; International waters; Herring; Territorial waters; Business; International law; Political science; Fish <Actinopterygii>; Law","score_opus":0.1135251018553638,"score_gpt":0.3874397394850085,"score_spread":0.2739146376296447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505327332","genre_codex":"other","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.28830445,0.05747587,0.0072235134,0.2671274,0.003809844,0.00010965089,0.00044516212,0.00008078522,0.37542334],"genre_scores_gemma":[0.93469673,0.022325834,0.0024036355,0.0041281553,0.0022422408,0.000032201333,0.00011864519,0.000012376619,0.03404022],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99859184,0.0007290488,0.00006127037,0.00006404898,0.0003646157,0.00018905372],"domain_scores_gemma":[0.9978411,0.0005091136,0.00048974017,0.000087499946,0.0006286436,0.00044383074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002387156,0.00023306561,0.00011287808,0.0007102279,0.0012431814,0.0031464084,0.0006129815,0.0009842654,0.006225533],"category_scores_gemma":[0.0050673326,0.000111100926,0.00013293388,0.00101093,0.002162182,0.0012665404,0.0008805203,0.0010471581,0.0004523581],"study_design_candidate":"observational","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.000154622,0.00032587085,0.0597074,0.00037154733,0.00008989995,0.00036784043,0.0034077151,0.008459043,0.0014785635,0.094172,0.120619476,0.71084595],"study_design_scores_gemma":[0.00004237864,0.00043165698,0.21323352,0.000793343,0.00006255254,0.00033423593,0.013663037,0.0056489534,0.0009830686,0.06663993,0.698113,0.000054192715],"about_ca_topic_score_codex":0.036973786,"about_ca_topic_score_gemma":0.08998306,"teacher_disagreement_score":0.036973786,"about_ca_system_score_codex":0.0021480538,"about_ca_system_score_gemma":0.0063278843,"threshold_uncertainty_score":0.073517144},"labels":[],"label_agreement":null},{"id":"W151704277","doi":"10.1023/a:1026135632158","title":"Bioenergy Systems Planning Using Location–Allocation and Landscape Ecology Design Principles","year":2003,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Energy and Environment Impacts","field":"Environmental Science","cited_by":34,"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; International Institute for Sustainable Development","funders":"","keywords":"Nexus (standard); Bioenergy; Landscape ecology; Landscape planning; Biomass (ecology); Environmental resource management; Sustainable development; Sustainable energy; Energy planning; Environmental planning; Production (economics); Natural resource economics; Ecology; Geography; Business; Environmental economics; Computer science; Renewable energy; Environmental science; Economics; Habitat","score_opus":0.3659092363170485,"score_gpt":0.41803546647218814,"score_spread":0.05212623015513962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W151704277","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.0112586375,0.00011464828,0.9828598,0.0002624503,0.000016394308,0.00007022526,0.000050825354,0.000055078086,0.0053119054],"genre_scores_gemma":[0.47479624,0.00040744897,0.51419765,0.00011834401,0.00003740396,0.00052381365,0.00013521228,0.00012925852,0.009654544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990797,0.0005534582,0.00003015827,0.000091415975,0.00017835503,0.000066918736],"domain_scores_gemma":[0.9990804,0.00057100004,0.00008163156,0.00007114967,0.00015978584,0.000036020607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017105622,0.0009392764,0.0009817161,0.0011602561,0.0006611276,0.0018117134,0.0014979274,0.001082375,0.0060290196],"category_scores_gemma":[0.0029192762,0.0014614036,0.0011033965,0.0016564621,0.0009907552,0.0025719004,0.0015367783,0.0010319705,0.00043924796],"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.000009644089,0.000019514899,0.0002693692,0.000021365007,0.000024165898,0.000015208251,0.000032695058,0.9550948,0.00021667905,0.0305751,0.00027124403,0.013450381],"study_design_scores_gemma":[0.000013680338,0.000027906717,0.00017590755,0.000010811537,0.00002448336,0.000018922614,0.00003122973,0.95111567,0.0002331768,0.04679076,0.0015485705,0.000008954134],"about_ca_topic_score_codex":0.004964275,"about_ca_topic_score_gemma":0.013419193,"teacher_disagreement_score":0.0060290196,"about_ca_system_score_codex":0.0016530567,"about_ca_system_score_gemma":0.0014109825,"threshold_uncertainty_score":0.02016902},"labels":[],"label_agreement":null},{"id":"W1541052538","doi":"10.1007/s10479-008-0477-0","title":"Malmquist indexes with quasi-fixed inputs: an application to school districts in Québec","year":2008,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université de Sherbrooke; Université du Québec à Montréal","funders":"","keywords":"Inefficiency; Productivity; Competitor analysis; Flexibility (engineering); Malmquist index; Generalization; Index (typography); Econometrics; Measure (data warehouse); Economics; Business; Computer science; Microeconomics; Total factor productivity; Mathematics; Marketing; Economic growth","score_opus":0.3357396875096175,"score_gpt":0.5215650930073835,"score_spread":0.185825405497766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541052538","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.7235547,0.0026992494,0.23530127,0.0021379208,0.00010185331,0.00082036434,0.004680788,0.0005683834,0.030135466],"genre_scores_gemma":[0.9210184,0.0005551819,0.07082263,0.000055393608,0.000030795807,0.00017924473,0.00061814045,0.000069534304,0.0066507687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928139,0.004452768,0.00029382453,0.0005374783,0.0011818745,0.000720139],"domain_scores_gemma":[0.97346073,0.02142072,0.0010633002,0.0012131197,0.002557096,0.0002849934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011164158,0.0007432342,0.0027095927,0.0039536157,0.0019670303,0.0052310494,0.002933169,0.0016748003,0.0048507536],"category_scores_gemma":[0.03895914,0.00062354724,0.0014097468,0.010812015,0.0014846355,0.0024449378,0.0014748148,0.0017398869,0.00022070819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030421297,0.000275602,0.030256644,0.00030772848,0.0002535507,0.00030019198,0.0005989006,0.763349,0.00041559493,0.12224169,0.003972548,0.077724315],"study_design_scores_gemma":[0.00009304751,0.00013715198,0.019586682,0.00006989976,0.00009499805,0.00003257704,0.0008193665,0.94718546,0.0005517961,0.027549293,0.0038145022,0.00006521697],"about_ca_topic_score_codex":0.72387093,"about_ca_topic_score_gemma":0.7510544,"teacher_disagreement_score":0.27612907,"about_ca_system_score_codex":0.030192386,"about_ca_system_score_gemma":0.014520922,"threshold_uncertainty_score":0.55551046},"labels":[],"label_agreement":null},{"id":"W1552630275","doi":"10.1023/a:1023307319633","title":"An Oligopolistic Investment Model of the Finnish Electricity Market","year":2003,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Electric Power System Optimization","field":"Engineering","cited_by":74,"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 Victoria","funders":"","keywords":"Oligopoly; Economics; Microeconomics; Investment (military); Electricity market; Mixed complementarity problem; Production (economics); Stochastic programming; Market power; Complementarity (molecular biology); Industrial organization; Electricity; Mathematical optimization; Cournot competition; Mathematics; Engineering","score_opus":0.12556702748705448,"score_gpt":0.37780454528509755,"score_spread":0.25223751779804304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552630275","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.6122282,0.005345905,0.16236682,0.008296566,0.0004431034,0.00016175966,0.0028987064,0.00024465082,0.20801437],"genre_scores_gemma":[0.97584367,0.00089943636,0.003068706,0.00008955817,0.00006753066,0.000058797737,0.00021059491,0.000023978744,0.019737685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995314,0.0002264514,0.000017836719,0.000064438274,0.00004493937,0.00011494838],"domain_scores_gemma":[0.999228,0.0004444122,0.00009933199,0.00002617208,0.00007518315,0.00012691847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008153349,0.00081518263,0.0012696824,0.0006674436,0.00084828166,0.003006905,0.0019343531,0.0032023538,0.008900196],"category_scores_gemma":[0.0025208592,0.00085797015,0.00094247365,0.0010493837,0.001399639,0.0025709842,0.0008893281,0.0015102589,0.00055505655],"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.000093679475,0.000048716192,0.0005129943,0.000054464777,0.00003340952,0.00027617137,0.00006643421,0.85810333,0.00026087777,0.13748464,0.0012771757,0.0017881148],"study_design_scores_gemma":[0.00006094927,0.000043925196,0.000406849,0.000018722945,0.00003754367,0.00005682484,0.000057466386,0.94917905,0.000063300016,0.048829883,0.0012198512,0.000025643829],"about_ca_topic_score_codex":0.028655345,"about_ca_topic_score_gemma":0.018909177,"teacher_disagreement_score":0.028655345,"about_ca_system_score_codex":0.0027110723,"about_ca_system_score_gemma":0.0024514787,"threshold_uncertainty_score":0.056977093},"labels":[],"label_agreement":null},{"id":"W16475425","doi":"10.1023/a:1020933122382","title":"An Eigenvalue Approach to Analyzing a Finite Source Priority Queueing Model","year":2002,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":20,"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 Saskatchewan; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science","score_opus":0.23955351761846697,"score_gpt":0.41077361102134624,"score_spread":0.17122009340287928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W16475425","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.02621848,0.0002525867,0.9660195,0.00049266865,0.000118775955,0.00002491817,0.000024655643,0.0001543238,0.0066940985],"genre_scores_gemma":[0.84662646,0.00088173547,0.13453583,0.00032947247,0.0004954584,0.00017529944,0.000085172425,0.00024700564,0.016623568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994966,0.00020569484,0.000018399887,0.000050729264,0.000166263,0.00006239187],"domain_scores_gemma":[0.99739885,0.0019111485,0.00014052998,0.00011864786,0.00029131988,0.00013950154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011549878,0.000702486,0.00090269215,0.0012660235,0.0008897464,0.001622407,0.0015159473,0.0012723652,0.0029820052],"category_scores_gemma":[0.006070021,0.00060091226,0.0009937491,0.0010123801,0.0013875419,0.0023560636,0.001288029,0.0017926798,0.00036941475],"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.00003117111,0.00011166828,0.00034010896,0.00004608597,0.00004171752,0.00013991816,0.00013438395,0.44016019,0.002715858,0.54701066,0.0012533149,0.008014949],"study_design_scores_gemma":[0.0000034456953,0.0000059688014,0.000036411868,0.0000022482657,0.0000038357334,0.000011097147,0.000012712232,0.91713506,0.000099334124,0.08247802,0.00020590538,0.0000060023026],"about_ca_topic_score_codex":0.0037826605,"about_ca_topic_score_gemma":0.0020406381,"teacher_disagreement_score":0.0037826605,"about_ca_system_score_codex":0.0013234131,"about_ca_system_score_gemma":0.0013190259,"threshold_uncertainty_score":0.009975731},"labels":[],"label_agreement":null},{"id":"W170489151","doi":"10.1023/a:1020771702141","title":"Data Surrogation Error in p-Median Models","year":2002,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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 Alberta","funders":"","keywords":"Theory of computation; Population; Computer science; Ideal (ethics); Service (business); Variable (mathematics); Operations research; Algorithm; Mathematics; Demography; Sociology; Economics; Political science; Economy","score_opus":0.752284831608935,"score_gpt":0.4726998005954861,"score_spread":0.2795850310134489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W170489151","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.03090328,0.0007264915,0.96205324,0.0025992098,0.00019749913,0.000053832533,0.00053219375,0.00071162236,0.002222692],"genre_scores_gemma":[0.7626792,0.0005770157,0.22750467,0.0008956768,0.00030193655,0.0002732658,0.0016432711,0.0004574139,0.0056674634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9551579,0.034602687,0.0019299989,0.0046476675,0.0028521903,0.0008096495],"domain_scores_gemma":[0.6860358,0.28273934,0.0054176706,0.018869335,0.006116363,0.00082150765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.07541098,0.0010112957,0.0027482468,0.0017277523,0.0013781637,0.0045885355,0.003734162,0.0038591032,0.0054938085],"category_scores_gemma":[0.2794794,0.0013755726,0.001932835,0.0035758112,0.0028034572,0.006765366,0.0045911716,0.004071479,0.0012780902],"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.0017326333,0.00012582302,0.026866894,0.00031649452,0.0007152711,0.0004641503,0.00032902235,0.64024204,0.0004487049,0.13265145,0.008716545,0.18739095],"study_design_scores_gemma":[0.00008921113,0.00007354758,0.0015296935,0.0000589183,0.000076480734,0.00016035065,0.00006618047,0.85924697,0.0006489381,0.13633764,0.0016853354,0.000026690006],"about_ca_topic_score_codex":0.004143602,"about_ca_topic_score_gemma":0.003085484,"teacher_disagreement_score":0.07541098,"about_ca_system_score_codex":0.002061357,"about_ca_system_score_gemma":0.0028907422,"threshold_uncertainty_score":0.3988161},"labels":[],"label_agreement":null},{"id":"W175209279","doi":"10.1023/a:1021153305410","title":"A General Approach to the Physician Rostering Problem","year":2002,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":55,"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; Université du Québec à Montréal","funders":"","keywords":"Computer science; Flexibility (engineering); Theory of computation; Mathematical optimization; Context (archaeology); Genetic algorithm; Constraint (computer-aided design); Constraint programming; Personalization; Operations research; Algorithm; Mathematics; Machine learning; Stochastic programming","score_opus":0.710463223401453,"score_gpt":0.5447390887290039,"score_spread":0.16572413467244906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W175209279","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.002795354,0.0006298676,0.98407876,0.0018978247,0.00017341209,0.00011039145,0.00025120054,0.00005892846,0.010004382],"genre_scores_gemma":[0.18783312,0.00550773,0.76623267,0.0012990973,0.0020250736,0.00080514426,0.001024131,0.00021095514,0.03506212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978941,0.00082917407,0.00009102753,0.00046449038,0.0004965057,0.00022473329],"domain_scores_gemma":[0.99870205,0.0007635127,0.00009984352,0.00012170769,0.0002193086,0.00009351047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024472822,0.0019535488,0.0021213817,0.0018753151,0.0011826882,0.0029986168,0.004332824,0.0034294084,0.011428543],"category_scores_gemma":[0.004897452,0.0010505154,0.0033976648,0.0034074571,0.002003625,0.0035175185,0.002807282,0.004418307,0.0013948618],"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.000028428127,0.00012213041,0.00031268212,0.00028450924,0.00008942404,0.00017723512,0.00013787021,0.35618708,0.00067388854,0.6007089,0.010320411,0.030957425],"study_design_scores_gemma":[0.000041061023,0.000049302464,0.00023672158,0.000052712287,0.00004427177,0.000107702406,0.00006571954,0.49582937,0.00015132477,0.48950884,0.013889012,0.000023978062],"about_ca_topic_score_codex":0.007503241,"about_ca_topic_score_gemma":0.008217202,"teacher_disagreement_score":0.011428543,"about_ca_system_score_codex":0.0025466331,"about_ca_system_score_gemma":0.0033865548,"threshold_uncertainty_score":0.038232267},"labels":[],"label_agreement":null},{"id":"W176226554","doi":"10.1023/a:1013107507150","title":"Globally Optimized Spherical Point Arrangements: Model Variants and Illustrative Results","year":2001,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Theoretical and Applied Studies in Material Sciences and Geometry","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Research Institute for Mathematical Sciences; Centrum Wiskunde and Informatica","keywords":"Solver; Mathematical optimization; Variety (cybernetics); Theory of computation; Representation (politics); Computer science; Point (geometry); Optimization problem; Mathematics; Algorithm; Artificial intelligence","score_opus":0.1169280639765363,"score_gpt":0.40098781025693014,"score_spread":0.2840597462803939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W176226554","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.21977988,0.00093031605,0.72324246,0.0005572923,0.00010260081,0.00013477339,0.0005087808,0.00033955261,0.054404315],"genre_scores_gemma":[0.8976199,0.000662911,0.08768415,0.00007029149,0.00003675682,0.00016718612,0.00041429212,0.00021406937,0.013130396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995721,0.00019137104,0.000015856238,0.00006325594,0.0000879635,0.000069451664],"domain_scores_gemma":[0.998747,0.0006626866,0.00014647777,0.00015659656,0.00020383587,0.00008342725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000981876,0.0011959227,0.001878496,0.00092249387,0.0007875155,0.002147129,0.0014667015,0.0026144001,0.0059543224],"category_scores_gemma":[0.0037271157,0.0006839543,0.0011375529,0.0021524285,0.001423919,0.0022186653,0.0015263974,0.0010173367,0.0009418161],"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.00007375836,0.000041279436,0.00017137235,0.000041579355,0.000015511694,0.00006411098,0.000040406692,0.9117852,0.00038603338,0.080514506,0.0011305675,0.005735716],"study_design_scores_gemma":[0.000013401223,0.00003365323,0.00007024612,0.0000067525116,0.000009166711,0.00003805734,0.000037729278,0.9653292,0.0002044658,0.03374395,0.00050142134,0.000012059082],"about_ca_topic_score_codex":0.003676145,"about_ca_topic_score_gemma":0.0033418713,"teacher_disagreement_score":0.0059543224,"about_ca_system_score_codex":0.0010741052,"about_ca_system_score_gemma":0.0009062509,"threshold_uncertainty_score":0.019919217},"labels":[],"label_agreement":null},{"id":"W182049128","doi":"10.1023/a:1026138205325","title":"Properties of Three-Dimensional Median Line Location Models","year":2003,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":13,"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":"Theory of computation; Heuristic; Mathematical optimization; Euclidean distance; Computer science; Norm (philosophy); Line (geometry); Mathematics; Euclidean space; Combinatorics; Algorithm; Artificial intelligence; Geometry","score_opus":0.38426250755579067,"score_gpt":0.41592130949951817,"score_spread":0.0316588019437275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W182049128","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.14912741,0.00051082944,0.8354454,0.00093006954,0.0000503356,0.0000803102,0.00062919833,0.0006167759,0.0126097],"genre_scores_gemma":[0.9541383,0.0006228648,0.035927434,0.00016495338,0.000072032424,0.00016105818,0.0007449958,0.00023851075,0.00792994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906355,0.00027501362,0.000056905046,0.00016361973,0.00029863635,0.00014226635],"domain_scores_gemma":[0.988672,0.006098683,0.0023310403,0.0009490529,0.0011362989,0.0008130197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002178847,0.0009439875,0.0018061118,0.002004058,0.0014144045,0.0044418657,0.0032998794,0.0029751034,0.007883503],"category_scores_gemma":[0.015028385,0.0012225866,0.0014880827,0.0021863896,0.0019229851,0.005191033,0.00311674,0.0019494893,0.001080869],"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.00016197156,0.00008476879,0.0021365175,0.000065573615,0.00005025278,0.00011088478,0.00019413227,0.6662406,0.0011111301,0.31726682,0.0016563141,0.010921061],"study_design_scores_gemma":[0.000009745989,0.000020212481,0.00012719794,0.00001038868,0.0000099988165,0.0000351344,0.000031092342,0.93521416,0.0001878602,0.06392615,0.00041411904,0.000013860473],"about_ca_topic_score_codex":0.0051417425,"about_ca_topic_score_gemma":0.0028756845,"teacher_disagreement_score":0.007883503,"about_ca_system_score_codex":0.0020622106,"about_ca_system_score_gemma":0.0013804705,"threshold_uncertainty_score":0.02637291},"labels":[],"label_agreement":null},{"id":"W1857100370","doi":"10.1007/s10479-015-2006-2","title":"Modeling efficiency in the presence of multiple partial input to output processes","year":2015,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","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":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Data envelopment analysis; Measure (data warehouse); Set (abstract data type); Bundle; Computer science; Production (economics); Extension (predicate logic); Theory of computation; Mathematical optimization; Efficiency; Mathematics; Algorithm; Data mining; Statistics; Economics","score_opus":0.6131739241068642,"score_gpt":0.5556689324244583,"score_spread":0.05750499168240597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1857100370","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.11640823,0.0003812315,0.8784342,0.00056085706,0.000026334303,0.00006789203,0.00013104816,0.000070553535,0.003919682],"genre_scores_gemma":[0.9503855,0.00040386867,0.045003127,0.000044399298,0.000051591294,0.00014301793,0.00013052118,0.00003858537,0.003799394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99291396,0.004293269,0.00035562337,0.00082054676,0.0008169087,0.000799677],"domain_scores_gemma":[0.9557316,0.038980927,0.0021332614,0.0012816432,0.0014462989,0.0004262777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012643019,0.001590969,0.0029853568,0.0016634943,0.00061803707,0.0049740877,0.0021857978,0.0020429778,0.0024792936],"category_scores_gemma":[0.029872552,0.0015181212,0.002344912,0.0022794139,0.002174605,0.0049709403,0.002020374,0.0025873394,0.00028288452],"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.00007204585,0.000062901076,0.0009217525,0.00004080124,0.00008451795,0.000059809332,0.00004158348,0.9512585,0.00026200438,0.04312006,0.00009727103,0.003978894],"study_design_scores_gemma":[0.0000060081275,0.000015973203,0.00017727537,0.00000474867,0.000018019304,0.000008144732,0.000013025206,0.9853895,0.00015088716,0.014121823,0.000089252186,0.0000053652934],"about_ca_topic_score_codex":0.006442954,"about_ca_topic_score_gemma":0.0035388917,"teacher_disagreement_score":0.012643019,"about_ca_system_score_codex":0.0027912161,"about_ca_system_score_gemma":0.002667174,"threshold_uncertainty_score":0.06686348},"labels":[],"label_agreement":null},{"id":"W1882825307","doi":"10.1007/s10479-015-2007-1","title":"Supply chain management through the stochastic goal programming model","year":2015,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","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":"Wilfrid Laurier University","funders":"","keywords":"Goal programming; Stochastic programming; Supply chain; Theory of computation; Computer science; Supply chain management; Mathematical optimization; Function (biology); Operations research; Programming paradigm; Mathematics; Algorithm; Business; Marketing","score_opus":0.23925848199437783,"score_gpt":0.42602666382515814,"score_spread":0.1867681818307803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1882825307","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.02504928,0.00029382942,0.96729505,0.0009934055,0.000048039077,0.000049435504,0.00011858486,0.000103031554,0.0060494575],"genre_scores_gemma":[0.86556137,0.0011553271,0.11908305,0.00023523411,0.00015798671,0.00029125594,0.00025940785,0.00011095397,0.013145387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983798,0.00086016185,0.000047129448,0.0001986767,0.00030204715,0.0002120893],"domain_scores_gemma":[0.99823195,0.0011647079,0.00021816386,0.000049982347,0.00021964565,0.00011559522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022895194,0.0011338936,0.0017457713,0.0009366031,0.0007227661,0.0028937222,0.0016773943,0.0021246022,0.002842165],"category_scores_gemma":[0.0047511915,0.0012348432,0.0012091174,0.0015614525,0.001174292,0.0027012983,0.001538084,0.002060447,0.00036174708],"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.000023970639,0.000026652018,0.00014728226,0.000025393412,0.000033031058,0.000029656074,0.00002280579,0.9468177,0.00012939498,0.049735807,0.00033904798,0.0026692657],"study_design_scores_gemma":[0.000007992747,0.000013398805,0.000030909836,0.0000054537563,0.000008537544,0.0000047121734,0.0000058954997,0.9767015,0.000038497605,0.022947941,0.00022908341,0.0000060774883],"about_ca_topic_score_codex":0.009447385,"about_ca_topic_score_gemma":0.0068268515,"teacher_disagreement_score":0.009447385,"about_ca_system_score_codex":0.0019181999,"about_ca_system_score_gemma":0.0032993427,"threshold_uncertainty_score":0.018784821},"labels":[],"label_agreement":null},{"id":"W194305686","doi":"10.1023/a:1019288220413","title":"Maximization of Manufacturing Yield of Systems with Arbitrary Distributions of Component Values","year":2000,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimal Experimental Design Methods","field":"Decision Sciences","cited_by":61,"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":"Theory of computation; Bounded function; Hypercube; Monte Carlo method; Mathematical optimization; Probability density function; Nonlinear system; Mathematics; Applied mathematics; Function (biology); Random variable; Yield (engineering); Computer science; Algorithm; Discrete mathematics; Statistics; Mathematical analysis","score_opus":0.4890581218960466,"score_gpt":0.5390253233917611,"score_spread":0.04996720149571454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194305686","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.10684263,0.00041946457,0.88811845,0.00027176185,0.000016663298,0.00013478653,0.00011354137,0.00012555245,0.0039571915],"genre_scores_gemma":[0.8829078,0.00047869343,0.114746176,0.000055958448,0.000038001857,0.00030865945,0.00009649748,0.00007245575,0.0012957794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965581,0.0022045074,0.000107843145,0.00044406927,0.0004541877,0.00023126205],"domain_scores_gemma":[0.986943,0.011090117,0.00095638126,0.00046772804,0.0003980455,0.00014474658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077563105,0.0014652244,0.0016633003,0.00090310426,0.00039982266,0.0014535285,0.0012414135,0.0012585099,0.0010887713],"category_scores_gemma":[0.022204217,0.001079846,0.0008810364,0.0009836827,0.002140787,0.002018601,0.0015454767,0.0007912193,0.00023670903],"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.0006499558,0.0001497017,0.00096281024,0.00040150067,0.00011537026,0.00006080165,0.00009005598,0.8924549,0.012908798,0.059535526,0.00028221635,0.03238828],"study_design_scores_gemma":[0.00006875913,0.00033844655,0.00088615296,0.00003102289,0.000078045705,0.00003949269,0.000025919064,0.9332622,0.014950583,0.049818963,0.00047647094,0.000023957275],"about_ca_topic_score_codex":0.00040191988,"about_ca_topic_score_gemma":0.00033002655,"teacher_disagreement_score":0.0077563105,"about_ca_system_score_codex":0.0013643691,"about_ca_system_score_gemma":0.0016055157,"threshold_uncertainty_score":0.041019738},"labels":[],"label_agreement":null},{"id":"W1964397332","doi":"10.1007/s10479-005-2061-1","title":"Evaluation of Plant Focus Strategies: A Continuous Approximation Framework","year":2005,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":10,"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":"Focus (optics); Computer science; Complement (music); Theory of computation; Product (mathematics); Mathematical optimization; Industrial engineering; Operations research; Limiting; Production (economics); Mathematics; Economics; Algorithm; Engineering; Microeconomics","score_opus":0.27547123801982365,"score_gpt":0.4301385263247739,"score_spread":0.15466728830495025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964397332","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.05058004,0.00075312814,0.9418912,0.000629127,0.000052867956,0.00014883316,0.00009322147,0.00017561701,0.0056760246],"genre_scores_gemma":[0.9158577,0.00041101585,0.080864474,0.00012605166,0.00008430052,0.00017585428,0.00014480781,0.00007050467,0.0022652035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99510586,0.0032250157,0.00011644576,0.0003749431,0.00073559774,0.00044209228],"domain_scores_gemma":[0.967223,0.029075425,0.0010050752,0.0006433257,0.0014355796,0.0006175143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012711447,0.0018106564,0.002902029,0.0020192724,0.0004470122,0.0032738163,0.0029138264,0.0032504732,0.0040713903],"category_scores_gemma":[0.03902772,0.0011737071,0.0011295209,0.0014522598,0.0020771616,0.0031792014,0.0021209216,0.0021591699,0.00023074442],"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.0001367759,0.00005607637,0.00040073053,0.000044409757,0.00003812136,0.000026356685,0.000026890986,0.9794511,0.00014420204,0.011319952,0.0002146767,0.008140698],"study_design_scores_gemma":[0.0000106409425,0.00003084249,0.000043783373,0.0000053424183,0.0000055025193,0.0000031948377,0.00000595608,0.9975325,0.000045901343,0.0022698839,0.000043710985,0.00000276101],"about_ca_topic_score_codex":0.008392103,"about_ca_topic_score_gemma":0.0025137018,"teacher_disagreement_score":0.012711447,"about_ca_system_score_codex":0.0030943337,"about_ca_system_score_gemma":0.0026927001,"threshold_uncertainty_score":0.0672254},"labels":[],"label_agreement":null},{"id":"W1965275731","doi":"10.1007/s10479-005-2043-3","title":"Heuristic Procedures for Solving the Discrete Ordered Median Problem","year":2005,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":39,"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","funders":"","keywords":"Heuristics; Heuristic; Mathematical optimization; Variable neighborhood search; Theory of computation; Metaheuristic; Mathematics; Center (category theory); Genetic algorithm; Algorithm; Computer science","score_opus":0.19078021922988012,"score_gpt":0.41572418865821054,"score_spread":0.22494396942833042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965275731","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.01905385,0.00067687395,0.97262007,0.00035459534,0.00010571129,0.00021143477,0.00019714354,0.00041851393,0.0063619055],"genre_scores_gemma":[0.14810015,0.00043292975,0.8476262,0.00012694848,0.00009353062,0.0004499096,0.0003970978,0.00014048109,0.0026327411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859875,0.0007278944,0.00006942242,0.0001370714,0.00028376677,0.00018306934],"domain_scores_gemma":[0.99456114,0.004493774,0.00021476329,0.00022812976,0.00033630262,0.00016587488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027052513,0.0012772018,0.0017896931,0.0025520313,0.0011539959,0.0018674886,0.0022612487,0.0022990655,0.0076180478],"category_scores_gemma":[0.007911385,0.0010422138,0.0012438697,0.0030854254,0.001401555,0.0018448066,0.0015426185,0.002348051,0.000778534],"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.00024900853,0.00024063398,0.00034737051,0.00018683825,0.00006380806,0.00006882499,0.00010415491,0.85615724,0.0006352709,0.03569453,0.0034516575,0.10280062],"study_design_scores_gemma":[0.00015622983,0.00006426247,0.00009594769,0.000027469714,0.000020631278,0.000024778934,0.00005022294,0.95962906,0.0003359753,0.03807786,0.0015029843,0.000014642273],"about_ca_topic_score_codex":0.006636729,"about_ca_topic_score_gemma":0.008597122,"teacher_disagreement_score":0.0076180478,"about_ca_system_score_codex":0.0017325076,"about_ca_system_score_gemma":0.0027666576,"threshold_uncertainty_score":0.02548486},"labels":[],"label_agreement":null},{"id":"W1966942146","doi":"10.1007/s10479-014-1614-6","title":"The practice and theory of automated timetabling","year":2014,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":208,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Engineering and Physical Sciences Research Council","keywords":"Operations research; Computer science; Library science; Annals; History; Engineering","score_opus":0.46213127535202697,"score_gpt":0.5843200294400972,"score_spread":0.12218875408807023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966942146","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.00521932,0.0031112514,0.97312987,0.00467619,0.0002618255,0.0000681587,0.00014804956,0.00019657647,0.013188745],"genre_scores_gemma":[0.24314255,0.0065484815,0.742624,0.0009413442,0.0012986283,0.00046610652,0.00043612768,0.00018756864,0.004355198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97900325,0.0110883815,0.0012316564,0.0024738195,0.0056337495,0.0005691247],"domain_scores_gemma":[0.91134685,0.067326166,0.0026905595,0.014532867,0.0034965803,0.0006068687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013129277,0.0012423943,0.0017383776,0.0043378198,0.0021797793,0.007864188,0.0041755885,0.003358889,0.0079857735],"category_scores_gemma":[0.06057146,0.001955479,0.0024748293,0.005851827,0.014612622,0.010935868,0.0038496468,0.0074728495,0.0016265907],"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.000037160793,0.00007925208,0.0004976689,0.00027128222,0.000041411913,0.000031990767,0.00022078911,0.046454426,0.00032790547,0.9004435,0.002972808,0.04862189],"study_design_scores_gemma":[0.000022411783,0.000022547054,0.00014581767,0.00009281658,0.000011674835,0.00004766829,0.00004748947,0.08028925,0.00031467888,0.90955514,0.009431403,0.000019010331],"about_ca_topic_score_codex":0.0054932716,"about_ca_topic_score_gemma":0.0038435224,"teacher_disagreement_score":0.013129277,"about_ca_system_score_codex":0.0049470514,"about_ca_system_score_gemma":0.0069279387,"threshold_uncertainty_score":0.06943512},"labels":[],"label_agreement":null},{"id":"W1970535376","doi":"10.1007/s10479-008-0419-x","title":"An XML-based schema for stochastic programs","year":2008,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","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":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Schema (genetic algorithms); XML; Theory of computation; XML Schema (W3C); Programming language; XML Schema Editor; Document Structure Description; Theoretical computer science; Document type definition; Information retrieval; World Wide Web","score_opus":0.3896662908511025,"score_gpt":0.46968170142637294,"score_spread":0.08001541057527045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970535376","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.0025341862,0.00037460594,0.9279536,0.0012042028,0.00032003887,0.00037295232,0.028045068,0.03172413,0.0074710744],"genre_scores_gemma":[0.051863287,0.0020447872,0.8368531,0.0019110419,0.0003041076,0.001554531,0.08193711,0.011033546,0.012498485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969216,0.000638961,0.001140295,0.00037532055,0.00076328916,0.00016045464],"domain_scores_gemma":[0.99364096,0.002726147,0.0004618777,0.0015415037,0.0014015902,0.00022796758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044349693,0.0013242087,0.0012664631,0.002628617,0.00096751685,0.0066253687,0.0025914798,0.0033905583,0.016937463],"category_scores_gemma":[0.010993888,0.0014455355,0.0019246332,0.0038189304,0.00085151615,0.0072157467,0.0023202964,0.0041438523,0.010327168],"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.0006187732,0.00038443506,0.0031162219,0.0017137653,0.0001741933,0.0014650252,0.0013403329,0.03922534,0.0102616055,0.5304016,0.19141257,0.21988612],"study_design_scores_gemma":[0.00020463548,0.00008087838,0.0008058432,0.00055451307,0.0000940639,0.0011378862,0.0002669589,0.12465294,0.013068163,0.18682435,0.6721637,0.00014599612],"about_ca_topic_score_codex":0.0041201203,"about_ca_topic_score_gemma":0.0032948048,"teacher_disagreement_score":0.016937463,"about_ca_system_score_codex":0.0015732199,"about_ca_system_score_gemma":0.0024595838,"threshold_uncertainty_score":0.056661487},"labels":[],"label_agreement":null},{"id":"W1970735573","doi":"10.1007/s10479-008-0421-3","title":"Context-dependent performance standards in DEA","year":2008,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Data envelopment analysis; Computer science; Context (archaeology); Set (abstract data type); Sample (material); A priori and a posteriori; Operations research; Efficiency; Database transaction; Service (business); Theory of computation; Performance measurement; Econometrics; Mathematical optimization; Mathematics; Statistics; Algorithm; Business; Marketing; Database","score_opus":0.5598467004218818,"score_gpt":0.5734204418366126,"score_spread":0.013573741414730778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970735573","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.09307912,0.0011507468,0.8946336,0.0004991592,0.00008514942,0.0001601178,0.00008298583,0.00013844002,0.010170663],"genre_scores_gemma":[0.90373945,0.00032073233,0.09467007,0.000060426857,0.000039624858,0.00021117875,0.00007240098,0.00004230549,0.0008438101],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96664333,0.020979201,0.002013482,0.0029651837,0.0059924643,0.0014063609],"domain_scores_gemma":[0.90673244,0.07099877,0.005555643,0.008035633,0.00792561,0.00075184763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.031493075,0.0010842951,0.002375607,0.0022295392,0.0011633121,0.0063370354,0.0023193902,0.0019621395,0.0021065632],"category_scores_gemma":[0.10625278,0.0010249257,0.0011056835,0.0033252903,0.0024390589,0.008094542,0.0037903301,0.003884281,0.0003707528],"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.00032109863,0.00029411734,0.00388815,0.00024796056,0.00017607333,0.00010210309,0.0003342679,0.4219232,0.0018169568,0.49578524,0.0005598046,0.07455093],"study_design_scores_gemma":[0.00003708937,0.00017513757,0.0029049702,0.00008417309,0.000053547927,0.000062212246,0.00020757104,0.706884,0.0029464888,0.2849405,0.0016354932,0.00006880347],"about_ca_topic_score_codex":0.0013909983,"about_ca_topic_score_gemma":0.0014816406,"teacher_disagreement_score":0.031493075,"about_ca_system_score_codex":0.003789898,"about_ca_system_score_gemma":0.0030730856,"threshold_uncertainty_score":0.16655332},"labels":[],"label_agreement":null},{"id":"W1971063635","doi":"10.1007/s10479-011-0991-3","title":"A dynamic vehicle routing problem with multiple delivery routes","year":2011,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":182,"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; Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Vehicle routing problem; Computer science; Heuristic; Theory of computation; Routing (electronic design automation); Operations research; Service (business); Mathematical optimization; Computer network; Artificial intelligence","score_opus":0.1498618087874064,"score_gpt":0.3781981942429519,"score_spread":0.22833638545554552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971063635","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.071075,0.0013060436,0.9098629,0.0020620397,0.00038890415,0.00024006692,0.00081621314,0.00016513583,0.01408386],"genre_scores_gemma":[0.7230122,0.0018233771,0.23833337,0.00032746955,0.0005039374,0.0004345654,0.0009704259,0.00021960726,0.034374982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998645,0.00045240778,0.00005653304,0.00042949847,0.00023391056,0.00018257635],"domain_scores_gemma":[0.9984145,0.0010522187,0.00020527632,0.000072536575,0.00010995574,0.00014539261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017729746,0.0016426023,0.002402156,0.0013519672,0.0010067751,0.002634127,0.003129699,0.0035351822,0.006943937],"category_scores_gemma":[0.0044030617,0.0015908828,0.0015742216,0.0024034933,0.0011434256,0.0037213883,0.0018794762,0.0019415711,0.0005478943],"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.00019050574,0.00012638954,0.0003883138,0.00021452233,0.00009131051,0.0004374219,0.00004741407,0.93189555,0.0012463836,0.041067336,0.0033536574,0.020941196],"study_design_scores_gemma":[0.000060491242,0.000093662435,0.00018064481,0.00001911757,0.000049359693,0.00017425705,0.00005573272,0.9748321,0.00041737242,0.021187399,0.0029077542,0.000021969212],"about_ca_topic_score_codex":0.0032311988,"about_ca_topic_score_gemma":0.0023918913,"teacher_disagreement_score":0.006943937,"about_ca_system_score_codex":0.0020269675,"about_ca_system_score_gemma":0.001276553,"threshold_uncertainty_score":0.023229778},"labels":[],"label_agreement":null},{"id":"W1972280695","doi":"10.1007/s10479-011-0876-5","title":"The Robust Set Covering Problem with interval data","year":2011,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Regret; Benders' decomposition; Mathematical optimization; Interval (graph theory); Theory of computation; Mathematics; Heuristic; Set (abstract data type); Genetic algorithm; Minimax; Context (archaeology); Algorithm; Heuristics; Computer science; Statistics; Combinatorics","score_opus":0.5469561555470586,"score_gpt":0.4569992869582814,"score_spread":0.08995686858877716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972280695","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.039259493,0.0017656133,0.953702,0.00075222633,0.00009445363,0.00005632306,0.00047584967,0.00011555871,0.0037786302],"genre_scores_gemma":[0.67183083,0.003411815,0.31704757,0.00025122464,0.000662316,0.00031094303,0.0015409446,0.00024094278,0.004703404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99656856,0.0019868836,0.00016929289,0.00049756287,0.0005786728,0.00019899923],"domain_scores_gemma":[0.9864759,0.010870587,0.0010139025,0.0010073514,0.00037082503,0.000261455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004867117,0.0010887884,0.002584133,0.0012818334,0.0004299601,0.0023763257,0.0022611818,0.0020968106,0.0029795452],"category_scores_gemma":[0.018448047,0.0012456635,0.0017954909,0.0028704896,0.0014477989,0.004129193,0.0018921006,0.0019279646,0.000290952],"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.00015956002,0.00007737563,0.0008029463,0.0003080499,0.0002198873,0.0002171045,0.000101593476,0.84105337,0.0009522554,0.10902394,0.0030035216,0.04408043],"study_design_scores_gemma":[0.000018620583,0.000043393153,0.00028289334,0.00003215787,0.00003034376,0.000084847445,0.0000293027,0.89794725,0.00035063867,0.09971602,0.0014470014,0.000017582031],"about_ca_topic_score_codex":0.0016586226,"about_ca_topic_score_gemma":0.0007125156,"teacher_disagreement_score":0.004867117,"about_ca_system_score_codex":0.0011806407,"about_ca_system_score_gemma":0.0008022873,"threshold_uncertainty_score":0.025740087},"labels":[],"label_agreement":null},{"id":"W1972419530","doi":"10.1007/s10479-008-0309-2","title":"The erlangization method for Markovian fluid flows","year":2008,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":51,"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":"","keywords":"Laplace transform; Computer science; Fluid dynamics; Probabilistic logic; Erlang (programming language); Theory of computation; Erlang distribution; Markov process; Mathematical optimization; Applied mathematics; Algorithm; Statistical physics; Mathematics; Theoretical computer science; Mechanics; Mathematical analysis; Statistics; Exponential distribution; Physics; Artificial intelligence","score_opus":0.1957516228569016,"score_gpt":0.4483064527574165,"score_spread":0.2525548299005149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972419530","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.0022464914,0.00021279008,0.9950852,0.00016797769,0.00007905511,0.000022579987,0.000027811733,0.00015479214,0.0020033645],"genre_scores_gemma":[0.36743227,0.0023409713,0.59713995,0.00049295125,0.0007504866,0.0003362689,0.0003245844,0.0008113921,0.030371081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982552,0.00079087174,0.00007629487,0.0001856309,0.00044734974,0.0002446293],"domain_scores_gemma":[0.9959692,0.0025168129,0.00015237328,0.0005044291,0.00068256614,0.00017473733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003858355,0.0008219798,0.0008995595,0.0020163408,0.0011426378,0.0022605031,0.0023362583,0.00096242165,0.0053954907],"category_scores_gemma":[0.012040636,0.0006596825,0.001419906,0.0020035477,0.0018153863,0.00412505,0.0024850862,0.003919335,0.0012192979],"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.00016213935,0.00009283561,0.00077677955,0.00010068488,0.000064929474,0.000059911974,0.00023858681,0.15705793,0.0019164638,0.6927321,0.005171534,0.1416261],"study_design_scores_gemma":[0.000014356218,0.000013787253,0.00019987341,0.000020634367,0.000019818572,0.000033536733,0.000027910843,0.7785964,0.0009108644,0.21496463,0.005174287,0.000023818558],"about_ca_topic_score_codex":0.0053497073,"about_ca_topic_score_gemma":0.00400617,"teacher_disagreement_score":0.0053954907,"about_ca_system_score_codex":0.0023061265,"about_ca_system_score_gemma":0.0032809288,"threshold_uncertainty_score":0.020405173},"labels":[],"label_agreement":null},{"id":"W1973085655","doi":"10.1007/s10479-011-1038-5","title":"Impacts of earmarked private donations for disaster fundraising","year":2011,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":101,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"York University","keywords":"Liberian dollar; Agency (philosophy); Finance; Business; Donation; Work (physics); Economics; Economic growth","score_opus":0.4694540937713886,"score_gpt":0.43921712005506436,"score_spread":0.030236973716324222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973085655","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.9235136,0.00046338368,0.0002813036,0.007925394,0.00036916375,0.0002618884,0.0013773498,0.00010098191,0.06570705],"genre_scores_gemma":[0.988791,0.00026914183,0.00011460257,0.0005109978,0.000071259055,0.000049714265,0.00024754863,0.000011086965,0.009934659],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99269956,0.0029724191,0.00025908943,0.00030395985,0.0014386371,0.002326332],"domain_scores_gemma":[0.96753937,0.011100268,0.005925633,0.001325511,0.0061158817,0.0079934085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058022677,0.00061312236,0.0003825272,0.0017956721,0.0037504947,0.0045506996,0.0014238926,0.0033811135,0.02337959],"category_scores_gemma":[0.023811517,0.00044235974,0.0013901964,0.0014461178,0.0020310266,0.0018170063,0.004289371,0.0026940037,0.001625477],"study_design_candidate":"observational","study_design_consensus":"observational","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.016479826,0.021285761,0.52255434,0.00062767265,0.00064712606,0.010624006,0.007415521,0.023437819,0.0054669445,0.03921609,0.11254663,0.23969826],"study_design_scores_gemma":[0.0009977807,0.0050397096,0.87041944,0.00054780475,0.0005449724,0.0011645254,0.052844603,0.0067752968,0.003420601,0.007432605,0.050557222,0.00025542357],"about_ca_topic_score_codex":0.039593276,"about_ca_topic_score_gemma":0.069447,"teacher_disagreement_score":0.039593276,"about_ca_system_score_codex":0.0059189983,"about_ca_system_score_gemma":0.008649562,"threshold_uncertainty_score":0.078725636},"labels":[],"label_agreement":null},{"id":"W1973383868","doi":"10.1007/s10479-014-1725-0","title":"A general rapid network design, line planning and fleet investment integrated model","year":2014,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":50,"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","funders":"Ministerio de Economía y Competitividad","keywords":"Network planning and design; Operations research; Computer science; Transportation planning; Theory of computation; Flow network; Profit (economics); Public transport; Integrated business planning; Strategic planning; Process (computing); Operational planning; Transport engineering; Mathematical optimization; Engineering; Economics","score_opus":0.3250954444193009,"score_gpt":0.46765132002324783,"score_spread":0.14255587560394695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973383868","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.04428434,0.0007771744,0.90633136,0.001094818,0.00011800669,0.00016831179,0.0019973202,0.00041916902,0.044809498],"genre_scores_gemma":[0.754976,0.0015959087,0.16416615,0.00034383812,0.0001729847,0.0006831262,0.0017021294,0.00023782221,0.076122165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995328,0.00017667186,0.00001167128,0.00011403835,0.00008247989,0.000082395054],"domain_scores_gemma":[0.99949384,0.00023929091,0.000069792935,0.00003525531,0.0001088744,0.000052858562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008563571,0.0009688866,0.0013063997,0.0008014972,0.0005472941,0.0016345241,0.0020729208,0.002801192,0.008946593],"category_scores_gemma":[0.0021250502,0.0010353744,0.0011211731,0.0017629476,0.00077100587,0.0021413888,0.0010909452,0.0014066189,0.0010640859],"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.000008083207,0.000010854472,0.000061161394,0.000012161997,0.000005269945,0.000021068407,0.0000044674252,0.991476,0.0000887657,0.0065438594,0.000360971,0.0014073461],"study_design_scores_gemma":[0.000009347327,0.000010256069,0.000051564188,0.0000027930018,0.0000055359533,0.000008384965,0.0000034921081,0.9950925,0.000036150628,0.004089346,0.00068647286,0.0000042136203],"about_ca_topic_score_codex":0.021897867,"about_ca_topic_score_gemma":0.013774537,"teacher_disagreement_score":0.021897867,"about_ca_system_score_codex":0.0018734256,"about_ca_system_score_gemma":0.0024746198,"threshold_uncertainty_score":0.043540776},"labels":[],"label_agreement":null},{"id":"W1974179675","doi":"10.1023/b:anor.0000019101.29692.2c","title":"Using Benders Decomposition to Implicitly Model Tour Scheduling","year":2004,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":54,"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; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Computer science; Correctness; Scheduling (production processes); Mathematical optimization; Benders' decomposition; Job shop scheduling; Fair-share scheduling; Algorithm; Mathematics; Schedule","score_opus":0.7910546258868351,"score_gpt":0.6473067551021794,"score_spread":0.14374787078465567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974179675","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.014064154,0.00013386318,0.9822788,0.00015181015,0.000051016057,0.0000385387,0.00019296016,0.00015186475,0.002936896],"genre_scores_gemma":[0.34918198,0.0008122239,0.63908005,0.00013452256,0.00015295856,0.00040845977,0.0010022413,0.0005364964,0.008691081],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987998,0.00066469423,0.00004503003,0.00014507661,0.00021433287,0.00013106955],"domain_scores_gemma":[0.9973767,0.0018302369,0.00026260136,0.00024335203,0.00017500563,0.00011212372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020191965,0.001486105,0.0014666226,0.0011186001,0.00060877524,0.001696031,0.00199383,0.0014843316,0.0035539963],"category_scores_gemma":[0.007201308,0.0018185697,0.0021404384,0.0016769209,0.0010516259,0.0029973895,0.0013752896,0.0032359478,0.0005734813],"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.000018774454,0.000021459491,0.00011758432,0.00001719543,0.000014296111,0.0000149346915,0.000028724024,0.9644077,0.00016202066,0.030221866,0.0003413765,0.004634068],"study_design_scores_gemma":[0.0000039389442,0.0000051788793,0.000018214709,0.0000039366605,0.000004918771,0.000002889752,0.000004041077,0.9753879,0.000049989827,0.024062332,0.00045414126,0.0000026168404],"about_ca_topic_score_codex":0.014004128,"about_ca_topic_score_gemma":0.018696949,"teacher_disagreement_score":0.014004128,"about_ca_system_score_codex":0.001671074,"about_ca_system_score_gemma":0.001974061,"threshold_uncertainty_score":0.027845263},"labels":[],"label_agreement":null},{"id":"W1978587158","doi":"10.1007/s10479-013-1522-1","title":"Supply chain scheduling to minimize holding costs with outsourcing","year":2014,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":10,"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 Windsor","funders":"","keywords":"Outsourcing; Theory of computation; Shortest path problem; Scheduling (production processes); Job shop scheduling; Mathematical optimization; Supply chain; Bounded function; Holding cost; Polynomial-time approximation scheme; Computer science; Time complexity; Longest path problem; Mathematics; Approximation algorithm; Combinatorics; Algorithm; Business; Computer network","score_opus":0.08653777754906168,"score_gpt":0.3666433294800415,"score_spread":0.28010555193097986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978587158","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.14556973,0.0009286048,0.8356465,0.001195293,0.00031237036,0.0005166754,0.0005269976,0.0004728979,0.014831014],"genre_scores_gemma":[0.8298767,0.00071961444,0.15701327,0.00016027316,0.00021710557,0.00027509808,0.00029302418,0.00023928689,0.011205578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906343,0.00035212297,0.000035406,0.00012891041,0.00017914036,0.00024101259],"domain_scores_gemma":[0.99858403,0.00079607323,0.00013218317,0.00015756486,0.00016222023,0.00016801333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021058735,0.0015508262,0.0025635434,0.0012028367,0.0012873122,0.0018288533,0.002021225,0.0015338039,0.008177202],"category_scores_gemma":[0.0039391564,0.0012767555,0.0013177972,0.0038327347,0.0009108325,0.0026163196,0.0014744898,0.001815993,0.00051772455],"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.0002737382,0.0001277725,0.00046983513,0.00013204344,0.00006929256,0.00007992771,0.00006789415,0.95895344,0.0012049956,0.010792655,0.0020990747,0.025729332],"study_design_scores_gemma":[0.000047308702,0.00011163534,0.00029241334,0.000016988988,0.000040885498,0.000025838865,0.000052424224,0.9830041,0.00085403555,0.0147782685,0.0007648954,0.000011077762],"about_ca_topic_score_codex":0.010328152,"about_ca_topic_score_gemma":0.008547979,"teacher_disagreement_score":0.010328152,"about_ca_system_score_codex":0.0029515112,"about_ca_system_score_gemma":0.0038825118,"threshold_uncertainty_score":0.027355433},"labels":[],"label_agreement":null},{"id":"W1979353897","doi":"10.1007/s10479-011-0850-2","title":"A new column generation algorithm for Logical Analysis of Data","year":2011,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Machine Learning and Algorithms","field":"Computer Science","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Theory of computation; Computer science; Column (typography); Column generation; Algorithm; Mathematics; Mathematical optimization","score_opus":0.6416303804554536,"score_gpt":0.5226771941018385,"score_spread":0.11895318635361507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979353897","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.0019264203,0.00013320903,0.99468094,0.00012713572,0.000081484664,0.00008601942,0.00025254415,0.0022412986,0.0004708926],"genre_scores_gemma":[0.018835582,0.000107452324,0.97819126,0.00014263358,0.00010572733,0.00015792013,0.0009065794,0.0002910055,0.001262007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998102,0.00040040846,0.00020424071,0.00036627706,0.0007975222,0.00012951427],"domain_scores_gemma":[0.9949839,0.002600197,0.00022343792,0.00078900246,0.0012413509,0.00016206279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019700984,0.0014799619,0.0014086195,0.004418987,0.0011012906,0.002734556,0.002229777,0.0010135025,0.010395837],"category_scores_gemma":[0.009030148,0.0007665348,0.0019433877,0.0038478752,0.0009653102,0.0032493656,0.0021798685,0.0026799352,0.0036541389],"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.00037680633,0.00019890166,0.0012772505,0.00025124397,0.00012704018,0.000187853,0.000115110626,0.025851974,0.011240008,0.025748942,0.023635559,0.9109893],"study_design_scores_gemma":[0.00014140125,0.0001370478,0.00051014114,0.000059618826,0.00011540624,0.00035358962,0.000060557046,0.8991768,0.010923569,0.075378545,0.013085638,0.00005766437],"about_ca_topic_score_codex":0.0028239794,"about_ca_topic_score_gemma":0.0043469486,"teacher_disagreement_score":0.010395837,"about_ca_system_score_codex":0.00089409074,"about_ca_system_score_gemma":0.0024663752,"threshold_uncertainty_score":0.034777522},"labels":[],"label_agreement":null},{"id":"W1979700544","doi":"10.1023/b:anor.0000032576.73681.29","title":"Solving VRPTWs with Constraint Programming Based Column Generation","year":2004,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":84,"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":"Column generation; Constraint programming; Theory of computation; Mathematical optimization; Computer science; Scheduling (production processes); Concurrent constraint logic programming; Constraint logic programming; Constraint satisfaction; Constraint (computer-aided design); Directed graph; Directed acyclic graph; Mathematics; Stochastic programming; Algorithm; Artificial intelligence","score_opus":0.20972328302259866,"score_gpt":0.42493952686567527,"score_spread":0.2152162438430766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979700544","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.020581994,0.00018798336,0.9709057,0.00020918326,0.00009103416,0.0002529817,0.0005194943,0.0012165956,0.006034958],"genre_scores_gemma":[0.19889842,0.00015832022,0.7941733,0.0001863235,0.000060606446,0.00046850386,0.0010974986,0.0004191743,0.0045377784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931526,0.0002473456,0.00003341848,0.00013094774,0.00015393038,0.00011912061],"domain_scores_gemma":[0.9978289,0.0015985462,0.00012381544,0.00013898606,0.00025736782,0.000052373583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083034125,0.0014235278,0.0015074271,0.0010511556,0.0006428671,0.0013855881,0.0018589203,0.0014399079,0.013145671],"category_scores_gemma":[0.0031409883,0.0013774728,0.0014400498,0.002116656,0.00062796025,0.0013677907,0.0010066048,0.0019275693,0.0010564659],"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.00007999709,0.000116841606,0.00023594215,0.00017254884,0.000040923875,0.00009612934,0.000032236447,0.92685235,0.0016005661,0.004524904,0.0032506466,0.06299689],"study_design_scores_gemma":[0.000024354316,0.00003335065,0.000041394993,0.00000556753,0.000008283468,0.000014166365,0.000015807052,0.99633455,0.000705174,0.0023319565,0.00048015785,0.00000525548],"about_ca_topic_score_codex":0.015585183,"about_ca_topic_score_gemma":0.017622905,"teacher_disagreement_score":0.015585183,"about_ca_system_score_codex":0.0006724345,"about_ca_system_score_gemma":0.0020345002,"threshold_uncertainty_score":0.043976724},"labels":[],"label_agreement":null},{"id":"W1980402561","doi":"10.1007/s10479-007-0170-8","title":"The dial-a-ride problem: models and algorithms","year":2007,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":866,"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":"Theory of computation; Computer science; Pickup; Set (abstract data type); Algorithm; Plan (archaeology); Operations research; Mathematical optimization; Artificial intelligence; Mathematics; Image (mathematics); Programming language","score_opus":0.22324015215530751,"score_gpt":0.43758322828918544,"score_spread":0.21434307613387793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980402561","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.059100367,0.01769662,0.8856581,0.012878335,0.0006506334,0.00041483852,0.0027136588,0.0004780927,0.020409236],"genre_scores_gemma":[0.7053002,0.021251604,0.213837,0.0013661311,0.0017855013,0.0011318321,0.0037382585,0.00045207166,0.05113747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664485,0.001662584,0.00012109902,0.000857725,0.0002586315,0.00045515175],"domain_scores_gemma":[0.98216003,0.0144678885,0.0012721716,0.0005783373,0.00062037364,0.0009010945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005504806,0.0026162884,0.0067568426,0.0027520547,0.0022332699,0.008922808,0.008091384,0.009627685,0.013710114],"category_scores_gemma":[0.024198323,0.0029904821,0.002674738,0.006479082,0.0050605503,0.014828723,0.0042945873,0.0072545996,0.001636959],"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.00026384785,0.00039986474,0.0014566866,0.00047623823,0.00017630868,0.0001606819,0.00023190993,0.5600021,0.0001199182,0.3773781,0.030523526,0.028810851],"study_design_scores_gemma":[0.00009161309,0.00003721289,0.00020279364,0.00006252262,0.00006162243,0.00006808496,0.00015236664,0.67720526,0.00006227904,0.3182221,0.0037961837,0.000037889855],"about_ca_topic_score_codex":0.019473007,"about_ca_topic_score_gemma":0.014418564,"teacher_disagreement_score":0.019473007,"about_ca_system_score_codex":0.0046476987,"about_ca_system_score_gemma":0.0039689546,"threshold_uncertainty_score":0.04586488},"labels":[],"label_agreement":null},{"id":"W1980455964","doi":"10.1007/s10479-013-1412-6","title":"Scheduling policies for a repair shop problem","year":2013,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Magna International (Canada)","funders":"","keywords":"Theory of computation; Computer science; Job shop scheduling; Scheduling (production processes); Operations research; Flow shop scheduling; Mathematical optimization; Mathematics; Algorithm; Schedule; Operating system","score_opus":0.1616624709572598,"score_gpt":0.41351088715963524,"score_spread":0.2518484162023754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980455964","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.15827927,0.0017534918,0.82171315,0.0022981744,0.0003710753,0.00039844675,0.00044960654,0.0004914711,0.014245335],"genre_scores_gemma":[0.8438669,0.0016031503,0.14520933,0.00020260325,0.00032549276,0.00026307572,0.0003785943,0.00017944844,0.007971377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987459,0.000630915,0.000072968476,0.00016189828,0.00018259081,0.00020568038],"domain_scores_gemma":[0.99446315,0.003942062,0.00042600933,0.00029944986,0.00035486426,0.0005144572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034742614,0.0010446372,0.001868947,0.0011701521,0.0007723622,0.0019597982,0.0017640642,0.0015815189,0.0041269856],"category_scores_gemma":[0.0076970416,0.00093859294,0.00086353504,0.0010717241,0.0010852809,0.0024167912,0.0011981985,0.0021255093,0.0005204473],"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.00044735384,0.0002284084,0.00040781815,0.00024744577,0.00005414212,0.00015049163,0.00014915598,0.89687854,0.0025582588,0.07128308,0.0033842237,0.02421105],"study_design_scores_gemma":[0.00008423144,0.00010781053,0.00012880327,0.000022013543,0.00002191691,0.000035291185,0.00003978132,0.9565542,0.00046102738,0.0414706,0.0010612056,0.000013055347],"about_ca_topic_score_codex":0.0022540318,"about_ca_topic_score_gemma":0.001465461,"teacher_disagreement_score":0.0041269856,"about_ca_system_score_codex":0.0014288675,"about_ca_system_score_gemma":0.0019306027,"threshold_uncertainty_score":0.018373907},"labels":[],"label_agreement":null},{"id":"W1982514240","doi":"10.1007/s10479-014-1784-2","title":"Close integration of pricing and supply chain decisions has strategic as well as operations level benefits","year":2015,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Supply chain; Business; Supply chain management; Revenue; Industrial organization; Strategic sourcing; Production (economics); Revenue management; Marketing; Quality (philosophy); Strategic planning; Process management; Strategic financial management; Microeconomics; Economics","score_opus":0.5014485031989758,"score_gpt":0.42329310173989737,"score_spread":0.07815540145907846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982514240","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.5948928,0.0018644141,0.34607607,0.00278865,0.000501185,0.0003434381,0.0002135425,0.0015810707,0.051738806],"genre_scores_gemma":[0.96008176,0.00033641615,0.032209244,0.00035141944,0.00026205988,0.00006788567,0.0003235881,0.00017141948,0.0061961315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99137455,0.0036071797,0.00052958867,0.0010191668,0.0025650563,0.0009044951],"domain_scores_gemma":[0.96328604,0.018825611,0.0050203665,0.00710481,0.0037637507,0.0019993857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006747127,0.0012246526,0.0020476563,0.00180769,0.0011076765,0.008386047,0.0013704749,0.0028500098,0.0071815113],"category_scores_gemma":[0.031836376,0.0012199507,0.0013679139,0.0033538407,0.0014662343,0.010190828,0.006338492,0.0055666533,0.0027541511],"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.00375946,0.010996438,0.098592535,0.00037448353,0.0010576578,0.00088815024,0.0016022221,0.13245223,0.03707297,0.05302378,0.0025982687,0.6575818],"study_design_scores_gemma":[0.00046063465,0.004304821,0.15587826,0.00016793175,0.00082179595,0.00078482606,0.0030672199,0.55683595,0.01847393,0.24641265,0.012510015,0.00028184764],"about_ca_topic_score_codex":0.0019824272,"about_ca_topic_score_gemma":0.001909586,"teacher_disagreement_score":0.008386047,"about_ca_system_score_codex":0.0011420812,"about_ca_system_score_gemma":0.0019928322,"threshold_uncertainty_score":0.03568262},"labels":[],"label_agreement":null},{"id":"W1982561848","doi":"10.1007/s10479-013-1391-7","title":"Smoothing and parametric rules for stochastic mean-CVaR optimal execution strategy","year":2013,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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":"CVAR; Mathematical optimization; Computer science; Downside risk; Expected shortfall; Smoothing; Parametric statistics; Theory of computation; Portfolio; Discretization; Representation (politics); Algorithm; Mathematics","score_opus":0.4890830016918179,"score_gpt":0.5419786120347316,"score_spread":0.052895610342913735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982561848","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.022180408,0.00020745683,0.97503114,0.00018215107,0.000034049048,0.000044091827,0.00006911974,0.00023583726,0.0020158172],"genre_scores_gemma":[0.7218049,0.000506456,0.27085814,0.00015784033,0.00012585749,0.00029045765,0.00035498233,0.0002997258,0.005601565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954947,0.0017919005,0.0003891806,0.00070962805,0.0011479022,0.00046665367],"domain_scores_gemma":[0.9446728,0.044556376,0.0023928224,0.003863704,0.003701759,0.0008125601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012272558,0.0010202787,0.0027692663,0.0021455635,0.00078891474,0.0031400884,0.0030058774,0.0021062081,0.0037944068],"category_scores_gemma":[0.06330457,0.0013623902,0.0019006667,0.0016033661,0.0021053725,0.0042830114,0.0020378015,0.004437987,0.0006786637],"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.00014240821,0.00008051806,0.0012452799,0.00006410246,0.000071568225,0.00011413449,0.00014330672,0.746834,0.000959675,0.20773697,0.0010591407,0.041548967],"study_design_scores_gemma":[0.000008897965,0.000021765689,0.00020919257,0.000016121603,0.000011996701,0.000025690162,0.000008580568,0.92533267,0.00035599837,0.07370805,0.00028045804,0.00002062057],"about_ca_topic_score_codex":0.0034707617,"about_ca_topic_score_gemma":0.0029161368,"teacher_disagreement_score":0.012272558,"about_ca_system_score_codex":0.0012701802,"about_ca_system_score_gemma":0.0017552226,"threshold_uncertainty_score":0.06490421},"labels":[],"label_agreement":null},{"id":"W1982713086","doi":"10.1007/s10479-014-1652-0","title":"Decentralized stochastic control","year":2014,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Game Theory and Applications","field":"Decision Sciences","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":"McGill University","funders":"","keywords":"Theory of computation; Decentralization; Decentralised system; Computer science; Control (management); State (computer science); Stochastic control; Mathematical optimization; Optimal control; Distributed computing; Mathematics; Artificial intelligence; Economics; Algorithm","score_opus":0.5710642858031221,"score_gpt":0.6010051164305524,"score_spread":0.02994083062743036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982713086","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.041715175,0.0010134679,0.8642526,0.003814974,0.0007707797,0.00007052256,0.00028960858,0.0003844092,0.08768844],"genre_scores_gemma":[0.9380882,0.00073706295,0.023497077,0.00026828513,0.0003980258,0.000110643465,0.00015934117,0.00007064601,0.03667081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924904,0.00023031025,0.000028494236,0.00017208085,0.00024340022,0.00007667281],"domain_scores_gemma":[0.99890363,0.00049700117,0.00014754516,0.0001510526,0.00022972445,0.00007103242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082469,0.0005497364,0.00091637875,0.00044371348,0.0004840375,0.0014721805,0.0005524942,0.0008227281,0.0068264375],"category_scores_gemma":[0.0037813007,0.00028030985,0.00047943543,0.00058834575,0.0012543525,0.0009505384,0.0010142674,0.0011343446,0.0006325235],"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.00007709647,0.000065731314,0.000352493,0.00006540116,0.000043219905,0.00004766629,0.000040702565,0.17697775,0.0019904946,0.7797121,0.0075748623,0.03305252],"study_design_scores_gemma":[0.000038334365,0.00004934436,0.00037097355,0.000013380447,0.000017194916,0.00003356698,0.000015462509,0.6155424,0.0005286446,0.37571248,0.007664147,0.000014100758],"about_ca_topic_score_codex":0.0017743829,"about_ca_topic_score_gemma":0.001380713,"teacher_disagreement_score":0.0068264375,"about_ca_system_score_codex":0.0013239603,"about_ca_system_score_gemma":0.0014628127,"threshold_uncertainty_score":0.022836685},"labels":[],"label_agreement":null},{"id":"W1983758874","doi":"10.1007/s10479-011-0895-2","title":"The orienteering problem with stochastic travel and service times","year":2011,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":133,"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":"Orienteering; Heuristics; Theory of computation; Computer science; Variety (cybernetics); Service (business); Mathematical optimization; Operations research; Stochastic programming; Mathematics; Marketing; Artificial intelligence; Algorithm; Business","score_opus":0.17549393651751152,"score_gpt":0.38041133706969343,"score_spread":0.2049174005521819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983758874","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.16173792,0.0030648902,0.8142257,0.0025104189,0.00032953985,0.0001532626,0.001005922,0.00016870743,0.016803592],"genre_scores_gemma":[0.8773285,0.003968256,0.08359415,0.00031844288,0.00049988664,0.00026564798,0.0010309209,0.00023257875,0.032761622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800175,0.0009889746,0.000084624124,0.0004146733,0.0002216185,0.00028832394],"domain_scores_gemma":[0.9957106,0.0029857685,0.00051274116,0.00018159825,0.00020360161,0.0004057126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034242317,0.0021181027,0.0034777068,0.001400557,0.00077535294,0.003553169,0.0033928747,0.0038298285,0.0054566604],"category_scores_gemma":[0.010527407,0.001974616,0.001848882,0.0030655246,0.0026325905,0.0056070895,0.0021172352,0.002786243,0.00044571908],"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.00021053568,0.000111370886,0.0009691207,0.00016528352,0.00013381583,0.0003026266,0.00009461267,0.79861903,0.00051230507,0.1856818,0.0025307075,0.010668754],"study_design_scores_gemma":[0.00005686886,0.00005543284,0.00036372003,0.000016583117,0.000050481663,0.00007206696,0.00006492485,0.9073625,0.00013161439,0.09019136,0.0016012315,0.00003321632],"about_ca_topic_score_codex":0.017741999,"about_ca_topic_score_gemma":0.008087217,"teacher_disagreement_score":0.017741999,"about_ca_system_score_codex":0.002939046,"about_ca_system_score_gemma":0.0020336485,"threshold_uncertainty_score":0.035277486},"labels":[],"label_agreement":null},{"id":"W1985128506","doi":"10.1007/s10479-013-1326-3","title":"The impact of customer returns on supply chain decisions under various channel interactions","year":2013,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":37,"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; University of Winnipeg","funders":"","keywords":"Stackelberg competition; Supply chain; Business; Channel (broadcasting); Microeconomics; Information sharing; Industrial organization; Product (mathematics); Marketing; Economics; Computer science; Telecommunications; Mathematics","score_opus":0.20288464210705257,"score_gpt":0.4248238100277004,"score_spread":0.22193916792064786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985128506","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.99596053,0.000076595665,0.0007326972,0.00017043155,0.000008753796,0.000009187978,0.00008383092,0.000011613718,0.0029462946],"genre_scores_gemma":[0.9991586,0.000041195202,0.000083250176,0.000010907255,0.0000060772254,0.0000025104994,0.000027694367,0.000004002893,0.00066579634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763215,0.0008007892,0.0000659629,0.00016851175,0.00022851031,0.0011040721],"domain_scores_gemma":[0.9430592,0.050076246,0.0020862238,0.00062056736,0.0020765136,0.002081225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043021957,0.0004212686,0.0006319793,0.00074997946,0.00072492764,0.0038053037,0.0006507821,0.00118709,0.009892369],"category_scores_gemma":[0.018700987,0.00037935184,0.00056969526,0.00094090484,0.0009823153,0.0024021594,0.00081854523,0.0014560645,0.00049836363],"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.018242115,0.0028331897,0.19469896,0.0002457283,0.00048129715,0.0017555944,0.000833635,0.6975755,0.011761301,0.022463936,0.0022962235,0.0468125],"study_design_scores_gemma":[0.00036120924,0.0031253127,0.22038826,0.00006509941,0.0010889043,0.000329609,0.004509382,0.74612445,0.0074355933,0.015270504,0.0010821164,0.00021965269],"about_ca_topic_score_codex":0.007992103,"about_ca_topic_score_gemma":0.009370105,"teacher_disagreement_score":0.009892369,"about_ca_system_score_codex":0.001779256,"about_ca_system_score_gemma":0.0017281207,"threshold_uncertainty_score":0.033093274},"labels":[],"label_agreement":null},{"id":"W1985987363","doi":"10.1007/s10479-010-0753-7","title":"Introduction to the special issue on Advances in Manufacturing Systems","year":2010,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","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":"York University","funders":"","keywords":"Theory of computation; Operations research; Head (geology); Library science; Volume (thermodynamics); Engineering management; Management; Computer science; Engineering; Economics; Physics","score_opus":0.050480596408346456,"score_gpt":0.3776737893975814,"score_spread":0.32719319298923494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985987363","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055969175,0.14271933,0.010538198,0.029238472,0.6876627,0.00011253314,0.0011014726,0.0004425103,0.1276251],"genre_scores_gemma":[0.0050855926,0.09425547,0.004005993,0.009815543,0.667373,0.00012316788,0.0014949385,0.00055610563,0.21729022],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99829894,0.00024839773,0.00017108848,0.00034926573,0.0007962324,0.00013596077],"domain_scores_gemma":[0.9953761,0.0017981831,0.00028693644,0.00048405174,0.0013277541,0.0007269249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018753838,0.002098869,0.0021874364,0.0043927724,0.0013321444,0.0055407346,0.0015781403,0.0024690842,0.10694426],"category_scores_gemma":[0.0054067923,0.0005694958,0.0014999654,0.0039254236,0.0010144139,0.0038940276,0.001838358,0.004739195,0.049633782],"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.000016315145,0.000024924599,0.00011888877,0.00029205647,0.00001818202,0.000041852538,0.000025984204,0.00023378183,0.00015622152,0.007267719,0.94180447,0.049999595],"study_design_scores_gemma":[0.0000029776418,0.00002169513,0.00020586024,0.00014065331,0.0000071063546,0.000085797554,0.000014185877,0.0001554202,0.000045396453,0.004820359,0.9944951,0.0000054441743],"about_ca_topic_score_codex":0.00056346715,"about_ca_topic_score_gemma":0.0013800517,"teacher_disagreement_score":0.10694426,"about_ca_system_score_codex":0.0013790808,"about_ca_system_score_gemma":0.0014751456,"threshold_uncertainty_score":0.35776418},"labels":[],"label_agreement":null},{"id":"W1986520459","doi":"10.1007/s10479-005-3445-y","title":"Depth-Optimized Convexity Cuts","year":2005,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","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":"Queen's University","funders":"National Science Foundation","keywords":"Convexity; Theory of computation; Intersection (aeronautics); Mathematics; Set (abstract data type); Computation; Mathematical optimization; Integer programming; Regular polygon; Function (biology); Order (exchange); Convex function; Integer (computer science); Linear programming; Algorithm; Computer science; Geometry","score_opus":0.24676143754847643,"score_gpt":0.4702200630803455,"score_spread":0.22345862553186904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986520459","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.010841921,0.00076236547,0.96625996,0.0005633207,0.00015994716,0.00014812371,0.00042290892,0.0003883887,0.020453097],"genre_scores_gemma":[0.19718765,0.0014500787,0.7669081,0.00042937236,0.00025528026,0.00053280586,0.0013675916,0.0010065171,0.030862654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986835,0.00045450663,0.000047465986,0.00023664422,0.00040191785,0.00017593823],"domain_scores_gemma":[0.99737215,0.0016507157,0.00017110808,0.00028843404,0.0003665309,0.00015101791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022525694,0.0023907276,0.0025935005,0.0023410467,0.0010859573,0.0028716007,0.0024757443,0.0026824,0.016137565],"category_scores_gemma":[0.008727759,0.0021888379,0.0019304107,0.0024649582,0.0016897002,0.0041872794,0.0033026722,0.0056516705,0.0019530747],"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.00041518174,0.0002052023,0.0006236802,0.000336756,0.00008910687,0.00009670864,0.00015047609,0.4604624,0.003080212,0.29765308,0.029024048,0.20786314],"study_design_scores_gemma":[0.00006177187,0.0000885878,0.00027100707,0.00007913027,0.000038281065,0.00006702704,0.00004263916,0.7873433,0.0015265034,0.20237152,0.008089173,0.000020980475],"about_ca_topic_score_codex":0.0034455145,"about_ca_topic_score_gemma":0.0043944176,"teacher_disagreement_score":0.016137565,"about_ca_system_score_codex":0.0024882464,"about_ca_system_score_gemma":0.0022524323,"threshold_uncertainty_score":0.053985536},"labels":[],"label_agreement":null},{"id":"W1986972052","doi":"10.1007/s10479-008-0380-8","title":"A hierarchical location-allocation model with travel based on expected referral distances","year":2008,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":21,"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":"Irrationality; Irrational number; Travel time; Theory of computation; Computer science; Travel behavior; Referral; Location-allocation; Facility location problem; Operations research; Mathematics; Microeconomics; Economics; Transport engineering; Rationality; Algorithm; Medicine; Engineering","score_opus":0.2675221041792846,"score_gpt":0.45042250610904716,"score_spread":0.18290040192976253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986972052","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.15464775,0.0009513162,0.82076705,0.004118125,0.00025707457,0.00043616028,0.0028062733,0.00091963663,0.015096563],"genre_scores_gemma":[0.91186625,0.00067528116,0.054537777,0.0003179361,0.0001691371,0.00040831472,0.0008725272,0.00013860052,0.031014157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973008,0.0011569523,0.00009890433,0.00061540335,0.00022999324,0.0005979155],"domain_scores_gemma":[0.9956102,0.0026336345,0.00048408846,0.0002302726,0.00048289262,0.0005588406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036769346,0.001465542,0.003998257,0.0021916262,0.0013197698,0.003722773,0.006235728,0.0048556407,0.013741985],"category_scores_gemma":[0.0073299254,0.0024524014,0.0019839099,0.00453715,0.002110704,0.0041497815,0.0022384536,0.0025366526,0.0022593753],"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.00012801966,0.000082977946,0.0007050099,0.000046721234,0.000046901234,0.000102305516,0.000056573306,0.96921736,0.00022664873,0.023862295,0.0013051786,0.0042200563],"study_design_scores_gemma":[0.000038284084,0.000031883697,0.00019719772,0.0000060302223,0.000020857098,0.00002576589,0.000021533835,0.99275345,0.0000332615,0.006599346,0.0002580557,0.000014196366],"about_ca_topic_score_codex":0.030394044,"about_ca_topic_score_gemma":0.021027926,"teacher_disagreement_score":0.030394044,"about_ca_system_score_codex":0.0050488096,"about_ca_system_score_gemma":0.0031861614,"threshold_uncertainty_score":0.06043428},"labels":[],"label_agreement":null},{"id":"W1987959344","doi":"10.1007/s10479-005-2041-5","title":"A Continuous Location-Allocation Problem with Zone-Dependent Fixed Cost","year":2005,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":37,"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; Group for Research in Decision Analysis","funders":"","keywords":"Theory of computation; Mathematical optimization; Fixed cost; Computer science; Mathematics; Algorithm; Economics; Microeconomics","score_opus":0.14117281700540285,"score_gpt":0.37634040909043937,"score_spread":0.23516759208503651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987959344","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.18746011,0.0028353345,0.777159,0.004270159,0.00046201443,0.0005465683,0.0023263416,0.0005055861,0.024435017],"genre_scores_gemma":[0.91283804,0.000886888,0.07108436,0.00020047405,0.00023054384,0.00037922378,0.000678194,0.00012644162,0.013575916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744487,0.0011781936,0.00009051125,0.00051386055,0.0002723864,0.00050015794],"domain_scores_gemma":[0.99138266,0.0069169896,0.00042318512,0.00021671261,0.0004268456,0.0006336252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038121084,0.0021174306,0.004729105,0.0019158645,0.0011669286,0.005256814,0.005534028,0.007332556,0.012196757],"category_scores_gemma":[0.010439031,0.0027539546,0.0017646966,0.0038978187,0.0026291409,0.0052397065,0.0027444775,0.0032577761,0.0007245033],"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.00035460596,0.000143882,0.000501999,0.0002326439,0.00008450033,0.00026296623,0.00007422971,0.95850295,0.0004529255,0.029170468,0.0026305916,0.0075882305],"study_design_scores_gemma":[0.0001585825,0.000107709726,0.00026567982,0.000024541496,0.000047632493,0.00008264907,0.00007195825,0.9823774,0.00012307959,0.01590148,0.00080601074,0.00003324818],"about_ca_topic_score_codex":0.012922637,"about_ca_topic_score_gemma":0.007231261,"teacher_disagreement_score":0.012922637,"about_ca_system_score_codex":0.0039459933,"about_ca_system_score_gemma":0.002145346,"threshold_uncertainty_score":0.04080218},"labels":[],"label_agreement":null},{"id":"W1994221629","doi":"10.1007/s10479-013-1450-0","title":"Using mixed integer programming models to synchronously determine production levels and market prices in an integrated market for roundwood and forest biomass","year":2013,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Forest Management and Policy","field":"Environmental 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":"Université Laval","funders":"","keywords":"Procurement; Supply chain; Theory of computation; Computer science; Production (economics); Mathematical optimization; Market price; Linear programming; Integer programming; Operations research; Economics; Microeconomics; Mathematics; Business; Marketing; Algorithm","score_opus":0.24368799431871346,"score_gpt":0.4142678343128243,"score_spread":0.17057983999411086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994221629","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.2737949,0.00013680561,0.7192978,0.00049648253,0.00007385482,0.00019998867,0.00032746026,0.0003860836,0.0052866424],"genre_scores_gemma":[0.8955612,0.000070500166,0.09977088,0.00007142643,0.0000344895,0.00023722732,0.00022573504,0.00008098732,0.0039475723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990721,0.00043997288,0.000038446455,0.0001956375,0.000110263456,0.00014347886],"domain_scores_gemma":[0.9871379,0.011404441,0.00073183817,0.00016376538,0.00034025457,0.00022183101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037208656,0.001088188,0.001087389,0.00077204884,0.0005979506,0.002687758,0.0016357446,0.0015800588,0.0039903237],"category_scores_gemma":[0.012539063,0.002315991,0.0012119688,0.00084429036,0.0009976912,0.0032223738,0.0012774288,0.0020253179,0.00029699501],"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.000164172,0.00010183188,0.0011196363,0.000020805173,0.000039286762,0.000044307482,0.000027554204,0.9864531,0.00036815557,0.0057656346,0.00018994676,0.0057054944],"study_design_scores_gemma":[0.000012443883,0.000011951813,0.00006185886,8.135243e-7,0.00000529149,0.0000017473762,0.000005027965,0.9982008,0.000105118655,0.0015625925,0.000029569628,0.000002715746],"about_ca_topic_score_codex":0.015571084,"about_ca_topic_score_gemma":0.021390283,"teacher_disagreement_score":0.015571084,"about_ca_system_score_codex":0.0020176116,"about_ca_system_score_gemma":0.0025778704,"threshold_uncertainty_score":0.030960917},"labels":[],"label_agreement":null},{"id":"W1994932713","doi":"10.1007/s10479-008-0481-4","title":"A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem","year":2008,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":55,"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":"Direktion für Entwicklung und Zusammenarbeit","keywords":"Mathematics; Semidefinite programming; Rounding; Partition (number theory); Combinatorics; Hyperplane; Disjoint sets; Algorithm; Graph partition; Maximum cut; Partition problem; Branch and cut; Integer programming; Graph; Computer science; Mathematical optimization","score_opus":0.2635310348025377,"score_gpt":0.4164277997338451,"score_spread":0.15289676493130738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994932713","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.013688306,0.00015296708,0.98049015,0.0003902175,0.00007794435,0.00012738873,0.00012470628,0.00042588307,0.004522387],"genre_scores_gemma":[0.114117816,0.00020767337,0.88071084,0.00020820026,0.00008845768,0.00038815572,0.0005649176,0.0003077759,0.0034060734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912244,0.0003297583,0.00004108178,0.00018684813,0.00021618119,0.00010369737],"domain_scores_gemma":[0.99770576,0.0015330596,0.00013576625,0.00019744117,0.000247069,0.00018090165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014514538,0.0014402234,0.0026708446,0.0011831411,0.0012459803,0.0021084987,0.0023938208,0.002014278,0.007648276],"category_scores_gemma":[0.0047172634,0.0011478584,0.0012510475,0.0018801473,0.0010941905,0.00302576,0.0024082975,0.0039214506,0.0013530937],"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.00063444156,0.0007815122,0.0005863391,0.00034683628,0.00011929265,0.00013940714,0.00022377858,0.5308565,0.0052375635,0.12065086,0.020495309,0.3199282],"study_design_scores_gemma":[0.000098553304,0.00008005093,0.000077690056,0.000018483723,0.000017543132,0.00004659455,0.000025200246,0.94717896,0.0006394323,0.050705492,0.0010975982,0.000014433546],"about_ca_topic_score_codex":0.0022038019,"about_ca_topic_score_gemma":0.0034908112,"teacher_disagreement_score":0.007648276,"about_ca_system_score_codex":0.0011593302,"about_ca_system_score_gemma":0.002449812,"threshold_uncertainty_score":0.025586069},"labels":[],"label_agreement":null},{"id":"W1996637843","doi":"10.1007/s10479-006-0067-y","title":"Multiobjective design of survivable IP networks","year":2006,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Data Processing Techniques","field":"Engineering","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":"Engineering Link (Canada)","funders":"Vetenskapsrådet","keywords":"Computer network; Private Network-to-Network Interface; Computer science; Open Shortest Path First; Constrained Shortest Path First; Shortest path problem; Routing protocol; Survivability; Distributed computing; IP forwarding; Routing (electronic design automation); Internet Protocol; The Internet; Link-state routing protocol; K shortest path routing; Graph","score_opus":0.20657839439451176,"score_gpt":0.435748254671344,"score_spread":0.22916986027683223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996637843","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.086134814,0.0005780885,0.90156764,0.00042672327,0.00007643568,0.00016690376,0.00015349172,0.0001360563,0.0107599115],"genre_scores_gemma":[0.87006253,0.00070795126,0.12099061,0.00012543472,0.00006353267,0.0004296389,0.00017570665,0.000092239505,0.0073522953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994399,0.00026780186,0.000018324354,0.000069037764,0.00010811117,0.00009679071],"domain_scores_gemma":[0.9990288,0.000588826,0.00013799709,0.000028830693,0.00014759025,0.00006794706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001573011,0.0014389649,0.001094715,0.001067826,0.00042248596,0.0011916562,0.0011801987,0.0013020062,0.0025671877],"category_scores_gemma":[0.0028721772,0.0008283115,0.0006780477,0.0006840814,0.000690177,0.0009319866,0.0010542705,0.00076467113,0.00024445972],"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.000015176306,0.000014859256,0.00007863201,0.000023664274,0.000014279626,0.000019286075,0.000009448784,0.9933717,0.0003103009,0.001717232,0.00011232396,0.004313127],"study_design_scores_gemma":[0.0000068898316,0.000030717274,0.000038437884,0.0000052158866,0.0000066892694,0.000005972868,0.000008591371,0.99743396,0.00012413891,0.0021488674,0.00018851548,0.000002056334],"about_ca_topic_score_codex":0.0024913468,"about_ca_topic_score_gemma":0.0019262641,"teacher_disagreement_score":0.0025671877,"about_ca_system_score_codex":0.001123167,"about_ca_system_score_gemma":0.00094268145,"threshold_uncertainty_score":0.008588135},"labels":[],"label_agreement":null},{"id":"W1998172110","doi":"10.1007/s10479-005-5732-z","title":"Basis Function Adaptation in Temporal Difference Reinforcement Learning","year":2005,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":190,"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":"Reinforcement learning; Markov decision process; Bellman equation; Temporal difference learning; Basis function; Function approximation; Mathematical optimization; Basis (linear algebra); Computer science; Theory of computation; Q-learning; Convergence (economics); Markov process; Mathematics; Artificial intelligence; Algorithm; Artificial neural network","score_opus":0.22553966350065155,"score_gpt":0.41189285311802815,"score_spread":0.1863531896173766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998172110","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.029049708,0.00060603366,0.9670018,0.00036145447,0.00012617817,0.000021962138,0.000021535607,0.00009687037,0.002714414],"genre_scores_gemma":[0.88729393,0.00065115234,0.1028082,0.00019248761,0.00011745542,0.00017652474,0.00006666827,0.00008739467,0.008606263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950457,0.00024576212,0.000024539992,0.00007739335,0.00009781486,0.000049900995],"domain_scores_gemma":[0.9972149,0.0021732536,0.000103482904,0.000116297924,0.00030950175,0.00008235032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021569652,0.00046280693,0.0010366007,0.00029961832,0.00031064515,0.00080354477,0.0011975305,0.0012773193,0.0024812284],"category_scores_gemma":[0.007963539,0.0004517107,0.0003984519,0.00048199922,0.0011567572,0.0014104607,0.0010041799,0.0017932414,0.00024479488],"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.00014934162,0.00009672557,0.00050531497,0.00007805336,0.00005136018,0.00004578877,0.0000649386,0.8295184,0.0015981379,0.103106715,0.0012621916,0.063523024],"study_design_scores_gemma":[0.000007551465,0.000012140875,0.00003912542,0.0000023088326,0.0000031434936,0.000004201376,0.0000019761324,0.98559546,0.00010637573,0.014095197,0.0001297879,0.0000027532728],"about_ca_topic_score_codex":0.0037365952,"about_ca_topic_score_gemma":0.0020765471,"teacher_disagreement_score":0.0037365952,"about_ca_system_score_codex":0.0007637889,"about_ca_system_score_gemma":0.00084502716,"threshold_uncertainty_score":0.0114071965},"labels":[],"label_agreement":null},{"id":"W1998193115","doi":"10.1007/s10479-010-0715-0","title":"Using local search to speed up filtering algorithms for some NP-hard constraints","year":2010,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","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":"Polytechnique Montréal","funders":"","keywords":"Theory of computation; Local search (optimization); Algorithm; Computer science; Local consistency; Filter (signal processing); Consistency (knowledge bases); Computational complexity theory; Graph; Search tree; Search algorithm; Substructure; Constraint (computer-aided design); Guided Local Search; Mathematical optimization; Mathematics; Constraint satisfaction problem; Theoretical computer science; Artificial intelligence","score_opus":0.40089166799307197,"score_gpt":0.5075783819447462,"score_spread":0.10668671395167428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998193115","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.013016383,0.00035517104,0.98303115,0.00027654285,0.0001160257,0.000078401725,0.000058370606,0.0008400739,0.002227874],"genre_scores_gemma":[0.23769702,0.00032022368,0.75383025,0.00047711597,0.0002045971,0.00047978133,0.00038890986,0.00045909747,0.0061429436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882287,0.00040273962,0.000066347995,0.00023377492,0.00029679865,0.00017748703],"domain_scores_gemma":[0.9866812,0.011651039,0.000361948,0.00049045176,0.00064987375,0.0001654682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039036514,0.0017916859,0.0025537421,0.0018821231,0.001059999,0.0017900901,0.0020231332,0.0031001994,0.008754753],"category_scores_gemma":[0.015334178,0.0014506979,0.0015309724,0.0017837536,0.0012533977,0.003718213,0.001500597,0.0031960253,0.0012458699],"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.00028192071,0.00027914383,0.0006054217,0.0002592654,0.00009278052,0.00012836195,0.000114650626,0.8211501,0.0019861874,0.017084291,0.0076628844,0.15035482],"study_design_scores_gemma":[0.000034527333,0.000028852819,0.00003897949,0.000008396808,0.000011283194,0.0000118642765,0.000008383487,0.99411184,0.00032507748,0.0051065134,0.0003102003,0.0000040620894],"about_ca_topic_score_codex":0.0085495515,"about_ca_topic_score_gemma":0.010717054,"teacher_disagreement_score":0.008754753,"about_ca_system_score_codex":0.0012664299,"about_ca_system_score_gemma":0.0019980967,"threshold_uncertainty_score":0.029287577},"labels":[],"label_agreement":null},{"id":"W1999858663","doi":"10.1007/s10479-014-1651-1","title":"A stochastic semidefinite programming approach for bounds on option pricing under regime switching","year":2014,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","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":"Semidefinite programming; Upper and lower bounds; Mathematical optimization; Stochastic programming; Mathematics; Theory of computation; Bounded function; Markov chain; Controllability; Dynamic programming; Applied mathematics; Algorithm","score_opus":0.24383301383273573,"score_gpt":0.39031142941572866,"score_spread":0.14647841558299293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999858663","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.004161459,0.0007142362,0.98806715,0.00079172367,0.00020052398,0.000051325933,0.00014165073,0.000110579866,0.005761374],"genre_scores_gemma":[0.4434293,0.0040670824,0.5180716,0.0014667715,0.0020728337,0.0012838423,0.0011766113,0.0010402335,0.027391762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958835,0.0024851288,0.0001550402,0.0004673787,0.0007455411,0.0002632884],"domain_scores_gemma":[0.97516984,0.020476611,0.00083311304,0.0009918176,0.0016591406,0.00086945103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009969153,0.0038827814,0.0037772628,0.0021694512,0.0009914784,0.00486745,0.0034698332,0.0038231958,0.010543424],"category_scores_gemma":[0.02667069,0.0026290608,0.002928636,0.002618854,0.0041167447,0.0067321598,0.0039946013,0.0098412195,0.0010625077],"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.00009823254,0.00028194452,0.00024925024,0.00026465705,0.00014843284,0.00016638929,0.00015954905,0.43124244,0.0013024741,0.539238,0.0063874302,0.020461172],"study_design_scores_gemma":[0.0000120811565,0.000023350909,0.00003701614,0.000028300205,0.000013763234,0.000014000962,0.000009555104,0.8701281,0.000113758375,0.12899257,0.0006121916,0.000015239453],"about_ca_topic_score_codex":0.0026618303,"about_ca_topic_score_gemma":0.0028902339,"teacher_disagreement_score":0.010543424,"about_ca_system_score_codex":0.0024293475,"about_ca_system_score_gemma":0.0027526661,"threshold_uncertainty_score":0.052722573},"labels":[],"label_agreement":null},{"id":"W1999987607","doi":"10.1007/s10479-014-1527-4","title":"Flow-based integer linear programs to solve the weekly log-truck scheduling problem","year":2014,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"Polytechnique Montréal","funders":"","keywords":"Truck; Theory of computation; Integer programming; Computer science; Scheduling (production processes); Linear programming; Integer (computer science); Mathematical optimization; Operations research; Mathematics; Algorithm; Engineering","score_opus":0.16754097586295918,"score_gpt":0.4287448416465164,"score_spread":0.2612038657835572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999987607","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.02143287,0.00031684968,0.9695052,0.0006047474,0.00014895324,0.00017566989,0.000297335,0.00033789838,0.007180368],"genre_scores_gemma":[0.5002563,0.000728399,0.4810631,0.00033276627,0.00021938678,0.0010731403,0.0008983858,0.00044559166,0.014982961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928313,0.00039525534,0.000024169874,0.00007830068,0.00011428506,0.00010490358],"domain_scores_gemma":[0.9975339,0.0020376265,0.000117381926,0.000051391697,0.00017770162,0.00008201639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002305441,0.0013858937,0.0013370037,0.0013196196,0.0005713985,0.0015156759,0.0016535178,0.001920801,0.0075533255],"category_scores_gemma":[0.005896961,0.0011818621,0.0011538629,0.001641107,0.00068401423,0.0019886484,0.0010494741,0.0026575425,0.00056199834],"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.000046912497,0.00012694456,0.00016202132,0.00003820031,0.000016022346,0.000017492546,0.000019534753,0.9794794,0.00017482415,0.008178113,0.0012793147,0.010461252],"study_design_scores_gemma":[0.000009078443,0.000010769511,0.000017694527,0.0000029278572,0.0000023003404,0.0000016771105,0.000005305231,0.9969015,0.000033161046,0.0028186054,0.00019529123,0.0000016566502],"about_ca_topic_score_codex":0.011482379,"about_ca_topic_score_gemma":0.011693539,"teacher_disagreement_score":0.011482379,"about_ca_system_score_codex":0.001473847,"about_ca_system_score_gemma":0.0025532977,"threshold_uncertainty_score":0.025268435},"labels":[],"label_agreement":null},{"id":"W1999993900","doi":"10.1007/s10479-011-0983-3","title":"An efficient memetic algorithm for the graph partitioning problem","year":2011,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":68,"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":"Memetic algorithm; Crossover; Graph partition; Tabu search; Theory of computation; Computer science; Partition (number theory); Mathematical optimization; Vertex (graph theory); Graph; Operator (biology); Algorithm; Mathematics; Local search (optimization); Theoretical computer science; Combinatorics; Artificial intelligence","score_opus":0.2813694063939959,"score_gpt":0.4229850109156691,"score_spread":0.1416156045216732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999993900","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.039693143,0.00079162425,0.94619477,0.0007724066,0.0002994026,0.00017104278,0.000102569065,0.00050332665,0.011471738],"genre_scores_gemma":[0.2460758,0.00041842647,0.74426395,0.00030449955,0.00015726566,0.0004080116,0.00021831071,0.000111619236,0.008042097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970406,0.00011191445,0.000013522271,0.000043296033,0.00008399144,0.00004321242],"domain_scores_gemma":[0.99954885,0.00026338492,0.000034374792,0.00004836102,0.000080370155,0.00002471427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007007605,0.0007478195,0.00093004975,0.0010411463,0.00076448097,0.00082986197,0.0014521761,0.0013311666,0.0035135748],"category_scores_gemma":[0.0016304983,0.00039832338,0.0006695607,0.0010044125,0.0005130033,0.00093804323,0.0009002931,0.00085051014,0.00050047896],"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.0002925199,0.00025110936,0.0005043678,0.0002008589,0.0001228592,0.00016071642,0.00012634353,0.6127664,0.006587296,0.030340975,0.009958427,0.3386881],"study_design_scores_gemma":[0.00009227756,0.000074778196,0.0001380284,0.000012836401,0.000022447131,0.000082926774,0.000026461525,0.9836321,0.0009113498,0.012380529,0.0026174907,0.000008762067],"about_ca_topic_score_codex":0.0017223557,"about_ca_topic_score_gemma":0.0027394174,"teacher_disagreement_score":0.0035135748,"about_ca_system_score_codex":0.00062329473,"about_ca_system_score_gemma":0.0010848168,"threshold_uncertainty_score":0.011754096},"labels":[],"label_agreement":null},{"id":"W2000873366","doi":"10.1007/s10479-009-0550-3","title":"Portfolio selection using λ mean and hybrid entropy","year":2009,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Fuzzy Systems and Optimization","field":"Mathematics","cited_by":37,"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":"Portfolio; Efficient frontier; Portfolio optimization; Entropy (arrow of time); Mathematical optimization; Theory of computation; Computer science; Fuzzy logic; Econometrics; Modern portfolio theory; Mathematics; Economics; Artificial intelligence; Algorithm; Financial economics","score_opus":0.3411868796934861,"score_gpt":0.496336729978065,"score_spread":0.1551498502845789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000873366","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.11852972,0.0006908494,0.87783724,0.0002387089,0.00006334169,0.000025012772,0.000024119992,0.00009235043,0.0024987666],"genre_scores_gemma":[0.93271446,0.00030120419,0.06456535,0.00006047679,0.00011841119,0.000051082112,0.000044764925,0.000034570843,0.002109645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985763,0.0007685508,0.000067961635,0.00013479819,0.00037139657,0.00008096786],"domain_scores_gemma":[0.9954295,0.0035880373,0.00023813997,0.0002282941,0.00040369172,0.00011228111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00423708,0.00044073944,0.0012762437,0.0014573053,0.0004790362,0.0016596903,0.0007665049,0.0008260297,0.0009561805],"category_scores_gemma":[0.0082470225,0.00050855917,0.00087023806,0.0010698381,0.0007459746,0.0026200053,0.0013333661,0.0006914127,0.000109487075],"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.00036566312,0.00009195431,0.0036930698,0.00009283854,0.00037813463,0.00011415101,0.00006683665,0.8126472,0.002818308,0.0892023,0.00070041034,0.08982914],"study_design_scores_gemma":[0.000016576329,0.000056154597,0.00077932683,0.0000063844577,0.000032507443,0.000027515951,0.0000065076606,0.974774,0.0005119634,0.02361076,0.00016535114,0.000012928522],"about_ca_topic_score_codex":0.0005140442,"about_ca_topic_score_gemma":0.00057782896,"teacher_disagreement_score":0.00423708,"about_ca_system_score_codex":0.00080150174,"about_ca_system_score_gemma":0.0005399905,"threshold_uncertainty_score":0.022408128},"labels":[],"label_agreement":null},{"id":"W2001490112","doi":"10.1007/s10479-010-0813-z","title":"Using size for bounding expressions of graph invariants","year":2010,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Graph Theory Research","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":"HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Bounding overwatch; Vertex (graph theory); Graph; Theory of computation; Upper and lower bounds; Discrete mathematics; Computer science; Algorithm; Mathematical analysis","score_opus":0.41827483331012116,"score_gpt":0.5393114654582573,"score_spread":0.12103663214813609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001490112","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.047388397,0.00069120986,0.9284413,0.0019129687,0.00037040832,0.00013685948,0.00044206053,0.003275906,0.017340973],"genre_scores_gemma":[0.6038042,0.00096859114,0.3734495,0.0012524965,0.0012053346,0.00058134453,0.0011290365,0.004019737,0.01358981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9846288,0.0047455905,0.0009485051,0.0021757379,0.005112728,0.002388685],"domain_scores_gemma":[0.92533755,0.05490307,0.0033208393,0.01165543,0.0034910163,0.0012920531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010270313,0.0021533186,0.0025051225,0.004427638,0.0018752374,0.005652477,0.0047113383,0.0023372977,0.0092278365],"category_scores_gemma":[0.06294374,0.001993329,0.0035735911,0.0041597583,0.0068881675,0.026862867,0.010734185,0.0059589725,0.001456683],"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.00050487777,0.00009654793,0.0026964447,0.00022584893,0.00006760049,0.00013171679,0.00059744186,0.04659582,0.0053916527,0.85703474,0.005415017,0.08124229],"study_design_scores_gemma":[0.000036796286,0.000092771945,0.0003547996,0.00007735038,0.000106883585,0.00007887349,0.000099930476,0.17691858,0.0078016995,0.80851585,0.005856701,0.000059719656],"about_ca_topic_score_codex":0.0027116,"about_ca_topic_score_gemma":0.0024968858,"teacher_disagreement_score":0.010270313,"about_ca_system_score_codex":0.004484502,"about_ca_system_score_gemma":0.0031589423,"threshold_uncertainty_score":0.05431527},"labels":[],"label_agreement":null},{"id":"W2005299742","doi":"10.1007/s10479-012-1059-8","title":"Makespan minimization for parallel machines scheduling with multiple availability constraints","year":2012,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Job shop scheduling; Lexicographical order; Theory of computation; Mathematical optimization; Enumeration; Computer science; Minification; Integer programming; Scheduling (production processes); Branch and bound; Linear programming; Algorithm; Mathematics; Schedule; Discrete mathematics","score_opus":0.14004727428827127,"score_gpt":0.38869455033310835,"score_spread":0.24864727604483708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005299742","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.09970784,0.0017503937,0.8889967,0.0006860136,0.0002630257,0.00021171384,0.00035169246,0.0003517178,0.0076808096],"genre_scores_gemma":[0.82773906,0.0010448468,0.16484196,0.00014286804,0.00028875502,0.00031177854,0.00035234555,0.00031498022,0.0049634054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989365,0.00039896657,0.00004808524,0.00015339702,0.00025064973,0.00021239485],"domain_scores_gemma":[0.99847335,0.0010351415,0.0001788332,0.000068421934,0.00013598075,0.00010837042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020831116,0.001630118,0.0019582869,0.0012249011,0.0009336184,0.0013279882,0.0016159458,0.0009430943,0.0020604704],"category_scores_gemma":[0.0034482926,0.0011636391,0.001152408,0.0017501385,0.00064056786,0.0014147593,0.0010984715,0.0013932986,0.00020933189],"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.0001637002,0.00006241188,0.00021676642,0.00016119977,0.00008556268,0.00007381686,0.000037189548,0.97687066,0.0016192425,0.0048530023,0.0009392156,0.014917268],"study_design_scores_gemma":[0.000011848995,0.000051963336,0.00019838517,0.000008032355,0.000016347918,0.000017744465,0.0000122914425,0.9915587,0.00047945962,0.0073523377,0.0002870672,0.0000058504097],"about_ca_topic_score_codex":0.004998889,"about_ca_topic_score_gemma":0.005106115,"teacher_disagreement_score":0.004998889,"about_ca_system_score_codex":0.001395117,"about_ca_system_score_gemma":0.0016440348,"threshold_uncertainty_score":0.011016667},"labels":[],"label_agreement":null},{"id":"W2007073703","doi":"10.1007/s10479-011-0885-4","title":"Workforce-constrained maintenance scheduling for military aircraft fleet: a case study","year":2011,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":90,"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":"Schedule; Theory of computation; Integer programming; Operations research; Computer science; Scheduling (production processes); Aircraft maintenance; Job shop scheduling; Constraint (computer-aided design); Workforce; Constraint programming; Fleet management; Mathematical optimization; Engineering; Aeronautics; Operations management; Stochastic programming; Mathematics; Algorithm","score_opus":0.22534984035422112,"score_gpt":0.399505614178517,"score_spread":0.17415577382429587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007073703","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.98186755,0.00023260833,0.012106096,0.00035214543,0.00003302478,0.00009917847,0.0003723897,0.000090670634,0.0048463703],"genre_scores_gemma":[0.99042237,0.0001145078,0.0073213805,0.0000179977,0.000013421865,0.000038304242,0.00017611384,0.000022958964,0.0018728975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9995215,0.00018105519,0.000016205113,0.00007109086,0.0000741597,0.00013603346],"domain_scores_gemma":[0.99673295,0.002444209,0.00023146326,0.00015615682,0.0001867901,0.0002484709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012137856,0.0008374964,0.00058911444,0.0008221826,0.00092861307,0.0007885942,0.0015203732,0.002289136,0.003262597],"category_scores_gemma":[0.0031307077,0.00041728537,0.000785371,0.0010067855,0.00054846174,0.0006441201,0.00046482697,0.0008032297,0.0002474857],"study_design_candidate":"observational","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.0008205892,0.001096027,0.008673612,0.00024943755,0.00010555175,0.00457381,0.00031939062,0.9520833,0.0040243245,0.0036055415,0.0029996792,0.021448757],"study_design_scores_gemma":[0.00022426568,0.0008711213,0.0077074715,0.000023998675,0.000074875425,0.0011342043,0.0007453882,0.9824578,0.002278596,0.002565305,0.0018757427,0.000041196345],"about_ca_topic_score_codex":0.015757397,"about_ca_topic_score_gemma":0.01913416,"teacher_disagreement_score":0.015757397,"about_ca_system_score_codex":0.0012584111,"about_ca_system_score_gemma":0.00094806333,"threshold_uncertainty_score":0.0313313},"labels":[],"label_agreement":null},{"id":"W2008645045","doi":"10.1023/b:anor.0000030687.72169.c7","title":"Scheduling Three-Operation Jobs in a Two-Machine Flow Shop to Minimize Makespan","year":2004,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":17,"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":"McGill University","keywords":"Job shop scheduling; Theory of computation; Computer science; Idle; Mathematical optimization; Flow shop scheduling; Approximation algorithm; Scheduling (production processes); Schedule; Time complexity; Algorithm; Mathematics","score_opus":0.12638373061212133,"score_gpt":0.4156692742237378,"score_spread":0.28928554361161646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008645045","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.597806,0.00044290785,0.39536288,0.00035498376,0.00022149069,0.00045894462,0.00017828916,0.00055340095,0.00462122],"genre_scores_gemma":[0.90528667,0.0001250107,0.09236397,0.00006450643,0.00003510252,0.00016606142,0.00013020594,0.000102742466,0.001725693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993906,0.0001618013,0.00003401328,0.00009839582,0.00009076585,0.00022450308],"domain_scores_gemma":[0.9989723,0.00050675607,0.00012479485,0.00006848283,0.000116274336,0.00021142654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013374914,0.0010362896,0.0019910764,0.00068000617,0.0010854106,0.0014118253,0.0016495907,0.0013383687,0.0020731594],"category_scores_gemma":[0.0014446293,0.00082986476,0.0010283838,0.00094985537,0.0008255336,0.0011224267,0.00082337833,0.0010287679,0.00026456782],"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.0013657672,0.00057380646,0.0008305618,0.00031387564,0.00010082298,0.00034958802,0.00022663677,0.94491416,0.022140441,0.003865128,0.0011575699,0.024161572],"study_design_scores_gemma":[0.00010570576,0.00035692743,0.0005446736,0.0000063715174,0.000022750532,0.000039392933,0.00006123039,0.9928349,0.0025961255,0.0031610036,0.00025107595,0.000019846848],"about_ca_topic_score_codex":0.0040250695,"about_ca_topic_score_gemma":0.003922971,"teacher_disagreement_score":0.0040250695,"about_ca_system_score_codex":0.0007519983,"about_ca_system_score_gemma":0.0017300551,"threshold_uncertainty_score":0.0080032945},"labels":[],"label_agreement":null},{"id":"W2009545310","doi":"10.1007/s10479-008-0439-6","title":"Introduction to the special volume on constraint programming, artificial intelligence, and operations research","year":2008,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","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 Toronto","funders":"","keywords":"Theory of computation; Computer science; Volume (thermodynamics); Constraint (computer-aided design); Constraint programming; Operations research; Artificial intelligence; Mathematical optimization; Programming language; Mathematics; Stochastic programming","score_opus":0.28803532810644444,"score_gpt":0.44133032527962474,"score_spread":0.1532949971731803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009545310","genre_codex":"review","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009399485,0.36920807,0.11591298,0.052394487,0.29341224,0.00020767386,0.00281515,0.0008249072,0.16428459],"genre_scores_gemma":[0.008891956,0.28026214,0.049853336,0.02583343,0.451905,0.000420312,0.003092489,0.001114243,0.17862706],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99789196,0.00047090455,0.00017975127,0.00036893963,0.0009415266,0.00014689281],"domain_scores_gemma":[0.9919012,0.0051358864,0.00031797914,0.00051612663,0.0014198201,0.0007089199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022098601,0.002175401,0.0034633758,0.0048669646,0.0010130559,0.005597596,0.0020647184,0.0025497563,0.081901096],"category_scores_gemma":[0.007821308,0.0007992697,0.0020569859,0.008253999,0.002080426,0.005632059,0.0016669449,0.0076490403,0.0311811],"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.000025195943,0.000055930515,0.00010530809,0.00043541807,0.000025895757,0.000045021094,0.000027544238,0.0007146398,0.0002098748,0.035422232,0.89174694,0.071186],"study_design_scores_gemma":[0.000011644571,0.000030183304,0.00029023888,0.000316021,0.000017509336,0.00016085169,0.00003022164,0.0010125053,0.00007521517,0.07699158,0.9210373,0.000026697837],"about_ca_topic_score_codex":0.0013622404,"about_ca_topic_score_gemma":0.0030488463,"teacher_disagreement_score":0.081901096,"about_ca_system_score_codex":0.0017620014,"about_ca_system_score_gemma":0.0029051877,"threshold_uncertainty_score":0.27398646},"labels":[],"label_agreement":null},{"id":"W2013421795","doi":"10.1007/s10479-011-0982-4","title":"Controlling pollution and environmental absorption capacity","year":2011,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Thermodynamics and Statistical Mechanics","field":"Physics and Astronomy","cited_by":43,"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":"Absorption capacity; Pollution; Environmental science; Stock (firearms); Absorption (acoustics); Carrying capacity; Natural resource economics; Economics; Materials science; Engineering; Ecology","score_opus":0.1834047899137453,"score_gpt":0.37707503501676654,"score_spread":0.19367024510302125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013421795","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.8492652,0.0014748137,0.098088466,0.002292479,0.00014029628,0.000044657532,0.00013867329,0.00025969942,0.048295688],"genre_scores_gemma":[0.9971155,0.0001656881,0.00085290644,0.000031862182,0.0000128308075,0.0000056299123,0.000010102819,0.000009464453,0.0017960095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938357,0.0001499188,0.00002842701,0.00009431359,0.00013203228,0.00021166189],"domain_scores_gemma":[0.99658644,0.0024260678,0.00034174137,0.00018694371,0.00035998636,0.000098791454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090480485,0.00050869054,0.00045058504,0.00055416,0.00043420997,0.002326092,0.00057526625,0.00091948005,0.004369649],"category_scores_gemma":[0.004411397,0.00034688698,0.0003474826,0.0005956843,0.0013808176,0.002892542,0.0010102268,0.00070953177,0.0002678199],"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.0006151814,0.0006216322,0.011589801,0.00023228764,0.0001605259,0.00026745975,0.0001974393,0.7225589,0.07232738,0.13502795,0.0018002334,0.054601178],"study_design_scores_gemma":[0.000046947174,0.00050001824,0.012986934,0.000035708304,0.00012971323,0.000136484,0.00051869807,0.73944414,0.08116621,0.16029729,0.004638757,0.000099046534],"about_ca_topic_score_codex":0.0031408106,"about_ca_topic_score_gemma":0.0023138633,"teacher_disagreement_score":0.004369649,"about_ca_system_score_codex":0.0009388054,"about_ca_system_score_gemma":0.000985357,"threshold_uncertainty_score":0.01461792},"labels":[],"label_agreement":null},{"id":"W2014129541","doi":"10.1007/s10479-014-1761-9","title":"A new rank dependent utility approach to model risk averse preferences in portfolio optimization","year":2015,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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 Toronto","funders":"","keywords":"Portfolio; Portfolio optimization; Risk aversion (psychology); Computer science; Distortion (music); Theory of computation; Mathematical optimization; Rank (graph theory); Econometrics; Parametric statistics; Selection (genetic algorithm); Function (biology); Expected utility hypothesis; Mathematical economics; Economics; Mathematics; Artificial intelligence; Algorithm; Statistics; Financial economics","score_opus":0.5797632174622376,"score_gpt":0.5203476363812555,"score_spread":0.059415581080982105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014129541","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.0054790834,0.00047314653,0.99122787,0.00033886344,0.00007203464,0.00003388809,0.000084130006,0.000053081847,0.002237828],"genre_scores_gemma":[0.49774948,0.0021583312,0.4656642,0.0005572665,0.00048788212,0.00051308726,0.00039471447,0.0003263232,0.03214876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779713,0.0014165151,0.00008842486,0.00018496091,0.00037282903,0.00014026147],"domain_scores_gemma":[0.9949092,0.0037241299,0.00025571696,0.0003056713,0.0005645151,0.00024072907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004559017,0.0014988611,0.0022161808,0.0013086942,0.00061753724,0.0026498758,0.0031906944,0.0026940026,0.004619121],"category_scores_gemma":[0.012800613,0.001319369,0.0017896678,0.0018999224,0.0013268801,0.0046843076,0.0023912499,0.0038324855,0.0008055768],"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.00005034007,0.00012889701,0.00042697182,0.000090079666,0.00009669733,0.000110277324,0.00008750426,0.72468984,0.0005236387,0.25437215,0.0023013477,0.017122176],"study_design_scores_gemma":[0.000004714949,0.000011443365,0.000027529673,0.0000051224183,0.000008200346,0.000008123729,0.0000039550796,0.9694995,0.000031015265,0.030048,0.00034545298,0.0000069390117],"about_ca_topic_score_codex":0.0044071684,"about_ca_topic_score_gemma":0.004483919,"teacher_disagreement_score":0.004619121,"about_ca_system_score_codex":0.0015804253,"about_ca_system_score_gemma":0.0013853156,"threshold_uncertainty_score":0.024110615},"labels":[],"label_agreement":null},{"id":"W2014530950","doi":"10.1007/s10479-008-0339-9","title":"Optimal location with equitable loads","year":2008,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":74,"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","keywords":"Mathematical optimization; Theory of computation; Tabu search; Facility location problem; Heuristic; Computer science; Path (computing); Tree (set theory); Mathematics; Algorithm; Combinatorics","score_opus":0.2937564709182184,"score_gpt":0.3996784297114063,"score_spread":0.10592195879318794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014530950","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.20087796,0.0007201075,0.75734913,0.0025950389,0.00020362584,0.00024380491,0.0007941859,0.0006120418,0.03660409],"genre_scores_gemma":[0.9419213,0.00041705655,0.046584297,0.00011970154,0.00013073464,0.00012781899,0.000170864,0.00016881347,0.010359513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786866,0.00089164526,0.00009658068,0.00035047022,0.00026854075,0.0005241092],"domain_scores_gemma":[0.99321306,0.004439771,0.00067798997,0.0006734905,0.00068678893,0.0003088744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024674619,0.0016238836,0.0036887222,0.0022959865,0.0012723991,0.0036723784,0.0027074097,0.0033115002,0.01260675],"category_scores_gemma":[0.019640138,0.0020343543,0.0008759284,0.003913212,0.0020034334,0.008349652,0.0034244987,0.001615502,0.0014221531],"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.00036012544,0.00010741884,0.00053236284,0.0000800615,0.00003168631,0.00009509814,0.00008436251,0.9249732,0.000436626,0.051501065,0.002261592,0.019536419],"study_design_scores_gemma":[0.00010151828,0.000103566956,0.00047375166,0.000033531815,0.000041690644,0.0000829797,0.00022021837,0.82036203,0.00050585606,0.17663044,0.0014115261,0.000032887485],"about_ca_topic_score_codex":0.0041616354,"about_ca_topic_score_gemma":0.0037936103,"teacher_disagreement_score":0.01260675,"about_ca_system_score_codex":0.002519795,"about_ca_system_score_gemma":0.0015873286,"threshold_uncertainty_score":0.042173743},"labels":[],"label_agreement":null},{"id":"W2015067034","doi":"10.1007/s10479-010-0806-y","title":"An interior-point Benders based branch-and-cut algorithm for mixed integer programs","year":2010,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":73,"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":"Benders' decomposition; Branch and cut; Mathematics; Theory of computation; Cutting-plane method; Mathematical optimization; Integer programming; Integer (computer science); Branch and bound; Interior point method; Steiner tree problem; Facility location problem; Algorithm; Point (geometry); Linear programming relaxation; Computer science","score_opus":0.13655247256445424,"score_gpt":0.44150555228973304,"score_spread":0.3049530797252788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015067034","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.0040613217,0.00014602684,0.99220496,0.00012351155,0.00004970787,0.00010583461,0.000060546503,0.000425222,0.0028228217],"genre_scores_gemma":[0.0439724,0.00014524869,0.95214295,0.000101885664,0.000047986727,0.0003689947,0.00021924077,0.00021797509,0.0027832526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876875,0.00050632947,0.000052752708,0.00016532715,0.00038453573,0.00012223102],"domain_scores_gemma":[0.99806744,0.0013505027,0.0001133271,0.00008752463,0.00028749858,0.00009382647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002552222,0.0019877297,0.0027040127,0.0017143306,0.00093260803,0.0016880631,0.0024562387,0.0028084726,0.00853279],"category_scores_gemma":[0.0046342537,0.0016966745,0.0016740718,0.0018700182,0.0010311769,0.0018885228,0.0019478756,0.0039855563,0.0015791489],"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.0003452065,0.00037025346,0.00033315105,0.00019474003,0.000074452364,0.000057254227,0.000095680996,0.7337119,0.0022202234,0.021096723,0.0050296346,0.23647083],"study_design_scores_gemma":[0.000045818088,0.000048990805,0.000037635953,0.000014902317,0.000010778984,0.000008861251,0.000007013932,0.9931977,0.0003446625,0.0055330824,0.00074382336,0.000006713068],"about_ca_topic_score_codex":0.004266895,"about_ca_topic_score_gemma":0.0047124457,"teacher_disagreement_score":0.00853279,"about_ca_system_score_codex":0.0012629763,"about_ca_system_score_gemma":0.00252905,"threshold_uncertainty_score":0.028545022},"labels":[],"label_agreement":null},{"id":"W2017280802","doi":"10.1007/s10479-011-0903-6","title":"Estimation of potential gains from mergers in multiple periods: a comparison of stochastic frontier analysis and Data Envelopment Analysis","year":2011,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":50,"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":"Data envelopment analysis; Stochastic frontier analysis; Theory of computation; Frontier; Computation; Envelopment; Computer science; Econometrics; Estimation; Mergers and acquisitions; Panel data; Operations research; Industrial organization; Economics; Statistics; Microeconomics; Finance; Mathematics; Production (economics); Management; Algorithm","score_opus":0.6025119014882832,"score_gpt":0.5591979469723991,"score_spread":0.043313954515884046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017280802","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.6237206,0.0013794343,0.37089497,0.00046140444,0.000021526319,0.00010593908,0.00022068316,0.00011845439,0.0030769494],"genre_scores_gemma":[0.97702616,0.0003797221,0.022040756,0.000012735464,0.0000109820585,0.00003247305,0.000113015674,0.000013577624,0.00037066682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978776,0.001363042,0.00009816781,0.00012381203,0.00036141605,0.00017609057],"domain_scores_gemma":[0.97431403,0.023547662,0.0009113875,0.00050497183,0.0005751726,0.00014677044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007957966,0.0007944775,0.0017999602,0.0024204485,0.00031625445,0.0021318842,0.0006817573,0.0011319607,0.0016071353],"category_scores_gemma":[0.021261731,0.00046303682,0.0020412947,0.002464424,0.00051695306,0.0030651968,0.0011131745,0.0009541497,0.00010594839],"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.00043871265,0.00010186779,0.005011293,0.00009694122,0.00014439214,0.00004417554,0.000055454002,0.9512798,0.0006246997,0.008406992,0.000093081224,0.033702545],"study_design_scores_gemma":[0.000025203195,0.0001478543,0.00358568,0.000019486795,0.00009266455,0.00002079901,0.000069377726,0.98805594,0.00078432215,0.0070069325,0.00017448397,0.000017281229],"about_ca_topic_score_codex":0.0052489927,"about_ca_topic_score_gemma":0.0031772992,"teacher_disagreement_score":0.007957966,"about_ca_system_score_codex":0.0018238999,"about_ca_system_score_gemma":0.0024021273,"threshold_uncertainty_score":0.042086244},"labels":[],"label_agreement":null},{"id":"W2018608330","doi":"10.1007/s10479-013-1501-6","title":"Special section on behavioral considerations in developing and applying operations research models","year":2013,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Quality and Supply Management","field":"Business, Management and Accounting","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 Ottawa","funders":"","keywords":"Theory of computation; Section (typography); Special section; Computer science; Management science; Operations research; Economics; Mathematics; Engineering; Algorithm; Engineering physics","score_opus":0.5149315316975448,"score_gpt":0.47738397457240506,"score_spread":0.03754755712513974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018608330","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031791474,0.023095358,0.12067237,0.21911633,0.48615938,0.0003237196,0.00079833827,0.0007351467,0.1459203],"genre_scores_gemma":[0.04503677,0.037096795,0.046074897,0.06874474,0.66127163,0.0008516005,0.0008911318,0.00090294343,0.1391295],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99530905,0.0023994404,0.00047946165,0.00026201922,0.0013067507,0.00024335367],"domain_scores_gemma":[0.9448781,0.04336047,0.0016899484,0.002136996,0.00660474,0.001329747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012441941,0.001590401,0.0014313863,0.0028422542,0.00171083,0.005011977,0.0018709608,0.0061124046,0.03195512],"category_scores_gemma":[0.032957457,0.00072420883,0.0018289369,0.002145002,0.0024416614,0.0049407813,0.0015752638,0.007638312,0.006972282],"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.000038488917,0.00019429978,0.00063757005,0.00035572928,0.00004126935,0.00029953435,0.00011475347,0.002173353,0.00038281045,0.12261734,0.8320802,0.041064616],"study_design_scores_gemma":[0.000025465903,0.00012364444,0.0013379903,0.00072539586,0.000070402915,0.00038848998,0.00018928344,0.0056029344,0.0004036664,0.15486987,0.836219,0.00004387643],"about_ca_topic_score_codex":0.0016683287,"about_ca_topic_score_gemma":0.004295517,"teacher_disagreement_score":0.03195512,"about_ca_system_score_codex":0.0017458918,"about_ca_system_score_gemma":0.0028522278,"threshold_uncertainty_score":0.10690051},"labels":[],"label_agreement":null},{"id":"W2021293262","doi":"10.1007/s10479-015-1827-3","title":"Bounded and discrete data and Likert scales in data envelopment analysis: application to regional energy efficiency in China","year":2015,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Priority Academic Program Development of Jiangsu Higher Education Institutions; China Scholarship Council; Tongji University; National Natural Science Foundation of China; Worcester Polytechnic Institute","keywords":"Data envelopment analysis; Bounded function; Likert scale; Theory of computation; Scale (ratio); Computer science; Integer (computer science); Mathematical optimization; Limit (mathematics); Mathematics; Econometrics; Statistics; Algorithm","score_opus":0.49632891875343194,"score_gpt":0.5551049537861926,"score_spread":0.05877603503276069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021293262","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.8564045,0.00077859167,0.13871227,0.0006067082,0.000034084776,0.00017350368,0.00020050914,0.0000741487,0.003015725],"genre_scores_gemma":[0.9729336,0.00022284711,0.026307128,0.000021626753,0.000007610029,0.00013089192,0.000077914054,0.000009260146,0.00028918948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98640823,0.010813781,0.0006227641,0.0006600917,0.001132531,0.00036258623],"domain_scores_gemma":[0.94483376,0.04939904,0.0013888717,0.0015459093,0.002422956,0.00040943944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019416582,0.0006509,0.0013162355,0.0023055223,0.0010785584,0.0021802876,0.001261846,0.000985082,0.0011587909],"category_scores_gemma":[0.045693625,0.00045616738,0.0018997579,0.005250011,0.0017800981,0.0028255752,0.0024253654,0.0015503147,0.000101350044],"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.0013511316,0.0008667904,0.12587953,0.0010854682,0.000721802,0.0010965876,0.007183917,0.5137492,0.0032593217,0.11605441,0.0014027215,0.22734918],"study_design_scores_gemma":[0.00008631043,0.0002719277,0.03828925,0.00009520695,0.00020552996,0.00005397286,0.0034353747,0.93156314,0.0011391129,0.02381677,0.0009334158,0.00010992564],"about_ca_topic_score_codex":0.036669794,"about_ca_topic_score_gemma":0.025528159,"teacher_disagreement_score":0.036669794,"about_ca_system_score_codex":0.0044225273,"about_ca_system_score_gemma":0.005226134,"threshold_uncertainty_score":0.10268593},"labels":[],"label_agreement":null},{"id":"W2021665984","doi":"10.1007/s10479-005-2038-0","title":"Maximizing Trip Coverage in the Location of a Single Rapid Transit Alignment","year":2005,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":80,"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","funders":"","keywords":"Heuristics; Theory of computation; Heuristic; Maximization; Computer science; Greedy algorithm; Mathematical optimization; Extension (predicate logic); Upper and lower bounds; Simple (philosophy); Computational complexity theory; Transit (satellite); Algorithm; Mathematics; Public transport; Transport engineering; Engineering","score_opus":0.2356324665256801,"score_gpt":0.4466647061607565,"score_spread":0.2110322396350764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021665984","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.61245143,0.000345398,0.37433136,0.0006272566,0.000037039932,0.000109542525,0.0005216031,0.00031092286,0.011265489],"genre_scores_gemma":[0.9698741,0.00015087354,0.027787082,0.000023308694,0.00003640046,0.000039628405,0.00011974471,0.000041904106,0.0019268363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948066,0.00023053485,0.000012223366,0.00009751829,0.000053826014,0.00012517824],"domain_scores_gemma":[0.99819344,0.001057288,0.00029827925,0.00009236216,0.00017684534,0.00018174229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008430483,0.0006941619,0.0013990205,0.00087442185,0.00055963435,0.0010193018,0.0010292904,0.0009923852,0.0024504086],"category_scores_gemma":[0.0049915873,0.0006152493,0.00050432584,0.0013559943,0.00060566916,0.0013111095,0.0011743008,0.00047847806,0.0005204153],"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.0006040046,0.000056897607,0.0026208605,0.00011783692,0.000068847425,0.00031205564,0.00012210417,0.95935065,0.0045063384,0.011589675,0.0016152151,0.019035507],"study_design_scores_gemma":[0.00004144269,0.0002094422,0.0011654652,0.000010145871,0.000045177407,0.00015036864,0.00009471438,0.9889474,0.0013252457,0.007405227,0.0005907563,0.000014604454],"about_ca_topic_score_codex":0.0037938107,"about_ca_topic_score_gemma":0.0024506324,"teacher_disagreement_score":0.0037938107,"about_ca_system_score_codex":0.0006746591,"about_ca_system_score_gemma":0.0008358215,"threshold_uncertainty_score":0.008197427},"labels":[],"label_agreement":null},{"id":"W2022317074","doi":"10.1007/s10479-010-0736-8","title":"Facility location for large-scale emergencies","year":2010,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":153,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Node (physics); Facility location problem; Theory of computation; Computer science; Scale (ratio); Center (category theory); Path (computing); Operations research; Location model; Mathematical optimization; Computer network; Geography; Mathematics; Algorithm; Engineering; Cartography","score_opus":0.21629948881006314,"score_gpt":0.4215558370122323,"score_spread":0.20525634820216918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022317074","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.9097303,0.0040512076,0.04023598,0.006351243,0.0005690267,0.00026400393,0.0034616408,0.00088416284,0.034452427],"genre_scores_gemma":[0.9945431,0.00038669744,0.0028973003,0.000041950298,0.000058678866,0.000022030486,0.00033160442,0.0000132430805,0.0017053928],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993051,0.00033052583,0.000043448144,0.00006265621,0.00013207692,0.00012603374],"domain_scores_gemma":[0.9960349,0.0015242863,0.0012342692,0.0001883281,0.00074373063,0.0002744761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092850026,0.00030525462,0.00019559766,0.0015874148,0.00066651177,0.0012134833,0.0007499155,0.0010321789,0.018491346],"category_scores_gemma":[0.008174793,0.00018219923,0.00032656777,0.0013813989,0.00022375937,0.0015426978,0.0007436877,0.0005011908,0.0011244693],"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.0025364002,0.0006831373,0.28555954,0.00088643667,0.00022993491,0.0034500305,0.001046603,0.11144748,0.0034910513,0.021062505,0.060458582,0.5091483],"study_design_scores_gemma":[0.00047942842,0.0044714925,0.5429847,0.00087965524,0.0005596486,0.008458957,0.019938005,0.31508887,0.003617775,0.022238858,0.080871664,0.00041091692],"about_ca_topic_score_codex":0.008639088,"about_ca_topic_score_gemma":0.014889282,"teacher_disagreement_score":0.018491346,"about_ca_system_score_codex":0.0011145227,"about_ca_system_score_gemma":0.0013574989,"threshold_uncertainty_score":0.061859727},"labels":[],"label_agreement":null},{"id":"W2024154419","doi":"10.1007/s10479-011-1013-1","title":"A Bayesian model and numerical algorithm for CBM availability maximization","year":2011,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Reliability and Maintenance Optimization","field":"Engineering","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 Toronto","funders":"","keywords":"Theory of computation; Parameterized complexity; Markov decision process; Computer science; Mathematical optimization; Maximization; Partially observable Markov decision process; Bayesian probability; Expectation–maximization algorithm; Algorithm; Multivariate statistics; Markov chain; Markov process; Markov model; Mathematics; Artificial intelligence; Machine learning; Statistics","score_opus":0.1699342649344517,"score_gpt":0.36933101493084397,"score_spread":0.19939674999639226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024154419","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.0012059973,0.00007250909,0.9975509,0.00013826288,0.000013038032,0.000022215188,0.000028191413,0.00012331166,0.0008455956],"genre_scores_gemma":[0.108723246,0.00022906544,0.887047,0.00015469234,0.000083856416,0.000403077,0.00018521084,0.0002006541,0.002973318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991104,0.0003951075,0.000035400444,0.00012208639,0.00027137322,0.00006570001],"domain_scores_gemma":[0.9955124,0.0034728954,0.00019505202,0.00019268606,0.00049961207,0.00012722368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033561783,0.0009101965,0.0020400418,0.001221855,0.0010867319,0.001634868,0.003072985,0.0031853772,0.006723913],"category_scores_gemma":[0.014131127,0.0015579485,0.0011167513,0.002064461,0.0015454296,0.0027287977,0.0025834744,0.0033993754,0.0013125695],"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.000050314717,0.00004681844,0.000163902,0.00005767241,0.000018475273,0.000027942066,0.00005035019,0.91217315,0.0005708151,0.05045698,0.0016905993,0.034693],"study_design_scores_gemma":[0.000010346951,0.0000044335416,0.000020834586,0.000006002198,0.0000027262208,0.0000072348143,0.0000027736298,0.9863114,0.00007581402,0.013254749,0.0002984529,0.0000052892633],"about_ca_topic_score_codex":0.013130889,"about_ca_topic_score_gemma":0.011126608,"teacher_disagreement_score":0.013130889,"about_ca_system_score_codex":0.002066765,"about_ca_system_score_gemma":0.0031935605,"threshold_uncertainty_score":0.02610892},"labels":[],"label_agreement":null},{"id":"W2024577761","doi":"10.1007/s10479-013-1336-1","title":"Effects of different cut-to-length harvesting structures on the economic value of a wood procurement planning problem","year":2013,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":15,"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","funders":"FPInnovations","keywords":"Procurement; Computer science; Profit (economics); Operations research; Context (archaeology); Business; Economics; Mathematics; Microeconomics","score_opus":0.13060633776607708,"score_gpt":0.33892325488727193,"score_spread":0.20831691712119485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024577761","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.9608522,0.00053535734,0.016157897,0.0009412087,0.000067184425,0.00010720305,0.0003996011,0.00005726325,0.020882074],"genre_scores_gemma":[0.99191356,0.00021910795,0.0061608898,0.000052696854,0.000019653571,0.00004392523,0.00014619737,0.00002918326,0.0014147812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982167,0.0011783775,0.000046273788,0.00008471713,0.000129149,0.00034478446],"domain_scores_gemma":[0.9346247,0.061728124,0.001091028,0.00071329525,0.000770583,0.0010723982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004545913,0.0008624011,0.0012097182,0.0012977262,0.00077783724,0.0024361718,0.0016400979,0.0017903297,0.007514805],"category_scores_gemma":[0.026594806,0.00072739605,0.0010204036,0.0013648141,0.0016355756,0.0025648568,0.0011256572,0.0020830918,0.00020858397],"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.001549662,0.00074490113,0.0026868996,0.00015004475,0.000059927108,0.00014859738,0.00005192316,0.96728677,0.0012862982,0.012101817,0.0008955469,0.013037639],"study_design_scores_gemma":[0.00025942043,0.0007234538,0.0037259732,0.000050681614,0.00015106743,0.000056268105,0.00036162324,0.97438306,0.0016349206,0.018254684,0.00036229964,0.000036547022],"about_ca_topic_score_codex":0.0036277457,"about_ca_topic_score_gemma":0.0043271566,"teacher_disagreement_score":0.007514805,"about_ca_system_score_codex":0.0019373188,"about_ca_system_score_gemma":0.001254981,"threshold_uncertainty_score":0.02513951},"labels":[],"label_agreement":null},{"id":"W2024996305","doi":"10.1007/s10479-012-1286-z","title":"Reformulation of a model for hierarchical divisive graph modularity maximization","year":2012,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":23,"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","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Heuristics; Mathematics; Random graph; Maximization; Quadratic equation; Combinatorics; Graph; Modularity (biology); Theory of computation; Discrete mathematics; Mathematical optimization; Algorithm","score_opus":0.28975513845299045,"score_gpt":0.4873950097450737,"score_spread":0.19763987129208327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024996305","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.005488107,0.00013905497,0.9893935,0.00071979203,0.00003132061,0.00004726237,0.0001801782,0.00009507854,0.0039056977],"genre_scores_gemma":[0.40234444,0.00085646607,0.56973976,0.00084799,0.00043797103,0.000691203,0.0008406454,0.0003683455,0.023873258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990213,0.00042504034,0.000033501077,0.0002400862,0.0001769007,0.000103236845],"domain_scores_gemma":[0.9970247,0.0020050597,0.00020153628,0.0002942819,0.00034011732,0.00013420256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002661533,0.00083686743,0.0013900766,0.00085150957,0.00075235957,0.0018650655,0.0034181725,0.0029006714,0.008957093],"category_scores_gemma":[0.010220354,0.000784448,0.0011236956,0.0012887323,0.0016771092,0.0038489336,0.0026822698,0.002824585,0.0011615216],"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.000032400294,0.00006938739,0.00028833613,0.00011531267,0.000034722143,0.00008978744,0.00014400495,0.4892827,0.0008022995,0.48267195,0.006029941,0.020439222],"study_design_scores_gemma":[0.00000946678,0.000010739981,0.00006507431,0.00000946891,0.000006954518,0.000021135947,0.000013083682,0.86818117,0.000108124994,0.13031977,0.0012480733,0.0000069164994],"about_ca_topic_score_codex":0.006643554,"about_ca_topic_score_gemma":0.010480232,"teacher_disagreement_score":0.008957093,"about_ca_system_score_codex":0.0023687447,"about_ca_system_score_gemma":0.0024339803,"threshold_uncertainty_score":0.029964447},"labels":[],"label_agreement":null},{"id":"W202756272","doi":"10.1023/a:1020957904442","title":"Locating Multiple Competitive Facilities: Spatial Interaction Models with Variable Expenditures","year":2002,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":85,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cannibalization; Theory of computation; Key (lock); Constant (computer programming); Computer science; Mathematical optimization; Mathematical economics; Mathematics; Economics; Algorithm; Industrial organization","score_opus":0.2314592520300225,"score_gpt":0.36973260853578677,"score_spread":0.13827335650576428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W202756272","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.75285965,0.0029438771,0.21583195,0.0061708936,0.00041030068,0.00035907328,0.003688022,0.000902587,0.016833577],"genre_scores_gemma":[0.96316296,0.0015350978,0.012804541,0.00018014028,0.00023386972,0.0002495782,0.00087449636,0.00014389593,0.02081533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993834,0.003033875,0.0001803769,0.0009418704,0.00033991932,0.0016699797],"domain_scores_gemma":[0.96923125,0.022781571,0.0036590104,0.0011473846,0.0017146387,0.0014662201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072962237,0.0034245537,0.0058426326,0.004013826,0.0024305591,0.008191179,0.01125095,0.008422828,0.02491511],"category_scores_gemma":[0.016947255,0.0036771793,0.0056494866,0.008574441,0.005396036,0.010268709,0.0057118214,0.004774681,0.0038083077],"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.0009229052,0.001081248,0.01954407,0.00024880006,0.0007577803,0.0006334393,0.00042599803,0.895186,0.00033969953,0.06629432,0.0038840754,0.010681662],"study_design_scores_gemma":[0.00027638924,0.00021376676,0.0028184108,0.000029500106,0.00043058873,0.000114557704,0.0004801123,0.974277,0.00008710554,0.020387106,0.0008029755,0.0000824083],"about_ca_topic_score_codex":0.08225508,"about_ca_topic_score_gemma":0.077122994,"teacher_disagreement_score":0.08225508,"about_ca_system_score_codex":0.0046656495,"about_ca_system_score_gemma":0.0033026151,"threshold_uncertainty_score":0.16355258},"labels":[],"label_agreement":null},{"id":"W2031002773","doi":"10.1007/s10479-011-0835-1","title":"Single-machine scheduling problems with time and position dependent processing times","year":2011,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Lakehead University","funders":"","keywords":"Job shop scheduling; Single-machine scheduling; Theory of computation; Computer science; Scheduling (production processes); Heuristic; Mathematical optimization; Due date; Position (finance); Learning effect; Algorithm; Mathematics; Artificial intelligence; Schedule","score_opus":0.10754502795539035,"score_gpt":0.33211064105787114,"score_spread":0.2245656131024808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031002773","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.14228126,0.004048622,0.8422734,0.0021047264,0.0007712144,0.00029214227,0.0010221999,0.00035712746,0.0068492335],"genre_scores_gemma":[0.82377946,0.0021384507,0.15819862,0.0002439709,0.00088889216,0.00049554097,0.00083112635,0.0003018226,0.01312203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978824,0.0008824552,0.0001319966,0.00049967633,0.00031879926,0.00028459352],"domain_scores_gemma":[0.9868342,0.010754965,0.0010762326,0.00040414705,0.00045283933,0.00047763702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004448156,0.0024895878,0.005103962,0.0014361126,0.0012376456,0.0034074392,0.004000483,0.0048628715,0.004413661],"category_scores_gemma":[0.01445338,0.0028298048,0.0021313152,0.0039458172,0.0017644344,0.004266613,0.0017170331,0.0026937348,0.0006050818],"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.00027963633,0.00012632464,0.0003143064,0.00023407064,0.00009408856,0.00017750643,0.000034541194,0.9735294,0.000978264,0.013636303,0.0011858504,0.009409695],"study_design_scores_gemma":[0.000050256058,0.000060368497,0.00024279482,0.000008345893,0.000025614483,0.00003780759,0.000013902349,0.9837774,0.00048074062,0.014943882,0.0003446265,0.000014167167],"about_ca_topic_score_codex":0.0026642215,"about_ca_topic_score_gemma":0.0025227065,"teacher_disagreement_score":0.005103962,"about_ca_system_score_codex":0.0021294602,"about_ca_system_score_gemma":0.0018445862,"threshold_uncertainty_score":0.023524404},"labels":[],"label_agreement":null},{"id":"W2031435014","doi":"10.1007/s10479-008-0320-7","title":"Feedback Stackelberg equilibrium strategies when the private label competes with the national brand","year":2008,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":52,"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":"Goodwill; Stackelberg competition; Private label; Advertising; Comparative advertising; Business; Microeconomics; Stock (firearms); Computer science; Economics; Finance","score_opus":0.25022625584714836,"score_gpt":0.39155817141154736,"score_spread":0.141331915564399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031435014","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.8041024,0.00022915524,0.13724215,0.003180935,0.000112639966,0.00017224031,0.0002881874,0.00029569268,0.054376535],"genre_scores_gemma":[0.98945904,0.00009817129,0.0039229044,0.00012182211,0.000026303298,0.00006076087,0.0000430565,0.00001523791,0.006252735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872893,0.00045161936,0.000046053796,0.00017540326,0.00020236807,0.000395616],"domain_scores_gemma":[0.9911981,0.006822345,0.0007414369,0.0002751944,0.00050249964,0.00046034384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028425772,0.00092320476,0.0016196102,0.00082648237,0.0009652637,0.0036756562,0.0015903655,0.0038878121,0.012768417],"category_scores_gemma":[0.014441309,0.0008115546,0.00084036554,0.00054645096,0.0016780515,0.0051067183,0.0016675021,0.0018274976,0.0010189668],"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.0039871377,0.001191002,0.008047353,0.00036479172,0.00029101377,0.001423435,0.0016426002,0.26093447,0.01688847,0.6536802,0.009436281,0.04211323],"study_design_scores_gemma":[0.0004223104,0.00038998242,0.0019105104,0.000032036198,0.00009093008,0.00016993938,0.0006497117,0.6280142,0.0020957943,0.36493608,0.0011966397,0.000091870585],"about_ca_topic_score_codex":0.0032273524,"about_ca_topic_score_gemma":0.003347207,"teacher_disagreement_score":0.012768417,"about_ca_system_score_codex":0.0018580651,"about_ca_system_score_gemma":0.0015400545,"threshold_uncertainty_score":0.042714596},"labels":[],"label_agreement":null},{"id":"W2036293811","doi":"10.1007/s10479-014-1731-2","title":"$$(Q,r,L)$$ ( Q , r , L ) model for stochastic demand with lead-time dependent partial backlogging","year":2014,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Reorder point; Lead time; Purchasing; Order (exchange); Function (biology); Theory of computation; Economic order quantity; Holding cost; Total cost; Variable cost; Variable (mathematics); Lost sales; Fixed cost; Random variable; Mathematical optimization; Computer science; Mathematics; Economics; Statistics; Algorithm; Operations management; Microeconomics","score_opus":0.20470277077797733,"score_gpt":0.37786532927974065,"score_spread":0.17316255850176332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036293811","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.08865297,0.0013007222,0.8629607,0.0065046316,0.0008368908,0.00033722146,0.006042665,0.0012273537,0.032136835],"genre_scores_gemma":[0.8506164,0.0011957384,0.03215309,0.0009410728,0.00033732931,0.00047696228,0.0023327288,0.000323842,0.11162281],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976477,0.0007260709,0.0001151986,0.00051167863,0.00033306144,0.0006661873],"domain_scores_gemma":[0.9962845,0.0021166934,0.00042371303,0.00019130946,0.00058151915,0.000402225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037294573,0.001977344,0.00333116,0.001644628,0.001247306,0.0051778313,0.008101777,0.0060971486,0.019933749],"category_scores_gemma":[0.0069209123,0.0020068618,0.0020755918,0.00252513,0.0034136712,0.004456525,0.0031767527,0.0044724164,0.0031277358],"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.0002226164,0.0001281022,0.00075345434,0.00014973023,0.00007877439,0.0005991803,0.00012695095,0.8203328,0.0011768813,0.16603646,0.0051592505,0.005235814],"study_design_scores_gemma":[0.000045241923,0.0000401929,0.00019644138,0.000010169735,0.000023940773,0.000057305366,0.000025101559,0.9786219,0.00012675603,0.019900095,0.00091874634,0.00003402209],"about_ca_topic_score_codex":0.023606991,"about_ca_topic_score_gemma":0.01566731,"teacher_disagreement_score":0.023606991,"about_ca_system_score_codex":0.0039464263,"about_ca_system_score_gemma":0.0029127419,"threshold_uncertainty_score":0.06668508},"labels":[],"label_agreement":null},{"id":"W2038544490","doi":"10.1007/s10479-009-0599-z","title":"Pricing swing options with regime switching","year":2009,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Capital Investment and Risk Analysis","field":"Economics, Econometrics and Finance","cited_by":36,"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; Toronto Metropolitan University","funders":"","keywords":"Swing; Gasoline; Flexibility (engineering); Variable (mathematics); Electricity; Markov chain; Process (computing); Computer science; Economics; Wholesale market; Theory of computation; Econometrics; Mathematical optimization; Mathematics; Engineering; Electrical engineering; Algorithm","score_opus":0.24639512695006832,"score_gpt":0.39389053820586967,"score_spread":0.14749541125580135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038544490","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.48626027,0.0013986989,0.49671775,0.0030614482,0.00038259092,0.000060376467,0.00010833079,0.00030123786,0.0117093865],"genre_scores_gemma":[0.9898151,0.000309054,0.0054582055,0.00007396754,0.00017864104,0.000015939208,0.000034861376,0.000026707918,0.0040874337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992193,0.00039101092,0.00004422192,0.000085927946,0.00013842309,0.000121113815],"domain_scores_gemma":[0.99199826,0.0061729024,0.0006573608,0.00045365965,0.00024768055,0.00047017427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00385251,0.0006206193,0.0013634118,0.000673358,0.0003894195,0.002981016,0.001148406,0.002311335,0.0050411336],"category_scores_gemma":[0.017561205,0.0008593791,0.0012244036,0.00087736925,0.0016513091,0.0056878347,0.0015830849,0.003081777,0.00026978043],"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.0007227054,0.0001954479,0.004169863,0.00011128068,0.00021487924,0.0009877156,0.00017223199,0.37223443,0.0032138715,0.5857564,0.002143926,0.03007721],"study_design_scores_gemma":[0.000036292837,0.000048019294,0.00034743705,0.000005820853,0.000017978906,0.00007899139,0.0000141420105,0.84587395,0.00013552378,0.15322304,0.00020671039,0.000012082571],"about_ca_topic_score_codex":0.000456907,"about_ca_topic_score_gemma":0.00032904505,"teacher_disagreement_score":0.0050411336,"about_ca_system_score_codex":0.00057079265,"about_ca_system_score_gemma":0.00047966838,"threshold_uncertainty_score":0.020374298},"labels":[],"label_agreement":null},{"id":"W2039568841","doi":"10.1007/s10479-005-3971-7","title":"Metaheuristics in Combinatorial Optimization","year":2005,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2341,"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é de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Metaheuristic; Theory of computation; Combinatorial optimization; Vehicle routing problem; Computer science; Scheduling (production processes); Mathematical optimization; Operations research; Job shop scheduling; Parallel metaheuristic; Optimization problem; Management science; Routing (electronic design automation); Mathematics; Artificial intelligence; Algorithm; Engineering; Meta-optimization","score_opus":0.1739552011743806,"score_gpt":0.4498479164768863,"score_spread":0.2758927153025057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039568841","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.007526171,0.080774754,0.8728635,0.0044547967,0.0020422463,0.00006233963,0.00010623945,0.000203355,0.03196669],"genre_scores_gemma":[0.28325218,0.08244648,0.5958306,0.0010332034,0.0059095644,0.0004495399,0.00037517757,0.00042433757,0.030278927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985676,0.0009112698,0.00006450839,0.00009566748,0.00030329707,0.000057570956],"domain_scores_gemma":[0.99607867,0.0032050177,0.0001626656,0.00021001947,0.00026413408,0.000079495454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003129226,0.0015170751,0.0018790505,0.0016056075,0.00061553286,0.0029829594,0.001737782,0.0025297177,0.0042100227],"category_scores_gemma":[0.0079434365,0.001061672,0.0009991446,0.0036227782,0.0028309033,0.003022393,0.0011198176,0.0057064374,0.0009714155],"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.00007069456,0.00014851129,0.0003276097,0.00048467447,0.00020634792,0.000063203486,0.00012396625,0.43612143,0.00057926954,0.42228323,0.014119457,0.12547162],"study_design_scores_gemma":[0.000048005415,0.000038250375,0.00019008451,0.00014245852,0.000041364117,0.000036125388,0.000037672122,0.60327536,0.0002749183,0.37319708,0.022700155,0.000018554301],"about_ca_topic_score_codex":0.0033909513,"about_ca_topic_score_gemma":0.0034631456,"teacher_disagreement_score":0.0042100227,"about_ca_system_score_codex":0.0013981981,"about_ca_system_score_gemma":0.0015455399,"threshold_uncertainty_score":0.01654917},"labels":[],"label_agreement":null},{"id":"W2040412566","doi":"10.1007/s10479-014-1704-5","title":"On agglomeration in competitive location models","year":2014,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Regional Economics and Spatial Analysis","field":"Economics, Econometrics and Finance","cited_by":35,"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":"","keywords":"Economies of agglomeration; Theory of computation; Economic geography; Economics; Dispersion (optics); Industrial organization; Computer science; Microeconomics; Physics","score_opus":0.26909883795682826,"score_gpt":0.3785344723005367,"score_spread":0.10943563434370845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040412566","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.1136148,0.015156941,0.75714386,0.023157492,0.0008575345,0.00023851647,0.0013336664,0.00041732079,0.08807997],"genre_scores_gemma":[0.87235487,0.013646529,0.04672978,0.0022733978,0.0015151202,0.0005176036,0.0012599804,0.0005197201,0.061182994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972459,0.001808205,0.000101109305,0.00028624927,0.0002325637,0.00032596552],"domain_scores_gemma":[0.98191315,0.0143719,0.0012490118,0.00054622535,0.0010133137,0.0009064074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054051285,0.0025169118,0.0058728894,0.0032695758,0.0030858081,0.0053174333,0.005535816,0.0065663517,0.015474562],"category_scores_gemma":[0.022150729,0.0022767715,0.0037218977,0.005785507,0.0073931715,0.009247841,0.0061363266,0.005562289,0.0016261882],"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.00004532778,0.00005409856,0.00060091517,0.00012967191,0.00006219015,0.00012017683,0.0002590436,0.27921802,0.00011145014,0.7098182,0.0061992523,0.0033817245],"study_design_scores_gemma":[0.00003260415,0.00001794247,0.00013678416,0.00003860118,0.000032809607,0.000029469922,0.000093996845,0.5366251,0.000031534524,0.46073204,0.0022049756,0.000024057628],"about_ca_topic_score_codex":0.034451075,"about_ca_topic_score_gemma":0.021351434,"teacher_disagreement_score":0.034451075,"about_ca_system_score_codex":0.004701243,"about_ca_system_score_gemma":0.0025629618,"threshold_uncertainty_score":0.068501055},"labels":[],"label_agreement":null},{"id":"W2041738053","doi":"10.1007/s10479-006-5301-0","title":"A BMAP/G/1 Retrial Queue with a Server Subject to Breakdowns and Repairs","year":2006,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Retrial queue; Markov chain; Computer science; Queue; Laplace transform; Censoring (clinical trials); Stationary distribution; Exponential distribution; Theory of computation; Mathematical optimization; Real-time computing; Mathematics; Algorithm; Statistics; Computer network; Queueing system","score_opus":0.08682550280944053,"score_gpt":0.37394237132527347,"score_spread":0.28711686851583296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041738053","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.5503896,0.0016838264,0.42282063,0.005835362,0.001263715,0.0005252855,0.0017551581,0.0028266313,0.012899742],"genre_scores_gemma":[0.9601988,0.00028494166,0.028135767,0.00030908544,0.00026090498,0.00007370634,0.0002375128,0.00009032575,0.010408986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775654,0.00054023805,0.00015254442,0.00049738126,0.0003649406,0.0006882963],"domain_scores_gemma":[0.9947792,0.0021101984,0.00052007596,0.0005215616,0.001009582,0.0010593975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047677206,0.0012184434,0.0025608966,0.0015610274,0.0029107747,0.0041098553,0.004504072,0.0044817356,0.008315275],"category_scores_gemma":[0.007779288,0.0012283507,0.0010388928,0.0025538853,0.001895708,0.0027013111,0.002110534,0.0026698133,0.001150295],"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.0031339694,0.0006260205,0.004471015,0.0002894713,0.00016065015,0.002483233,0.00036391467,0.8731517,0.011755188,0.06505109,0.011851046,0.026662724],"study_design_scores_gemma":[0.00007605936,0.0001418866,0.0003966795,0.000008124937,0.000039918912,0.00011197105,0.000052092884,0.99142903,0.0007450964,0.0065898323,0.00037968383,0.000029753162],"about_ca_topic_score_codex":0.019120391,"about_ca_topic_score_gemma":0.0103783775,"teacher_disagreement_score":0.019120391,"about_ca_system_score_codex":0.0037829748,"about_ca_system_score_gemma":0.0038523613,"threshold_uncertainty_score":0.038018227},"labels":[],"label_agreement":null},{"id":"W2042547819","doi":"10.1007/s10479-012-1227-x","title":"Contracting with demand uncertainty under supply chain competition","year":2012,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":46,"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 Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Supply chain; Stackelberg competition; Revenue sharing; Business; Competition (biology); Industrial organization; Microeconomics; Supply chain management; Product (mathematics); Revenue; Supply and demand; Service management; Economics; Marketing; Finance","score_opus":0.17474198552286524,"score_gpt":0.38150496156347674,"score_spread":0.2067629760406115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042547819","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.54687154,0.0041561257,0.29187685,0.03179354,0.00049715897,0.00033623003,0.0011240015,0.00026578765,0.12307878],"genre_scores_gemma":[0.983004,0.0009985518,0.0065253945,0.00040213234,0.00043620425,0.00008141875,0.00011916941,0.000033738914,0.008399458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9923786,0.0043730475,0.00039129244,0.00077215006,0.00080352643,0.0012814285],"domain_scores_gemma":[0.8984211,0.09116022,0.0047564805,0.001589679,0.0014414503,0.0026310552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01379735,0.0011384696,0.0041259234,0.001374593,0.0020600911,0.0063036354,0.0021206744,0.006928014,0.010406521],"category_scores_gemma":[0.048850372,0.0020636409,0.0015173395,0.0024079655,0.004843566,0.008910891,0.0040560653,0.005961558,0.0004419083],"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.00056509755,0.00026434852,0.0030091894,0.00028397198,0.00015602479,0.0012045864,0.000856928,0.29906818,0.0005851552,0.67332625,0.004683244,0.015997108],"study_design_scores_gemma":[0.00014373829,0.00012861095,0.00071982323,0.00005711846,0.000050167313,0.00023342823,0.0005075125,0.23631288,0.00012425118,0.75999177,0.001664685,0.00006601272],"about_ca_topic_score_codex":0.006223014,"about_ca_topic_score_gemma":0.0033049202,"teacher_disagreement_score":0.01379735,"about_ca_system_score_codex":0.003930231,"about_ca_system_score_gemma":0.003290589,"threshold_uncertainty_score":0.072968245},"labels":[],"label_agreement":null},{"id":"W2043020814","doi":"10.1007/s10479-008-0410-6","title":"A confidence voting process for ranking problems based on support vector machines","year":2008,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","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":"McMaster University","funders":"","keywords":"Support vector machine; Ranking (information retrieval); Computer science; Ranking SVM; Voting; Machine learning; Rank (graph theory); Artificial intelligence; Process (computing); Theory of computation; Data mining; Task (project management); Algorithm; Mathematics; Engineering","score_opus":0.7667455877346339,"score_gpt":0.6232891373877681,"score_spread":0.14345645034686572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043020814","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.007851444,0.00013325876,0.9913119,0.00012201113,0.000038113787,0.00006435828,0.00002583196,0.00011894175,0.00033410778],"genre_scores_gemma":[0.33466572,0.00019197438,0.6623509,0.00014796059,0.00023271494,0.0003671401,0.00033929828,0.000107122556,0.0015971288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9829763,0.008945653,0.0013437389,0.001580708,0.0042789257,0.00087471324],"domain_scores_gemma":[0.95278794,0.032424215,0.0019157685,0.0029813545,0.008826132,0.0010645504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023336697,0.001029107,0.003648971,0.002915183,0.0013385116,0.0031089878,0.0047310493,0.0029611445,0.00337859],"category_scores_gemma":[0.060439695,0.0009139738,0.0020563556,0.0035342267,0.0018619143,0.0049163857,0.0035340185,0.0047310516,0.00072534714],"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.00085342425,0.0004432069,0.0029069073,0.00035394458,0.00032701693,0.00016839075,0.00045919293,0.36509025,0.0037711514,0.081522,0.0044901245,0.5396144],"study_design_scores_gemma":[0.000041253395,0.00010118825,0.00021354711,0.000019936837,0.000030092242,0.000019055022,0.0000162994,0.9767041,0.0009454084,0.021381238,0.00050910865,0.0000186668],"about_ca_topic_score_codex":0.0023820333,"about_ca_topic_score_gemma":0.0018461717,"teacher_disagreement_score":0.023336697,"about_ca_system_score_codex":0.0010222417,"about_ca_system_score_gemma":0.0018665112,"threshold_uncertainty_score":0.123417735},"labels":[],"label_agreement":null},{"id":"W2043465029","doi":"10.1007/s10479-008-0511-2","title":"Supply chain DEA: production possibility set and performance evaluation model","year":2009,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":118,"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":"Supply chain; Benchmarking; Production (economics); Computer science; Set (abstract data type); Supply chain management; Service management; Theory of computation; Supply chain risk management; Operations research; Business; Microeconomics; Economics; Algorithm; Mathematics; Marketing","score_opus":0.555066990663382,"score_gpt":0.5787012297465279,"score_spread":0.02363423908314588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043465029","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.0301687,0.00040023233,0.9594784,0.0003534223,0.000027321561,0.00012434203,0.00038653568,0.00013557677,0.008925551],"genre_scores_gemma":[0.7899341,0.00058813044,0.20119493,0.00006690006,0.000077638884,0.00053715525,0.00045762426,0.000054506352,0.0070890104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967775,0.0019684152,0.00012646541,0.00031012512,0.0006213304,0.00019624761],"domain_scores_gemma":[0.99166554,0.0067775236,0.00037090475,0.0003838315,0.0006620904,0.0001399673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074719265,0.0015692613,0.0018162256,0.0038183413,0.00088615774,0.0031706505,0.002275967,0.002032629,0.005619687],"category_scores_gemma":[0.013800983,0.0010133166,0.002313773,0.0036155547,0.0012720368,0.0041181133,0.0018523177,0.0018661,0.00045214858],"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.00009543503,0.00006724324,0.00045653994,0.00007893521,0.00008164393,0.000059067836,0.00004936046,0.9082781,0.00033137135,0.070822604,0.0004578331,0.019221801],"study_design_scores_gemma":[0.000007107555,0.000027103479,0.00014711355,0.000011862505,0.000022626182,0.00002278688,0.000009828538,0.9718849,0.00016566025,0.027381936,0.00030764224,0.000011441661],"about_ca_topic_score_codex":0.0039976817,"about_ca_topic_score_gemma":0.0023363126,"teacher_disagreement_score":0.0074719265,"about_ca_system_score_codex":0.0025641434,"about_ca_system_score_gemma":0.001580596,"threshold_uncertainty_score":0.039515853},"labels":[],"label_agreement":null},{"id":"W2044329702","doi":"10.1007/s10479-012-1278-z","title":"Modeling and solving a logging camp location problem","year":2012,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":30,"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; Université de Montréal; Transport Canada","funders":"Natural Sciences and Engineering Research Council of Canada; FPInnovations","keywords":"Theory of computation; Logging; Computer science; Programming language; Geography","score_opus":0.25929779822221494,"score_gpt":0.4047320163576586,"score_spread":0.14543421813544366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044329702","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.43827423,0.0007013774,0.5306503,0.0045399484,0.00023320415,0.00021374092,0.00082824676,0.0004681063,0.024090882],"genre_scores_gemma":[0.90361744,0.0003415316,0.08525882,0.0001493627,0.00010439475,0.00013185825,0.00044207022,0.00009278378,0.009861752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994925,0.00023923378,0.000021842947,0.00010711918,0.000048441558,0.00009081833],"domain_scores_gemma":[0.9959408,0.0034708574,0.00018937537,0.000111294394,0.00014680957,0.00014078835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012183476,0.00080297294,0.0011228952,0.0006251417,0.0010491352,0.0019142721,0.002231062,0.003758446,0.0071047586],"category_scores_gemma":[0.0064537013,0.0011258374,0.0011402777,0.000994368,0.0012897981,0.0027226189,0.0014866294,0.0020383059,0.0002611278],"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.00003219237,0.00005106259,0.00056528253,0.000028193661,0.000011383601,0.00007205376,0.000039648072,0.98843956,0.00008153213,0.007306912,0.0005804645,0.0027916478],"study_design_scores_gemma":[0.000011882675,0.000008604321,0.000051983916,0.0000029416733,0.00000552504,0.0000068304694,0.000034628854,0.9948466,0.000040211453,0.0047880653,0.0002002356,0.0000025461532],"about_ca_topic_score_codex":0.04522398,"about_ca_topic_score_gemma":0.027229492,"teacher_disagreement_score":0.04522398,"about_ca_system_score_codex":0.0011800706,"about_ca_system_score_gemma":0.0020813171,"threshold_uncertainty_score":0.089921474},"labels":[],"label_agreement":null},{"id":"W2044675809","doi":"10.1007/s10479-013-1311-x","title":"Timing order fulfillment of capital goods under a constrained capacity","year":2013,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Product Development and Customization","field":"Business, Management and Accounting","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":"University of Waterloo","funders":"Fundamental Research Funds for the Central Universities; Hong Kong University of Science and Technology; National Natural Science Foundation of China","keywords":"Markov decision process; Order (exchange); Build to order; Computer science; Mathematical optimization; Process (computing); Product (mathematics); Value (mathematics); Theory of computation; Capital good; Work (physics); Production (economics); Markov process; Operations research; Microeconomics; Economics; Mathematics; Public good; Algorithm","score_opus":0.2095976756925073,"score_gpt":0.36842889084022745,"score_spread":0.15883121514772014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044675809","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.49252114,0.00096668815,0.4686629,0.0017590729,0.00023877836,0.00028245972,0.0010064121,0.0005217633,0.034040805],"genre_scores_gemma":[0.9673547,0.00041137726,0.018031199,0.00007665975,0.00007669266,0.000074357034,0.00032165478,0.00013222068,0.013521255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967955,0.0008382902,0.00022588993,0.00046145706,0.0006239817,0.0010549704],"domain_scores_gemma":[0.9738975,0.017526023,0.0032612456,0.0014198199,0.0016617234,0.002233638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004081021,0.0015335169,0.003471746,0.0021769623,0.0014947612,0.0066124704,0.0028624048,0.0026200127,0.0077421693],"category_scores_gemma":[0.020487221,0.0017183193,0.0017417272,0.0026655153,0.003346908,0.00543575,0.0029785777,0.0025839894,0.00053743436],"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.000863643,0.00012464891,0.001028899,0.00020375378,0.000087934546,0.00096217287,0.0003577317,0.5656615,0.00554783,0.41581392,0.001774646,0.007573231],"study_design_scores_gemma":[0.000076415876,0.00016260316,0.0004470611,0.00002984366,0.000040724204,0.00011719911,0.00015531336,0.8537533,0.001956404,0.1422061,0.0009923966,0.00006267147],"about_ca_topic_score_codex":0.0125439875,"about_ca_topic_score_gemma":0.0051612756,"teacher_disagreement_score":0.0125439875,"about_ca_system_score_codex":0.0035785916,"about_ca_system_score_gemma":0.0035533092,"threshold_uncertainty_score":0.025964618},"labels":[],"label_agreement":null},{"id":"W2045728330","doi":"10.1007/s10479-014-1581-y","title":"Relief distribution networks: a systematic review","year":2014,"lang":"en","type":"review","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":243,"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é Laval","funders":"","keywords":"Variety (cybernetics); Emergency management; Systematic review; Distribution (mathematics); Computer science; Data science; Field (mathematics); Management science; Operations research; Political science; Economics; Artificial intelligence; Engineering","score_opus":0.3010963451300899,"score_gpt":0.46867135395707127,"score_spread":0.16757500882698134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045728330","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009857634,0.99686086,0.00018881458,0.0003385372,0.00012221925,0.00049815973,0.00074611657,0.000009437146,0.0002501635],"genre_scores_gemma":[0.019365834,0.97777224,0.0010103768,0.00070269284,0.000062572035,0.0007005207,0.0002244448,0.000006471038,0.0001548531],"study_design_codex":"systematic_review","study_design_gemma":"systematic_review","domain_scores_codex":[0.98590916,0.005153996,0.0053162067,0.00097120495,0.0022046529,0.0004448765],"domain_scores_gemma":[0.9599805,0.02578785,0.010023111,0.0006681172,0.0030039754,0.0005363828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01130095,0.002004822,0.0093291905,0.018420283,0.0007607221,0.0036825426,0.0020952318,0.0025059544,0.00787958],"category_scores_gemma":[0.057512376,0.0016236448,0.006495937,0.017964955,0.0013796128,0.004087701,0.0028474065,0.0018241032,0.00040667545],"study_design_candidate":"systematic_review","study_design_consensus":"systematic_review","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.00015247101,0.00002129269,0.0008129194,0.96277905,0.008505647,0.00010812989,0.00022411231,0.00010207135,0.0000565819,0.00020607207,0.0020457255,0.024986003],"study_design_scores_gemma":[0.0004990027,0.0001528217,0.003441039,0.90190107,0.07248652,0.00035486036,0.00064635294,0.0000729204,0.000089755915,0.00038102598,0.019922776,0.000051774674],"about_ca_topic_score_codex":0.011468635,"about_ca_topic_score_gemma":0.054161336,"teacher_disagreement_score":0.018420283,"about_ca_system_score_codex":0.006007831,"about_ca_system_score_gemma":0.019446265,"threshold_uncertainty_score":0.059765875},"labels":[],"label_agreement":null},{"id":"W2046593695","doi":"10.1007/s10479-014-1726-z","title":"Maximizing the minimum cover probability by emergency facilities","year":2014,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":13,"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":"Facility location problem; Theory of computation; Cover (algebra); Computer science; Location model; Mathematical optimization; 1-center problem; Plane (geometry); Operations research; Algorithm; Mathematics; Engineering","score_opus":0.2223166886865235,"score_gpt":0.3784368857011514,"score_spread":0.15612019701462793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046593695","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.5010311,0.0010876191,0.46085814,0.00340198,0.00012795728,0.00014199893,0.001228411,0.00054055225,0.031582262],"genre_scores_gemma":[0.97473425,0.00038256467,0.019140188,0.000077038494,0.00012943507,0.000053625587,0.00021548671,0.000080081925,0.0051873103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861276,0.00073613384,0.00003606285,0.0001617659,0.00016013443,0.00029316053],"domain_scores_gemma":[0.9914119,0.006837711,0.00052683894,0.0004506146,0.00032911092,0.00044378018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013104947,0.0007714844,0.0020565963,0.0008731746,0.00063371006,0.0019911968,0.001794693,0.0019189004,0.0071577383],"category_scores_gemma":[0.010466562,0.0010575604,0.00077370665,0.0017876363,0.00083920197,0.0026496123,0.0011540722,0.0012180158,0.0006200612],"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.0006596117,0.00014390965,0.00294588,0.00019237358,0.00010905406,0.00021789742,0.00009709168,0.8961772,0.0024252352,0.053257752,0.0068857116,0.036888402],"study_design_scores_gemma":[0.000050871135,0.000100496596,0.0018401023,0.000021606154,0.000033757817,0.00013059676,0.00005797219,0.94575804,0.0010200264,0.04958886,0.0013785344,0.000019125697],"about_ca_topic_score_codex":0.002269638,"about_ca_topic_score_gemma":0.0021563065,"teacher_disagreement_score":0.0071577383,"about_ca_system_score_codex":0.001361706,"about_ca_system_score_gemma":0.0010297582,"threshold_uncertainty_score":0.023945034},"labels":[],"label_agreement":null},{"id":"W2048695913","doi":"10.1007/s10479-006-0030-y","title":"Evaluation of Commodity Trading Advisors using fixed and variable and benchmark models","year":2006,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":13,"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":"McGill University; U.S. Department of the Treasury","keywords":"Benchmarking; Futures contract; Benchmark (surveying); Data envelopment analysis; Variable (mathematics); Commodity; Theory of computation; Computer science; Econometrics; Order (exchange); Economics; Class (philosophy); Operations research; Mathematical optimization; Financial economics; Mathematics; Finance; Artificial intelligence; Algorithm","score_opus":0.6627674920073058,"score_gpt":0.5631415581296619,"score_spread":0.09962593387764385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048695913","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.95602393,0.00062736176,0.036924355,0.000548362,0.00007785489,0.00018599526,0.00044394835,0.000338074,0.004830123],"genre_scores_gemma":[0.9883664,0.000096343436,0.010446818,0.000023515775,0.000014426543,0.000043700704,0.00024537745,0.00002105927,0.0007423698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9919151,0.0059660687,0.00035411015,0.0005511847,0.00070861017,0.00050482084],"domain_scores_gemma":[0.89078975,0.098101266,0.002328683,0.002630782,0.004535819,0.0016137355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021460772,0.0016096882,0.002605333,0.0030309688,0.000995947,0.0036667504,0.0020697126,0.0034844424,0.003457308],"category_scores_gemma":[0.05651939,0.00085039425,0.0011471978,0.0022168262,0.0011487752,0.0037237727,0.0011228042,0.0019619165,0.0002567708],"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.0019423183,0.00057043065,0.0043710126,0.000093726536,0.00012381464,0.00004252623,0.000032654414,0.97398686,0.00024180126,0.0026959116,0.0004915882,0.015407342],"study_design_scores_gemma":[0.0001577727,0.00030757143,0.000718242,0.000008423065,0.000036775073,0.0000080641485,0.0000452673,0.9972242,0.0004266677,0.00095672446,0.00009953171,0.00001076546],"about_ca_topic_score_codex":0.013802523,"about_ca_topic_score_gemma":0.008120526,"teacher_disagreement_score":0.021460772,"about_ca_system_score_codex":0.0047527226,"about_ca_system_score_gemma":0.004104581,"threshold_uncertainty_score":0.11349678},"labels":[],"label_agreement":null},{"id":"W2050895424","doi":"10.1007/s10479-009-0520-9","title":"Using the bootstrap method to detect influential DMUs in data envelopment analysis","year":2009,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","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":"York University","funders":"","keywords":"Data envelopment analysis; Nonparametric statistics; Computer science; Econometrics; Entropy (arrow of time); Theory of computation; Statistical hypothesis testing; Measure (data warehouse); Statistics; Mathematics; Data mining; Algorithm","score_opus":0.8060750286230988,"score_gpt":0.679957794039324,"score_spread":0.12611723458377477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050895424","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.21987918,0.00031457873,0.77587336,0.00021065192,0.000057822923,0.0001451532,0.0001029898,0.00019716413,0.0032190485],"genre_scores_gemma":[0.872143,0.00012131448,0.12664942,0.000050303617,0.00004409082,0.0002025887,0.00022452213,0.00006729417,0.00049742206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9885074,0.007605685,0.00040946057,0.00071595854,0.002306899,0.0004546066],"domain_scores_gemma":[0.8878057,0.09821196,0.0027430872,0.004038808,0.006350381,0.0008499941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022134783,0.00094681897,0.0020010248,0.0061213677,0.0015829176,0.0016313359,0.0013359797,0.001538218,0.0019275802],"category_scores_gemma":[0.12073831,0.0004855079,0.0014588041,0.003964789,0.0010831733,0.0021318458,0.0019835532,0.0015930382,0.0003757843],"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.0015686855,0.00092450593,0.10062788,0.00055574614,0.0019015939,0.0011868011,0.0013142881,0.3222816,0.009750497,0.0887794,0.003119055,0.46798998],"study_design_scores_gemma":[0.00007377935,0.00022565613,0.012154513,0.000060444796,0.00012485695,0.00019012537,0.00030173385,0.9433466,0.003058227,0.039137397,0.0012726509,0.000054019736],"about_ca_topic_score_codex":0.0020943624,"about_ca_topic_score_gemma":0.0017988313,"teacher_disagreement_score":0.022134783,"about_ca_system_score_codex":0.0006384541,"about_ca_system_score_gemma":0.0016528119,"threshold_uncertainty_score":0.11706132},"labels":[],"label_agreement":null},{"id":"W2051214760","doi":"10.1007/s10479-007-0222-0","title":"Bechtold-Jacobs generalized model for shift scheduling with extraordinary overlap","year":2007,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","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","funders":"","keywords":"Theory of computation; Generalization; Computation; Scheduling (production processes); Constraint (computer-aided design); Mathematics; Set (abstract data type); Flexibility (engineering); Computer science; Mathematical optimization; Mathematical economics; Applied mathematics; Algorithm; Statistics","score_opus":0.6644205714305607,"score_gpt":0.5886680585233595,"score_spread":0.0757525129072012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051214760","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.08310014,0.0010329552,0.9003958,0.001745947,0.00033106163,0.0001418603,0.00070642104,0.00022579108,0.0123200305],"genre_scores_gemma":[0.88180655,0.0013353085,0.08027159,0.00036003077,0.00033832423,0.00047762942,0.0006654577,0.00015798378,0.034587298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987368,0.00044323932,0.00004742078,0.00022286494,0.00023318322,0.0003165345],"domain_scores_gemma":[0.99790597,0.0011420976,0.00021291396,0.00016018676,0.00032090052,0.00025787664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021429914,0.0013491516,0.0032835025,0.0012139302,0.0012426185,0.0022394187,0.0034838081,0.0030616422,0.0068696635],"category_scores_gemma":[0.0060225767,0.0010438632,0.0015836903,0.00210343,0.0019873676,0.0027198405,0.0021684451,0.0029847594,0.0006809605],"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.00008839311,0.00004903643,0.0002542503,0.000067031186,0.00003663085,0.000090920075,0.0000714128,0.8983831,0.00043744914,0.09425252,0.0018018176,0.0044675567],"study_design_scores_gemma":[0.000015455105,0.000017411461,0.00009417674,0.00000496175,0.000008649791,0.000011907468,0.000018394237,0.96229506,0.0000503862,0.03708101,0.0003928217,0.000009683288],"about_ca_topic_score_codex":0.019436566,"about_ca_topic_score_gemma":0.013892453,"teacher_disagreement_score":0.019436566,"about_ca_system_score_codex":0.0026160283,"about_ca_system_score_gemma":0.0033180695,"threshold_uncertainty_score":0.038646877},"labels":[],"label_agreement":null},{"id":"W2051632436","doi":"10.1007/s10479-015-1797-5","title":"New local searches for solving the multi-source Weber problem","year":2015,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":47,"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":"Heuristics; Delaunay triangulation; Heuristic; Theory of computation; Metaheuristic; Triangulation; Mathematical optimization; Computer science; Constructive; Variety (cybernetics); Decomposition; Quality (philosophy); Mathematics; Algorithm; Artificial intelligence","score_opus":0.513336972344693,"score_gpt":0.4481032581850867,"score_spread":0.06523371415960633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051632436","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.04699515,0.001053381,0.94141656,0.0007298861,0.00013110245,0.00014511358,0.000163932,0.00053240266,0.0088325115],"genre_scores_gemma":[0.38229066,0.00060247304,0.6044642,0.00022892501,0.00021113035,0.00047336167,0.0004502892,0.00046426203,0.010814751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985475,0.00072283356,0.00008720288,0.00023854442,0.00025057793,0.0001532278],"domain_scores_gemma":[0.98711073,0.010994323,0.000471939,0.00052337075,0.00060189876,0.00029769578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031156836,0.0011474481,0.0029696838,0.003583788,0.0015831527,0.002362662,0.0034373836,0.003043613,0.009612902],"category_scores_gemma":[0.025295064,0.0012681622,0.0016234106,0.0036230106,0.0019978278,0.006583501,0.0040264744,0.0023206926,0.00095401745],"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.0007015576,0.00043023613,0.0015946104,0.00056436204,0.0002196436,0.0002543528,0.00060856785,0.6087342,0.001293133,0.1989269,0.009336099,0.17733644],"study_design_scores_gemma":[0.00008607295,0.000045486908,0.00009647006,0.000025379817,0.000025969568,0.000034174234,0.000071852475,0.92845535,0.00022203832,0.07001764,0.00089982786,0.000019797042],"about_ca_topic_score_codex":0.004248192,"about_ca_topic_score_gemma":0.006111727,"teacher_disagreement_score":0.009612902,"about_ca_system_score_codex":0.0012678831,"about_ca_system_score_gemma":0.0015005821,"threshold_uncertainty_score":0.032158315},"labels":[],"label_agreement":null},{"id":"W205201433","doi":"10.1023/a:1014517910427","title":"A Tabu Search Algorithm for Access Network Design","year":2001,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":21,"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; Institut National de la Recherche Scientifique","funders":"","keywords":"Synchronous optical networking; Computer science; Tabu search; Hierarchy; Set (abstract data type); Transmission (telecommunications); Computer network; Distributed computing; Theory of computation; Population; Tree (set theory); Variety (cybernetics); Telecommunications; Algorithm; Mathematics","score_opus":0.33836952596985304,"score_gpt":0.47513391503803926,"score_spread":0.13676438906818622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W205201433","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.01810802,0.0013138318,0.96834105,0.0004058416,0.00020736615,0.00027479278,0.00046989074,0.0027587423,0.008120424],"genre_scores_gemma":[0.117827974,0.00038496815,0.8751347,0.00025105622,0.000106378546,0.0005779448,0.0006921369,0.00039439555,0.0046304488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990702,0.00046397155,0.000036841255,0.00012887565,0.00019000052,0.00011018336],"domain_scores_gemma":[0.99705505,0.0022524148,0.00010264567,0.00014810961,0.00036760862,0.00007415944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018030119,0.0015813502,0.0020419299,0.002740719,0.0013092577,0.001334798,0.0021508804,0.002464724,0.015624113],"category_scores_gemma":[0.0064646713,0.0012337269,0.0011709756,0.003601862,0.00101782,0.0017885605,0.0009587639,0.0016567546,0.0019704716],"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.00024832538,0.00017960153,0.00041854524,0.00015934985,0.00007446075,0.000050966206,0.00006956263,0.7190906,0.00077446835,0.009831248,0.014527373,0.25457552],"study_design_scores_gemma":[0.000080772894,0.000054719232,0.00007631921,0.000015238052,0.000017643977,0.000017785584,0.000014325875,0.99111724,0.00018171668,0.0072368393,0.0011805155,0.000006837716],"about_ca_topic_score_codex":0.011162851,"about_ca_topic_score_gemma":0.009226293,"teacher_disagreement_score":0.015624113,"about_ca_system_score_codex":0.0015732499,"about_ca_system_score_gemma":0.0025881063,"threshold_uncertainty_score":0.05226785},"labels":[],"label_agreement":null},{"id":"W2053855832","doi":"10.1007/s10479-006-0148-y","title":"Coordinating decentralized local schedulers in complex supply chain manufacturing","year":2006,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Simon Fraser University","funders":"","keywords":"Scheduling (production processes); Computer science; Supply chain; Theory of computation; Distributed computing; Schedule; Production schedule; Dynamic priority scheduling; Job shop scheduling; Production planning; Industrial engineering; Production (economics); Operations management; Engineering; Business; Algorithm","score_opus":0.10344290171120704,"score_gpt":0.3753957638955624,"score_spread":0.2719528621843553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053855832","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.24158023,0.00051877805,0.7523014,0.0008245139,0.00016864824,0.000131273,0.000095613956,0.00044023016,0.0039393343],"genre_scores_gemma":[0.96940315,0.00013502319,0.02864715,0.00005690213,0.00006637343,0.00006821487,0.000046902172,0.000041443556,0.0015348645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985297,0.00065867446,0.000070994036,0.00032213752,0.00017636332,0.00024219498],"domain_scores_gemma":[0.99369824,0.0041797506,0.0005738392,0.0005150041,0.000523525,0.00050965743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040714773,0.0006232098,0.0020822068,0.0005865839,0.0014086686,0.0019198889,0.002306255,0.0013754829,0.0028457106],"category_scores_gemma":[0.008300295,0.0010536325,0.00040736067,0.0016978564,0.0015570741,0.0017911198,0.002310549,0.0011645883,0.0003762182],"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.0003069539,0.00008728335,0.0006661298,0.000046329544,0.00003703823,0.000060360668,0.00009703826,0.9737099,0.0010305999,0.009181595,0.00091403286,0.013862705],"study_design_scores_gemma":[0.000031394946,0.000032795266,0.000104031984,0.0000015531765,0.000008296657,0.0000051753445,0.000028868288,0.9940455,0.00020872906,0.0053438027,0.00018548306,0.0000044305666],"about_ca_topic_score_codex":0.0047654565,"about_ca_topic_score_gemma":0.0078098085,"teacher_disagreement_score":0.0047654565,"about_ca_system_score_codex":0.0014448893,"about_ca_system_score_gemma":0.0022412979,"threshold_uncertainty_score":0.021532297},"labels":[],"label_agreement":null},{"id":"W2055312886","doi":"10.1007/s10479-011-1000-6","title":"Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries","year":2011,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":26,"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","keywords":"Due date; Theory of computation; Polynomial-time approximation scheme; Mathematical optimization; Scheduling (production processes); Computer science; Job shop scheduling; Time complexity; Approximation algorithm; Scheme (mathematics); Mathematics; Algorithm; Schedule","score_opus":0.16662900496635066,"score_gpt":0.3454053241298946,"score_spread":0.17877631916354395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055312886","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.16058636,0.0016196099,0.8297866,0.00076171954,0.00040896234,0.00035370523,0.0005385337,0.00040989436,0.0055346456],"genre_scores_gemma":[0.70526415,0.0011890339,0.27427918,0.00018815704,0.00038677835,0.0004004416,0.00064781867,0.00065034174,0.016994113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777335,0.0009110809,0.00013349336,0.00034815277,0.00047218186,0.00036174376],"domain_scores_gemma":[0.99575377,0.0027599323,0.0005227299,0.00020689456,0.00042384292,0.00033276662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003594009,0.0025745032,0.0030881574,0.0016697239,0.00094294787,0.002176019,0.0036430832,0.0022244407,0.0035857672],"category_scores_gemma":[0.00747379,0.0019062498,0.0012307363,0.0025132415,0.0010284779,0.0026914044,0.0012297836,0.0016523235,0.00047325192],"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.00047813114,0.00013698993,0.0004203862,0.00037022293,0.00012018026,0.00014437332,0.000056405894,0.9709801,0.0033405365,0.0068685915,0.0014370737,0.015646996],"study_design_scores_gemma":[0.000037861177,0.00014652833,0.0003073248,0.00001498668,0.00003270861,0.000069206304,0.000028967115,0.9893476,0.0011918845,0.008276175,0.0005302951,0.00001654867],"about_ca_topic_score_codex":0.003671654,"about_ca_topic_score_gemma":0.003698343,"teacher_disagreement_score":0.003671654,"about_ca_system_score_codex":0.0018930995,"about_ca_system_score_gemma":0.002090004,"threshold_uncertainty_score":0.019007146},"labels":[],"label_agreement":null},{"id":"W2056235974","doi":"10.1007/s10479-012-1168-4","title":"A cardinality constrained stochastic goal programming model with satisfaction functions for venture capital investment decision making","year":2012,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Laurentian University","funders":"","keywords":"Venture capital; Portfolio; Investment (military); Cardinality (data modeling); Social venture capital; Theory of computation; Business; Capital investment; Resource (disambiguation); Selection (genetic algorithm); Goal programming; Economics; Microeconomics; Computer science; Finance; Industrial organization; Operations research; Mathematics; Artificial intelligence","score_opus":0.12974704198774223,"score_gpt":0.4075030370474891,"score_spread":0.27775599505974685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056235974","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.053077795,0.00059820974,0.934019,0.0021622353,0.000118367796,0.0001722895,0.00070912385,0.00016585265,0.008977084],"genre_scores_gemma":[0.85795885,0.00079029775,0.12709156,0.00034061543,0.00018612195,0.0006066009,0.0006773052,0.00010109725,0.012247552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965198,0.0020534205,0.00012993436,0.00047584495,0.0004038827,0.00041702174],"domain_scores_gemma":[0.9928844,0.0054635853,0.0005723446,0.0001968526,0.00044875263,0.0004340917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004583159,0.0016553759,0.003098135,0.0011283644,0.0007840519,0.0035864897,0.0030249301,0.0037405274,0.0049684364],"category_scores_gemma":[0.010594694,0.0016611068,0.0018371325,0.0020918658,0.0018471183,0.0033808448,0.0026300838,0.004272275,0.00047581372],"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.00007660946,0.00006885918,0.0003401277,0.000065787586,0.000058335903,0.00010987265,0.000068487316,0.9100334,0.00023301468,0.08427625,0.00096761313,0.0037015283],"study_design_scores_gemma":[0.000015497195,0.000019080573,0.00006599484,0.00000836982,0.000010586125,0.00000967508,0.000012838526,0.98042977,0.000038939335,0.019157607,0.00022311993,0.000008478071],"about_ca_topic_score_codex":0.0096278805,"about_ca_topic_score_gemma":0.0066730864,"teacher_disagreement_score":0.0096278805,"about_ca_system_score_codex":0.0028188745,"about_ca_system_score_gemma":0.0024847207,"threshold_uncertainty_score":0.024238408},"labels":[],"label_agreement":null},{"id":"W2057126536","doi":"10.1007/s10479-007-0217-x","title":"Towards a practical engineering tool for rostering","year":2007,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":6,"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":"Engineering and Physical Sciences Research Council; Atomic Energy of Canada Limited; University of Essex","keywords":"Computer science; Constraint programming; Concurrent constraint logic programming; Constraint satisfaction; Backtracking; Mathematical optimization; Constraint satisfaction problem; Constraint logic programming; Scheduling (production processes); Constraint learning; Solver; Artificial intelligence; Algorithm; Mathematics; Programming language; Stochastic programming","score_opus":0.7148603109203584,"score_gpt":0.6397327812247123,"score_spread":0.07512752969564607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057126536","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.00071265304,0.000013045658,0.9968721,0.00009054576,0.000016929494,0.000027931726,0.000026649972,0.00094648293,0.0012937597],"genre_scores_gemma":[0.02059007,0.000058295976,0.9767323,0.000052492585,0.000020838588,0.000093443756,0.00010380941,0.00032008713,0.0020285663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855334,0.000358494,0.000119395874,0.00018415839,0.00069577637,0.00008885831],"domain_scores_gemma":[0.9973726,0.0013218495,0.00012010741,0.0006339068,0.00046638347,0.00008510793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019588256,0.0012877512,0.0008522762,0.001280482,0.00083558063,0.002145826,0.0027325128,0.0014710047,0.019257048],"category_scores_gemma":[0.008818045,0.0009258321,0.0012338784,0.0010349103,0.001157004,0.0026816218,0.003166411,0.002810407,0.004466967],"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.000111819565,0.00022631965,0.00061441143,0.00036693274,0.00005320608,0.00031094215,0.0003593293,0.20813768,0.013353785,0.3128735,0.0111813815,0.4524107],"study_design_scores_gemma":[0.000035712692,0.00006583357,0.00010598177,0.00007460234,0.000021445698,0.00019326308,0.00008483418,0.78640395,0.0048872717,0.17244594,0.035656758,0.000024363071],"about_ca_topic_score_codex":0.0012913882,"about_ca_topic_score_gemma":0.0018411707,"teacher_disagreement_score":0.019257048,"about_ca_system_score_codex":0.00049783,"about_ca_system_score_gemma":0.0010682722,"threshold_uncertainty_score":0.06442124},"labels":[],"label_agreement":null},{"id":"W2057292389","doi":"10.1007/s10479-008-0400-8","title":"ADTreesLogit model for customer churn prediction","year":2008,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Customer churn and segmentation","field":"Business, Management and Accounting","cited_by":45,"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":"Interpretability; Computer science; Tournament; Predictive modelling; CONTEST; Machine learning; Logistic regression; Artificial intelligence; Predictive analytics; Data mining; Mathematics","score_opus":0.44721775356797716,"score_gpt":0.43697198395609144,"score_spread":0.010245769611885724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057292389","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.26912916,0.0036274865,0.6990104,0.0045233574,0.0006170642,0.00016788753,0.010331593,0.004652892,0.007940315],"genre_scores_gemma":[0.8874673,0.0011098235,0.07543097,0.00061594904,0.00038955605,0.00037310744,0.008595943,0.00031123942,0.025706079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912816,0.00043076734,0.000050079823,0.00017196637,0.0001042981,0.00011475287],"domain_scores_gemma":[0.99410963,0.004541791,0.00022907196,0.0003396501,0.00061675406,0.00016316747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003121207,0.001199217,0.0018650406,0.0014304345,0.0012849333,0.0017604873,0.0030212037,0.002424039,0.010359373],"category_scores_gemma":[0.006280265,0.0010231341,0.0012171036,0.0020126242,0.0007382238,0.0028532422,0.0010867438,0.0036107807,0.0028095318],"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.0005473936,0.00032284795,0.005616809,0.00011402074,0.0001117913,0.000119940036,0.00008085359,0.8788134,0.00033027827,0.012654772,0.010166591,0.09112131],"study_design_scores_gemma":[0.000011868086,0.000015074591,0.00020256035,0.000005095626,0.000009074923,0.000006577887,0.000005600812,0.99458367,0.00007994012,0.004621037,0.00045423146,0.000005249308],"about_ca_topic_score_codex":0.026570542,"about_ca_topic_score_gemma":0.035640944,"teacher_disagreement_score":0.026570542,"about_ca_system_score_codex":0.0017990146,"about_ca_system_score_gemma":0.001808573,"threshold_uncertainty_score":0.05283177},"labels":[],"label_agreement":null},{"id":"W2058073949","doi":"10.1007/s10479-008-0341-2","title":"The multiple server center location problem","year":2008,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":54,"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":"Server; Computer science; Computer network; Heuristic; Node (physics); Theory of computation; Center (category theory); Distributed computing; Algorithm; Artificial intelligence; Engineering","score_opus":0.2903116292438712,"score_gpt":0.3903968923203422,"score_spread":0.10008526307647098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058073949","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.16927023,0.008106272,0.6725876,0.05532079,0.0017429385,0.00024506287,0.0032397157,0.0008864626,0.08860096],"genre_scores_gemma":[0.88200873,0.0042204205,0.06958085,0.0015966154,0.0022201126,0.00020537962,0.0017418885,0.00033841972,0.03808754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945385,0.0022922205,0.00023553711,0.001237134,0.0009861914,0.00071042666],"domain_scores_gemma":[0.9753568,0.01923753,0.0014231356,0.0014823285,0.0015309235,0.0009691753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044313916,0.0010814525,0.0032076824,0.0015368208,0.0028623722,0.0058801793,0.0039623794,0.007401735,0.02415],"category_scores_gemma":[0.024239529,0.0018516585,0.0012389389,0.0056685857,0.0030687207,0.012080896,0.0034832337,0.005197481,0.0022259736],"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.0006667576,0.00030704265,0.0042240922,0.00047431324,0.00028246685,0.0012749563,0.00037069456,0.24620321,0.0007646287,0.57972515,0.09745741,0.06824928],"study_design_scores_gemma":[0.000239043,0.000059006976,0.001009063,0.00007445322,0.0000876682,0.0011805679,0.00052583945,0.36931354,0.00057151285,0.6130305,0.0138491765,0.00005969866],"about_ca_topic_score_codex":0.0035279565,"about_ca_topic_score_gemma":0.0031949757,"teacher_disagreement_score":0.02415,"about_ca_system_score_codex":0.002404908,"about_ca_system_score_gemma":0.0020053105,"threshold_uncertainty_score":0.080789864},"labels":[],"label_agreement":null},{"id":"W2058302761","doi":"10.1007/s10479-006-7371-4","title":"On the interaction between retailers inventory policies and manufacturer trade deals in response to supply-uncertainty occurrences","year":2006,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":15,"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 Fredericton; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Interval (graph theory); Point (geometry); Duration (music); Random variable; Operations research; Computer science; Variable (mathematics); Probability distribution; Supply chain; Distribution (mathematics); Mathematical optimization; Econometrics; Industrial organization; Microeconomics; Business; Economics; Mathematics; Statistics; Marketing; Algorithm","score_opus":0.1807015972807431,"score_gpt":0.39512304098745193,"score_spread":0.21442144370670885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058302761","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.97435015,0.0004110096,0.008768698,0.003243486,0.00006648597,0.00004335287,0.00025081183,0.000047212965,0.0128188925],"genre_scores_gemma":[0.9983405,0.00013672673,0.0003310619,0.00006183662,0.00002159952,0.000008041939,0.000042099713,0.000010853103,0.0010473104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899024,0.00051358424,0.000047132995,0.00011643255,0.00009574732,0.00023683386],"domain_scores_gemma":[0.92710817,0.06822848,0.002326683,0.0005008639,0.0009248406,0.0009109757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004302153,0.00031765655,0.000840754,0.00069609564,0.0006085818,0.00342485,0.0008962892,0.001896894,0.008086334],"category_scores_gemma":[0.028670166,0.0006047301,0.00066845637,0.0009564229,0.0014234831,0.002227423,0.0011101697,0.002369138,0.00040700857],"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.0062805493,0.0012705207,0.1442678,0.00033657422,0.0007195334,0.0021778636,0.0030458972,0.6793423,0.010756051,0.1052992,0.007599055,0.038904686],"study_design_scores_gemma":[0.00011583475,0.00037584797,0.07803484,0.000043317075,0.00023260652,0.00018572177,0.0034102483,0.84236,0.0011551667,0.07251072,0.0014567345,0.00011896706],"about_ca_topic_score_codex":0.008040852,"about_ca_topic_score_gemma":0.007752745,"teacher_disagreement_score":0.008086334,"about_ca_system_score_codex":0.001372012,"about_ca_system_score_gemma":0.0008838195,"threshold_uncertainty_score":0.027051449},"labels":[],"label_agreement":null},{"id":"W2058354071","doi":"10.1007/s10479-007-0303-0","title":"Stationary tail asymptotics of a tandem queue with feedback","year":2007,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Queue; Fork–join queue; Bulk queue; Multilevel queue; Computer science; Mathematics; Queue management system; Computer network","score_opus":0.1236258459482162,"score_gpt":0.40466427930456744,"score_spread":0.28103843335635126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058354071","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.30596706,0.003296029,0.6595429,0.004445007,0.00075848034,0.00017654356,0.00062645535,0.0017137994,0.023473654],"genre_scores_gemma":[0.96191114,0.0013874674,0.017241979,0.00046143684,0.00068155176,0.00016993454,0.000346542,0.00027114342,0.017528871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983032,0.00046030563,0.00005908965,0.0002661755,0.0005268482,0.0003842806],"domain_scores_gemma":[0.97484076,0.015905067,0.0021638605,0.0010361385,0.004455996,0.0015982873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007032577,0.0017431986,0.0026461254,0.0038564699,0.001655569,0.0031026716,0.004359854,0.0032590583,0.0067596114],"category_scores_gemma":[0.04394555,0.0014902147,0.0013756512,0.0023560163,0.0049623367,0.0059689116,0.003153086,0.0042151595,0.001135185],"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.0004450811,0.00028810836,0.0033996804,0.0003328338,0.00011243575,0.00066070945,0.0007870767,0.31689852,0.01158445,0.6446319,0.00595297,0.014906234],"study_design_scores_gemma":[0.000045872228,0.00006426236,0.0007933936,0.00004223623,0.00004567239,0.0001419864,0.00009324758,0.9131732,0.0005494516,0.08457768,0.0004140491,0.00005884059],"about_ca_topic_score_codex":0.010278687,"about_ca_topic_score_gemma":0.0049314597,"teacher_disagreement_score":0.010278687,"about_ca_system_score_codex":0.004871156,"about_ca_system_score_gemma":0.0038817967,"threshold_uncertainty_score":0.037192225},"labels":[],"label_agreement":null},{"id":"W2060085351","doi":"10.1007/s10479-011-0869-4","title":"A survey of optimization models on cancer chemotherapy treatment planning","year":2011,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Mathematical Biology Tumor Growth","field":"Mathematics","cited_by":104,"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":"Division of Civil, Mechanical and Manufacturing Innovation; National Science Foundation","keywords":"Chemotherapy; Computer science; Colorectal cancer; Theory of computation; Limit (mathematics); Cancer treatment; Cancer chemotherapy; Cancer; Medicine; Mathematics; Surgery; Algorithm; Internal medicine","score_opus":0.7989043348658895,"score_gpt":0.5617408224880779,"score_spread":0.23716351237781164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060085351","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010579706,0.2819849,0.6698197,0.010256296,0.0007085032,0.000067922796,0.0007925474,0.00016259465,0.025627814],"genre_scores_gemma":[0.2396645,0.5204021,0.21513021,0.0021687376,0.004785448,0.00028126172,0.0016248642,0.0002763187,0.015666537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"systematic_review","domain_scores_codex":[0.9989281,0.00049818144,0.0000892211,0.00014532014,0.00027559118,0.00006358892],"domain_scores_gemma":[0.9980677,0.0014131631,0.0001525191,0.00009494209,0.00021268665,0.000058980575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020716714,0.0014072733,0.0021702638,0.0019627896,0.0005083709,0.002954128,0.0016151652,0.0016162735,0.0033107668],"category_scores_gemma":[0.004543993,0.0010214404,0.0016518695,0.0055358578,0.0008324847,0.0030192079,0.00092285476,0.0019662618,0.00075093517],"study_design_candidate":"systematic_review","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.000058788763,0.00016697316,0.0015603848,0.0013228173,0.00017043276,0.000098120465,0.0000791838,0.40396187,0.00040008433,0.36533582,0.02083738,0.20600824],"study_design_scores_gemma":[0.000014814909,0.00007477123,0.00077081076,0.00035182672,0.00007359264,0.00016999306,0.000060952978,0.59328127,0.00019164906,0.35717183,0.047802433,0.000036045527],"about_ca_topic_score_codex":0.0043738107,"about_ca_topic_score_gemma":0.004188053,"teacher_disagreement_score":0.0043738107,"about_ca_system_score_codex":0.001985289,"about_ca_system_score_gemma":0.0016547462,"threshold_uncertainty_score":0.014404297},"labels":[],"label_agreement":null},{"id":"W2062940315","doi":"10.1007/s10479-015-1839-z","title":"Socially responsible service operations management: an overview","year":2015,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Customer Service Quality and Loyalty","field":"Business, Management and Accounting","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 Toronto","funders":"","keywords":"Service design; Service delivery framework; Service (business); Service provider; Social responsibility; Service product management; Service system; Service level objective; Process management; Business; Service management; Service guarantee; Computer science; Marketing; Public relations; Knowledge management; Supply chain management; Political science; Supply chain","score_opus":0.572818528833708,"score_gpt":0.5040491163382387,"score_spread":0.0687694124954693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062940315","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007513903,0.81248826,0.05719562,0.03715079,0.0014121148,0.000120645454,0.000054249256,0.00012612596,0.08393832],"genre_scores_gemma":[0.26873946,0.6940304,0.021223169,0.0037574852,0.004893724,0.00020111889,0.00007450382,0.000064654654,0.007015574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9936573,0.0023789392,0.00045949832,0.0004602838,0.0023652406,0.00067872804],"domain_scores_gemma":[0.9942871,0.0034272668,0.0006317541,0.000263663,0.0010157397,0.0003744478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007143367,0.0014494819,0.001233862,0.007816925,0.0017633119,0.010976196,0.0017627598,0.005074408,0.0019406057],"category_scores_gemma":[0.004953158,0.0006912704,0.0008381159,0.007406385,0.0079641985,0.0075055,0.0035306213,0.0035547009,0.00048143466],"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.000025217436,0.00021113518,0.0020270976,0.0017815441,0.000075377466,0.00015400072,0.0015709953,0.0052964087,0.0002940006,0.6968313,0.011477628,0.28025532],"study_design_scores_gemma":[0.00001675987,0.0001884069,0.004877138,0.004355305,0.00006573975,0.00061078696,0.003068823,0.010249595,0.00046459286,0.559957,0.4160296,0.0001162822],"about_ca_topic_score_codex":0.0038848566,"about_ca_topic_score_gemma":0.004648959,"teacher_disagreement_score":0.010976196,"about_ca_system_score_codex":0.009255705,"about_ca_system_score_gemma":0.00942486,"threshold_uncertainty_score":0.06715518},"labels":[],"label_agreement":null},{"id":"W2063786797","doi":"10.1007/s10479-015-1838-0","title":"Joint procurement and demand-side bidding strategies under price volatility","year":2015,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"McGill University","funders":"","keywords":"Bidding; Microeconomics; Procurement; Economics","score_opus":0.46616818802446325,"score_gpt":0.4270784907307665,"score_spread":0.03908969729369677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063786797","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.79446155,0.0004764782,0.18744633,0.0014053461,0.00007926723,0.000098085016,0.00018829352,0.00020591418,0.015638709],"genre_scores_gemma":[0.995249,0.00008090837,0.0021870045,0.000029879138,0.000019894804,0.000016748341,0.000029491664,0.000019087154,0.0023679845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816775,0.00074674323,0.00010290065,0.00017901252,0.0002787708,0.0005247825],"domain_scores_gemma":[0.9799421,0.015126549,0.0017745411,0.0007406403,0.0014610654,0.0009551301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055361334,0.0008766982,0.0024133425,0.00069210556,0.00067774113,0.0035840727,0.0017572306,0.0016575373,0.004360951],"category_scores_gemma":[0.019597394,0.0011467296,0.0010381038,0.000968129,0.0013385371,0.004152624,0.0015888793,0.0017530466,0.00044666117],"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.0023212188,0.0004311381,0.005766468,0.0002002836,0.0002686788,0.00081444136,0.0005317162,0.7756288,0.006111274,0.17098795,0.0022049474,0.034733016],"study_design_scores_gemma":[0.000053348063,0.00013896402,0.0014919388,0.000008516679,0.000059882474,0.00011926328,0.00019412806,0.9401864,0.00054821797,0.056991607,0.00017300573,0.00003470839],"about_ca_topic_score_codex":0.0015013146,"about_ca_topic_score_gemma":0.0012978709,"teacher_disagreement_score":0.0055361334,"about_ca_system_score_codex":0.0013407661,"about_ca_system_score_gemma":0.0017982526,"threshold_uncertainty_score":0.029278278},"labels":[],"label_agreement":null},{"id":"W2064783481","doi":"10.1007/s10479-006-0001-3","title":"An integrated model for logistics network design","year":2006,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":278,"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","funders":"","keywords":"Benders' decomposition; Theory of computation; Mathematical optimization; Computer science; Decomposition; Facility location problem; Selection (genetic algorithm); Linear programming relaxation; Range (aeronautics); Simplex algorithm; Simplex; Product (mathematics); Network planning and design; Relaxation (psychology); Integer programming; Operations research; Linear programming; Algorithm; Mathematics; Engineering; Artificial intelligence","score_opus":0.4520266462281747,"score_gpt":0.4442087261267259,"score_spread":0.007817920101448772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064783481","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.009217986,0.00013261329,0.97630954,0.00041565424,0.000059946295,0.00008740462,0.00026256905,0.00021036238,0.013303936],"genre_scores_gemma":[0.4484192,0.0007606275,0.52334166,0.00021626218,0.0001290895,0.0006727523,0.0007631896,0.00023326065,0.025464028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988582,0.00044842108,0.000055589517,0.00018847616,0.00028249755,0.00016684787],"domain_scores_gemma":[0.99851424,0.00077250076,0.00009785121,0.00016692073,0.00032874485,0.00011978329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016334233,0.001171033,0.0010930826,0.0012116712,0.0009182093,0.003298612,0.0029547515,0.0025690065,0.016800692],"category_scores_gemma":[0.0056792093,0.0010556671,0.0018582101,0.0017968033,0.0011962543,0.0042377138,0.0019922184,0.0019160258,0.0016097028],"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.00003291698,0.00005764431,0.00026424922,0.00003482012,0.000025809031,0.000061201856,0.000056925583,0.84844947,0.0002645775,0.13739316,0.0011071328,0.0122520905],"study_design_scores_gemma":[0.000013585473,0.000015313457,0.000033383043,0.0000069027906,0.000013960173,0.000014318404,0.000012270364,0.95154977,0.000061683284,0.046816215,0.0014570319,0.000005558976],"about_ca_topic_score_codex":0.011309957,"about_ca_topic_score_gemma":0.011294079,"teacher_disagreement_score":0.016800692,"about_ca_system_score_codex":0.003009489,"about_ca_system_score_gemma":0.0027528664,"threshold_uncertainty_score":0.05620396},"labels":[],"label_agreement":null},{"id":"W2065558865","doi":"10.1007/s10479-009-0633-1","title":"Formulating diets for growing pigs: economic and environmental considerations","year":2009,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Animal Nutrition and Physiology","field":"Agricultural and Biological Sciences","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Agriculture and Agri-Food Canada; Statistics Canada; Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Production (economics); Theory of computation; Phosphorus; Environmental impact assessment; Natural resource economics; Computer science; Environmental science; Economics; Ecology; Biology; Chemistry; Microeconomics; Algorithm","score_opus":0.2383623986761651,"score_gpt":0.4094313781392495,"score_spread":0.17106897946308441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065558865","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.8492072,0.026442828,0.035762254,0.024238849,0.0009329531,0.0003405031,0.0010180485,0.00014260384,0.061914727],"genre_scores_gemma":[0.89105934,0.01003412,0.084368944,0.0019213363,0.00065993494,0.00021885056,0.00050329894,0.00009536495,0.011138862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987213,0.000547295,0.00008086911,0.000087283384,0.00047512597,0.0000881106],"domain_scores_gemma":[0.9963624,0.0017653819,0.00073324697,0.00016864462,0.0006588197,0.00031154035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040785563,0.0005276411,0.00041258274,0.001131399,0.00075392774,0.0029453323,0.0010758624,0.0016809193,0.0046285824],"category_scores_gemma":[0.0044197943,0.00025122272,0.00037107844,0.00087928155,0.00070377655,0.0013804645,0.0006277224,0.0010833405,0.00062047347],"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.009522334,0.0039311145,0.044673998,0.0020176312,0.00036196597,0.0019598044,0.0006026283,0.010386757,0.29303694,0.015292788,0.0077998624,0.6104142],"study_design_scores_gemma":[0.0010165749,0.02551286,0.3446341,0.0037569683,0.001898627,0.007153593,0.007581553,0.0221595,0.26891083,0.035603113,0.2813785,0.00039376854],"about_ca_topic_score_codex":0.003021228,"about_ca_topic_score_gemma":0.013359478,"teacher_disagreement_score":0.0046285824,"about_ca_system_score_codex":0.0011377475,"about_ca_system_score_gemma":0.001598076,"threshold_uncertainty_score":0.021569729},"labels":[],"label_agreement":null},{"id":"W2067761883","doi":"10.1007/s10479-014-1584-8","title":"Optimal VaR-based risk management with reinsurance","year":2014,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":22,"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":"Reinsurance; Monotonic function; Piecewise; Actuarial science; Imperfect; Mathematical optimization; Economics; Risk management; Computer science; Mathematical economics; Econometrics; Mathematics; Finance","score_opus":0.2638871786263751,"score_gpt":0.49962539047620635,"score_spread":0.23573821184983124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067761883","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.08970624,0.0017315926,0.8991974,0.0019814344,0.0003033879,0.0000992725,0.00013547401,0.00043296398,0.0064122477],"genre_scores_gemma":[0.96240944,0.0003638359,0.032112982,0.00017987443,0.00014357425,0.00004948345,0.00007907349,0.000059349448,0.004602382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975147,0.0014080411,0.000100201665,0.00034470367,0.0003014486,0.00033086503],"domain_scores_gemma":[0.9958977,0.0027504023,0.00035035706,0.00022144188,0.0005471193,0.00023303561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005109682,0.0015740733,0.003115577,0.0009915446,0.0005319379,0.003001963,0.0016676426,0.0023900557,0.002888151],"category_scores_gemma":[0.011388762,0.0011445818,0.0009848329,0.0007390396,0.0011351472,0.002820662,0.0019365187,0.002176233,0.00029672333],"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.00013716242,0.00006485839,0.00034638657,0.000039643885,0.0000626115,0.000058472084,0.000020144953,0.97589886,0.00042909046,0.01218391,0.00071849534,0.010040412],"study_design_scores_gemma":[0.000009883527,0.00004545859,0.0001126005,0.000007653979,0.000017450146,0.000012595652,0.000007854207,0.9922265,0.00016693858,0.0072678933,0.000117755866,0.000007430492],"about_ca_topic_score_codex":0.0029746608,"about_ca_topic_score_gemma":0.0017896267,"teacher_disagreement_score":0.005109682,"about_ca_system_score_codex":0.0011965323,"about_ca_system_score_gemma":0.0017112318,"threshold_uncertainty_score":0.027022898},"labels":[],"label_agreement":null},{"id":"W2069326331","doi":"10.1007/s10479-006-0132-6","title":"Coherent multiperiod risk adjusted values and Bellman’s principle","year":2006,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":426,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Ambiguity; Theory of computation; Measure (data warehouse); Coherent risk measure; Risk measure; Mathematics; Expected shortfall; Stability (learning theory); Value (mathematics); Spectral risk measure; Dynamic risk measure; Mathematical economics; Risk management; Applied mathematics; Statistics; Computer science; Economics; Algorithm; Data mining; Financial economics","score_opus":0.3529172039971666,"score_gpt":0.5307843923733416,"score_spread":0.17786718837617504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069326331","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.030706294,0.0013290842,0.9546019,0.0018505851,0.00016759182,0.000026953985,0.00006726884,0.00006969065,0.011180638],"genre_scores_gemma":[0.8213134,0.0018294213,0.1644318,0.00048701843,0.00055143016,0.00012197915,0.000153689,0.000111124,0.011000185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977806,0.0010029469,0.000097475604,0.00033253763,0.0005896173,0.00019672634],"domain_scores_gemma":[0.99559915,0.002804044,0.00051096117,0.00046857973,0.0004946237,0.00012263138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058567114,0.00079422694,0.001101045,0.00087918015,0.00057176454,0.0031070078,0.0014278187,0.00182722,0.0023569514],"category_scores_gemma":[0.014448612,0.0010763223,0.0011283293,0.0012943668,0.0020098486,0.006172928,0.0017911043,0.0028690596,0.00030319302],"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.000034746197,0.000014065185,0.00020171414,0.00002590341,0.000045491783,0.000049088292,0.000056890007,0.042498894,0.0006147764,0.9474461,0.00075111823,0.0082611265],"study_design_scores_gemma":[0.0000117537,0.00002119018,0.00027091452,0.000012528512,0.000013884115,0.000025483858,0.000010342328,0.1031266,0.00026931634,0.89513487,0.0010834953,0.000019561936],"about_ca_topic_score_codex":0.00082957104,"about_ca_topic_score_gemma":0.00063808786,"teacher_disagreement_score":0.0058567114,"about_ca_system_score_codex":0.0017192054,"about_ca_system_score_gemma":0.0014523116,"threshold_uncertainty_score":0.030973613},"labels":[],"label_agreement":null},{"id":"W2070062192","doi":"10.1007/s10479-008-0448-5","title":"On risk minimizing portfolios under a Markovian regime-switching Black-Scholes economy","year":2008,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":95,"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","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Hamilton–Jacobi–Bellman equation; Differential game; Dynamic risk measure; Markov chain; Mathematical economics; Markov process; Mathematical optimization; Risk measure; Mathematics; Measure (data warehouse); Stochastic differential equation; Stochastic control; Theory of computation; Computer science; Applied mathematics; Bellman equation; Economics; Optimal control; Finance; Portfolio","score_opus":0.21003555131041138,"score_gpt":0.3685797505975054,"score_spread":0.15854419928709404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070062192","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.31240302,0.0030258275,0.66046214,0.005327814,0.00022219217,0.00013239085,0.0003759345,0.00023078718,0.017819928],"genre_scores_gemma":[0.9601176,0.0032491987,0.021862537,0.00028838468,0.00037283538,0.00013339677,0.00027385284,0.00008601923,0.0136162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985252,0.0007720835,0.00007895864,0.00022065005,0.00021295508,0.00019020734],"domain_scores_gemma":[0.9893963,0.007916946,0.0012616953,0.00036056765,0.0005127476,0.0005518293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005333774,0.0014172514,0.0031770966,0.0012323897,0.00080465,0.0038847958,0.0016756065,0.0029917606,0.0055203517],"category_scores_gemma":[0.0184627,0.0010258182,0.0014175038,0.0012408568,0.0029489738,0.0053482587,0.0024465304,0.0023840591,0.0003986611],"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.00014427974,0.00010412574,0.0011118817,0.00012444808,0.00010784135,0.00019588892,0.0001332725,0.27658373,0.0011379637,0.71012074,0.0014322174,0.008803576],"study_design_scores_gemma":[0.000053600048,0.000057429923,0.00041029658,0.000027938706,0.000029484401,0.000038197883,0.00003042547,0.6021677,0.00020594141,0.39659166,0.0003579307,0.000029404513],"about_ca_topic_score_codex":0.0024544413,"about_ca_topic_score_gemma":0.0014193585,"teacher_disagreement_score":0.0055203517,"about_ca_system_score_codex":0.0016501554,"about_ca_system_score_gemma":0.0018920801,"threshold_uncertainty_score":0.028208017},"labels":[],"label_agreement":null},{"id":"W2070341979","doi":"10.1007/s10479-008-0484-1","title":"A new methodology for studying the equity premium","year":2008,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Monetary Policy and Economic Impact","field":"Economics, Econometrics and Finance","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":"York University","funders":"","keywords":"Equity premium puzzle; Econometrics; Economics; Nonparametric statistics; Volatility (finance); Consumption (sociology); Equity (law); Risk premium; Equity risk; Microeconomics; Computer science; Finance","score_opus":0.924573456473488,"score_gpt":0.5460921382951337,"score_spread":0.3784813181783543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070341979","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.0045065144,0.00037654518,0.9932882,0.00020578559,0.0001110525,0.000027149286,0.00004035622,0.000040498096,0.0014039049],"genre_scores_gemma":[0.22026204,0.00208247,0.76109487,0.00047187935,0.0022019215,0.00036840676,0.00026432672,0.00024344,0.013010685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798226,0.0008809232,0.00014391184,0.0003147115,0.0005613604,0.00011676275],"domain_scores_gemma":[0.99216205,0.005191541,0.000691211,0.000901519,0.0007321344,0.00032159322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005451702,0.00091684295,0.0010656598,0.004492887,0.0006565793,0.001877361,0.0015390107,0.001566727,0.0044495095],"category_scores_gemma":[0.015420657,0.0004775012,0.0014191787,0.0024851416,0.0013738903,0.0032800385,0.0021388992,0.0026588598,0.0006771491],"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.00004676935,0.00016969399,0.0052279327,0.00012084386,0.00020593277,0.00020563761,0.00025478165,0.018711995,0.011390245,0.8625663,0.002776415,0.09832352],"study_design_scores_gemma":[0.00006839647,0.00011120832,0.0038360597,0.0000420286,0.00012657742,0.00042156514,0.00007651922,0.37406138,0.002678452,0.6040368,0.014479119,0.00006182307],"about_ca_topic_score_codex":0.0010830206,"about_ca_topic_score_gemma":0.00097403507,"teacher_disagreement_score":0.005451702,"about_ca_system_score_codex":0.0006177203,"about_ca_system_score_gemma":0.0010143013,"threshold_uncertainty_score":0.02883172},"labels":[],"label_agreement":null},{"id":"W2074707342","doi":"10.1007/s10479-013-1446-9","title":"Scheduling the two-machine open shop problem under resource constraints for setting the jobs","year":2013,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":10,"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":"Job shop scheduling; Theory of computation; Open shop; Computer science; Scheduling (production processes); Schedule; Mathematical optimization; Heuristic; Flow shop scheduling; Job shop; Distributed computing; Operations research; Mathematics; Algorithm; Artificial intelligence","score_opus":0.14985774713197367,"score_gpt":0.4181182125822349,"score_spread":0.2682604654502613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074707342","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.124257475,0.000966176,0.86520785,0.00095135235,0.0005496915,0.0002940448,0.0004342871,0.0003320956,0.007007017],"genre_scores_gemma":[0.80223805,0.00059274357,0.19015503,0.0001581463,0.00034914422,0.00029673084,0.00042614434,0.00015428894,0.005629719],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983317,0.0007721011,0.00007218429,0.00029749415,0.00023035902,0.0002960674],"domain_scores_gemma":[0.9953837,0.0033231685,0.00026388536,0.00033731823,0.0002691457,0.00042283005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027866885,0.0010519526,0.002898987,0.00078102923,0.00088875205,0.0020501474,0.0025907292,0.002709942,0.004453423],"category_scores_gemma":[0.008018458,0.0011839478,0.0013867539,0.0013874664,0.0013416404,0.0034236978,0.0017969126,0.002296958,0.00039311158],"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.0007950597,0.00038447967,0.0005358946,0.0004246765,0.00007824748,0.00039298768,0.00012262416,0.9177884,0.0032015983,0.041533463,0.002937023,0.031805553],"study_design_scores_gemma":[0.000082995946,0.00010101979,0.0001841458,0.000012875503,0.0000132428395,0.000042403,0.000044389544,0.9675859,0.00061917986,0.030649098,0.00064256403,0.000022016668],"about_ca_topic_score_codex":0.0028874248,"about_ca_topic_score_gemma":0.0024599594,"teacher_disagreement_score":0.004453423,"about_ca_system_score_codex":0.00092648144,"about_ca_system_score_gemma":0.0018907909,"threshold_uncertainty_score":0.014898181},"labels":[],"label_agreement":null},{"id":"W2075525742","doi":"10.1007/s10479-014-1774-4","title":"Value-based argumentation for policy decision analysis: methodology and an exploratory case study of a hydroelectric project in Québec","year":2015,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université Laval","funders":"","keywords":"Argumentative; Argumentation theory; Commission; Context (archaeology); Process (computing); Computer science; Value (mathematics); Lottery; Management science; Operations research; Political science; Economics; Epistemology; Law; Mathematics; Microeconomics","score_opus":0.6681727687590614,"score_gpt":0.5982211880253314,"score_spread":0.06995158073372998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075525742","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.75698,0.0006910661,0.19149913,0.0038644725,0.000042541924,0.0016139781,0.0004200169,0.00012901859,0.044759877],"genre_scores_gemma":[0.9184321,0.00018460653,0.078006715,0.000067662695,0.0000070956808,0.00042274024,0.0001082362,0.00001973078,0.0027511918],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9905749,0.0077491933,0.00020833762,0.00030992695,0.0007504551,0.0004072499],"domain_scores_gemma":[0.96205556,0.0340662,0.0006803182,0.0004451168,0.002299793,0.00045296884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012019445,0.0006389134,0.00057863304,0.0028344537,0.004742903,0.0061235647,0.0022885143,0.0025420322,0.00359405],"category_scores_gemma":[0.022310881,0.00034047948,0.00054671144,0.003150009,0.0029254772,0.0024788056,0.0020897703,0.0014801001,0.00021256383],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009837985,0.0027332518,0.029976217,0.0017531406,0.00021589338,0.0036370652,0.082617626,0.16691057,0.0060744574,0.31096628,0.0066682845,0.3874634],"study_design_scores_gemma":[0.0004536791,0.00051332713,0.015193991,0.0010780916,0.0002122957,0.00051036297,0.0764483,0.78494245,0.0052337972,0.075987555,0.039177794,0.00024830134],"about_ca_topic_score_codex":0.2026824,"about_ca_topic_score_gemma":0.31731626,"teacher_disagreement_score":0.7973176,"about_ca_system_score_codex":0.018416343,"about_ca_system_score_gemma":0.013849294,"threshold_uncertainty_score":0.4030053},"labels":[],"label_agreement":null},{"id":"W2076293072","doi":"10.1007/s10479-006-0080-1","title":"Column generation for IMRT cancer therapy optimization with implementable segments","year":2006,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Radiotherapy Techniques","field":"Physics and Astronomy","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kimberly-Clark (Canada)","funders":"","keywords":"Beam (structure); Intensity (physics); Column generation; Intensity modulation; Computer science; Optics; Mathematical optimization; Mathematics; Algorithm; Physics","score_opus":0.1919182538019815,"score_gpt":0.49688641075100853,"score_spread":0.304968156949027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076293072","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.056701064,0.00022496724,0.9337177,0.0001816379,0.00007016622,0.00010841771,0.00035002473,0.0019011406,0.0067447615],"genre_scores_gemma":[0.57708704,0.00015181018,0.41608158,0.00012197395,0.000051754807,0.00020061921,0.0006242143,0.0004166106,0.005264348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998536,0.00005633274,0.0000040487416,0.000017311138,0.00004255882,0.00002616535],"domain_scores_gemma":[0.999665,0.00017102536,0.00002471495,0.00003992861,0.00008193842,0.000017340222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002266884,0.0005283245,0.0004246461,0.00038732323,0.0002992515,0.00052425265,0.00057362317,0.0003755052,0.0064134765],"category_scores_gemma":[0.00094361836,0.0002750598,0.00035715546,0.00068205356,0.00023767924,0.00038596938,0.00037758498,0.00046100366,0.00047861738],"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.0004645256,0.00010888674,0.00075168407,0.00010471037,0.00003748873,0.00008595613,0.00006027105,0.8004892,0.012628163,0.0071227434,0.0050886013,0.1730577],"study_design_scores_gemma":[0.000017141307,0.00006182454,0.00012986253,0.000003316921,0.000007886365,0.00001086368,0.000009733942,0.99277323,0.0043603,0.0015041328,0.001117087,0.0000045780016],"about_ca_topic_score_codex":0.0030546507,"about_ca_topic_score_gemma":0.004602454,"teacher_disagreement_score":0.0064134765,"about_ca_system_score_codex":0.0003510567,"about_ca_system_score_gemma":0.0006036383,"threshold_uncertainty_score":0.021455288},"labels":[],"label_agreement":null},{"id":"W2076520672","doi":"10.1023/b:anor.0000039518.73626.a5","title":"GENI Ants for the Traveling Salesman Problem","year":2004,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","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":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Travelling salesman problem; Heuristic; Theory of computation; Benchmark (surveying); Mathematical optimization; Ant colony optimization algorithms; Probabilistic logic; Computer science; Ant colony; Bottleneck traveling salesman problem; Set (abstract data type); Nearest neighbour algorithm; Traveling purchaser problem; 2-opt; Mathematics; Algorithm; Artificial intelligence","score_opus":0.3811311709820421,"score_gpt":0.4971652540370582,"score_spread":0.11603408305501611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076520672","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.0677898,0.010324161,0.7943999,0.008585299,0.0017492652,0.00020169695,0.0004629265,0.0004410927,0.116045974],"genre_scores_gemma":[0.61681145,0.009553143,0.29632834,0.00072658976,0.0017342552,0.00039890682,0.0006634123,0.0004673292,0.07331654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994117,0.00028817615,0.000019297635,0.000081631224,0.00012994296,0.000069238304],"domain_scores_gemma":[0.9985247,0.0010780579,0.00011717345,0.00007497298,0.00012537533,0.00007984608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009550497,0.0008869371,0.0010796804,0.00081376196,0.00084618345,0.002259142,0.001400095,0.0024501162,0.010277247],"category_scores_gemma":[0.005607933,0.0005191319,0.00078615046,0.0015545024,0.0014384388,0.0023159294,0.0012600452,0.0039325017,0.0014683931],"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.00022135292,0.00008727082,0.00041084134,0.00032225126,0.00007278854,0.0001896856,0.00019648764,0.37549645,0.00065888313,0.5473084,0.020388031,0.05464767],"study_design_scores_gemma":[0.000053968135,0.000035350666,0.00017660909,0.000038043025,0.000022261094,0.00007139662,0.000052612246,0.5802231,0.00014366492,0.40764773,0.011519351,0.000016000336],"about_ca_topic_score_codex":0.003847504,"about_ca_topic_score_gemma":0.0039304085,"teacher_disagreement_score":0.010277247,"about_ca_system_score_codex":0.0013208311,"about_ca_system_score_gemma":0.0016011671,"threshold_uncertainty_score":0.034380794},"labels":[],"label_agreement":null},{"id":"W2079017824","doi":"10.1007/s10479-010-0722-1","title":"Approximate performance analysis of CONWIP disciplines in unreliable non homogeneous transfer lines","year":2010,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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":"Block (permutation group theory); Constant (computer programming); Theory of computation; Transfer line; Computer science; Mathematical optimization; Mathematics; Applied mathematics; Algorithm; Combinatorics; Engineering","score_opus":0.09388804598088185,"score_gpt":0.39155705456211143,"score_spread":0.2976690085812296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079017824","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.18105936,0.0012834818,0.8070989,0.0005041217,0.00006373355,0.000067485424,0.00010313249,0.00034811712,0.00947159],"genre_scores_gemma":[0.977737,0.00041775592,0.019094596,0.000047780275,0.000056333352,0.000036581307,0.000058655787,0.00007283406,0.0024784831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986004,0.0004962425,0.00003694779,0.00012621829,0.0004242576,0.0003159138],"domain_scores_gemma":[0.9920035,0.00549194,0.0006075827,0.0005096014,0.0011390172,0.00024833845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037531718,0.0008017019,0.0012897097,0.0012695332,0.0008589236,0.0018260255,0.0020451127,0.0009341127,0.0023129464],"category_scores_gemma":[0.0136212725,0.0004710749,0.00045903062,0.002043353,0.0015415634,0.0021084715,0.0012923743,0.0011846658,0.00024607044],"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.00008645635,0.000027016991,0.00040410188,0.000030915813,0.000012708799,0.000025409612,0.000038441318,0.9743624,0.0006395434,0.018872326,0.00033471175,0.005166068],"study_design_scores_gemma":[9.810483e-7,0.0000055741757,0.00004269846,0.0000013722545,0.0000018023911,0.0000031440618,0.0000055800583,0.99806815,0.00006928635,0.0017633099,0.000036933798,0.0000011623914],"about_ca_topic_score_codex":0.012278624,"about_ca_topic_score_gemma":0.0053034388,"teacher_disagreement_score":0.012278624,"about_ca_system_score_codex":0.0038978318,"about_ca_system_score_gemma":0.0021150722,"threshold_uncertainty_score":0.028280854},"labels":[],"label_agreement":null},{"id":"W2080610036","doi":"10.1007/s10479-008-0337-y","title":"Efficient solution approaches for a discrete multi-facility competitive interaction model","year":2008,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":26,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science","score_opus":0.5969619837764057,"score_gpt":0.47512096968329526,"score_spread":0.12184101409311049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080610036","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.009829772,0.00063572964,0.97932947,0.00054280437,0.00006817106,0.00012735021,0.00017452605,0.000089182206,0.009202993],"genre_scores_gemma":[0.47059518,0.0015279127,0.5083915,0.0003221621,0.00026977944,0.00079999655,0.000496082,0.00020007526,0.017397366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985663,0.0006301347,0.00004446417,0.00019888501,0.00031889396,0.00024122073],"domain_scores_gemma":[0.9968971,0.0024063303,0.00017718437,0.00012192008,0.0002289333,0.0001686251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002205285,0.0018434136,0.0032170254,0.0016114004,0.0010250352,0.003086543,0.0048399013,0.0040877126,0.008936232],"category_scores_gemma":[0.0053299675,0.0014573087,0.0017665867,0.0027959342,0.0016716731,0.0028369818,0.0033821191,0.0034302657,0.0007931424],"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.000054980563,0.000087142886,0.00012947107,0.00014307353,0.00004673274,0.00005696121,0.00004871491,0.9177094,0.00026408522,0.06953783,0.0017942456,0.010127414],"study_design_scores_gemma":[0.000018968805,0.000013652663,0.000023282684,0.0000069184503,0.000009165546,0.000009613172,0.00001431457,0.9802893,0.000042292024,0.019065091,0.0005022168,0.0000051774023],"about_ca_topic_score_codex":0.009736752,"about_ca_topic_score_gemma":0.00847574,"teacher_disagreement_score":0.009736752,"about_ca_system_score_codex":0.0031029093,"about_ca_system_score_gemma":0.002972475,"threshold_uncertainty_score":0.02989465},"labels":[],"label_agreement":null},{"id":"W2080833522","doi":"10.1023/b:anor.0000011190.86293.c1","title":"Unreliable Transfer Lines: Decomposition/Aggregation and Optimization","year":2004,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Queuing Theory Analysis","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":"Polytechnique Montréal; Group for Research in Decision Analysis; Université de Montréal","funders":"","keywords":"Computer science; Theory of computation; Scalability; Mathematical optimization; Transfer (computing); Obstacle; Line (geometry); Transfer line; Decomposition; Monte Carlo method; Measure (data warehouse); Algorithm; State (computer science); Mathematics; Parallel computing; Data mining; Engineering","score_opus":0.09345254129689068,"score_gpt":0.39678575484226725,"score_spread":0.30333321354537657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080833522","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.017516261,0.00044498433,0.9796596,0.00025534662,0.00004039666,0.000030241708,0.000047268895,0.00014348763,0.0018624093],"genre_scores_gemma":[0.67560995,0.001162334,0.31435922,0.00008777293,0.00020176679,0.00013948134,0.00022883633,0.00031358816,0.0078971395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990409,0.0004632678,0.00004081134,0.00012773587,0.00018116947,0.0001461275],"domain_scores_gemma":[0.9966935,0.0020430626,0.00035896103,0.0003494076,0.0004339007,0.00012122788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026166704,0.0010885146,0.001551098,0.0010335959,0.0010216599,0.0027842394,0.0015194034,0.0012276571,0.0032662086],"category_scores_gemma":[0.007527063,0.0010258133,0.00078238983,0.002263552,0.001417512,0.003496678,0.0013073026,0.0017093623,0.00038636292],"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.0000889455,0.000042964537,0.00033295178,0.000041289364,0.000021470993,0.000036540667,0.000050570983,0.92282444,0.0007805229,0.040212926,0.0020851824,0.03348213],"study_design_scores_gemma":[0.0000036351948,0.000006630471,0.000053241652,0.000004101967,0.000006980922,0.000006613395,0.000010522056,0.9809662,0.00020410003,0.018422233,0.00031232706,0.0000033279398],"about_ca_topic_score_codex":0.006885629,"about_ca_topic_score_gemma":0.005852668,"teacher_disagreement_score":0.006885629,"about_ca_system_score_codex":0.0020280213,"about_ca_system_score_gemma":0.0012906631,"threshold_uncertainty_score":0.01471436},"labels":[],"label_agreement":null},{"id":"W2081475278","doi":"10.1007/s10479-008-0498-8","title":"Metaheuristic methods based on Tabu search for assigning judges to competitions","year":2009,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Sports Analytics and Performance","field":"Economics, Econometrics and Finance","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é de Montréal","funders":"","keywords":"Tabu search; Metaheuristic; Guided Local Search; Theory of computation; Mathematical optimization; Computer science; Parallel metaheuristic; Algorithm; Mathematics","score_opus":0.5076506407332314,"score_gpt":0.5271131455140821,"score_spread":0.019462504780850653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081475278","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.059822824,0.0013020834,0.9288305,0.00061393727,0.0003783678,0.0003779282,0.0002878009,0.0010730531,0.007313554],"genre_scores_gemma":[0.38660884,0.00044906058,0.60696894,0.00043265338,0.00023434467,0.00088002166,0.0005296051,0.00033252375,0.003564006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842983,0.0009701002,0.00006857128,0.000170411,0.00019491006,0.00016608412],"domain_scores_gemma":[0.99363315,0.005030188,0.0002790752,0.0002257151,0.00064340245,0.00018844137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003774305,0.0014973205,0.002638188,0.004403304,0.0012778443,0.0019351009,0.0033905986,0.0033960973,0.0059219054],"category_scores_gemma":[0.008933744,0.0013443045,0.0018147454,0.0038731515,0.0014554481,0.0016647206,0.001275924,0.0023577374,0.0007398605],"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.00012490063,0.0001482215,0.00044923616,0.00005626229,0.00008431677,0.00001801856,0.000056473233,0.93396246,0.00019049631,0.006379991,0.0020895696,0.056440033],"study_design_scores_gemma":[0.00003053797,0.00002053032,0.000049830833,0.0000073669116,0.000009602969,0.0000033543026,0.0000108478525,0.9973067,0.000053252057,0.0023535907,0.00015019967,0.000004218504],"about_ca_topic_score_codex":0.016231658,"about_ca_topic_score_gemma":0.013657125,"teacher_disagreement_score":0.016231658,"about_ca_system_score_codex":0.0023044245,"about_ca_system_score_gemma":0.0024371073,"threshold_uncertainty_score":0.032274365},"labels":[],"label_agreement":null},{"id":"W2082595178","doi":"10.1007/s10479-012-1255-6","title":"Lifetime properties of a cumulative shock model with a cluster structure","year":2012,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Probability and Risk Models","field":"Decision Sciences","cited_by":13,"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":"National Natural Science Foundation of China","keywords":"Shock (circulatory); Cluster (spacecraft); Poisson distribution; Poisson process; Homogeneous; Theory of computation; Econometrics; Statistical physics; Computer science; Mathematics; Physics; Statistics","score_opus":0.5864984643594849,"score_gpt":0.5290907948433135,"score_spread":0.05740766951617149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082595178","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.47448894,0.0011170926,0.5049517,0.0047247545,0.00016559885,0.00025622707,0.0013223161,0.0005425623,0.012430722],"genre_scores_gemma":[0.95789593,0.0009936185,0.012257944,0.0003422227,0.00021008663,0.00021364342,0.00093834987,0.00022383063,0.026924279],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990414,0.0002896755,0.000042627667,0.00018535394,0.00013880052,0.00030215824],"domain_scores_gemma":[0.9803647,0.012372044,0.0026128422,0.00095184386,0.0019106466,0.0017879758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005779827,0.0014230392,0.0026274396,0.0027122898,0.0015746796,0.0032889235,0.0047635594,0.0036035532,0.00980852],"category_scores_gemma":[0.023101145,0.0014515995,0.0016523398,0.0020667955,0.0030530104,0.0061664577,0.0025617492,0.0036810893,0.0009642003],"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.00025968958,0.00014294653,0.0036296148,0.000119481294,0.00011766246,0.00025444617,0.00046833992,0.54069924,0.001138706,0.4424252,0.0049964553,0.0057481867],"study_design_scores_gemma":[0.000032464497,0.00004395128,0.0007754782,0.000018553703,0.000044574666,0.00006634516,0.00011057668,0.9151478,0.00015080767,0.083141185,0.00042819517,0.00004011561],"about_ca_topic_score_codex":0.013872569,"about_ca_topic_score_gemma":0.005951292,"teacher_disagreement_score":0.013872569,"about_ca_system_score_codex":0.0028219041,"about_ca_system_score_gemma":0.0022821322,"threshold_uncertainty_score":0.032812715},"labels":[],"label_agreement":null},{"id":"W2083462405","doi":"10.1007/s10479-007-0298-6","title":"Geometric decay in level-expanding QBD models","year":2007,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Theory of computation; Computer science; Mathematics; Statistical physics; Physics; Algorithm","score_opus":0.36884821049072797,"score_gpt":0.466892429795915,"score_spread":0.09804421930518703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083462405","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.12140299,0.0021975837,0.8393831,0.005022685,0.0004045255,0.00011583009,0.000480582,0.00076467375,0.03022799],"genre_scores_gemma":[0.90618616,0.0027084178,0.049246896,0.0013750494,0.0005222803,0.00023717758,0.00059531827,0.0004801406,0.038648542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983279,0.0006442784,0.000057433987,0.00021110424,0.00035845477,0.00040072505],"domain_scores_gemma":[0.9840007,0.0093847215,0.001626288,0.0010092027,0.002490205,0.001488873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005752297,0.0014930385,0.0031607328,0.002832578,0.001867942,0.004703325,0.0045780777,0.0038556235,0.00870145],"category_scores_gemma":[0.03595437,0.0015468709,0.0017791629,0.002471177,0.005017852,0.008862173,0.0035343578,0.005099281,0.001259366],"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.000045236207,0.000034903496,0.00049378455,0.000061778985,0.000017675888,0.00008156367,0.00011932744,0.07033099,0.00032074933,0.92314005,0.0027566084,0.0025973315],"study_design_scores_gemma":[0.000019881289,0.000016289228,0.0001797015,0.000018062508,0.000014289301,0.000050790877,0.00004813436,0.6062339,0.00010433405,0.39249614,0.0007951033,0.000023370609],"about_ca_topic_score_codex":0.010966939,"about_ca_topic_score_gemma":0.004568841,"teacher_disagreement_score":0.010966939,"about_ca_system_score_codex":0.005385633,"about_ca_system_score_gemma":0.002554438,"threshold_uncertainty_score":0.039075732},"labels":[],"label_agreement":null},{"id":"W2084750728","doi":"10.1007/s10479-014-1663-x","title":"A short-turning policy for the management of demand disruptions in rapid transit systems","year":2014,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":89,"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","funders":"","keywords":"Computer science; Occupancy; Offset (computer science); Operations research; Transit (satellite); Theory of computation; Service (business); Demand management; Service level; Service quality; On demand; Order (exchange); Transport engineering; Business; Public transport; Economics; Engineering; Marketing","score_opus":0.219226179489936,"score_gpt":0.49442628401764077,"score_spread":0.27520010452770477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084750728","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.26792964,0.002384899,0.6502196,0.020777103,0.0024293442,0.0016929411,0.0013942044,0.0020406973,0.051131595],"genre_scores_gemma":[0.97859436,0.0004622294,0.013131147,0.00068737596,0.00030474178,0.0001763791,0.00014102914,0.00011145837,0.0063912757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972102,0.0012845299,0.00009748494,0.00033441605,0.00026705972,0.0008062329],"domain_scores_gemma":[0.9947923,0.0028585028,0.00048117942,0.00020080505,0.00088966725,0.00077753566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005425029,0.0016858677,0.0028794552,0.0016255868,0.0015170643,0.004356368,0.002804245,0.004121157,0.012372261],"category_scores_gemma":[0.010952725,0.0009285432,0.0012034647,0.0010689247,0.0012529554,0.0036370715,0.002120981,0.0046983124,0.0008194006],"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.0011563852,0.000537807,0.001111853,0.00034088743,0.00017148418,0.00022782554,0.00023590075,0.8471147,0.0025344566,0.073126666,0.016822016,0.0566201],"study_design_scores_gemma":[0.00015339418,0.00050353055,0.0010556472,0.00008400299,0.00010990035,0.00005357857,0.00046693842,0.9390931,0.0006818085,0.053845003,0.0038862505,0.00006678666],"about_ca_topic_score_codex":0.01057409,"about_ca_topic_score_gemma":0.007935119,"teacher_disagreement_score":0.012372261,"about_ca_system_score_codex":0.0032871922,"about_ca_system_score_gemma":0.0051877634,"threshold_uncertainty_score":0.041389346},"labels":[],"label_agreement":null},{"id":"W2085278007","doi":"10.1007/s10479-006-0149-x","title":"Time-cost trade-off via optimal control theory in Markov PERT networks","year":2007,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","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":"Dalhousie University","funders":"","keywords":"Theory of computation; Mathematical optimization; Minification; Erlang (programming language); Markov decision process; Computer science; Optimal control; Control (management); Markov chain; Variance (accounting); Stochastic programming; Function (biology); Markov process; Mathematics; Statistics; Economics; Artificial intelligence; Algorithm","score_opus":0.21522929893561688,"score_gpt":0.49586635955987185,"score_spread":0.280637060624255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085278007","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.054780293,0.001375735,0.92751276,0.0017930189,0.00014126432,0.000100214784,0.00025681837,0.00015360091,0.013886318],"genre_scores_gemma":[0.95042104,0.0014895339,0.03673809,0.0002394609,0.00019823022,0.00028686898,0.00014289375,0.00012190665,0.010362015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997849,0.0011764991,0.00007671478,0.0002573455,0.00029837945,0.00034213255],"domain_scores_gemma":[0.9805895,0.016989917,0.00097470015,0.00026177167,0.00071015506,0.00047396772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048543457,0.0018139327,0.002995384,0.0020972467,0.001127595,0.0035074728,0.0023163643,0.0032484515,0.006310859],"category_scores_gemma":[0.019177455,0.0015604508,0.0010399662,0.002029503,0.0031187304,0.005120925,0.0024233148,0.0022497782,0.00034606073],"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.0000613506,0.000043545555,0.00020184266,0.000060385562,0.000030583473,0.000039788825,0.000040477244,0.8835844,0.00020375443,0.11052506,0.0007842226,0.004424588],"study_design_scores_gemma":[0.000012068307,0.000013848713,0.00006534807,0.000008746893,0.000009334411,0.0000073071883,0.000009943606,0.93657434,0.00005358612,0.06309041,0.00014518207,0.000009918176],"about_ca_topic_score_codex":0.0089693805,"about_ca_topic_score_gemma":0.005354949,"teacher_disagreement_score":0.0089693805,"about_ca_system_score_codex":0.0039015089,"about_ca_system_score_gemma":0.002169416,"threshold_uncertainty_score":0.028307557},"labels":[],"label_agreement":null},{"id":"W2085298416","doi":"10.1007/s10479-005-2036-2","title":"An Improved IP Formulation for the Uncapacitated Facility Location Problem: Capitalizing on Objective Function Structure","year":2005,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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 Toronto","funders":"","keywords":"Facility location problem; Curse of dimensionality; Mathematical optimization; Theory of computation; Integer programming; Cover (algebra); 1-center problem; Set cover problem; Function (biology); Set (abstract data type); Mathematics; Computer science; Linear programming; Integer (computer science); Algorithm; Statistics","score_opus":0.16403196814602014,"score_gpt":0.39028646346626944,"score_spread":0.2262544953202493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085298416","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.007652468,0.00049377215,0.97757816,0.000570981,0.00017563126,0.00009596514,0.00032725796,0.0001863586,0.012919502],"genre_scores_gemma":[0.30106127,0.0010495938,0.67947793,0.00042208188,0.00046900852,0.00051956956,0.0008306297,0.00035510855,0.015814846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930215,0.00030160797,0.000031537078,0.00011593233,0.00015107827,0.0000976886],"domain_scores_gemma":[0.9980095,0.0012786122,0.000113030175,0.00013405166,0.00038705472,0.00007776323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017611957,0.0013987988,0.0017314637,0.0006578561,0.00037201386,0.0019964704,0.0023868086,0.0019564433,0.011020102],"category_scores_gemma":[0.0052767317,0.00087337976,0.00096391735,0.0013974799,0.00061166636,0.0023008238,0.0012432211,0.0024750328,0.0010967165],"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.000038827413,0.00006321182,0.00013633858,0.00013015784,0.000021016653,0.00008022839,0.00002558096,0.9549628,0.0003866614,0.016094161,0.005012255,0.02304874],"study_design_scores_gemma":[0.0000110478595,0.000014670538,0.000035753477,0.000009938082,0.000007291577,0.000015192981,0.0000066810203,0.9945115,0.00006983088,0.004552449,0.00076262985,0.0000030647097],"about_ca_topic_score_codex":0.0053480477,"about_ca_topic_score_gemma":0.006054095,"teacher_disagreement_score":0.011020102,"about_ca_system_score_codex":0.0012468862,"about_ca_system_score_gemma":0.0021255245,"threshold_uncertainty_score":0.03686589},"labels":[],"label_agreement":null},{"id":"W2086396347","doi":"10.1007/s10479-006-5293-9","title":"Discrete-time analysis of the GI/G/1 system with Bernoulli retrials: An algorithmic approach","year":2006,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bernoulli's principle; Markov chain; Computer science; Independence (probability theory); Theory of computation; Mathematical optimization; Algorithm; Bernoulli process; Markov chain Monte Carlo; Matrix (chemical analysis); Continuous-time Markov chain; Exploit; Set (abstract data type); Markov process; Discrete time and continuous time; Applied mathematics; Mathematics; Markov property; Markov model; Bayesian probability; Artificial intelligence","score_opus":0.087525396369387,"score_gpt":0.3652298565749086,"score_spread":0.2777044602055216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086396347","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.11995232,0.0014368194,0.85604477,0.0041148355,0.0002565315,0.00014734006,0.00032090393,0.00023799775,0.017488444],"genre_scores_gemma":[0.9197538,0.0011265473,0.063987345,0.0004850444,0.00041778764,0.00015589134,0.00026976402,0.000127042,0.013676865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988285,0.000417113,0.000037045393,0.00014913669,0.00028704415,0.00028115846],"domain_scores_gemma":[0.99436754,0.0039938805,0.0005562763,0.00019208653,0.00054918,0.00034096258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032874595,0.0010919522,0.0015518832,0.0018484981,0.001136156,0.0028740966,0.0031508193,0.0019104023,0.0057676],"category_scores_gemma":[0.0092186555,0.0009114575,0.0013528385,0.001264546,0.002772173,0.0034048546,0.0022131084,0.0032371231,0.00043011343],"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.0000695607,0.00007038496,0.0007693073,0.000082558916,0.00004173943,0.00016084917,0.00013572,0.61549616,0.0009612436,0.37450328,0.0020974518,0.005611589],"study_design_scores_gemma":[0.0000049131268,0.000006759965,0.0001092118,0.0000057309667,0.000005672664,0.000016234602,0.000015716925,0.96264267,0.00007096165,0.036914285,0.00019993076,0.000007891751],"about_ca_topic_score_codex":0.007884804,"about_ca_topic_score_gemma":0.005459699,"teacher_disagreement_score":0.007884804,"about_ca_system_score_codex":0.0035751008,"about_ca_system_score_gemma":0.002990953,"threshold_uncertainty_score":0.025939286},"labels":[],"label_agreement":null},{"id":"W2088808478","doi":"10.1007/s10479-014-1623-5","title":"Modeling the impact of donor behavior on humanitarian aid operations","year":2014,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Blood donation and transfusion practices","field":"Business, Management and Accounting","cited_by":64,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Cash; Donation; Extant taxon; Quality (philosophy); Computer science; Business; Operations research; Marketing; Finance; Political science; Law; Engineering","score_opus":0.25439708570970443,"score_gpt":0.4529091149931896,"score_spread":0.19851202928348516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088808478","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.9886975,0.00012408673,0.003964171,0.0010523458,0.00005184597,0.00003148347,0.00040590783,0.00003674597,0.0056358837],"genre_scores_gemma":[0.99648845,0.00009209192,0.00068618025,0.000041822193,0.000013138593,0.000014087188,0.00012407813,0.000008114107,0.0025319834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992466,0.00035510198,0.000025131629,0.00008688908,0.000048241847,0.00023805464],"domain_scores_gemma":[0.99268496,0.0056371656,0.0005939093,0.00017088102,0.0003197594,0.000593269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020325205,0.0008182419,0.000680603,0.000758609,0.00081005844,0.0023022275,0.0016575562,0.002614445,0.0068019754],"category_scores_gemma":[0.008639569,0.000825678,0.00077368197,0.00084507547,0.0009752157,0.0016541084,0.0009006745,0.002416745,0.0004312951],"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.0001340489,0.00036246981,0.012355677,0.000013374503,0.000035238336,0.00006434085,0.000047637783,0.9814461,0.00017303,0.0030640322,0.0004474947,0.0018565775],"study_design_scores_gemma":[0.000018093375,0.000063197214,0.0025485472,0.000003629216,0.000017342774,0.00000771833,0.00012760419,0.99587077,0.000074911826,0.0011019289,0.00015869197,0.0000076185365],"about_ca_topic_score_codex":0.08653166,"about_ca_topic_score_gemma":0.06454649,"teacher_disagreement_score":0.08653166,"about_ca_system_score_codex":0.0031622548,"about_ca_system_score_gemma":0.00290744,"threshold_uncertainty_score":0.17205602},"labels":[],"label_agreement":null},{"id":"W2089233175","doi":"10.1023/b:anor.0000039515.90453.1d","title":"Path Relinking, Cycle-Based Neighbourhoods and Capacitated Multicommodity Network Design","year":2004,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":125,"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; Université de Montréal","funders":"","keywords":"Tabu search; Theory of computation; Path (computing); Mathematical optimization; Mathematics; Heuristic; Set (abstract data type); Local search (optimization); Network planning and design; Computer science; Algorithm","score_opus":0.18403810617067948,"score_gpt":0.3873745427847574,"score_spread":0.20333643661407794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089233175","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.044101436,0.0005304311,0.949761,0.0002824957,0.000050110677,0.00006716116,0.00008741799,0.00007737614,0.0050425734],"genre_scores_gemma":[0.76744854,0.0010899993,0.22183302,0.00008239096,0.000056710083,0.00022206685,0.00016997902,0.000103007944,0.008994249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993662,0.00031350524,0.000024894367,0.00011073309,0.00012463395,0.000060041926],"domain_scores_gemma":[0.9974662,0.0015697404,0.00033158873,0.00015856134,0.0003074226,0.00016644335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015743701,0.0007695176,0.001185574,0.0011081853,0.0007832137,0.0010638407,0.0019124936,0.0012527442,0.0033995432],"category_scores_gemma":[0.0066713104,0.0008469566,0.00070653827,0.0017377556,0.0014659634,0.0026903653,0.0013423535,0.0010587248,0.00028533372],"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.000084894295,0.000032674026,0.00023127708,0.00007028707,0.000017569137,0.000019532818,0.000041021278,0.9158854,0.0005077025,0.06530605,0.0006364531,0.017167158],"study_design_scores_gemma":[0.000012149185,0.000046884397,0.00005666529,0.000010017444,0.000009593269,0.000018138211,0.0000137866955,0.9390497,0.00024247558,0.05994179,0.0005900451,0.000008692623],"about_ca_topic_score_codex":0.0030617032,"about_ca_topic_score_gemma":0.0032981841,"teacher_disagreement_score":0.0033995432,"about_ca_system_score_codex":0.0012007104,"about_ca_system_score_gemma":0.0008820649,"threshold_uncertainty_score":0.011372626},"labels":[],"label_agreement":null},{"id":"W2089805118","doi":"10.1007/s10479-014-1690-7","title":"Security economics: an adversarial risk analysis approach to airport protection","year":2014,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Infrastructure Resilience and Vulnerability Analysis","field":"Engineering","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":"Deep River Science Academy","funders":"","keywords":"Terrorism; Airport security; Adversarial system; Computer security; Control (management); Plan (archaeology); Risk analysis (engineering); Computer science; Port (circuit theory); Operations research; Business; Political science; Law; Engineering","score_opus":0.07864628547285307,"score_gpt":0.3611004496822594,"score_spread":0.28245416420940633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089805118","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.020187119,0.0028926372,0.91719943,0.009496282,0.00047800303,0.000060929833,0.00016037603,0.000068032394,0.04945714],"genre_scores_gemma":[0.9011497,0.0057345703,0.059861965,0.0006948303,0.0015187776,0.00013050743,0.000071763316,0.000090557514,0.030747306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895895,0.00067095,0.000025866442,0.00008318165,0.00017841122,0.00008272195],"domain_scores_gemma":[0.99757665,0.0018000002,0.00019696842,0.00010382497,0.00021337923,0.00010921182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019462808,0.0014048042,0.00097232434,0.0017370244,0.00079808134,0.003238254,0.0016355414,0.002198083,0.0053812386],"category_scores_gemma":[0.00572935,0.0006446274,0.0011408449,0.0013447253,0.0031902199,0.003738653,0.0017904252,0.0032829095,0.0002444299],"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.000009283664,0.000034854755,0.00024414723,0.000037865197,0.000041648575,0.000060282055,0.00004645384,0.18038473,0.00015279275,0.81172013,0.0018132452,0.0054546245],"study_design_scores_gemma":[0.0000063051098,0.000017944634,0.00018788617,0.00003595719,0.000021320759,0.00003557008,0.000058308422,0.24626344,0.00006930976,0.7505481,0.0027391585,0.000016572478],"about_ca_topic_score_codex":0.004410526,"about_ca_topic_score_gemma":0.0036916286,"teacher_disagreement_score":0.0053812386,"about_ca_system_score_codex":0.0027152102,"about_ca_system_score_gemma":0.0019751913,"threshold_uncertainty_score":0.019700348},"labels":[],"label_agreement":null},{"id":"W2090452502","doi":"10.1007/s10479-011-1032-y","title":"On the decomposition of the absolute ruin probability in a perturbed compound Poisson surplus process with debit interest","year":2011,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Probability and Risk Models","field":"Decision Sciences","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ruin theory; Mathematics; First-hitting-time model; Absolute (philosophy); Poisson distribution; Mathematical economics; Statistics; Risk model","score_opus":0.7238256754699147,"score_gpt":0.5407272151687531,"score_spread":0.18309846030116161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090452502","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.084375046,0.0020859507,0.8932024,0.0025897096,0.0002382745,0.00012750547,0.00031679802,0.0001571431,0.016907195],"genre_scores_gemma":[0.8837068,0.0037075307,0.083111346,0.0005230339,0.0005966209,0.00029731385,0.00044341685,0.00033566347,0.027278293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998131,0.0009030471,0.00009460537,0.00026030262,0.00034794988,0.00026321],"domain_scores_gemma":[0.98633844,0.01011832,0.0011571898,0.0005188448,0.000947738,0.000919467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008770507,0.0018268062,0.0027117066,0.0029651115,0.00082981883,0.0052371025,0.0025541638,0.0028827952,0.00846067],"category_scores_gemma":[0.024070801,0.0014591424,0.0017721133,0.001742218,0.0054831346,0.0069992933,0.0026825403,0.0045776847,0.0005594448],"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.000119827775,0.00007209513,0.0007827147,0.00012563256,0.00006246786,0.0001734768,0.00019365993,0.15595871,0.0010684045,0.8337604,0.0020230138,0.0056597213],"study_design_scores_gemma":[0.00001715219,0.000028680632,0.00050028524,0.000048138238,0.00002780692,0.000060127073,0.0000765724,0.6827328,0.00025842138,0.3156271,0.0005875101,0.00003535005],"about_ca_topic_score_codex":0.0041478504,"about_ca_topic_score_gemma":0.0021327904,"teacher_disagreement_score":0.008770507,"about_ca_system_score_codex":0.0034921963,"about_ca_system_score_gemma":0.0025098491,"threshold_uncertainty_score":0.04638344},"labels":[],"label_agreement":null},{"id":"W2092181454","doi":"10.1007/s10479-006-0136-2","title":"Credit risk optimization using factor models","year":2006,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":25,"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":"Portfolio optimization; Portfolio; Computer science; Mathematical optimization; Theory of computation; Credit risk; Modern portfolio theory; Curse of dimensionality; Optimization problem; Mathematics; Economics; Actuarial science; Machine learning; Algorithm; Finance","score_opus":0.6231119004332903,"score_gpt":0.5580227427264584,"score_spread":0.06508915770683199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092181454","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.016955703,0.001352145,0.9786089,0.00045592265,0.000109979046,0.000022523222,0.00008379733,0.00013310676,0.0022779107],"genre_scores_gemma":[0.8389393,0.00305105,0.14380549,0.00012969022,0.0003573619,0.00012281633,0.00037445952,0.00015675674,0.013063162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985713,0.00085257075,0.000059695114,0.00024008792,0.00016943326,0.00010705271],"domain_scores_gemma":[0.9938886,0.0048597283,0.0003554872,0.00032968086,0.00041917874,0.0001472954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036356999,0.0015534364,0.0024655235,0.0010699929,0.0004014177,0.0028031932,0.0011692885,0.0021697807,0.0038162663],"category_scores_gemma":[0.016826335,0.00114548,0.001540298,0.0016780739,0.0012359922,0.0044402354,0.0011188346,0.002295853,0.000411684],"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.000055836343,0.000022736189,0.00035207128,0.000038890557,0.000066225206,0.000028473329,0.00001521349,0.9417422,0.00013384903,0.043280035,0.00088446075,0.013379927],"study_design_scores_gemma":[0.000006843749,0.000009623982,0.00006952381,0.0000045076977,0.000009672602,0.0000066663565,0.0000023705695,0.958816,0.000037880567,0.040752042,0.00027891865,0.000005965389],"about_ca_topic_score_codex":0.006211424,"about_ca_topic_score_gemma":0.003278882,"teacher_disagreement_score":0.006211424,"about_ca_system_score_codex":0.0012276436,"about_ca_system_score_gemma":0.0009983977,"threshold_uncertainty_score":0.019227684},"labels":[],"label_agreement":null},{"id":"W2098518324","doi":"10.1007/s10479-008-0332-3","title":"A Bayesian approach for the alignment of high-resolution NMR spectra","year":2008,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Metabolomics and Mass Spectrometry Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":17,"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":"Image warping; Bayesian probability; Spectral line; Theory of computation; Computer science; Dynamic time warping; Nuclear magnetic resonance; Amplitude; Biological system; NMR spectra database; Resolution (logic); Algorithm; Artificial intelligence; Pattern recognition (psychology); Computational physics; Physics; Optics","score_opus":0.13986370215676733,"score_gpt":0.38872399052754253,"score_spread":0.2488602883707752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098518324","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.0014929018,0.00016110051,0.99762756,0.00010324768,0.00001789374,0.000030884985,0.000068252186,0.00028055353,0.00021758227],"genre_scores_gemma":[0.049636703,0.000377401,0.94720495,0.00014566092,0.00014730345,0.00025290417,0.0007035314,0.00031218657,0.0012192794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945123,0.00270546,0.00039806592,0.0009723394,0.0010941934,0.00031761682],"domain_scores_gemma":[0.9844135,0.011181487,0.00092467066,0.0011441496,0.0018979905,0.00043809693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0094282385,0.0016530905,0.002851642,0.0038140048,0.0024079368,0.0033499107,0.00561888,0.0036583808,0.0044165393],"category_scores_gemma":[0.02646994,0.0030380473,0.0028201593,0.0043428275,0.0019820414,0.004177653,0.0036207098,0.00479364,0.002326321],"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.0004658245,0.00029758623,0.0014073565,0.00034333335,0.00041586303,0.00019192258,0.00042714263,0.49422213,0.0050309575,0.07265256,0.0054490096,0.4190963],"study_design_scores_gemma":[0.000042150066,0.0000393454,0.00032167294,0.00003342033,0.000052294567,0.000061642626,0.000026958733,0.93568534,0.0007513997,0.06096395,0.0019709177,0.00005095987],"about_ca_topic_score_codex":0.016105277,"about_ca_topic_score_gemma":0.021268003,"teacher_disagreement_score":0.016105277,"about_ca_system_score_codex":0.0018300166,"about_ca_system_score_gemma":0.0049883863,"threshold_uncertainty_score":0.04986185},"labels":[],"label_agreement":null},{"id":"W2099280887","doi":"10.1007/s10479-012-1100-y","title":"A MAP-modulated fluid flow model with multiple vacations","year":2012,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":13,"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 Manitoba","funders":"Ministry of Education, Science and Technology; National Research Foundation of Korea; University of Seoul; National Research Foundation","keywords":"Markovian arrival process; Fluid dynamics; Fluid queue; Flow (mathematics); Laplace transform; Mathematics; Markov process; Computer science; Mathematical optimization; Applied mathematics; Queueing theory; Mathematical analysis; Geometry; Mechanics; Physics; Statistics","score_opus":0.1644797688412679,"score_gpt":0.3985013973777777,"score_spread":0.2340216285365098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099280887","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.35293645,0.0016122061,0.6149543,0.0038508256,0.00084637245,0.00014841123,0.0009422232,0.0005390219,0.024170207],"genre_scores_gemma":[0.97802573,0.00034227964,0.007406893,0.00012705378,0.00012527998,0.000066085704,0.0001470999,0.00004222774,0.013717194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994636,0.00016615336,0.00001830945,0.00012591062,0.000081831575,0.0001441058],"domain_scores_gemma":[0.9987987,0.00053372455,0.00013699652,0.00006211732,0.00024404228,0.00022427578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008289642,0.00091737375,0.0019979835,0.00073848484,0.0010151225,0.0026239718,0.0027548715,0.0035818524,0.0037458814],"category_scores_gemma":[0.0035266832,0.0010754331,0.0010022541,0.0012599797,0.0017354477,0.0027776158,0.0016768442,0.0017541687,0.00047115682],"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.00009112793,0.000053189895,0.0004385694,0.000028165845,0.000022034817,0.00013729627,0.000041185383,0.97566414,0.00069569936,0.019902362,0.0008641118,0.0020620932],"study_design_scores_gemma":[0.000005958232,0.000006648505,0.00004265991,0.0000011350986,0.0000031614854,0.000005198265,0.0000049113833,0.9986908,0.000025964842,0.0011320225,0.000077672405,0.0000038839676],"about_ca_topic_score_codex":0.020836117,"about_ca_topic_score_gemma":0.0058806925,"teacher_disagreement_score":0.020836117,"about_ca_system_score_codex":0.0017056233,"about_ca_system_score_gemma":0.0016986246,"threshold_uncertainty_score":0.0414297},"labels":[],"label_agreement":null},{"id":"W2107650959","doi":"10.1007/s10479-006-0026-7","title":"DEA models for supply chain efficiency evaluation","year":2006,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":462,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"National Natural Science Foundation of China","keywords":"Supply chain; Data envelopment analysis; Context (archaeology); Computer science; Supply chain management; Measure (data warehouse); Theory of computation; Service management; Chain (unit); Operations research; Microeconomics; Business; Mathematical optimization; Economics; Marketing; Mathematics; Data mining; Algorithm","score_opus":0.5687705235917271,"score_gpt":0.5828705551331151,"score_spread":0.014100031541388058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107650959","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.0053104484,0.0006678219,0.991243,0.00015321893,0.000033797107,0.000043825305,0.0001154109,0.00007034315,0.0023620874],"genre_scores_gemma":[0.5373784,0.0037130357,0.4445531,0.00020805401,0.00018102475,0.0009981946,0.0008247536,0.00022524105,0.011918189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99546933,0.003196182,0.00018642133,0.0002835974,0.0006739678,0.00019055122],"domain_scores_gemma":[0.98239523,0.0150515875,0.0005621179,0.0007151385,0.0011382687,0.00013755949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008166837,0.0020468058,0.002687257,0.0023321295,0.0007015768,0.0022565864,0.0020044805,0.0016522189,0.004653645],"category_scores_gemma":[0.019838525,0.0011944871,0.001899467,0.0035357398,0.00093198224,0.0034893483,0.0014042137,0.0030133445,0.0007260438],"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.000036935995,0.000043046864,0.00015455036,0.000059965158,0.00007036888,0.00001568762,0.000026294827,0.9129934,0.00016377632,0.06885391,0.00051614846,0.017065873],"study_design_scores_gemma":[0.0000043766595,0.000008617468,0.00003864605,0.0000088116,0.000011512272,0.0000047697226,0.000004861756,0.9733247,0.00008023578,0.02598493,0.00052408443,0.000004437754],"about_ca_topic_score_codex":0.0055872165,"about_ca_topic_score_gemma":0.004854712,"teacher_disagreement_score":0.008166837,"about_ca_system_score_codex":0.0026783985,"about_ca_system_score_gemma":0.0015127086,"threshold_uncertainty_score":0.043190837},"labels":[],"label_agreement":null},{"id":"W2107724521","doi":"10.1007/s10479-006-0023-x","title":"The efficiency of joint decision making in buyer-supplier relationships","year":2006,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Quality and Supply Management","field":"Business, Management and Accounting","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Benchmarking; Data envelopment analysis; Supply chain; Supply chain management; Computer science; Joint (building); Product (mathematics); Business; Operations research; Supplier relationship management; Efficiency; Microeconomics; Industrial organization; Marketing; Economics; Mathematics; Mathematical optimization; Statistics","score_opus":0.24606156247508776,"score_gpt":0.41685051042443766,"score_spread":0.1707889479493499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107724521","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.6639249,0.0018749025,0.28627798,0.002629117,0.000102372745,0.0001303519,0.00014097035,0.00017930311,0.0447401],"genre_scores_gemma":[0.98360574,0.0002947893,0.013513412,0.000056103137,0.000042424013,0.000040902094,0.00004855465,0.000033633532,0.0023644126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.982942,0.012920939,0.00063342106,0.00070888427,0.001936975,0.00085773005],"domain_scores_gemma":[0.67348087,0.30461675,0.006897833,0.009533455,0.0043860665,0.0010851065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022796666,0.00049531047,0.0014833855,0.0012466682,0.0010245157,0.005864341,0.0011524057,0.0018608359,0.00825679],"category_scores_gemma":[0.1301521,0.0007621951,0.000740688,0.0023540806,0.0024949126,0.0068666097,0.0017363367,0.0017646754,0.00086119934],"study_design_candidate":"observational","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.004308095,0.0009253314,0.019582232,0.00032441292,0.00046716884,0.00032324335,0.0020997294,0.42452264,0.0025295767,0.29372048,0.003120546,0.2480766],"study_design_scores_gemma":[0.00021606506,0.00038822563,0.009558095,0.000045406683,0.0001841886,0.00016352508,0.0011061961,0.5797295,0.0021346873,0.40443724,0.0019849446,0.00005199952],"about_ca_topic_score_codex":0.0029037471,"about_ca_topic_score_gemma":0.0018109444,"teacher_disagreement_score":0.022796666,"about_ca_system_score_codex":0.0019227408,"about_ca_system_score_gemma":0.0028866972,"threshold_uncertainty_score":0.12056172},"labels":[],"label_agreement":null},{"id":"W2109343421","doi":"10.1007/s10479-012-1298-8","title":"An integrated optimization model for fuel management and fire suppression preparedness planning","year":2013,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Evacuation and Crowd Dynamics","field":"Engineering","cited_by":59,"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":"Fogarty International Center; Bushfire Cooperative Research Centre","keywords":"Preparedness; Theory of computation; Integer programming; Computer science; Operations research; Emergency management; Engineering; Economics; Algorithm; Management","score_opus":0.14333808738921683,"score_gpt":0.4245741071868484,"score_spread":0.2812360197976316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109343421","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.05834878,0.0006398396,0.9114573,0.0009868598,0.0002031029,0.00014764133,0.0007046067,0.0003403587,0.027171472],"genre_scores_gemma":[0.906622,0.0004505259,0.07411699,0.00018190432,0.0000907171,0.00035242867,0.0005088087,0.0001207082,0.017556038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994586,0.00018414366,0.000020536158,0.00010426297,0.00010929646,0.00012328853],"domain_scores_gemma":[0.9991886,0.00047701853,0.00007325181,0.000027007058,0.00015982722,0.000074301395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010887147,0.0012089509,0.0021289173,0.0008651224,0.0007102509,0.002108946,0.0020461017,0.0027464556,0.0065750987],"category_scores_gemma":[0.002420937,0.001188973,0.0011295328,0.0011962234,0.00084813376,0.0015628671,0.0013366377,0.0017416751,0.0005808638],"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.000009385941,0.000010170325,0.00004063923,0.0000051607985,0.000005421241,0.000007882212,0.0000033003764,0.9978397,0.000040296523,0.0011229442,0.00011133934,0.00080374756],"study_design_scores_gemma":[0.0000040886907,0.0000055989967,0.000019412411,0.0000011659793,0.0000026519717,0.0000011750749,0.0000020571918,0.9994375,0.000016258888,0.00042737232,0.00008118087,0.0000014614033],"about_ca_topic_score_codex":0.032716196,"about_ca_topic_score_gemma":0.018597644,"teacher_disagreement_score":0.032716196,"about_ca_system_score_codex":0.0017510701,"about_ca_system_score_gemma":0.0028092032,"threshold_uncertainty_score":0.065051496},"labels":[],"label_agreement":null},{"id":"W2112502728","doi":"10.1007/s10479-015-1907-4","title":"Operations Research challenges in forestry: 33 open problems","year":2015,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Forest Biomass Utilization and Management","field":"Engineering","cited_by":130,"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; Dalhousie University; Université Laval","funders":"","keywords":"Forestry; Community forestry; Forest management; Environmental planning; Computer science; Management science; Operations research; Business; Environmental resource management; Engineering; Geography; Economics","score_opus":0.7507399674572494,"score_gpt":0.5250244848031548,"score_spread":0.22571548265409458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112502728","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.005963683,0.19603571,0.01929804,0.72880787,0.0063004396,0.00009494482,0.00046436753,0.00009064002,0.042944312],"genre_scores_gemma":[0.32570124,0.43601575,0.084674865,0.06485611,0.05764886,0.0007158561,0.0011041486,0.00027759137,0.029005544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97739697,0.012461036,0.0015101685,0.0016583467,0.0048646578,0.0021089606],"domain_scores_gemma":[0.849282,0.11336372,0.004975678,0.004535038,0.020594375,0.0072491714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04725668,0.0018285896,0.0043180487,0.0067516635,0.008312189,0.031198913,0.0064766635,0.015008128,0.031567954],"category_scores_gemma":[0.06207982,0.0013146676,0.0024055636,0.01122916,0.0265162,0.036490347,0.010301822,0.012682891,0.00423132],"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.00016123414,0.00066668197,0.001823746,0.0017694306,0.00011770218,0.0003685586,0.001262397,0.008598375,0.00013392452,0.65082896,0.14686383,0.18740512],"study_design_scores_gemma":[0.00004646483,0.00003786368,0.00076267676,0.0016976586,0.000024921974,0.00013486035,0.0053604827,0.0031590527,0.00003729341,0.8826513,0.10599408,0.00009322387],"about_ca_topic_score_codex":0.012930754,"about_ca_topic_score_gemma":0.018891359,"teacher_disagreement_score":0.04725668,"about_ca_system_score_codex":0.011023709,"about_ca_system_score_gemma":0.029737314,"threshold_uncertainty_score":0.24992019},"labels":[],"label_agreement":null},{"id":"W2120018445","doi":"10.1007/s10479-005-3455-9","title":"On Compact Formulations for Integer Programs Solved by Column Generation","year":2005,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":46,"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; Kronos (Canada); HEC Montréal; St Mary's Hospital Centre","funders":"","keywords":"Column generation; Theory of computation; Diagonal; Mathematical optimization; Mathematics; Integer programming; Integer (computer science); Compatibility (geochemistry); Branching (polymer chemistry); Computer science; Algorithm","score_opus":0.3155450072934694,"score_gpt":0.48209199191541985,"score_spread":0.16654698462195044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120018445","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.0054100044,0.0013223799,0.9823942,0.00058352394,0.00017277632,0.00014106435,0.0002642032,0.00022721721,0.009484708],"genre_scores_gemma":[0.16410005,0.0034961936,0.81794256,0.0008355984,0.0005959767,0.0009649282,0.0011905719,0.0007310682,0.01014306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828005,0.00090426015,0.00007288903,0.00014261484,0.00044083153,0.00015944634],"domain_scores_gemma":[0.98845285,0.009803331,0.00043868407,0.00058264483,0.0005920742,0.00013034666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037312384,0.0030176095,0.002002854,0.0015425766,0.000784762,0.0026601534,0.0017582816,0.0018124614,0.011292486],"category_scores_gemma":[0.015021181,0.0014569486,0.0017406647,0.0036667313,0.0017533329,0.004237378,0.0022086715,0.005287422,0.0017788945],"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.0002152929,0.0002614533,0.0002868942,0.0003753736,0.0000577495,0.0001255366,0.00018080375,0.6713701,0.0013409478,0.20668468,0.012221958,0.106879205],"study_design_scores_gemma":[0.000043424072,0.00005004495,0.00006710275,0.00008043557,0.000017938362,0.00002674333,0.000035610043,0.86583483,0.00038116294,0.12995104,0.0034985037,0.000013111089],"about_ca_topic_score_codex":0.003640365,"about_ca_topic_score_gemma":0.0057678623,"teacher_disagreement_score":0.011292486,"about_ca_system_score_codex":0.0015175742,"about_ca_system_score_gemma":0.0012191795,"threshold_uncertainty_score":0.037777126},"labels":[],"label_agreement":null},{"id":"W2124659975","doi":"10.1007/s10479-007-0176-2","title":"An overview of bilevel optimization","year":2007,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1430,"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; Université de Montréal","funders":"","keywords":"Bilevel optimization; Theory of computation; Mathematical optimization; Simple (philosophy); Computer science; Connection (principal bundle); Focus (optics); Mathematical economics; Optimization problem; Mathematics; Algorithm","score_opus":0.4883983889418265,"score_gpt":0.5434584453478315,"score_spread":0.055060056406004976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124659975","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009222586,0.13396756,0.8402208,0.0023341177,0.00065284135,0.00003206666,0.0001724297,0.00037969445,0.021318149],"genre_scores_gemma":[0.06688674,0.3492979,0.5561443,0.001595282,0.0056776847,0.00025185023,0.0008620612,0.0006364181,0.018647766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870276,0.00037482308,0.00013999866,0.00021800089,0.00049156457,0.00007281253],"domain_scores_gemma":[0.9990765,0.0005096351,0.00004388398,0.00010962414,0.00021445093,0.00004590168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001578643,0.0012292601,0.002310185,0.0022455202,0.00067031215,0.004150532,0.001429981,0.0017508793,0.0046503227],"category_scores_gemma":[0.0031235758,0.0011996763,0.0013407673,0.0051750513,0.0013286036,0.0045055836,0.0023013745,0.004243394,0.0029845198],"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.00005459095,0.00010365727,0.00040370077,0.0015996625,0.000120737845,0.000088871944,0.00008994828,0.038314592,0.0010959296,0.5517302,0.019520262,0.38687783],"study_design_scores_gemma":[0.000015079058,0.000054828808,0.00026092705,0.00036940846,0.000046969537,0.00024210392,0.0000423845,0.09333689,0.0006794911,0.7284936,0.17640905,0.000049273152],"about_ca_topic_score_codex":0.0011759446,"about_ca_topic_score_gemma":0.001225355,"teacher_disagreement_score":0.0046503227,"about_ca_system_score_codex":0.0009787934,"about_ca_system_score_gemma":0.0014536054,"threshold_uncertainty_score":0.015556872},"labels":[],"label_agreement":null},{"id":"W2125597755","doi":"10.1007/s10479-009-0669-2","title":"Applications and extensions of cost curves to marine container inspection","year":2009,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Industrial Vision Systems and Defect Detection","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bentley (Canada); Government of Canada","funders":"","keywords":"Container (type theory); Theory of computation; Computer science; Marine engineering; Reliability engineering; Operations research; Engineering drawing; Mathematics; Mechanical engineering; Engineering; Algorithm","score_opus":0.1612641464641404,"score_gpt":0.43289161872632004,"score_spread":0.27162747226217965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125597755","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.035815086,0.0026109666,0.9476143,0.0009084971,0.0002359186,0.000054583325,0.0001472008,0.0002271219,0.012386334],"genre_scores_gemma":[0.61702096,0.0055697015,0.36216438,0.00018528118,0.0005977831,0.000119071425,0.00031613695,0.0004539279,0.013572725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984043,0.0007840507,0.00009055599,0.00015925812,0.00044648183,0.00011533458],"domain_scores_gemma":[0.9869263,0.008214958,0.0007197299,0.0013979753,0.0023696169,0.00037135594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031460659,0.0013199421,0.0011244301,0.0027984376,0.0006299639,0.0021613068,0.0021713523,0.0015778878,0.0044953274],"category_scores_gemma":[0.030844456,0.00060648134,0.0014702064,0.00377371,0.0015129679,0.0041440628,0.0020389617,0.0027615486,0.0007932985],"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.00009528357,0.00009322432,0.0021114007,0.0001512875,0.00003766517,0.00013350253,0.00019005858,0.41046515,0.0011489518,0.36683384,0.0032733728,0.21546626],"study_design_scores_gemma":[0.000011286752,0.000056137196,0.00075695646,0.000049966893,0.0000140523525,0.00016270876,0.000051822004,0.71748626,0.00044185188,0.27207822,0.008854019,0.00003675775],"about_ca_topic_score_codex":0.005025757,"about_ca_topic_score_gemma":0.0030755028,"teacher_disagreement_score":0.005025757,"about_ca_system_score_codex":0.0014642321,"about_ca_system_score_gemma":0.0008643006,"threshold_uncertainty_score":0.01663822},"labels":[],"label_agreement":null},{"id":"W2128628754","doi":"10.1007/s10479-011-1045-6","title":"Multiobjective scatter search for a commercial territory design problem","year":2012,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":45,"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; HEC Montréal","funders":"Instituto Tecnológico y de Estudios Superiores de Monterrey; Universidad de León; Ministerio de Ciencia e Innovación; Universidad Autónoma de Nuevo León; Consejo Nacional de Ciencia y Tecnología","keywords":"Tabu search; Heuristics; Mathematical optimization; Metaheuristic; Sorting; Computer science; Local search (optimization); Theory of computation; Genetic algorithm; Multi-objective optimization; Heuristic; Mathematics; Algorithm","score_opus":0.3634122278103288,"score_gpt":0.4893909142891731,"score_spread":0.1259786864788443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128628754","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.14728695,0.0010868788,0.8374612,0.00068736175,0.00006821222,0.00022914645,0.00023941511,0.00019640071,0.012744462],"genre_scores_gemma":[0.73123634,0.0005881321,0.25691178,0.00010216039,0.000053992993,0.00040218837,0.00029778734,0.00013514319,0.010272533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947625,0.00027786425,0.000016303773,0.00006725155,0.000097046475,0.00006520868],"domain_scores_gemma":[0.99843353,0.0012027284,0.00009958457,0.000049529037,0.00010887336,0.00010566477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001786942,0.001311139,0.0020872003,0.0022523853,0.0008742211,0.0016055095,0.0011286911,0.00330892,0.0049530193],"category_scores_gemma":[0.0034891993,0.0010823533,0.0015898289,0.0021176704,0.0011410112,0.0013893937,0.0014995128,0.0013448098,0.00038859047],"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.00005578306,0.000049555703,0.0002931782,0.000054829732,0.00003514428,0.00005662538,0.000031490752,0.9868667,0.00038640146,0.003720274,0.00046254098,0.007987382],"study_design_scores_gemma":[0.00002215684,0.000050872477,0.00009759568,0.000009878025,0.000012834481,0.000016435664,0.000024347111,0.9964217,0.0001071132,0.0029274742,0.00030491367,0.0000047348076],"about_ca_topic_score_codex":0.0068908385,"about_ca_topic_score_gemma":0.005749224,"teacher_disagreement_score":0.0068908385,"about_ca_system_score_codex":0.0011677492,"about_ca_system_score_gemma":0.0013101777,"threshold_uncertainty_score":0.016569555},"labels":[],"label_agreement":null},{"id":"W2130360396","doi":"10.1007/s10479-013-1370-z","title":"A make-to-stock mountain-type inventory model","year":2013,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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":"McMaster University","funders":"","keywords":"Queue; Buffer (optical fiber); Fluid queue; Theory of computation; Markov chain; Computer science; Markov process; Content (measure theory); State (computer science); Mathematical optimization; Applied mathematics; Mathematics; Algorithm; Statistics; Mathematical analysis; Computer network; Telecommunications","score_opus":0.2188306103057322,"score_gpt":0.4250922636527753,"score_spread":0.2062616533470431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130360396","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.35234627,0.0018847452,0.5561076,0.0049497746,0.00033291025,0.00020399137,0.001996992,0.0005876209,0.081590086],"genre_scores_gemma":[0.9528187,0.0007432666,0.013201932,0.00022005475,0.00010034424,0.000084153646,0.00035342065,0.000040785268,0.032437455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996032,0.00013424792,0.00001678383,0.000070694114,0.0000545375,0.00012044217],"domain_scores_gemma":[0.9991843,0.00035708185,0.00009980451,0.00005992678,0.00011641176,0.00018251441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009211027,0.00065088255,0.001694108,0.00067513343,0.001048753,0.0027302217,0.0028733476,0.0030364275,0.009806002],"category_scores_gemma":[0.0027202636,0.0008699392,0.0011999238,0.0012808394,0.001459494,0.0029380317,0.0015058538,0.0015709521,0.0008997498],"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.00013614795,0.00008231521,0.0011527096,0.000058126527,0.00006279141,0.00052603043,0.00009480849,0.8661903,0.00063026446,0.124219276,0.0027733592,0.0040738573],"study_design_scores_gemma":[0.00003201087,0.000042793105,0.00028567138,0.0000071611294,0.000019490804,0.000050124094,0.00004562811,0.97223365,0.000051868425,0.026475554,0.00073832675,0.000017659515],"about_ca_topic_score_codex":0.014907863,"about_ca_topic_score_gemma":0.010079723,"teacher_disagreement_score":0.014907863,"about_ca_system_score_codex":0.0011711753,"about_ca_system_score_gemma":0.0014937537,"threshold_uncertainty_score":0.03280437},"labels":[],"label_agreement":null},{"id":"W2132083787","doi":"10.1007/s10479-005-5724-z","title":"A Tutorial on the Cross-Entropy Method","year":2005,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":3031,"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":"Cross-entropy method; Theory of computation; Computer science; Cross entropy; Combinatorial optimization; Entropy (arrow of time); Mathematical optimization; Theoretical computer science; Algorithm; Artificial intelligence; Principle of maximum entropy; Mathematics; Quadratic assignment problem","score_opus":0.7469201458343675,"score_gpt":0.7038611654305066,"score_spread":0.043058980403860914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132083787","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.0009205766,0.036578875,0.9497003,0.0010267668,0.0012223652,0.000026041445,0.0001879343,0.0002568836,0.010080229],"genre_scores_gemma":[0.054947443,0.09229052,0.8107171,0.0018520933,0.00947597,0.00038904915,0.0008235864,0.00070857967,0.028795626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988951,0.00053064444,0.00008669681,0.00014182895,0.00030009847,0.000045643636],"domain_scores_gemma":[0.9974879,0.0020547733,0.000067769055,0.00012275862,0.00021581886,0.0000508989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002853386,0.001642646,0.0018332424,0.002465404,0.00038144572,0.0016785525,0.0011853826,0.0018620018,0.008287929],"category_scores_gemma":[0.0049502235,0.00081269455,0.0014016745,0.0029528812,0.0011810068,0.0031344052,0.0013987622,0.0035450798,0.0028877559],"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.000031384203,0.000073320916,0.00040674585,0.0006674586,0.00011338396,0.00018967572,0.00013134243,0.026931632,0.0019613593,0.70060134,0.03030133,0.23859099],"study_design_scores_gemma":[0.00001398432,0.000087530374,0.0007074936,0.00027245877,0.00005719213,0.0005769363,0.0000328346,0.12915675,0.001726177,0.73381144,0.13346061,0.000096649106],"about_ca_topic_score_codex":0.00072936533,"about_ca_topic_score_gemma":0.0007726504,"teacher_disagreement_score":0.008287929,"about_ca_system_score_codex":0.0005776519,"about_ca_system_score_gemma":0.0007201408,"threshold_uncertainty_score":0.027725935},"labels":[],"label_agreement":null},{"id":"W2132931213","doi":"10.1007/s10479-013-1427-z","title":"Dynamic bidding strategies in search-based advertising","year":2013,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":17,"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":"Bidding; Computer science; Search advertising; Dynamic programming; Revenue; Budget constraint; Display advertising; Theory of computation; Real-time bidding; Mathematical optimization; Position (finance); Online advertising; Dynamic pricing; Stochastic programming; Algorithm; Economics; Microeconomics; Mathematics; The Internet","score_opus":0.14514743534404403,"score_gpt":0.41663901693784144,"score_spread":0.2714915815937974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132931213","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.7886713,0.0018353066,0.17261043,0.002946394,0.00011395293,0.00011657649,0.00019750532,0.00018276118,0.0333257],"genre_scores_gemma":[0.98924834,0.0003409303,0.0033962156,0.00006711358,0.00003531389,0.000027731861,0.00004570001,0.000021492313,0.0068171467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987907,0.0006521136,0.000060677074,0.000121058525,0.00016361466,0.00021188117],"domain_scores_gemma":[0.9852822,0.012639899,0.0006995413,0.00034843874,0.0005655212,0.0004643983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00315066,0.0005051358,0.0013144747,0.0010226804,0.00069589005,0.0034304564,0.0015199186,0.0018217918,0.0073296796],"category_scores_gemma":[0.020259252,0.0010902565,0.0006974174,0.0010088562,0.0012798042,0.0041145086,0.00085179805,0.0014437023,0.0006973363],"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.0015008651,0.00089414156,0.011298913,0.00028853555,0.00022013024,0.0007395306,0.0011136838,0.3411417,0.005552307,0.5594609,0.006633821,0.07115553],"study_design_scores_gemma":[0.0001118801,0.00011535024,0.0025341383,0.000021172082,0.00006379584,0.00020517428,0.00030418008,0.8383327,0.0004124332,0.15699674,0.00085890444,0.000043442706],"about_ca_topic_score_codex":0.004231959,"about_ca_topic_score_gemma":0.004073384,"teacher_disagreement_score":0.0073296796,"about_ca_system_score_codex":0.0014378635,"about_ca_system_score_gemma":0.0011929406,"threshold_uncertainty_score":0.024520218},"labels":[],"label_agreement":null},{"id":"W2134125472","doi":"10.1007/s10479-015-1805-9","title":"Multi-period hub network design problems with modular capacities","year":2015,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":69,"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":"Integer programming; Theory of computation; Modular design; Mathematical optimization; Set (abstract data type); Integer (computer science); Computer science; Relevance (law); Linear programming; Measure (data warehouse); Network planning and design; Facility location problem; Mathematics; Algorithm; Data mining; Telecommunications","score_opus":0.42360263638416223,"score_gpt":0.4270872876495254,"score_spread":0.003484651265363181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134125472","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.06757225,0.00060138496,0.9227475,0.0004141047,0.00009875625,0.00014979982,0.00041760676,0.000113538284,0.007885036],"genre_scores_gemma":[0.807083,0.0011947555,0.17644492,0.000114441464,0.00015535906,0.00048036533,0.000341854,0.00016364864,0.014021615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993063,0.00034897248,0.000024192204,0.000145733,0.000058718393,0.00011611073],"domain_scores_gemma":[0.9977254,0.0015784921,0.0003177575,0.00008626888,0.000119130666,0.00017283593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024407895,0.0018049148,0.0018096503,0.0011732851,0.00053473824,0.0013903102,0.0019478515,0.002126603,0.006157557],"category_scores_gemma":[0.004832968,0.0013287598,0.0015015848,0.0014149386,0.0008676143,0.0021957157,0.0013406588,0.0011830623,0.00037295718],"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.00007223887,0.000027018368,0.0001810035,0.00009157838,0.000049454306,0.00006338624,0.000018753239,0.97989523,0.0005505537,0.013317006,0.0005910724,0.0051426603],"study_design_scores_gemma":[0.00002241659,0.000074115174,0.00014590086,0.000014564291,0.00003282843,0.000023995675,0.000021136746,0.98422825,0.0002680394,0.01462149,0.0005386967,0.000008582948],"about_ca_topic_score_codex":0.0013898595,"about_ca_topic_score_gemma":0.0020306527,"teacher_disagreement_score":0.006157557,"about_ca_system_score_codex":0.0014845526,"about_ca_system_score_gemma":0.0010069789,"threshold_uncertainty_score":0.020599067},"labels":[],"label_agreement":null},{"id":"W2136180438","doi":"10.1007/s10479-011-0967-3","title":"Publicity vs. impact in nonprofit disclosures and donor preferences: a sequential game with one nonprofit organization and N donors","year":2011,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Nonprofit Sector and Volunteering","field":"Social Sciences","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Donation; Publicity; Transparency (behavior); Business; Accountability; Public relations; Openness to experience; Nonprofit organization; Prosocial behavior; Boosting (machine learning); Value (mathematics); Accounting; Marketing; Economics; Political science; Social psychology; Psychology","score_opus":0.3158228932772897,"score_gpt":0.44596906760572774,"score_spread":0.13014617432843806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136180438","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.8260836,0.0005368703,0.05385539,0.010984162,0.00026228503,0.00088691135,0.0007304828,0.00013949074,0.10652079],"genre_scores_gemma":[0.9863593,0.0001769606,0.00266923,0.0003793249,0.00006743681,0.00013585026,0.000047712856,0.000016879958,0.010147244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99138254,0.0048038107,0.00034415253,0.0007399122,0.00058906624,0.0021406305],"domain_scores_gemma":[0.93074065,0.055825837,0.004346005,0.0009129813,0.0010669985,0.007107502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015835244,0.0017711156,0.0036268875,0.0014346745,0.0022357702,0.00849975,0.003275446,0.008999728,0.022347048],"category_scores_gemma":[0.03427784,0.0015581324,0.0015375621,0.0011800262,0.004290377,0.008815066,0.0033501957,0.0064516715,0.0009002404],"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.010839106,0.0048470716,0.01747542,0.0007549907,0.00056151056,0.0021279838,0.0019808724,0.35202065,0.005247323,0.54765755,0.009958391,0.04652906],"study_design_scores_gemma":[0.0029709304,0.002999994,0.010481081,0.00019686621,0.0005201825,0.0005975376,0.003453418,0.5365724,0.0014014369,0.43570855,0.004712783,0.00038479947],"about_ca_topic_score_codex":0.0063883937,"about_ca_topic_score_gemma":0.010218127,"teacher_disagreement_score":0.022347048,"about_ca_system_score_codex":0.0057808906,"about_ca_system_score_gemma":0.005333227,"threshold_uncertainty_score":0.08374578},"labels":[],"label_agreement":null},{"id":"W2140198391","doi":"10.1007/s10479-009-0532-5","title":"Approximating zero-variance importance sampling in a reliability setting","year":2009,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Probability and Risk Models","field":"Decision Sciences","cited_by":38,"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":"Estimator; Mathematical optimization; Interpolation (computer graphics); Importance sampling; Applied mathematics; Approximation error; Function (biology); Mathematics; Markov chain; Bounded function; Heuristics; Computer science; Variance (accounting); Reliability (semiconductor); Parameterized complexity; Monte Carlo method; Algorithm; Statistics","score_opus":0.5793130532141241,"score_gpt":0.5796847489334721,"score_spread":0.0003716957193480308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140198391","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.013242383,0.00024030812,0.985887,0.00013985655,0.00002781076,0.00002910157,0.0000205147,0.000068644025,0.00034432282],"genre_scores_gemma":[0.70365065,0.00069869583,0.2921638,0.00015908174,0.0002918328,0.00025419492,0.00024260666,0.00010354393,0.0024355634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99072623,0.005978169,0.00032203592,0.000988626,0.0014727457,0.00051210896],"domain_scores_gemma":[0.91951364,0.07063358,0.0024329529,0.0034210186,0.0031771204,0.00082165544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020517427,0.0014513162,0.0031730072,0.0020765895,0.0005551163,0.0020355948,0.0040362254,0.002698824,0.0017224484],"category_scores_gemma":[0.08186818,0.0016269842,0.0015163436,0.0022113011,0.00285797,0.0038460572,0.002720702,0.0034247735,0.00029698032],"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.00029000902,0.000110096014,0.0020981333,0.00021034536,0.00012241333,0.0001445943,0.0001409404,0.8680423,0.000686286,0.09708997,0.00091773324,0.030147146],"study_design_scores_gemma":[0.000014094483,0.000025298941,0.00013191345,0.000008518503,0.000013763128,0.000026204001,0.0000073787473,0.97600937,0.0001569298,0.023491222,0.000108026536,0.0000072629787],"about_ca_topic_score_codex":0.004242745,"about_ca_topic_score_gemma":0.0022379616,"teacher_disagreement_score":0.020517427,"about_ca_system_score_codex":0.0015143566,"about_ca_system_score_gemma":0.0014646393,"threshold_uncertainty_score":0.10850781},"labels":[],"label_agreement":null},{"id":"W2142232457","doi":"10.1007/s10479-010-0710-5","title":"Designing the master schedule for demand-adaptive transit systems","year":2010,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":46,"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; HEC Montréal","funders":"Regione Lombardia; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Reservation; Computer science; Schedule; Operations research; Line (geometry); Theory of computation; Bus rapid transit; Set (abstract data type); Process (computing); Focus (optics); Real-time computing; Transport engineering; Public transport; Computer network; Engineering; Algorithm; Operating system","score_opus":0.2757419418382559,"score_gpt":0.41072793840617094,"score_spread":0.13498599656791505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142232457","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.09060372,0.000070396825,0.90402025,0.00025438276,0.000043628177,0.0002945721,0.00018288792,0.00039395416,0.0041362005],"genre_scores_gemma":[0.80231977,0.00012444667,0.19274384,0.00005457883,0.000046636535,0.00029200365,0.0003177266,0.00019359565,0.003907316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993812,0.00022319512,0.00003614268,0.00013550333,0.000101401594,0.00012258154],"domain_scores_gemma":[0.9984085,0.00094160443,0.00016495919,0.00011550435,0.00022698985,0.00014249669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016115308,0.00074658124,0.0010072485,0.0007182231,0.00079973025,0.0011176404,0.0011993113,0.00078727497,0.0067540975],"category_scores_gemma":[0.0049973363,0.00090912095,0.0005795504,0.00053745386,0.0006204625,0.0013782589,0.0010487495,0.0011507927,0.00054307043],"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.00017945534,0.000053884112,0.00055791787,0.00008064831,0.00002082279,0.000045398992,0.00017253558,0.95444375,0.0033757496,0.012966996,0.0012865594,0.026816223],"study_design_scores_gemma":[0.000019403082,0.000055933848,0.0000901802,0.0000043298423,0.000006382125,0.000005820675,0.000045657143,0.9949071,0.00066521286,0.003633671,0.00056191714,0.000004494824],"about_ca_topic_score_codex":0.0063085537,"about_ca_topic_score_gemma":0.0074916813,"teacher_disagreement_score":0.0067540975,"about_ca_system_score_codex":0.0013385409,"about_ca_system_score_gemma":0.00271485,"threshold_uncertainty_score":0.02259469},"labels":[],"label_agreement":null},{"id":"W2147388035","doi":"10.1007/s10479-005-2452-3","title":"Packing r-Cliques in Weighted Chordal Graphs","year":2005,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"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":"Combinatorics; Chordal graph; Mathematics; Split graph; Theory of computation; Discrete mathematics; Disjoint sets; Interval graph; Clique; Vertex (graph theory); Treewidth; Exponential time hypothesis; Graph; Pathwidth; Algorithm; Line graph","score_opus":0.19093514737532585,"score_gpt":0.48248149731860274,"score_spread":0.2915463499432769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147388035","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.7448629,0.0008294522,0.22079079,0.0009633244,0.0001990795,0.00035016533,0.0011222338,0.0007091213,0.03017295],"genre_scores_gemma":[0.80945796,0.00078587024,0.17009296,0.00030409792,0.00017677502,0.0002618487,0.0017610055,0.00038306724,0.016776435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983621,0.00039000245,0.00012043106,0.00041017673,0.00034238095,0.000374865],"domain_scores_gemma":[0.99347925,0.0032726536,0.0009295543,0.0010441735,0.00036642578,0.0009078878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082157337,0.00094272965,0.0018554537,0.0016726116,0.0022284088,0.0033810425,0.003356714,0.0019219576,0.009304512],"category_scores_gemma":[0.008268243,0.0014237745,0.001042613,0.004040928,0.0015766397,0.0050672125,0.0031869386,0.0017561577,0.001496097],"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.00235575,0.0010318899,0.008665622,0.0014064317,0.00047208596,0.0023236198,0.0023738698,0.14508153,0.038259465,0.59653056,0.022299705,0.17919941],"study_design_scores_gemma":[0.00025141062,0.0003445397,0.0025668426,0.00010672243,0.0001455045,0.0010965259,0.0012182877,0.29176283,0.008404642,0.6840888,0.009955441,0.000058344034],"about_ca_topic_score_codex":0.0022173421,"about_ca_topic_score_gemma":0.0032839896,"teacher_disagreement_score":0.009304512,"about_ca_system_score_codex":0.0010497872,"about_ca_system_score_gemma":0.0007111076,"threshold_uncertainty_score":0.031126738},"labels":[],"label_agreement":null},{"id":"W2153122315","doi":"10.1007/s10479-012-1148-8","title":"Approximately optimal bidding policies for repeated first-price auctions","year":2012,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Auction Theory and Applications","field":"Decision Sciences","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":"McGill University","funders":"","keywords":"Bidding; Common value auction; Theory of computation; Payment; Microeconomics; Bounded rationality; Rationality; Computer science; Real-time bidding; Mathematical optimization; Mathematical economics; Combinatorial auction; Economics; Operations research; Mathematics; Finance; Algorithm","score_opus":0.7247939710833537,"score_gpt":0.613052658155607,"score_spread":0.1117413129277467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153122315","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.22054821,0.0012509113,0.76802325,0.0014910392,0.00011929649,0.00027140894,0.0003085284,0.00040915105,0.0075782267],"genre_scores_gemma":[0.923082,0.000781678,0.07159098,0.00017342399,0.00013765373,0.00024661992,0.00024062846,0.00013784594,0.003609286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99566925,0.0024671464,0.00024119068,0.00038603702,0.00059813686,0.0006382429],"domain_scores_gemma":[0.96922934,0.024827478,0.0022503263,0.0015411149,0.0013434167,0.00080842694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073678265,0.0013159247,0.0035756156,0.0010377666,0.00071300095,0.004328951,0.0027188433,0.0024400093,0.0032800604],"category_scores_gemma":[0.042780504,0.0015986816,0.0010864742,0.0013361152,0.0014493535,0.005173002,0.0013108217,0.0026169815,0.00049125176],"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.000746752,0.00040769836,0.0011868061,0.00020653031,0.00015284767,0.00010954692,0.00023793856,0.8828389,0.0018023992,0.084461,0.002092473,0.025757099],"study_design_scores_gemma":[0.00010054633,0.00007516738,0.0002299218,0.00001656552,0.00002164385,0.000039792885,0.000035183333,0.93714404,0.000296375,0.061818097,0.00020423182,0.000018375153],"about_ca_topic_score_codex":0.0027336641,"about_ca_topic_score_gemma":0.0024816543,"teacher_disagreement_score":0.0073678265,"about_ca_system_score_codex":0.0026415298,"about_ca_system_score_gemma":0.0040688063,"threshold_uncertainty_score":0.038965225},"labels":[],"label_agreement":null},{"id":"W2178163879","doi":"10.1007/s10479-015-2008-0","title":"On the use of the $$L_{p}$$ L p distance in reference point-based approaches for multiobjective optimization","year":2015,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":10,"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":"Theory of computation; Multi-objective optimization; Point (geometry); Mathematical optimization; Mathematics; Computer science; Algorithm; Geometry","score_opus":0.6088702347949255,"score_gpt":0.4441123919419863,"score_spread":0.1647578428529392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2178163879","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.0017187766,0.0007482645,0.994786,0.00023141112,0.00009525285,0.000022536675,0.000015797725,0.000050315113,0.002331505],"genre_scores_gemma":[0.11176598,0.0017838911,0.8822338,0.00036360067,0.00019236264,0.00022265223,0.000107864085,0.00032888143,0.0030009346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99369264,0.00403571,0.00028221888,0.0005019647,0.001351149,0.00013645054],"domain_scores_gemma":[0.99031746,0.007020982,0.0003667081,0.0009260588,0.0011915509,0.00017725541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009242203,0.0015755728,0.0021926558,0.0019411349,0.0013872789,0.0025733635,0.003999277,0.0027416444,0.0043616057],"category_scores_gemma":[0.027262354,0.0007106206,0.0018885866,0.003193925,0.0032461502,0.00538348,0.0053197695,0.004612932,0.0011926475],"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.00018640446,0.00014251178,0.00042626128,0.00034450396,0.00011303226,0.00009500088,0.00021569745,0.28079507,0.00223499,0.48723608,0.0036043057,0.22460605],"study_design_scores_gemma":[0.000025441619,0.0001992221,0.00019958569,0.00014418058,0.00004355934,0.00008398445,0.00004587101,0.8375196,0.0013314282,0.15208577,0.008268559,0.00005282572],"about_ca_topic_score_codex":0.0033260805,"about_ca_topic_score_gemma":0.0034579802,"teacher_disagreement_score":0.009242203,"about_ca_system_score_codex":0.0011710129,"about_ca_system_score_gemma":0.0015679969,"threshold_uncertainty_score":0.048878074},"labels":[],"label_agreement":null},{"id":"W2196093576","doi":"10.1007/s10479-015-2075-2","title":"The impact of disruption characteristics on the performance of a server","year":2015,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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; University of Toronto","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Queueing theory; Exponential distribution; Queueing system; Queue; Service (business); Theory of computation; Counterintuitive; Idle; Process (computing); Computer network; Real-time computing; Operations research; Operating system; Statistics; Mathematics; Algorithm","score_opus":0.22508071540636565,"score_gpt":0.4446745214119028,"score_spread":0.21959380600553713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2196093576","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.98716635,0.00033955643,0.009453025,0.0003773851,0.00006281935,0.000016700551,0.00017911445,0.0001431999,0.0022618244],"genre_scores_gemma":[0.9994294,0.000047805515,0.00023774062,0.000014173001,0.000013968193,0.0000018355739,0.000048759135,0.000014070862,0.00019211775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744165,0.0006145993,0.00014254617,0.00024936692,0.00066377077,0.0008880626],"domain_scores_gemma":[0.95549166,0.033457305,0.0031166277,0.0021789733,0.0033394247,0.002416052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032807742,0.00064735935,0.00068479107,0.0011965693,0.0009035889,0.002473516,0.0009133083,0.0011966884,0.0022130779],"category_scores_gemma":[0.030851102,0.00045842497,0.00045762202,0.0018240319,0.001205724,0.0021950493,0.0009047799,0.0016867339,0.0005905421],"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.0051885014,0.00068255345,0.12829414,0.00014224325,0.00020411327,0.0012896444,0.0005264118,0.78125364,0.032995995,0.0075113256,0.0018630786,0.040048346],"study_design_scores_gemma":[0.000058165155,0.001711472,0.114027195,0.000029104207,0.00031388152,0.0012493867,0.001148672,0.8590502,0.015188399,0.0061539765,0.0009595646,0.00011000901],"about_ca_topic_score_codex":0.005049617,"about_ca_topic_score_gemma":0.00324954,"teacher_disagreement_score":0.005049617,"about_ca_system_score_codex":0.0019906424,"about_ca_system_score_gemma":0.0012496272,"threshold_uncertainty_score":0.017350614},"labels":[],"label_agreement":null},{"id":"W219822362","doi":"10.1023/a:1021388515849","title":"Solvability of Implicit Complementarity Problems","year":2002,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":17,"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":"Theory of computation; Complementarity (molecular biology); Mathematics; Mixed complementarity problem; Complementarity theory; Mathematical economics; Computer science; Applied mathematics; Algorithm; Nonlinear system","score_opus":0.48455297427459304,"score_gpt":0.5179340628099413,"score_spread":0.03338108853534821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W219822362","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.2552002,0.001279143,0.62523484,0.002673086,0.00020915206,0.00012768699,0.00032620443,0.00015861227,0.11479104],"genre_scores_gemma":[0.9124423,0.0009631104,0.052815735,0.00019010072,0.00020880271,0.00022598349,0.00034144786,0.00010498149,0.032707408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949384,0.00021048907,0.00001771981,0.000055650467,0.0001389055,0.00008337816],"domain_scores_gemma":[0.99721307,0.0021704007,0.00019666676,0.000098882236,0.00021395361,0.00010706341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083427946,0.0008606682,0.0009163525,0.0006812549,0.0006122114,0.0018856208,0.00084864785,0.0012758888,0.006626087],"category_scores_gemma":[0.0073901312,0.00050766394,0.00063347793,0.00057533674,0.0015475382,0.0022827631,0.001966607,0.0025652058,0.00033472345],"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.00009806549,0.00008346125,0.00028011407,0.00018174933,0.00002673172,0.00014558664,0.00028185453,0.08315987,0.0019370646,0.8927042,0.0028338237,0.018267537],"study_design_scores_gemma":[0.000059162277,0.000030881863,0.00011929268,0.000023479615,0.000010117207,0.000044544333,0.0000765627,0.28959635,0.0006001792,0.7064988,0.002930789,0.000009785904],"about_ca_topic_score_codex":0.0018433136,"about_ca_topic_score_gemma":0.001511004,"teacher_disagreement_score":0.006626087,"about_ca_system_score_codex":0.0007468228,"about_ca_system_score_gemma":0.00096483115,"threshold_uncertainty_score":0.02216649},"labels":[],"label_agreement":null},{"id":"W2205749379","doi":"10.1007/s10479-015-2026-y","title":"A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: $$ GI ^{[X]}/C$$ G I [ X ] / C - $$ MSP /1/\\infty $$ M S P / 1 / ∞","year":2015,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":21,"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":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Queue; Theory of computation; Simple (philosophy); Markovian arrival process; Markov process; Applied mathematics; Mathematics; Computer science; Buffer (optical fiber); Burke's theorem; Algorithm; Mathematical optimization; Discrete mathematics; Combinatorics; Queue management system; Statistics; Computer network; Fork–join queue; Telecommunications","score_opus":0.2093153899610347,"score_gpt":0.45275628948718816,"score_spread":0.24344089952615347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2205749379","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.033322204,0.0009513829,0.95542145,0.00073838345,0.00032893874,0.00011921362,0.0001591873,0.00038601313,0.008573142],"genre_scores_gemma":[0.83086914,0.0017016252,0.12907963,0.00047408216,0.0006636491,0.00029041967,0.00026921846,0.00044448598,0.03620769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990809,0.0001992792,0.000030341143,0.00015386933,0.00038875276,0.00014685436],"domain_scores_gemma":[0.9983506,0.000897703,0.00012749944,0.00008721281,0.00043750944,0.000099508055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019000418,0.0011758007,0.001455643,0.001325651,0.0007390907,0.0015107638,0.002599454,0.001139243,0.0081327865],"category_scores_gemma":[0.0065215356,0.000588902,0.001301509,0.0010193969,0.0013590882,0.0031148056,0.001102064,0.0018100406,0.0009783603],"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.00014266725,0.00014981945,0.0008873863,0.00026078735,0.0000737372,0.00039340742,0.00032121612,0.42089233,0.011322578,0.54026693,0.004940177,0.02034898],"study_design_scores_gemma":[0.000015233516,0.000022228098,0.0002570921,0.000011158032,0.000017785344,0.000060471004,0.000022299097,0.960129,0.000504081,0.037884198,0.001050372,0.000025997517],"about_ca_topic_score_codex":0.00971447,"about_ca_topic_score_gemma":0.0058272122,"teacher_disagreement_score":0.00971447,"about_ca_system_score_codex":0.0024017228,"about_ca_system_score_gemma":0.0037510793,"threshold_uncertainty_score":0.027206898},"labels":[],"label_agreement":null},{"id":"W2217046481","doi":"10.1007/s10479-015-2052-9","title":"Explicit formula for the optimal government debt ceiling","year":2015,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Fiscal Policies and Political Economy","field":"Economics, Econometrics and Finance","cited_by":30,"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":"Social Sciences and Humanities Research Council of Canada","keywords":"Debt-to-GDP ratio; Government debt; Debt; Internal debt; Debt ratio; External debt; Ceiling (cloud); Economics; Debt levels and flows; Recourse debt; Senior debt; Monetary economics; Finance; Engineering","score_opus":0.5218130253534555,"score_gpt":0.44392939073866433,"score_spread":0.0778836346147912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2217046481","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.05537074,0.005193513,0.78266066,0.021053506,0.0017416457,0.00020065173,0.0015520558,0.00070373644,0.13152348],"genre_scores_gemma":[0.75788677,0.003933357,0.19158046,0.0013723599,0.0015066016,0.00035951185,0.00078113587,0.00045386417,0.042125884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990952,0.00035994683,0.000061056446,0.00013716782,0.00020997296,0.0001366496],"domain_scores_gemma":[0.99580944,0.003029881,0.00023507151,0.00026867932,0.00051124,0.00014573723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033078368,0.0010321927,0.0017425201,0.0012322441,0.00060848147,0.003993957,0.001642456,0.0031112675,0.018694503],"category_scores_gemma":[0.019183367,0.0012316029,0.00060237164,0.0011347856,0.0016081954,0.004444247,0.0015738484,0.004585886,0.0018189696],"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.000049654573,0.000098341654,0.0005630302,0.00020218233,0.000026317226,0.00013655327,0.0001119378,0.11121567,0.0010347698,0.84075516,0.016232252,0.029574083],"study_design_scores_gemma":[0.00005926063,0.00001879982,0.0006367914,0.00017186246,0.000030951556,0.000116245865,0.000066891975,0.50936276,0.0005691441,0.48290223,0.0060338317,0.00003121696],"about_ca_topic_score_codex":0.0035359166,"about_ca_topic_score_gemma":0.004623657,"teacher_disagreement_score":0.018694503,"about_ca_system_score_codex":0.0028995518,"about_ca_system_score_gemma":0.0048128576,"threshold_uncertainty_score":0.06253928},"labels":[],"label_agreement":null},{"id":"W2230461717","doi":"10.1007/s10479-015-2091-2","title":"Exact and heuristic approaches for the cycle hub location problem","year":2016,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Bounding overwatch; Benchmark (surveying); Mathematical optimization; Metaheuristic; Theory of computation; Heuristic; Tree (set theory); Steiner tree problem; Network topology; Tree network; Set (abstract data type); Flow network; Branch and bound; Network planning and design; Routing (electronic design automation); Algorithm; Mathematics","score_opus":0.2801187575592472,"score_gpt":0.42866052791683307,"score_spread":0.14854177035758587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2230461717","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.012063014,0.0019622673,0.97475284,0.0005951371,0.00018581502,0.00007567123,0.00012457246,0.00010703297,0.010133596],"genre_scores_gemma":[0.391465,0.003237769,0.5934335,0.0003023961,0.00051180355,0.00035947878,0.00029526354,0.00020899416,0.01018579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871063,0.0006445635,0.000051566924,0.00012743818,0.00033557942,0.00013023579],"domain_scores_gemma":[0.9949196,0.004088865,0.00023394558,0.00027303866,0.00036443069,0.00012007475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026354727,0.0012880481,0.001378375,0.0019522401,0.0006348266,0.0019239883,0.0023653745,0.001988708,0.005541363],"category_scores_gemma":[0.01033393,0.0011082735,0.0010265533,0.0025899052,0.0015725138,0.0026422334,0.0015350394,0.0023526317,0.00046133093],"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.000052101164,0.00007332245,0.0001605602,0.00011406757,0.000027473536,0.000024632425,0.00004659956,0.91395164,0.00014597773,0.055428118,0.0017477096,0.028227802],"study_design_scores_gemma":[0.00001679308,0.000015597838,0.00005046091,0.000015482803,0.00000759925,0.000008918907,0.000019833331,0.96068907,0.000055059707,0.038234692,0.0008806521,0.000005902711],"about_ca_topic_score_codex":0.010199384,"about_ca_topic_score_gemma":0.011302489,"teacher_disagreement_score":0.010199384,"about_ca_system_score_codex":0.0020033228,"about_ca_system_score_gemma":0.0025944766,"threshold_uncertainty_score":0.020280063},"labels":[],"label_agreement":null},{"id":"W223119275","doi":"10.1023/a:1026102724889","title":"A Tabu Search with Slope Scaling for the Multicommodity Capacitated Location Problem with Balancing Requirements","year":2003,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":43,"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":"Tabu search; Initialization; Mathematical optimization; Heuristic; Integer programming; Theory of computation; Scaling; Mathematics; Integer (computer science); Computer science; Scale (ratio); Algorithm","score_opus":0.20830744040420834,"score_gpt":0.4026867677618781,"score_spread":0.19437932735766977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W223119275","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.114730634,0.0023216952,0.85596156,0.0010005919,0.00032495524,0.00054272055,0.0005888502,0.0029794145,0.021549605],"genre_scores_gemma":[0.32271957,0.00051208556,0.670531,0.00034673588,0.000111649206,0.00056186353,0.00057145447,0.00044447358,0.0042011864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920195,0.00047341562,0.000027285618,0.000080095546,0.00012567434,0.00009161298],"domain_scores_gemma":[0.9980478,0.0013596372,0.000099089004,0.00014652159,0.0002639993,0.000082944964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001974664,0.00106046,0.0017167977,0.0017666044,0.00085647707,0.0012863446,0.0021484618,0.0022897,0.010903109],"category_scores_gemma":[0.006198181,0.0009658962,0.0010332714,0.002922848,0.00081127323,0.001814754,0.0013531703,0.0015424312,0.0014003769],"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.00032457535,0.00025608455,0.00082020473,0.00014451279,0.000055222627,0.000051845454,0.00011901091,0.8285403,0.0009834782,0.0069543123,0.006870916,0.15487948],"study_design_scores_gemma":[0.00007498864,0.0000817194,0.00010816009,0.00001851031,0.000013338022,0.000011741221,0.00002879977,0.9955011,0.00013529492,0.003403436,0.00061487634,0.000007960608],"about_ca_topic_score_codex":0.006081879,"about_ca_topic_score_gemma":0.0051960703,"teacher_disagreement_score":0.010903109,"about_ca_system_score_codex":0.00073428446,"about_ca_system_score_gemma":0.0016915856,"threshold_uncertainty_score":0.036474586},"labels":[],"label_agreement":null},{"id":"W2233455626","doi":"10.1007/s10479-015-2096-x","title":"Self-regenerating environmental absorption efficiency and the $$\\varvec{ soylent~green~scenario}$$ s o y l e n t g r e e n s c e n a r i o","year":2016,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Ecosystem dynamics and resilience","field":"Environmental 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":"McGill University","funders":"McGill University","keywords":"Pollution; Biosphere; Social planner; Environmental science; Absorption (acoustics); Sink (geography); Theory of computation; Natural resource economics; Environmental economics; Computer science; Economics; Microeconomics; Physics; Ecology; Geography","score_opus":0.0406006296852944,"score_gpt":0.32394771970636255,"score_spread":0.28334709002106817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2233455626","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.93390507,0.00018606281,0.0046670227,0.0024239249,0.000050974355,0.000021606429,0.001245153,0.00012230013,0.05737794],"genre_scores_gemma":[0.9968855,0.000062590385,0.0004583816,0.000060617494,0.0000060964385,0.000008379095,0.00014135017,0.000017913679,0.0023591167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995591,0.0001799163,0.000008846548,0.000046120833,0.000031046206,0.00017487648],"domain_scores_gemma":[0.9989039,0.00048384993,0.0001590709,0.00009943965,0.00010674963,0.00024701515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011812048,0.00052215264,0.0004289751,0.0006700701,0.00051077694,0.0018627101,0.0010451952,0.0017074383,0.00903708],"category_scores_gemma":[0.0021284483,0.00021850211,0.00067601487,0.00071251695,0.00094069284,0.0019491239,0.0010118411,0.00087997504,0.0005000286],"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.0010468027,0.00047125109,0.009250066,0.00007938583,0.00011327658,0.00063047645,0.00009958448,0.7309016,0.0020661114,0.22859846,0.011721774,0.015021276],"study_design_scores_gemma":[0.00019726736,0.00031304595,0.014533383,0.000034042758,0.000098573924,0.00022232583,0.00085380406,0.8149629,0.0013300489,0.16124323,0.0061109303,0.00010045189],"about_ca_topic_score_codex":0.022260947,"about_ca_topic_score_gemma":0.024271404,"teacher_disagreement_score":0.022260947,"about_ca_system_score_codex":0.0020403748,"about_ca_system_score_gemma":0.0010126358,"threshold_uncertainty_score":0.044262707},"labels":[],"label_agreement":null},{"id":"W2253181232","doi":"10.1007/s10479-016-2114-7","title":"Loyal customer bases as innovation disincentives for duopolistic firms using strategic signaling and Bayesian analysis","year":2016,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Innovation Diffusion and Forecasting","field":"Decision Sciences","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":"York University","funders":"","keywords":"Incentive; Product (mathematics); Customer base; Industrial organization; Microeconomics; Game theory; Marketing; Business; New product development; Economics; Computer science","score_opus":0.6269283437231469,"score_gpt":0.5722951305975785,"score_spread":0.05463321312556835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2253181232","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.96225905,0.00026572996,0.031298675,0.00094660214,0.000020293874,0.00006781399,0.00010449525,0.000054838838,0.004982471],"genre_scores_gemma":[0.99733174,0.00010392904,0.0018489634,0.000027481783,0.000016347796,0.000013871312,0.000031998217,0.000007625392,0.00061797467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860865,0.0005859134,0.000081177925,0.00021620729,0.00020468436,0.000303449],"domain_scores_gemma":[0.9350874,0.05443877,0.00540351,0.0016138979,0.0018767547,0.0015796883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063190605,0.00047110024,0.0014538558,0.0028592327,0.0011357523,0.005826823,0.0014401849,0.0021646246,0.006616151],"category_scores_gemma":[0.034270722,0.00083399646,0.0013394883,0.0023450693,0.001827334,0.004192454,0.0017596646,0.0024693743,0.00024740453],"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.0026827287,0.0015048551,0.1446402,0.00035908344,0.0008790857,0.000700478,0.0023901793,0.2576962,0.0051369024,0.49001318,0.0033151803,0.09068194],"study_design_scores_gemma":[0.00012464369,0.00022129015,0.024232097,0.000047260703,0.00044908456,0.00010519691,0.0010663724,0.8192276,0.000660285,0.15295404,0.0007996172,0.00011250475],"about_ca_topic_score_codex":0.009965939,"about_ca_topic_score_gemma":0.012040845,"teacher_disagreement_score":0.009965939,"about_ca_system_score_codex":0.0022881047,"about_ca_system_score_gemma":0.0018443844,"threshold_uncertainty_score":0.033418775},"labels":[],"label_agreement":null},{"id":"W2258667926","doi":"10.1007/s10479-015-2046-7","title":"Ex-ante real estate Value at Risk calculation method","year":2015,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Housing Market and Economics","field":"Economics, Econometrics and Finance","cited_by":13,"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é Laval","funders":"","keywords":"Value at risk; Basel II; Real estate; Expected shortfall; Lease; Portfolio; Risk management; Market risk; Solvency; Actuarial science; Business; Computer science; Finance; Economics; Market liquidity; Capital requirement; Microeconomics","score_opus":0.389446211350737,"score_gpt":0.45290081348337274,"score_spread":0.06345460213263576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2258667926","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.015847791,0.000082671984,0.97457325,0.00017753382,0.00009874594,0.00007472874,0.00026002296,0.00056981225,0.008315389],"genre_scores_gemma":[0.4670433,0.00018963595,0.5062721,0.00012163552,0.00029239475,0.00026731723,0.00091724866,0.00026091398,0.024635509],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981792,0.00063491,0.000091538495,0.0002977796,0.0006411169,0.0001554631],"domain_scores_gemma":[0.99714077,0.0009312787,0.0001686721,0.0009877003,0.0007105568,0.00006101092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022877837,0.0007058393,0.00077720307,0.0008588535,0.0004314618,0.0016414125,0.0020190543,0.0007985515,0.013332071],"category_scores_gemma":[0.00797179,0.0003621576,0.0006923625,0.0007134995,0.00048174246,0.0022175277,0.00149938,0.0012824569,0.004061744],"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.00059958413,0.00037660112,0.009007926,0.00015227035,0.00018523728,0.00040749114,0.00015482292,0.1409448,0.0075168097,0.17886065,0.012374484,0.6494193],"study_design_scores_gemma":[0.0000507477,0.00010991137,0.0014837413,0.00002434214,0.000054074564,0.00035864176,0.000036470854,0.90710944,0.009455993,0.074500374,0.006784724,0.0000314337],"about_ca_topic_score_codex":0.00062992907,"about_ca_topic_score_gemma":0.0006532581,"teacher_disagreement_score":0.013332071,"about_ca_system_score_codex":0.00048796085,"about_ca_system_score_gemma":0.0011612152,"threshold_uncertainty_score":0.04460019},"labels":[],"label_agreement":null},{"id":"W2269687184","doi":"10.1007/s10479-015-2062-7","title":"The multi-vehicle cumulative covering tour problem","year":2015,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"Université Laval; HEC Montréal","funders":"Instituto Politécnico Nacional; Agence Nationale de la Recherche","keywords":"Computer science; Set cover problem; Theory of computation; Cover (algebra); Mathematical optimization; Set (abstract data type); Duration (music); Integer programming; Operations research; Time limit; Integer (computer science); Mathematics; Algorithm; Engineering","score_opus":0.4816960370809513,"score_gpt":0.45775293004690115,"score_spread":0.02394310703405017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269687184","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.24464864,0.0072234375,0.6764703,0.006462127,0.00079406874,0.0004246644,0.0052965763,0.0007209078,0.05795944],"genre_scores_gemma":[0.87032413,0.003440316,0.09388077,0.0004657582,0.0006328968,0.00031838557,0.002467308,0.0002992014,0.028171236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988643,0.000507537,0.000036589146,0.00020608609,0.00014170154,0.00024380567],"domain_scores_gemma":[0.9974023,0.0017225611,0.00022844526,0.00013613902,0.0001407228,0.0003698007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011393196,0.0014037383,0.0022307022,0.0012886052,0.0010816874,0.0025913517,0.002597904,0.0027967002,0.01036937],"category_scores_gemma":[0.00489341,0.0010441691,0.0012870848,0.003188043,0.0012749534,0.0026840728,0.0015580796,0.0015629445,0.0007510497],"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.00024567096,0.000119716744,0.0009675045,0.00040692106,0.0001758682,0.0003051799,0.00010900074,0.8786459,0.0005875791,0.059341673,0.019952023,0.03914299],"study_design_scores_gemma":[0.00006783058,0.00010581631,0.00066646084,0.000047474874,0.000051480332,0.00019002793,0.00012994767,0.9142823,0.00026277726,0.07727339,0.0068917614,0.000030829855],"about_ca_topic_score_codex":0.009488016,"about_ca_topic_score_gemma":0.00718129,"teacher_disagreement_score":0.01036937,"about_ca_system_score_codex":0.002262386,"about_ca_system_score_gemma":0.0018270983,"threshold_uncertainty_score":0.03468895},"labels":[],"label_agreement":null},{"id":"W2273410570","doi":"10.1007/s10479-015-1822-8","title":"Robust scenario-based value-at-risk optimization","year":2015,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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":"TD Bank Group","funders":"","keywords":"Theory of computation; Heuristic; Value at risk; Computer science; Mathematical optimization; Computational complexity theory; Expected shortfall; Value (mathematics); Robust optimization; Optimization algorithm; Algorithm; Risk management; Mathematics; Machine learning; Finance; Economics","score_opus":0.6708934013309007,"score_gpt":0.5373646680948094,"score_spread":0.13352873323609127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2273410570","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.012215752,0.00042035623,0.98394114,0.00039212275,0.000048871836,0.00006313139,0.00017665913,0.00016043817,0.0025815482],"genre_scores_gemma":[0.862663,0.000768619,0.13140409,0.00016278967,0.0001413202,0.00026805844,0.0007139851,0.00019856794,0.003679638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964946,0.0021364966,0.00012453744,0.00044338737,0.0005189216,0.00028214962],"domain_scores_gemma":[0.9916123,0.006521998,0.0006338421,0.00033088712,0.0006316887,0.0002692442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067304415,0.0025080207,0.0037281339,0.0016904371,0.00042527137,0.0031219623,0.0024588152,0.0028001426,0.00369173],"category_scores_gemma":[0.017777026,0.001486369,0.0018837014,0.0015220337,0.001538873,0.002982639,0.0030065335,0.0023189974,0.0005224237],"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.000053435837,0.000015458567,0.00008533259,0.000033535485,0.000052189636,0.00002583328,0.000007629547,0.98770857,0.00018406227,0.0085322745,0.0002983224,0.0030034394],"study_design_scores_gemma":[0.0000069188254,0.000017763312,0.000034116572,0.000004606708,0.000007564542,0.000007728982,0.000002263544,0.9924349,0.000084747255,0.0073009697,0.000093263596,0.000005082998],"about_ca_topic_score_codex":0.0029523799,"about_ca_topic_score_gemma":0.001083343,"teacher_disagreement_score":0.0067304415,"about_ca_system_score_codex":0.0017852503,"about_ca_system_score_gemma":0.001822188,"threshold_uncertainty_score":0.035594404},"labels":[],"label_agreement":null},{"id":"W2295318779","doi":"10.1023/a:1020966106259","title":"On the (r|X p )-Medianoid Problem on a Network with Vertex and Edge Demands","year":2002,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Animal Nutrition and Physiology","field":"Agricultural and Biological Sciences","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":"Group for Research in Decision Analysis; University of New Brunswick; HEC Montréal","funders":"","keywords":"Theory of computation; Vertex (graph theory); Computer science; Enhanced Data Rates for GSM Evolution; Facility location problem; Operations research; Graph; Theoretical computer science; Mathematics; Algorithm; Artificial intelligence","score_opus":0.24393543535074527,"score_gpt":0.351529036306678,"score_spread":0.1075936009559327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295318779","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.2716,0.003998726,0.6734024,0.015588411,0.0005554738,0.0010517943,0.0048988443,0.0005780691,0.028326266],"genre_scores_gemma":[0.6389135,0.0049638785,0.31244132,0.0013639027,0.0014341011,0.0013512226,0.0045795836,0.00074591156,0.03420652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969578,0.0013948395,0.0001520305,0.00072202354,0.00027048113,0.00050283753],"domain_scores_gemma":[0.97473687,0.02114859,0.0014303065,0.0006296032,0.0006923328,0.0013623588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057686805,0.0031781527,0.0073642707,0.0028637538,0.0027086071,0.0064665163,0.0060760016,0.007971624,0.020140633],"category_scores_gemma":[0.023147793,0.002331056,0.0023216445,0.0051556793,0.0036926654,0.012036993,0.005868634,0.0043539256,0.0013645835],"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.0010859591,0.0003888967,0.0016909054,0.0006836923,0.00021792298,0.00031957385,0.00035381428,0.8712736,0.00073310285,0.08049181,0.013859825,0.028900888],"study_design_scores_gemma":[0.00020516892,0.00019789378,0.00043098885,0.000085439584,0.000057543923,0.00012075852,0.00035929182,0.8298767,0.0002800808,0.16656107,0.0017760277,0.000048993497],"about_ca_topic_score_codex":0.013133009,"about_ca_topic_score_gemma":0.008665858,"teacher_disagreement_score":0.020140633,"about_ca_system_score_codex":0.0044901106,"about_ca_system_score_gemma":0.002805794,"threshold_uncertainty_score":0.06737709},"labels":[],"label_agreement":null},{"id":"W2296485814","doi":"10.1023/a:1020949602625","title":"Sensitivity Analysis to the Value of p of the ℓ p Distance Weber Problem","year":2002,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"Theory of computation; Range (aeronautics); Sensitivity (control systems); Mathematical optimization; Value (mathematics); Computer science; Set (abstract data type); Mathematics; Algorithm; Statistics","score_opus":0.18074010714106006,"score_gpt":0.3758739859940399,"score_spread":0.19513387885297986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296485814","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.4150099,0.003986513,0.516361,0.008464536,0.00043265137,0.00033015863,0.0005255576,0.0002179551,0.054671742],"genre_scores_gemma":[0.98600185,0.0006037245,0.010690782,0.00018695541,0.0001185106,0.00007164187,0.00006337537,0.000036133726,0.0022270891],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99263895,0.0058432715,0.00011911938,0.0004618962,0.0005091032,0.00042765375],"domain_scores_gemma":[0.84676313,0.14778724,0.00192805,0.0013440178,0.0016213581,0.00055623055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013052437,0.001092178,0.0017821074,0.0020990567,0.0010602287,0.0032427853,0.0014923647,0.002509004,0.0051134215],"category_scores_gemma":[0.08872463,0.00074913335,0.0015435735,0.0015066994,0.0031184219,0.004008492,0.0023885304,0.0030547408,0.00015767032],"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.00041197723,0.000118702126,0.0016897334,0.00022387764,0.00019828843,0.00028178704,0.0001500225,0.83928114,0.0006203677,0.1435821,0.002031488,0.011410505],"study_design_scores_gemma":[0.000045818902,0.00009695875,0.0006214255,0.00004289797,0.00007739852,0.00008795731,0.00015649103,0.8344184,0.00041453284,0.16322923,0.00076292775,0.000045907822],"about_ca_topic_score_codex":0.005684567,"about_ca_topic_score_gemma":0.0016020293,"teacher_disagreement_score":0.013052437,"about_ca_system_score_codex":0.0033608915,"about_ca_system_score_gemma":0.0016053246,"threshold_uncertainty_score":0.069028676},"labels":[],"label_agreement":null},{"id":"W2302298156","doi":"10.1007/s10479-015-2001-7","title":"Multi-trip pickup and delivery problem with time windows and synchronization","year":2016,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"Computer Research Institute of Montréal; École de Technologie Supérieure; Université de Montréal; Transport Canada","funders":"","keywords":"Vehicle routing problem; Tabu search; Computer science; Pickup; Benchmark (surveying); Operations research; Scheduling (production processes); Routing (electronic design automation); Job shop scheduling; Synchronization (alternating current); Mathematical optimization; Theory of computation; Computer network; Algorithm; Mathematics; Artificial intelligence","score_opus":0.091053267242863,"score_gpt":0.36662861446233885,"score_spread":0.27557534721947585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2302298156","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.056694355,0.0011151957,0.9358889,0.000822553,0.00019147633,0.00015867376,0.00053175923,0.0001567776,0.0044403486],"genre_scores_gemma":[0.87812674,0.0019572978,0.09778033,0.00016498432,0.0003720302,0.0005060991,0.00064808485,0.00018062237,0.020263797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984837,0.00055621035,0.00009462869,0.00042393096,0.0001921997,0.0002493476],"domain_scores_gemma":[0.99445,0.004151291,0.00067488704,0.00016037909,0.00022332612,0.00034010634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035827751,0.002094235,0.004394226,0.0015400882,0.0008504843,0.0025207275,0.0035344032,0.0031404227,0.005086927],"category_scores_gemma":[0.008491487,0.00210561,0.0021922793,0.0026242626,0.0012865671,0.004312392,0.0026839133,0.0023397484,0.00044709377],"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.000262662,0.00006992996,0.00038938614,0.00016236241,0.00010856509,0.0001980515,0.00004352411,0.96799344,0.0005769919,0.02269019,0.00088663696,0.0066183303],"study_design_scores_gemma":[0.00003231294,0.0000612376,0.00012974291,0.000006254288,0.00003542241,0.000028038248,0.000024211917,0.9928439,0.00015842359,0.006409716,0.00025707623,0.000013675024],"about_ca_topic_score_codex":0.006602079,"about_ca_topic_score_gemma":0.0029049695,"teacher_disagreement_score":0.006602079,"about_ca_system_score_codex":0.0017458077,"about_ca_system_score_gemma":0.0018593081,"threshold_uncertainty_score":0.01894778},"labels":[],"label_agreement":null},{"id":"W2330511976","doi":"10.1007/s10479-016-2145-0","title":"Static target search path planning optimization with heterogeneous agents","year":2016,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Robotic Path Planning Algorithms","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":"Defence Research and Development Canada","funders":"Defence Research and Development Canada","keywords":"Mathematical optimization; Computer science; Motion planning; Integer programming; Key (lock); Relaxation (psychology); Theory of computation; Path (computing); Quadratic programming; Quadratic equation; Computational complexity theory; Mathematics; Algorithm; Artificial intelligence","score_opus":0.24273312120667526,"score_gpt":0.4363235730292383,"score_spread":0.19359045182256304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2330511976","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.054148134,0.0002609489,0.9401665,0.00018304035,0.00005572405,0.000059114587,0.0000556969,0.00015306813,0.0049177385],"genre_scores_gemma":[0.85911125,0.00019103341,0.13486719,0.000080306854,0.00006600131,0.00019795929,0.0001293492,0.000062829095,0.0052940543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926776,0.00024346304,0.000037939495,0.0001823774,0.00015904919,0.00010948693],"domain_scores_gemma":[0.9989207,0.0006777075,0.00011672217,0.00009693529,0.000115777824,0.0000722862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015647567,0.0011314421,0.0013795071,0.0008656337,0.00072362076,0.0012872332,0.0017656889,0.0013827784,0.001954555],"category_scores_gemma":[0.0034803667,0.0010926697,0.0008724661,0.0012557942,0.0010512031,0.0018709253,0.00218979,0.0010372032,0.00029699557],"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.0000636513,0.000028441005,0.00017299908,0.000019307974,0.000026245072,0.000040448,0.000018452774,0.98435706,0.0004037745,0.003429332,0.00025429385,0.011185873],"study_design_scores_gemma":[0.000007310583,0.000016317212,0.00003904784,0.0000014660471,0.000005141573,0.0000048502834,0.000004869313,0.9974367,0.00010564468,0.0022930454,0.00008372945,0.0000018103611],"about_ca_topic_score_codex":0.0054588993,"about_ca_topic_score_gemma":0.0036346791,"teacher_disagreement_score":0.0054588993,"about_ca_system_score_codex":0.0011306797,"about_ca_system_score_gemma":0.001016997,"threshold_uncertainty_score":0.010854244},"labels":[],"label_agreement":null},{"id":"W2345837865","doi":"10.1007/s10479-016-2201-9","title":"Robust DEA to assess the reliability of methyl methacrylate-hardened hybrid poplar wood","year":2016,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Environmental Impact and Sustainability","field":"Environmental Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Service de Recherche et d'EXpertise en Transformation des Produits Forestiers; Université du Québec en Abitibi-Témiscamingue; University of Toronto","funders":"","keywords":"Data envelopment analysis; Theory of computation; Hardening (computing); Engineered wood; Computer science; Mathematical optimization; Mathematics; Pulp and paper industry; Algorithm; Materials science; Composite material; Engineering","score_opus":0.24463209559389026,"score_gpt":0.43112233088842944,"score_spread":0.18649023529453918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345837865","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.86432475,0.0005529813,0.13267058,0.000046861565,0.000036098336,0.000033535707,0.00067151734,0.0004516173,0.0012121378],"genre_scores_gemma":[0.98097205,0.00005214127,0.017911483,0.000012512998,0.000005637528,0.0000196191,0.00044096189,0.000033492237,0.00055202463],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990707,0.00018187288,0.000063620566,0.00026422602,0.00034462922,0.000074961274],"domain_scores_gemma":[0.9949621,0.0026847774,0.00074040086,0.0006421115,0.0008857239,0.00008491308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00243284,0.0005516354,0.00038086396,0.0012220703,0.00022450947,0.0006434449,0.00069572096,0.00060664583,0.0010583315],"category_scores_gemma":[0.0048334314,0.00023953813,0.0005522054,0.00059928675,0.0002805205,0.0007311939,0.00052014575,0.0005568272,0.00025288112],"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.0018036615,0.0005144776,0.049569726,0.0002575526,0.0005706096,0.00016439833,0.00010204288,0.37529743,0.41187483,0.0016756065,0.0006426807,0.15752693],"study_design_scores_gemma":[0.000021196462,0.0005766444,0.04218533,0.000014634133,0.00010663349,0.000112353955,0.00005886081,0.8022474,0.15256518,0.0010656229,0.0009858888,0.000060258848],"about_ca_topic_score_codex":0.0011486608,"about_ca_topic_score_gemma":0.0027502666,"teacher_disagreement_score":0.00243284,"about_ca_system_score_codex":0.00043519994,"about_ca_system_score_gemma":0.0003508225,"threshold_uncertainty_score":0.012866259},"labels":[],"label_agreement":null},{"id":"W2400948522","doi":"10.1007/s10479-016-2218-0","title":"Coordination of supply chain with a dominant retailer under government price regulation by revenue sharing contracts","year":2016,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":37,"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 Windsor","funders":"National Natural Science Foundation of China","keywords":"Revenue sharing; Supply chain; Microeconomics; Revenue; Business; Industrial organization; Government revenue; Government (linguistics); Economics; Finance; Marketing","score_opus":0.09069082994476892,"score_gpt":0.3307609102312852,"score_spread":0.24007008028651627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400948522","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.6142358,0.00041773464,0.30465,0.0034335903,0.00021752188,0.0005191833,0.00044190232,0.00049013895,0.075594105],"genre_scores_gemma":[0.9882212,0.00008837312,0.0058560073,0.000053208078,0.000033875243,0.000076408964,0.000031151973,0.000026048016,0.005613586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99575436,0.0017209873,0.00019906131,0.00089660106,0.00042133642,0.0010077546],"domain_scores_gemma":[0.9884039,0.0062300046,0.001989186,0.00117799,0.0009927858,0.0012060633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005074384,0.0009071537,0.0026286605,0.0009200918,0.0019239079,0.005375313,0.0029855599,0.0034110441,0.010205625],"category_scores_gemma":[0.0122998245,0.0012891993,0.0013179685,0.0013185123,0.0030009442,0.004305555,0.003268055,0.0019259938,0.00067845715],"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.0014994089,0.00032146025,0.0018911582,0.00015366425,0.0001523016,0.0010138607,0.00069170585,0.67819357,0.003970536,0.2931561,0.0041142083,0.01484211],"study_design_scores_gemma":[0.00033347672,0.0002533386,0.00084456196,0.000022731865,0.00008332879,0.00010694611,0.00048480916,0.8235989,0.00073522475,0.1715222,0.0019496572,0.00006470434],"about_ca_topic_score_codex":0.01035347,"about_ca_topic_score_gemma":0.0062372824,"teacher_disagreement_score":0.01035347,"about_ca_system_score_codex":0.0044266377,"about_ca_system_score_gemma":0.0057505467,"threshold_uncertainty_score":0.034141243},"labels":[],"label_agreement":null},{"id":"W2404422255","doi":"10.1007/s10479-017-2448-9","title":"Computational study of valid inequalities for the maximum k-cut problem","year":2017,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Complexity and Algorithms in Graphs","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Clique; Mathematics; Vertex (graph theory); Combinatorics; Focus (optics); Graph; Set (abstract data type); Inequality; Relaxation (psychology); Semidefinite programming; Mathematical optimization; Discrete mathematics; Computer science; Algorithm; Mathematical analysis","score_opus":0.5021551982509271,"score_gpt":0.5168750330118258,"score_spread":0.014719834760898665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404422255","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.39284706,0.0026630221,0.5286546,0.011009249,0.00048775025,0.0006779192,0.0034571616,0.0007145819,0.059488665],"genre_scores_gemma":[0.7790786,0.00083872414,0.2060967,0.00079078093,0.0004151249,0.00038832112,0.0033778055,0.0003471844,0.008666799],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996192,0.0019710243,0.0001806561,0.00047446016,0.00073329813,0.00044854527],"domain_scores_gemma":[0.87830603,0.11298332,0.0026248416,0.0026217583,0.0022059549,0.0012579849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005528856,0.0016139607,0.0017204791,0.0023220652,0.0018776854,0.006325492,0.0048802067,0.0021612728,0.020684203],"category_scores_gemma":[0.056117173,0.0011880419,0.0026885595,0.0033331825,0.0035013948,0.009332165,0.0032058554,0.0061002616,0.00079999055],"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.0019925646,0.0013658932,0.007468879,0.0013958182,0.00032475885,0.00043279046,0.00077914994,0.4694827,0.0021830243,0.40737337,0.019706678,0.08749442],"study_design_scores_gemma":[0.00013870515,0.00009205268,0.000604393,0.00006483754,0.000070125825,0.00009956069,0.00019433584,0.73692113,0.00073323713,0.2598524,0.0012030497,0.000026209105],"about_ca_topic_score_codex":0.0048720553,"about_ca_topic_score_gemma":0.007911202,"teacher_disagreement_score":0.020684203,"about_ca_system_score_codex":0.0032621315,"about_ca_system_score_gemma":0.003930849,"threshold_uncertainty_score":0.06919557},"labels":[],"label_agreement":null},{"id":"W2407184141","doi":"10.1007/s10479-016-2221-5","title":"Multiobjective variable mesh optimization","year":2016,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","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 Ottawa","funders":"Eurostars; Erasmus+; European Commission","keywords":"Mathematical optimization; Benchmark (surveying); Multi-objective optimization; Crossover; Theory of computation; Metaheuristic; Pareto principle; Evolutionary algorithm; Computer science; Population; Mathematics; Operator (biology); Algorithm; Artificial intelligence","score_opus":0.14629043189146912,"score_gpt":0.4340246466199914,"score_spread":0.2877342147285223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407184141","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.013760823,0.0018459819,0.9643132,0.0005282362,0.00049519434,0.000055204153,0.00013049219,0.00009016846,0.018780675],"genre_scores_gemma":[0.38242695,0.0024830014,0.58626735,0.00025290117,0.0003900833,0.00034826432,0.00042022322,0.0003131378,0.027098095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994247,0.00027657964,0.00002701813,0.00007794207,0.00015964042,0.00003414096],"domain_scores_gemma":[0.99910516,0.0005604992,0.000077305485,0.00008252452,0.00014139227,0.000033125336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013862117,0.0011978734,0.0014683357,0.0012241226,0.00048273077,0.0015824023,0.00086107745,0.0015674,0.006337861],"category_scores_gemma":[0.0033411346,0.00052683527,0.0011479346,0.0013146326,0.0007129952,0.0011839742,0.0012072766,0.0015679477,0.00078848377],"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.00006190854,0.00006803973,0.00039482556,0.00018680128,0.000096682474,0.000044600532,0.000024948795,0.844255,0.0014842302,0.048254475,0.004296276,0.1008322],"study_design_scores_gemma":[0.0000071683007,0.000024610541,0.0001276366,0.000026656466,0.00001658984,0.00001806309,0.000008995944,0.9749323,0.0004949079,0.021692526,0.0026447258,0.000005893594],"about_ca_topic_score_codex":0.0009859726,"about_ca_topic_score_gemma":0.0010161313,"teacher_disagreement_score":0.006337861,"about_ca_system_score_codex":0.00073052116,"about_ca_system_score_gemma":0.00059740257,"threshold_uncertainty_score":0.021202207},"labels":[],"label_agreement":null},{"id":"W2417816772","doi":"10.1007/s10479-018-2916-x","title":"Pricing policies for selling indivisible storable goods to strategic consumers","year":2018,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":10,"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":"Dynamic pricing; Monopolistic competition; Revenue management; Revenue; Product (mathematics); Nonlinear pricing; Pricing schedule; Order (exchange); Variable pricing","score_opus":0.43601966889142446,"score_gpt":0.46285017815339324,"score_spread":0.026830509261968782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2417816772","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.55197865,0.0013797155,0.37420607,0.006156706,0.0006030143,0.0004911867,0.00031708722,0.0006153146,0.06425227],"genre_scores_gemma":[0.9744075,0.00045706826,0.016123801,0.00019151832,0.00010625245,0.000082048464,0.000061793486,0.00006920516,0.00850076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985153,0.00064348767,0.00008143039,0.00015218278,0.00027209581,0.00033545526],"domain_scores_gemma":[0.9921898,0.0057525374,0.0005261136,0.0004583627,0.0006033171,0.0004698441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049530733,0.0010151796,0.001501351,0.0012429843,0.0013483057,0.00683355,0.002564859,0.0026920456,0.009143142],"category_scores_gemma":[0.018476138,0.0012944476,0.0011616661,0.0012774689,0.0025368975,0.0076097716,0.0015787143,0.0033565483,0.0007444623],"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.0009016344,0.00049573364,0.0012110218,0.00024613386,0.00007051547,0.0003157941,0.00070537557,0.35703048,0.0040895105,0.5833831,0.0061197397,0.04543101],"study_design_scores_gemma":[0.00015780123,0.00023649247,0.0006835786,0.000068067166,0.00008000357,0.00009894208,0.00039880848,0.7003384,0.0013193933,0.29445064,0.0020954772,0.00007245222],"about_ca_topic_score_codex":0.0018191801,"about_ca_topic_score_gemma":0.0017309594,"teacher_disagreement_score":0.009143142,"about_ca_system_score_codex":0.0038296208,"about_ca_system_score_gemma":0.0021092491,"threshold_uncertainty_score":0.030586839},"labels":[],"label_agreement":null},{"id":"W24773904","doi":"10.1023/a:1014955216633","title":"Operational Decisions in AGV-Served Flowshop Loops: Fleet Sizing and Decomposition","year":2001,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":25,"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":"Natural Sciences and Engineering Research Council of Canada; University of Texas at Dallas","keywords":"Theory of computation; Computer science; Decomposition; Set (abstract data type); Material flow; Minification; Mathematical optimization; Throughput; Loop (graph theory); Decomposition method (queueing theory); Industrial engineering; Algorithm; Mathematics; Engineering","score_opus":0.17081165853302757,"score_gpt":0.43412470764294725,"score_spread":0.2633130491099197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24773904","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.13297863,0.00035416655,0.8597406,0.00036596716,0.00004506211,0.00013572286,0.00020660934,0.00013011986,0.006043062],"genre_scores_gemma":[0.8492205,0.0004172354,0.1442529,0.000085175736,0.000059535167,0.0001487632,0.00027114217,0.00009668858,0.0054480745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956685,0.0001852086,0.000014652999,0.00006338822,0.000076062825,0.00009385959],"domain_scores_gemma":[0.9990823,0.0006350683,0.00010316736,0.000030987212,0.000100719844,0.000047682974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012367212,0.0009735071,0.001161119,0.00091617624,0.00058437634,0.0013752753,0.0007999063,0.0012529895,0.0021544225],"category_scores_gemma":[0.0027000795,0.0009450737,0.0008300953,0.0011796785,0.00079301244,0.0014317689,0.00067806157,0.0009165149,0.00020286255],"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.000049262166,0.000033020075,0.0002759561,0.000024981497,0.00001589948,0.00004933151,0.000027943257,0.9841537,0.0005741595,0.0037219024,0.00036706578,0.010706895],"study_design_scores_gemma":[0.0000033948468,0.000009764192,0.000060481347,0.000002587616,0.0000035781677,0.0000049727,0.000013364473,0.99572843,0.00014088323,0.00395175,0.00007909317,0.000001719229],"about_ca_topic_score_codex":0.008990857,"about_ca_topic_score_gemma":0.0103275925,"teacher_disagreement_score":0.008990857,"about_ca_system_score_codex":0.0010229792,"about_ca_system_score_gemma":0.001386427,"threshold_uncertainty_score":0.017877042},"labels":[],"label_agreement":null},{"id":"W2527340811","doi":"10.1007/s10479-016-2321-2","title":"An integer programming approach to curriculum-based examination timetabling","year":2016,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":24,"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":"Schedule; Computer science; Theory of computation; Curriculum; Set (abstract data type); Integer programming; Integer (computer science); Course (navigation); Operations research; Mathematics education; Programming language; Mathematics; Algorithm; Sociology; Pedagogy","score_opus":0.5537578790127029,"score_gpt":0.568445045148991,"score_spread":0.014687166136288066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527340811","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.0064993575,0.00013557643,0.9877846,0.0002683062,0.000055273675,0.00010823309,0.00014463146,0.00014152275,0.00486249],"genre_scores_gemma":[0.13620356,0.000485107,0.85613024,0.00014775258,0.00013725103,0.00042802014,0.00042207848,0.00015923768,0.0058867033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804115,0.0009829468,0.00008331202,0.0002606876,0.00034631306,0.00028552403],"domain_scores_gemma":[0.99679875,0.0024882148,0.00017756574,0.00011312089,0.00029699143,0.00012535152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031012045,0.0011119245,0.0014201183,0.0016611977,0.00086409017,0.0023731692,0.002355817,0.0013073251,0.009038626],"category_scores_gemma":[0.008088854,0.001099319,0.0017256497,0.0030135093,0.00084759644,0.0018711053,0.0013472583,0.002652844,0.0006248611],"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.00006340619,0.00021344007,0.00042366865,0.00009999729,0.00003315706,0.000040405215,0.00010510193,0.8853713,0.0005155054,0.05539616,0.002384065,0.055353828],"study_design_scores_gemma":[0.000018095883,0.00003845342,0.00013400856,0.000018441357,0.0000138952255,0.000010084928,0.000041777752,0.9733446,0.00022934614,0.024733027,0.0014081858,0.000010109638],"about_ca_topic_score_codex":0.017020496,"about_ca_topic_score_gemma":0.018384287,"teacher_disagreement_score":0.017020496,"about_ca_system_score_codex":0.002233625,"about_ca_system_score_gemma":0.004517785,"threshold_uncertainty_score":0.03384286},"labels":[],"label_agreement":null},{"id":"W2529544702","doi":"10.1007/s10479-016-2336-8","title":"An applicable method for modifying over-allocated multi-mode resource constraint schedules in the presence of preemptive resources","year":2016,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":18,"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 Calgary","keywords":"Computer science; Schedule; Scheduling (production processes); Operations research; Mathematical optimization; Operating system; Mathematics","score_opus":0.4946935409284301,"score_gpt":0.5864833560107651,"score_spread":0.09178981508233497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2529544702","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.0017992484,0.000024022544,0.99710387,0.000017634182,0.000038890383,0.000060015052,0.000023816603,0.00035275935,0.00057978765],"genre_scores_gemma":[0.049168028,0.00006577246,0.94811493,0.000036545618,0.000036221816,0.00016720757,0.0000852853,0.0002558738,0.0020699955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898356,0.0002570513,0.00006429532,0.00017661623,0.0004154392,0.000102973165],"domain_scores_gemma":[0.99766916,0.0012202254,0.00016742887,0.00034567493,0.0005055239,0.00009192079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017189778,0.0009802231,0.0009520811,0.0009077127,0.00062890415,0.00077931554,0.0017355377,0.0008065707,0.0041743633],"category_scores_gemma":[0.0056948266,0.00057701557,0.0011173562,0.00092346687,0.00058057543,0.0010201329,0.0013481034,0.0017381775,0.0008616146],"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.00032631893,0.00025406075,0.0009269846,0.00027778166,0.00012299784,0.0003668834,0.00032233764,0.26824814,0.02867439,0.040809285,0.004428902,0.655242],"study_design_scores_gemma":[0.00004732907,0.00007627529,0.00018604522,0.00001973758,0.000039807324,0.00012550343,0.00003193591,0.97163457,0.0058504194,0.016147725,0.0058104936,0.00003019177],"about_ca_topic_score_codex":0.003978521,"about_ca_topic_score_gemma":0.0056098453,"teacher_disagreement_score":0.0041743633,"about_ca_system_score_codex":0.00063298154,"about_ca_system_score_gemma":0.0017567505,"threshold_uncertainty_score":0.013964593},"labels":[],"label_agreement":null},{"id":"W2530903825","doi":"10.1007/s10479-016-2348-4","title":"An integrated approach of data envelopment analysis and boosted generalized linear mixed models for efficiency assessment","year":2016,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","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":"HEC Montréal","funders":"","keywords":"Data envelopment analysis; Theory of computation; Computer science; Operations research; Variable (mathematics); Econometrics; Sample (material); Efficiency; Control variable; Management science; Mathematical optimization; Economics; Mathematics; Statistics","score_opus":0.6296381408603613,"score_gpt":0.588157474481827,"score_spread":0.041480666378534314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2530903825","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.0011756027,0.00012482682,0.99825376,0.000038490984,0.000011301876,0.000026930582,0.000018781384,0.000032432476,0.00031789942],"genre_scores_gemma":[0.11488818,0.0006380002,0.88239604,0.00007973942,0.0000740676,0.0005151004,0.00014103524,0.00008231284,0.0011855615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9901467,0.006984246,0.00042018885,0.0005439126,0.0016503779,0.00025455668],"domain_scores_gemma":[0.99298954,0.004994448,0.00039226253,0.0005606654,0.00094853964,0.00011452608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012524056,0.0018308111,0.0037154425,0.0027569379,0.00064547913,0.0029034768,0.0019053983,0.0014858192,0.0023523464],"category_scores_gemma":[0.0188487,0.0010725474,0.0037852328,0.003831204,0.0007195508,0.0030920662,0.0031424596,0.0028449032,0.00046747195],"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.00010737417,0.00022957314,0.00095160236,0.00042389098,0.00047353486,0.00006184561,0.00016083808,0.6815883,0.0027836447,0.18703786,0.0009077465,0.12527378],"study_design_scores_gemma":[0.000005598154,0.00004488758,0.00013801934,0.000022857563,0.00003909653,0.000011416728,0.000012055639,0.9658223,0.00041947758,0.03272254,0.0007444308,0.000017343851],"about_ca_topic_score_codex":0.0027084502,"about_ca_topic_score_gemma":0.0029985826,"teacher_disagreement_score":0.012524056,"about_ca_system_score_codex":0.001384165,"about_ca_system_score_gemma":0.003682812,"threshold_uncertainty_score":0.06623429},"labels":[],"label_agreement":null},{"id":"W2531470941","doi":"10.1007/s10479-016-2344-8","title":"Using managerial revenue and cost estimates to value early stage real option investments","year":2016,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Capital Investment and Risk Analysis","field":"Economics, Econometrics and Finance","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 Toronto","funders":"","keywords":"Cash flow; Margin (machine learning); Revenue; Econometrics; Economics; Index (typography); Gross margin; Terminal value; Value (mathematics); Cash flow forecasting; Computer science; Microeconomics; Finance; Production (economics)","score_opus":0.40448125066685753,"score_gpt":0.4477826350915301,"score_spread":0.04330138442467257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2531470941","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.3620651,0.0014088304,0.62212384,0.000739157,0.00016616091,0.00010668357,0.00029724135,0.00028743755,0.012805549],"genre_scores_gemma":[0.9679481,0.00025772688,0.02987718,0.00001755406,0.000079158846,0.000026845357,0.00013398405,0.00003816641,0.0016212806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990421,0.0004349466,0.000054114702,0.00008054528,0.00029047905,0.00009782529],"domain_scores_gemma":[0.9868852,0.009977038,0.0009947087,0.0006819625,0.0012222781,0.00023889213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046795565,0.0010003543,0.0005740216,0.001877975,0.00019544497,0.0024034407,0.0008546122,0.00091108633,0.0023665281],"category_scores_gemma":[0.028408123,0.0004476682,0.0005607196,0.00083391066,0.00048141673,0.0038737494,0.0006433949,0.0015221954,0.00028716904],"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.00038640373,0.0001823236,0.011631047,0.00007631894,0.000115973526,0.0002653987,0.000103109734,0.82227993,0.0015268016,0.07427714,0.0016503854,0.08750525],"study_design_scores_gemma":[0.000012148642,0.000046171663,0.00158023,0.00002286352,0.000022566785,0.00004226574,0.000028635846,0.9689971,0.0009019723,0.02785294,0.00047410151,0.00001907644],"about_ca_topic_score_codex":0.0013915753,"about_ca_topic_score_gemma":0.001439594,"teacher_disagreement_score":0.0046795565,"about_ca_system_score_codex":0.0010499937,"about_ca_system_score_gemma":0.0007622321,"threshold_uncertainty_score":0.024748206},"labels":[],"label_agreement":null},{"id":"W2550116943","doi":"10.1007/s10479-016-2380-4","title":"Global portfolio construction with emphasis on conflicting corporate strategies to maximize stockholder wealth","year":2016,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Financial Markets and Investment Strategies","field":"Economics, Econometrics and Finance","cited_by":17,"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":"SFU Community Trust Endowment Fund","keywords":"Stock (firearms); Shareholder; Portfolio; Financial economics; Earnings; Economics; Emerging markets; Business; Context (archaeology); Econometrics; Finance; Corporate governance","score_opus":0.26575713921673744,"score_gpt":0.3940926706013812,"score_spread":0.12833553138464376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2550116943","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.11929545,0.0006199924,0.86577374,0.00046021928,0.00004788383,0.00007653822,0.000042244843,0.00015006006,0.013533881],"genre_scores_gemma":[0.88832504,0.0005034575,0.107033305,0.00009508292,0.0000512906,0.00008339614,0.00009021384,0.000100110105,0.0037181024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944454,0.00031072515,0.000024016235,0.00007196819,0.000084856845,0.00006386466],"domain_scores_gemma":[0.99916005,0.00043226505,0.00009397505,0.00012136436,0.000115593604,0.00007683404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019416737,0.000883064,0.00090665085,0.00094013015,0.00029076813,0.0017485997,0.00065243716,0.0009790672,0.0024641964],"category_scores_gemma":[0.0040368275,0.00041266295,0.0005966611,0.0012313138,0.0006938041,0.0023283637,0.0022082932,0.0008770002,0.00022006898],"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.00015680314,0.00007547125,0.0044878675,0.00010601254,0.00015297928,0.00017292456,0.0002460402,0.6346754,0.005922968,0.18075524,0.0019412027,0.17130712],"study_design_scores_gemma":[0.000049387643,0.00023441618,0.0014570309,0.000042005628,0.0001032795,0.00012443755,0.00012514638,0.8637956,0.0028049164,0.12836593,0.0028767996,0.000021102145],"about_ca_topic_score_codex":0.00024296885,"about_ca_topic_score_gemma":0.0005036895,"teacher_disagreement_score":0.0024641964,"about_ca_system_score_codex":0.00050622295,"about_ca_system_score_gemma":0.0006134362,"threshold_uncertainty_score":0.010268688},"labels":[],"label_agreement":null},{"id":"W2598497522","doi":"10.1007/s10479-018-2829-8","title":"NORTA for portfolio credit risk","year":2018,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Credit Risk and Financial Regulations","field":"Economics, Econometrics and Finance","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":"HEC Montréal; Group for Research in Decision Analysis; Brock University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Credit risk; Multivariate normal distribution; Econometrics; Mathematics; Marginal distribution; Monte Carlo method; Portfolio; Inverse; Multivariate statistics; Computer science; Applied mathematics; Statistics; Random variable; Economics; Actuarial science; Finance","score_opus":0.34951970351562434,"score_gpt":0.4431592246527254,"score_spread":0.09363952113710106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598497522","genre_codex":"other","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.00539731,0.04575575,0.04461147,0.043949917,0.0141806975,0.0001494266,0.03281829,0.009202061,0.80393505],"genre_scores_gemma":[0.050675962,0.026371576,0.023012592,0.0021784704,0.0069604497,0.00023995545,0.013322414,0.0038285926,0.87341005],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980623,0.00029529387,0.00014183158,0.00032868318,0.0010402586,0.0001316151],"domain_scores_gemma":[0.99552083,0.0010415574,0.0005780887,0.00088355714,0.0015372199,0.0004388348],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002082064,0.0016819687,0.0018163336,0.004354608,0.0006772904,0.0036395038,0.0013769187,0.0021623857,0.31348598],"category_scores_gemma":[0.009819438,0.0005204974,0.00095093163,0.0035325377,0.0005043535,0.0032848872,0.0017624082,0.0033378273,0.17061307],"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.00009219708,0.000059074595,0.0009369042,0.000196746,0.000036829537,0.00021604467,0.000068529815,0.0011747445,0.00034195214,0.1417522,0.63125896,0.2238658],"study_design_scores_gemma":[0.000032125292,0.000019601872,0.0008611341,0.00026991352,0.000021199407,0.0002472587,0.000026546786,0.0034673996,0.00031335367,0.059645247,0.9350711,0.000025120382],"about_ca_topic_score_codex":0.0036894265,"about_ca_topic_score_gemma":0.0041241995,"teacher_disagreement_score":0.31348598,"about_ca_system_score_codex":0.0022438467,"about_ca_system_score_gemma":0.0018381078,"threshold_uncertainty_score":0.9792289},"labels":[],"label_agreement":null},{"id":"W2612949480","doi":"10.1007/s10479-017-2512-5","title":"On the optimality of coupon books","year":2017,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Supply Chain and Inventory 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":"Dalhousie University; Western University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Coupon; Market share; Business; Marketing; Set (abstract data type); Advertising; Action (physics); Computer science; Finance","score_opus":0.44090244058046657,"score_gpt":0.4539300486181374,"score_spread":0.013027608037670835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612949480","genre_codex":"other","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.058127064,0.018701063,0.18142217,0.032315604,0.0018393558,0.00009747484,0.0010590648,0.00032821484,0.70610994],"genre_scores_gemma":[0.7931522,0.013489874,0.03621741,0.0030954403,0.0034016594,0.00021971676,0.00075374555,0.0006871524,0.14898276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957469,0.0020558825,0.000240751,0.00046443424,0.001026023,0.00046600887],"domain_scores_gemma":[0.95923895,0.03374363,0.00093347486,0.0028331622,0.0026955125,0.0005553629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005933465,0.0012014552,0.0025391479,0.0030926869,0.003309568,0.0062517696,0.0026771838,0.0037582528,0.035103284],"category_scores_gemma":[0.048182532,0.0015732147,0.0016186945,0.0039334884,0.007917818,0.016065499,0.0031979291,0.0068565626,0.0036056067],"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.00003866355,0.000014484694,0.00016544208,0.00003144458,0.00000819223,0.00001557157,0.00007127053,0.0018873793,0.000034093533,0.98694706,0.005402332,0.0053841034],"study_design_scores_gemma":[0.000012463306,0.0000065491868,0.00014446063,0.000025214727,0.0000058662376,0.000023309092,0.000027954457,0.0034071843,0.00003969384,0.9922483,0.0040519526,0.0000070679807],"about_ca_topic_score_codex":0.007995843,"about_ca_topic_score_gemma":0.0064144763,"teacher_disagreement_score":0.035103284,"about_ca_system_score_codex":0.0053921444,"about_ca_system_score_gemma":0.0027480754,"threshold_uncertainty_score":0.11743224},"labels":[],"label_agreement":null},{"id":"W2613210738","doi":"10.1007/s10479-017-2507-2","title":"On component commonality for periodic review assemble-to-order systems","year":2017,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Component (thermodynamics); Mathematical optimization; Stock (firearms); Computer science; Order (exchange); Regular polygon; Base (topology); Operations research; Mathematics; Economics; Engineering","score_opus":0.4354616218522958,"score_gpt":0.4860514672669335,"score_spread":0.05058984541463768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613210738","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.18336263,0.0009733876,0.7935568,0.0012291215,0.00014691557,0.00023910876,0.00036403726,0.0003651358,0.019762853],"genre_scores_gemma":[0.9417647,0.0007522399,0.05235377,0.00017413293,0.00029448798,0.00016277477,0.00040218045,0.00018581096,0.003909912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98932636,0.0028796555,0.0011140901,0.0020711196,0.0030356424,0.001573181],"domain_scores_gemma":[0.9267589,0.046366252,0.005563279,0.012792113,0.006930486,0.001589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011535552,0.0012861345,0.0026079959,0.004648522,0.0026759899,0.00564569,0.0028477625,0.0018969337,0.0061159455],"category_scores_gemma":[0.07368987,0.0012097919,0.0036927566,0.004780233,0.005259008,0.011399994,0.0055921786,0.0040473468,0.00067117676],"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.00029006548,0.00013330362,0.00432475,0.00012866693,0.00013571804,0.00030913798,0.0009163585,0.06719131,0.0016867178,0.88411856,0.0018796108,0.038885746],"study_design_scores_gemma":[0.000035753375,0.00014795977,0.0017756054,0.000084450105,0.00011196499,0.00024043328,0.0002807063,0.2626793,0.0013062019,0.73053294,0.0027393794,0.00006539186],"about_ca_topic_score_codex":0.004547182,"about_ca_topic_score_gemma":0.0026010629,"teacher_disagreement_score":0.011535552,"about_ca_system_score_codex":0.0028709576,"about_ca_system_score_gemma":0.0025203954,"threshold_uncertainty_score":0.061006546},"labels":[],"label_agreement":null},{"id":"W2730563372","doi":"10.1007/s10479-017-2567-3","title":"A meta-heuristic for capacitated green vehicle routing problem","year":2017,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":61,"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 Manitoba","funders":"","keywords":"Vehicle routing problem; Mathematical optimization; Alternative fuel vehicle; Heuristic; Routing (electronic design automation); Ant colony optimization algorithms; Computer science; Ant colony; Engineering; Automotive engineering; Alternative fuels; Mathematics; Computer network","score_opus":0.484601735208781,"score_gpt":0.48273314728261624,"score_spread":0.0018685879261647886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2730563372","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.07389739,0.002147917,0.89918333,0.0007706771,0.00042299635,0.00028028994,0.00027517654,0.0005145141,0.022507751],"genre_scores_gemma":[0.53389704,0.0009764299,0.45793182,0.00029041996,0.0001605518,0.0005598557,0.00030353517,0.000129921,0.005750398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960095,0.00017789348,0.000017149365,0.000048058522,0.000088108514,0.00006788632],"domain_scores_gemma":[0.9994604,0.00031498322,0.000048315484,0.000044978195,0.00009190369,0.00003945159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009828358,0.0011343528,0.0012162229,0.0016990135,0.0005868221,0.0012883573,0.0016980554,0.002150411,0.0031654765],"category_scores_gemma":[0.0016823283,0.0007005589,0.0013402241,0.001492865,0.0005362393,0.0007896884,0.0008954275,0.001261673,0.00037000477],"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.00005476248,0.00007205404,0.00022155614,0.00006552098,0.000052409934,0.000053127445,0.00002437493,0.96253157,0.0007681427,0.006722289,0.0011321447,0.028302008],"study_design_scores_gemma":[0.000021388825,0.000037779002,0.00005818123,0.000016900438,0.000024080347,0.000015144703,0.0000103811735,0.9968072,0.00019623755,0.0021640577,0.00064406864,0.000004595253],"about_ca_topic_score_codex":0.004154815,"about_ca_topic_score_gemma":0.0038941125,"teacher_disagreement_score":0.004154815,"about_ca_system_score_codex":0.0012206476,"about_ca_system_score_gemma":0.0014561566,"threshold_uncertainty_score":0.0105896},"labels":[],"label_agreement":null},{"id":"W2734352835","doi":"10.1007/s10479-020-03580-1","title":"Balancing supply and demand in the presence of renewable generation via demand response for electric water heaters","year":2020,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Smart Grid Energy Management","field":"Engineering","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Demand response; Renewable energy; Electric power; Grid; Population; Peak demand; Power demand; Environmental science; Power (physics); Engineering; Automotive engineering; Electricity; Electrical engineering; Mathematics; Power consumption","score_opus":0.09946719576344583,"score_gpt":0.3411121605336217,"score_spread":0.24164496477017589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734352835","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.46275407,0.00021282233,0.5295643,0.0010307499,0.00005462384,0.00009388339,0.00020106576,0.00026042224,0.005828041],"genre_scores_gemma":[0.99408937,0.000039613547,0.004607016,0.000029061102,0.0000092708215,0.0000251015,0.000030750718,0.00001439212,0.001155368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999627,0.00018297668,0.000009811896,0.000060161583,0.000046783072,0.0000732011],"domain_scores_gemma":[0.99924135,0.00048840453,0.00012571695,0.000021421884,0.00007199406,0.000051279545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089151616,0.0005088838,0.00077486475,0.0002128277,0.000289106,0.00085214793,0.00067438616,0.0007831156,0.0014286675],"category_scores_gemma":[0.0019798854,0.00063394115,0.0005311283,0.000293742,0.0004900318,0.00085440505,0.0006332425,0.00076405203,0.00015003426],"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.000039511775,0.000011504177,0.00024883394,0.0000060601647,0.0000070047317,0.000019219386,0.0000061675682,0.99725384,0.00041199295,0.0012235608,0.000061386825,0.00071087736],"study_design_scores_gemma":[0.0000030276417,0.000006082965,0.000055451794,3.6694627e-7,0.0000015190075,0.000001168768,0.0000023966725,0.9994461,0.0000738469,0.00039122163,0.000017191587,0.0000016257316],"about_ca_topic_score_codex":0.010862749,"about_ca_topic_score_gemma":0.009445734,"teacher_disagreement_score":0.010862749,"about_ca_system_score_codex":0.0010004386,"about_ca_system_score_gemma":0.0010294503,"threshold_uncertainty_score":0.021598995},"labels":[],"label_agreement":null},{"id":"W2741542409","doi":"10.1007/s10479-018-2868-1","title":"Improving set partitioning problem solutions by zooming around an improving direction","year":2018,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Set (abstract data type); Computer science; Zoom; Mathematical optimization; Integer programming; Algorithm; Mathematics; Programming language","score_opus":0.1797821635311046,"score_gpt":0.4289831972472035,"score_spread":0.24920103371609892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741542409","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.050408017,0.00080105383,0.9379719,0.00067361415,0.0003857412,0.00019375578,0.00012072485,0.0015045013,0.007940631],"genre_scores_gemma":[0.17843609,0.00044311606,0.81746936,0.00039342124,0.00013417781,0.00016202369,0.00029946756,0.00033986784,0.0023224421],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993901,0.00023180382,0.000036942074,0.00012595866,0.00015649742,0.000058593592],"domain_scores_gemma":[0.997718,0.001157034,0.0001624291,0.0003761647,0.00048612477,0.00010029055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017761573,0.0017914292,0.0011958316,0.0014662817,0.000802805,0.0010409267,0.0014987912,0.001381558,0.0070400196],"category_scores_gemma":[0.008994205,0.0006884758,0.0008339825,0.00091764395,0.0005428096,0.0021360605,0.0015908297,0.0019415055,0.001137007],"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.0007120022,0.00052134384,0.0019676024,0.00051773974,0.00010233563,0.00010222629,0.00036484803,0.35862422,0.020196829,0.019716028,0.012654727,0.58452016],"study_design_scores_gemma":[0.00009630323,0.00028366057,0.00034266314,0.00006269392,0.000057188463,0.00007422649,0.00011656093,0.97936857,0.004745494,0.0105661545,0.0042689964,0.000017492635],"about_ca_topic_score_codex":0.0023101368,"about_ca_topic_score_gemma":0.0038883125,"teacher_disagreement_score":0.0070400196,"about_ca_system_score_codex":0.00042709452,"about_ca_system_score_gemma":0.001046792,"threshold_uncertainty_score":0.023551226},"labels":[],"label_agreement":null},{"id":"W2741806916","doi":"10.1007/s10479-017-2593-1","title":"A modular capacitated multi-objective model for locating maritime search and rescue vessels","year":2017,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":57,"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; Dalhousie University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Backup; Coast guard; Computer science; Search and rescue; Operations research; Modular design; Artificial intelligence; Marine engineering; Engineering","score_opus":0.385724764705991,"score_gpt":0.4452719322457438,"score_spread":0.05954716753975281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741806916","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.11501994,0.000497147,0.87095946,0.0005090438,0.00012543247,0.0001258569,0.0005574084,0.00036731124,0.011838315],"genre_scores_gemma":[0.9358749,0.00029135053,0.052340258,0.00006482552,0.000038049402,0.0002294141,0.00026304138,0.00006498287,0.010833217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994287,0.00021026871,0.00002103087,0.00012578681,0.000074225754,0.00013989588],"domain_scores_gemma":[0.99911183,0.00045494924,0.0001359895,0.00004294225,0.00014535284,0.00010895159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011984748,0.0014082474,0.0019353293,0.001012153,0.0006878102,0.0019424055,0.003433865,0.0031530496,0.006163668],"category_scores_gemma":[0.0023001605,0.0011479077,0.0011544506,0.0017159268,0.0011186374,0.0015865285,0.00164154,0.0012311818,0.0007440697],"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.000016322645,0.000009019433,0.00006729346,0.000011634782,0.0000082113775,0.000025137097,0.0000059587464,0.99747,0.00011760186,0.0010374815,0.00009357948,0.0011378505],"study_design_scores_gemma":[0.0000063661105,0.000015266321,0.0000332727,0.0000016848946,0.0000049137975,0.0000037546658,0.0000041919693,0.9993456,0.000028862287,0.0004972483,0.000056172237,0.0000026619362],"about_ca_topic_score_codex":0.014714277,"about_ca_topic_score_gemma":0.009929052,"teacher_disagreement_score":0.014714277,"about_ca_system_score_codex":0.0016921833,"about_ca_system_score_gemma":0.0016050547,"threshold_uncertainty_score":0.029257238},"labels":[],"label_agreement":null},{"id":"W2742664076","doi":"10.1007/s10479-017-2601-5","title":"Solving the capacitated clustering problem with variable neighborhood search","year":2017,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":41,"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; Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja","keywords":"Variable neighborhood search; Heuristics; Benchmark (surveying); Mathematical optimization; Cluster analysis; Heuristic; Iterated local search; Variable (mathematics); Mathematics; Iterated function; Computer science; Metaheuristic; Artificial intelligence","score_opus":0.18524376840212,"score_gpt":0.41619169996105954,"score_spread":0.23094793155893953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742664076","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.05194481,0.00061238755,0.93955696,0.0005486099,0.0000826601,0.00008635583,0.000113459144,0.0001850705,0.0068696844],"genre_scores_gemma":[0.6309938,0.00043890966,0.35591844,0.00017793557,0.00011851945,0.00032953135,0.00041093997,0.00021140305,0.011400475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993278,0.0003159522,0.000023495937,0.00014258068,0.0001076387,0.000082582665],"domain_scores_gemma":[0.99808717,0.0014249634,0.00012896684,0.000092293165,0.00018457815,0.00008206705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013876515,0.00092182047,0.0016991147,0.0011708775,0.0007313689,0.0012647875,0.002675323,0.0023977333,0.0036188029],"category_scores_gemma":[0.004664523,0.0009322837,0.001003621,0.0018044079,0.000823099,0.0017329562,0.0013879336,0.0013909288,0.00038747556],"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.0000449489,0.00004518641,0.0002605208,0.000049220038,0.00003593406,0.000022695944,0.00002624363,0.9756739,0.00018745937,0.009393851,0.0011797943,0.01308021],"study_design_scores_gemma":[0.0000058427627,0.000008578269,0.000029708835,0.0000026192151,0.0000028390043,0.0000050541994,0.000007756801,0.9957353,0.00004957485,0.0040046563,0.00014584594,0.000002233643],"about_ca_topic_score_codex":0.011958286,"about_ca_topic_score_gemma":0.009971196,"teacher_disagreement_score":0.011958286,"about_ca_system_score_codex":0.0013663294,"about_ca_system_score_gemma":0.0018295681,"threshold_uncertainty_score":0.023777366},"labels":[],"label_agreement":null},{"id":"W2763920787","doi":"10.1007/s10479-015-2019-x","title":"Simulation optimization: a review of algorithms and applications","year":2015,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":444,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dow Chemical (Canada)","funders":"Dow Chemical Company","keywords":"Theory of computation; Homogeneous; Function (biology); Subject (documents); Algebraic number; Optimization problem","score_opus":0.7149842999777986,"score_gpt":0.6440607833342126,"score_spread":0.07092351664358598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2763920787","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008953915,0.76705503,0.21595988,0.0024119182,0.0008423273,0.00005735046,0.00019076806,0.00031205371,0.012275307],"genre_scores_gemma":[0.02033265,0.8716387,0.10175528,0.0006145169,0.0019373624,0.00015115054,0.0003603351,0.00017960856,0.0030303556],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982122,0.00063741667,0.00021102343,0.00023533756,0.0006340243,0.00007005104],"domain_scores_gemma":[0.9959615,0.0031649473,0.0001401365,0.00017466085,0.0004930448,0.00006574752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023577004,0.0020608883,0.0026943,0.002508868,0.00057447044,0.002667831,0.0020718223,0.0020575644,0.0054917764],"category_scores_gemma":[0.0058558146,0.0009024036,0.001799412,0.006692245,0.0016722869,0.0029482576,0.0015070079,0.003048206,0.002550813],"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.000076584874,0.0001348082,0.00061493414,0.007307369,0.0002031767,0.00008784435,0.0001173967,0.11237485,0.00060926774,0.18158127,0.031717595,0.66517484],"study_design_scores_gemma":[0.000043601027,0.00017255581,0.0008204737,0.0039860974,0.00013603075,0.00053489284,0.00012367446,0.15146227,0.001000697,0.2662337,0.5753658,0.00012021421],"about_ca_topic_score_codex":0.003332959,"about_ca_topic_score_gemma":0.0018324648,"teacher_disagreement_score":0.0054917764,"about_ca_system_score_codex":0.0016357665,"about_ca_system_score_gemma":0.0020071284,"threshold_uncertainty_score":0.01837176},"labels":[],"label_agreement":null},{"id":"W2786412505","doi":"10.1007/s10479-018-2767-5","title":"Preface: Risk management decisions and wealth management in Financial Economics","year":2018,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Insurance and Financial Risk Management","field":"Economics, Econometrics and Finance","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":"HEC Montréal","funders":"Agence Nationale de la Recherche","keywords":"Theory of computation; Economics; Business management; Risk management; Finance; Business; Computer science; Business administration","score_opus":0.17091186050506654,"score_gpt":0.38945663443982764,"score_spread":0.2185447739347611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786412505","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007363433,0.066782646,0.0077294763,0.11823798,0.7347213,0.00012089845,0.0020320632,0.0002496742,0.069389574],"genre_scores_gemma":[0.01192147,0.051915303,0.0025869098,0.029710654,0.7127929,0.0001828235,0.0019278352,0.00059859874,0.18836355],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99921167,0.00020399179,0.000085470834,0.00015383342,0.0002947525,0.000050189396],"domain_scores_gemma":[0.9879269,0.005104387,0.0004075322,0.00060269894,0.004769977,0.0011885464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016162398,0.001869987,0.0014486263,0.004107235,0.0024515078,0.00383268,0.0015063486,0.00274178,0.06745483],"category_scores_gemma":[0.017099697,0.0004420537,0.000928856,0.0043742615,0.00109847,0.00418927,0.00165412,0.008842589,0.038842406],"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.0000076156452,0.000017525652,0.000054416316,0.00011831841,0.0000027972692,0.00003251625,0.000042338066,0.00015155453,0.000058067293,0.004328153,0.9837046,0.011482128],"study_design_scores_gemma":[0.000015115291,0.00004667102,0.0014533919,0.0006891908,0.000010613527,0.00012363966,0.00016006769,0.000460424,0.0001223836,0.025471304,0.971422,0.000025185363],"about_ca_topic_score_codex":0.0048513496,"about_ca_topic_score_gemma":0.005554061,"teacher_disagreement_score":0.06745483,"about_ca_system_score_codex":0.0023866165,"about_ca_system_score_gemma":0.0018610735,"threshold_uncertainty_score":0.2256589},"labels":[],"label_agreement":null},{"id":"W2787207162","doi":"10.1007/s10479-018-2792-4","title":"Computation of the corrected Cornish–Fisher expansion using the response surface methodology: application to VaR and CVaR","year":2018,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":23,"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é Laval","funders":"Fonds de Recherche du Québec-Société et Culture; Université Laval","keywords":"Quantile; Kurtosis; CVAR; Skewness; Econometrics; Value at risk; Mathematics; Computation; Moment (physics); Taylor series; Portfolio; Risk management; Expected shortfall; Statistics; Economics; Algorithm; Mathematical analysis","score_opus":0.6406208474316435,"score_gpt":0.6007372589748402,"score_spread":0.03988358845680329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787207162","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.0174705,0.00013399901,0.98078054,0.00013377734,0.000048209702,0.000018134137,0.000036753947,0.00040463926,0.0009735317],"genre_scores_gemma":[0.44301453,0.0002638523,0.55090576,0.00011467524,0.00008567942,0.000116972806,0.00028703676,0.0006355345,0.004575897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918526,0.0004045596,0.00004205625,0.00009397124,0.00022694861,0.000047282403],"domain_scores_gemma":[0.99445397,0.004004321,0.00019780507,0.00038139563,0.0008790695,0.00008340681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002886589,0.0006226206,0.00083496614,0.0010802859,0.0003444144,0.0009151546,0.00092473085,0.0011315629,0.0039978605],"category_scores_gemma":[0.014915427,0.0003862924,0.0007390312,0.00089893193,0.00052367983,0.0011917832,0.00077473326,0.0014138293,0.0007637736],"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.00015492439,0.00008790127,0.001481461,0.00015585442,0.00007207457,0.0001371277,0.000090961374,0.7700477,0.006837495,0.05359367,0.002542682,0.16479814],"study_design_scores_gemma":[0.000003943151,0.000011696047,0.0002568526,0.0000058197134,0.0000036982683,0.0000173843,0.000006902017,0.9938571,0.000801803,0.0045908936,0.00043522596,0.000008664313],"about_ca_topic_score_codex":0.0032712251,"about_ca_topic_score_gemma":0.0031304355,"teacher_disagreement_score":0.0039978605,"about_ca_system_score_codex":0.00039441805,"about_ca_system_score_gemma":0.001491535,"threshold_uncertainty_score":0.015265942},"labels":[],"label_agreement":null},{"id":"W2788911476","doi":"10.1007/s10479-018-2761-y","title":"Mixed-asset portfolio allocation under mean-reverting asset returns","year":2018,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","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":"Université Laval","funders":"Agence Nationale de la Recherche","keywords":"Mean reversion; Portfolio; Asset allocation; Asset (computer security); Stochastic investment model; Theory of computation; Capital asset pricing model; Economics; Computer science; Econometrics; Financial economics; Algorithm","score_opus":0.3366580378507829,"score_gpt":0.4153375755108499,"score_spread":0.07867953766006697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788911476","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.09730742,0.0006467853,0.89927655,0.0003594525,0.000068849506,0.00005596993,0.00006901484,0.00013890883,0.00207711],"genre_scores_gemma":[0.90848744,0.00073780713,0.0843594,0.00010763826,0.00016749141,0.00015292996,0.00016988404,0.00008503332,0.005732348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974476,0.0014735351,0.00014461656,0.0003517017,0.00036808735,0.00021446239],"domain_scores_gemma":[0.9901177,0.006992966,0.0010222245,0.0006376104,0.000799908,0.0004295697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060462067,0.0011869774,0.0021566758,0.0009584671,0.0002610325,0.0033544367,0.0017027874,0.0016800737,0.002586489],"category_scores_gemma":[0.021588333,0.0009338733,0.0009903027,0.0009520707,0.0010714057,0.0049053356,0.0016392003,0.0012780909,0.000478857],"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.0005228419,0.00018340528,0.0025773433,0.00021690536,0.00044717197,0.00023068985,0.0000868202,0.71525353,0.0035869153,0.22259215,0.0011828798,0.053119346],"study_design_scores_gemma":[0.00003448137,0.00007711527,0.00044542344,0.000010632964,0.000037639296,0.000055876688,0.000009288389,0.93266976,0.0005128433,0.06593509,0.00019856062,0.000013253928],"about_ca_topic_score_codex":0.0003993486,"about_ca_topic_score_gemma":0.00032802275,"teacher_disagreement_score":0.0060462067,"about_ca_system_score_codex":0.0008649127,"about_ca_system_score_gemma":0.0009587475,"threshold_uncertainty_score":0.031975746},"labels":[],"label_agreement":null},{"id":"W2796045805","doi":"10.1007/s10479-018-2830-2","title":"A clustering-based feature selection method for automatically generated relational attributes","year":2018,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":10,"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":"Computer science; Data mining; Cluster analysis; Feature selection; Selection (genetic algorithm); Set (abstract data type); Table (database); Relational database; Lasso (programming language); Machine learning; Artificial intelligence","score_opus":0.26245056220044977,"score_gpt":0.4869737738800862,"score_spread":0.22452321167963646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796045805","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.015002637,0.00022339476,0.98139405,0.000077203316,0.000071288036,0.000115326104,0.0003076078,0.002409633,0.00039887027],"genre_scores_gemma":[0.12849583,0.00013890398,0.8671352,0.00007441329,0.00008438526,0.00023454998,0.0017033134,0.00022313035,0.0019102641],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891365,0.00014113291,0.000089210625,0.00028291062,0.00048109074,0.00009199956],"domain_scores_gemma":[0.9986204,0.00048289128,0.00007420096,0.00017619072,0.00059236557,0.00005396469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011622793,0.00079324364,0.0014258003,0.002747703,0.00077991886,0.000985989,0.0017475146,0.00073052564,0.0020241318],"category_scores_gemma":[0.002892718,0.0003512656,0.0010894072,0.002717949,0.00028677014,0.00087478396,0.00081211625,0.0009381393,0.0011428001],"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.00029151913,0.00024941302,0.0015972193,0.00010949047,0.0001345793,0.00014428311,0.00007960984,0.013024841,0.036885228,0.0021070563,0.008951373,0.9364254],"study_design_scores_gemma":[0.00010260078,0.0001760032,0.0048593516,0.000022683565,0.00012639444,0.0005391124,0.00007962867,0.9507919,0.032350212,0.0044322778,0.0064392253,0.00008057053],"about_ca_topic_score_codex":0.003329954,"about_ca_topic_score_gemma":0.0056332615,"teacher_disagreement_score":0.003329954,"about_ca_system_score_codex":0.00042595546,"about_ca_system_score_gemma":0.0010597021,"threshold_uncertainty_score":0.0067714453},"labels":[],"label_agreement":null},{"id":"W2806849789","doi":"10.1007/s10479-018-2915-y","title":"On a 2-class polling model with reneging and $$k_i$$ k i -limited service","year":2018,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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":"University of Waterloo","funders":"","keywords":"Polling; Polling system; Computer science; Service (business); Queue; Poisson distribution; Class (philosophy); Queueing theory; Mathematical optimization; Computer network; Mathematics; Statistics; Economics","score_opus":0.17696072489331402,"score_gpt":0.40529354322275973,"score_spread":0.2283328183294457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806849789","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.3365806,0.0035463746,0.60474056,0.009007239,0.0012466714,0.00033939737,0.0014555771,0.0011242316,0.041959334],"genre_scores_gemma":[0.95847654,0.0010412803,0.010058819,0.00059251767,0.00041407856,0.00012890379,0.00031946073,0.00017657362,0.028791707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973295,0.00076119916,0.000072027964,0.00047384252,0.00029650496,0.001066928],"domain_scores_gemma":[0.9931377,0.0044811396,0.00071614754,0.00030555335,0.0006499669,0.0007095214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035696677,0.002090532,0.0045151305,0.0016515463,0.0023974127,0.005129717,0.005217556,0.005672699,0.011217983],"category_scores_gemma":[0.008719142,0.0017235359,0.0025554239,0.0023481145,0.003413121,0.0052725486,0.002758551,0.004848802,0.0011761065],"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.0003579161,0.00016578884,0.00083312206,0.00010406302,0.00007011109,0.0004414179,0.00019359605,0.87677264,0.0008156515,0.111698255,0.0043645273,0.0041829073],"study_design_scores_gemma":[0.00003766511,0.000022050279,0.000121803816,0.000008234136,0.00002513902,0.000030050043,0.0000320342,0.98512936,0.000048281483,0.014246558,0.00027651878,0.000022288297],"about_ca_topic_score_codex":0.04394499,"about_ca_topic_score_gemma":0.022670463,"teacher_disagreement_score":0.04394499,"about_ca_system_score_codex":0.0060424255,"about_ca_system_score_gemma":0.0034318797,"threshold_uncertainty_score":0.08737838},"labels":[],"label_agreement":null},{"id":"W2809417058","doi":"10.1007/s10479-018-2942-8","title":"Reduced cost-based variable fixing in two-stage stochastic programming","year":2018,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Transport Canada","funders":"","keywords":"Mathematical optimization; Stochastic programming; Theory of computation; Variable (mathematics); Heuristic; Set (abstract data type); Random variable; Range (aeronautics); Integer programming; Computer science; Reduction (mathematics); Measure (data warehouse); Mathematics; Linear programming; Algorithm; Statistics","score_opus":0.4932199997891655,"score_gpt":0.5907253176075067,"score_spread":0.09750531781834121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809417058","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.021350313,0.00027823052,0.97517073,0.0002784049,0.00007029559,0.00007525666,0.0000552306,0.00011185024,0.0026097153],"genre_scores_gemma":[0.6834694,0.0005397419,0.30547953,0.00019344097,0.00017604519,0.0005184881,0.00026219315,0.0002844084,0.009076729],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99609524,0.0025739474,0.000103116436,0.00029036676,0.00053925114,0.00039817058],"domain_scores_gemma":[0.98941666,0.008810063,0.00041209295,0.00043883405,0.00064109144,0.00028130316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076090912,0.0018038591,0.0037790718,0.0014247822,0.0007543259,0.0022084739,0.0033431358,0.0030958357,0.0037485373],"category_scores_gemma":[0.017062327,0.0020318243,0.002262651,0.0014986707,0.0020863127,0.0025903818,0.0028964214,0.003851875,0.00030360807],"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.00008184849,0.00006204394,0.00016101461,0.00006756523,0.00004708975,0.00004066528,0.000028225775,0.97204,0.00035430075,0.01980122,0.00045397118,0.006862014],"study_design_scores_gemma":[0.000010862407,0.000024950072,0.000041849667,0.0000053839217,0.000010509929,0.0000047371777,0.0000029254043,0.99355304,0.00010142529,0.006143143,0.00009517989,0.000006149458],"about_ca_topic_score_codex":0.005748085,"about_ca_topic_score_gemma":0.0042025074,"teacher_disagreement_score":0.0076090912,"about_ca_system_score_codex":0.0021138017,"about_ca_system_score_gemma":0.0023298797,"threshold_uncertainty_score":0.04024118},"labels":[],"label_agreement":null},{"id":"W2810632803","doi":"10.1007/s10479-018-2941-9","title":"Closed-form variance swap prices under general affine GARCH models and their continuous-time limits","year":2018,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Financial Risk and Volatility Modeling","field":"Economics, Econometrics and Finance","cited_by":42,"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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Variance swap; Autoregressive conditional heteroskedasticity; Mathematics; Gaussian; Econometrics; Stochastic volatility; Affine transformation; Variance (accounting); Applied mathematics; Volatility (finance); Economics; Forward volatility","score_opus":0.2830431286606594,"score_gpt":0.3861320112043833,"score_spread":0.10308888254372389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810632803","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.18253553,0.0027186354,0.8018947,0.0014153875,0.0001789324,0.000058439357,0.00029876825,0.00046725897,0.010432418],"genre_scores_gemma":[0.9634001,0.0019344334,0.025229102,0.00018699003,0.00025602418,0.000114734576,0.00038210335,0.00017889978,0.008317618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977609,0.00083573675,0.00014718802,0.00047449188,0.00043948033,0.0003422048],"domain_scores_gemma":[0.97908086,0.01543217,0.0023315763,0.000872222,0.0016384206,0.0006446535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006822323,0.0013831392,0.0024258129,0.001722013,0.000689217,0.00524458,0.0024943443,0.0031598152,0.0054258574],"category_scores_gemma":[0.038272273,0.0014336447,0.0019430214,0.0021897117,0.00369705,0.010986809,0.0022930533,0.0038183266,0.00069796125],"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.00014633652,0.00014230002,0.0018296305,0.00025428177,0.00013988253,0.0005515672,0.00037258808,0.30145508,0.0015094223,0.6745693,0.001939,0.017090581],"study_design_scores_gemma":[0.00001727832,0.000025932068,0.00050504814,0.000025606883,0.000030918185,0.00015204799,0.00004896586,0.6958856,0.00028624004,0.30266687,0.00031944888,0.000036016572],"about_ca_topic_score_codex":0.0017036119,"about_ca_topic_score_gemma":0.0013016379,"teacher_disagreement_score":0.006822323,"about_ca_system_score_codex":0.0014353225,"about_ca_system_score_gemma":0.0019348937,"threshold_uncertainty_score":0.0360803},"labels":[],"label_agreement":null},{"id":"W2896429187","doi":"10.1007/s10479-018-3077-7","title":"Sustainability dimensions and PM2.5 in supply chain logistics","year":2018,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","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":"Concordia University","funders":"","keywords":"Sustainability; Work (physics); Sustainable transport; Supply chain; Environmental economics; Computer science; Dimension (graph theory); Operations research; Business; Economics; Engineering; Marketing","score_opus":0.13017586529140718,"score_gpt":0.40978408613083617,"score_spread":0.279608220839429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896429187","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.9769414,0.0016137228,0.0023547034,0.0010426779,0.000048626865,0.000019510333,0.00019940663,0.0000082099405,0.017771786],"genre_scores_gemma":[0.99879104,0.00026891002,0.0003150101,0.00002713368,0.000026949676,0.00000557187,0.000074744654,0.00000266331,0.00048799772],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99942696,0.00024179915,0.00003542578,0.000059516115,0.0001555224,0.000080896374],"domain_scores_gemma":[0.99729127,0.001305638,0.0006338823,0.00007737324,0.0004668505,0.00022493041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096450077,0.00028224496,0.000136058,0.0013427198,0.0005245986,0.0020141725,0.0002776993,0.0005281599,0.0024762906],"category_scores_gemma":[0.0032334635,0.00017280571,0.0003211477,0.0025241564,0.0008897726,0.0015648499,0.001072812,0.000605644,0.00016803891],"study_design_candidate":"observational","study_design_consensus":"observational","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.00037047392,0.00024061813,0.88712513,0.00017424593,0.00015808575,0.00029648855,0.0029479084,0.012900516,0.0019355989,0.040705,0.0019574992,0.051188536],"study_design_scores_gemma":[0.0000074257196,0.0001184445,0.93848115,0.00014444992,0.000054033437,0.00013307083,0.0076983836,0.011147257,0.0010877246,0.033752967,0.007329391,0.00004571392],"about_ca_topic_score_codex":0.0112288315,"about_ca_topic_score_gemma":0.0117212515,"teacher_disagreement_score":0.0112288315,"about_ca_system_score_codex":0.0018175418,"about_ca_system_score_gemma":0.00078365003,"threshold_uncertainty_score":0.022326946},"labels":[],"label_agreement":null},{"id":"W2896479483","doi":"10.1007/s10479-018-3076-8","title":"Shared mobility systems: an updated survey","year":2018,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":128,"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","funders":"","keywords":"TRIPS architecture; Variety (cybernetics); Field (mathematics); Computer science; Point (geometry); Operations research; Transport engineering; Data science; Telecommunications; Management science; Engineering","score_opus":0.3362647373297932,"score_gpt":0.4692835955316023,"score_spread":0.13301885820180914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896479483","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31415898,0.5656246,0.018122597,0.029002067,0.0015850529,0.00013845549,0.021512795,0.0002211716,0.049634345],"genre_scores_gemma":[0.47426552,0.49828967,0.0050354726,0.0033443773,0.0011303765,0.000091874914,0.01227759,0.0000806064,0.0054844907],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983903,0.00026616908,0.00026289176,0.00030483914,0.0005924604,0.0001833204],"domain_scores_gemma":[0.98511755,0.008191567,0.002067182,0.0008294686,0.0031419292,0.00065221323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002299177,0.00040559022,0.0005691102,0.004277008,0.0003632554,0.0026197012,0.0008264293,0.00078017934,0.0074729132],"category_scores_gemma":[0.014434665,0.00032793146,0.00058330264,0.01028383,0.00062742335,0.00791432,0.0012744095,0.0014500722,0.0011525946],"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.00021787408,0.00027875582,0.1482811,0.0023165364,0.00023952781,0.000096687305,0.0008178413,0.0023577528,0.0002924394,0.013369942,0.08032449,0.75140697],"study_design_scores_gemma":[0.00004075908,0.0004932258,0.35159183,0.0034463876,0.00039852943,0.0018772024,0.00480318,0.0034880869,0.00061374286,0.012799875,0.6203377,0.00010947328],"about_ca_topic_score_codex":0.007954345,"about_ca_topic_score_gemma":0.009340041,"teacher_disagreement_score":0.007954345,"about_ca_system_score_codex":0.0011547959,"about_ca_system_score_gemma":0.0020119136,"threshold_uncertainty_score":0.02499932},"labels":[],"label_agreement":null},{"id":"W2911134757","doi":"10.1007/s10479-020-03517-8","title":"On fairness and diversification in WTA and ATP tennis tournaments generation","year":2020,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Sports Analytics and Performance","field":"Economics, Econometrics and Finance","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":"Polytechnique Montréal","funders":"","keywords":"Tournament; Diversification (marketing strategy); Cluster analysis; Theory of computation; Order (exchange); Limiting; Solver","score_opus":0.4936605848398045,"score_gpt":0.40150367765372835,"score_spread":0.09215690718607616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911134757","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.8393662,0.0021643995,0.12198855,0.0043229964,0.0002820686,0.00013431144,0.0005183506,0.000105055224,0.031118162],"genre_scores_gemma":[0.9922563,0.0001953338,0.002342217,0.0001553292,0.00007634922,0.000022463675,0.00008395683,0.000015347117,0.0048528644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99731797,0.0014131896,0.00009636412,0.00041246155,0.0002172699,0.0005427305],"domain_scores_gemma":[0.9571231,0.033132553,0.0029890363,0.0019198093,0.0017296228,0.0031058819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010805316,0.00056700537,0.0020169385,0.001380617,0.0016645066,0.0030638317,0.0015601744,0.0019062463,0.01137597],"category_scores_gemma":[0.046330146,0.00041579135,0.0011857004,0.0011224375,0.0031677673,0.0034528084,0.0026669416,0.0028687296,0.00040364984],"study_design_candidate":"observational","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.0009302377,0.00024039012,0.045113478,0.000120739554,0.0002049734,0.00032330616,0.0011458073,0.16011706,0.00065689144,0.7359198,0.0069589475,0.04826843],"study_design_scores_gemma":[0.00007420405,0.00019155929,0.014461377,0.000072779294,0.000076439894,0.00013302817,0.0010631495,0.24772315,0.00026986585,0.73347676,0.0024012967,0.00005640303],"about_ca_topic_score_codex":0.00806463,"about_ca_topic_score_gemma":0.0077391295,"teacher_disagreement_score":0.01137597,"about_ca_system_score_codex":0.0020708425,"about_ca_system_score_gemma":0.0017884722,"threshold_uncertainty_score":0.0571447},"labels":[],"label_agreement":null},{"id":"W2914910073","doi":"10.1007/s10479-018-3122-6","title":"Improving the computational efficiency of stochastic programs using automated algorithm configuration: an application to decentralized energy systems","year":2019,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":3,"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; University of British Columbia Hospital","funders":"Compute Canada","keywords":"Theory of computation; Computer science; Mathematical optimization; Computational complexity theory; Energy (signal processing); Integer (computer science); Scale (ratio); Stack (abstract data type); Photovoltaic system; Algorithm; Mathematics","score_opus":0.08685261222821998,"score_gpt":0.41343236826343277,"score_spread":0.3265797560352128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914910073","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.17034435,0.00019297839,0.8216363,0.000490623,0.00007639241,0.00011157288,0.000074507865,0.0014986127,0.0055745197],"genre_scores_gemma":[0.805054,0.00007304864,0.1935587,0.000054641765,0.000035947385,0.00014243794,0.00006096322,0.00014180376,0.00087839464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814785,0.0011102868,0.000063560095,0.00018486983,0.00035418468,0.00013926323],"domain_scores_gemma":[0.9856996,0.011499107,0.0005952078,0.0010904025,0.0009332005,0.00018255172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029945967,0.00091385713,0.0013473912,0.0007206533,0.0009183117,0.0013061134,0.0013430646,0.0012002233,0.002535678],"category_scores_gemma":[0.016303977,0.0005281684,0.00051695673,0.0011568707,0.00096653786,0.0015578037,0.0012342299,0.0016414985,0.00026709394],"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.00012810652,0.00013833663,0.00043450855,0.00002706642,0.000015488855,0.00003230806,0.000032743967,0.9585628,0.0006202437,0.00631466,0.0004933963,0.03320044],"study_design_scores_gemma":[0.000018608525,0.000018151302,0.000041154188,0.0000014094725,0.0000024428634,0.0000036795036,0.00000363674,0.9977679,0.00023359238,0.0018456337,0.000061395695,0.0000023405619],"about_ca_topic_score_codex":0.0069676777,"about_ca_topic_score_gemma":0.0069042663,"teacher_disagreement_score":0.0069676777,"about_ca_system_score_codex":0.0011468536,"about_ca_system_score_gemma":0.0023843844,"threshold_uncertainty_score":0.015837133},"labels":[],"label_agreement":null},{"id":"W2937788857","doi":"10.1007/s10479-019-03197-z","title":"Preface: reliability and quality management in stochastic systems","year":2019,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":32,"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":"Computer science; Theory of computation; Robustness (evolution); Reliability (semiconductor); Operations research; Quality (philosophy); Annals; Task (project management); Risk analysis (engineering); Systems engineering; Engineering","score_opus":0.12200030967543281,"score_gpt":0.407875745290656,"score_spread":0.2858754356152232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2937788857","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000893706,0.05439571,0.017119631,0.082549796,0.7965455,0.00010885999,0.0012675585,0.00030364984,0.04681548],"genre_scores_gemma":[0.018433737,0.04529979,0.0044643213,0.019114112,0.7722335,0.0001653644,0.0014326356,0.0006230956,0.13823354],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998841,0.00029700476,0.0001291317,0.00023092117,0.0004442526,0.000057819772],"domain_scores_gemma":[0.9846219,0.006137446,0.00045306032,0.0007634118,0.006908984,0.0011152682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022094492,0.0022526146,0.0015611834,0.003797878,0.002257597,0.0031803695,0.0016308748,0.0029055302,0.041890394],"category_scores_gemma":[0.02041253,0.00055145274,0.0011640027,0.003678196,0.0011310009,0.0034063011,0.0013106025,0.008440976,0.020396061],"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.000017566215,0.00003132156,0.000080116304,0.00020427417,0.000008717529,0.00006383738,0.000044932516,0.0008691365,0.00017837017,0.007812791,0.97092676,0.019762252],"study_design_scores_gemma":[0.000026468726,0.000118742755,0.0020190687,0.0006864162,0.000027717275,0.0002217347,0.0001321745,0.0030882014,0.00039591492,0.04046929,0.9527585,0.00005570698],"about_ca_topic_score_codex":0.005744598,"about_ca_topic_score_gemma":0.0051194504,"teacher_disagreement_score":0.041890394,"about_ca_system_score_codex":0.002650537,"about_ca_system_score_gemma":0.0018719736,"threshold_uncertainty_score":0.14013731},"labels":[],"label_agreement":null},{"id":"W2943717539","doi":"10.1007/s10479-019-03243-w","title":"Preface: DEA and its applications in operations and data analytics","year":2019,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Forecasting Techniques and Applications","field":"Decision Sciences","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Theory of computation; Computer science; Analytics; Data analysis; Data science; Operations research; Econometrics; Data mining; Algorithm; Mathematics","score_opus":0.730479985523337,"score_gpt":0.6177284169091471,"score_spread":0.11275156861418989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943717539","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011197908,0.046229836,0.07055703,0.07971741,0.7140653,0.0002612926,0.0038583116,0.0010608506,0.08313015],"genre_scores_gemma":[0.02144959,0.05185748,0.03078043,0.025471253,0.51739633,0.00052526343,0.0055138455,0.0023795732,0.34462634],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988772,0.00030784632,0.000113656824,0.0002079378,0.00044373854,0.000049533992],"domain_scores_gemma":[0.982774,0.0051516877,0.0005762789,0.0012157409,0.009255849,0.0010263559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002600359,0.00177218,0.0010433348,0.0034466542,0.0018182652,0.0033850572,0.0012524656,0.0018231926,0.059559625],"category_scores_gemma":[0.023899417,0.0004483767,0.00074984046,0.004051741,0.0008160135,0.00358816,0.0013925286,0.006696605,0.049739197],"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.000013931752,0.000018991957,0.00006386191,0.00011563191,0.0000041146186,0.00003135469,0.000028590597,0.00042602103,0.00015954253,0.006878894,0.948758,0.04350107],"study_design_scores_gemma":[0.0000075590224,0.000039357932,0.0007278091,0.0003264691,0.000008132044,0.00013890705,0.00006905694,0.0018773623,0.00028331147,0.019495912,0.97699326,0.000032854285],"about_ca_topic_score_codex":0.0047240825,"about_ca_topic_score_gemma":0.0044928635,"teacher_disagreement_score":0.059559625,"about_ca_system_score_codex":0.0019971023,"about_ca_system_score_gemma":0.0017576665,"threshold_uncertainty_score":0.19924682},"labels":[],"label_agreement":null},{"id":"W2951140915","doi":"10.1007/s10479-019-03296-x","title":"A bi-criteria optimization model for medical device sterilization","year":2019,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Wilfrid Laurier University; University of Ottawa","funders":"","keywords":"Mathematical optimization; Sterilization (economics); Theory of computation; Scheduling (production processes); Computer science; Bottleneck; Job shop scheduling; Integer programming; Linear programming; Pareto principle; Algorithm; Mathematics; Schedule; Embedded system","score_opus":0.1807393677163225,"score_gpt":0.4466198620249063,"score_spread":0.26588049430858374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951140915","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.04457858,0.001379946,0.93439317,0.0020135643,0.0003083263,0.00032219177,0.000951782,0.00035921158,0.015693167],"genre_scores_gemma":[0.8798066,0.0013164094,0.08829945,0.00036257785,0.00014156838,0.0009570152,0.00078444794,0.00017250284,0.028159406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980635,0.00092106994,0.00007803199,0.0002893401,0.0003663508,0.00028170992],"domain_scores_gemma":[0.9973591,0.0017003784,0.00025318936,0.00008208339,0.0003573966,0.00024772648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003309488,0.0021947892,0.0035555016,0.001537483,0.0010387492,0.003753762,0.0034042154,0.0052326377,0.008726749],"category_scores_gemma":[0.0055379686,0.0017824059,0.0016195932,0.0022536833,0.0015256425,0.0019184686,0.0020866622,0.0033285695,0.0012120156],"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.000035854137,0.000035617588,0.00008244506,0.00003493215,0.000020905896,0.000034559034,0.000012918894,0.99283993,0.00016732431,0.0046768766,0.00035384254,0.0017048095],"study_design_scores_gemma":[0.00000981573,0.000018455836,0.000046459867,0.000004076276,0.000006255022,0.000004781059,0.0000048592224,0.9981406,0.00003226638,0.0015656059,0.00016193339,0.0000049653554],"about_ca_topic_score_codex":0.022766331,"about_ca_topic_score_gemma":0.009773289,"teacher_disagreement_score":0.022766331,"about_ca_system_score_codex":0.0030345975,"about_ca_system_score_gemma":0.0032392517,"threshold_uncertainty_score":0.04526764},"labels":[],"label_agreement":null},{"id":"W2955649334","doi":"10.1007/s10479-019-03295-y","title":"Goal programming approach for political districting in Santa Catarina State: Brazil","year":2019,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Mathematical Programming","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":"Transport Canada","funders":"","keywords":"Contiguity; Legislation; Redistricting; Politics; Context (archaeology); Population; State (computer science); Distribution (mathematics); Public administration; Operations research; Computer science; Political science; Economics; Sociology; Geography; Mathematics; Law; Demography","score_opus":0.11756106179337812,"score_gpt":0.42744367272472567,"score_spread":0.30988261093134756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955649334","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.7902243,0.0009249787,0.102638796,0.0048799855,0.00008833487,0.00034053775,0.0014115717,0.00012354569,0.09936793],"genre_scores_gemma":[0.9851481,0.00018597215,0.010929341,0.000034240715,0.000009403972,0.000043206448,0.0001554183,0.000017653096,0.0034766712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992424,0.0004301958,0.000021469417,0.00008328995,0.000049780214,0.00017284797],"domain_scores_gemma":[0.999382,0.000349399,0.000063507374,0.00002983331,0.00009595886,0.000079272926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009771098,0.00026717238,0.00050016446,0.0009025696,0.001350214,0.003107064,0.00081702915,0.0007468637,0.0032309745],"category_scores_gemma":[0.0028633522,0.0002568734,0.0006040803,0.0015575999,0.0006502117,0.0008117429,0.0009874635,0.0006899833,0.00012269108],"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.000087095425,0.0001631383,0.016394943,0.00018663345,0.00010843988,0.00050263945,0.0016431884,0.4312298,0.00047285657,0.5051786,0.005178168,0.03885457],"study_design_scores_gemma":[0.000041462114,0.000079032696,0.01702736,0.00017427592,0.00010360048,0.00013818056,0.007916724,0.7940691,0.0004993777,0.157362,0.02254995,0.00003893048],"about_ca_topic_score_codex":0.15521695,"about_ca_topic_score_gemma":0.32374328,"teacher_disagreement_score":0.15521695,"about_ca_system_score_codex":0.00498528,"about_ca_system_score_gemma":0.006800671,"threshold_uncertainty_score":0.30862695},"labels":[],"label_agreement":null},{"id":"W2963239290","doi":"10.1007/s10479-019-03343-7","title":"Biologically Inspired Parent Selection in Genetic Algorithms","year":2019,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Quality control and genetic algorithms; Genetic algorithm; Selection (genetic algorithm); Computer science; Genetic representation; Theory of computation; Algorithm; Mathematical optimization; Simple (philosophy); Artificial intelligence; Meta-optimization; Mathematics; Machine learning","score_opus":0.23378032836205606,"score_gpt":0.45118896427990646,"score_spread":0.2174086359178504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963239290","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.018847164,0.010509723,0.95464253,0.0011002127,0.00060962595,0.000044832283,0.000033459844,0.0001284052,0.014084032],"genre_scores_gemma":[0.532904,0.010238583,0.44518152,0.00040960385,0.0006395418,0.00017261872,0.0000923057,0.00015076733,0.010211121],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991497,0.00050988584,0.000022808019,0.00006481049,0.0002215461,0.00003134327],"domain_scores_gemma":[0.99873716,0.0009092168,0.00008163371,0.00009330992,0.00015590822,0.000022678681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015178337,0.00040430087,0.000592567,0.00060385413,0.00045095308,0.0013602005,0.0010712398,0.0016327688,0.0018536142],"category_scores_gemma":[0.0057929177,0.00036947918,0.00031950715,0.0013206896,0.001473228,0.0014010833,0.00061059115,0.0015580263,0.0004247182],"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.00005579044,0.00006022412,0.000940874,0.0002651555,0.00007062284,0.0001300077,0.0002343987,0.5013291,0.0039043175,0.33188248,0.0032245796,0.1579024],"study_design_scores_gemma":[0.000029959112,0.00006553765,0.00043009527,0.000089381705,0.00003479065,0.00011305815,0.00004604145,0.8065207,0.0014493328,0.18076979,0.010433007,0.000018312783],"about_ca_topic_score_codex":0.0014160494,"about_ca_topic_score_gemma":0.0012980192,"teacher_disagreement_score":0.0018536142,"about_ca_system_score_codex":0.00071746,"about_ca_system_score_gemma":0.00068986067,"threshold_uncertainty_score":0.008027136},"labels":[],"label_agreement":null},{"id":"W2964355227","doi":"10.1007/s10479-019-03342-8","title":"Combined maintenance and routing optimization for large-scale sewage cleaning","year":2019,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Infrastructure Maintenance and Monitoring","field":"Engineering","cited_by":21,"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":"HEC Montréal","keywords":"Sewerage; Scheduling (production processes); Computer science; Sanitary sewer; Routing (electronic design automation); Population; Flood myth; Operations research; Environmental science; Engineering; Operations management; Environmental engineering","score_opus":0.045520989528172115,"score_gpt":0.34967770830667694,"score_spread":0.3041567187785048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964355227","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.2852244,0.0013596024,0.7008296,0.00089303363,0.00024446356,0.0002203186,0.0005742843,0.0012817564,0.009372565],"genre_scores_gemma":[0.95820516,0.00014573085,0.038183957,0.000052592597,0.000041128333,0.000090416645,0.00018358075,0.000083285704,0.0030141252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995484,0.000165377,0.000015961123,0.000084629835,0.00007088628,0.0001147314],"domain_scores_gemma":[0.9990287,0.0006375254,0.000089943824,0.000067993074,0.00011516141,0.000060752798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095129997,0.0012799028,0.0018340119,0.00082440797,0.0006603241,0.0011571506,0.0013583668,0.0017479423,0.0034439038],"category_scores_gemma":[0.002016696,0.0009185904,0.0010939128,0.0009137509,0.0005293064,0.0012561465,0.0009117133,0.00079717045,0.00024872975],"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.000050675677,0.00004551198,0.00020011756,0.000023177641,0.000022656866,0.000014874458,0.0000068318736,0.98936707,0.0005121231,0.00025873215,0.00037261212,0.009125564],"study_design_scores_gemma":[0.00000981858,0.000038572394,0.0001634864,0.0000012853786,0.000011041443,0.000004677627,0.000008210798,0.9991848,0.00014072417,0.0003458117,0.000089294685,0.0000023050372],"about_ca_topic_score_codex":0.010338086,"about_ca_topic_score_gemma":0.010269232,"teacher_disagreement_score":0.010338086,"about_ca_system_score_codex":0.0010719278,"about_ca_system_score_gemma":0.0015680835,"threshold_uncertainty_score":0.020555854},"labels":[],"label_agreement":null},{"id":"W2979460476","doi":"10.1007/s10479-019-03411-y","title":"Number of performance measures versus number of decision making units in DEA","year":2019,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Data envelopment analysis; Efficiency; Power (physics); Rank (graph theory); Theory of computation; Computer science; Rule of thumb; Statistics; Quality (philosophy); Mathematical optimization; Unit (ring theory); Econometrics; Mathematics; Algorithm","score_opus":0.4701715564610774,"score_gpt":0.5709311294462142,"score_spread":0.10075957298513677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979460476","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.6664348,0.00082039303,0.32463744,0.0002636771,0.00013776425,0.00036674048,0.0004534012,0.00028556617,0.006600155],"genre_scores_gemma":[0.8503219,0.0001507242,0.14753772,0.000035497764,0.000040325405,0.0003785731,0.00025746174,0.000032945736,0.0012448619],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9825067,0.0108463755,0.0016394266,0.0012366847,0.003000794,0.00077002693],"domain_scores_gemma":[0.8742169,0.105631724,0.004915383,0.008243589,0.0061161555,0.0008762631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015976587,0.0007962943,0.0018350013,0.0015536819,0.0006247614,0.0022392992,0.0012164923,0.00084473897,0.002490257],"category_scores_gemma":[0.06799472,0.00041659296,0.001220908,0.0026844675,0.00081949343,0.0032908688,0.0013459059,0.0016175276,0.000355018],"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.0053136824,0.0015609644,0.043884546,0.00052733143,0.0006546789,0.00016066365,0.00035406413,0.5312495,0.0072449185,0.026915153,0.0007790068,0.38135546],"study_design_scores_gemma":[0.0001780398,0.0022302028,0.037547972,0.000101010475,0.00033961303,0.00029827148,0.00044302508,0.91780967,0.016887546,0.021726763,0.002335325,0.000102605554],"about_ca_topic_score_codex":0.0012806271,"about_ca_topic_score_gemma":0.0013135549,"teacher_disagreement_score":0.015976587,"about_ca_system_score_codex":0.0017159798,"about_ca_system_score_gemma":0.0015300739,"threshold_uncertainty_score":0.08449328},"labels":[],"label_agreement":null},{"id":"W2979848724","doi":"10.1007/s10479-019-03371-3","title":"Joint maintenance and just-in-time spare parts provisioning policy for a multi-unit production system","year":2019,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":22,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spare part; Production (economics); Computer science; Reliability engineering; Interval (graph theory); Provisioning; Process (computing); Sensitivity (control systems); Holding cost; Theory of computation; Minification; Operations research; Total cost; Mathematical optimization; Operations management; Engineering; Mathematics; Economics; Algorithm","score_opus":0.1834285068207878,"score_gpt":0.4011294589257651,"score_spread":0.21770095210497734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979848724","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.7291849,0.0011374861,0.26157728,0.0014279529,0.0001856538,0.00026646245,0.0004858917,0.0005908648,0.0051435023],"genre_scores_gemma":[0.9944999,0.00007775923,0.0045651672,0.000021207143,0.000026909107,0.00001958241,0.000050829836,0.0000125806555,0.00072602887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998565,0.00039580447,0.000084582774,0.00027281453,0.00019939886,0.00048238147],"domain_scores_gemma":[0.9964365,0.001687731,0.00070553983,0.00022122427,0.00050229335,0.00044665908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025161826,0.0010854825,0.0022591378,0.0009190619,0.0008129656,0.0015648132,0.002228326,0.0017075002,0.0027156363],"category_scores_gemma":[0.003749966,0.00076105125,0.0006311607,0.00081610173,0.00088740024,0.001724964,0.000996896,0.0009875359,0.0002661714],"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.0009634744,0.00015567671,0.0010332718,0.00013190004,0.000060331822,0.0002756867,0.00006124078,0.977517,0.0046467464,0.003108553,0.0012053467,0.010840876],"study_design_scores_gemma":[0.000023629258,0.00011353222,0.00075173273,0.0000046149685,0.000025944386,0.00004841769,0.000025270258,0.9974815,0.000385703,0.0010597778,0.00007079964,0.00000914989],"about_ca_topic_score_codex":0.005099163,"about_ca_topic_score_gemma":0.0041884026,"teacher_disagreement_score":0.005099163,"about_ca_system_score_codex":0.0014633441,"about_ca_system_score_gemma":0.0016925265,"threshold_uncertainty_score":0.013306975},"labels":[],"label_agreement":null},{"id":"W2982442037","doi":"10.1007/s10479-019-03439-0","title":"Measuring short-term risk of initial public offering of equity securities: a hybrid Bayesian and Data-Envelopment-Analysis-based approach","year":2019,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","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":"Equity (law); Data envelopment analysis; Term (time); Bayesian probability; Theory of computation; Econometrics; Computer science; Actuarial science; Business; Financial economics; Economics; Mathematics; Statistics; Algorithm; Artificial intelligence","score_opus":0.6435510354886637,"score_gpt":0.5586636561304721,"score_spread":0.08488737935819157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982442037","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.25676674,0.0004391927,0.741275,0.00017085545,0.00001263018,0.000067028726,0.00015464207,0.00010413273,0.0010097512],"genre_scores_gemma":[0.944354,0.00025024594,0.054801922,0.000018245153,0.000010836939,0.00005102137,0.00020471962,0.00002641099,0.00028253972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966748,0.0014817779,0.0002865244,0.0002909344,0.0010564878,0.00020939237],"domain_scores_gemma":[0.9878379,0.009023413,0.0013323098,0.00056300865,0.0010563986,0.00018688691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008221831,0.00097226875,0.001918412,0.0031232075,0.00040700295,0.0024002027,0.0008262041,0.0013447315,0.00064942613],"category_scores_gemma":[0.018003779,0.0006949615,0.0017597149,0.0024900436,0.00070102705,0.0028822126,0.0012811304,0.0010999563,0.00011717962],"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.00014633057,0.00015800919,0.009956733,0.00009879537,0.00016345258,0.000045643166,0.0000697141,0.9455105,0.0041292934,0.010733186,0.00012729615,0.028861035],"study_design_scores_gemma":[0.000004177515,0.00002976076,0.0021140282,0.000008958131,0.000017667746,0.00001251429,0.000015842252,0.99321175,0.0014420181,0.0030536316,0.00007315085,0.000016530446],"about_ca_topic_score_codex":0.0067772255,"about_ca_topic_score_gemma":0.0035565272,"teacher_disagreement_score":0.008221831,"about_ca_system_score_codex":0.0019398152,"about_ca_system_score_gemma":0.0026798372,"threshold_uncertainty_score":0.043481767},"labels":[],"label_agreement":null},{"id":"W2984997159","doi":"10.1007/s10479-019-03456-z","title":"A novel fuzzy reference-neighborhood rough set approach for green supplier development practices","year":2019,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"Theory of computation; Computer science; Fuzzy logic; Set (abstract data type); Rough set; Fuzzy set; Development (topology); Operations research; Mathematical optimization; Data mining; Artificial intelligence; Mathematics; Algorithm","score_opus":0.4492385413761365,"score_gpt":0.4634509594129097,"score_spread":0.0142124180367732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984997159","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.017387027,0.00038588254,0.9784725,0.0001906566,0.00004668188,0.00006563153,0.000076249366,0.00012351201,0.0032519368],"genre_scores_gemma":[0.58403957,0.0005949322,0.41212088,0.00006240692,0.00006814036,0.00019252975,0.00020115137,0.000039914798,0.0026804188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756587,0.0007414605,0.00014128028,0.00037435605,0.0010535886,0.00012342303],"domain_scores_gemma":[0.99894613,0.0003848104,0.000121575125,0.00013427436,0.00037014284,0.000043099473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017147331,0.0005677663,0.0013061458,0.0024356537,0.0009554323,0.002209052,0.0022694848,0.0010306083,0.0016775717],"category_scores_gemma":[0.0043074177,0.0003564636,0.0016121469,0.0025903904,0.0006595561,0.002806967,0.0012092803,0.00074433954,0.00027906455],"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.00017169805,0.0002436684,0.0031996819,0.0003969507,0.00027283895,0.00035733517,0.00093497534,0.47882977,0.004353134,0.20579225,0.004367372,0.30108032],"study_design_scores_gemma":[0.000008743583,0.00006092057,0.00076089264,0.000026287658,0.00004898374,0.000063670675,0.00014245794,0.9674764,0.00066856586,0.028402489,0.0023039065,0.000036680096],"about_ca_topic_score_codex":0.008502005,"about_ca_topic_score_gemma":0.007902184,"teacher_disagreement_score":0.008502005,"about_ca_system_score_codex":0.0019247275,"about_ca_system_score_gemma":0.0018272253,"threshold_uncertainty_score":0.01690501},"labels":[],"label_agreement":null},{"id":"W2989473899","doi":"10.1007/s10479-019-03437-2","title":"Designing an efficient blood supply chain network in crisis: neural learning, optimization and case study","year":2019,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Blood donation and transfusion practices","field":"Business, Management and Accounting","cited_by":103,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Supply chain; Process (computing); Business; Blood collection; Operations management; Health care; Computer science; Operations research; Medicine; Medical emergency; Economics; Economic growth; Engineering; Marketing","score_opus":0.10846076419759984,"score_gpt":0.3876371638371688,"score_spread":0.279176399639569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989473899","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.62469673,0.00050950836,0.36527818,0.00095109217,0.00005589031,0.0003517365,0.00016733028,0.00042833673,0.0075611984],"genre_scores_gemma":[0.9544231,0.0001023833,0.043824885,0.000041833857,0.000010046869,0.00009051613,0.00006406189,0.000019842913,0.0014232922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970895,0.00013641223,0.0000133283565,0.000052385363,0.000029166913,0.000059655897],"domain_scores_gemma":[0.99817896,0.0013715564,0.00008456807,0.00004966297,0.00023734104,0.000077828365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013311418,0.00091671274,0.00060318626,0.00055689935,0.00066152186,0.0009564957,0.00075460266,0.0022781608,0.0021617028],"category_scores_gemma":[0.0027782645,0.0006162164,0.0003944882,0.00042436793,0.0005381071,0.0013941693,0.00066595775,0.0009908006,0.00017247713],"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.000121728015,0.00010069179,0.0008811118,0.00004697614,0.000012702361,0.00009954327,0.00003354132,0.9864335,0.0007292844,0.00060993555,0.00022793593,0.010702937],"study_design_scores_gemma":[0.000007518649,0.00003882211,0.00006864809,0.0000020368,0.0000046588193,0.0000065119075,0.000021833333,0.9991709,0.00035072264,0.00027709253,0.000049457347,0.0000017158644],"about_ca_topic_score_codex":0.010747703,"about_ca_topic_score_gemma":0.008293736,"teacher_disagreement_score":0.010747703,"about_ca_system_score_codex":0.0012180535,"about_ca_system_score_gemma":0.0011085005,"threshold_uncertainty_score":0.021370292},"labels":[],"label_agreement":null},{"id":"W2989983753","doi":"10.1007/s10479-019-03465-y","title":"Certify or not? An analysis of organic food supply chain with competing suppliers","year":2019,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":29,"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":"Government of Jiangsu Province; National Natural Science Foundation of China","keywords":"Business; Certification; Supply chain; Purchasing; Dilemma; Product (mathematics); Profit (economics); Marketing; Organic certification; Organic product; Quality (philosophy); Industrial organization; Commerce; Organic farming; Microeconomics; Economics","score_opus":0.16621436024384248,"score_gpt":0.37173020917607386,"score_spread":0.20551584893223138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989983753","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.9892855,0.00021478585,0.0018828409,0.00032891723,0.000009513533,0.00008651087,0.00029497393,0.000014698945,0.007882052],"genre_scores_gemma":[0.9963815,0.00009419587,0.0012740192,0.000028907469,0.000007518466,0.000019017758,0.00031167385,0.000006034555,0.0018772226],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768054,0.0010191597,0.00008838233,0.0001807617,0.00054750236,0.00048369425],"domain_scores_gemma":[0.95857525,0.033222686,0.0022340089,0.000481869,0.004062169,0.0014240163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054983515,0.00036912184,0.0005106939,0.003920538,0.0019969589,0.0034723536,0.0011060534,0.0010377434,0.010736328],"category_scores_gemma":[0.014900792,0.00034883048,0.00084395974,0.0051070913,0.0012445404,0.0030828873,0.0016187462,0.0009636084,0.00054745475],"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.0029985614,0.0010623992,0.728497,0.00045916266,0.0004616738,0.004775873,0.0043591196,0.13305326,0.0024500962,0.046738327,0.0036135027,0.07153107],"study_design_scores_gemma":[0.0002556314,0.0025202283,0.31552947,0.00025714282,0.00071314856,0.0012201925,0.05794557,0.5795981,0.0030164104,0.03114003,0.0076006385,0.00020339925],"about_ca_topic_score_codex":0.03793613,"about_ca_topic_score_gemma":0.033199556,"teacher_disagreement_score":0.03793613,"about_ca_system_score_codex":0.0037358357,"about_ca_system_score_gemma":0.003412857,"threshold_uncertainty_score":0.07543063},"labels":[],"label_agreement":null},{"id":"W3013428274","doi":"10.1007/s10479-020-03582-z","title":"Brexit and foreign exchange market expectations: Could it have been predicted?","year":2020,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Market Dynamics and Volatility","field":"Economics, Econometrics and Finance","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 Guelph","funders":"","keywords":"Brexit; Economics; Foreign exchange market; Currency; Skewness; Econometrics; Exchange rate; Volatility (finance); Foreign exchange; Financial economics; Monetary economics; International economics; European union","score_opus":0.299972120852087,"score_gpt":0.3923003954867154,"score_spread":0.0923282746346284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013428274","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.93583333,0.0056792074,0.0130742835,0.02715246,0.001174786,0.000021868434,0.00038251255,0.000097415614,0.016584061],"genre_scores_gemma":[0.99483347,0.001371677,0.0004005219,0.00042504043,0.0002608613,0.0000047133235,0.00011941552,0.000011795097,0.0025725334],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99967587,0.00009771237,0.000023871344,0.00007569127,0.00005346425,0.00007340575],"domain_scores_gemma":[0.99494886,0.0027355715,0.0012250707,0.00024837485,0.0005598618,0.00028220404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002163079,0.00054849935,0.00078071444,0.00048755962,0.0003446052,0.003371387,0.000824512,0.002029962,0.0071693095],"category_scores_gemma":[0.019413851,0.00039952376,0.00052399066,0.0004935765,0.0015192457,0.005181871,0.00064646633,0.0029226616,0.0008462379],"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.006067641,0.00081681006,0.34021655,0.0005440129,0.00050032104,0.0020390654,0.0017360358,0.18200493,0.0029697919,0.32495898,0.015373555,0.122772396],"study_design_scores_gemma":[0.0003060992,0.0007784302,0.138952,0.00030501667,0.00019873818,0.0005620662,0.0015316628,0.41474453,0.0026070604,0.43041086,0.009352384,0.0002511007],"about_ca_topic_score_codex":0.004753959,"about_ca_topic_score_gemma":0.0022264926,"teacher_disagreement_score":0.0071693095,"about_ca_system_score_codex":0.0009437528,"about_ca_system_score_gemma":0.00064372574,"threshold_uncertainty_score":0.023983717},"labels":[],"label_agreement":null},{"id":"W3014313361","doi":"10.1007/s10479-020-03589-6","title":"Preface: advances of real-case based operations research","year":2020,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Quality and Supply Management","field":"Business, Management and Accounting","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":"Dalhousie University","funders":"","keywords":"Theory of computation; Computer science; Management science; Operations research; Mathematics; Algorithm; Economics","score_opus":0.4674967474093574,"score_gpt":0.5018092103358104,"score_spread":0.03431246292645296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014313361","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015787254,0.1535,0.048224106,0.05538113,0.6788879,0.00037263875,0.0022724806,0.00077384524,0.059009098],"genre_scores_gemma":[0.028810011,0.1672097,0.049185257,0.02133667,0.5717125,0.00045406472,0.0057528033,0.00090350397,0.15463547],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982723,0.00052477495,0.0002310381,0.0002473331,0.00067438686,0.000050152536],"domain_scores_gemma":[0.9797514,0.0070727034,0.00057636795,0.0017374938,0.009887147,0.00097477017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058942167,0.0012319244,0.00090846926,0.0038565176,0.0013257717,0.003976717,0.0019682157,0.002181206,0.043567576],"category_scores_gemma":[0.02579141,0.0003242652,0.0006567862,0.0041787266,0.0012383313,0.0050062924,0.0016702669,0.0044298186,0.020007135],"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.000040835803,0.000056072335,0.00017797468,0.0007866242,0.0000116516185,0.000099876655,0.00012193888,0.0005167286,0.00044244932,0.011901613,0.845698,0.1401463],"study_design_scores_gemma":[0.000012760532,0.00007622688,0.0014267485,0.00070581364,0.000015201285,0.00028573922,0.00015658844,0.0010645512,0.0002624044,0.017887022,0.97807205,0.00003495034],"about_ca_topic_score_codex":0.0023869902,"about_ca_topic_score_gemma":0.0019633782,"teacher_disagreement_score":0.043567576,"about_ca_system_score_codex":0.0017613473,"about_ca_system_score_gemma":0.0018223788,"threshold_uncertainty_score":0.14574802},"labels":[],"label_agreement":null},{"id":"W3016514782","doi":"10.1007/s10479-020-03612-w","title":"Assessing the performance of Canadian credit unions using a three-stage network bootstrap DEA","year":2020,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Laurentian University","funders":"","keywords":"Data envelopment analysis; Intermediation; Revenue; Production (economics); Economics; Bootstrapping (finance); Business; Finance; Microeconomics; Statistics","score_opus":0.7285265786464573,"score_gpt":0.5723947053950232,"score_spread":0.15613187325143407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016514782","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.9137868,0.00030286802,0.07907158,0.00033622183,0.000022559298,0.0002446127,0.0007027951,0.000115297735,0.005417186],"genre_scores_gemma":[0.9789044,0.000064841464,0.019252224,0.000034489367,0.0000084771455,0.00008773485,0.0006522501,0.00001246163,0.0009830706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938002,0.00252172,0.00022405713,0.000671473,0.0016884059,0.0010941026],"domain_scores_gemma":[0.9679754,0.022258403,0.0012846349,0.0015639135,0.006392211,0.0005253796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016439732,0.00076936773,0.0014551377,0.0018733009,0.0017698937,0.0017698633,0.0022814742,0.0013858937,0.0017556137],"category_scores_gemma":[0.05012848,0.00037329388,0.0008386544,0.0027312303,0.00090411113,0.0012119989,0.0011502195,0.0013114392,0.00021146152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007613941,0.00035048922,0.09376016,0.000105626066,0.00028541323,0.00008468648,0.00029837713,0.8245332,0.0010374022,0.01068386,0.001345473,0.066754036],"study_design_scores_gemma":[0.000029501283,0.000117923235,0.03563609,0.000014302588,0.000045077188,0.000012438314,0.00023614119,0.9606029,0.00079462427,0.0018574882,0.00062730326,0.000026277574],"about_ca_topic_score_codex":0.69777143,"about_ca_topic_score_gemma":0.604688,"teacher_disagreement_score":0.30222857,"about_ca_system_score_codex":0.011848503,"about_ca_system_score_gemma":0.014653213,"threshold_uncertainty_score":0.60801685},"labels":[],"label_agreement":null},{"id":"W3029114129","doi":"10.1007/s10479-020-03642-4","title":"The distributionally robust optimization model for a remanufacturing system under cap-and-trade policy: a newsvendor approach","year":2020,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Taishan Scholar Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Newsvendor model; Remanufacturing; Theory of computation; Robust optimization; Computer science; Mathematical optimization; Operations research; Business; Mathematics; Supply chain; Algorithm; Manufacturing engineering; Engineering","score_opus":0.21145288266930098,"score_gpt":0.35855572599865837,"score_spread":0.14710284332935739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029114129","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.08111436,0.003195236,0.85836023,0.015026715,0.00054835045,0.00027228074,0.0017908136,0.00059096515,0.03910112],"genre_scores_gemma":[0.90706766,0.002294592,0.029083628,0.00091193995,0.00044609947,0.00028495,0.0006125839,0.00035596572,0.05894256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970415,0.0013965847,0.00012365522,0.0006376283,0.00032434717,0.0004762319],"domain_scores_gemma":[0.99119484,0.0062152855,0.0011465247,0.00024932608,0.000788839,0.0004052007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006314074,0.002511147,0.005650307,0.0021506432,0.0011738898,0.0053078406,0.003912318,0.008267448,0.008611057],"category_scores_gemma":[0.0149161,0.0026947637,0.002491348,0.001916139,0.0040005287,0.005570086,0.0033695642,0.0050839214,0.0010122509],"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.00007466932,0.000054084474,0.00019531755,0.00009965252,0.0000797547,0.00018748088,0.000055617475,0.9146768,0.00043072968,0.07973266,0.0019671407,0.002446029],"study_design_scores_gemma":[0.00002465094,0.000033981785,0.00012891901,0.0000130648,0.000029301926,0.00002506341,0.000031579104,0.96816385,0.00010013745,0.030907055,0.00051195885,0.00003046558],"about_ca_topic_score_codex":0.017204462,"about_ca_topic_score_gemma":0.0080559915,"teacher_disagreement_score":0.017204462,"about_ca_system_score_codex":0.004954707,"about_ca_system_score_gemma":0.0035330632,"threshold_uncertainty_score":0.03594911},"labels":[],"label_agreement":null},{"id":"W3034123046","doi":"10.1007/s10479-020-03667-9","title":"A new inverse DEA cost efficiency model for estimating potential merger gains: a case of Canadian banks","year":2020,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Data envelopment analysis; Restructuring; Cost efficiency; Mergers and acquisitions; Efficiency; Industrial organization; Inverse; Computer science; Economics; Econometrics; Operational efficiency; Operations research; Mathematical optimization; Finance; Mathematics; Statistics","score_opus":0.6036382136610892,"score_gpt":0.5492192108670334,"score_spread":0.05441900279405576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034123046","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.15777822,0.0004310511,0.82454026,0.0012265318,0.00003819664,0.0001743781,0.00049376866,0.00019261258,0.015125024],"genre_scores_gemma":[0.89321625,0.0003520407,0.094721705,0.00010990498,0.000025437532,0.00013776681,0.00036102845,0.00006002886,0.011015812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989255,0.0003600958,0.000045587298,0.00017572746,0.00025555617,0.0002374846],"domain_scores_gemma":[0.9963464,0.002531656,0.00020493688,0.00015520147,0.0006881493,0.000073632684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003476514,0.0009861346,0.0013037085,0.0017203047,0.0011390906,0.0034529443,0.0022184374,0.0018349629,0.0031616404],"category_scores_gemma":[0.008452633,0.00079113827,0.0010763858,0.0020380858,0.0011376999,0.0017270033,0.00094581634,0.0020715462,0.00023636398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029136814,0.00003237629,0.001283737,0.000021340198,0.000020304667,0.00005878461,0.000052897245,0.9707884,0.0003138639,0.017872388,0.00042706885,0.009099703],"study_design_scores_gemma":[0.0000031645345,0.0000051354987,0.00040628665,0.000003237035,0.000008720654,0.000009838998,0.000020336178,0.99698824,0.00007917799,0.002194733,0.0002746162,0.0000066300536],"about_ca_topic_score_codex":0.48291466,"about_ca_topic_score_gemma":0.3551969,"teacher_disagreement_score":0.5170853,"about_ca_system_score_codex":0.010008333,"about_ca_system_score_gemma":0.007305862,"threshold_uncertainty_score":0.9602076},"labels":[],"label_agreement":null},{"id":"W3039575466","doi":"10.1007/s10479-020-03708-3","title":"Sustainable supply chain for disaster management: structural dynamics and disruptive risks","year":2020,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Supply Chain Resilience and Risk Management","field":"Business, Management and Accounting","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Supply chain; Supply chain risk management; Business; Emergency management; Interoperability; Supply chain management; Information sharing; Risk analysis (engineering); Risk management; Process management; System dynamics; Industrial organization; Service management; Computer science; Economics; Marketing; Finance; Economic growth","score_opus":0.14020661080637978,"score_gpt":0.40821713718630587,"score_spread":0.26801052637992606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039575466","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.3845508,0.039848536,0.28352764,0.092516385,0.0022442704,0.0001712646,0.0005988226,0.00027714044,0.1962651],"genre_scores_gemma":[0.9736667,0.011049846,0.0072919247,0.00027181813,0.00034382372,0.000025682939,0.00005805119,0.000018719033,0.007273402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995945,0.00014606255,0.00001747807,0.0000381544,0.00014576851,0.000058048605],"domain_scores_gemma":[0.99832505,0.0007456542,0.00030286043,0.0000945267,0.0003738757,0.0001579791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011227112,0.00036128185,0.00023807658,0.0011901265,0.0012566491,0.004840048,0.00040591703,0.0015121354,0.007362856],"category_scores_gemma":[0.0030976906,0.0001922011,0.0002491413,0.0025688647,0.0021183619,0.004272239,0.0011085923,0.0011785524,0.000312206],"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.00004574026,0.00007327824,0.00646706,0.00024899602,0.000048189493,0.0003176133,0.0006518046,0.076933436,0.001342072,0.8389176,0.009896521,0.06505772],"study_design_scores_gemma":[0.000007503172,0.000074667216,0.0034766558,0.00032731454,0.00003328927,0.00019085534,0.0038431853,0.08631979,0.0007592436,0.8556249,0.049293835,0.00004876844],"about_ca_topic_score_codex":0.0062741493,"about_ca_topic_score_gemma":0.009034646,"teacher_disagreement_score":0.007362856,"about_ca_system_score_codex":0.0032624323,"about_ca_system_score_gemma":0.005195213,"threshold_uncertainty_score":0.024631143},"labels":[],"label_agreement":null},{"id":"W3039783047","doi":"10.1007/s10479-020-03699-1","title":"Managing rail-truck intermodal transportation for hazardous materials with random yard disruptions","year":2020,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Risk and Safety Analysis","field":"Decision Sciences","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Truck; Flow network; Hazardous waste; Contingency plan; Transport engineering; Computer science; Operations research; Reliability (semiconductor); Robustness (evolution); Yard; Interdependence; Engineering; Computer security","score_opus":0.40497733431133587,"score_gpt":0.5167435438435632,"score_spread":0.11176620953222738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039783047","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.83637565,0.00016162446,0.15402535,0.00045653622,0.000046983307,0.0004569668,0.00019087108,0.00048980425,0.007796249],"genre_scores_gemma":[0.9833945,0.00005032578,0.01439691,0.000018022774,0.000008688233,0.000052456748,0.000079403355,0.000036827383,0.0019628254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987367,0.00036853514,0.000050575043,0.00026452134,0.00021349375,0.00036616638],"domain_scores_gemma":[0.99782676,0.0010264535,0.0004571076,0.00016372962,0.00023855896,0.00028725827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002319592,0.0008173987,0.0008646894,0.0010196661,0.0015165363,0.0027948872,0.0019419444,0.0016898247,0.003173642],"category_scores_gemma":[0.0054978635,0.00081561814,0.00081373635,0.0010711097,0.00066824333,0.002393174,0.0013845209,0.0009957108,0.0004967909],"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.00039807157,0.00036633134,0.008804413,0.00004997569,0.00012167586,0.0006921931,0.00020011564,0.94694424,0.0065001566,0.0032538727,0.0012117347,0.031457175],"study_design_scores_gemma":[0.00002314427,0.00031451523,0.003156991,0.0000073332094,0.00006147842,0.00011324882,0.000639524,0.9902857,0.0018244684,0.0028495397,0.0007011823,0.000022938419],"about_ca_topic_score_codex":0.011993103,"about_ca_topic_score_gemma":0.015251578,"teacher_disagreement_score":0.011993103,"about_ca_system_score_codex":0.0023498947,"about_ca_system_score_gemma":0.0028441902,"threshold_uncertainty_score":0.023846626},"labels":[],"label_agreement":null},{"id":"W3042514062","doi":"10.1007/s10479-020-03721-6","title":"A new branch-and-cut approach for the generalized regenerator location problem","year":2020,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Optical Network Technologies","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":"University of Windsor","funders":"National Natural Science Foundation of China","keywords":"Regenerative heat exchanger; Theory of computation; Benchmark (surveying); Set (abstract data type); Node (physics); Computer science; Integer programming; Mathematical optimization; Path (computing); Network planning and design; Integer (computer science); Mathematics; Algorithm; Computer network; Engineering","score_opus":0.18910986534815194,"score_gpt":0.38546336022224637,"score_spread":0.19635349487409443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042514062","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.002495313,0.0004322451,0.9904647,0.00034378193,0.00013219718,0.000110103414,0.00016294094,0.00011386714,0.00574486],"genre_scores_gemma":[0.099759184,0.0013260011,0.8772583,0.0003782254,0.0004929782,0.0006467022,0.0007810428,0.0003729725,0.01898451],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985524,0.0005807456,0.000051667143,0.00028900514,0.00037478056,0.00015145638],"domain_scores_gemma":[0.99796665,0.0014351071,0.00009647997,0.000119104705,0.00026365326,0.000119077675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020182175,0.0025445882,0.0035379569,0.0023392164,0.0011045034,0.0029775584,0.0043697385,0.0039913096,0.016610157],"category_scores_gemma":[0.0052006077,0.0015066385,0.0018740579,0.002946202,0.0014248176,0.0040142606,0.0027178468,0.004197422,0.001994351],"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.00014303549,0.00022600949,0.00024984448,0.000416714,0.000110130786,0.0002493087,0.00010568624,0.74473196,0.0016305818,0.1324469,0.017403489,0.102286346],"study_design_scores_gemma":[0.000035307738,0.000039121183,0.00004630138,0.00002730065,0.000021948093,0.00005890882,0.000022444441,0.932277,0.00020330239,0.06406499,0.0031913875,0.000012003909],"about_ca_topic_score_codex":0.0031162703,"about_ca_topic_score_gemma":0.003907846,"teacher_disagreement_score":0.016610157,"about_ca_system_score_codex":0.0017445933,"about_ca_system_score_gemma":0.0019376398,"threshold_uncertainty_score":0.05556649},"labels":[],"label_agreement":null},{"id":"W3046951078","doi":"10.1007/s10479-020-03743-0","title":"Optimal scheduling of airport ferry vehicles based on capacity network","year":2020,"lang":"en","type":"article","venue":"Annals of Operations Research","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":"University of Victoria; Fisheries and Oceans Canada","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Integer programming; Computer science; Scheduling (production processes); Operations research; Linear programming; Flow network; Mathematical optimization; Engineering; Mathematics; Algorithm","score_opus":0.2884538788196349,"score_gpt":0.4198422238996973,"score_spread":0.13138834508006236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046951078","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.2594032,0.00073207816,0.7186135,0.00069813826,0.0003601448,0.0002517546,0.00042569143,0.00044058939,0.019074993],"genre_scores_gemma":[0.9496009,0.00022123307,0.044833906,0.000045595938,0.00007331531,0.000076484255,0.0001883596,0.00008141008,0.0048787603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941766,0.0002312957,0.0000127711,0.00010330174,0.000064697924,0.00017034127],"domain_scores_gemma":[0.9990771,0.00055210607,0.00011100362,0.00003812665,0.00010529816,0.00011641735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077286846,0.0009509175,0.0013705897,0.0010086189,0.0007142111,0.0011793919,0.0012923589,0.0008946927,0.0036215186],"category_scores_gemma":[0.0021793654,0.000612587,0.00055755983,0.0010372229,0.0006224995,0.0011996975,0.00057510595,0.00072529836,0.0002093309],"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.00007630104,0.000022965049,0.00011453444,0.000019998653,0.000009993869,0.000018498517,0.000013574109,0.9899058,0.00059225725,0.004213214,0.0005404387,0.004472351],"study_design_scores_gemma":[0.000005202709,0.000016792708,0.00006544122,0.0000019361837,0.0000037112898,0.0000029035361,0.000007972714,0.9978064,0.00012085574,0.001807027,0.00015912236,0.0000027513681],"about_ca_topic_score_codex":0.018622778,"about_ca_topic_score_gemma":0.012560802,"teacher_disagreement_score":0.018622778,"about_ca_system_score_codex":0.0024429753,"about_ca_system_score_gemma":0.0016824219,"threshold_uncertainty_score":0.03702879},"labels":[],"label_agreement":null},{"id":"W3088183368","doi":"10.1007/s10479-020-03786-3","title":"Preface: multiple criteria decision making for sustainable decisions","year":2020,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Sustainable Development and Environmental Policy","field":"Environmental 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é du Québec à Rimouski; Centre intégré de santé et de services sociaux de Chaudière-Appalaches; University of Ottawa; Wilfrid Laurier University","funders":"","keywords":"Theory of computation; Management science; Computer science; Operations research; Mathematics; Economics; Algorithm","score_opus":0.20654371739490027,"score_gpt":0.4540070326966883,"score_spread":0.24746331530178803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088183368","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062173035,0.05396139,0.046076033,0.11539628,0.7012882,0.0002534643,0.0013389004,0.00033354957,0.08073039],"genre_scores_gemma":[0.022346783,0.060400765,0.026308155,0.040284384,0.5745975,0.00061109866,0.0018996901,0.0011308765,0.2724208],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985556,0.0005427444,0.0001499913,0.00021327619,0.00047709703,0.000061230305],"domain_scores_gemma":[0.98544127,0.006204966,0.000298438,0.0006581613,0.0067872694,0.00061000837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032233081,0.0019904182,0.0013309929,0.002468037,0.0025351148,0.0033629362,0.0019989412,0.0036073597,0.04658072],"category_scores_gemma":[0.019081451,0.00052090315,0.0010820904,0.0030191692,0.0015786369,0.003712228,0.0013563146,0.009535762,0.024893165],"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.000013235679,0.000025247838,0.000026336253,0.00020790394,0.000005295663,0.00003975135,0.000037408667,0.0005809361,0.00010556073,0.008574456,0.9692048,0.021178992],"study_design_scores_gemma":[0.000014901959,0.000050941057,0.0005621549,0.0006502676,0.000013500559,0.000117860865,0.00012704312,0.0020676807,0.0002528343,0.050786175,0.94531906,0.000037696223],"about_ca_topic_score_codex":0.0076760342,"about_ca_topic_score_gemma":0.005918008,"teacher_disagreement_score":0.04658072,"about_ca_system_score_codex":0.0029813785,"about_ca_system_score_gemma":0.0025697127,"threshold_uncertainty_score":0.15582806},"labels":[],"label_agreement":null},{"id":"W3090423329","doi":"10.1007/s10479-022-04771-8","title":"Malmquist productivity indices and plant capacity utilisation: new proposals and empirical application","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":16,"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":"Xi’an Jiaotong-Liverpool University","keywords":"Bootstrapping (finance); Productivity; Econometrics; Index (typography); Malmquist index; Rank (graph theory); Economics; Spearman's rank correlation coefficient; Mathematics; Statistics; Total factor productivity; Computer science; Economic growth","score_opus":0.5926169263538534,"score_gpt":0.55466085896995,"score_spread":0.03795606738390345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090423329","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.12226458,0.016365973,0.8125809,0.0038456093,0.00025711162,0.00014064151,0.0008784307,0.0002299502,0.043436933],"genre_scores_gemma":[0.79588974,0.008114722,0.18656603,0.00025138786,0.00078866706,0.00030486385,0.0007199427,0.00013858154,0.0072260993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99445134,0.0023094895,0.00034379197,0.0006649902,0.0019812712,0.00024907922],"domain_scores_gemma":[0.9506762,0.03839629,0.004337131,0.002900965,0.0032797728,0.00040969273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013896628,0.0015615961,0.0018068057,0.00837149,0.0010562364,0.007569482,0.002496539,0.0021919478,0.0053930576],"category_scores_gemma":[0.067283146,0.0006905648,0.0013790473,0.012365887,0.0042105564,0.013079547,0.0018611266,0.0034766593,0.00068281323],"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.00012203927,0.00014769824,0.025874764,0.00029587763,0.00012349975,0.00009930262,0.0007296461,0.07292967,0.00064162514,0.72532636,0.0031456477,0.17056394],"study_design_scores_gemma":[0.000023336857,0.00007967125,0.016712837,0.00027519432,0.000054937125,0.00018762882,0.0005912776,0.25385162,0.0012068638,0.71577775,0.0111356545,0.000103254584],"about_ca_topic_score_codex":0.0030144532,"about_ca_topic_score_gemma":0.0029886174,"teacher_disagreement_score":0.013896628,"about_ca_system_score_codex":0.0036951834,"about_ca_system_score_gemma":0.002302844,"threshold_uncertainty_score":0.0734933},"labels":[],"label_agreement":null},{"id":"W3092059796","doi":"10.1007/s10479-020-03804-4","title":"Early box office prediction in China’s film market based on a stacking fusion model","year":2020,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Cinema and Media Studies","field":"Economics, Econometrics and Finance","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":"Wilfrid Laurier University","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Gradient boosting; Stacking; Computer science; Random forest; Boosting (machine learning); Artificial intelligence; Box office; Investment (military); Machine learning; Econometrics; Data mining; Economics; Business; Political science","score_opus":0.2255844233831955,"score_gpt":0.3631559994353164,"score_spread":0.1375715760521209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092059796","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.9519534,0.00059024047,0.03955357,0.0010101547,0.00012320846,0.000033186134,0.0004422143,0.00020592666,0.0060879644],"genre_scores_gemma":[0.9955095,0.00012574712,0.0010872097,0.000035692927,0.00004811389,0.000009774603,0.00027137453,0.000012526637,0.0029001452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996518,0.000060847477,0.000013715467,0.000089939866,0.000051590123,0.00013217227],"domain_scores_gemma":[0.99762684,0.0015474157,0.00019588413,0.000093626695,0.00034526558,0.00019100645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014653242,0.0006453303,0.0012436197,0.0010744869,0.00062133983,0.0015447284,0.0010940159,0.0011546566,0.0053534512],"category_scores_gemma":[0.0034028857,0.0003599514,0.00093397294,0.00079828553,0.0006500708,0.0029051243,0.0005583163,0.0012967576,0.00036773292],"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.00077811826,0.00033098357,0.03795377,0.00010273741,0.00011438137,0.00064782053,0.00020269449,0.88644385,0.0018091524,0.03576856,0.007884833,0.027963072],"study_design_scores_gemma":[0.0000052337487,0.000010558618,0.0011668137,0.0000016489465,0.000009718811,0.000004534437,0.00001205617,0.9972349,0.00008439667,0.0014113284,0.000053776002,0.0000049518408],"about_ca_topic_score_codex":0.034866434,"about_ca_topic_score_gemma":0.017954813,"teacher_disagreement_score":0.034866434,"about_ca_system_score_codex":0.0010884134,"about_ca_system_score_gemma":0.0011090561,"threshold_uncertainty_score":0.06932694},"labels":[],"label_agreement":null},{"id":"W3093320459","doi":"10.1007/s10479-020-03813-3","title":"A multi-objective distributionally robust model for sustainable last mile relief network design problem","year":2020,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Ambiguity; Computer science; Mile; Operations research; Natural disaster; Mathematical optimization; Emergency management; Network planning and design; Set (abstract data type); Economics; Mathematics; Geography","score_opus":0.31121544282338576,"score_gpt":0.3813135937394925,"score_spread":0.07009815091610672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093320459","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.032793026,0.00042090297,0.9553625,0.0009799578,0.00007916561,0.00010589389,0.00040283235,0.00017691894,0.009678783],"genre_scores_gemma":[0.92713046,0.0003956063,0.058108702,0.00019901824,0.000067928304,0.0002884395,0.0003414002,0.00009409046,0.013374309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989255,0.00048604567,0.000032457985,0.00022698897,0.00016764834,0.0001612146],"domain_scores_gemma":[0.9985499,0.00085013063,0.00022140739,0.00005852652,0.00021773753,0.00010231599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002227511,0.0012331994,0.0019681472,0.00090896414,0.00049686263,0.001982502,0.0023097906,0.0031400824,0.0048631206],"category_scores_gemma":[0.0043063913,0.00097636814,0.0010450443,0.00095341954,0.0011515307,0.0015766451,0.0017304766,0.0018360477,0.00044078336],"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.000011280406,0.000008792641,0.00005402922,0.000014158478,0.000007790606,0.000019322728,0.000005441947,0.99569345,0.0001007383,0.0027951126,0.00017903003,0.0011108094],"study_design_scores_gemma":[0.000005775842,0.000013341652,0.000029746421,0.0000024886476,0.0000037713487,0.000004339202,0.0000040467535,0.99826235,0.00002808674,0.0015119386,0.00013129706,0.0000027059366],"about_ca_topic_score_codex":0.009379604,"about_ca_topic_score_gemma":0.0057136957,"teacher_disagreement_score":0.009379604,"about_ca_system_score_codex":0.0018807781,"about_ca_system_score_gemma":0.0017142694,"threshold_uncertainty_score":0.018649995},"labels":[],"label_agreement":null},{"id":"W3110436430","doi":"10.1007/s10479-020-03886-0","title":"Stochastic efficiency and inefficiency in portfolio optimization with incomplete information: a set-valued probability approach","year":2020,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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":"Acadia University","funders":"","keywords":"Inefficiency; Complete information; Theory of computation; Set (abstract data type); Mathematical optimization; Portfolio; Portfolio optimization; Probability measure; Computer science; Metric (unit); Mathematics; Mathematical economics; Algorithm; Economics; Statistics","score_opus":0.371803939000855,"score_gpt":0.45643776027668737,"score_spread":0.08463382127583235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110436430","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.02260552,0.0025094654,0.9652835,0.0025124287,0.000110654655,0.00004791861,0.00011991087,0.00004386611,0.0067667584],"genre_scores_gemma":[0.8164313,0.006580984,0.16552524,0.0006723819,0.0012360645,0.00038148448,0.00033061707,0.00020267657,0.008639216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9889065,0.00717341,0.0005476865,0.000924843,0.0019440954,0.000503482],"domain_scores_gemma":[0.88561666,0.10501054,0.003601958,0.0022963728,0.0026320752,0.00084243756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020477386,0.002527702,0.0047956766,0.004440527,0.0007762009,0.0071766675,0.0043491204,0.0038889905,0.0028329417],"category_scores_gemma":[0.06289791,0.0023952343,0.0032765018,0.0042392435,0.006374051,0.011242721,0.0036505905,0.005872082,0.0002545228],"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.00003882912,0.00009905893,0.0006568619,0.0001914845,0.00022075152,0.00012279411,0.0001288201,0.30806443,0.00031429564,0.6809319,0.0009827343,0.00824805],"study_design_scores_gemma":[0.000014750684,0.00002870985,0.00036671376,0.000066538785,0.000055291945,0.000044112603,0.000031074796,0.56099135,0.00011962301,0.4378129,0.00043957753,0.000029440394],"about_ca_topic_score_codex":0.002216475,"about_ca_topic_score_gemma":0.001504503,"teacher_disagreement_score":0.020477386,"about_ca_system_score_codex":0.004618674,"about_ca_system_score_gemma":0.0026691481,"threshold_uncertainty_score":0.10829604},"labels":[],"label_agreement":null},{"id":"W3116607398","doi":"10.1007/s10479-020-03843-x","title":"Decision-based scenario clustering for decision-making under uncertainty","year":2021,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":52,"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; Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Computer science; Theory of computation; Cluster analysis; Context (archaeology); Graph; Decision maker; Operations research; Machine learning; Mathematics; Theoretical computer science; Algorithm","score_opus":0.15333997407954997,"score_gpt":0.43286781790440215,"score_spread":0.2795278438248522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116607398","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.016533868,0.00028414416,0.9809316,0.00022686875,0.00004025166,0.0002543064,0.00028159196,0.00044712296,0.0010003854],"genre_scores_gemma":[0.5253124,0.00035649427,0.47061417,0.00013179815,0.00009802714,0.0007433919,0.0014164833,0.00016477189,0.00116239],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99534225,0.0027824573,0.000276384,0.00070486893,0.000596413,0.0002977079],"domain_scores_gemma":[0.9756218,0.020882342,0.0007214108,0.0009922773,0.0012352617,0.0005468852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008718742,0.0018433119,0.003966478,0.004671521,0.0017627295,0.0024141886,0.003617919,0.002349395,0.0049480284],"category_scores_gemma":[0.02279246,0.0019756886,0.002943553,0.003966079,0.0017313005,0.0034509676,0.002754083,0.0025870663,0.0005781171],"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.00011177788,0.00007267661,0.00028996766,0.00006811519,0.00012813076,0.00003365399,0.000064810694,0.9753107,0.00017985453,0.0066248826,0.0004559461,0.016659545],"study_design_scores_gemma":[0.000007559841,0.000009263068,0.000044532997,0.000005672225,0.000008296394,0.0000042386205,0.000008148227,0.9923849,0.00006140586,0.007384271,0.000076306926,0.000005501124],"about_ca_topic_score_codex":0.020561514,"about_ca_topic_score_gemma":0.010886132,"teacher_disagreement_score":0.020561514,"about_ca_system_score_codex":0.0036032074,"about_ca_system_score_gemma":0.0037239173,"threshold_uncertainty_score":0.046109676},"labels":[],"label_agreement":null},{"id":"W3119909670","doi":"10.1007/s10479-020-03871-7","title":"Designing a hybrid reinforcement learning based algorithm with application in prediction of the COVID-19 pandemic in Quebec","year":2021,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"COVID-19 epidemiological studies","field":"Mathematics","cited_by":66,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Concordia University","funders":"","keywords":"Pandemic; Reinforcement learning; Computer science; Coronavirus disease 2019 (COVID-19); Artificial intelligence; Dominance (genetics); Operations research; Machine learning; Mathematics; Medicine; Infectious disease (medical specialty)","score_opus":0.5094805475649316,"score_gpt":0.5179004433015533,"score_spread":0.008419895736621719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119909670","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.27097538,0.00034551276,0.7167653,0.00087473815,0.00014692261,0.00035055904,0.00012182496,0.0012507469,0.009169057],"genre_scores_gemma":[0.90380967,0.000061524566,0.09243456,0.00021353025,0.000025533847,0.00017018191,0.000088495064,0.000045062807,0.003151442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956995,0.00014523901,0.000020311249,0.00009443451,0.000058808542,0.000111284],"domain_scores_gemma":[0.9978911,0.0011951526,0.00009845416,0.00005942046,0.00061517576,0.00014064641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018761122,0.0006892558,0.00085894315,0.0006662799,0.00092971354,0.0010224861,0.0018097914,0.0016240082,0.0029533752],"category_scores_gemma":[0.0039952677,0.00046704727,0.0004209358,0.00033587584,0.0006713847,0.0005630892,0.0008040434,0.00085027877,0.0003271327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010175026,0.0000789167,0.0018569417,0.000023065853,0.000025188008,0.000051771574,0.00003092652,0.9767878,0.00059903896,0.00093080784,0.00047276792,0.01904101],"study_design_scores_gemma":[0.000008843746,0.0000141124,0.000070230424,0.0000014856101,0.0000026541106,0.0000021332849,0.000005143239,0.99968004,0.000086008324,0.00008034836,0.000047708865,0.0000012646083],"about_ca_topic_score_codex":0.20145185,"about_ca_topic_score_gemma":0.12137982,"teacher_disagreement_score":0.79854816,"about_ca_system_score_codex":0.0023736414,"about_ca_system_score_gemma":0.0042916927,"threshold_uncertainty_score":0.40055853},"labels":[],"label_agreement":null},{"id":"W3121781925","doi":"10.1007/s10479-025-06862-8","title":"Asset classes and portfolio diversification: evidence from a stochastic spanning approach","year":2025,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Financial Markets and Investment Strategies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Grantová Agentura České Republiky; Egg Farmers of Canada","keywords":"Portfolio; Diversification (marketing strategy); Sharpe ratio; Post-modern portfolio theory; Portfolio insurance; Financial economics; Capital asset pricing model; Real estate; Asset allocation; Bond; Economics; Econometrics; Parametric statistics; Asset (computer security); Stock (firearms); Portfolio optimization; Replicating portfolio; Business; Computer science; Finance; Mathematics; Geography","score_opus":0.3658973618812557,"score_gpt":0.407215683274081,"score_spread":0.041318321392825264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121781925","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.99111724,0.00019872055,0.0067611784,0.0001768963,0.0000034959623,0.000007824728,0.000049845858,0.000009243421,0.0016754844],"genre_scores_gemma":[0.9992083,0.00005624792,0.0005693004,0.000015922797,0.000008496273,0.0000023849063,0.000048164242,0.0000013388858,0.00008988829],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978309,0.0013182241,0.000106079024,0.00025311692,0.0003584754,0.00013309224],"domain_scores_gemma":[0.9592145,0.025989035,0.009064562,0.0032395243,0.0010872396,0.0014051643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059673362,0.00022813768,0.00043945966,0.0009787062,0.00041009937,0.0011872511,0.00055508537,0.00066355563,0.0021587382],"category_scores_gemma":[0.02794682,0.0001713108,0.00045091068,0.0010113491,0.0011100152,0.0017999945,0.0014741207,0.00071138045,0.00015920766],"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.0011083209,0.0005713524,0.7486606,0.0000772561,0.00082861376,0.00046910354,0.00077156373,0.080646105,0.0020316623,0.07850337,0.0013549976,0.08497708],"study_design_scores_gemma":[0.00011735777,0.0006932458,0.40127474,0.00005474721,0.0003174236,0.00054561737,0.00066153693,0.41466704,0.0010561969,0.17879999,0.0017602191,0.00005198788],"about_ca_topic_score_codex":0.0011160488,"about_ca_topic_score_gemma":0.00077608036,"teacher_disagreement_score":0.0059673362,"about_ca_system_score_codex":0.0002937781,"about_ca_system_score_gemma":0.00022375745,"threshold_uncertainty_score":0.031558633},"labels":[],"label_agreement":null},{"id":"W3124698695","doi":"10.1007/s10479-017-2474-7","title":"The impact of covariance misspecification in risk-based portfolios","year":2017,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Financial Risk and Volatility Modeling","field":"Economics, Econometrics and Finance","cited_by":54,"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é Laval","funders":"","keywords":"Covariance matrix; Portfolio; Econometrics; Diversification (marketing strategy); Volatility (finance); Mathematics; Covariance; Portfolio optimization; Inverse; Variance (accounting); Statistics; Economics; Financial economics","score_opus":0.4412080252485119,"score_gpt":0.4870787279534551,"score_spread":0.0458707027049432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124698695","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8248185,0.0037106103,0.15423545,0.005805727,0.00025514778,0.000034912384,0.0003067402,0.00031321548,0.010519714],"genre_scores_gemma":[0.99370885,0.0005100101,0.0038637458,0.00014169075,0.00010784743,0.000007517115,0.00013036068,0.000059805006,0.0014701483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947115,0.002720549,0.00035771873,0.000541742,0.0011649573,0.0005035399],"domain_scores_gemma":[0.8534815,0.12101051,0.010137261,0.0079227,0.005908939,0.001539195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014252159,0.0008584821,0.0013926611,0.0010683058,0.00065468164,0.003450407,0.001062697,0.0023767506,0.0026750101],"category_scores_gemma":[0.12893298,0.00082179176,0.00081450865,0.0012954503,0.001314262,0.0063487203,0.0020965072,0.0029797165,0.00036255567],"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.00088857964,0.00024787703,0.04919573,0.00013950412,0.00040022054,0.0007693235,0.00024106933,0.78611976,0.0025218362,0.10582745,0.0027734248,0.050875228],"study_design_scores_gemma":[0.00005092657,0.00018976163,0.017093001,0.000037273385,0.00017010933,0.00026476718,0.00008388592,0.90539503,0.0018249492,0.0742231,0.0006057374,0.00006147652],"about_ca_topic_score_codex":0.0035460065,"about_ca_topic_score_gemma":0.0023248505,"teacher_disagreement_score":0.014252159,"about_ca_system_score_codex":0.0012043288,"about_ca_system_score_gemma":0.0012521686,"threshold_uncertainty_score":0.07537353},"labels":[],"label_agreement":null},{"id":"W3126046128","doi":"10.1007/s10479-017-2725-7","title":"Negative dependence in matrix arrangement problems","year":2017,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Eidgenössische Technische Hochschule Zürich; Swiss Finance Institute","keywords":"Theory of computation; Mathematical optimization; Maximization; Computer science; Minification; Matrix (chemical analysis); Scheduling (production processes); Mathematics; Algorithm","score_opus":0.2819698716354554,"score_gpt":0.49960532239658373,"score_spread":0.21763545076112834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126046128","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.09753111,0.003065684,0.84323263,0.0049818326,0.00043563914,0.00007696941,0.00036856494,0.00015921277,0.050148323],"genre_scores_gemma":[0.84075314,0.0041357493,0.0898259,0.00089915906,0.0008858836,0.0003418049,0.0010133866,0.0003667664,0.061778117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982576,0.0010222594,0.000051364525,0.00019995625,0.00033392647,0.0001348215],"domain_scores_gemma":[0.98253757,0.01398341,0.0010988549,0.00053981197,0.0011308348,0.00070949167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026361546,0.0012062122,0.0014011861,0.0014517453,0.0010241908,0.0020513146,0.0020000204,0.0017822345,0.007370586],"category_scores_gemma":[0.019487083,0.0012788743,0.00071828364,0.0021596393,0.00311598,0.0048497296,0.002062553,0.004069032,0.00066310336],"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.00009710108,0.00013159732,0.00095474266,0.00021753272,0.000043328495,0.000154373,0.00017617042,0.13213873,0.0006438094,0.8376084,0.009834083,0.018000117],"study_design_scores_gemma":[0.000021208194,0.00002568591,0.00033124659,0.00002598849,0.000013657461,0.00005328933,0.000048172933,0.3283128,0.00017777481,0.66863143,0.0023412695,0.000017448378],"about_ca_topic_score_codex":0.003047977,"about_ca_topic_score_gemma":0.003673146,"teacher_disagreement_score":0.007370586,"about_ca_system_score_codex":0.0012589883,"about_ca_system_score_gemma":0.0011857045,"threshold_uncertainty_score":0.02465707},"labels":[],"label_agreement":null},{"id":"W3127734891","doi":"10.1007/s10479-021-03945-0","title":"Disclosure of quality preference-revealing information in a supply chain with competitive products","year":2021,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Supply chain; Business; Quality (philosophy); Incentive; Upstream (networking); Downstream (manufacturing); Preference; Product (mathematics); Industrial organization; Information quality; Marketing; Microeconomics; Computer science; Economics; Information system","score_opus":0.23998252262428793,"score_gpt":0.38696439698909657,"score_spread":0.14698187436480864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127734891","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.9301765,0.00045915952,0.05019378,0.0070853224,0.00007673095,0.000101142,0.00046824623,0.000111820606,0.011327254],"genre_scores_gemma":[0.9974082,0.000112756825,0.0014306987,0.00008233416,0.00003495313,0.000007185249,0.000043170654,0.0000042771485,0.0008764648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99590415,0.0020507472,0.0003333229,0.00044515354,0.00077975553,0.00048684576],"domain_scores_gemma":[0.8906529,0.07919966,0.01934476,0.006940384,0.0025488199,0.001313518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00825567,0.000322128,0.0007180838,0.0006687199,0.0009917902,0.0033910754,0.0009795962,0.0034100537,0.0041505024],"category_scores_gemma":[0.05077739,0.0006905023,0.00045501263,0.0014720963,0.0016023887,0.0046347133,0.001237672,0.002281231,0.00032396452],"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.012842632,0.0025599936,0.16295826,0.0008525352,0.00060719094,0.006505324,0.007525491,0.2651063,0.015531516,0.3384867,0.014098433,0.17292568],"study_design_scores_gemma":[0.0004483641,0.0011835548,0.033387166,0.00013065503,0.00032635222,0.0014950708,0.0022752385,0.6465051,0.007207987,0.303269,0.0035648823,0.00020667809],"about_ca_topic_score_codex":0.0024726056,"about_ca_topic_score_gemma":0.0022243485,"teacher_disagreement_score":0.00825567,"about_ca_system_score_codex":0.0016068699,"about_ca_system_score_gemma":0.001564525,"threshold_uncertainty_score":0.0436607},"labels":[],"label_agreement":null},{"id":"W3135374780","doi":"10.1007/s10479-021-03983-8","title":"A collective investment problem in a stochastic volatility environment: The impact of sharing rules","year":2021,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","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":"Université Laval; Actua","funders":"Deutsche Forschungsgemeinschaft","keywords":"Volatility (finance); Delegate; Economics; Pension; Financial market; Stochastic volatility; Investment (military); Microeconomics; Investment strategy; Financial economics; Finance; Computer science","score_opus":0.21118872137209588,"score_gpt":0.38888529789255827,"score_spread":0.1776965765204624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135374780","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.6686766,0.00037173732,0.31923097,0.0014308739,0.00007298076,0.00011026788,0.0001381644,0.00005452584,0.009913776],"genre_scores_gemma":[0.98391324,0.00009775856,0.013809631,0.000053761236,0.00001752835,0.00006515585,0.000044102126,0.000014340329,0.0019844556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998078,0.000905602,0.0001245644,0.00031133156,0.00020339165,0.00037718195],"domain_scores_gemma":[0.9922024,0.0056856093,0.0008781639,0.00036473363,0.00029520498,0.0005738629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004143146,0.0006703214,0.0017061408,0.00041523285,0.00060326763,0.0021751015,0.0013390254,0.001982314,0.0025344964],"category_scores_gemma":[0.010291098,0.00043641054,0.0009406449,0.0004080684,0.0018138713,0.0019876824,0.0021310588,0.0013043073,0.00012286997],"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.00015692729,0.00011092505,0.0012557936,0.000060516664,0.00009017094,0.00021663192,0.000114484195,0.90684426,0.0007601998,0.08420309,0.00047339266,0.005713667],"study_design_scores_gemma":[0.000049034592,0.00007551574,0.0002994523,0.000014735299,0.000016194554,0.000031987056,0.00007681467,0.9450513,0.0002479606,0.053887323,0.00023747096,0.000012168343],"about_ca_topic_score_codex":0.002991799,"about_ca_topic_score_gemma":0.001185858,"teacher_disagreement_score":0.004143146,"about_ca_system_score_codex":0.0010738008,"about_ca_system_score_gemma":0.0010694023,"threshold_uncertainty_score":0.021911323},"labels":[],"label_agreement":null},{"id":"W314897481","doi":"10.1007/s10479-015-1881-x","title":"Units invariant DEA when weight restrictions are present: ecological performance of US electricity industry","year":2015,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Priority Academic Program Development of Jiangsu Higher Education Institutions; Concern Foundation; Tongji University; National Science Foundation","keywords":"Data envelopment analysis; Electricity; Theory of computation; Environmental economics; A priori and a posteriori; Invariant (physics); Ecological efficiency; Computer science; Operations research; Environmental science; Econometrics; Mathematical optimization; Economics; Mathematics; Ecology; Engineering","score_opus":0.5686259960029576,"score_gpt":0.5056468731964749,"score_spread":0.06297912280648266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W314897481","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.98496395,0.00007422145,0.012005931,0.00026362218,0.000011272323,0.000009464967,0.00018273987,0.00002596097,0.0024628006],"genre_scores_gemma":[0.9988079,0.00002587442,0.0006345177,0.000010001693,0.000004199362,0.0000041427784,0.00010005867,0.0000058233577,0.00040760663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937445,0.0002634392,0.000043990523,0.00007705358,0.0001123826,0.00012878684],"domain_scores_gemma":[0.9952674,0.0032865189,0.00043023494,0.00048312545,0.000423568,0.00010917172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002841673,0.00036869562,0.0007461189,0.00056776387,0.0002832834,0.0013398909,0.000788666,0.0006569026,0.0011960611],"category_scores_gemma":[0.013271665,0.0003032971,0.00044973922,0.0010382739,0.0007034437,0.0016166306,0.00054943335,0.0008535233,0.000115099865],"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.0002791627,0.00019202185,0.033631936,0.000042308024,0.00015482733,0.00020617485,0.00008343001,0.9235946,0.0020766184,0.023452502,0.00085282914,0.01543354],"study_design_scores_gemma":[0.000009724112,0.000033253367,0.02573843,0.0000051253755,0.000024171239,0.000025154277,0.00009213442,0.962523,0.0008356257,0.010476193,0.00021900241,0.000018289133],"about_ca_topic_score_codex":0.022288445,"about_ca_topic_score_gemma":0.015522086,"teacher_disagreement_score":0.022288445,"about_ca_system_score_codex":0.0010618455,"about_ca_system_score_gemma":0.00090157177,"threshold_uncertainty_score":0.044317424},"labels":[],"label_agreement":null},{"id":"W3183082635","doi":"10.1007/s10479-021-04114-z","title":"Credit risk classification: an integrated predictive accuracy algorithm using artificial and deep neural networks","year":2021,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Financial Distress and Bankruptcy Prediction","field":"Business, Management and Accounting","cited_by":80,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Undersampling; Computer science; Oversampling; Machine learning; Artificial intelligence; Support vector machine; Artificial neural network; Resampling; Algorithm; Statistical classification; Data mining","score_opus":0.19784569491076648,"score_gpt":0.4008726326045339,"score_spread":0.2030269376937674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183082635","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.13657893,0.001723632,0.8527803,0.0014378628,0.00034256958,0.0001668712,0.00035389318,0.002435586,0.004180343],"genre_scores_gemma":[0.7482535,0.00046800656,0.24474682,0.00035213455,0.00023983208,0.00016480134,0.0006327363,0.00011041733,0.005031725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941504,0.00011936223,0.000059866237,0.00012742558,0.00018897676,0.00008943621],"domain_scores_gemma":[0.99832255,0.00070795167,0.00011048988,0.00012273181,0.00065988064,0.00007638418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002671062,0.00085681496,0.0012327424,0.0014669417,0.00053512165,0.0015486999,0.0018331218,0.0014427478,0.0018128236],"category_scores_gemma":[0.0047762534,0.00049896305,0.00067647855,0.0012586676,0.00033081436,0.0015158397,0.0014170125,0.0021183165,0.0006398369],"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.00039298288,0.00042485117,0.006200359,0.000046947738,0.000135273,0.00006462589,0.000052718256,0.28594017,0.0017871932,0.0032590162,0.0064038546,0.69529206],"study_design_scores_gemma":[0.000009602893,0.000014662367,0.00032430317,0.0000049514074,0.000011581799,0.000007081473,0.0000036010165,0.99812096,0.00035451594,0.00099737,0.00014821776,0.0000031271854],"about_ca_topic_score_codex":0.011688668,"about_ca_topic_score_gemma":0.010362883,"teacher_disagreement_score":0.011688668,"about_ca_system_score_codex":0.0011804596,"about_ca_system_score_gemma":0.0013492743,"threshold_uncertainty_score":0.023241282},"labels":[],"label_agreement":null},{"id":"W3184121575","doi":"10.1007/s10479-021-04185-y","title":"The benefit of manufacturer encroachment considering consumer’s environmental awareness and product competition","year":2021,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":45,"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":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Competition (biology); Product (mathematics); Theory of computation; Business; Industrial organization; Computer science; Environmental economics; Commerce; Economics; Mathematics; Ecology","score_opus":0.09864746607738467,"score_gpt":0.3500846095302755,"score_spread":0.2514371434528908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184121575","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.9324614,0.00028684436,0.002774246,0.002427546,0.000060701404,0.00002324074,0.00004346226,0.00003442199,0.06188818],"genre_scores_gemma":[0.9986632,0.000021722864,0.00021374205,0.000047256803,0.000016763443,0.0000013615637,0.0000072075572,0.0000020057562,0.0010267273],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860734,0.00044845685,0.000044889177,0.00016088606,0.00041642573,0.00032204733],"domain_scores_gemma":[0.99017006,0.006631919,0.0010091731,0.00048457246,0.0011150932,0.0005890661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018116763,0.0003404613,0.0004077449,0.0005862919,0.000967138,0.0030225553,0.0005959521,0.002401684,0.008145991],"category_scores_gemma":[0.011302015,0.00019395481,0.0005321357,0.0005837287,0.0010763033,0.0024188005,0.0010690403,0.0011743428,0.00026863802],"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.0058601904,0.0037379079,0.33402196,0.0005375918,0.0007370471,0.009428001,0.0038891549,0.17077166,0.028642327,0.20586045,0.008648481,0.22786526],"study_design_scores_gemma":[0.00025026858,0.002904324,0.42036062,0.0001424256,0.0013612496,0.0024931084,0.015197542,0.3597024,0.0110594025,0.16942734,0.016787797,0.0003135242],"about_ca_topic_score_codex":0.0056491653,"about_ca_topic_score_gemma":0.010519701,"teacher_disagreement_score":0.008145991,"about_ca_system_score_codex":0.001501376,"about_ca_system_score_gemma":0.0024950064,"threshold_uncertainty_score":0.027251065},"labels":[],"label_agreement":null},{"id":"W3185611158","doi":"10.1007/s10479-021-04202-0","title":"Multi-echelon fulfillment warehouse rent and production allocation for online direct selling","year":2021,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":15,"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 Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Renting; Warehouse; Computer science; Solver; Operations research; Interdependence; Profit (economics); Business; Integer programming; Production (economics); Marketing; Economics; Microeconomics","score_opus":0.37888953100476397,"score_gpt":0.4353396041343588,"score_spread":0.056450073129594824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185611158","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.9119774,0.00028527094,0.07665555,0.00021006135,0.00007287035,0.0001183957,0.00033328816,0.000332265,0.010014907],"genre_scores_gemma":[0.98474574,0.000038380032,0.0118114995,0.000010931582,0.00001277683,0.000015361307,0.000103080834,0.000035927438,0.0032262693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966085,0.00009980736,0.000016087977,0.000051932137,0.000077086326,0.000094258365],"domain_scores_gemma":[0.99856216,0.0010614395,0.000062673185,0.000105505176,0.00012373332,0.00008467268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010689506,0.00046339582,0.0009082032,0.0005070529,0.00046454015,0.0012953207,0.0012198851,0.0005943261,0.012522424],"category_scores_gemma":[0.002891233,0.00044800845,0.0006003581,0.00063120254,0.0003527425,0.001761069,0.0008260762,0.00043801655,0.00053570134],"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.0023805671,0.00088132586,0.0069222287,0.00009809931,0.00005500974,0.0002796805,0.000113958806,0.848856,0.0035035133,0.0054583238,0.00241741,0.1290339],"study_design_scores_gemma":[0.000015159317,0.00004174846,0.0010312349,0.0000023057262,0.000009411486,0.00001560715,0.000040402494,0.9976587,0.0004165987,0.00064379745,0.00012093921,0.000003998665],"about_ca_topic_score_codex":0.014964267,"about_ca_topic_score_gemma":0.023596108,"teacher_disagreement_score":0.014964267,"about_ca_system_score_codex":0.0013389846,"about_ca_system_score_gemma":0.001478378,"threshold_uncertainty_score":0.041891694},"labels":[],"label_agreement":null},{"id":"W3191852971","doi":"10.1007/s10479-022-04947-2","title":"A hydraulic model outperforms work-balance models for predicting recovery kinetics from intermittent exercise","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Sports Performance and Training","field":"Medicine","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Western Sydney University","keywords":"Computer science; Work (physics); Balance (ability); Energy balance; Predictive modelling; Experimental data; Econometrics; Statistics; Machine learning; Mathematics; Engineering; Physical medicine and rehabilitation","score_opus":0.26557756007436406,"score_gpt":0.4259751696559553,"score_spread":0.16039760958159122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3191852971","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.7859833,0.0056323144,0.19463015,0.0019524918,0.00029128193,0.0003430971,0.0048221406,0.0012279447,0.005117276],"genre_scores_gemma":[0.98762673,0.00043804082,0.009294507,0.00012644133,0.000039290877,0.00016171014,0.0015679875,0.000043374937,0.00070189364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913627,0.00031046203,0.00010876478,0.00022388392,0.00013676017,0.000083903156],"domain_scores_gemma":[0.99451196,0.0041949106,0.00046482627,0.00016401731,0.00050281687,0.00016151066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044713737,0.0010364417,0.0010244177,0.002660638,0.0002880248,0.0014999507,0.0012873062,0.0014900989,0.0026043258],"category_scores_gemma":[0.011345213,0.00039636428,0.0015096513,0.0012348096,0.00039601096,0.0014123787,0.0007228919,0.0007113019,0.0005869158],"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.0008645554,0.00047835204,0.05480757,0.0006920269,0.00063451356,0.00013157242,0.00010161767,0.8747879,0.0015350874,0.0011817667,0.0024625275,0.062322598],"study_design_scores_gemma":[0.000029599734,0.0002959732,0.010480151,0.00009896584,0.00012302962,0.00003211152,0.00006450876,0.98644257,0.00043451836,0.0013531143,0.0006167682,0.000028663531],"about_ca_topic_score_codex":0.01404685,"about_ca_topic_score_gemma":0.01043198,"teacher_disagreement_score":0.01404685,"about_ca_system_score_codex":0.0008483196,"about_ca_system_score_gemma":0.0015234635,"threshold_uncertainty_score":0.0279302},"labels":[],"label_agreement":null},{"id":"W3200189330","doi":"10.1007/s10479-021-04310-x","title":"The linearization problem of a binary quadratic problem and its applications","year":2021,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":11,"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 Waterloo","funders":"","keywords":"Linearization; Mathematics; Bounding overwatch; Quadratic equation; Upper and lower bounds; Quadratic function; Quadratic programming; Mathematical optimization; Nonlinear system; Computer science; Mathematical analysis","score_opus":0.12424349566759454,"score_gpt":0.39427121713691393,"score_spread":0.2700277214693194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200189330","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.034348395,0.00072573154,0.9469293,0.00090783555,0.0000705558,0.00012560288,0.00014072731,0.0004027194,0.016349029],"genre_scores_gemma":[0.818227,0.00092235324,0.16765857,0.0004328816,0.00020961254,0.000221407,0.00048124683,0.00017061396,0.0116763115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987047,0.00043315618,0.000056229655,0.00020033389,0.00039356248,0.0002119947],"domain_scores_gemma":[0.9972089,0.0018014091,0.00022638915,0.0002452276,0.00038035636,0.00013769488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013817495,0.00073751464,0.0007505768,0.00073235924,0.0004947379,0.0011159063,0.0012817652,0.0007122169,0.009192095],"category_scores_gemma":[0.005581209,0.0002919234,0.00061425293,0.0010002685,0.0011914865,0.0020575623,0.0022851329,0.0023959808,0.001044365],"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.00044124448,0.000359001,0.0010294839,0.00089996273,0.00008149315,0.00040331972,0.0005180852,0.3690488,0.013419497,0.43276027,0.012139676,0.16889907],"study_design_scores_gemma":[0.00005937907,0.00018884598,0.0003267517,0.000057135992,0.000020540476,0.00015022911,0.00011494423,0.7796826,0.006637237,0.20680395,0.005926092,0.00003223818],"about_ca_topic_score_codex":0.0020737415,"about_ca_topic_score_gemma":0.0010608556,"teacher_disagreement_score":0.009192095,"about_ca_system_score_codex":0.0014800183,"about_ca_system_score_gemma":0.0007704022,"threshold_uncertainty_score":0.030750692},"labels":[],"label_agreement":null},{"id":"W3206010544","doi":"10.1007/s10479-021-04317-4","title":"Equilibrium reinsurance-investment strategies with partial information and common shock dependence","year":2021,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Insurance and Financial Risk Management","field":"Economics, Econometrics and Finance","cited_by":19,"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 Waterloo","funders":"Higher Education Discipline Innovation Project; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Reinsurance; Theory of computation; Shock (circulatory); Complete information; Bellman equation; Mathematical economics; Economics; Investment strategy; Mathematical optimization; Investment (military); Partial equilibrium; Computer science; Mathematics; General equilibrium theory; Microeconomics; Actuarial science","score_opus":0.1302855867825303,"score_gpt":0.35447690881632116,"score_spread":0.22419132203379086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206010544","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.70124066,0.001318568,0.2640106,0.0060913847,0.00011045157,0.0003299993,0.0013616809,0.0005422088,0.024994401],"genre_scores_gemma":[0.969738,0.0005840178,0.007873833,0.00022197563,0.000051542826,0.0001070855,0.0002879671,0.000073036965,0.021062555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980184,0.00078769505,0.000116439034,0.00031753758,0.0001839325,0.00057596667],"domain_scores_gemma":[0.9732438,0.02061371,0.002773067,0.00085221924,0.0013075701,0.0012096375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053596697,0.0018224847,0.0040802807,0.0015655407,0.0009280103,0.004819101,0.002810418,0.005082802,0.011553563],"category_scores_gemma":[0.028022822,0.002425641,0.0022758036,0.0013419164,0.0025673977,0.007994474,0.0026742965,0.0031177786,0.0011745335],"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.0007131317,0.0003436023,0.004232544,0.00023306937,0.00026769435,0.0011298527,0.00043732132,0.654995,0.0024720947,0.31971598,0.004403492,0.011056187],"study_design_scores_gemma":[0.00010533502,0.00013960399,0.0015536901,0.000045556048,0.000081816,0.00017343057,0.00019281525,0.874384,0.0005978153,0.12217635,0.00046380702,0.000085780135],"about_ca_topic_score_codex":0.0064664637,"about_ca_topic_score_gemma":0.004783485,"teacher_disagreement_score":0.011553563,"about_ca_system_score_codex":0.0024783679,"about_ca_system_score_gemma":0.0021410487,"threshold_uncertainty_score":0.038650513},"labels":[],"label_agreement":null},{"id":"W3208326940","doi":"10.1007/s10479-021-04284-w","title":"Green channel coordination under asymmetric information","year":2021,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Toronto Metropolitan University","funders":"","keywords":"Greening; Information asymmetry; Incentive; Business; Product (mathematics); Supply chain; Industrial organization; Channel coordination; Microeconomics; Economics; Marketing; Supply chain management; Finance","score_opus":0.20046134866448112,"score_gpt":0.3828892129875882,"score_spread":0.1824278643231071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208326940","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.36490116,0.0010014119,0.5061808,0.009797781,0.0007450791,0.00016605401,0.0007647899,0.00069575204,0.11574726],"genre_scores_gemma":[0.9864704,0.0002528759,0.0054764925,0.00020378767,0.00017402382,0.00003747319,0.000049046925,0.000048777078,0.007287151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995917,0.001438478,0.00014382703,0.0006017964,0.00080871425,0.0010902135],"domain_scores_gemma":[0.96682346,0.023216387,0.0036903447,0.0026453948,0.0023458835,0.0012785061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060235816,0.00077804335,0.002495816,0.0015887764,0.0014684484,0.005518334,0.0016725257,0.0029528206,0.011849],"category_scores_gemma":[0.022190586,0.000929299,0.00069472805,0.0019287677,0.0039203633,0.0069367853,0.0027535523,0.0022142595,0.00086576986],"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.00055046426,0.00014227032,0.0008336984,0.000090534086,0.00008891985,0.00031660678,0.00025213498,0.24176271,0.0017051807,0.72978216,0.008814873,0.015660532],"study_design_scores_gemma":[0.00007683102,0.000056158,0.0004869044,0.000017885986,0.000038753802,0.00006850471,0.00018574881,0.37981978,0.0004919437,0.61728704,0.0014316753,0.00003875854],"about_ca_topic_score_codex":0.0034745105,"about_ca_topic_score_gemma":0.0019778928,"teacher_disagreement_score":0.011849,"about_ca_system_score_codex":0.003458552,"about_ca_system_score_gemma":0.0030237255,"threshold_uncertainty_score":0.039638817},"labels":[],"label_agreement":null},{"id":"W3215588167","doi":"10.1007/s10479-021-04353-0","title":"The high-frequency impact of macroeconomic news on jumps and co-jumps in the cryptocurrency markets","year":2021,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Blockchain Technology Applications and Security","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 Ottawa; Brock University","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Cryptocurrency; Liberian dollar; Economics; Unemployment rate; Jump; Monetary economics; Us dollar; Price formation; Currency; Unemployment; Finance; Macroeconomics; Computer science","score_opus":0.0985957829309655,"score_gpt":0.43864422788552027,"score_spread":0.3400484449545548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215588167","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.98564804,0.0007848365,0.0027048031,0.002452399,0.00012783021,0.000009612954,0.00029641078,0.000084594845,0.007891479],"genre_scores_gemma":[0.99890435,0.00015266736,0.00006136459,0.000043405293,0.00006326326,0.000001917776,0.000043135668,0.0000072320563,0.00072267966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999556,0.00012534633,0.000024280174,0.000073895535,0.00008244161,0.00013800619],"domain_scores_gemma":[0.97555894,0.018187465,0.0031401708,0.0007099304,0.0010068387,0.001396602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019251562,0.00032058972,0.0008766418,0.0010985819,0.0007512828,0.0030983961,0.0006715526,0.0018880762,0.011565457],"category_scores_gemma":[0.022862054,0.0005145145,0.00045257594,0.0009014502,0.0012709681,0.0034520007,0.0011642361,0.0027860063,0.0006138652],"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.005633911,0.002012191,0.18170515,0.0006728481,0.0011310559,0.0060777576,0.0013914348,0.3472497,0.018256186,0.31231236,0.029609079,0.09394839],"study_design_scores_gemma":[0.00037081915,0.00040993144,0.118060336,0.00006446169,0.0003535396,0.0004552859,0.001299954,0.6867418,0.0026583464,0.18717651,0.0022179373,0.0001910711],"about_ca_topic_score_codex":0.0036451658,"about_ca_topic_score_gemma":0.0033324915,"teacher_disagreement_score":0.011565457,"about_ca_system_score_codex":0.0008416104,"about_ca_system_score_gemma":0.00051210535,"threshold_uncertainty_score":0.03869027},"labels":[],"label_agreement":null},{"id":"W381406155","doi":"10.1023/a:1018935031580","title":"Scheduling the flying squad nurses of a hospital using a multi-objective programming model","year":2000,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","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":"Université de Montréal; Université du Québec à Trois-Rivières","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Computer science; Programming language","score_opus":0.20011221527984288,"score_gpt":0.44096406525828014,"score_spread":0.24085184997843725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W381406155","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.5178296,0.00087813794,0.46465188,0.0022429687,0.00038505808,0.00049615884,0.0005362111,0.00018547467,0.012794458],"genre_scores_gemma":[0.9464295,0.0005215193,0.04538381,0.0001430294,0.00013837445,0.00027652402,0.0002605369,0.00005478181,0.006791953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993137,0.00028369465,0.000023317474,0.00010897527,0.00007145403,0.00019883503],"domain_scores_gemma":[0.99882215,0.0006440969,0.00013959153,0.000024073217,0.000087848144,0.0002822041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001369613,0.0014629561,0.0020304632,0.0008818472,0.0013273414,0.0022867532,0.002150009,0.0030539264,0.0044759633],"category_scores_gemma":[0.002104264,0.001342397,0.0014944638,0.0011349028,0.0009151506,0.0016051511,0.0013354727,0.001896624,0.0003025618],"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.00009375038,0.00005500431,0.0003302951,0.000030690986,0.000028546478,0.000089134315,0.00002824804,0.99594265,0.0002356529,0.0011936205,0.0002541429,0.0017182162],"study_design_scores_gemma":[0.000019113522,0.000054064803,0.00012909537,0.0000033033284,0.000011399499,0.000008386399,0.000039851315,0.99904376,0.00005133541,0.0005383952,0.00009513994,0.0000061415394],"about_ca_topic_score_codex":0.035654876,"about_ca_topic_score_gemma":0.023525862,"teacher_disagreement_score":0.035654876,"about_ca_system_score_codex":0.0023683985,"about_ca_system_score_gemma":0.002915355,"threshold_uncertainty_score":0.07089466},"labels":[],"label_agreement":null},{"id":"W4200461915","doi":"10.1007/s10479-021-04480-8","title":"Residential choice from a multiple criteria sustainable perspective","year":2021,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Urban Transport and Accessibility","field":"Social Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Universidad de Oviedo; Ministerio de Ciencia, Innovación y Universidades","keywords":"TOPSIS; Ranking (information retrieval); Multiple-criteria decision analysis; Neighbourhood (mathematics); Computer science; Operations research; Sustainability; Ideal solution; Theory of computation; Management science; Environmental economics; Mathematics; Economics; Artificial intelligence","score_opus":0.22937354757841852,"score_gpt":0.5296157549876085,"score_spread":0.30024220740918994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200461915","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.19137032,0.0022416918,0.73267525,0.0027469841,0.00018164898,0.00044393985,0.00031766522,0.000072005474,0.06995046],"genre_scores_gemma":[0.9067723,0.0005230489,0.087119184,0.00008063591,0.000044431097,0.00022331209,0.00007612897,0.000016428128,0.005144517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9941508,0.004134364,0.00018902331,0.00024197831,0.0010268706,0.00025693837],"domain_scores_gemma":[0.99825364,0.0010992807,0.00015226802,0.00006430412,0.00027533842,0.00015500937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003345318,0.00077535847,0.00084486976,0.002492743,0.0007089833,0.0030572817,0.000900083,0.0010311484,0.0048011853],"category_scores_gemma":[0.003439498,0.00031056965,0.0010357655,0.0028174438,0.0012944555,0.0012111329,0.0013192333,0.00084817293,0.0002461371],"study_design_candidate":"observational","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.00017727191,0.00028733118,0.005795687,0.00101277,0.00044892865,0.0010900798,0.0008564853,0.52451986,0.0036818539,0.36800548,0.003251698,0.09087262],"study_design_scores_gemma":[0.00004660305,0.00044073426,0.0035912383,0.00032075433,0.00013372026,0.00036161323,0.002033325,0.6628541,0.0019636005,0.31275022,0.015419072,0.0000850469],"about_ca_topic_score_codex":0.0016975324,"about_ca_topic_score_gemma":0.0021663825,"teacher_disagreement_score":0.0048011853,"about_ca_system_score_codex":0.002132018,"about_ca_system_score_gemma":0.0014549888,"threshold_uncertainty_score":0.01769191},"labels":[],"label_agreement":null},{"id":"W4205183153","doi":"10.1007/s10479-021-04481-7","title":"The analysis of serve decisions in tennis using Bayesian hierarchical models","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Sports Analytics and Performance","field":"Economics, Econometrics and Finance","cited_by":16,"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":"Salient; Computer science; Adversary; Bayesian probability; Preference; Operations research; Data science; Artificial intelligence; Engineering; Mathematics; Statistics; Computer security","score_opus":0.4159646112100356,"score_gpt":0.4319273711165202,"score_spread":0.015962759906484603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205183153","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.6000229,0.0019056386,0.37992194,0.0061459355,0.00015443955,0.00026070524,0.0016408913,0.00037178214,0.009575716],"genre_scores_gemma":[0.9714594,0.00080666284,0.014282147,0.0001834904,0.00012034764,0.000107956635,0.00074984407,0.000091694776,0.01219853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976151,0.0012039577,0.00008645535,0.00033073395,0.0002068238,0.00055695954],"domain_scores_gemma":[0.9760173,0.021060232,0.0011586208,0.00032477578,0.0005950047,0.00084404234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007105321,0.0010888734,0.0033937017,0.0018822647,0.0012829914,0.0034940655,0.0030336988,0.0028278346,0.01025978],"category_scores_gemma":[0.022627354,0.0023111526,0.0019964913,0.0022114243,0.0018343925,0.0038581777,0.0017916536,0.0037810956,0.0007490437],"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.00030511405,0.00019193102,0.006229921,0.0000682193,0.00015741313,0.00015276733,0.00025702515,0.91804194,0.00018645379,0.061906986,0.0021756983,0.010326473],"study_design_scores_gemma":[0.000019548948,0.000022277343,0.001046115,0.000008116058,0.000018926561,0.000009330992,0.000066339744,0.97786075,0.00004195054,0.020707143,0.00018513897,0.000014429002],"about_ca_topic_score_codex":0.08053143,"about_ca_topic_score_gemma":0.08024027,"teacher_disagreement_score":0.08053143,"about_ca_system_score_codex":0.0038490542,"about_ca_system_score_gemma":0.0034930196,"threshold_uncertainty_score":0.16012537},"labels":[],"label_agreement":null},{"id":"W4212773160","doi":"10.1007/s10479-022-04559-w","title":"Joint robust optimization of bed capacity, nurse staffing, and care access under uncertainty","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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":"Polytechnique Montréal","funders":"National Science Foundation","keywords":"Staffing; Robustness (evolution); Robust optimization; Computer science; Flexibility (engineering); Ellipsoid; Mathematical optimization; Health care; Resource allocation; Operations research; Operations management; Medicine; Mathematics; Economics; Statistics; Nursing","score_opus":0.556376839376147,"score_gpt":0.5228452868946046,"score_spread":0.03353155248154238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212773160","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.29013073,0.0022162495,0.6916781,0.0039946134,0.0002491251,0.00024197483,0.0017671713,0.00045799275,0.009264042],"genre_scores_gemma":[0.9767454,0.0004972015,0.017566314,0.000121085846,0.00009986168,0.00015620107,0.0004546322,0.000088895,0.004270312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99582005,0.0021844602,0.00015800208,0.0005926839,0.0005088947,0.00073588354],"domain_scores_gemma":[0.9870576,0.009668423,0.0015996248,0.0003210127,0.0007317037,0.00062161894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070456243,0.0019418224,0.0044311457,0.0015425385,0.0004398922,0.003584883,0.0021795824,0.0029438692,0.0030946939],"category_scores_gemma":[0.023607783,0.0022578181,0.001897965,0.0019607523,0.0020642106,0.0029015103,0.0022874146,0.00229117,0.00034912562],"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.00007603711,0.000025569218,0.00028113686,0.000020355601,0.00006141955,0.000025189134,0.000008820925,0.9962859,0.00009380523,0.0019416369,0.00017715529,0.001002979],"study_design_scores_gemma":[0.000015278874,0.0000429534,0.00041106812,0.0000057080783,0.000020859123,0.000010037748,0.000013701433,0.9964904,0.00008232276,0.0028127811,0.000083804116,0.0000109907805],"about_ca_topic_score_codex":0.018187711,"about_ca_topic_score_gemma":0.007053642,"teacher_disagreement_score":0.018187711,"about_ca_system_score_codex":0.0036801207,"about_ca_system_score_gemma":0.0036892442,"threshold_uncertainty_score":0.037261307},"labels":[],"label_agreement":null},{"id":"W4214562182","doi":"10.1007/s10479-022-04578-7","title":"Unlocking the black box: Non-parametric option pricing before and during COVID-19","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Financial Markets and Investment Strategies","field":"Economics, Econometrics and Finance","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","funders":"","keywords":"Moneyness; Valuation of options; Economics; Financial economics; Coronavirus disease 2019 (COVID-19); Black–Scholes model; Crash; Econometrics; Volatility (finance); Actuarial science; Computer science","score_opus":0.18380669859702733,"score_gpt":0.37908392859374174,"score_spread":0.1952772299967144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214562182","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.08830069,0.0012398919,0.88911724,0.0031349151,0.0006161915,0.00007053061,0.00010466213,0.0010041717,0.01641168],"genre_scores_gemma":[0.8390744,0.0005225049,0.14689057,0.0006180909,0.00031535473,0.00010301063,0.00017497117,0.00080062845,0.011500536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950616,0.0027340923,0.00016250508,0.00052605645,0.0008909577,0.00062478223],"domain_scores_gemma":[0.9740612,0.019017436,0.0010972173,0.0034765347,0.0014471071,0.0009006697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012001972,0.0008867748,0.0018537871,0.0006629488,0.0014992852,0.005406072,0.002068029,0.0029200506,0.011996099],"category_scores_gemma":[0.053817756,0.0011211524,0.0008034131,0.0008189381,0.0030839972,0.015950026,0.0051707523,0.008539953,0.0012192699],"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.0010404018,0.00031704386,0.0027791301,0.00012960195,0.00008163072,0.00046476178,0.0008512219,0.07295477,0.0028943873,0.7482661,0.0072246706,0.16299625],"study_design_scores_gemma":[0.000033304776,0.00008695319,0.00056933163,0.00007163961,0.00001692404,0.00006240597,0.000108800064,0.6475595,0.0014424683,0.3462261,0.0037728173,0.000049702874],"about_ca_topic_score_codex":0.0024067664,"about_ca_topic_score_gemma":0.0023775513,"teacher_disagreement_score":0.012001972,"about_ca_system_score_codex":0.0010590233,"about_ca_system_score_gemma":0.0024555356,"threshold_uncertainty_score":0.063473284},"labels":[],"label_agreement":null},{"id":"W4220672502","doi":"10.1007/s10479-022-04543-4","title":"Optimal multi-stage group partition for efficient coronavirus screening","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"COVID-19 epidemiological studies","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":"Wilfrid Laurier University; University of Manitoba","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Natural Sciences and Engineering Research Council of Canada; Wilfrid Laurier University","keywords":"Partition (number theory); Stage (stratigraphy); Economic shortage; Computer science; Coronavirus disease 2019 (COVID-19); Group testing; Scheme (mathematics); Group (periodic table); Coronavirus; Multi stage; Tree (set theory); Mathematical optimization; Operations research; Mathematics; Medicine; Engineering; Combinatorics; Industrial engineering","score_opus":0.8785268876190176,"score_gpt":0.6386875129358051,"score_spread":0.2398393746832126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220672502","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.030653326,0.00016042487,0.9666305,0.00029404397,0.00004425223,0.00031035766,0.00028209703,0.000290057,0.0013350215],"genre_scores_gemma":[0.44803175,0.00024115172,0.5424184,0.00021852393,0.00013121561,0.001151768,0.0014046308,0.00020303523,0.006199535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966029,0.0019102354,0.00012893823,0.0005264436,0.00030881245,0.0005227836],"domain_scores_gemma":[0.98608077,0.01080666,0.0006368072,0.001037321,0.0007446688,0.0006937781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049235406,0.0016863028,0.0045251013,0.0016158366,0.0013464784,0.001682305,0.0037241848,0.0020694577,0.0073509915],"category_scores_gemma":[0.014411707,0.0015104271,0.0020576017,0.0014595961,0.0015855544,0.0030576843,0.0033512963,0.0024216948,0.001010843],"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.0016803956,0.0005307427,0.0017726566,0.0002428316,0.00014887835,0.00011420877,0.00028338603,0.8655771,0.0028538692,0.021847261,0.0046447637,0.10030389],"study_design_scores_gemma":[0.0001106068,0.00024033277,0.00039679464,0.000016808111,0.00003271655,0.000036117865,0.00007244957,0.96718585,0.0007971794,0.030610455,0.0004824946,0.000018175582],"about_ca_topic_score_codex":0.0054793423,"about_ca_topic_score_gemma":0.0047373357,"teacher_disagreement_score":0.0073509915,"about_ca_system_score_codex":0.0016906874,"about_ca_system_score_gemma":0.0038641673,"threshold_uncertainty_score":0.026038468},"labels":[],"label_agreement":null},{"id":"W4223928586","doi":"10.1007/s10479-022-04656-w","title":"Stochastic dominance spanning and augmenting the human development index with institutional quality","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Income, Poverty, and Inequality","field":"Social Sciences","cited_by":7,"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 Guelph","funders":"Social Sciences and Humanities Research Council of Canada; Edge Hill University","keywords":"Stochastic dominance; Human Development Index; Welfare; Index (typography); Composite index; Economics; Corporate governance; Dominance (genetics); Econometrics; Human development (humanity); Quality (philosophy); Composite indicator; Measure (data warehouse); Mathematics; Public economics; Welfare economics; Computer science; Economic growth; Data mining; Management","score_opus":0.3365755104872686,"score_gpt":0.5067608231956406,"score_spread":0.17018531270837206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4223928586","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.7929718,0.0004719305,0.19690771,0.0006195712,0.000049885002,0.00009589861,0.0008176858,0.00012925977,0.007936204],"genre_scores_gemma":[0.97768766,0.00019038399,0.020890823,0.000048782218,0.00003126054,0.000060697537,0.0004231861,0.000016227765,0.0006509881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949189,0.003556538,0.00013227524,0.00044694022,0.00056374364,0.00038160742],"domain_scores_gemma":[0.9851909,0.009959473,0.0023895553,0.0012947809,0.0007260549,0.00043927706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006268803,0.0006687202,0.00092833623,0.0013376259,0.00038742294,0.0015185486,0.0005837245,0.0004274652,0.0018789833],"category_scores_gemma":[0.020353278,0.00020034901,0.0012179584,0.002932695,0.0012062765,0.0017958704,0.0025037238,0.0008724145,0.00018142778],"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.000524833,0.00043423875,0.16062178,0.00032352883,0.00078291114,0.0005583087,0.0008052782,0.45886287,0.0034750071,0.1706657,0.00278467,0.20016085],"study_design_scores_gemma":[0.000051325747,0.00046530398,0.08676621,0.00007867769,0.00020735273,0.00018339818,0.00036624252,0.70864886,0.0016753395,0.19756724,0.0039016681,0.00008835507],"about_ca_topic_score_codex":0.004299547,"about_ca_topic_score_gemma":0.0035003435,"teacher_disagreement_score":0.006268803,"about_ca_system_score_codex":0.0010005602,"about_ca_system_score_gemma":0.001099475,"threshold_uncertainty_score":0.033152997},"labels":[],"label_agreement":null},{"id":"W4224239365","doi":"10.1007/s10479-022-04673-9","title":"A flexible robust model for blood supply chain network design problem","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Blood donation and transfusion practices","field":"Business, Management and Accounting","cited_by":75,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Supply chain; Robustness (evolution); Supply chain network; Facility location problem; Network planning and design; Computer science; Robust optimization; Blood supply; Coronavirus disease 2019 (COVID-19); Risk analysis (engineering); Operations research; Supply chain risk management; Supply chain management; Operations management; Service management; Mathematical optimization; Business; Engineering; Computer network; Medicine","score_opus":0.3244326607639991,"score_gpt":0.398151544860401,"score_spread":0.07371888409640187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224239365","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.019973787,0.00033053613,0.97250146,0.0007318802,0.000056735556,0.000086392836,0.00033175922,0.00017994193,0.005807431],"genre_scores_gemma":[0.8861724,0.0005378683,0.099336505,0.00022246968,0.000091941314,0.00032914712,0.0005263951,0.00010983395,0.012673492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890244,0.00044123048,0.0000350289,0.00029268232,0.00017503399,0.0001536341],"domain_scores_gemma":[0.9979382,0.0013165377,0.00027135617,0.000112826754,0.00024176545,0.000119254866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021827444,0.0011710029,0.0019349295,0.00074950926,0.00057089544,0.0021002386,0.0022139014,0.0033749007,0.0054637007],"category_scores_gemma":[0.0058366978,0.0010752995,0.0011898924,0.00099029,0.001210808,0.0018439263,0.0017075097,0.0021575892,0.000481031],"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.0000157032,0.0000084634075,0.000059593327,0.000018266026,0.000007699365,0.000025127838,0.000008979383,0.9931376,0.0001301247,0.004519952,0.00025558774,0.0018128736],"study_design_scores_gemma":[0.0000066861066,0.000009348847,0.00002313893,0.0000028261147,0.0000034212235,0.0000041815897,0.00000254926,0.99733704,0.000026483058,0.0024488831,0.00013265506,0.0000027058793],"about_ca_topic_score_codex":0.012271709,"about_ca_topic_score_gemma":0.0070771757,"teacher_disagreement_score":0.012271709,"about_ca_system_score_codex":0.0017332812,"about_ca_system_score_gemma":0.0019288833,"threshold_uncertainty_score":0.024400532},"labels":[],"label_agreement":null},{"id":"W4224294234","doi":"10.1007/s10479-022-04686-4","title":"Stochastic weekly operating room planning with an exponential number of scenarios","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","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":"Concordia University","funders":"","keywords":"Mathematical optimization; Theory of computation; Variable (mathematics); State variable; Computer science; Exponential function; Random variable; Stochastic programming; Function (biology); Mathematics; Algorithm; Statistics","score_opus":0.3910185297094651,"score_gpt":0.5812675020821944,"score_spread":0.19024897237272925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224294234","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.63371485,0.0006574334,0.35020837,0.0026206956,0.00022746959,0.00035773296,0.0023067952,0.00048248583,0.009424203],"genre_scores_gemma":[0.96667874,0.00018333492,0.027652694,0.00011976431,0.00007486665,0.00022798455,0.00076971285,0.00006287634,0.0042300127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969854,0.0015943793,0.00010845429,0.0005377586,0.00028641752,0.00048759652],"domain_scores_gemma":[0.975059,0.021095296,0.0013281929,0.0008227392,0.0007572919,0.00093751133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006722113,0.0013567758,0.0026762101,0.0011030372,0.0009869171,0.00217171,0.0033078669,0.0032684167,0.0059780404],"category_scores_gemma":[0.019032057,0.002761739,0.0022057667,0.0016838048,0.001547472,0.003723599,0.0016211886,0.0033762113,0.00032969884],"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.000117769145,0.00005794034,0.00032863775,0.000017210687,0.00002186678,0.000044789525,0.000010268182,0.99628687,0.000076177275,0.0017715124,0.00027145827,0.0009954532],"study_design_scores_gemma":[0.000014194569,0.000022419,0.00012775771,0.0000023258053,0.000006492689,0.000008416647,0.000008535862,0.9982716,0.000035095094,0.0014542683,0.000044167507,0.000004734396],"about_ca_topic_score_codex":0.013340329,"about_ca_topic_score_gemma":0.011361602,"teacher_disagreement_score":0.013340329,"about_ca_system_score_codex":0.002984005,"about_ca_system_score_gemma":0.0020084851,"threshold_uncertainty_score":0.035550356},"labels":[],"label_agreement":null},{"id":"W4224296565","doi":"10.1007/s10479-022-04706-3","title":"A note on scheduling coupled tasks for minimum total completion time","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","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":"Memorial University of Newfoundland","funders":"","keywords":"Zhàng; Computer science; Theory of computation; Scheduling (production processes); Mathematical optimization; Algorithm; Mathematics","score_opus":0.12244127384344361,"score_gpt":0.397452736203805,"score_spread":0.2750114623603614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224296565","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.0093540745,0.00973053,0.93242705,0.009202035,0.01907396,0.0002563334,0.0002579389,0.0005979729,0.019100033],"genre_scores_gemma":[0.21824186,0.016993849,0.68319136,0.0074731014,0.02248586,0.00058617897,0.00044115735,0.0016757145,0.048910897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984518,0.0003575122,0.000127987,0.00028653667,0.00063136674,0.00014469132],"domain_scores_gemma":[0.9961051,0.002627179,0.00012438506,0.00042407375,0.0004747299,0.00024468158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002517307,0.002504684,0.0016469904,0.0008424842,0.0013082568,0.0018158841,0.0034271963,0.0022911439,0.009075062],"category_scores_gemma":[0.007884043,0.00090679765,0.0019971365,0.0019886503,0.0017096391,0.0039160047,0.002662323,0.007996383,0.0018452404],"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.0025784317,0.00040650766,0.0006479742,0.0020604068,0.00047518083,0.0024195344,0.00063234207,0.2937546,0.07120974,0.24831416,0.114210926,0.2632902],"study_design_scores_gemma":[0.00037771513,0.0011085314,0.001582169,0.0004207547,0.00034186992,0.000776543,0.00019319131,0.43619525,0.017695477,0.3536023,0.18735541,0.00035073594],"about_ca_topic_score_codex":0.0060057133,"about_ca_topic_score_gemma":0.008070076,"teacher_disagreement_score":0.009075062,"about_ca_system_score_codex":0.001356084,"about_ca_system_score_gemma":0.0016401425,"threshold_uncertainty_score":0.030359149},"labels":[],"label_agreement":null},{"id":"W4224298152","doi":"10.1007/s10479-022-04661-z","title":"Sustainable closed-loop supply chain with energy efficiency: Lagrangian relaxation, reformulations and heuristics","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":113,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"University of Melbourne","keywords":"Supply chain; Lagrangian relaxation; Heuristics; Remanufacturing; Computer science; Profit (economics); Environmental economics; Operations research; Supply chain management; Theory of computation; Mathematical optimization; Business; Economics; Manufacturing engineering; Microeconomics; Marketing; Mathematics; Engineering","score_opus":0.04350973340699243,"score_gpt":0.3126777133944018,"score_spread":0.2691679799874094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224298152","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.029991928,0.0011516428,0.95344216,0.00063335104,0.00006630754,0.00019734443,0.00015682136,0.00014384564,0.014216517],"genre_scores_gemma":[0.65967655,0.0015009628,0.33203676,0.00021337916,0.000093246905,0.0004828448,0.0003134092,0.000108844535,0.005573967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987674,0.00076019997,0.000029948274,0.00009990167,0.0001680788,0.00017445606],"domain_scores_gemma":[0.9971808,0.0022366173,0.00021743195,0.00007557468,0.00021235424,0.00007725806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024448086,0.00102053,0.0012603188,0.0010662007,0.00061532407,0.0018806771,0.0011304182,0.0016017182,0.0031217558],"category_scores_gemma":[0.0051374757,0.0007530836,0.0010675712,0.0015956783,0.0014835912,0.0015429284,0.0012821222,0.0017328135,0.00031223576],"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.000022490041,0.00003694948,0.00008621873,0.00005612281,0.000010504944,0.00003966926,0.000027877211,0.98090005,0.00010572659,0.013476336,0.0004592959,0.0047788336],"study_design_scores_gemma":[0.000014290122,0.000024675062,0.000028818786,0.00001892177,0.0000056466242,0.0000073953424,0.00003038154,0.9875422,0.00011355595,0.011713247,0.00049653725,0.00000431839],"about_ca_topic_score_codex":0.009293496,"about_ca_topic_score_gemma":0.0059450185,"teacher_disagreement_score":0.009293496,"about_ca_system_score_codex":0.0019825764,"about_ca_system_score_gemma":0.002175847,"threshold_uncertainty_score":0.01847881},"labels":[],"label_agreement":null},{"id":"W4225279906","doi":"10.1007/s10479-022-04689-1","title":"Smart supply chain management in Industry 4.0: the review, research agenda and strategies in North America","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Digital Transformation in Industry","field":"Engineering","cited_by":205,"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 Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; University of Windsor; National Science Foundation","keywords":"Supply chain; Information and Communications Technology; Supply chain management; Smart manufacturing; Business; Industry 4.0; Systematic review; Knowledge management; Process management; Industrial organization; Computer science; Engineering management; Marketing; Engineering; Manufacturing engineering; Political science","score_opus":0.20845475903748611,"score_gpt":0.4274458321997248,"score_spread":0.2189910731622387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225279906","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011484685,0.99304044,0.000088653884,0.004236123,0.000120267934,0.0000033882277,0.00001669512,0.0000032791663,0.0013425818],"genre_scores_gemma":[0.013543598,0.984674,0.0002573374,0.001149404,0.00016082507,0.0000045631045,0.000030399135,0.0000014436393,0.00017846758],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875,0.00038101175,0.00014112891,0.00014845139,0.0004537841,0.00012576483],"domain_scores_gemma":[0.9874992,0.0074026985,0.001973061,0.00013948575,0.0025575808,0.00042797465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005327473,0.00039965156,0.00078999996,0.0037285148,0.0004732431,0.0033164786,0.0008013036,0.0013282773,0.001785999],"category_scores_gemma":[0.0062358757,0.0002920723,0.00061556656,0.0112486165,0.0014710089,0.003648399,0.0009815005,0.0012814483,0.00023767742],"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.00010721159,0.00008005683,0.0045767217,0.034108087,0.00025085697,0.000098435725,0.00074121787,0.0011675544,0.00044023784,0.02352833,0.028229587,0.9066717],"study_design_scores_gemma":[0.000036857058,0.0003229792,0.030061193,0.08615753,0.0009018268,0.00028659296,0.0039733015,0.0011649689,0.00090100325,0.012731175,0.8633953,0.00006724147],"about_ca_topic_score_codex":0.025209822,"about_ca_topic_score_gemma":0.057442464,"teacher_disagreement_score":0.025209822,"about_ca_system_score_codex":0.0050897202,"about_ca_system_score_gemma":0.018219206,"threshold_uncertainty_score":0.050126135},"labels":[],"label_agreement":null},{"id":"W4225691621","doi":"10.1007/s10479-022-04658-8","title":"Optimization of the technician routing and scheduling problem for a telecommunication industry","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":15,"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":"Technician; Computer science; Scheduling (production processes); Operations research; Job shop scheduling; Metaheuristic; Service provider; Time horizon; Routing (electronic design automation); Service (business); Mathematical optimization; Computer network; Operations management; Artificial intelligence; Engineering; Business","score_opus":0.1611433904965729,"score_gpt":0.4261114328978416,"score_spread":0.2649680424012687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225691621","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.16322182,0.0020040986,0.80113894,0.0029817696,0.00033530276,0.0003934604,0.00104227,0.00026239187,0.028619898],"genre_scores_gemma":[0.8058213,0.0020718838,0.1606789,0.00029416094,0.00029871866,0.00043639413,0.00072987156,0.00023788938,0.029430842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987997,0.0007299722,0.000030226136,0.00015117695,0.00013368677,0.00015516931],"domain_scores_gemma":[0.9978434,0.0017179373,0.00014494777,0.00005065028,0.000112555754,0.00013050495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027321177,0.0014583861,0.0017939875,0.0015229174,0.00067124143,0.00229578,0.0014433579,0.0028516352,0.007743686],"category_scores_gemma":[0.004293586,0.0011829817,0.0016280536,0.0020036679,0.0013543112,0.0017288177,0.0011935743,0.001919579,0.000498357],"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.000118396674,0.00009617167,0.00033520028,0.000082921615,0.000052313568,0.000045418492,0.000026419557,0.9811229,0.0003942593,0.008888588,0.0013172234,0.007520072],"study_design_scores_gemma":[0.000032376633,0.000058859172,0.0002530023,0.000007687382,0.000019420026,0.000015483187,0.00003067999,0.9924056,0.00015820465,0.0063071777,0.00070120994,0.000010353751],"about_ca_topic_score_codex":0.019992013,"about_ca_topic_score_gemma":0.011582695,"teacher_disagreement_score":0.019992013,"about_ca_system_score_codex":0.0028780142,"about_ca_system_score_gemma":0.003067032,"threshold_uncertainty_score":0.03975129},"labels":[],"label_agreement":null},{"id":"W4226133331","doi":"10.1007/s10479-022-04676-6","title":"Measuring individual efficiency and unit influence in centrally managed systems","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":10,"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":"Data envelopment analysis; Ranking (information retrieval); Computer science; Set (abstract data type); Measure (data warehouse); Projection (relational algebra); Efficient frontier; Mathematical optimization; Production–possibility frontier; Production (economics); Data mining; Mathematics; Algorithm; Economics; Artificial intelligence","score_opus":0.5510430726362899,"score_gpt":0.5103237528431546,"score_spread":0.04071931979313537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226133331","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.9464589,0.00012134635,0.05062182,0.000053694454,0.000008107887,0.000030844334,0.00003625862,0.000035704554,0.0026333956],"genre_scores_gemma":[0.9955908,0.0000145625145,0.004238449,0.0000031756729,0.000004428488,0.00001381581,0.000015340238,0.000004199451,0.00011539618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99058586,0.005272161,0.00044737488,0.00080562854,0.002276692,0.000612143],"domain_scores_gemma":[0.9568969,0.035333835,0.0033539417,0.0018391437,0.0019785077,0.0005976579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008411351,0.0004236563,0.0012355532,0.0018911023,0.0006511649,0.0023290287,0.00074524205,0.0006315302,0.000928925],"category_scores_gemma":[0.028528262,0.0003693695,0.0006464916,0.0023303716,0.0011082671,0.0021361876,0.001320772,0.0008250865,0.00010814954],"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.0014787625,0.0008109332,0.29820314,0.0001731729,0.0011271333,0.00013702642,0.0013106347,0.52136064,0.010887367,0.0356157,0.0003907224,0.12850489],"study_design_scores_gemma":[0.000043415483,0.00072928815,0.14913273,0.000023790199,0.00020301066,0.000058848913,0.0007250804,0.8204095,0.009616236,0.018311936,0.0006998542,0.000046453315],"about_ca_topic_score_codex":0.0039127916,"about_ca_topic_score_gemma":0.0039709685,"teacher_disagreement_score":0.008411351,"about_ca_system_score_codex":0.002184122,"about_ca_system_score_gemma":0.0016968966,"threshold_uncertainty_score":0.04448402},"labels":[],"label_agreement":null},{"id":"W4229025461","doi":"10.1007/s10479-022-04713-4","title":"Designing an integrated responsive-green-cold vaccine supply chain network using Internet-of-Things: artificial intelligence-based solutions","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Healthcare and Environmental Waste Management","field":"Medicine","cited_by":114,"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","funders":"","keywords":"Computer science; Supply chain network; Mathematical optimization; Heuristic; Pareto principle; Supply chain; Pareto optimal; Variable neighborhood search; Operations research; Supply chain management; Metaheuristic; Multi-objective optimization; Artificial intelligence; Machine learning; Engineering; Mathematics","score_opus":0.37494176839330917,"score_gpt":0.4543444267938807,"score_spread":0.07940265840057154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229025461","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.083984174,0.00022261232,0.900862,0.000816844,0.00018547842,0.0004412603,0.00012993433,0.0007271989,0.012630424],"genre_scores_gemma":[0.75049174,0.00032818632,0.23782091,0.00038255967,0.0000509973,0.00027938874,0.0003191176,0.00006305306,0.0102640325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995789,0.000089644986,0.000021362946,0.00011872544,0.00010021567,0.000091191214],"domain_scores_gemma":[0.9996306,0.000081490245,0.000048650494,0.00004015854,0.00014749309,0.000051665793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005838633,0.0005536384,0.00041415126,0.00052742136,0.0009878399,0.0015463753,0.0014201893,0.0012889274,0.0030495815],"category_scores_gemma":[0.00064285856,0.00034816185,0.0006393547,0.0006263655,0.0003471078,0.0019455946,0.0012665072,0.0005842455,0.000563537],"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.00049995,0.0009638681,0.006509633,0.00056042115,0.00020863707,0.0013251873,0.00044369046,0.5716493,0.1126163,0.043378342,0.007197141,0.25464767],"study_design_scores_gemma":[0.00002857374,0.00032623694,0.000709268,0.000030527073,0.000077550765,0.0001751329,0.00039058243,0.96221435,0.016683767,0.011107897,0.008224998,0.000031117856],"about_ca_topic_score_codex":0.0018770421,"about_ca_topic_score_gemma":0.0043815854,"teacher_disagreement_score":0.0030495815,"about_ca_system_score_codex":0.00064769667,"about_ca_system_score_gemma":0.0012919453,"threshold_uncertainty_score":0.010201871},"labels":[],"label_agreement":null},{"id":"W4229366107","doi":"10.1007/s10479-022-04710-7","title":"Supplier selection in closed loop pharma supply chain: a novel BWM–GAIA framework","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":52,"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 Regina","funders":"","keywords":"Computer science; Selection (genetic algorithm); Supply chain; Hierarchy; Circular economy; Supply chain management; Theory of computation; Process management; Operations research; Risk analysis (engineering); Business; Marketing; Artificial intelligence; Algorithm; Engineering; Economics","score_opus":0.12178857584760718,"score_gpt":0.3897344587921001,"score_spread":0.26794588294449295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229366107","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.008074882,0.00037353658,0.9764276,0.0007764273,0.000072174604,0.0001114845,0.00016739636,0.00018937007,0.013807068],"genre_scores_gemma":[0.65296394,0.00085243024,0.3311167,0.00035054868,0.00022984107,0.00032277693,0.00037286917,0.00015327078,0.01363758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99691916,0.0015335524,0.00010778626,0.0005435925,0.00050809875,0.0003878317],"domain_scores_gemma":[0.9976324,0.0012269313,0.00028066168,0.00025871574,0.0004055087,0.00019580079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003513271,0.0011771612,0.0019302545,0.0017110271,0.0011574295,0.00457533,0.0042904033,0.0030234063,0.008641665],"category_scores_gemma":[0.0065784627,0.00093791005,0.0017970942,0.0026303125,0.0022248672,0.004777861,0.0046393815,0.0025253273,0.0013575274],"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.00009935188,0.00013514946,0.0011718895,0.00020340667,0.00013182536,0.00041842964,0.00018983413,0.45734,0.0011859442,0.4979778,0.0029869077,0.038159396],"study_design_scores_gemma":[0.000017331073,0.000050375173,0.00015867112,0.000033759126,0.00003081764,0.00006418985,0.000057713954,0.8754951,0.00017742076,0.1213908,0.0025055497,0.000018243392],"about_ca_topic_score_codex":0.0061874865,"about_ca_topic_score_gemma":0.0043904353,"teacher_disagreement_score":0.008641665,"about_ca_system_score_codex":0.0019906966,"about_ca_system_score_gemma":0.0027589393,"threshold_uncertainty_score":0.028909206},"labels":[],"label_agreement":null},{"id":"W4230776514","doi":"10.1023/a:1020719714437","title":"Recent Developments in the Theory and Applications of Location Models: A Preview","year":2002,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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 Toronto","funders":"","keywords":"Theory of computation; Mathematics; Computer science; Mathematical economics; Algorithm","score_opus":0.36558002536392603,"score_gpt":0.4124520385444206,"score_spread":0.046872013180494554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230776514","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021515267,0.8689503,0.07814961,0.023692172,0.0038198088,0.000017241537,0.00016606305,0.0001344308,0.022918997],"genre_scores_gemma":[0.03379238,0.9160305,0.02466048,0.003987855,0.015528448,0.000032255506,0.0001916892,0.00007711998,0.0056993547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987097,0.0004560186,0.000094188625,0.00022150578,0.00044480633,0.00007379945],"domain_scores_gemma":[0.9861626,0.011003074,0.00051957415,0.00074194855,0.0013042681,0.0002684661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003660996,0.0012189634,0.0013894481,0.004626588,0.00074419315,0.006241274,0.0022195312,0.0029032489,0.008861374],"category_scores_gemma":[0.009315737,0.00074383116,0.0011682109,0.007447234,0.003535006,0.010288505,0.002072492,0.0038345687,0.0028474445],"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.00008539049,0.00015684223,0.0014645727,0.0031023093,0.00008752359,0.0001816962,0.00031958683,0.010198458,0.0006137059,0.53714275,0.048780695,0.39786652],"study_design_scores_gemma":[0.000013906906,0.000070808805,0.0008755098,0.0014836962,0.000052092568,0.0004506962,0.0004106619,0.013713307,0.00035179305,0.38852587,0.5939715,0.00008014802],"about_ca_topic_score_codex":0.0030061603,"about_ca_topic_score_gemma":0.003330848,"teacher_disagreement_score":0.008861374,"about_ca_system_score_codex":0.0021044803,"about_ca_system_score_gemma":0.0018963397,"threshold_uncertainty_score":0.029644191},"labels":[],"label_agreement":null},{"id":"W4233423259","doi":"10.1023/a:1026113019438","title":"Foreword","year":2003,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"","field":"","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 Alberta","funders":"","keywords":"Theory of computation; Computer science; Mathematics; Algorithm","score_opus":0.5635493581751287,"score_gpt":0.5722512263841881,"score_spread":0.008701868209059382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233423259","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033720103,0.011531574,0.002134106,0.16021004,0.43220577,0.00023225047,0.0013137937,0.0005039682,0.39153135],"genre_scores_gemma":[0.0021331594,0.004892154,0.00066894473,0.046631917,0.058204822,0.0001475221,0.0006836821,0.0002764386,0.8863614],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99861217,0.00020554871,0.00010463168,0.0001594168,0.0007803268,0.00013790796],"domain_scores_gemma":[0.99176776,0.0013925887,0.00032978904,0.00053867884,0.005045034,0.00092612545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017434701,0.00091085205,0.00092971977,0.002034549,0.0018590788,0.0045707193,0.0011809535,0.0041148174,0.29939613],"category_scores_gemma":[0.013830843,0.00031359732,0.0006329375,0.0013895134,0.00078302086,0.00262185,0.0016320569,0.0048756236,0.27428356],"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.000006220555,0.0000048651714,0.0000144179,0.000031108088,7.203961e-7,0.000012979186,0.000006637438,0.000007733636,0.000030936873,0.0014858617,0.9826068,0.015791664],"study_design_scores_gemma":[0.0000034046323,0.0000071461855,0.00010184543,0.00010384682,0.0000019856868,0.000038916754,0.00002053503,0.000018547342,0.00005450769,0.0015702152,0.99807596,0.0000030175715],"about_ca_topic_score_codex":0.003086326,"about_ca_topic_score_gemma":0.0045707063,"teacher_disagreement_score":0.29939613,"about_ca_system_score_codex":0.0018560233,"about_ca_system_score_gemma":0.003157096,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4241323324","doi":"10.1007/s10479-005-2136-z","title":"Foreword","year":2005,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"","field":"","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":"McGill University; HEC Montréal; University of New Brunswick","funders":"","keywords":"Theory of computation; Computer science; Algorithm","score_opus":0.5365404960915995,"score_gpt":0.5822936487901746,"score_spread":0.04575315269857516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241323324","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029084427,0.011777008,0.0019703533,0.17679633,0.47689545,0.00020897084,0.0011788002,0.00044014535,0.33044213],"genre_scores_gemma":[0.0022759635,0.0056548635,0.00072323944,0.061525084,0.0758189,0.00016403479,0.00068859034,0.00028397486,0.85286534],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99847573,0.00023121215,0.00011465332,0.00017725606,0.0008508485,0.0001504113],"domain_scores_gemma":[0.99110657,0.0016017444,0.0003547982,0.0005621671,0.00537025,0.0010044599],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018899894,0.0009285994,0.0009401933,0.0020400565,0.0018921404,0.004768531,0.0012338173,0.0045310035,0.28082475],"category_scores_gemma":[0.015437144,0.0003262118,0.00066540705,0.0013683237,0.0008540005,0.0027061095,0.0016682858,0.005439208,0.25270766],"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.000005774592,0.000004549735,0.000013216295,0.00003091882,7.3480425e-7,0.000012431661,0.0000061666146,0.000007761179,0.000027588343,0.0014844254,0.983851,0.014555315],"study_design_scores_gemma":[0.0000034991263,0.0000070676474,0.00009564776,0.000114390685,0.0000019800443,0.000037747737,0.000019540026,0.00001879499,0.0000516103,0.001630361,0.9980161,0.000003188395],"about_ca_topic_score_codex":0.0031428628,"about_ca_topic_score_gemma":0.0046951934,"teacher_disagreement_score":0.7191752,"about_ca_system_score_codex":0.0020290473,"about_ca_system_score_gemma":0.0033319583,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4251066204","doi":"10.1007/s10479-019-03467-w","title":"Correction to: Measuring short-term risk of initial public offering of equity securities: a hybrid Bayesian and Data-Envelopment-Analysis-based approach","year":2019,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","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 Toronto","funders":"","keywords":"Equity (law); Term (time); Data envelopment analysis; Theory of computation; Bayesian probability; Computer science; Econometrics; Actuarial science; Financial economics; Economics; Statistics; Artificial intelligence; Mathematics; Algorithm; Political science","score_opus":0.5480317419842528,"score_gpt":0.5527443417719992,"score_spread":0.004712599787746408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251066204","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.0011446646,0.0012118875,0.005758241,0.03503437,0.94382626,0.000098981196,0.0074651535,0.0017558704,0.0037045684],"genre_scores_gemma":[0.14378884,0.0077145933,0.040559415,0.044168323,0.36778158,0.0007824368,0.017677786,0.0050478783,0.3724791],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9938352,0.0009091655,0.0015250274,0.00091292406,0.0022908922,0.00052681525],"domain_scores_gemma":[0.91775817,0.017893367,0.0047941403,0.008190426,0.049245384,0.0021184988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054279296,0.0029409188,0.0036678882,0.00543011,0.0024951443,0.0053333384,0.0042324476,0.007906196,0.18299259],"category_scores_gemma":[0.11688738,0.0015232009,0.0022116136,0.0062375423,0.0019313737,0.0035960518,0.002873102,0.007840982,0.0631987],"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.00014039998,0.00002172123,0.00036669645,0.00035942908,0.000051542946,0.00023670285,0.00005197351,0.0005330789,0.00017894502,0.003232293,0.9808251,0.014002104],"study_design_scores_gemma":[0.00034051845,0.00009007601,0.008222065,0.0006880254,0.00014967888,0.0011155225,0.00030511,0.0083938865,0.002169787,0.015437118,0.962824,0.00026418443],"about_ca_topic_score_codex":0.013921781,"about_ca_topic_score_gemma":0.014714145,"teacher_disagreement_score":0.18299259,"about_ca_system_score_codex":0.0045445627,"about_ca_system_score_gemma":0.0057424847,"threshold_uncertainty_score":0.6121712},"labels":[],"label_agreement":null},{"id":"W4254458964","doi":"10.1023/a:1014557624540","title":"Topological Design of Survivable Mesh-Based Transport Networks","year":2001,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Optical Network Technologies","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":"University of Alberta","funders":"","keywords":"Computer science; Mathematical optimization; Heuristic; Spare part; Network topology; Integer programming; Topology (electrical circuits); Routing (electronic design automation); Mesh networking; Network planning and design; Algorithm; Mathematics; Computer network; Telecommunications","score_opus":0.2338737876707419,"score_gpt":0.4078046797955178,"score_spread":0.17393089212477592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254458964","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.1508641,0.00051812356,0.8310575,0.00056889054,0.00012670903,0.00010848173,0.00023920632,0.00025786593,0.016259087],"genre_scores_gemma":[0.9107911,0.0006685924,0.08420474,0.000073372925,0.000060195587,0.00014540968,0.00023939754,0.00006749768,0.003749768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982053,0.00006773153,0.000011542918,0.000019002835,0.000055342156,0.000025945574],"domain_scores_gemma":[0.9996406,0.00012304854,0.000058031354,0.000032702304,0.00011737388,0.000028298678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033281205,0.00025684183,0.00023774474,0.00068628945,0.00035407618,0.0007244711,0.0007651268,0.0003705434,0.001902562],"category_scores_gemma":[0.0014976976,0.00022740345,0.00019004784,0.00046780202,0.00033328196,0.00071654713,0.0005562641,0.00024167182,0.00021460518],"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.00014775316,0.00005048201,0.0008008592,0.00014687328,0.000026912441,0.00008657016,0.00009213835,0.7076489,0.017482925,0.20325856,0.0022556034,0.0680024],"study_design_scores_gemma":[0.000017618337,0.00008783868,0.00020748976,0.000014933407,0.00001472907,0.000042100546,0.000050127932,0.923874,0.002299171,0.06964099,0.0037414592,0.000009467624],"about_ca_topic_score_codex":0.0005603352,"about_ca_topic_score_gemma":0.00085641706,"teacher_disagreement_score":0.001902562,"about_ca_system_score_codex":0.0006516097,"about_ca_system_score_gemma":0.000401091,"threshold_uncertainty_score":0.0063646436},"labels":[],"label_agreement":null},{"id":"W4282983271","doi":"10.1007/s10479-022-04758-5","title":"Dynamic collaborative optimization for disaster relief supply chains under information ambiguity","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Office for Philosophy and Social Sciences","keywords":"Emergency management; Supply chain; Ambiguity; Computer science; Operations research; Ranking (information retrieval); Fuzzy logic; Interval (graph theory); Business; Engineering","score_opus":0.11663716459423903,"score_gpt":0.38864304116681625,"score_spread":0.27200587657257724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4282983271","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.10099969,0.0012021498,0.883283,0.0016076529,0.00018415463,0.0003277984,0.00045260045,0.00026381903,0.011679099],"genre_scores_gemma":[0.9447656,0.00048756416,0.046431772,0.00012530106,0.00010629681,0.00025515966,0.00027200178,0.00011295765,0.007443395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99659806,0.0015014212,0.00017469266,0.0007024327,0.00038391704,0.0006394622],"domain_scores_gemma":[0.9800892,0.016060136,0.001644012,0.0005215862,0.00089560694,0.00078944373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068022916,0.0025911336,0.0070889904,0.0024179434,0.002162686,0.0049346783,0.0034795946,0.0058660805,0.007959348],"category_scores_gemma":[0.020682408,0.0031624506,0.0020959408,0.0034468265,0.0030501774,0.005915815,0.0048126816,0.0030997396,0.0005630369],"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.00007940988,0.00003777731,0.00013720209,0.00004152478,0.000036725076,0.000059899212,0.000046237023,0.9924298,0.000087934524,0.0044504977,0.00030562337,0.0022872894],"study_design_scores_gemma":[0.000015333695,0.00002790824,0.00005193559,0.0000062654135,0.000010061022,0.0000067714395,0.000025625675,0.995037,0.000032975895,0.004677617,0.000100648955,0.00000790422],"about_ca_topic_score_codex":0.0199917,"about_ca_topic_score_gemma":0.009611427,"teacher_disagreement_score":0.0199917,"about_ca_system_score_codex":0.003336479,"about_ca_system_score_gemma":0.0031284704,"threshold_uncertainty_score":0.039750636},"labels":[],"label_agreement":null},{"id":"W4283160339","doi":"10.1007/s10479-022-04798-x","title":"On horizon-consistent mean-variance portfolio allocation","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":4,"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é Laval","funders":"European Research Council; Fonds de Recherche du Québec-Société et Culture","keywords":"Theory of computation; Variance (accounting); Portfolio; Horizon; Portfolio allocation; Mathematical economics; Computer science; Econometrics; Mathematics; Economics; Financial economics; Algorithm","score_opus":0.20625023236364798,"score_gpt":0.3758405606478733,"score_spread":0.16959032828422532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283160339","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.022268245,0.0023291097,0.9653059,0.002414777,0.00028106882,0.0000771596,0.00023459358,0.00015994109,0.0069291787],"genre_scores_gemma":[0.73156166,0.007439843,0.23447704,0.0018848353,0.0016561357,0.00048552032,0.0010858442,0.000593667,0.02081553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945857,0.0034605085,0.00021890493,0.0006435618,0.000720429,0.00037102867],"domain_scores_gemma":[0.9595859,0.03500732,0.0015048832,0.0013639107,0.0020103492,0.00052754924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01622611,0.002346837,0.0043832436,0.0016407679,0.0008384562,0.0036541962,0.00346242,0.0043365164,0.0057904795],"category_scores_gemma":[0.07624832,0.0024675766,0.0018250741,0.0029485642,0.0038257865,0.007077397,0.0037358357,0.004312693,0.0006152402],"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.0002831123,0.00009200195,0.0009821756,0.00023402464,0.00023276127,0.00013253005,0.0001395386,0.46817076,0.0005948684,0.49881122,0.004925449,0.025401609],"study_design_scores_gemma":[0.000048505535,0.000040712323,0.00026273887,0.000053692682,0.0000318705,0.00003630438,0.000018664667,0.6267681,0.00016283472,0.37186962,0.0006755384,0.000031383843],"about_ca_topic_score_codex":0.004230589,"about_ca_topic_score_gemma":0.00273417,"teacher_disagreement_score":0.01622611,"about_ca_system_score_codex":0.002627627,"about_ca_system_score_gemma":0.0039020812,"threshold_uncertainty_score":0.08581293},"labels":[],"label_agreement":null},{"id":"W4292423539","doi":"10.1007/s10479-022-04909-8","title":"Reverse supply chain management with dual channel and collection disruptions: supply chain coordination and game theory approaches","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":43,"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 Victoria","funders":"","keywords":"Chromatin structure remodeling (RSC) complex; Channel coordination; Supply chain; Incentive; Data collection; Dual (grammatical number); Channel (broadcasting); Business; Computer science; Competition (biology); Industrial organization; Microeconomics; Operations research; Supply chain management; Economics; Marketing; Telecommunications; Engineering","score_opus":0.09263071883780824,"score_gpt":0.3182420939870701,"score_spread":0.22561137514926186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292423539","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.039616797,0.00056077616,0.9377234,0.0016541375,0.00014667137,0.00018475126,0.00008908548,0.00006209289,0.019962287],"genre_scores_gemma":[0.91966665,0.0010284063,0.06741784,0.00019472423,0.00017956173,0.00022335975,0.00005641917,0.00004426162,0.011188718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99591845,0.0018625625,0.00014984333,0.0006422759,0.00070588285,0.0007209315],"domain_scores_gemma":[0.99133193,0.0063008857,0.0009776846,0.00035006454,0.0006483187,0.0003911124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049063833,0.0015322946,0.0024898637,0.0020029482,0.0014046798,0.0061978134,0.0033702527,0.003628549,0.005344442],"category_scores_gemma":[0.009657593,0.0014499009,0.002197276,0.0024562152,0.0037071719,0.0072439513,0.003923392,0.0030812318,0.00029027154],"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.00011733564,0.0001421135,0.0006534877,0.00010631067,0.00010143016,0.00019041241,0.00018431112,0.7630446,0.00066905137,0.22516534,0.0007102738,0.008915332],"study_design_scores_gemma":[0.00002731624,0.00006906427,0.00020115369,0.000023373444,0.000046761044,0.00005085244,0.00019919164,0.8640762,0.00026426002,0.13410738,0.0008999732,0.00003448644],"about_ca_topic_score_codex":0.011543226,"about_ca_topic_score_gemma":0.007773015,"teacher_disagreement_score":0.011543226,"about_ca_system_score_codex":0.00495191,"about_ca_system_score_gemma":0.0044930507,"threshold_uncertainty_score":0.035928786},"labels":[],"label_agreement":null},{"id":"W4296123388","doi":"10.1007/s10479-022-04961-4","title":"RETRACTED ARTICLE: Periapical dental X-ray image classification using deep neural networks","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Dental Radiography and Imaging","field":"Dentistry","cited_by":19,"is_retracted":true,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Convolutional neural network; Artificial intelligence; Deep learning; Artificial neural network; Population; Pattern recognition (psychology); Medicine","score_opus":0.17440988700512516,"score_gpt":0.4461366084309839,"score_spread":0.27172672142585874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296123388","genre_codex":"editorial","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.0012931698,0.0029398464,0.006342391,0.13116917,0.85409236,0.000038670296,0.0010210576,0.000809658,0.0022937148],"genre_scores_gemma":[0.028946552,0.0098652765,0.012123886,0.1239057,0.6905229,0.00013459008,0.0032377858,0.0011778141,0.1300854],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978098,0.00032216753,0.00027853664,0.0002904757,0.0010668414,0.00023218051],"domain_scores_gemma":[0.9817723,0.004519545,0.00054391916,0.00070853013,0.010880682,0.0015751902],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0034568121,0.0010732781,0.0012467152,0.0021172846,0.0013485485,0.0027957868,0.0023885814,0.006500456,0.038070455],"category_scores_gemma":[0.033786554,0.00060112076,0.0011983538,0.0009723633,0.0013336049,0.0019794812,0.0020322034,0.005433763,0.01954176],"study_design_candidate":"bench_or_experimental","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.00012921616,0.000023092953,0.00033526815,0.00018125892,0.000032740172,0.0006012084,0.00002829254,0.00021081339,0.0003238178,0.00034298433,0.96544856,0.032342713],"study_design_scores_gemma":[0.00016103729,0.0001685993,0.0026670587,0.00042350707,0.00016260415,0.0036942873,0.00014856872,0.0051844087,0.0024935843,0.0052601337,0.97954583,0.00009039716],"about_ca_topic_score_codex":0.003993541,"about_ca_topic_score_gemma":0.0076044444,"teacher_disagreement_score":0.9934995,"about_ca_system_score_codex":0.0018397868,"about_ca_system_score_gemma":0.0025987779,"threshold_uncertainty_score":0.12735844},"labels":[],"label_agreement":null},{"id":"W4297200123","doi":"10.1007/s10479-022-04956-1","title":"Location of organ procurement and distribution organisation decisions and their impact on kidney allocations: a developing country perspective","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Organ Donation and Transplantation","field":"Medicine","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Equity (law); Deliberation; Computer science; Procurement; Perspective (graphical); Resource allocation; Theory of computation; Operations research; Organ procurement; Term (time); Microeconomics; Economics; Business; Risk analysis (engineering); Transplantation; Marketing","score_opus":0.1420152940502252,"score_gpt":0.45418507049591694,"score_spread":0.31216977644569177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297200123","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.88955534,0.0019547755,0.056427427,0.0055796867,0.00005179405,0.0000845436,0.0004642034,0.00002821631,0.04585407],"genre_scores_gemma":[0.9973381,0.00066274515,0.000997709,0.000038873193,0.0000058577457,0.000007563473,0.000018640607,0.000003033648,0.0009274189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99838746,0.0011390952,0.000028099585,0.00009169076,0.000090366215,0.00026333643],"domain_scores_gemma":[0.9952166,0.0032645445,0.00087344955,0.00011525494,0.00033675606,0.00019353199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019476125,0.00033544045,0.00044951634,0.00087380223,0.0005691417,0.0030285749,0.00051292434,0.00079778593,0.004140978],"category_scores_gemma":[0.0065927505,0.00031432317,0.00060469296,0.0012875937,0.0017324513,0.0021409488,0.0018973354,0.0012355197,0.00020846407],"study_design_candidate":"observational","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.00034105807,0.0001904422,0.06996468,0.00018586834,0.000237883,0.0015097889,0.0005363586,0.7113945,0.0014061148,0.18774782,0.0008936779,0.025591845],"study_design_scores_gemma":[0.00016717611,0.0009316596,0.091178246,0.00038714395,0.0007458991,0.000816104,0.01002994,0.67648023,0.004047497,0.20093729,0.014065046,0.0002137815],"about_ca_topic_score_codex":0.016211227,"about_ca_topic_score_gemma":0.015778428,"teacher_disagreement_score":0.016211227,"about_ca_system_score_codex":0.003981776,"about_ca_system_score_gemma":0.001994504,"threshold_uncertainty_score":0.032233715},"labels":[],"label_agreement":null},{"id":"W4300865761","doi":"10.1007/s10479-022-04991-y","title":"ORESTE-SORT: a novel multiple criteria sorting method for sorting port group competitiveness","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":21,"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":"National Natural Science Foundation of China","keywords":"Sorting; sort; Theory of computation; Computer science; Port (circuit theory); Sorting algorithm; ELECTRE; Operations research; Generalization; Mathematical optimization; Mathematics; Algorithm; Engineering; Information retrieval; Multiple-criteria decision analysis","score_opus":0.25668775079262823,"score_gpt":0.4617255908704096,"score_spread":0.20503784007778136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300865761","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.036647514,0.00044909722,0.9464496,0.0003283941,0.00032087407,0.0004953569,0.0010449274,0.0039455816,0.010318721],"genre_scores_gemma":[0.13839178,0.00030825066,0.84177125,0.00019402424,0.00016836007,0.00026790338,0.0017273735,0.0004885175,0.01668259],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982009,0.00021370404,0.00015320719,0.00020452391,0.0010141226,0.00021351663],"domain_scores_gemma":[0.9984864,0.0003970664,0.00012082629,0.00020261589,0.0006609543,0.0001321521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012045554,0.0012549686,0.001956004,0.0052109673,0.0017201428,0.0024816615,0.0025320554,0.0012323704,0.012576016],"category_scores_gemma":[0.003232065,0.0004928596,0.0014624512,0.006383017,0.0008303251,0.002610279,0.0018131048,0.0014476245,0.002033424],"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.00061037875,0.00043461373,0.0022925786,0.00046422158,0.00014836986,0.00017839702,0.00023988345,0.043834135,0.0127881905,0.017944008,0.01648404,0.9045811],"study_design_scores_gemma":[0.0003688424,0.00068724056,0.0037762218,0.00010989363,0.00017798552,0.0006490991,0.0005667364,0.8500367,0.027524346,0.05010416,0.06578453,0.00021425422],"about_ca_topic_score_codex":0.011122648,"about_ca_topic_score_gemma":0.019853309,"teacher_disagreement_score":0.012576016,"about_ca_system_score_codex":0.0012817406,"about_ca_system_score_gemma":0.004725886,"threshold_uncertainty_score":0.042070985},"labels":[],"label_agreement":null},{"id":"W4304203128","doi":"10.1007/s10479-022-04595-6","title":"Optimal pricing in the presence of IoT investment and quality-dependent demand","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; American University of Sharjah","keywords":"Stackelberg competition; Supply chain; Context (archaeology); Revenue; Quality (philosophy); Computer science; Internet of Things; Investment (military); Supply chain management; Business; Industrial organization; Marketing; Microeconomics; Computer security; Economics; Finance","score_opus":0.2587012909470079,"score_gpt":0.41643591644433464,"score_spread":0.15773462549732675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4304203128","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.4625445,0.0037235431,0.47842696,0.01592142,0.0011194288,0.0002263957,0.0010501329,0.00038593085,0.03660169],"genre_scores_gemma":[0.9897859,0.00052273425,0.0047079157,0.00014372004,0.0001983123,0.00002017339,0.00011614211,0.00004521796,0.0044597783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99691355,0.0012282531,0.0001292799,0.00048376463,0.0003382861,0.0009067521],"domain_scores_gemma":[0.97731066,0.018570457,0.0015707153,0.00044534527,0.0011278766,0.00097494276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005243615,0.0017478633,0.004676595,0.0011436946,0.001038632,0.0062384647,0.0029576481,0.0053365217,0.005174148],"category_scores_gemma":[0.021431115,0.0031765653,0.001573444,0.0018013691,0.0038519183,0.006774277,0.0023828219,0.0047244504,0.0003184841],"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.00033838532,0.00017272666,0.0017176907,0.0001405461,0.000120294586,0.0005995758,0.000093521805,0.9008155,0.0009780892,0.08788867,0.002461619,0.0046734577],"study_design_scores_gemma":[0.000030096382,0.000035971738,0.00051648647,0.000010753939,0.000029786286,0.000059155413,0.000063036576,0.9687274,0.00009941742,0.030166967,0.00023164412,0.000029235416],"about_ca_topic_score_codex":0.015302115,"about_ca_topic_score_gemma":0.010301662,"teacher_disagreement_score":0.015302115,"about_ca_system_score_codex":0.0035768407,"about_ca_system_score_gemma":0.0028984603,"threshold_uncertainty_score":0.030426085},"labels":[],"label_agreement":null},{"id":"W4306359307","doi":"10.1007/s10479-022-04993-w","title":"Robust multivariate adaptive regression splines under cross-polytope uncertainty: an application in a natural gas market","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":35,"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 Calgary","funders":"","keywords":"Robustification; Multivariate adaptive regression splines; Computer science; Robust optimization; Mathematical optimization; Curse of dimensionality; Interpretability; Uncertainty quantification; Mars Exploration Program; Univariate; Multivariate statistics; Exploit; Nonparametric regression; Regression analysis; Machine learning; Mathematics; Artificial intelligence; Outlier","score_opus":0.4183602756074331,"score_gpt":0.5421433808573288,"score_spread":0.12378310524989572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306359307","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.14096923,0.0006904897,0.8546483,0.000585197,0.000075205804,0.00003471065,0.00008521463,0.0003933545,0.0025183226],"genre_scores_gemma":[0.91739506,0.00065389636,0.07729875,0.00007623836,0.0000980656,0.00005415888,0.00010792701,0.00014039094,0.004175562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991416,0.00048249587,0.000028606393,0.00013369236,0.00011864656,0.00009496387],"domain_scores_gemma":[0.9932776,0.0052866437,0.00047027672,0.00026730497,0.0005411231,0.00015695358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044011157,0.00073219143,0.0020551973,0.0009247719,0.0005082636,0.0015071557,0.0014710837,0.002401829,0.0021042528],"category_scores_gemma":[0.013827357,0.00056936714,0.0012201854,0.0016618487,0.001170709,0.0016895996,0.0013166117,0.0022445014,0.00014954894],"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.00007592136,0.0000442828,0.00039979236,0.000030801788,0.000026363707,0.00006277262,0.000025333451,0.96937346,0.00045364295,0.017156437,0.00031297124,0.012038279],"study_design_scores_gemma":[0.000004713919,0.000013744236,0.00008164182,0.0000020894201,0.000003716254,0.0000043638056,0.0000033122344,0.9973761,0.000051696126,0.0023758558,0.00007816378,0.0000045501633],"about_ca_topic_score_codex":0.010333954,"about_ca_topic_score_gemma":0.0046134265,"teacher_disagreement_score":0.010333954,"about_ca_system_score_codex":0.0009275635,"about_ca_system_score_gemma":0.0011065154,"threshold_uncertainty_score":0.023275614},"labels":[],"label_agreement":null},{"id":"W4308261395","doi":"10.1007/s10479-022-05009-3","title":"Pricing decisions of organic and conventional products in a dual-channel competitive food supply chain","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":18,"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":"Supply chain; Channel (broadcasting); Dual (grammatical number); Business; Revenue; Industrial organization; Organic product; Channel coordination; Product (mathematics); Supply chain management; Agriculture; Environmental economics; Computer science; Marketing; Economics; Telecommunications; Mathematics","score_opus":0.16977889928062778,"score_gpt":0.35191420047887007,"score_spread":0.18213530119824228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308261395","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.99364626,0.00007368744,0.0021955224,0.00016268318,0.000018628403,0.00004107579,0.000050742052,0.000011259017,0.003800118],"genre_scores_gemma":[0.9964289,0.000059030084,0.0006859643,0.000013414035,0.0000057547427,0.000008065143,0.00002851491,0.0000038802705,0.0027665328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912554,0.0002489014,0.000028420864,0.00010970556,0.00015585762,0.00033147234],"domain_scores_gemma":[0.99653184,0.0024880075,0.00021287803,0.000051983658,0.00043764134,0.0002775521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017571594,0.00038439027,0.0006254382,0.0010229888,0.0010811455,0.0035815055,0.0009977462,0.0015725526,0.007911797],"category_scores_gemma":[0.0036997627,0.00066832104,0.00070310524,0.000951537,0.001118631,0.0022808774,0.0007868287,0.00083415466,0.0004435306],"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.012299081,0.0022161847,0.04002433,0.00027113245,0.00016383415,0.0040974817,0.001279874,0.8101553,0.025379192,0.0346294,0.0034718823,0.0660123],"study_design_scores_gemma":[0.00022135553,0.0012761909,0.015466939,0.00003249971,0.00012000669,0.00015932742,0.0019927109,0.9682952,0.0029153968,0.008387024,0.0010349975,0.00009838136],"about_ca_topic_score_codex":0.0152315395,"about_ca_topic_score_gemma":0.017905928,"teacher_disagreement_score":0.0152315395,"about_ca_system_score_codex":0.0035356327,"about_ca_system_score_gemma":0.0016576026,"threshold_uncertainty_score":0.030285776},"labels":[],"label_agreement":null},{"id":"W4308967276","doi":"10.1007/s10479-022-05059-7","title":"Co-movements, option pricing and risk management: an application to WTI versus Brent spread options","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Financial Risk and Volatility Modeling","field":"Economics, Econometrics and Finance","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":"Carleton University","funders":"Università della Calabria","keywords":"Econometrics; Greeks; Portfolio; Skewness; Volatility (finance); Bivariate analysis; Risk management; Economics; Project portfolio management; Probability distribution; Value at risk; Financial economics; Mathematics; Finance; Statistics","score_opus":0.21671117350521446,"score_gpt":0.41618152219634086,"score_spread":0.1994703486911264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308967276","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.5197434,0.005364494,0.4691569,0.0018698432,0.00011939346,0.00005209109,0.00037348605,0.0002700218,0.0030503953],"genre_scores_gemma":[0.9267603,0.0017099775,0.06978999,0.000069355214,0.00022246136,0.00003362494,0.00032876103,0.00008420754,0.0010012958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993038,0.0003557699,0.000051441508,0.0001216646,0.00012545042,0.00004184503],"domain_scores_gemma":[0.9878997,0.009918672,0.0009730554,0.00062816095,0.00030885157,0.00027140812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035898893,0.0007538476,0.0011002325,0.0019065802,0.0006066586,0.0020871826,0.00086663355,0.0015520975,0.001387119],"category_scores_gemma":[0.018155856,0.00023185016,0.00092821673,0.0029800464,0.0012020693,0.0029037404,0.0014879714,0.0017158777,0.00012898879],"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.00026808435,0.00018936022,0.03792354,0.00023210814,0.00021924585,0.0014253496,0.00062230864,0.64939815,0.0065848916,0.1680427,0.0018882148,0.13320597],"study_design_scores_gemma":[0.000008211807,0.000032792675,0.0031201446,0.000015983229,0.000012334909,0.00022100096,0.0000657679,0.94008046,0.00056131784,0.05515618,0.00070588506,0.000019877665],"about_ca_topic_score_codex":0.002851837,"about_ca_topic_score_gemma":0.0017443498,"teacher_disagreement_score":0.0035898893,"about_ca_system_score_codex":0.0005559434,"about_ca_system_score_gemma":0.00033866367,"threshold_uncertainty_score":0.018985331},"labels":[],"label_agreement":null},{"id":"W4309231192","doi":"10.1007/s10479-022-05051-1","title":"Theory, computation, and practice of multiobjective optimisation","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Theory of computation; Computation; Computer science; Mathematical optimization; Multi-objective optimization; Mathematical economics; Mathematics; Algorithm","score_opus":0.15642541301236748,"score_gpt":0.4730439202187418,"score_spread":0.3166185072063743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309231192","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.0021204466,0.034050696,0.90623266,0.01116632,0.0013561536,0.00012518895,0.00012876131,0.0001452939,0.044674486],"genre_scores_gemma":[0.19699752,0.042476855,0.7411262,0.0031792133,0.0036575978,0.0012268043,0.00034224347,0.000229066,0.010764497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9869687,0.007837225,0.0008375818,0.0012333284,0.0028286641,0.00029451557],"domain_scores_gemma":[0.98065555,0.015013095,0.0009312801,0.0019850263,0.0011170065,0.00029811694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010182213,0.001541038,0.0024049284,0.0030671442,0.0012944803,0.0073315953,0.00199409,0.003148609,0.0069748606],"category_scores_gemma":[0.022842424,0.0007715196,0.0023088688,0.0041286065,0.011858841,0.0051524956,0.0037900277,0.0063795852,0.0015416925],"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.000011655363,0.000026871081,0.00032455413,0.00063007395,0.00008839978,0.000057878864,0.00019361539,0.02802561,0.00023416964,0.9231622,0.00661383,0.04063115],"study_design_scores_gemma":[0.000008626462,0.000017862294,0.00014941617,0.00023300367,0.000013966362,0.0000572136,0.000050901148,0.029712912,0.00011540361,0.94435245,0.025271624,0.000016603759],"about_ca_topic_score_codex":0.0019247989,"about_ca_topic_score_gemma":0.0013069808,"teacher_disagreement_score":0.010182213,"about_ca_system_score_codex":0.0041072643,"about_ca_system_score_gemma":0.0037417463,"threshold_uncertainty_score":0.05384934},"labels":[],"label_agreement":null},{"id":"W4311730047","doi":"10.1007/s10479-022-05120-5","title":"A Stackelberg order execution game","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Financial Markets and Investment Strategies","field":"Economics, Econometrics and Finance","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 New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Stackelberg competition; Nash equilibrium; Trading strategy; Computer science; Mathematical economics; Theory of computation; Order (exchange); Algorithmic trading; Portfolio; Sequential game; Price of anarchy; Game theory; Economics; Price of stability; Finance","score_opus":0.30203348473901453,"score_gpt":0.3929325921101922,"score_spread":0.09089910737117768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311730047","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.24427031,0.0003456122,0.68607146,0.0032401567,0.00023868859,0.00029409793,0.0005098678,0.00032734236,0.06470246],"genre_scores_gemma":[0.91618276,0.0004595028,0.05352467,0.00019180115,0.000116332834,0.00019707186,0.0002196186,0.00004160407,0.02906661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883956,0.00038421838,0.000070325936,0.00019660147,0.00030234046,0.00020698071],"domain_scores_gemma":[0.99709344,0.0019639127,0.00020570777,0.00015290854,0.00026360754,0.00032029266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001710979,0.000880733,0.0012856673,0.0006087419,0.0010005002,0.0035077694,0.0012620938,0.0024088796,0.007852374],"category_scores_gemma":[0.005502621,0.0005627622,0.0009502178,0.00089802226,0.0016790952,0.003900189,0.00131626,0.0021624444,0.0007212692],"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.00028954304,0.00020108379,0.0007065383,0.00007722844,0.000061963365,0.00035782237,0.00019551929,0.19524218,0.0020077291,0.7806655,0.0030092997,0.017185584],"study_design_scores_gemma":[0.0001264118,0.00014787243,0.00014658504,0.000013646254,0.000032709726,0.000079880134,0.000052046555,0.55469155,0.00049949135,0.4420261,0.0021543482,0.000029374602],"about_ca_topic_score_codex":0.0043382277,"about_ca_topic_score_gemma":0.0023797068,"teacher_disagreement_score":0.007852374,"about_ca_system_score_codex":0.001376657,"about_ca_system_score_gemma":0.0030825739,"threshold_uncertainty_score":0.02626884},"labels":[],"label_agreement":null},{"id":"W4317207528","doi":"10.1007/s10479-023-05171-2","title":"Continuous review (s, Q) inventory system at a service facility with positive order lead times","year":2023,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Queuing Theory Analysis","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":"Wilfrid Laurier University","funders":"National Board for Higher Mathematics","keywords":"Lead time; Operations research; Poisson distribution; Computer science; Random variable; Markov chain; Queueing theory; Joint probability distribution; Service (business); Exponential distribution; Queue; Stockout; Mathematical optimization; Operations management; Statistics; Mathematics; Business; Economics; Computer network; Marketing","score_opus":0.1318013077925689,"score_gpt":0.391614083969483,"score_spread":0.2598127761769141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317207528","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.8443485,0.00076812063,0.13409945,0.0027861714,0.0003433062,0.00041067,0.0017960428,0.0015231331,0.013924602],"genre_scores_gemma":[0.9884162,0.00009932635,0.0044997274,0.00009614269,0.00008718649,0.00005745225,0.00015258862,0.00003201434,0.006559333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99670666,0.00077580987,0.00016878241,0.0007482431,0.00053583155,0.0010646551],"domain_scores_gemma":[0.98618823,0.0074003655,0.0016719914,0.00060528464,0.0024168638,0.0017172243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030549297,0.0011789802,0.002765141,0.001651864,0.0027923165,0.004555058,0.004170795,0.005192557,0.0071996823],"category_scores_gemma":[0.009854865,0.0013096662,0.0013945271,0.0024493516,0.00243731,0.0020154333,0.001994819,0.0016946726,0.0013923642],"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.0042844424,0.000966161,0.015719296,0.0004992427,0.00033709005,0.010061438,0.0005365581,0.8720968,0.021664506,0.034265276,0.011512445,0.028056791],"study_design_scores_gemma":[0.0001928017,0.0005156033,0.0036014072,0.000017026516,0.00010531797,0.000721304,0.00012926466,0.9882714,0.0011800572,0.004506203,0.0006534631,0.00010618084],"about_ca_topic_score_codex":0.02942823,"about_ca_topic_score_gemma":0.01925376,"teacher_disagreement_score":0.02942823,"about_ca_system_score_codex":0.0035659098,"about_ca_system_score_gemma":0.0038619672,"threshold_uncertainty_score":0.05851388},"labels":[],"label_agreement":null},{"id":"W4319224593","doi":"10.1007/s10479-023-05208-6","title":"Innovation in humanitarian logistics and supply chain management: a systematic review","year":2023,"lang":"en","type":"review","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Red Cross Society","funders":"","keywords":"Supply chain; Business; Humanitarian Logistics; Beneficiary; Supply chain management; Context (archaeology); Humanitarian aid; Position (finance); Industrial organization; Knowledge management; Marketing; Economics; Economic growth; Computer science","score_opus":0.49426457206077196,"score_gpt":0.4857105513754828,"score_spread":0.008554020685289154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319224593","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057323836,0.9987816,0.000092006005,0.00015154752,0.00007481869,0.0001367201,0.00010009077,0.0000029697744,0.00008699637],"genre_scores_gemma":[0.012057436,0.9866036,0.0005536912,0.0004087474,0.000061899715,0.00019730646,0.0000621017,0.0000030119775,0.000052114498],"study_design_codex":"systematic_review","study_design_gemma":"systematic_review","domain_scores_codex":[0.98769695,0.0044551515,0.004010597,0.0011319205,0.0022540994,0.00045141522],"domain_scores_gemma":[0.94295746,0.04455684,0.008077461,0.0007402034,0.003062117,0.00060580263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015201837,0.001563202,0.009027532,0.012810408,0.0007610908,0.0049265455,0.0021942495,0.003621102,0.0044666026],"category_scores_gemma":[0.052523527,0.0014118582,0.007883935,0.013562417,0.0017173518,0.0043865205,0.002555008,0.0021938737,0.00027105873],"study_design_candidate":"systematic_review","study_design_consensus":"systematic_review","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.0001537535,0.000036100726,0.0010872923,0.94448227,0.010282759,0.000104709674,0.00039949061,0.000106003485,0.000091752365,0.00032372214,0.0011541226,0.041778],"study_design_scores_gemma":[0.00031486983,0.00017486396,0.0047072885,0.91231173,0.06760063,0.00029201794,0.0006565324,0.000103945495,0.000088433546,0.00044819975,0.013249456,0.00005195602],"about_ca_topic_score_codex":0.012532959,"about_ca_topic_score_gemma":0.053448267,"teacher_disagreement_score":0.015201837,"about_ca_system_score_codex":0.005017866,"about_ca_system_score_gemma":0.021749258,"threshold_uncertainty_score":0.08039594},"labels":[],"label_agreement":null},{"id":"W4323048157","doi":"10.1007/s10479-023-05225-5","title":"RETRACTED ARTICLE: Assessment of airline industry using a new double-frontier cross-efficiency method based on prospect theory","year":2023,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":10,"is_retracted":true,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Viewpoints; Ranking (information retrieval); Frontier; Data envelopment analysis; Pairwise comparison; Computer science; Theory of computation; Efficient frontier; Operations research; Pessimism; Econometrics; Microeconomics; Management science; Economics; Artificial intelligence; Mathematics; Mathematical optimization; Algorithm; Political science; Financial economics; Epistemology","score_opus":0.5773306934951713,"score_gpt":0.6540406258013872,"score_spread":0.07670993230621592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323048157","genre_codex":"editorial","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.0048572663,0.0036156913,0.018768447,0.23743959,0.7240683,0.00013759347,0.0016765802,0.0008249722,0.008611616],"genre_scores_gemma":[0.10679272,0.008680099,0.03510621,0.1602883,0.4342002,0.0003979642,0.0027861316,0.0011120867,0.25063634],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.99578804,0.0009897791,0.00045812747,0.00042930228,0.0021152238,0.00021954653],"domain_scores_gemma":[0.96853507,0.01348866,0.00091390463,0.00134082,0.014509304,0.0012122566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055745384,0.0011955708,0.0012456474,0.002327315,0.0015139845,0.0031085236,0.0028030109,0.008250814,0.01681441],"category_scores_gemma":[0.04969133,0.00042171098,0.0010683745,0.0014537522,0.0017520997,0.0023712395,0.0014116592,0.0063004796,0.008154852],"study_design_candidate":"observational","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.00011824183,0.000081779624,0.0007190813,0.00022892262,0.00004478402,0.0007575914,0.000084175146,0.0005488013,0.000525542,0.0031670658,0.95900846,0.034715652],"study_design_scores_gemma":[0.00013894966,0.0002688297,0.007818331,0.00043932418,0.00014979645,0.0016581368,0.0004119674,0.0072992267,0.0026495866,0.012540044,0.9664941,0.0001316553],"about_ca_topic_score_codex":0.0053602215,"about_ca_topic_score_gemma":0.007024104,"teacher_disagreement_score":0.01681441,"about_ca_system_score_codex":0.001956365,"about_ca_system_score_gemma":0.0022617844,"threshold_uncertainty_score":0.056249797},"labels":[],"label_agreement":null},{"id":"W4353084216","doi":"10.1007/s10479-023-05273-x","title":"Evaluating the optimal timing and capacity of investments in flexible combined heat and power generation for energy-intensive industries","year":2023,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Capital Investment and Risk Analysis","field":"Economics, Econometrics and Finance","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Hellenic Academic Libraries Link; Egg Farmers of Canada","keywords":"Flexibility (engineering); Electricity; Computer science; Grid; Investment (military); Electric power system; Environmental economics; Electricity generation; Operations research; Economics; Risk analysis (engineering); Operations management; Business; Industrial organization; Power (physics); Engineering","score_opus":0.6164744142417679,"score_gpt":0.462111851786936,"score_spread":0.15436256245483188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4353084216","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.97809917,0.00030869155,0.017176481,0.0003315011,0.000014586305,0.000048285452,0.00030973426,0.00003912368,0.0036725458],"genre_scores_gemma":[0.9988085,0.000036891153,0.000829085,0.0000061672354,0.0000021333772,0.000008438556,0.000036397192,0.0000034263728,0.00026897423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992471,0.0003355204,0.000025673258,0.00010125174,0.0000780086,0.00021246393],"domain_scores_gemma":[0.99075466,0.006974998,0.0012475846,0.0002600922,0.0001916211,0.000571066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035199947,0.000600498,0.0007038178,0.0006385043,0.00031378664,0.0018050513,0.0006810695,0.0014293226,0.002921531],"category_scores_gemma":[0.00990979,0.00070938945,0.00060347235,0.0006001908,0.0010275925,0.001694638,0.00082685036,0.0012932245,0.00015785881],"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.0003474743,0.0000647859,0.0043023927,0.000029203216,0.00002785331,0.00007321356,0.000014084201,0.9878852,0.00070895767,0.0039250148,0.00013221178,0.0024896858],"study_design_scores_gemma":[0.000071458926,0.00030660696,0.0060367645,0.000019397958,0.000043169188,0.000023671913,0.000103061924,0.9855289,0.0015855188,0.0059946687,0.00025551653,0.000031267256],"about_ca_topic_score_codex":0.008369991,"about_ca_topic_score_gemma":0.0060263886,"teacher_disagreement_score":0.008369991,"about_ca_system_score_codex":0.0025943543,"about_ca_system_score_gemma":0.0013319446,"threshold_uncertainty_score":0.018823445},"labels":[],"label_agreement":null},{"id":"W4367044514","doi":"10.1007/s10479-023-05344-z","title":"Editorial: Big data and data science in sport","year":2023,"lang":"en","type":"editorial","venue":"Annals of Operations Research","topic":"Big Data and Business Intelligence","field":"Business, Management and Accounting","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":"Simon Fraser University","funders":"","keywords":"Theory of computation; Big data; Computer science; Data science; Sports science; Political science; Data mining; Algorithm","score_opus":0.5460397729967867,"score_gpt":0.5238002129400025,"score_spread":0.02223956005678429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367044514","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017939032,0.0026292773,0.00006764576,0.029141888,0.9667565,0.000020354182,0.00006451124,0.000039355655,0.0012624467],"genre_scores_gemma":[0.00021229063,0.0015616145,0.00006179306,0.014832237,0.9765087,0.000023738256,0.000038023518,0.000034444354,0.006727167],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98812383,0.002420669,0.0012555791,0.00130447,0.0061025685,0.00079291005],"domain_scores_gemma":[0.94861156,0.020827241,0.0027335838,0.0013068229,0.018147022,0.008373778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012903109,0.0059701824,0.0069708494,0.0090633975,0.0070728147,0.018484022,0.005672925,0.028902762,0.028911958],"category_scores_gemma":[0.048047215,0.0019523537,0.0043838685,0.0038427042,0.00429421,0.0066456287,0.0028038784,0.024130477,0.018562043],"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.00002250499,0.00000977705,0.000014112398,0.00007845348,0.000011968084,0.00004581745,0.0000057927437,0.000012940634,0.000016527018,0.00012405327,0.9983127,0.0013451512],"study_design_scores_gemma":[0.00015536221,0.000034024266,0.00040702787,0.0007021529,0.00009323898,0.00018058601,0.000071301976,0.00029477818,0.00007477287,0.0020580404,0.9958937,0.00003492676],"about_ca_topic_score_codex":0.0043864665,"about_ca_topic_score_gemma":0.015505838,"teacher_disagreement_score":0.028911958,"about_ca_system_score_codex":0.005757609,"about_ca_system_score_gemma":0.0071302303,"threshold_uncertainty_score":0.0967201},"labels":[],"label_agreement":null},{"id":"W4376635848","doi":"10.1007/s10479-023-05386-3","title":"Assessing the potential of plastic waste management in the circular economy: a longitudinal case study in an emerging economy","year":2023,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Microplastics and Plastic Pollution","field":"Environmental Science","cited_by":41,"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 Sherbrooke","funders":"National Natural Science Foundation of China","keywords":"Circular economy; Theory of computation; Business management; Economics; Economy; Business; Computer science","score_opus":0.19658187252923973,"score_gpt":0.43893425368662053,"score_spread":0.2423523811573808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376635848","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.9994735,0.000016785383,0.00011158695,0.00005761011,7.694475e-7,0.000011407982,0.000019103136,7.495388e-7,0.00030862787],"genre_scores_gemma":[0.999363,0.00003872514,0.00018995887,0.000010642256,0.0000013826234,0.000010378471,0.000036341935,7.277442e-7,0.00034874934],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99915147,0.00047377378,0.000028843691,0.00006854981,0.00005590509,0.00022154523],"domain_scores_gemma":[0.9950374,0.002920594,0.0008322617,0.00021127304,0.00048380558,0.0005146563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032210846,0.0003275284,0.00030251505,0.00085562177,0.0019840845,0.0018863631,0.0009522975,0.0016403353,0.0018238914],"category_scores_gemma":[0.0058962256,0.00025000793,0.0005017132,0.000979606,0.0012207569,0.0017752657,0.0015451118,0.0012328605,0.00023293188],"study_design_candidate":"observational","study_design_consensus":"observational","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.0020587908,0.014745457,0.9011196,0.00009353553,0.00018378049,0.0042689107,0.009278829,0.031157415,0.0016636874,0.009235223,0.0008660656,0.025328698],"study_design_scores_gemma":[0.00036404142,0.011183392,0.5967889,0.00017609686,0.0005163109,0.0012138812,0.15281457,0.21521042,0.006122737,0.009691865,0.0057077883,0.00021003578],"about_ca_topic_score_codex":0.04475779,"about_ca_topic_score_gemma":0.061384145,"teacher_disagreement_score":0.04475779,"about_ca_system_score_codex":0.0029788015,"about_ca_system_score_gemma":0.0026151736,"threshold_uncertainty_score":0.0889945},"labels":[],"label_agreement":null},{"id":"W4380153691","doi":"10.1007/s10479-023-05397-0","title":"Integrated optimal scheduling and routing of repair crew and relief vehicles after disaster: a novel hybrid solution approach","year":2023,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":13,"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":"Crew; Computer science; Scheduling (production processes); Mathematical optimization; Benders' decomposition; Integer programming; Theory of computation; Routing (electronic design automation); Vehicle routing problem; Heuristic; Decomposition; Operations research; Algorithm; Engineering; Mathematics; Computer network","score_opus":0.17577220313584024,"score_gpt":0.36339388753366053,"score_spread":0.1876216843978203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380153691","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.06412419,0.0003345064,0.92483634,0.0003063184,0.00015053002,0.0001564062,0.00014161394,0.00032955754,0.009620646],"genre_scores_gemma":[0.7277179,0.0002628761,0.26372203,0.00016413594,0.0001701905,0.00029433146,0.0002437362,0.0001316084,0.0072931848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994437,0.00016371509,0.000020473628,0.00010818089,0.00011280628,0.00015111381],"domain_scores_gemma":[0.9993754,0.0003308108,0.00007424524,0.00003519698,0.00011158016,0.00007278205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010353132,0.0013389431,0.0015890358,0.0014815179,0.0007173287,0.0018751589,0.002542164,0.002328674,0.004409458],"category_scores_gemma":[0.0013932567,0.0011683305,0.0016872366,0.0014704543,0.0006191933,0.0012489021,0.0014594439,0.0009792439,0.00035927293],"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.00006130615,0.00007940039,0.0001720366,0.000032740423,0.000047126472,0.000044057644,0.000025830492,0.98565996,0.00070031016,0.0020708237,0.0004348242,0.010671524],"study_design_scores_gemma":[0.000011224022,0.000025737438,0.000041117088,0.0000017159329,0.000009712247,0.00000613158,0.000011239939,0.9990269,0.00007369389,0.0006825247,0.000107163665,0.0000028456634],"about_ca_topic_score_codex":0.0096294675,"about_ca_topic_score_gemma":0.00931281,"teacher_disagreement_score":0.0096294675,"about_ca_system_score_codex":0.0010829221,"about_ca_system_score_gemma":0.0021027045,"threshold_uncertainty_score":0.0191468},"labels":[],"label_agreement":null},{"id":"W4384662317","doi":"10.1007/s10479-023-05500-5","title":"Cryptocurrency markets, macroeconomic news announcements and energy consumption","year":2023,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Blockchain Technology Applications and Security","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 Ottawa; Brock University","funders":"","keywords":"Cryptocurrency; Liberian dollar; Consumption (sociology); Volume (thermodynamics); Economics; Monetary economics; Carbon footprint; Index (typography); Footprint; Financial economics; Econometrics; Computer science; Finance; Computer security","score_opus":0.15509522910243845,"score_gpt":0.41539369290387507,"score_spread":0.2602984638014366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384662317","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.9545765,0.008432944,0.0032657967,0.012212134,0.00025068986,0.00001915121,0.0019273199,0.00008534786,0.019230101],"genre_scores_gemma":[0.99551445,0.0013768007,0.000078389596,0.00008887933,0.00010282198,0.0000031900295,0.00031946204,0.000007105726,0.0025090545],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99975246,0.000068492795,0.00002252653,0.00003702002,0.000060802264,0.000058701826],"domain_scores_gemma":[0.97727305,0.015100563,0.005821156,0.0003753259,0.0008363607,0.0005935645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013695465,0.00019439137,0.00033999718,0.00095750095,0.0003954896,0.0035583845,0.00032072485,0.001541871,0.010841946],"category_scores_gemma":[0.014344917,0.0002699868,0.00023312852,0.0019760986,0.00075007416,0.0034841741,0.0004396662,0.0016592947,0.0007918012],"study_design_candidate":"observational","study_design_consensus":"observational","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.004635445,0.0014292833,0.62431073,0.0006533768,0.00059031363,0.0014754878,0.000989431,0.05307444,0.0029101528,0.19290337,0.030985264,0.08604269],"study_design_scores_gemma":[0.00036667517,0.00055864704,0.4680583,0.00024638616,0.0005125759,0.00057093205,0.0036569664,0.18497987,0.0029943683,0.31715548,0.020709177,0.0001905414],"about_ca_topic_score_codex":0.006177189,"about_ca_topic_score_gemma":0.008205179,"teacher_disagreement_score":0.010841946,"about_ca_system_score_codex":0.00109425,"about_ca_system_score_gemma":0.0007535208,"threshold_uncertainty_score":0.036269903},"labels":[],"label_agreement":null},{"id":"W4385271570","doi":"10.1007/s10479-023-05525-w","title":"Extended replacement policy for a system under shocks effect","year":2023,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Reliability and Maintenance Optimization","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":"Simon Fraser University","funders":"","keywords":"Shock (circulatory); Generalization; Unit (ring theory); Theory of computation; Catastrophic failure; Minor (academic); Computer science; Mathematics; Physics; Mathematical analysis; Algorithm; Thermodynamics","score_opus":0.1204904495290139,"score_gpt":0.4389525915870206,"score_spread":0.3184621420580067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385271570","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.59538436,0.0008900168,0.38682118,0.0028762002,0.000400909,0.00019016444,0.00063934067,0.00091345457,0.011884419],"genre_scores_gemma":[0.987703,0.00011837974,0.007373169,0.00007016029,0.00005438879,0.000029109695,0.000074405136,0.000026190846,0.004551185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994874,0.00017342539,0.000026785583,0.00008668008,0.00007475825,0.00015100632],"domain_scores_gemma":[0.9983406,0.0008521852,0.0001898373,0.0001740836,0.00028555686,0.00015781772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014350783,0.0007784758,0.0013637455,0.00066907174,0.00050199113,0.0011734193,0.0014127041,0.0018935979,0.005037485],"category_scores_gemma":[0.00361695,0.00039840332,0.00054720225,0.0005421852,0.0007460955,0.0012403623,0.0007996629,0.0012001662,0.00038724978],"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.0006874208,0.00009104036,0.0008310759,0.00014432364,0.0000638412,0.00047332366,0.000084175284,0.9509175,0.0065252893,0.020546421,0.002288461,0.017347055],"study_design_scores_gemma":[0.000046465066,0.00014497289,0.00078316533,0.000011609632,0.000036300436,0.00007742985,0.000031216652,0.9859291,0.00057539664,0.011870602,0.0004798826,0.000013878806],"about_ca_topic_score_codex":0.0034517418,"about_ca_topic_score_gemma":0.001631506,"teacher_disagreement_score":0.005037485,"about_ca_system_score_codex":0.00088821066,"about_ca_system_score_gemma":0.001090446,"threshold_uncertainty_score":0.01685208},"labels":[],"label_agreement":null},{"id":"W4385970884","doi":"10.1007/s10479-023-05464-6","title":"Modeling the impact of IoT technology on food supply chain operations","year":2023,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Food Waste Reduction and Sustainability","field":"Agricultural and Biological Sciences","cited_by":21,"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","keywords":"Supply chain; Product (mathematics); Business; Food waste; Environmental economics; Investment (military); Internet of Things; Quality (philosophy); Sustainability; Industrial organization; Supply chain management; Resilience (materials science); Food chain; Computer science; Marketing; Economics; Computer security; Waste management; Engineering","score_opus":0.24903448744701578,"score_gpt":0.44969558985383157,"score_spread":0.20066110240681578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385970884","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.8774233,0.0005902082,0.07690569,0.0017007159,0.0002525226,0.00010400774,0.0008258966,0.00016312965,0.042034596],"genre_scores_gemma":[0.992117,0.0002232167,0.0025923364,0.000042879437,0.000017387292,0.00002936453,0.00010583199,0.00001555645,0.004856392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970895,0.00008094722,0.000011212656,0.000048357047,0.000045688885,0.000104897845],"domain_scores_gemma":[0.9988458,0.00082667236,0.00010424218,0.00004291518,0.00010436512,0.00007610261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057984795,0.00084925577,0.0005183509,0.0005212148,0.0005036739,0.0016195748,0.0008865682,0.0018781278,0.004891214],"category_scores_gemma":[0.0019970662,0.00056611386,0.0009195572,0.00083174335,0.00079893507,0.002173463,0.00088169565,0.0010404746,0.00030491577],"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.000023686722,0.000031292544,0.0007495582,0.000010572798,0.0000075002686,0.00002772535,0.000009484546,0.9957545,0.00025354422,0.0018599015,0.0001203114,0.0011518875],"study_design_scores_gemma":[0.000004223594,0.000021698186,0.0003147209,0.0000026095383,0.0000050110852,0.0000054615944,0.000024720437,0.9980254,0.00010881506,0.0013135163,0.00017050824,0.0000032911046],"about_ca_topic_score_codex":0.02783843,"about_ca_topic_score_gemma":0.013739742,"teacher_disagreement_score":0.02783843,"about_ca_system_score_codex":0.0015553508,"about_ca_system_score_gemma":0.001337178,"threshold_uncertainty_score":0.055352807},"labels":[],"label_agreement":null},{"id":"W4386689328","doi":"10.1007/s10479-023-05564-3","title":"The use of multi-criteria decision-making methods in project portfolio selection: a literature review and future research directions","year":2023,"lang":"en","type":"review","venue":"Annals of Operations Research","topic":"Construction Project Management and Performance","field":"Decision Sciences","cited_by":55,"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 Ottawa","funders":"","keywords":"Selection (genetic algorithm); Portfolio; Management science; Computer science; Project portfolio management; Operations research; Engineering; Artificial intelligence; Systems engineering; Business; Project management; Finance","score_opus":0.8088985225331905,"score_gpt":0.7092712999237242,"score_spread":0.09962722260946633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386689328","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002462908,0.99782085,0.0011307107,0.00031135583,0.000087689135,0.000014976397,0.000016722744,0.0000028663096,0.00036848997],"genre_scores_gemma":[0.004079091,0.99185574,0.003616907,0.00019424294,0.00013798117,0.000027592787,0.000021209818,0.0000024589967,0.000064808955],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.99308974,0.0029105789,0.0011512325,0.00064757385,0.0020606485,0.0001402804],"domain_scores_gemma":[0.9480549,0.0447123,0.0024725024,0.00045001513,0.0040747416,0.00023556416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016837912,0.0015283397,0.004744808,0.009432074,0.00053149473,0.004651751,0.002196811,0.00196667,0.003135226],"category_scores_gemma":[0.02651302,0.0007030898,0.002658823,0.017438905,0.0011292875,0.003661436,0.0013376698,0.0021213475,0.00043272533],"study_design_candidate":"systematic_review","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.00008226882,0.00013053285,0.0009781322,0.08741519,0.0010751004,0.00008237756,0.00013634932,0.0013721394,0.0002651305,0.0050995187,0.0026248898,0.9007383],"study_design_scores_gemma":[0.0002856816,0.0012941094,0.022433443,0.388396,0.013701409,0.0028473248,0.0022015779,0.012538146,0.002180217,0.043641493,0.50983,0.00065058324],"about_ca_topic_score_codex":0.0030873662,"about_ca_topic_score_gemma":0.0066785375,"teacher_disagreement_score":0.016837912,"about_ca_system_score_codex":0.001780232,"about_ca_system_score_gemma":0.0046787593,"threshold_uncertainty_score":0.089048445},"labels":[],"label_agreement":null},{"id":"W4387770819","doi":"10.1007/s10479-023-05630-w","title":"Two-stage nodal network interdiction under decision-dependent uncertainty","year":2023,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Infrastructure Resilience and Vulnerability Analysis","field":"Engineering","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":"Social Sciences and Humanities Research Council of Canada; U.S. Department of Homeland Security","keywords":"Interdiction; Computer science; Operations research; Benchmark (surveying); Shortest path problem; Mathematical optimization; Theory of computation; Robust optimization; Constraint (computer-aided design); Plan (archaeology); Path (computing); Bottleneck; Computer network; Graph; Algorithm; Mathematics; Theoretical computer science","score_opus":0.11209678160355414,"score_gpt":0.4349335061352933,"score_spread":0.32283672453173917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387770819","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.37518868,0.0005943087,0.6028345,0.0010406082,0.00016600515,0.0002874887,0.000683946,0.00021677351,0.018987756],"genre_scores_gemma":[0.9713371,0.00012859706,0.018486766,0.000042243013,0.000028775657,0.00009625507,0.00013672256,0.000029809502,0.00971368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811304,0.0008233214,0.0000624035,0.00031451692,0.00015834326,0.00052842504],"domain_scores_gemma":[0.9897215,0.008241443,0.0005021929,0.00041593704,0.0006968066,0.00042215482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004192615,0.0010291983,0.0031383126,0.0008803957,0.0009751572,0.0021678736,0.0038038509,0.0031353605,0.009355899],"category_scores_gemma":[0.008549075,0.0014735942,0.0014347914,0.0011827687,0.0023634972,0.0034048124,0.0029654077,0.0018312146,0.00047082527],"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.0002910337,0.000049958897,0.0005402868,0.000056048724,0.00004918398,0.00018520957,0.000046478784,0.9839843,0.00039090382,0.010979796,0.00032799502,0.00309888],"study_design_scores_gemma":[0.000016816122,0.000043732995,0.00014142868,0.0000041011217,0.000013555448,0.000012261871,0.000016754748,0.99397695,0.0001266253,0.0055730944,0.000063038126,0.0000116764595],"about_ca_topic_score_codex":0.01185115,"about_ca_topic_score_gemma":0.011878313,"teacher_disagreement_score":0.01185115,"about_ca_system_score_codex":0.0019938177,"about_ca_system_score_gemma":0.0022365279,"threshold_uncertainty_score":0.031298637},"labels":[],"label_agreement":null},{"id":"W4387970997","doi":"10.1007/s10479-023-05620-y","title":"Healthcare inventory management in the presence of supply disruptions and a reliable secondary supplier","year":2023,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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 Toronto","funders":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Economic shortage; Supply chain; Operations research; Theory of computation; Health care; Duration (music); Supply chain management; Inventory management; Operations management; Markov decision process; Computer science; Markov chain; Sensitivity (control systems); Business; Markov process; Economics; Marketing; Mathematics; Engineering","score_opus":0.17515398807690405,"score_gpt":0.4026356781810077,"score_spread":0.22748169010410366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387970997","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.95683795,0.0008842053,0.026486054,0.0049878284,0.0002189789,0.00010388753,0.00038096838,0.00013382186,0.009966348],"genre_scores_gemma":[0.9985268,0.00008102688,0.0008464725,0.000026621623,0.00003596664,0.000003479956,0.00003261986,0.0000031784443,0.00044382917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998511,0.0004551659,0.000113935894,0.00017574486,0.0003182893,0.0004258976],"domain_scores_gemma":[0.99313545,0.0035420924,0.0015131992,0.000195379,0.00093048025,0.00068350567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002494444,0.0004900416,0.0007315239,0.0011237169,0.0010683342,0.0034512677,0.0009883351,0.0015768064,0.004054527],"category_scores_gemma":[0.009635335,0.00044191003,0.00038006474,0.0013120458,0.0008443596,0.0016715506,0.0012899934,0.0008938284,0.00031651897],"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.0058864756,0.00081736105,0.37289742,0.00042735305,0.00044066142,0.04796008,0.0038993927,0.438687,0.0074786628,0.02399404,0.01427413,0.08323742],"study_design_scores_gemma":[0.00014305503,0.0013644693,0.093408026,0.0001441645,0.00025177628,0.006937681,0.014998917,0.8551035,0.0030376837,0.019742569,0.004733114,0.00013507827],"about_ca_topic_score_codex":0.011858634,"about_ca_topic_score_gemma":0.008539658,"teacher_disagreement_score":0.011858634,"about_ca_system_score_codex":0.0020315952,"about_ca_system_score_gemma":0.0022368748,"threshold_uncertainty_score":0.02357924},"labels":[],"label_agreement":null},{"id":"W4388303805","doi":"10.1007/s10479-023-05655-1","title":"Vulnerability analysis of China’s air and high-speed rail composite express network under different node attack strategies","year":2023,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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 Alberta","funders":"National Natural Science Foundation of China","keywords":"Vulnerability (computing); Computer science; Node (physics); Position (finance); Computer network; Vulnerability assessment; Topology (electrical circuits); Flow network; China; Computer security; Psychological resilience; Engineering; Business; Structural engineering; Geography; Mathematics","score_opus":0.15763595444865758,"score_gpt":0.4511901562351217,"score_spread":0.29355420178646413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388303805","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.9943797,0.00007493604,0.003832344,0.00011989246,0.000005918949,0.000014415929,0.00013983028,0.000024610717,0.0014084202],"genre_scores_gemma":[0.99943167,0.000032775297,0.00020958204,0.0000045449888,0.0000013434346,0.0000038628486,0.00007747972,0.0000015700143,0.00023716323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997104,0.00007776142,0.000009101453,0.000046514964,0.000058479203,0.00009770447],"domain_scores_gemma":[0.9989427,0.0005019395,0.0001830931,0.00006038852,0.00022351417,0.00008838567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006560754,0.00028961914,0.00022382359,0.0013192288,0.00044744104,0.00044901035,0.00039097492,0.0003549106,0.00087082747],"category_scores_gemma":[0.0018419656,0.00012306368,0.00039817227,0.00083492405,0.00045738675,0.0012529787,0.0005901907,0.00033601467,0.000055341014],"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.00030943082,0.00008678443,0.17945182,0.00008087254,0.00021724957,0.0011368359,0.00052230305,0.77396727,0.005049218,0.016501188,0.0028210229,0.019856025],"study_design_scores_gemma":[0.000005919368,0.00008022232,0.061366886,0.000010871064,0.000086308464,0.00021520675,0.0006076884,0.93168414,0.0010136827,0.0044289376,0.00048108754,0.00001905033],"about_ca_topic_score_codex":0.017945213,"about_ca_topic_score_gemma":0.015814153,"teacher_disagreement_score":0.017945213,"about_ca_system_score_codex":0.0012224168,"about_ca_system_score_gemma":0.0005502522,"threshold_uncertainty_score":0.035681486},"labels":[],"label_agreement":null},{"id":"W4388763558","doi":"10.1007/s10479-023-05660-4","title":"Integration of text-mining and telemedicine appointment optimization","year":2023,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","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 British Columbia, Okanagan Campus; University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Computer science; Regret; Telemedicine; Health care; Profit (economics); Classifier (UML); Postponement; Operations research; Data mining; Artificial intelligence; Machine learning; Operations management","score_opus":0.5111778685502172,"score_gpt":0.6091961743106531,"score_spread":0.09801830576043591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388763558","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.13017435,0.0035114854,0.82134783,0.0028821707,0.0007916587,0.0009095727,0.017284352,0.01592256,0.0071760146],"genre_scores_gemma":[0.48018384,0.0010768434,0.48517147,0.00045119168,0.0006822521,0.00040963286,0.027308805,0.00046495502,0.004250969],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983885,0.0004787851,0.00025646226,0.00036460697,0.00040375427,0.00010789727],"domain_scores_gemma":[0.99618596,0.0024506566,0.0002684141,0.00029538845,0.0006892376,0.00011035229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014982717,0.0012185943,0.0016393587,0.004650018,0.0005064735,0.0016774093,0.0011250076,0.0009977578,0.003134298],"category_scores_gemma":[0.006118836,0.00034920263,0.0017318008,0.003992451,0.00014799644,0.001527248,0.0006124332,0.0009505076,0.0013891694],"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.0007313934,0.002086261,0.012831631,0.0007825218,0.000671333,0.00029306224,0.00009884085,0.1371384,0.007525528,0.0018500566,0.020428965,0.81556207],"study_design_scores_gemma":[0.000045559467,0.0001490327,0.004074442,0.00003917977,0.00016884413,0.00009213109,0.000073857846,0.98174596,0.0043866085,0.0044098,0.004788785,0.000025804145],"about_ca_topic_score_codex":0.0076607,"about_ca_topic_score_gemma":0.011735611,"teacher_disagreement_score":0.0076607,"about_ca_system_score_codex":0.00060133246,"about_ca_system_score_gemma":0.0016315038,"threshold_uncertainty_score":0.015232205},"labels":[],"label_agreement":null},{"id":"W4389012055","doi":"10.1007/s10479-023-05672-0","title":"How do weather risks in Canada and the United States affect global commodity prices? Implications for the decarbonisation process","year":2023,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Market Dynamics and Volatility","field":"Economics, Econometrics and Finance","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Commodity; Vector autoregression; Crude oil; Futures contract; Economics; Agriculture; Extreme weather; Oil price; Natural resource economics; Agricultural economics; Environmental science; Climate change; Econometrics; Financial economics; Monetary economics; Finance","score_opus":0.26504908841384733,"score_gpt":0.4247105866794679,"score_spread":0.1596614982656206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389012055","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.9729222,0.001399095,0.0008487244,0.006584674,0.000057981415,0.00001825857,0.0023027954,0.000022000506,0.015844272],"genre_scores_gemma":[0.99811894,0.00061865855,0.00010307594,0.00011059869,0.000012368423,0.0000016804962,0.0003676038,0.0000046811474,0.00066240056],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99967694,0.000036291138,0.000013904592,0.000055372537,0.000111442256,0.0001060582],"domain_scores_gemma":[0.9983589,0.00037381996,0.00045299364,0.00005532686,0.00056698907,0.00019201006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067835243,0.00020448487,0.0003293027,0.0007359581,0.0006405779,0.0024879125,0.00031232924,0.00037486549,0.0019248283],"category_scores_gemma":[0.0040529,0.00010432986,0.0003071021,0.0019977526,0.00075128523,0.0009624573,0.0007560077,0.0009948347,0.000100506964],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003500104,0.000095636395,0.8526993,0.00011672156,0.00027474875,0.0006747622,0.001846923,0.06426758,0.0012067849,0.03846302,0.009350726,0.030653879],"study_design_scores_gemma":[0.000016122578,0.000034734752,0.934536,0.000076303324,0.000088899505,0.000052954016,0.0052686464,0.033385452,0.0007726468,0.013478219,0.012215415,0.00007465385],"about_ca_topic_score_codex":0.8865782,"about_ca_topic_score_gemma":0.86338097,"teacher_disagreement_score":0.1134218,"about_ca_system_score_codex":0.008050898,"about_ca_system_score_gemma":0.005970961,"threshold_uncertainty_score":0.22817945},"labels":[],"label_agreement":null},{"id":"W4389487793","doi":"10.1007/s10479-023-05698-4","title":"Enhancing the sustainability and robustness of critical material supply in electrical vehicle market: an AI-powered supplier selection approach","year":2023,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Extraction and Separation Processes","field":"Engineering","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":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Sustainability; Supply chain; Robustness (evolution); Dependability; Pace; Automotive industry; Supply and demand; Computer science; Environmental economics; Business; Risk analysis (engineering); Economics; Engineering; Marketing","score_opus":0.06839139924020661,"score_gpt":0.4207324229091003,"score_spread":0.3523410236688937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389487793","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.20550506,0.00066071836,0.766232,0.001990155,0.000086643966,0.00016876348,0.00011256866,0.00024244969,0.02500167],"genre_scores_gemma":[0.9790918,0.0001973567,0.018453607,0.000073725925,0.000051805033,0.00003393532,0.00003412469,0.00002195522,0.0020417555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868745,0.0006292983,0.00004474301,0.00019468443,0.00029299688,0.00015082401],"domain_scores_gemma":[0.9911021,0.0065856455,0.00091558456,0.00040696177,0.0007781622,0.0002116144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032366063,0.0007160651,0.0010397413,0.0014522736,0.0006016765,0.0026530456,0.0012732525,0.0012208597,0.0032650148],"category_scores_gemma":[0.009697205,0.0004246609,0.0008820616,0.001142658,0.0015313494,0.0026163305,0.0016883509,0.0011623844,0.0002474175],"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.00035703255,0.00030003613,0.0040983357,0.00029105486,0.00023158158,0.00034014846,0.00016458218,0.80143064,0.014430985,0.10376498,0.0010667972,0.07352387],"study_design_scores_gemma":[0.000023029084,0.00021111594,0.0008892324,0.000020545447,0.000052807532,0.000063120126,0.00012426701,0.9227013,0.0027160614,0.07229024,0.0008843847,0.000023900599],"about_ca_topic_score_codex":0.0012609769,"about_ca_topic_score_gemma":0.0010052042,"teacher_disagreement_score":0.0032650148,"about_ca_system_score_codex":0.0013939344,"about_ca_system_score_gemma":0.0017336856,"threshold_uncertainty_score":0.017117023},"labels":[],"label_agreement":null},{"id":"W4390269977","doi":"10.1007/s10479-023-05622-w","title":"Quality disclosure pattern options for competing refurbishers: blockchain vs online platform","year":2023,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":4,"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 Windsor","funders":"Social Science Foundation of Jiangsu Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Blockchain; Quality (philosophy); Duopoly; Product (mathematics); Business; Counterparty; Computer science; Microeconomics; Economics; Computer security; Actuarial science; Credit risk","score_opus":0.40830004685575005,"score_gpt":0.4662721342622861,"score_spread":0.05797208740653603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390269977","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.882513,0.00074695953,0.07477045,0.0035328565,0.00014557337,0.000168263,0.0004327178,0.00029336382,0.037396803],"genre_scores_gemma":[0.9948643,0.000053793665,0.0027864585,0.000054552434,0.000017988352,0.000009099306,0.000043672753,0.00001113559,0.0021590397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99543697,0.0018710555,0.0002302062,0.00042659428,0.0011707817,0.0008643833],"domain_scores_gemma":[0.96011716,0.028072782,0.0030477163,0.0046528843,0.0026680832,0.0014414258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0103496695,0.00032480818,0.00062449026,0.00064045034,0.000747987,0.004133232,0.0014811963,0.0019561276,0.021760205],"category_scores_gemma":[0.040549602,0.00027029225,0.0004693551,0.0007844386,0.0008692825,0.0071118665,0.0019320355,0.0015298934,0.0011231295],"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.012550037,0.001426248,0.051063195,0.00042097195,0.00027408177,0.0011731773,0.0017117816,0.2855496,0.0089741815,0.17581208,0.009533726,0.45151088],"study_design_scores_gemma":[0.0007417345,0.0022149351,0.009851684,0.00016909311,0.00023413269,0.0006325792,0.0023748546,0.7664587,0.008239227,0.20131166,0.007622308,0.0001491237],"about_ca_topic_score_codex":0.0017482186,"about_ca_topic_score_gemma":0.0020450612,"teacher_disagreement_score":0.021760205,"about_ca_system_score_codex":0.0010486875,"about_ca_system_score_gemma":0.0018499002,"threshold_uncertainty_score":0.07279509},"labels":[],"label_agreement":null},{"id":"W4390543445","doi":"10.1007/s10479-023-05765-w","title":"Short- and long-run cross-border European sustainability interdependences","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Market Dynamics and Volatility","field":"Economics, Econometrics and Finance","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Sustainability; Economics; Equity (law); Financial crisis; Environmental Sustainability Index; Index (typography); European debt crisis; Corporate governance; International economics; Macroeconomics; European union; Finance; Political science","score_opus":0.1499951548090992,"score_gpt":0.4877545870474269,"score_spread":0.3377594322383277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390543445","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.9957716,0.00013044954,0.0020447888,0.00014596355,0.000005101931,0.0000051267916,0.0003232354,0.000015505313,0.0015582383],"genre_scores_gemma":[0.9993303,0.000046128527,0.00016566811,0.000009734693,0.0000028523702,0.0000025042923,0.00023788665,0.00000273519,0.00020219121],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9994967,0.0001559527,0.00004103138,0.00014589651,0.000072652045,0.00008774305],"domain_scores_gemma":[0.9924231,0.0035167877,0.0023368383,0.00054931943,0.0008918911,0.0002820584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026165945,0.00018332375,0.00029798032,0.00091681763,0.00018610134,0.0013851646,0.0003082446,0.0004057024,0.0023006322],"category_scores_gemma":[0.0109275365,0.00013473943,0.00032701233,0.0011346699,0.0005080737,0.0010381616,0.0011410395,0.00053781486,0.00014114327],"study_design_candidate":"observational","study_design_consensus":"observational","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.00027067694,0.00013555103,0.8739815,0.000057184196,0.000392277,0.00038289622,0.000460984,0.07731959,0.0016880276,0.018113704,0.001714947,0.025482671],"study_design_scores_gemma":[0.000018646497,0.00014089035,0.8090361,0.00005269459,0.00012428894,0.00015776699,0.00085305114,0.17491941,0.0018662092,0.009840122,0.002942991,0.000047863992],"about_ca_topic_score_codex":0.009457771,"about_ca_topic_score_gemma":0.006831023,"teacher_disagreement_score":0.009457771,"about_ca_system_score_codex":0.00054900645,"about_ca_system_score_gemma":0.0003059402,"threshold_uncertainty_score":0.018805444},"labels":[],"label_agreement":null},{"id":"W4390878815","doi":"10.1007/s10479-023-05740-5","title":"Peer-evaluation in centrally managed systems","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hyperplane; Computer science; Theory of computation; Set (abstract data type); Projection (relational algebra); Feature (linguistics); Production (economics); Data envelopment analysis; Operations research; Mathematical optimization; Mathematics; Algorithm","score_opus":0.6121769435393668,"score_gpt":0.6076037708899307,"score_spread":0.00457317264943613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390878815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48023096,0.0022168506,0.4855407,0.0027110958,0.0002467103,0.00053019385,0.00014354258,0.0005132345,0.027866801],"genre_scores_gemma":[0.9792047,0.00018804698,0.016694935,0.000041682837,0.00008417764,0.00013363094,0.000027076012,0.00004205855,0.0035836792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.968334,0.022888623,0.0010079738,0.0016686723,0.0041261553,0.0019745466],"domain_scores_gemma":[0.87746274,0.10089309,0.0053362157,0.0047213696,0.009950656,0.0016358293],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.028400315,0.00070756377,0.0027874848,0.0017684806,0.0021432533,0.0051322654,0.0021733895,0.0020592462,0.0056318375],"category_scores_gemma":[0.09091558,0.0007919865,0.00076980155,0.0024922262,0.002806086,0.006154491,0.0021465304,0.0018117048,0.00052055647],"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.0010345933,0.00076395145,0.010997789,0.00044778863,0.00032715534,0.0005474261,0.0013030721,0.44631228,0.0015440142,0.40578833,0.0044350843,0.12649839],"study_design_scores_gemma":[0.00014510281,0.00035134715,0.004521881,0.000053303116,0.000088026674,0.00011827167,0.00083502574,0.74024326,0.001647521,0.24878077,0.0031650465,0.000050495793],"about_ca_topic_score_codex":0.006558872,"about_ca_topic_score_gemma":0.0047706948,"teacher_disagreement_score":0.9715997,"about_ca_system_score_codex":0.004095695,"about_ca_system_score_gemma":0.0061019245,"threshold_uncertainty_score":0.15019703},"labels":[],"label_agreement":null},{"id":"W4391254087","doi":"10.1007/s10479-024-05826-8","title":"Towards sustainable sustainability: exploring the impact of antecedents on industry 4.0 and sustainable performance of organizations—an empirical investigation","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","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":"Université Laval","funders":"Ministry of Higher Education","keywords":"Sustainability; Business; Sustainable development; Green computing; Empirical research; Empirical evidence; Environmental economics; Industrial organization; Knowledge management; Computer science; Economics; Political science","score_opus":0.14622293476208337,"score_gpt":0.42318090105664463,"score_spread":0.27695796629456126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391254087","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.994918,0.00008424518,0.00025867458,0.0002783387,0.0000052574005,0.00002856346,0.000058009355,0.0000044592603,0.004364474],"genre_scores_gemma":[0.99907935,0.0001081362,0.00026272947,0.00003969362,0.0000059663626,0.000025390567,0.00008385959,0.000003082635,0.0003918963],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9964072,0.0017162805,0.00020179561,0.00032329158,0.0007380236,0.0006133831],"domain_scores_gemma":[0.9417608,0.031890437,0.01359917,0.0026684871,0.00372608,0.006354942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005529776,0.00045612743,0.00048188138,0.0025608784,0.0024335925,0.0046284064,0.001361378,0.0017753664,0.0076214373],"category_scores_gemma":[0.022737684,0.00052628893,0.00072996755,0.0027212375,0.004798504,0.0028955003,0.0044197147,0.0034527194,0.0008201727],"study_design_candidate":"observational","study_design_consensus":"observational","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.00019750574,0.0023489138,0.9784773,0.00007426341,0.000111640344,0.00016703355,0.0037766148,0.00085677457,0.00038380307,0.0068852445,0.00029596098,0.0064249826],"study_design_scores_gemma":[0.00002868923,0.00040586153,0.96416956,0.00021756506,0.00016796676,0.00008966124,0.021995513,0.003198785,0.0005744334,0.007744803,0.0013724477,0.00003463996],"about_ca_topic_score_codex":0.010335544,"about_ca_topic_score_gemma":0.016950615,"teacher_disagreement_score":0.010335544,"about_ca_system_score_codex":0.0028069895,"about_ca_system_score_gemma":0.0054459833,"threshold_uncertainty_score":0.029244602},"labels":[],"label_agreement":null},{"id":"W4391610463","doi":"10.1007/s10479-023-05814-4","title":"Optimization of inpatient care unit resources during COVID-19 pandemic","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Emergency and Acute Care Studies","field":"Medicine","cited_by":3,"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","keywords":"Pandemic; Coronavirus disease 2019 (COVID-19); Theory of computation; 2019-20 coronavirus outbreak; Severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2); Unit (ring theory); Computer science; Virology; Medicine; Mathematics; Outbreak; Algorithm; Infectious disease (medical specialty); Internal medicine","score_opus":0.3036018408446837,"score_gpt":0.5156244051412359,"score_spread":0.21202256429655214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391610463","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.99324095,0.00019807581,0.00073351193,0.0006987415,0.000047620048,0.00009040447,0.00079658313,0.00003261608,0.0041615334],"genre_scores_gemma":[0.99850166,0.00007026313,0.0005920463,0.00005999067,0.000009566832,0.00004607345,0.00031043324,0.0000070876877,0.00040289664],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879175,0.00043628333,0.00005344688,0.00011468929,0.00010873382,0.0004950772],"domain_scores_gemma":[0.99759454,0.0009046938,0.00040207923,0.000088713656,0.00044527554,0.0005647656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092970417,0.00043730502,0.00043165294,0.0004258174,0.0006111323,0.0014637413,0.00057338976,0.00042356848,0.0053132684],"category_scores_gemma":[0.005852565,0.0002023425,0.00030169965,0.00053951074,0.00022237566,0.0009877166,0.0007401511,0.0006325955,0.00037389543],"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.015234259,0.0049356474,0.5897724,0.00070637005,0.00044029832,0.0017010293,0.0022141882,0.1591813,0.015012694,0.0094394125,0.021378512,0.17998385],"study_design_scores_gemma":[0.00030217948,0.0054687248,0.7887028,0.00029444203,0.00026648256,0.0003840248,0.023192653,0.16242053,0.007944865,0.004015944,0.006892741,0.00011466409],"about_ca_topic_score_codex":0.013814769,"about_ca_topic_score_gemma":0.014814031,"teacher_disagreement_score":0.013814769,"about_ca_system_score_codex":0.0017349867,"about_ca_system_score_gemma":0.003052118,"threshold_uncertainty_score":0.027468741},"labels":[],"label_agreement":null},{"id":"W4391839143","doi":"10.1007/s10479-024-05834-8","title":"The impact of sparsity and entropy criteria on neural network performance","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Neural Networks and Applications","field":"Computer Science","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 Guelph","funders":"","keywords":"Artificial neural network; Theory of computation; Computer science; Entropy (arrow of time); Artificial intelligence; Machine learning; Algorithm; Thermodynamics; Physics","score_opus":0.18792104234497645,"score_gpt":0.4748126505737744,"score_spread":0.286891608228798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391839143","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.8423574,0.003128746,0.13693672,0.004441193,0.000310135,0.000042668238,0.0005659001,0.00025461937,0.011962644],"genre_scores_gemma":[0.99394953,0.00030438817,0.0049650995,0.000064906024,0.00012862487,0.000008405268,0.000102991406,0.00004242553,0.00043352647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968731,0.0017085016,0.00021418848,0.00021740817,0.0007304986,0.00025637352],"domain_scores_gemma":[0.89337015,0.09592375,0.0024983983,0.002825012,0.004264207,0.001118447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00779547,0.00053423765,0.001016799,0.00088275346,0.0004571562,0.0015574677,0.0006372793,0.0014463953,0.001607632],"category_scores_gemma":[0.080414236,0.00026857323,0.0002508735,0.00070863805,0.0013883971,0.003979846,0.0014424854,0.001219137,0.00022922066],"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.0025396193,0.00047903793,0.02706025,0.00030149033,0.00025343592,0.00033956647,0.0001284052,0.81143725,0.01002381,0.04623313,0.0036726273,0.09753138],"study_design_scores_gemma":[0.000058504524,0.0004196966,0.0067545273,0.000037245092,0.000034485853,0.00016497639,0.00006689167,0.95382106,0.0043480126,0.034029234,0.00023113162,0.000034330053],"about_ca_topic_score_codex":0.0011568879,"about_ca_topic_score_gemma":0.0016282658,"teacher_disagreement_score":0.00779547,"about_ca_system_score_codex":0.00058506493,"about_ca_system_score_gemma":0.0010241171,"threshold_uncertainty_score":0.041226864},"labels":[],"label_agreement":null},{"id":"W4391924232","doi":"10.1007/s10479-024-05860-6","title":"A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","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":"Theory of computation; Scheme (mathematics); Flow (mathematics); Polynomial-time approximation scheme; Mathematics; Time complexity; Stage (stratigraphy); Computer science; Discrete mathematics; Algorithm; Geometry; Mathematical analysis","score_opus":0.2199977720889789,"score_gpt":0.4612305012646664,"score_spread":0.24123272917568753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391924232","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.06375241,0.00017310474,0.9291487,0.0003328918,0.00009240876,0.0002058153,0.00024966622,0.0012594808,0.0047856024],"genre_scores_gemma":[0.3942123,0.00012691763,0.60087824,0.00010042405,0.00007181659,0.00022541688,0.00043631118,0.00017849282,0.003770115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986896,0.00023722366,0.00009467366,0.0003466055,0.0003040225,0.00032788856],"domain_scores_gemma":[0.99758625,0.0011499574,0.00016628187,0.0006694318,0.00023130355,0.00019676868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002125858,0.00094563933,0.0017804245,0.00062413974,0.0015331504,0.0020969692,0.003819607,0.0013659396,0.0051153526],"category_scores_gemma":[0.0045425375,0.00092412526,0.0016841496,0.0014880167,0.00091038516,0.003272656,0.0022266272,0.0021990174,0.0007244546],"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.0012005079,0.00035052677,0.00079450716,0.00027839735,0.00007989098,0.00014723012,0.00021677387,0.79898316,0.009478228,0.04104834,0.0050068484,0.14241555],"study_design_scores_gemma":[0.000057406785,0.00004801473,0.00006967066,0.0000049941436,0.000016963557,0.00001933386,0.000015106993,0.988335,0.000937418,0.0099664135,0.00052325206,0.0000064413784],"about_ca_topic_score_codex":0.007574137,"about_ca_topic_score_gemma":0.010108083,"teacher_disagreement_score":0.007574137,"about_ca_system_score_codex":0.0026018373,"about_ca_system_score_gemma":0.0033876626,"threshold_uncertainty_score":0.018877685},"labels":[],"label_agreement":null},{"id":"W4392345961","doi":"10.1007/s10479-024-05892-y","title":"Optimal production management when there is regime switching and production constraints","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Production (economics); Theory of computation; Computer science; Biochemical engineering; Economics; Microeconomics; Algorithm; Engineering","score_opus":0.20786573427900337,"score_gpt":0.375731544277729,"score_spread":0.1678658099987256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392345961","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.40751842,0.0017107237,0.55941534,0.003491832,0.00021651553,0.00021719966,0.00043370452,0.0003317251,0.026664563],"genre_scores_gemma":[0.98409915,0.00032311335,0.011963007,0.00010177312,0.000057005545,0.000072851355,0.00006481808,0.000037455062,0.0032807789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998434,0.00072931533,0.000058369907,0.00023738698,0.00014280234,0.00039817023],"domain_scores_gemma":[0.9949451,0.003859826,0.0005318884,0.00017500737,0.00018059542,0.0003076535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028302532,0.0008931865,0.0020794007,0.0007147303,0.000639529,0.0021739232,0.0014145566,0.0025930074,0.0047617983],"category_scores_gemma":[0.00736242,0.0012759786,0.00093125174,0.00065129617,0.001784732,0.0019672662,0.0016112522,0.0016417603,0.00033245687],"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.00021126133,0.00010942558,0.00065922254,0.000103751256,0.000058716192,0.00032754996,0.000062697094,0.96111405,0.0018168029,0.028714897,0.00091228995,0.005909297],"study_design_scores_gemma":[0.000058344453,0.000089966066,0.00044467783,0.00002167599,0.000019021229,0.00004235212,0.000045636913,0.96348554,0.00033818567,0.03490708,0.00052652444,0.000021043079],"about_ca_topic_score_codex":0.0041516735,"about_ca_topic_score_gemma":0.0021327678,"teacher_disagreement_score":0.0047617983,"about_ca_system_score_codex":0.0018800927,"about_ca_system_score_gemma":0.0013450352,"threshold_uncertainty_score":0.015929759},"labels":[],"label_agreement":null},{"id":"W4392614914","doi":"10.1007/s10479-024-05900-1","title":"A semi-supervised multi-criteria sorting approach to constructing social vulnerability composite indicators","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Disaster Management and Resilience","field":"Social Sciences","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":"Wilfrid Laurier University; University of Ottawa","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Vulnerability (computing); Sorting; Composite number; Computer science; Composite indicator; Artificial intelligence; Mathematics; Econometrics; Computer security; Algorithm","score_opus":0.2861971457010072,"score_gpt":0.5178721124146695,"score_spread":0.23167496671366228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392614914","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.02532671,0.000058208225,0.9722235,0.000094807474,0.000031221996,0.00048472034,0.000290614,0.0005942662,0.0008960463],"genre_scores_gemma":[0.15071984,0.000030808886,0.8467175,0.00005421161,0.000025604773,0.0007344939,0.0008823779,0.00007864459,0.0007565048],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98901385,0.0053305887,0.0014001763,0.001275415,0.0025862758,0.00039371997],"domain_scores_gemma":[0.9715996,0.014993768,0.0017074997,0.0016565074,0.009372356,0.00067035813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014290924,0.0014080268,0.0024231363,0.006036614,0.002383188,0.003560421,0.0032837135,0.0012012956,0.0029953725],"category_scores_gemma":[0.032605294,0.000783419,0.0021343457,0.004433496,0.0011438591,0.0016408712,0.002978977,0.0019683843,0.00074135396],"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.00092363456,0.001345339,0.019891731,0.0012201085,0.0010015307,0.00022595352,0.0022061926,0.14331034,0.009465403,0.024562662,0.0072296336,0.7886175],"study_design_scores_gemma":[0.000088307104,0.00037618543,0.005209747,0.00011654726,0.000117385775,0.000081676015,0.00060046284,0.9542068,0.003453048,0.03345234,0.0021987206,0.000098719276],"about_ca_topic_score_codex":0.011063053,"about_ca_topic_score_gemma":0.016457783,"teacher_disagreement_score":0.014290924,"about_ca_system_score_codex":0.0014888863,"about_ca_system_score_gemma":0.0069689085,"threshold_uncertainty_score":0.07557857},"labels":[],"label_agreement":null},{"id":"W4392886271","doi":"10.1007/s10479-024-05852-6","title":"Sustainable supply chain coordination: extant literature, trends, and future research directions","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University","funders":"","keywords":"Extant taxon; Supply chain; Theory of computation; Computer science; Process management; Business; Management science; Economics; Marketing","score_opus":0.07910607517106488,"score_gpt":0.39619828862296,"score_spread":0.31709221345189514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392886271","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047997016,0.78950655,0.013082433,0.08327041,0.0014034525,0.00009632159,0.00031918066,0.00008929547,0.06423542],"genre_scores_gemma":[0.33012596,0.65325856,0.008648106,0.0033504902,0.0019943616,0.00009003393,0.0003176202,0.00002679454,0.0021881282],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957415,0.0013360253,0.0004224092,0.00090259785,0.0010936043,0.00050387584],"domain_scores_gemma":[0.9314814,0.048666973,0.0058552967,0.001908353,0.010421396,0.001666429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014709493,0.00061431323,0.0010786405,0.006605955,0.0020871516,0.01458656,0.0023422218,0.0026895609,0.011312453],"category_scores_gemma":[0.019630183,0.00045885012,0.00061763136,0.025225893,0.006890287,0.015295849,0.0026183769,0.0022294733,0.00096186926],"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.00016089542,0.0003904269,0.022878716,0.010543588,0.00016357261,0.0001530302,0.005817574,0.0027838799,0.00042538502,0.19122157,0.010525525,0.75493586],"study_design_scores_gemma":[0.000061672,0.0003449074,0.0374626,0.047166865,0.00045606305,0.0006270045,0.10132469,0.0074427295,0.001205542,0.40495974,0.39878246,0.00016574337],"about_ca_topic_score_codex":0.010089963,"about_ca_topic_score_gemma":0.016758919,"teacher_disagreement_score":0.014709493,"about_ca_system_score_codex":0.0061928667,"about_ca_system_score_gemma":0.019622797,"threshold_uncertainty_score":0.07779211},"labels":[],"label_agreement":null},{"id":"W4393068512","doi":"10.1007/s10479-024-05909-6","title":"Inventory models for non-instantaneous deteriorating items with expiration dates under the joined effect of preservation technology and linearly time-dependent holding cost when order-size linked to advance payment","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":21,"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 Victoria","funders":"","keywords":"Theory of computation; Payment; Order (exchange); Expiration; Expiration date; Econometrics; Operations research; Operations management; Computer science; Actuarial science; Mathematics; Economics; Statistics; Business; Algorithm; Finance; Psychology","score_opus":0.08863915829385094,"score_gpt":0.356156053973911,"score_spread":0.26751689568006004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393068512","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.27757555,0.0044910996,0.67495054,0.004150945,0.0007206663,0.0002597373,0.0021005983,0.0006071145,0.03514379],"genre_scores_gemma":[0.92802733,0.0020052185,0.011760241,0.00021554447,0.00023312005,0.00018479959,0.00079865096,0.00019756191,0.056577586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983499,0.00053236325,0.000093034774,0.0002846595,0.00016776903,0.0005722369],"domain_scores_gemma":[0.99125755,0.0061264723,0.0010265156,0.0002931757,0.0008398772,0.00045636296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054847365,0.0025811791,0.0034088078,0.0017836298,0.0010403086,0.0043240865,0.0057790987,0.0044688764,0.006672656],"category_scores_gemma":[0.009228386,0.0024172282,0.0032802052,0.0022824665,0.002883005,0.0075967438,0.0021288828,0.0037682017,0.0009808528],"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.0001252439,0.00009422204,0.00093472004,0.000109796776,0.00005830612,0.00023651641,0.0001548235,0.9164483,0.0005687966,0.078283206,0.0010501015,0.0019358614],"study_design_scores_gemma":[0.000020328825,0.00003498885,0.00031920956,0.000013233757,0.000044159835,0.000027311213,0.000048149606,0.9869753,0.00009907454,0.012093226,0.0002996761,0.000025278407],"about_ca_topic_score_codex":0.01949373,"about_ca_topic_score_gemma":0.012964912,"teacher_disagreement_score":0.01949373,"about_ca_system_score_codex":0.0033254607,"about_ca_system_score_gemma":0.002701275,"threshold_uncertainty_score":0.038760543},"labels":[],"label_agreement":null},{"id":"W4393994304","doi":"10.1007/s10479-024-05940-7","title":"A scenario-based robust optimization model for the sustainable distributed permutation flow-shop scheduling problem","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Flow shop scheduling; Computer science; Scheduling (production processes); Distributed computing; Permutation (music); Mathematical optimization; Job shop scheduling; Parallel computing; Mathematics; Embedded system","score_opus":0.1292306165847016,"score_gpt":0.3796719194277512,"score_spread":0.25044130284304955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393994304","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.042306166,0.00032115538,0.9484405,0.00074328086,0.0000700281,0.00010318892,0.0004694639,0.00024609375,0.007300152],"genre_scores_gemma":[0.945822,0.00036911442,0.048354432,0.00008691185,0.00005392153,0.00020143866,0.0003801927,0.00007036866,0.004661696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889743,0.0005120827,0.00003740092,0.00023288956,0.00017624396,0.00014389634],"domain_scores_gemma":[0.99885166,0.00062025804,0.00021588837,0.00006566502,0.00015245343,0.00009410567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016001946,0.0011325955,0.0014398654,0.0008088312,0.00039419817,0.0014972899,0.002105522,0.0020136903,0.0032947813],"category_scores_gemma":[0.0030053786,0.0007275458,0.0010267132,0.0011370471,0.0009775958,0.0017160134,0.0012866043,0.0012322911,0.00036417373],"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.000014026996,0.000008222126,0.000040898918,0.000010559826,0.000010135412,0.000031051855,0.000005433058,0.9914806,0.00019091027,0.007129481,0.00016009474,0.0009185331],"study_design_scores_gemma":[0.0000051679426,0.000013630967,0.00003150584,0.000001528849,0.0000037912632,0.000008014784,0.0000036443466,0.99571556,0.000037045644,0.004030208,0.00014627624,0.000003540802],"about_ca_topic_score_codex":0.0055775526,"about_ca_topic_score_gemma":0.0034724146,"teacher_disagreement_score":0.0055775526,"about_ca_system_score_codex":0.0014793158,"about_ca_system_score_gemma":0.0015909842,"threshold_uncertainty_score":0.011090219},"labels":[],"label_agreement":null},{"id":"W4394917640","doi":"10.1007/s10479-024-05930-9","title":"A mathematical maintenance model for a production system subject to deterioration according to a stochastic geometric process","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Reliability and Maintenance Optimization","field":"Engineering","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subject (documents); Process (computing); Production (economics); Computer science; Economics; Programming language","score_opus":0.14406912029629854,"score_gpt":0.41939483199546657,"score_spread":0.27532571169916803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394917640","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.07531514,0.0018968572,0.9072862,0.002900585,0.0002654807,0.00013873595,0.0007655858,0.00038876262,0.0110427495],"genre_scores_gemma":[0.93135995,0.0021510324,0.041102614,0.0003556865,0.00034869878,0.0003196404,0.00064236316,0.00017132483,0.023548717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987953,0.00037239635,0.00007285908,0.00034010742,0.00024153548,0.00017774977],"domain_scores_gemma":[0.99632144,0.0022231357,0.00067578803,0.00010923222,0.0005327081,0.00013767234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027496729,0.001829238,0.0024197246,0.0023134856,0.0008051954,0.0028331992,0.0042005284,0.004479896,0.0046217088],"category_scores_gemma":[0.0062396503,0.0014349102,0.0018512884,0.0020219146,0.0025115365,0.0026043742,0.0016778989,0.0021021783,0.0007452335],"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.00002591005,0.000027998403,0.00022756757,0.00007215971,0.000025873234,0.00009716459,0.000051201998,0.9649742,0.0006379308,0.031593543,0.00045041923,0.0018158406],"study_design_scores_gemma":[0.000010160625,0.000020909818,0.00011878947,0.000005997365,0.000016506989,0.000030710566,0.000007436842,0.994995,0.00005589,0.004534801,0.00019289361,0.000010985972],"about_ca_topic_score_codex":0.01145082,"about_ca_topic_score_gemma":0.0057318746,"teacher_disagreement_score":0.01145082,"about_ca_system_score_codex":0.0030757412,"about_ca_system_score_gemma":0.0021758303,"threshold_uncertainty_score":0.022768378},"labels":[],"label_agreement":null},{"id":"W4395452180","doi":"10.1007/s10479-024-05903-y","title":"Multi-item order quantity optimization through stochastic goal programing","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":3,"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 Windsor","funders":"Qatar University","keywords":"Order (exchange); Computer science; Stochastic optimization; Stochastic programming; Mathematical optimization; Mathematics; Economics","score_opus":0.23686216625472759,"score_gpt":0.4645346067948513,"score_spread":0.22767244054012373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395452180","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.016459858,0.000107704305,0.98053,0.00020745586,0.000016880098,0.00008290194,0.000038532504,0.00008139195,0.002475199],"genre_scores_gemma":[0.6928164,0.00028359826,0.30304998,0.00017260556,0.000042853455,0.00045513237,0.00018743037,0.000101878766,0.0028901473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755245,0.0012648151,0.00010150158,0.00027391737,0.00057353696,0.00023378414],"domain_scores_gemma":[0.9964759,0.0023571828,0.00034002413,0.00011449267,0.0005140859,0.00019831918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042198435,0.0014240552,0.0014758642,0.001097135,0.0004911757,0.0016487082,0.0011538513,0.0010888984,0.0020448917],"category_scores_gemma":[0.0068548387,0.0005829967,0.0010140395,0.0012351372,0.0012695519,0.0013489358,0.0022098213,0.0017869873,0.00019857007],"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.000035367182,0.000058493082,0.00040125696,0.000062288964,0.000033248354,0.000044012144,0.000049608407,0.9634321,0.00050199137,0.025209783,0.0003848281,0.009787023],"study_design_scores_gemma":[0.000005797565,0.00003561469,0.000049259103,0.000007778699,0.000004943339,0.0000048598167,0.000011675228,0.9898803,0.00015856573,0.009606947,0.000230591,0.000003614841],"about_ca_topic_score_codex":0.0038077575,"about_ca_topic_score_gemma":0.0024690856,"teacher_disagreement_score":0.0042198435,"about_ca_system_score_codex":0.0013998996,"about_ca_system_score_gemma":0.0021561503,"threshold_uncertainty_score":0.022316933},"labels":[],"label_agreement":null},{"id":"W4395685700","doi":"10.1007/s10479-024-05989-4","title":"On robust estimation of hidden semi-Markov regime-switching models","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Statistical Methods and Inference","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Theory of computation; Computer science; Hidden Markov model; Markov chain; Estimation; Markov model; Mathematical optimization; Econometrics; Mathematics; Artificial intelligence; Algorithm; Economics; Machine learning","score_opus":0.5266099326586466,"score_gpt":0.5509765792159146,"score_spread":0.024366646557267946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395685700","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.0052423617,0.0003801678,0.99337983,0.00021637935,0.000047154557,0.000032531352,0.000085168474,0.00017738334,0.00043906126],"genre_scores_gemma":[0.58206224,0.002885492,0.40479952,0.00051157887,0.0006984069,0.00059438654,0.0019445631,0.00055502716,0.0059488704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9910904,0.006032259,0.00044606463,0.0012084127,0.00076849235,0.00045440873],"domain_scores_gemma":[0.88395953,0.106726654,0.0033724688,0.003594209,0.0017171917,0.0006299907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019166829,0.0023105391,0.005654206,0.0024964071,0.0009463185,0.0029407581,0.004624105,0.0034802163,0.0035626495],"category_scores_gemma":[0.08139547,0.0028471397,0.0033725118,0.002540694,0.003794681,0.004103371,0.0045063156,0.0054577086,0.00071431114],"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.00024800462,0.00010569377,0.0008779163,0.0002387438,0.00048121676,0.00009707167,0.00013620268,0.8817868,0.0007080974,0.083184995,0.0011285297,0.03100673],"study_design_scores_gemma":[0.000014117244,0.000020260277,0.00010993719,0.000018495406,0.000019792287,0.000007931126,0.000006194169,0.9580905,0.00016574316,0.04134843,0.00018367083,0.000015016624],"about_ca_topic_score_codex":0.008216739,"about_ca_topic_score_gemma":0.0056261234,"teacher_disagreement_score":0.019166829,"about_ca_system_score_codex":0.0017009655,"about_ca_system_score_gemma":0.0031895405,"threshold_uncertainty_score":0.10136509},"labels":[],"label_agreement":null},{"id":"W4396708953","doi":"10.1007/s10479-024-05986-7","title":"A robust, resilience machine learning with risk approach: a case study of gas consumption","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Fault Detection and Control Systems","field":"Engineering","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":"Université Laval; Center for Interuniversity Research and Analysis on Organizations","funders":"","keywords":"Gas consumption; Resilience (materials science); Consumption (sociology); Computer science; Artificial intelligence; Risk analysis (engineering); Economics; Business; Environmental economics; Sociology; Materials science","score_opus":0.1717904189902343,"score_gpt":0.38656119912955667,"score_spread":0.21477078013932235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396708953","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.83588016,0.00073012477,0.15301788,0.002245171,0.00005335895,0.00014732666,0.00031398202,0.0005139671,0.0070981327],"genre_scores_gemma":[0.98202467,0.000099753,0.016219648,0.00003270689,0.000014186259,0.000021369828,0.000058562906,0.000036371446,0.0014926934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991875,0.00045060512,0.000028926826,0.000115578594,0.00014282046,0.00007447684],"domain_scores_gemma":[0.99528116,0.0038644746,0.00020543691,0.00026802588,0.0002795,0.00010123098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027719133,0.0006408927,0.0006508578,0.0009591756,0.0005743174,0.0012141938,0.0013544564,0.0019319896,0.0015535341],"category_scores_gemma":[0.008427927,0.00027118667,0.0006163369,0.00095858675,0.0009968565,0.0013656542,0.00079767726,0.001014496,0.00015297154],"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.00037246558,0.00026016476,0.009668543,0.000101236255,0.0000951797,0.001178889,0.00026038618,0.9383063,0.0014508473,0.0132965995,0.0015710637,0.03343841],"study_design_scores_gemma":[0.000018116378,0.00008664678,0.0016255123,0.0000061599676,0.000018750354,0.00012352417,0.00012556254,0.9917047,0.00084061915,0.0049377973,0.0004984668,0.000013998158],"about_ca_topic_score_codex":0.0140965665,"about_ca_topic_score_gemma":0.009130834,"teacher_disagreement_score":0.0140965665,"about_ca_system_score_codex":0.0014573317,"about_ca_system_score_gemma":0.0007753921,"threshold_uncertainty_score":0.028029025},"labels":[],"label_agreement":null},{"id":"W4396739004","doi":"10.1007/s10479-024-06000-w","title":"Correction: A scenario-based robust optimization model for the sustainable distributed permutation flow-shop scheduling problem","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Flow shop scheduling; Permutation (music); Scheduling (production processes); Job shop scheduling; Distributed computing; Mathematical optimization; Operations research; Parallel computing; Mathematics; Embedded system; Routing (electronic design automation)","score_opus":0.11025586097731636,"score_gpt":0.37081598836369317,"score_spread":0.2605601273863768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396739004","genre_codex":"editorial","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007383579,0.0013511714,0.015562934,0.057144832,0.9101758,0.000071513714,0.007782714,0.0019925467,0.0051801745],"genre_scores_gemma":[0.120891355,0.010617497,0.060272716,0.07692755,0.4027061,0.00077871454,0.016120274,0.0066866498,0.30499917],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719244,0.0005625962,0.00042572457,0.00054965174,0.0010720663,0.0001976085],"domain_scores_gemma":[0.95272905,0.009279851,0.0017147787,0.0038238775,0.031236932,0.0012154906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035465537,0.0019215635,0.0017583986,0.0033861434,0.0018277585,0.0032813982,0.0042970083,0.0042858426,0.10308684],"category_scores_gemma":[0.083892494,0.0010214755,0.001888779,0.0040735295,0.0016356036,0.0034549648,0.0021332318,0.007746551,0.03684701],"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.00006549169,0.0000065367612,0.00012514844,0.0002407193,0.000034376626,0.00013153098,0.000038679736,0.0010190073,0.000104630984,0.004229321,0.984761,0.009243643],"study_design_scores_gemma":[0.00018240389,0.00004439107,0.0016356289,0.00042639067,0.0001136691,0.0007152962,0.00015177988,0.009047413,0.0010180515,0.016609212,0.9699214,0.0001342499],"about_ca_topic_score_codex":0.022047574,"about_ca_topic_score_gemma":0.015812943,"teacher_disagreement_score":0.10308684,"about_ca_system_score_codex":0.0030774465,"about_ca_system_score_gemma":0.005119091,"threshold_uncertainty_score":0.34485978},"labels":[],"label_agreement":null},{"id":"W4396760682","doi":"10.1007/s10479-024-06030-4","title":"On the Ordering of Dynamic Principal Components and the Implications for Portfolio Analysis","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Financial Risk and Volatility Modeling","field":"Economics, Econometrics and Finance","cited_by":1,"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":"Ministero dell’Istruzione, dell’Università e della Ricerca; European Commission; Johns Hopkins University; Canadian Institute for Advanced Research","keywords":"Principal component analysis; Portfolio; Principal (computer security); Computer science; Econometrics; Economics; Financial economics; Artificial intelligence; Computer security","score_opus":0.30944715827190594,"score_gpt":0.43461702986794293,"score_spread":0.12516987159603699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396760682","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.047979206,0.005721707,0.91826904,0.004349249,0.0007127433,0.000070228605,0.00050885417,0.00023909936,0.022149822],"genre_scores_gemma":[0.5268725,0.014464645,0.43278447,0.0015640756,0.0026440637,0.0001900476,0.0014687043,0.0006284606,0.019383008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99664515,0.00183492,0.00025681258,0.00036614775,0.00062670675,0.00027011952],"domain_scores_gemma":[0.97220314,0.02070455,0.0013285492,0.0023636103,0.002371227,0.0010289336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008145832,0.0017471263,0.0019038473,0.0031172584,0.0019656415,0.0055296505,0.001635951,0.0021966363,0.008199384],"category_scores_gemma":[0.046271354,0.0011164837,0.0012353825,0.0048381677,0.004540515,0.009036611,0.00241817,0.005932053,0.0012602973],"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.00010978073,0.000068278525,0.001543292,0.00007906139,0.000024742854,0.00015689562,0.00018868457,0.014331059,0.00065369497,0.93458045,0.0030851006,0.04517902],"study_design_scores_gemma":[0.000013481399,0.000013656935,0.0003406761,0.00003252692,0.0000067007463,0.000043270516,0.000028291162,0.025227606,0.00009624376,0.9723518,0.0018264615,0.00001930705],"about_ca_topic_score_codex":0.003948151,"about_ca_topic_score_gemma":0.004100346,"teacher_disagreement_score":0.008199384,"about_ca_system_score_codex":0.0013001318,"about_ca_system_score_gemma":0.0017384331,"threshold_uncertainty_score":0.043079853},"labels":[],"label_agreement":null},{"id":"W4399055331","doi":"10.1007/s10479-024-06059-5","title":"Multi-criteria decision aiding for built heritage value assessment: Model and application in Québec City, Canada","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Sustainable Building Design and Assessment","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":true,"ca_institutions":"Université Laval","funders":"","keywords":"Value (mathematics); Environmental planning; Computer science; Geography; Operations research; Environmental resource management; Engineering; Environmental science; Machine learning","score_opus":0.13651537722603693,"score_gpt":0.45953931698947564,"score_spread":0.3230239397634387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399055331","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.9374789,0.0008931023,0.0396938,0.0007101915,0.00007999584,0.00057876366,0.0033092299,0.0005572972,0.01669872],"genre_scores_gemma":[0.95855445,0.00045624908,0.028743537,0.00007380071,0.000008667661,0.00025727702,0.0010836757,0.00005502824,0.010767284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992834,0.00026628602,0.00003071014,0.000101929356,0.00015331528,0.00016441396],"domain_scores_gemma":[0.997042,0.0015175138,0.0000696208,0.000057353005,0.0011540364,0.00015947975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023191308,0.001357861,0.0012026018,0.0013855195,0.0021485873,0.0027122395,0.0020990656,0.0014247586,0.0059015024],"category_scores_gemma":[0.0031930245,0.0006243509,0.0012863151,0.0024416754,0.0009366178,0.0008963012,0.00071863725,0.0010284637,0.00039221917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002940364,0.0003243327,0.008800598,0.00012918473,0.00008075937,0.00015729015,0.00015074115,0.9624663,0.0004813921,0.0018011294,0.003128096,0.022186091],"study_design_scores_gemma":[0.000037411188,0.000039866827,0.003020357,0.0000143314055,0.00002458845,0.0000059751933,0.00013508735,0.9956825,0.00017820598,0.0002442314,0.00059422903,0.000023186021],"about_ca_topic_score_codex":0.9873811,"about_ca_topic_score_gemma":0.98393816,"teacher_disagreement_score":0.03123754,"about_ca_system_score_codex":0.03123754,"about_ca_system_score_gemma":0.021308368,"threshold_uncertainty_score":0.22664529},"labels":[],"label_agreement":null},{"id":"W4399259176","doi":"10.1007/s10479-024-06042-0","title":"Migration to the quadruple bottom line framework for achieving sustainable development goals: the 4Ps of sustainability","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","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 Saskatchewan; University of New Brunswick","funders":"","keywords":"Sustainability; Sustainable development; Triple bottom line; Business; Line (geometry); Process management; Environmental resource management; Environmental planning; Economics; Political science; Environmental science; Ecology; Mathematics","score_opus":0.12760892899847245,"score_gpt":0.4277790237062915,"score_spread":0.3001700947078191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399259176","genre_codex":"other","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.033875182,0.0063396944,0.29868424,0.20460883,0.003430874,0.0002034499,0.0003966205,0.00067196315,0.45178923],"genre_scores_gemma":[0.7314863,0.0074974475,0.19465566,0.016751895,0.0011759159,0.0003559387,0.0004714032,0.00041338647,0.047192167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994134,0.0026575758,0.0002076138,0.000503846,0.0017742568,0.0007226999],"domain_scores_gemma":[0.99594504,0.00076138973,0.00026971466,0.00074956974,0.001286852,0.0009873997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007958241,0.0009077443,0.00050323096,0.0024205304,0.0029229228,0.013124161,0.0019935227,0.0045918557,0.009240985],"category_scores_gemma":[0.00541007,0.0003039093,0.0008813382,0.0021564912,0.010056494,0.012253394,0.011162257,0.0065503772,0.0017001195],"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.000008042387,0.000024438852,0.0002481165,0.00003775858,0.0000059255613,0.000041277966,0.00055998977,0.0011530416,0.00010381229,0.9656984,0.0052923616,0.026826803],"study_design_scores_gemma":[0.000004387002,0.00003248912,0.0003593251,0.0002313627,0.0000057626685,0.000049812254,0.001353942,0.0029438802,0.00023372767,0.8485668,0.1462007,0.000017914974],"about_ca_topic_score_codex":0.010509185,"about_ca_topic_score_gemma":0.010189949,"teacher_disagreement_score":0.013124161,"about_ca_system_score_codex":0.007358375,"about_ca_system_score_gemma":0.017430173,"threshold_uncertainty_score":0.053388953},"labels":[],"label_agreement":null},{"id":"W4399580936","doi":"10.1007/s10479-024-06097-z","title":"Solving the two-machine open shop problem with a single server with respect to the makespan","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","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":"Cégep de Chicoutimi; Université du Québec à Chicoutimi","funders":"Philippine Council for Agriculture, Aquatic and Natural Resources Research and Development","keywords":"Job shop scheduling; Integer programming; Open shop; Computer science; Completeness (order theory); Mathematical optimization; Integer (computer science); Mathematics; Flow shop scheduling; Computer network; Operating system; Routing (electronic design automation)","score_opus":0.13739894770600808,"score_gpt":0.4001093785665289,"score_spread":0.2627104308605208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399580936","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.19665864,0.001383652,0.78741014,0.0011187164,0.0003720446,0.00032775913,0.00040573752,0.0004820873,0.011841229],"genre_scores_gemma":[0.8199973,0.0005002101,0.17184581,0.0001289686,0.00028725938,0.00024239591,0.00035239986,0.00023221145,0.006413317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837804,0.0006524387,0.000068862486,0.0002932756,0.00023461177,0.00037273602],"domain_scores_gemma":[0.99479264,0.003952885,0.00027106222,0.00024753666,0.00032461988,0.00041123945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035761101,0.001541441,0.003257871,0.0009233016,0.00076663384,0.0024747704,0.0023105785,0.0022460993,0.0043467716],"category_scores_gemma":[0.007314499,0.0011930838,0.0014332796,0.0015977079,0.0012028745,0.002911082,0.0017340388,0.002390574,0.00031744313],"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.00033091323,0.00013160799,0.0002716932,0.00023697074,0.000077292665,0.00009860771,0.00004562317,0.97660905,0.001214502,0.0054980116,0.0008710524,0.014614584],"study_design_scores_gemma":[0.000043185322,0.00010155566,0.00014964805,0.0000076056126,0.000017768069,0.000020881065,0.000026729407,0.99259174,0.0003019542,0.0065249014,0.00020631803,0.000007805475],"about_ca_topic_score_codex":0.004604001,"about_ca_topic_score_gemma":0.004376434,"teacher_disagreement_score":0.004604001,"about_ca_system_score_codex":0.0012273092,"about_ca_system_score_gemma":0.0035047107,"threshold_uncertainty_score":0.018912554},"labels":[],"label_agreement":null},{"id":"W4399915238","doi":"10.1007/s10479-024-06099-x","title":"Estimating and predicting the human development index with uncertain data: a common weight fuzzy benefit-of-the-doubt machine learning approach","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","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":"York University","funders":"","keywords":"Human Development Index; Fuzzy logic; Rank (graph theory); Mathematics; Measure (data warehouse); Econometrics; Artificial neural network; Fuzzy set; Index (typography); Population; Statistics; Machine learning; Artificial intelligence; Data mining; Computer science; Human development (humanity); Economics","score_opus":0.5296110238330884,"score_gpt":0.541465042957517,"score_spread":0.011854019124428516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399915238","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.07512826,0.0004823587,0.92221826,0.0004965731,0.0000432507,0.000072459625,0.000102264006,0.00009867854,0.0013579244],"genre_scores_gemma":[0.8774042,0.00027863905,0.12109761,0.000088284476,0.00011316885,0.0000911907,0.00017684404,0.000020113179,0.0007299445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973647,0.0009797775,0.00021718229,0.00042186026,0.00082303374,0.00019340722],"domain_scores_gemma":[0.99095297,0.006609755,0.00062847417,0.00044511576,0.00119251,0.00017117019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074548544,0.0010870617,0.0017377953,0.0041612913,0.00066922925,0.0021571377,0.0025110191,0.0020522869,0.0009062418],"category_scores_gemma":[0.018102823,0.0005275174,0.0011698517,0.002256986,0.0014586181,0.0030554496,0.0018272966,0.0017579333,0.00013021621],"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.00026782003,0.00023080927,0.0071535925,0.00020459043,0.00025698464,0.0001821248,0.00015127144,0.8278777,0.0012932227,0.024261296,0.000986037,0.13713458],"study_design_scores_gemma":[0.0000053975364,0.000028476794,0.00044597356,0.000013099793,0.00001810418,0.000015804428,0.00001332765,0.9894778,0.00020918674,0.009665602,0.00009718202,0.000010053601],"about_ca_topic_score_codex":0.004440156,"about_ca_topic_score_gemma":0.0028461532,"teacher_disagreement_score":0.0074548544,"about_ca_system_score_codex":0.0013323595,"about_ca_system_score_gemma":0.0011544576,"threshold_uncertainty_score":0.039425552},"labels":[],"label_agreement":null},{"id":"W4400274616","doi":"10.1007/s10479-024-06136-9","title":"Hybrid metaheuristic for the dial-a-ride problem with private fleet and common carrier integrated with public transportation","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Transportation and Mobility Innovations","field":"Engineering","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":"Université Laval","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Metaheuristic; Transport engineering; Public transport; Business; Fleet management; Computer science; Operations research; Telecommunications; Engineering; Artificial intelligence","score_opus":0.10714165070929006,"score_gpt":0.36874486405725626,"score_spread":0.2616032133479662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400274616","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.36104703,0.0020052034,0.61540955,0.00077705324,0.00029634064,0.00031425367,0.0004312981,0.0005445862,0.01917461],"genre_scores_gemma":[0.8693576,0.00030649512,0.1244313,0.00011334623,0.000068273286,0.00020936024,0.00020964375,0.00006334338,0.0052405093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993272,0.00025873768,0.000021551574,0.000102706654,0.00009213161,0.0001978022],"domain_scores_gemma":[0.999099,0.00058426807,0.00006711042,0.0000499092,0.00009970838,0.00010008936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012359486,0.0011212988,0.0018656417,0.0014017485,0.00068217097,0.0016492152,0.0022888072,0.0024929447,0.0030755831],"category_scores_gemma":[0.0015802785,0.000749078,0.0015535161,0.0017049497,0.0006847265,0.0015210189,0.0011764314,0.0015015268,0.00017099324],"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.0000804063,0.00011234492,0.00021619826,0.000034165245,0.00005425754,0.000036894715,0.000016088377,0.98713,0.00024188822,0.0031900562,0.0004612269,0.008426573],"study_design_scores_gemma":[0.000026170852,0.000040161583,0.00006413734,0.0000037685863,0.000014709064,0.0000068051622,0.000014357591,0.99857056,0.00007555546,0.0009267505,0.00025355493,0.0000033878598],"about_ca_topic_score_codex":0.024240194,"about_ca_topic_score_gemma":0.020321837,"teacher_disagreement_score":0.024240194,"about_ca_system_score_codex":0.0018326263,"about_ca_system_score_gemma":0.002576575,"threshold_uncertainty_score":0.048198223},"labels":[],"label_agreement":null},{"id":"W4400595039","doi":"10.1007/s10479-024-06131-0","title":"Requirement-driven supplier selection: a multi-criteria QFD-based approach under epistemic and stochastic uncertainties","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","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":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Selection (genetic algorithm); Quality function deployment; Uncertainty quantification; Computer science; Management science; Artificial intelligence; Engineering; Operations management; Machine learning","score_opus":0.6530890408517598,"score_gpt":0.5876089016102118,"score_spread":0.06548013924154794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400595039","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.008848925,0.00020745661,0.988224,0.00021493425,0.000024295561,0.00016616215,0.00008382021,0.000061464634,0.0021688377],"genre_scores_gemma":[0.5200424,0.00046675614,0.47685823,0.0001449606,0.00005068458,0.000563104,0.00022343002,0.00006726889,0.0015831176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936726,0.0033879073,0.00028610465,0.0005156365,0.0018358073,0.00030192113],"domain_scores_gemma":[0.9917418,0.0061324793,0.00053297944,0.0002089344,0.001211754,0.00017211917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00872934,0.0016976958,0.0029450199,0.0030761096,0.00089774554,0.0029076142,0.0030096995,0.0020364588,0.002282749],"category_scores_gemma":[0.012512904,0.0015652612,0.0026402448,0.0035596818,0.0011303357,0.0021848413,0.0021813326,0.0015073008,0.00022184134],"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.00007270583,0.000118981225,0.00047314266,0.0003469499,0.00015180823,0.00023306083,0.0002379821,0.94231313,0.001607784,0.016060999,0.0006592397,0.03772422],"study_design_scores_gemma":[0.000014506586,0.000036364458,0.00014431267,0.000033599277,0.000028799512,0.00003516979,0.000043692944,0.99025214,0.0003078209,0.008759001,0.0003278371,0.000016859014],"about_ca_topic_score_codex":0.010273688,"about_ca_topic_score_gemma":0.008358695,"teacher_disagreement_score":0.010273688,"about_ca_system_score_codex":0.0025620868,"about_ca_system_score_gemma":0.0042817323,"threshold_uncertainty_score":0.046165705},"labels":[],"label_agreement":null},{"id":"W4400907482","doi":"10.1007/s10479-024-06139-6","title":"Comparing groups of units through composite indicators in a non-convex approach: corporate social responsibility for the food and beverage manufacturing industry","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Ministerio de Ciencia e Innovación; European Regional Development Fund; Narodowe Centrum Nauki; Agencia Estatal de Investigación; Generalitat Valenciana","keywords":"Corporate social responsibility; Theory of computation; Composite number; Food industry; Beverage industry; Business; Industrial organization; Regular polygon; Marketing; Mathematics; Food science; Chemistry; Public relations; Algorithm; Political science","score_opus":0.5606742607487393,"score_gpt":0.5080849775656662,"score_spread":0.0525892831830731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400907482","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.8982118,0.00028531931,0.09611564,0.00034527294,0.000026361226,0.00012629191,0.00025700754,0.000022610764,0.0046096975],"genre_scores_gemma":[0.9832298,0.00006830334,0.016154509,0.000011599951,0.0000074092286,0.000041353116,0.00016524707,0.000006442488,0.0003154618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9940864,0.003958073,0.00019583802,0.0005139237,0.00086013635,0.00038560643],"domain_scores_gemma":[0.985979,0.009284183,0.0019996979,0.0008478272,0.0014222794,0.0004669538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008625422,0.00057440635,0.0009986755,0.004029298,0.000675359,0.00311566,0.00077579304,0.0005009171,0.0017373122],"category_scores_gemma":[0.022480525,0.00017183677,0.0011503306,0.004758202,0.001622166,0.0019514619,0.0023936385,0.0011606192,0.0001273607],"study_design_candidate":"observational","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.00083291274,0.0007106042,0.34943444,0.00042177938,0.001342329,0.00036216466,0.0025815445,0.39340404,0.0020124118,0.07312311,0.0011459392,0.17462875],"study_design_scores_gemma":[0.000033544264,0.00063678756,0.21654966,0.00015449063,0.00024426673,0.000060956576,0.007793387,0.7106858,0.003002181,0.05723843,0.003519166,0.00008135053],"about_ca_topic_score_codex":0.012119101,"about_ca_topic_score_gemma":0.009838232,"teacher_disagreement_score":0.012119101,"about_ca_system_score_codex":0.002898642,"about_ca_system_score_gemma":0.0021185654,"threshold_uncertainty_score":0.04561609},"labels":[],"label_agreement":null},{"id":"W4402547446","doi":"10.1007/s10479-024-06241-9","title":"An updated survey of attended home delivery and service problems with a focus on applications","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Focus (optics); Theory of computation; Computer science; Service (business); Operations research; Management science; Mathematics; Business; Engineering; Marketing; Algorithm","score_opus":0.14443607513241238,"score_gpt":0.3954565609906834,"score_spread":0.25102048585827097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402547446","genre_codex":"review","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.22318372,0.6996731,0.005660227,0.018145483,0.00096989924,0.00019791207,0.0053005605,0.00017228122,0.04669676],"genre_scores_gemma":[0.33047122,0.6480729,0.0049207048,0.002345921,0.00083817873,0.0001495576,0.005882397,0.00008607886,0.007232985],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99726945,0.0006031811,0.0004792776,0.00028610294,0.0010728978,0.00028908314],"domain_scores_gemma":[0.9844641,0.0089558875,0.002241074,0.00030507348,0.0034672453,0.0005665966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022840675,0.00047846689,0.0007446656,0.008894874,0.00076880126,0.0026516167,0.0008875609,0.0011663112,0.006963205],"category_scores_gemma":[0.010696321,0.00031499605,0.0007921454,0.016777582,0.000855033,0.0042915074,0.001238749,0.0011531892,0.00097354426],"study_design_candidate":"observational","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.00017595255,0.0002878861,0.08228367,0.010850092,0.0001389806,0.00066386064,0.0034935472,0.0016003185,0.0005692523,0.014652606,0.08456712,0.80071664],"study_design_scores_gemma":[0.000015923813,0.0004136934,0.3062243,0.016413514,0.00022271447,0.0051748413,0.020853676,0.0033703984,0.0006174722,0.0076497574,0.6389105,0.00013327596],"about_ca_topic_score_codex":0.007469313,"about_ca_topic_score_gemma":0.0069832643,"teacher_disagreement_score":0.008894874,"about_ca_system_score_codex":0.0017371567,"about_ca_system_score_gemma":0.0020195483,"threshold_uncertainty_score":0.02329421},"labels":[],"label_agreement":null},{"id":"W4402749525","doi":"10.1007/s10479-024-06267-z","title":"Mean-variance optimization with inferred regimes","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","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":"Dalhousie University","funders":"","keywords":"Theory of computation; Variance (accounting); Computer science; Mathematical optimization; Mathematics; Algorithm; Economics","score_opus":0.19197773032523602,"score_gpt":0.38725637267958346,"score_spread":0.19527864235434744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402749525","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.023681475,0.00038091638,0.97124475,0.0010201627,0.00006842441,0.000051158055,0.00013693165,0.0002086547,0.0032074435],"genre_scores_gemma":[0.7025808,0.00057385064,0.2878064,0.00030675437,0.0003106987,0.0003181644,0.00050350017,0.00031395518,0.0072859027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971493,0.0016634025,0.00016446796,0.0005064813,0.00032469176,0.0001916765],"domain_scores_gemma":[0.9752677,0.021963647,0.0010176661,0.0007664908,0.00067417364,0.00031035673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070016272,0.0015099037,0.003593169,0.0015969938,0.00096102746,0.003191148,0.002312174,0.0050892783,0.0030749165],"category_scores_gemma":[0.03504938,0.0027975806,0.0021704144,0.0016566609,0.0031988716,0.0046906923,0.003812434,0.0038589232,0.0005383342],"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.00012105634,0.000051394847,0.00046935416,0.000056940797,0.000080734855,0.00005403034,0.00005186111,0.9426242,0.00023044227,0.04515278,0.0006485737,0.010458589],"study_design_scores_gemma":[0.000012457914,0.000007887783,0.000044698634,0.0000075125786,0.000006650737,0.000004705409,0.0000030707959,0.9740975,0.00008222882,0.02565032,0.00007757616,0.0000053280637],"about_ca_topic_score_codex":0.004992691,"about_ca_topic_score_gemma":0.003318639,"teacher_disagreement_score":0.0070016272,"about_ca_system_score_codex":0.0019446143,"about_ca_system_score_gemma":0.0025456364,"threshold_uncertainty_score":0.03702855},"labels":[],"label_agreement":null},{"id":"W4403189043","doi":"10.1007/s10479-024-06281-1","title":"Dual dominance: how Harry Markowitz and William Ziemba impacted portfolio management","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Financial Markets and Investment Strategies","field":"Economics, Econometrics and Finance","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":"Dalhousie University","funders":"","keywords":"Theory of computation; Dual (grammatical number); Dominance (genetics); Project portfolio management; Portfolio; Economics; Computer science; Mathematical economics; Management; Financial economics; Philosophy; Biology; Linguistics; Project management; Programming language; Genetics","score_opus":0.16054421804847227,"score_gpt":0.36825736599534875,"score_spread":0.20771314794687648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403189043","genre_codex":"commentary","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.060704026,0.03086883,0.14577277,0.5371198,0.00950765,0.00009618319,0.00020664732,0.00044513989,0.21527894],"genre_scores_gemma":[0.757954,0.019614264,0.0629819,0.047937408,0.003644146,0.000113247785,0.00010246952,0.0009896661,0.106662996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9942303,0.002923186,0.0001889481,0.00052508217,0.0015901553,0.0005422959],"domain_scores_gemma":[0.9880378,0.0064428025,0.0004457879,0.0007527387,0.0025963183,0.001724578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011546209,0.0006731857,0.00069550023,0.0021483267,0.004138969,0.012865534,0.0010653513,0.0030283662,0.0075688804],"category_scores_gemma":[0.033019334,0.0006902714,0.00046031465,0.0018036917,0.0067133033,0.011919098,0.0059520286,0.007559302,0.0014366193],"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.000112433074,0.00016185624,0.003579789,0.00009258915,0.000050316517,0.00024938135,0.0048935395,0.0031071892,0.0008061469,0.69067955,0.0942387,0.20202845],"study_design_scores_gemma":[0.00003431276,0.00007219535,0.0014515014,0.00029405224,0.000037232796,0.00022908872,0.003664315,0.006624526,0.0013775151,0.64918756,0.33690864,0.000119018325],"about_ca_topic_score_codex":0.013149013,"about_ca_topic_score_gemma":0.015342979,"teacher_disagreement_score":0.013149013,"about_ca_system_score_codex":0.0049922387,"about_ca_system_score_gemma":0.0056847343,"threshold_uncertainty_score":0.061062932},"labels":[],"label_agreement":null},{"id":"W4403616496","doi":"10.1007/s10479-024-06351-4","title":"Migratory beekeeping routing: a combinatorial optimization problem in apiculture","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Beekeeping; Theory of computation; Varroa; Computer science; Combinatorial optimization; Routing (electronic design automation); Mathematical optimization; Mathematics; Biology; Honey bee; Computer network; Ecology; Algorithm","score_opus":0.11323461520207793,"score_gpt":0.417617561499046,"score_spread":0.30438294629696805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403616496","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.05579621,0.005616798,0.9129041,0.0023232396,0.00038435165,0.00014149233,0.000566461,0.00011734209,0.022150012],"genre_scores_gemma":[0.6233419,0.010684441,0.3278271,0.0006060775,0.0006479773,0.00043053305,0.00083335745,0.0003829565,0.03524568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992168,0.00038413302,0.000033116372,0.00018439026,0.000094202755,0.000087285895],"domain_scores_gemma":[0.9979493,0.0016024483,0.00019451455,0.000059872233,0.00010498148,0.00008894373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014717235,0.0015529823,0.0016540273,0.0012701645,0.0009866924,0.0044186194,0.0021022821,0.0027924362,0.0043344805],"category_scores_gemma":[0.0038097205,0.0010052918,0.0013821399,0.0029321078,0.0017643765,0.002578302,0.0011769034,0.0023025058,0.00043289032],"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.000062269144,0.00011803518,0.0012902878,0.00032680476,0.00012958239,0.00019327544,0.00009991584,0.87925535,0.000850442,0.074321955,0.006130942,0.03722108],"study_design_scores_gemma":[0.000015597034,0.000038615362,0.00040703555,0.00005053212,0.000041226245,0.00006263852,0.00013045532,0.95437515,0.00024405449,0.04061814,0.0039978265,0.000018714029],"about_ca_topic_score_codex":0.015752569,"about_ca_topic_score_gemma":0.015518728,"teacher_disagreement_score":0.015752569,"about_ca_system_score_codex":0.0020534396,"about_ca_system_score_gemma":0.0016157259,"threshold_uncertainty_score":0.031321704},"labels":[],"label_agreement":null},{"id":"W4404521915","doi":"10.1007/s10479-024-06397-4","title":"Should we keep the tradition or follow the trend? The optimal live-streaming e-commerce mode selection in a sustainable and circular supply chain under competition","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","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":"Humanities and Social Science Fund of Ministry of Education of China","keywords":"Competition (biology); Selection (genetic algorithm); Supply chain; Theory of computation; Mode (computer interface); E-commerce; Industrial organization; Supply chain management; Business; Computer science; Economics; Microeconomics; Marketing; Artificial intelligence; Algorithm; World Wide Web; Biology; Ecology","score_opus":0.12928893507350203,"score_gpt":0.37186213275549274,"score_spread":0.2425731976819907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404521915","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.5636252,0.0019894294,0.39585647,0.016660962,0.0005265735,0.00011688623,0.0001865919,0.00021795632,0.020819983],"genre_scores_gemma":[0.9578603,0.00060621236,0.036338724,0.00039878386,0.00015428642,0.000027145425,0.000040262606,0.00006571439,0.004508478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928844,0.00027081888,0.000032784294,0.00014548448,0.00014183097,0.00012062698],"domain_scores_gemma":[0.995548,0.0024115245,0.00048868544,0.0002264356,0.0008378322,0.00048741134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018326491,0.00035932602,0.000807604,0.0004667493,0.00096789707,0.0025141502,0.0012418027,0.0015976827,0.0070453947],"category_scores_gemma":[0.010744403,0.00047009412,0.00035186924,0.0007072183,0.0021517477,0.0073095844,0.0010250102,0.0019307679,0.00090506615],"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.001159346,0.0007572122,0.023557719,0.0005210576,0.00023871024,0.00059005845,0.00096200866,0.29841864,0.011174092,0.30461192,0.013119677,0.3448896],"study_design_scores_gemma":[0.000087766064,0.0005001201,0.005287444,0.00012919589,0.000063590836,0.00022732158,0.001574573,0.7445273,0.0015565397,0.24183093,0.004102013,0.00011331957],"about_ca_topic_score_codex":0.0044852663,"about_ca_topic_score_gemma":0.0056467177,"teacher_disagreement_score":0.0070453947,"about_ca_system_score_codex":0.0009081872,"about_ca_system_score_gemma":0.0017924929,"threshold_uncertainty_score":0.023569167},"labels":[],"label_agreement":null},{"id":"W4405070666","doi":"10.1007/s10479-024-06356-z","title":"Inflation differentials and the diversification benefits of small cap equities in emerging markets for US investors","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Financial Markets and Investment Strategies","field":"Economics, Econometrics and Finance","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":"Concordia University","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Diversification (marketing strategy); Emerging markets; Financial economics; Theory of computation; Economics; Monetary economics; Business; Finance; Computer science; Marketing","score_opus":0.28226950135851475,"score_gpt":0.3667586931506549,"score_spread":0.08448919179214015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405070666","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.99637896,0.0003979328,0.00022960451,0.0005805876,0.000008426351,0.0000028916397,0.00005252896,0.0000031139848,0.0023460065],"genre_scores_gemma":[0.99971837,0.000068426874,0.000022003323,0.000019913696,0.000009594361,4.3041774e-7,0.000024399724,4.8109337e-7,0.00013631636],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9997986,0.00005259115,0.000020526066,0.000028324539,0.000038856204,0.00006117511],"domain_scores_gemma":[0.9958566,0.0016474405,0.001549768,0.00014643544,0.00027515416,0.00052459305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011563732,0.00015157605,0.00024360999,0.00042471476,0.0003503805,0.0012966025,0.00021231044,0.0007134016,0.002752373],"category_scores_gemma":[0.008595029,0.0001297091,0.00027056015,0.00038797568,0.0005602009,0.0016767875,0.0007543241,0.001134095,0.00018467693],"study_design_candidate":"observational","study_design_consensus":"observational","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.0025247624,0.0005917344,0.8978647,0.000071821145,0.00024183253,0.0011308329,0.0007473932,0.013350811,0.0037826372,0.02643799,0.0017095475,0.05154601],"study_design_scores_gemma":[0.00014156204,0.00047381612,0.92276305,0.00003778324,0.00016169313,0.0004481656,0.0014928777,0.02075797,0.0011863497,0.05098198,0.0015182893,0.000036541758],"about_ca_topic_score_codex":0.0023022417,"about_ca_topic_score_gemma":0.0036004388,"teacher_disagreement_score":0.002752373,"about_ca_system_score_codex":0.0006666121,"about_ca_system_score_gemma":0.00031615555,"threshold_uncertainty_score":0.009207547},"labels":[],"label_agreement":null},{"id":"W4405127688","doi":"10.1007/s10479-024-06410-w","title":"Joint scheduling optimization of production assembly considering testing groups in robot manufacturing","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Manufacturing and Logistics Optimization","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":"Université du Québec à Montréal","funders":"Anhui Provincial Key Research and Development Plan; Natural Science Foundation of Tianjin Municipal Science and Technology Commission; Anhui Provincial Department of Education; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Theory of computation; Scheduling (production processes); Computer science; Mathematical optimization; Joint (building); Job shop scheduling; Production (economics); Industrial engineering; Manufacturing engineering; Mathematics; Engineering; Algorithm; Economics; Microeconomics; Embedded system; Structural engineering","score_opus":0.21988820941719225,"score_gpt":0.38741430787779163,"score_spread":0.16752609846059938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405127688","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.24030562,0.00082120264,0.751923,0.0003863249,0.00024232076,0.00025729227,0.00018657079,0.00032549133,0.0055521894],"genre_scores_gemma":[0.93898517,0.0002475718,0.05639895,0.000049487495,0.0000755993,0.00020615879,0.00019943158,0.00010248631,0.0037351348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837434,0.0007047136,0.000061010764,0.00024745252,0.00021952683,0.00039287793],"domain_scores_gemma":[0.99659085,0.0021552127,0.00045392336,0.00013088124,0.0003326785,0.00033643565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00282268,0.0020377424,0.004207475,0.0013540842,0.0012467643,0.0017747715,0.0027680616,0.0019771822,0.0035585554],"category_scores_gemma":[0.0042423485,0.0016542297,0.0018939027,0.0019305154,0.0013851554,0.0015041907,0.0012804295,0.0013444613,0.00042041487],"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.00016984482,0.000063950356,0.00026795207,0.000060984734,0.00003889438,0.0000745678,0.000030572486,0.9925478,0.0007578734,0.0013300262,0.00025455788,0.004402896],"study_design_scores_gemma":[0.000012785696,0.00009310804,0.000174834,0.0000031913526,0.000016550845,0.0000060641446,0.000013919621,0.99848276,0.00025871536,0.0008612166,0.00007147391,0.0000053895874],"about_ca_topic_score_codex":0.015786843,"about_ca_topic_score_gemma":0.006490338,"teacher_disagreement_score":0.015786843,"about_ca_system_score_codex":0.0015953773,"about_ca_system_score_gemma":0.0023154335,"threshold_uncertainty_score":0.03138995},"labels":[],"label_agreement":null},{"id":"W4405231135","doi":"10.1007/s10479-024-06423-5","title":"Nonradial plant capacity concepts: proposals and attainability","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","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":"Royal Military College of Canada","funders":"","keywords":"Inefficiency; Flexibility (engineering); Computer science; Set (abstract data type); Production (economics); Theory of computation; Mathematical optimization; Economics; Mathematics; Microeconomics; Algorithm","score_opus":0.5544661394034994,"score_gpt":0.5942163186117722,"score_spread":0.03975017920827273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405231135","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.032762513,0.001595154,0.88775206,0.0015708385,0.0001437602,0.00015140075,0.00020117835,0.00012206345,0.07570106],"genre_scores_gemma":[0.8412195,0.0015089887,0.14150113,0.00019579519,0.00039763036,0.0005038361,0.00017027537,0.00014885132,0.014353969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99545056,0.0020992127,0.00021114561,0.0006990922,0.0011531594,0.00038679823],"domain_scores_gemma":[0.98852485,0.0076555447,0.0009034007,0.0012295175,0.0013577511,0.00032893333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00912265,0.0016446883,0.0011634562,0.0030221257,0.0010232384,0.0062169507,0.0037055376,0.0018925528,0.011029263],"category_scores_gemma":[0.02560527,0.000735908,0.0016528481,0.003719982,0.004846985,0.012936476,0.0034224177,0.0043842345,0.0006943432],"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.000016884425,0.000021976291,0.00009776425,0.000083256076,0.000009375138,0.0000136059,0.0000856812,0.016075242,0.00029619204,0.9716206,0.0003663047,0.011313155],"study_design_scores_gemma":[0.00001435748,0.00006503865,0.0003326495,0.0000830138,0.000021297516,0.00005841096,0.000109010165,0.07432159,0.0010320935,0.91887575,0.0050642034,0.000022542572],"about_ca_topic_score_codex":0.00069634017,"about_ca_topic_score_gemma":0.00078657427,"teacher_disagreement_score":0.011029263,"about_ca_system_score_codex":0.0027217309,"about_ca_system_score_gemma":0.0017233817,"threshold_uncertainty_score":0.048245788},"labels":[],"label_agreement":null},{"id":"W4405272606","doi":"10.1007/s10479-024-06427-1","title":"Correction: Should we keep the tradition or follow the trend? The optimal live-streaming e-commerce mode selection in a sustainable and circular supply chain under competition","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Urban and Freight Transport Logistics","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":"Theory of computation; Competition (biology); Selection (genetic algorithm); Supply chain; Mode (computer interface); Computer science; Operations research; Industrial organization; Mathematical economics; Economics; Microeconomics; Mathematical optimization; Business; Marketing; Artificial intelligence; Mathematics; Algorithm; Biology","score_opus":0.16501313812711402,"score_gpt":0.35409052640716626,"score_spread":0.18907738828005224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405272606","genre_codex":"editorial","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.00016394754,0.00077144254,0.00083881157,0.11024655,0.8849143,0.000020420857,0.0014461561,0.00023186198,0.001366466],"genre_scores_gemma":[0.03389982,0.00688627,0.006446585,0.21535872,0.5825144,0.00027876414,0.0018477651,0.0015810834,0.15118654],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947601,0.0009841279,0.0009059643,0.0010160824,0.0018280207,0.00050572545],"domain_scores_gemma":[0.9263911,0.018651173,0.0034007588,0.0037346287,0.045320172,0.0025021038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051239408,0.0026210283,0.0024952712,0.0030516202,0.0032665285,0.0045401594,0.0043363683,0.010920298,0.043990135],"category_scores_gemma":[0.12907828,0.0012415638,0.0017891225,0.0034234475,0.0040049907,0.0032658393,0.0021764082,0.020594379,0.023690239],"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.000027145828,0.0000028603063,0.00006426542,0.00010516079,0.0000133370295,0.00013542517,0.00005423429,0.00006529881,0.00002418269,0.00096054596,0.99655735,0.001990189],"study_design_scores_gemma":[0.00010895413,0.000025833406,0.0013695305,0.000661714,0.00009272373,0.00063692115,0.0003478928,0.0010638288,0.0004135119,0.0039943433,0.99117076,0.00011392994],"about_ca_topic_score_codex":0.055661768,"about_ca_topic_score_gemma":0.038963366,"teacher_disagreement_score":0.055661768,"about_ca_system_score_codex":0.006231141,"about_ca_system_score_gemma":0.00929407,"threshold_uncertainty_score":0.14716166},"labels":[],"label_agreement":null},{"id":"W4405673204","doi":"10.1007/s10479-024-06436-0","title":"Collaborative evolution of logistics platform governance: a three-party evolutionary game perspective","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Digital Platforms and Economics","field":"Business, Management and Accounting","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":"University of Windsor","funders":"","keywords":"Theory of computation; Perspective (graphical); Corporate governance; Computer science; Game theory; Operations research; Mathematical economics; Economics; Management; Mathematics; Artificial intelligence","score_opus":0.12395492210019927,"score_gpt":0.37482797336484686,"score_spread":0.2508730512646476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405673204","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.6007157,0.00018378705,0.27889568,0.0029060515,0.00006377312,0.00030440502,0.000097406126,0.000060964732,0.116772175],"genre_scores_gemma":[0.98721725,0.00006589549,0.008815714,0.000058681424,0.000010309439,0.00006287191,0.000015883978,0.000008682709,0.003744637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703133,0.0018726356,0.000078590245,0.00031387896,0.0002887664,0.00041476617],"domain_scores_gemma":[0.9924148,0.005005822,0.0006945924,0.0007078139,0.0003844442,0.00079250307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042869397,0.00052503956,0.0007093867,0.0007250731,0.0014454658,0.0049810545,0.0019688143,0.0030951237,0.009220037],"category_scores_gemma":[0.014559382,0.0004158579,0.0009841449,0.0005999969,0.0033192004,0.005131501,0.0030363423,0.0017295568,0.00045748684],"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.00019536291,0.00031591812,0.00458454,0.00007919524,0.00015062593,0.0007963865,0.0019316238,0.15720117,0.0037416876,0.8153778,0.0007763207,0.014849477],"study_design_scores_gemma":[0.000106190724,0.0002204818,0.002665085,0.000030589257,0.00006702713,0.00018532995,0.0020182491,0.48943374,0.00062867126,0.5012074,0.0033824462,0.000054830623],"about_ca_topic_score_codex":0.0028770168,"about_ca_topic_score_gemma":0.0023403484,"teacher_disagreement_score":0.009220037,"about_ca_system_score_codex":0.0017186268,"about_ca_system_score_gemma":0.002026197,"threshold_uncertainty_score":0.030844092},"labels":[],"label_agreement":null},{"id":"W4406105499","doi":"10.1007/s10479-024-06418-2","title":"Evaluating economies of scope and potential merger: an alternative approach","year":2025,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Technologická Agentura České Republiky; European Commission","keywords":"Economies of scope; Scope (computer science); Frontier; Data envelopment analysis; Production (economics); Industrial organization; Production–possibility frontier; Economics; Economies of scale; Business; Microeconomics; Computer science; Mathematics","score_opus":0.5888806930953248,"score_gpt":0.6232797523450749,"score_spread":0.034399059249750175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406105499","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.22024152,0.0009923374,0.7624023,0.00049959775,0.000035490815,0.0003573866,0.00030445433,0.00007853007,0.015088349],"genre_scores_gemma":[0.92481405,0.00018573654,0.074085794,0.000030821968,0.000017122531,0.00015683977,0.00009641593,0.000009652611,0.00060367986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9897423,0.0058469963,0.0006472464,0.0007738,0.002671222,0.0003184869],"domain_scores_gemma":[0.95607567,0.033909455,0.0035468892,0.003142713,0.002744309,0.0005809837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01207578,0.0010674156,0.0015047293,0.010438287,0.0006354707,0.004209401,0.0017142637,0.0016116343,0.0035167232],"category_scores_gemma":[0.0538488,0.00050577946,0.0015683001,0.0066266865,0.003405395,0.005832391,0.0038595523,0.0013488734,0.00015330898],"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.00039547178,0.00040828134,0.021623777,0.00025088355,0.00043756704,0.00029616134,0.00042598374,0.3742192,0.0019964008,0.503757,0.00049839745,0.095690854],"study_design_scores_gemma":[0.000041514242,0.0003444763,0.011439382,0.00009176127,0.00010671562,0.00017846908,0.0004243844,0.76017886,0.0024906944,0.22273149,0.0018790908,0.000093136194],"about_ca_topic_score_codex":0.0018361554,"about_ca_topic_score_gemma":0.001271272,"teacher_disagreement_score":0.01207578,"about_ca_system_score_codex":0.0028109737,"about_ca_system_score_gemma":0.0011863032,"threshold_uncertainty_score":0.063863575},"labels":[],"label_agreement":null},{"id":"W4406106880","doi":"10.1007/s10479-024-06442-2","title":"Sustainable vehicle route planning under uncertainty for modular integrated construction: multi-trip time-dependent VRP with time windows and data analytics","year":2025,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Vehicle routing problem; Modular design; Truck; Computer science; Transport engineering; Integer programming; Operations research; Ant colony optimization algorithms; Routing (electronic design automation); Engineering; Computer network","score_opus":0.15333913247327524,"score_gpt":0.4288628080374323,"score_spread":0.2755236755641571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406106880","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.059022006,0.00050892803,0.9377375,0.00046065278,0.000060446793,0.00006000557,0.00048923906,0.00017851152,0.0014826487],"genre_scores_gemma":[0.9261141,0.0004587485,0.070378646,0.00005562364,0.0000661282,0.00012363026,0.00062075176,0.00012302783,0.002059478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987116,0.00049695466,0.0000656269,0.00034089654,0.00016985738,0.00021506351],"domain_scores_gemma":[0.99412525,0.0044734627,0.000613601,0.00021330963,0.00040271127,0.00017156295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035320427,0.0014573253,0.0026145556,0.001173099,0.00048453378,0.0018125492,0.0023690704,0.0016436724,0.0016891862],"category_scores_gemma":[0.009426738,0.0019686362,0.0016413939,0.0022170965,0.0011185787,0.0034743007,0.0019795368,0.0022357234,0.00016586346],"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.000013745668,0.000008042467,0.00012241815,0.000015504982,0.00001389077,0.000015115577,0.0000081877815,0.99598,0.000055077027,0.0017375473,0.00010569078,0.0019247923],"study_design_scores_gemma":[9.726746e-7,0.000004383989,0.00003610798,0.0000014298903,0.0000026263767,0.0000015629388,0.0000038179387,0.9984712,0.000025269797,0.0014170584,0.00003339535,0.0000020991724],"about_ca_topic_score_codex":0.0263032,"about_ca_topic_score_gemma":0.015354149,"teacher_disagreement_score":0.0263032,"about_ca_system_score_codex":0.0016848528,"about_ca_system_score_gemma":0.002064845,"threshold_uncertainty_score":0.052300215},"labels":[],"label_agreement":null},{"id":"W4406927510","doi":"10.1007/s10479-024-06327-4","title":"A generalized approach for multi-criteria decision aid methods","year":2025,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Qatar National Library; Qatar University","keywords":"Theory of computation; Computer science; Mathematical optimization; Mathematics; Algorithm","score_opus":0.8288587454749092,"score_gpt":0.7196189920463937,"score_spread":0.10923975342851555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406927510","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.0004052552,0.0001031735,0.9982141,0.00006346075,0.000020366155,0.000044335833,0.000014814192,0.000048878235,0.0010855797],"genre_scores_gemma":[0.058023073,0.0002940823,0.938891,0.0001237798,0.000073060524,0.0004978847,0.00005755043,0.000068564535,0.0019710385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99216604,0.005438627,0.00028922854,0.00037867136,0.0015627109,0.00016487871],"domain_scores_gemma":[0.99608624,0.0022373102,0.0001873007,0.00040277827,0.0009903121,0.0000961309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074202344,0.0017094698,0.0015556033,0.0024387052,0.0008286163,0.0024426756,0.0022297385,0.0011702769,0.0061068567],"category_scores_gemma":[0.009512247,0.00062418374,0.0019147587,0.0024600646,0.0012800625,0.0016102117,0.002937751,0.0024337913,0.001137352],"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.000050279785,0.00008585421,0.00036492143,0.00048246613,0.00021854295,0.00015491074,0.00024486575,0.36947668,0.0016329156,0.47642648,0.0026341695,0.14822793],"study_design_scores_gemma":[0.000021768863,0.000056283017,0.000085636406,0.00008812498,0.000032008444,0.000039895713,0.000034923094,0.75715494,0.00057921564,0.23132266,0.010562581,0.000021885726],"about_ca_topic_score_codex":0.0020901165,"about_ca_topic_score_gemma":0.0025903042,"teacher_disagreement_score":0.0074202344,"about_ca_system_score_codex":0.0012023515,"about_ca_system_score_gemma":0.0024392665,"threshold_uncertainty_score":0.039242387},"labels":[],"label_agreement":null},{"id":"W4407021778","doi":"10.1007/s10479-024-06390-x","title":"Value-at-risk constrained portfolios in incomplete markets: a dynamic programming approach to Heston’s model","year":2025,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","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":"Western University","funders":"Technische Universität München","keywords":"Theory of computation; Dynamic programming; Heston model; Incomplete markets; Value (mathematics); Value at risk; Econometrics; Computer science; Mathematical optimization; Mathematics; Economics; Mathematical economics; Risk management; Stochastic volatility; Statistics; SABR volatility model; Microeconomics; Volatility (finance); Algorithm; Finance","score_opus":0.12461591006994675,"score_gpt":0.3808112805915064,"score_spread":0.2561953705215596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407021778","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.07435082,0.00079829607,0.90429527,0.0021811207,0.00006794128,0.000077428755,0.00018521445,0.00006655802,0.017977418],"genre_scores_gemma":[0.9229945,0.0009522138,0.058669686,0.0002794454,0.00008344812,0.00026748155,0.00016316268,0.00008187147,0.016508173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991366,0.00051455887,0.000023159422,0.00010733409,0.000112335714,0.000106055086],"domain_scores_gemma":[0.9967098,0.002530126,0.00028865153,0.0000763297,0.00018413807,0.00021090465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028888325,0.0009186302,0.0016500998,0.00070641935,0.00048405782,0.0022418245,0.0013607854,0.0021048698,0.005039357],"category_scores_gemma":[0.0071298284,0.00089066493,0.0009645145,0.0008678036,0.0020322457,0.002515435,0.0013212966,0.002126707,0.00029469572],"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.000019080268,0.00002065321,0.00016590582,0.000023407618,0.000020161297,0.000066831446,0.00003644891,0.8836641,0.00012635466,0.11393921,0.00040931927,0.0015085541],"study_design_scores_gemma":[0.000013653927,0.000010917018,0.000051964744,0.000009291327,0.0000054105813,0.000007141164,0.000014058843,0.9454974,0.000049949136,0.054062106,0.00027033527,0.000007672991],"about_ca_topic_score_codex":0.00549174,"about_ca_topic_score_gemma":0.003509777,"teacher_disagreement_score":0.00549174,"about_ca_system_score_codex":0.0019736756,"about_ca_system_score_gemma":0.0016932881,"threshold_uncertainty_score":0.01685834},"labels":[],"label_agreement":null},{"id":"W4407194486","doi":"10.1007/s10479-025-06477-z","title":"Sustainable ridesharing routing and scheduling problem: an efficient multi-objective adaptive large neighborhood search","year":2025,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Transportation and Mobility Innovations","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":"Université du Québec à Montréal","funders":"Hebei Province Outstanding Youth Fund; Humanities and Social Sciences Youth Foundation, Ministry of Education of the People's Republic of China","keywords":"Computer science; Theory of computation; Scheduling (production processes); Vehicle routing problem; Mathematical optimization; Job shop scheduling; Routing (electronic design automation); Distributed computing; Computer network; Mathematics; Algorithm","score_opus":0.10301871189886422,"score_gpt":0.40639415954148794,"score_spread":0.3033754476426237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407194486","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.11361797,0.0010008549,0.87332475,0.00078794727,0.00013771569,0.00022138191,0.0002699126,0.00025011995,0.010389285],"genre_scores_gemma":[0.7809259,0.00051023264,0.20919527,0.00017052724,0.00008609917,0.00033217954,0.0003249065,0.00009283598,0.008361947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994684,0.00024194433,0.00001957281,0.00010892002,0.00009238238,0.000068857924],"domain_scores_gemma":[0.9993098,0.00046845968,0.000070817405,0.000028209462,0.00007428427,0.000048460148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012268767,0.0007406104,0.0018469276,0.000989591,0.0005578035,0.0009825502,0.0018175616,0.0017090508,0.002483037],"category_scores_gemma":[0.0022208116,0.0005634704,0.0007979334,0.0010889367,0.0006294526,0.0012336511,0.0011052085,0.0007758811,0.00020099054],"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.00006372675,0.00006264292,0.00023573401,0.000061324405,0.000033538814,0.00004806738,0.0000191403,0.982534,0.00043242026,0.004145094,0.00085257925,0.011511725],"study_design_scores_gemma":[0.000010401856,0.000024234772,0.00004006578,0.0000023959246,0.0000061249098,0.000007925407,0.000007725153,0.9987198,0.000051308973,0.0009666827,0.0001612106,0.0000021302033],"about_ca_topic_score_codex":0.0077071832,"about_ca_topic_score_gemma":0.0060238927,"teacher_disagreement_score":0.0077071832,"about_ca_system_score_codex":0.0008710494,"about_ca_system_score_gemma":0.0015458511,"threshold_uncertainty_score":0.015324652},"labels":[],"label_agreement":null},{"id":"W4407664878","doi":"10.1007/s10479-025-06504-z","title":"Enhancing unmanned aerial vehicles logistics for dynamic delivery: a hybrid non-dominated sorting genetic algorithm II with Bayesian belief networks","year":2025,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Sorting; Theory of computation; Computer science; Genetic algorithm; Bayesian probability; Algorithm; Artificial intelligence; Dynamic Bayesian network; Machine learning; Operations research; Mathematics","score_opus":0.024493277238973633,"score_gpt":0.33428920772002013,"score_spread":0.3097959304810465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407664878","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.0442867,0.00024124276,0.9497059,0.00028360222,0.000043474596,0.00008066153,0.000041911593,0.00020145651,0.0051150275],"genre_scores_gemma":[0.7856992,0.00028335533,0.20911632,0.00021761356,0.000036952533,0.00023413259,0.00011647103,0.000058577876,0.004237266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962986,0.00014656714,0.000010906574,0.000049426722,0.0001109816,0.000052281852],"domain_scores_gemma":[0.9995901,0.00022851337,0.000048935344,0.000018156794,0.00008620316,0.000028127479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008830724,0.00079777837,0.0007826299,0.0007891467,0.0003479158,0.0010353299,0.001119357,0.0010353216,0.0011550258],"category_scores_gemma":[0.0013793495,0.000438709,0.000666479,0.0006963601,0.0004319678,0.00063549797,0.0007371623,0.0007338452,0.00018143989],"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.000011698702,0.00002202262,0.0001737471,0.000008653445,0.000012066042,0.0000102709,0.000010749973,0.9902496,0.00023981102,0.001634673,0.00014396437,0.0074828975],"study_design_scores_gemma":[0.0000026270784,0.000008257475,0.000018076347,0.0000017034025,0.000001997551,0.000001326682,0.0000021525182,0.99947935,0.000045529,0.0003696749,0.00006847056,9.3565126e-7],"about_ca_topic_score_codex":0.016657563,"about_ca_topic_score_gemma":0.010627558,"teacher_disagreement_score":0.016657563,"about_ca_system_score_codex":0.001178406,"about_ca_system_score_gemma":0.0018305524,"threshold_uncertainty_score":0.03312123},"labels":[],"label_agreement":null},{"id":"W4408348918","doi":"10.1007/s10479-025-06541-8","title":"Two-stage hybrid flow shop scheduling with sequence-dependent setup times in semiconductor manufacturing: A customized variable neighborhood search","year":2025,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","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":"Université du Québec à Montréal","funders":"","keywords":"Theory of computation; Scheduling (production processes); Flow shop scheduling; Variable neighborhood search; Computer science; Stage (stratigraphy); Variable (mathematics); Job shop scheduling; Sequence (biology); Mathematical optimization; Industrial engineering; Mathematics; Algorithm; Engineering; Embedded system; Metaheuristic; Chemistry","score_opus":0.08975714486119546,"score_gpt":0.37725509621016456,"score_spread":0.2874979513489691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408348918","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.105434075,0.00046222704,0.8902114,0.0002068189,0.00006716502,0.00012407874,0.000056283443,0.0001472199,0.003290763],"genre_scores_gemma":[0.8127367,0.000205595,0.18332708,0.00008015431,0.000058850048,0.0002673102,0.0001035309,0.000065852815,0.0031549933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999469,0.00029266684,0.000016981403,0.000081374805,0.00008245244,0.000057527388],"domain_scores_gemma":[0.9985147,0.0011511545,0.00009936508,0.00005016548,0.000119404234,0.000065130545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017170903,0.00058570656,0.0019449613,0.0005857716,0.0005173538,0.00066607265,0.0017205243,0.0012860683,0.0017357094],"category_scores_gemma":[0.0028072523,0.00078617927,0.0010029605,0.0006811727,0.0005894942,0.0011992267,0.0009730546,0.00075832556,0.00012082637],"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.00009396965,0.00006313771,0.00018006134,0.000029981502,0.000023967481,0.000023283352,0.000013964091,0.98884225,0.00044878104,0.0032140499,0.00021811457,0.0068483464],"study_design_scores_gemma":[0.0000072077596,0.000018110786,0.000026776499,8.475077e-7,0.000002716549,0.000002332277,0.0000014179715,0.99955636,0.000034815625,0.00032019918,0.000027998016,0.0000011979331],"about_ca_topic_score_codex":0.0056091747,"about_ca_topic_score_gemma":0.004677836,"teacher_disagreement_score":0.0056091747,"about_ca_system_score_codex":0.0007566484,"about_ca_system_score_gemma":0.0015331673,"threshold_uncertainty_score":0.011153042},"labels":[],"label_agreement":null},{"id":"W4408970799","doi":"10.1007/s10479-025-06552-5","title":"Adaptive optimization approach for production and distribution planning of perishable food products under demand uncertainty","year":2025,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Theory of computation; Production (economics); Production planning; Food processing; Computer science; Distribution (mathematics); Mathematical optimization; Operations research; Mathematics; Economics; Microeconomics; Food science; Chemistry; Algorithm","score_opus":0.2041402963296177,"score_gpt":0.37813680160171736,"score_spread":0.17399650527209967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408970799","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.1347326,0.00050505064,0.8566201,0.00040602923,0.00004693505,0.00011073017,0.00021153115,0.0002712521,0.0070958366],"genre_scores_gemma":[0.96155953,0.000144235,0.03671047,0.000045182496,0.000011186876,0.00007615489,0.000098796496,0.00003940771,0.0013148569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993143,0.00026580732,0.000026400996,0.00014209498,0.00013834478,0.00011301844],"domain_scores_gemma":[0.9989656,0.0006822667,0.00013341132,0.000051613453,0.0001078554,0.00005920797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00151106,0.0009471636,0.00084209774,0.0006181131,0.00034453,0.0010173029,0.0009431213,0.001001201,0.0022635981],"category_scores_gemma":[0.0022123188,0.00059882714,0.00078232534,0.00073825335,0.0005875461,0.00081730174,0.0007018834,0.0010924304,0.00012864976],"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.0000120272325,0.000008357033,0.00010644117,0.000008908113,0.0000065172217,0.000014688789,0.0000070011192,0.9968689,0.00019893055,0.00081548217,0.00005175106,0.0019010474],"study_design_scores_gemma":[0.0000031742275,0.00001317603,0.00007159896,0.0000018390897,0.0000032361174,0.0000025274826,0.000004711802,0.9990753,0.00009093013,0.00065078516,0.00008074877,0.0000019852105],"about_ca_topic_score_codex":0.009505344,"about_ca_topic_score_gemma":0.0049957642,"teacher_disagreement_score":0.009505344,"about_ca_system_score_codex":0.0012696728,"about_ca_system_score_gemma":0.0013079497,"threshold_uncertainty_score":0.018900037},"labels":[],"label_agreement":null},{"id":"W4409284532","doi":"10.1007/s10479-025-06561-4","title":"Two simplex-based approximate stochastic dynamic programming schemes for a real hydropower management problem","year":2025,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Water resources management and optimization","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":"Rio Tinto (Canada); Université Laval; Laurentian University","funders":"","keywords":"Theory of computation; Mathematical optimization; Stochastic programming; Dynamic programming; Simplex; Computer science; Simplex algorithm; Hydropower; Mathematics; Linear programming; Algorithm; Combinatorics","score_opus":0.06274712068409638,"score_gpt":0.4042494648851683,"score_spread":0.3415023442010719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409284532","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.025465457,0.0003306178,0.96915364,0.00034395355,0.00009371686,0.00010018678,0.000056118442,0.00011187818,0.004344459],"genre_scores_gemma":[0.5727565,0.0004041809,0.42063865,0.00015745837,0.0000988165,0.00038106058,0.0001336671,0.00013445427,0.0052952147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911433,0.0004826733,0.0000430603,0.00007178583,0.0002083,0.00007971933],"domain_scores_gemma":[0.99732274,0.0016807637,0.00015417987,0.00018899234,0.00046351374,0.00018976424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028317338,0.00086039753,0.0015300754,0.0007521639,0.00063874654,0.0016781411,0.0016668711,0.0022091349,0.0036755637],"category_scores_gemma":[0.0068811635,0.0005845836,0.0009782293,0.0009979554,0.0010076128,0.0017392318,0.0019795105,0.0020983566,0.00034613544],"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.00013585867,0.000074023825,0.00017356913,0.00005643085,0.000024525434,0.000023822335,0.000078569225,0.9501649,0.0005241699,0.022655934,0.000534285,0.025553793],"study_design_scores_gemma":[0.000009056369,0.000018207882,0.000020991745,0.0000035099335,0.000002761104,0.0000034806467,0.000004360799,0.9979881,0.000057070298,0.0017367206,0.00015199238,0.000003757731],"about_ca_topic_score_codex":0.007262939,"about_ca_topic_score_gemma":0.0061313156,"teacher_disagreement_score":0.007262939,"about_ca_system_score_codex":0.0015519985,"about_ca_system_score_gemma":0.0020061315,"threshold_uncertainty_score":0.014975786},"labels":[],"label_agreement":null},{"id":"W4409542906","doi":"10.1007/s10479-025-06608-6","title":"Management science in the age of the internet and digital revolution","year":2025,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Big Data and Business Intelligence","field":"Business, Management and Accounting","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":"Université de Sherbrooke","funders":"","keywords":"Theory of computation; The Internet; Digital Revolution; Computer science; World Wide Web; Telecommunications; Algorithm","score_opus":0.22820790542207878,"score_gpt":0.43675045399961243,"score_spread":0.20854254857753365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409542906","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.01072027,0.18500483,0.005613124,0.6630689,0.0068210904,0.00001612882,0.0002386994,0.00010919235,0.12840779],"genre_scores_gemma":[0.58160275,0.24131869,0.005597986,0.08338425,0.055951484,0.00010656987,0.00021629839,0.00012731118,0.031694613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968189,0.0015353978,0.00012511112,0.00023581256,0.0010558332,0.00022898194],"domain_scores_gemma":[0.98876524,0.008004126,0.00072472286,0.00062691927,0.0010748641,0.0008042617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057293316,0.000439218,0.0007891588,0.0031805225,0.0038219718,0.012532622,0.00061256834,0.0053605395,0.0073198606],"category_scores_gemma":[0.011635127,0.00028782524,0.00033031614,0.0043620137,0.013283235,0.0167465,0.0024585745,0.006565307,0.0011898306],"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.000044679742,0.00006431742,0.00072314945,0.00021444702,0.000017948014,0.00013334202,0.001758566,0.00054119935,0.00015784007,0.88204,0.07843994,0.035864577],"study_design_scores_gemma":[0.0000121677485,0.000011887832,0.0005443332,0.00024048609,0.0000054346483,0.00006276477,0.0016883318,0.00044080036,0.00006191503,0.7380639,0.2588547,0.000013385023],"about_ca_topic_score_codex":0.0026740462,"about_ca_topic_score_gemma":0.0032213847,"teacher_disagreement_score":0.012532622,"about_ca_system_score_codex":0.0045926953,"about_ca_system_score_gemma":0.005761022,"threshold_uncertainty_score":0.033322513},"labels":[],"label_agreement":null},{"id":"W4410636405","doi":"10.1007/s10479-025-06663-z","title":"On random weighted coherent systems based on a new structure-based performance measure","year":2025,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Statistical Distribution Estimation and Applications","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":"McMaster University","funders":"","keywords":"Measure (data warehouse); Theory of computation; Computer science; Mathematics; Algorithm; Data mining","score_opus":0.25078242180109456,"score_gpt":0.4881953319757417,"score_spread":0.23741291017464716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410636405","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.009635262,0.00029171657,0.9874299,0.00020253555,0.00006825397,0.000019755564,0.000024229872,0.000038285947,0.0022900382],"genre_scores_gemma":[0.7153472,0.0025043865,0.26975885,0.0005512567,0.0008055709,0.00028073526,0.0003271091,0.0002471644,0.010177696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99726176,0.0014768604,0.00009253698,0.000403586,0.0005896918,0.00017561037],"domain_scores_gemma":[0.9915895,0.005937525,0.0007643677,0.00047001505,0.00093192735,0.00030671034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005200756,0.0018458501,0.0017221522,0.0017722955,0.00051489356,0.0023468952,0.0014940206,0.0020316956,0.0023645116],"category_scores_gemma":[0.01403442,0.0006264022,0.00090429076,0.0017948562,0.0027614292,0.004828466,0.0027879914,0.0018500023,0.00043326602],"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.00007600013,0.000046053086,0.00038473564,0.00010918769,0.00007727754,0.00008273128,0.0000991083,0.2835199,0.0039026623,0.6910145,0.0009785511,0.019709308],"study_design_scores_gemma":[0.000009887609,0.00007956515,0.00019006256,0.000019861793,0.000023976134,0.000055031596,0.0000131030765,0.87704754,0.0005620382,0.121357374,0.0006129631,0.00002857197],"about_ca_topic_score_codex":0.000704206,"about_ca_topic_score_gemma":0.0006944177,"teacher_disagreement_score":0.005200756,"about_ca_system_score_codex":0.0012610081,"about_ca_system_score_gemma":0.0011697732,"threshold_uncertainty_score":0.027504563},"labels":[],"label_agreement":null},{"id":"W4410637431","doi":"10.1007/s10479-025-06616-6","title":"Selecting a sustainable hydrogen production method using a novel dual evaluation EDAS approach","year":2025,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Hybrid Renewable Energy Systems","field":"Energy","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":"Khalifa University of Science, Technology and Research","keywords":"EDAS; Theory of computation; Dual (grammatical number); Computer science; Production (economics); Mathematical optimization; Mathematics; Artificial intelligence; Algorithm; Estimation of distribution algorithm; Microeconomics; Economics","score_opus":0.3230636913130012,"score_gpt":0.512624896531063,"score_spread":0.1895612052180618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410637431","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.03887034,0.00032854386,0.9477156,0.00020208964,0.00006945606,0.00016256471,0.000095090574,0.00018279089,0.012373412],"genre_scores_gemma":[0.6376031,0.00030721622,0.35264546,0.000097754644,0.00005455809,0.00031504227,0.00017220336,0.00007364917,0.008731022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885976,0.00040998685,0.000055655593,0.00013455874,0.0004237785,0.00011631525],"domain_scores_gemma":[0.99925977,0.0003370472,0.00006653667,0.000048553662,0.0002582179,0.00002975423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015883384,0.0011057457,0.0012289826,0.0017670257,0.0005481761,0.0016955773,0.0011657064,0.0010106417,0.004402614],"category_scores_gemma":[0.0019709573,0.00039677316,0.0012638686,0.0009803234,0.00040197445,0.0012461708,0.0013293839,0.0006567867,0.00045242367],"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.00053897506,0.00048355217,0.002585112,0.0004301879,0.00021077582,0.00020096243,0.00007744379,0.6582312,0.021451814,0.030126864,0.0013455814,0.2843176],"study_design_scores_gemma":[0.000019391766,0.00012378703,0.00036401686,0.00001767519,0.000039866616,0.0000419,0.00003902765,0.98844516,0.00443344,0.004999498,0.0014593322,0.00001695215],"about_ca_topic_score_codex":0.0018153172,"about_ca_topic_score_gemma":0.002718501,"teacher_disagreement_score":0.004402614,"about_ca_system_score_codex":0.0009258321,"about_ca_system_score_gemma":0.0010157034,"threshold_uncertainty_score":0.0147281885},"labels":[],"label_agreement":null},{"id":"W4411625814","doi":"10.1007/s10479-025-06699-1","title":"Optimal smoothing mechanism for actuarial discount rate in pension liability valuation in North America","year":2025,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Insurance, Mortality, Demography, Risk Management","field":"Social Sciences","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 Waterloo","funders":"Key Technologies Research and Development Program; Fundamental Research Funds for the Central Universities; Shanghai Office of Philosophy and Social Science; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Valuation (finance); Actuarial science; Liability; Pension; Economics; Mechanism (biology); Econometrics; Finance","score_opus":0.19287666443157714,"score_gpt":0.49615709386717866,"score_spread":0.3032804294356015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411625814","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.4756231,0.0010303563,0.50887644,0.0027809327,0.00014204522,0.000203515,0.00021301297,0.00045055963,0.010680029],"genre_scores_gemma":[0.96507674,0.00032034577,0.02915188,0.000118921955,0.000057115998,0.00006884218,0.00005350049,0.000043233067,0.005109549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984499,0.0008269174,0.00009366016,0.00029531535,0.00013260756,0.00020160699],"domain_scores_gemma":[0.9866399,0.010164564,0.00093240285,0.00092446286,0.0008841799,0.00045460105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008723289,0.0005627606,0.0014822778,0.0010382017,0.00086966314,0.0030005763,0.0020737683,0.0017576095,0.0037136462],"category_scores_gemma":[0.024639018,0.00095331046,0.0008145273,0.0008429142,0.0013376736,0.0032946013,0.0012282325,0.00208296,0.00031612965],"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.00068545924,0.000396546,0.0057296525,0.0001383495,0.0001634726,0.0002573844,0.001106341,0.41270518,0.004201725,0.4661219,0.0050736787,0.10342028],"study_design_scores_gemma":[0.00007790396,0.00007323867,0.00236692,0.00003974796,0.0000754529,0.00007673861,0.00019548554,0.8573656,0.00046617328,0.13791071,0.0012967957,0.00005521237],"about_ca_topic_score_codex":0.014027804,"about_ca_topic_score_gemma":0.009836918,"teacher_disagreement_score":0.014027804,"about_ca_system_score_codex":0.003434879,"about_ca_system_score_gemma":0.0025753458,"threshold_uncertainty_score":0.046133697},"labels":[],"label_agreement":null},{"id":"W4411870151","doi":"10.1007/s10479-025-06704-7","title":"Emerging trends in the interplay between analytics and operations in MSMEs","year":2025,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Big Data and Business Intelligence","field":"Business, Management and Accounting","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 Manitoba","funders":"","keywords":"Theory of computation; Analytics; Computer science; Data science; Algorithm","score_opus":0.2964710677610711,"score_gpt":0.5148256317080159,"score_spread":0.21835456394694475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411870151","genre_codex":"empirical","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6586086,0.06373562,0.011695673,0.18346766,0.00094517594,0.000029185747,0.00077289995,0.0001377945,0.08060733],"genre_scores_gemma":[0.97635514,0.01582813,0.002142359,0.0024949661,0.0009984362,0.00001695413,0.00019109211,0.000030136509,0.001942913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99821556,0.00068015495,0.00010834358,0.0002550316,0.00045760136,0.00028336182],"domain_scores_gemma":[0.98041064,0.011703098,0.0027361785,0.00042303253,0.002607186,0.0021198457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048934515,0.00019585426,0.00030031183,0.0029611925,0.00087370607,0.009851303,0.00071118225,0.0013269641,0.0052385586],"category_scores_gemma":[0.014889289,0.00023339895,0.00024279194,0.005346473,0.002834164,0.013591538,0.0021265582,0.0021730918,0.00049306115],"study_design_candidate":"observational","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.00032566692,0.00029036868,0.21796805,0.0007915038,0.00009570326,0.0004011655,0.015610366,0.0017980379,0.0015741565,0.50583816,0.01707588,0.23823097],"study_design_scores_gemma":[0.000025244906,0.0002967874,0.32840523,0.002103674,0.00007705509,0.0009020082,0.111261584,0.015699139,0.0012950043,0.25516385,0.28463927,0.0001311163],"about_ca_topic_score_codex":0.004735697,"about_ca_topic_score_gemma":0.009300224,"teacher_disagreement_score":0.009851303,"about_ca_system_score_codex":0.0022869143,"about_ca_system_score_gemma":0.0026148728,"threshold_uncertainty_score":0.025879383},"labels":[],"label_agreement":null},{"id":"W4412552465","doi":"10.1007/s10479-025-06638-0","title":"A hybrid approach for resilient sourcing and supply chain network design","year":2025,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Supply Chain Resilience and Risk 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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Theory of computation; Supply chain; Computer science; Supply chain network; Supply chain management; Chain (unit); Business; Algorithm; Marketing","score_opus":0.12748517526952988,"score_gpt":0.37801052959982556,"score_spread":0.25052535433029566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412552465","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.002814162,0.00006700818,0.9955212,0.000067980116,0.000015683889,0.00003805368,0.000018320607,0.00006805529,0.0013895207],"genre_scores_gemma":[0.241127,0.00031978238,0.7532784,0.0001072707,0.00006719599,0.00029349054,0.00011234543,0.00011604195,0.004578558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888855,0.00046310172,0.00005103691,0.00016751587,0.00033340792,0.00009639308],"domain_scores_gemma":[0.9985536,0.00085719366,0.000102969294,0.00016955375,0.00024254124,0.000074048745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015585129,0.0010054619,0.0009612417,0.0015019901,0.00077875506,0.0017129196,0.0019590463,0.001413993,0.0061039864],"category_scores_gemma":[0.003446895,0.0008088933,0.0015170013,0.0014244269,0.00090890046,0.0017485331,0.0022766935,0.0012542449,0.00056339416],"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.000038565515,0.00005738474,0.0003266049,0.00009148864,0.00007200021,0.00007387372,0.000090487294,0.89944255,0.0024057005,0.04542059,0.0005718264,0.05140895],"study_design_scores_gemma":[0.0000064153082,0.00002305628,0.000028196795,0.000009079543,0.000014911375,0.000014753768,0.00001611583,0.97961134,0.0002779155,0.019034704,0.0009582787,0.000005221272],"about_ca_topic_score_codex":0.002535748,"about_ca_topic_score_gemma":0.0034392527,"teacher_disagreement_score":0.0061039864,"about_ca_system_score_codex":0.0010981085,"about_ca_system_score_gemma":0.0014385025,"threshold_uncertainty_score":0.020419896},"labels":[],"label_agreement":null},{"id":"W4412639113","doi":"10.1007/s10479-025-06685-7","title":"A closed loop supply chain with environmental, manufacturing and recycling decisions","year":2025,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","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":"McMaster University","funders":"","keywords":"Supply chain; Theory of computation; Closed loop; Loop (graph theory); Computer science; Operations research; Business; Mathematics; Engineering; Control engineering; Algorithm","score_opus":0.07999693406996555,"score_gpt":0.3551215444414657,"score_spread":0.27512461037150016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412639113","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.27899605,0.000454762,0.6586275,0.0026156772,0.00028380522,0.00041253265,0.00069259846,0.00074254256,0.057174597],"genre_scores_gemma":[0.95190966,0.00025519548,0.026375053,0.00010177574,0.00008650289,0.0001390909,0.00016860668,0.00004205037,0.020922069],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972572,0.000971271,0.00012307975,0.0007404786,0.00053216185,0.00037595778],"domain_scores_gemma":[0.99432015,0.0035319107,0.00049568526,0.0003517426,0.00096353545,0.00033689305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030398476,0.0010825214,0.0014495288,0.0014080798,0.0021597063,0.008368926,0.0024262017,0.004019043,0.01617164],"category_scores_gemma":[0.0074677938,0.0014691917,0.0011775033,0.0021641715,0.0036101458,0.0072104433,0.0031458759,0.001966231,0.0016575673],"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.0006792928,0.00042833635,0.0027119871,0.00018697414,0.00015788164,0.001512203,0.00057174376,0.8208952,0.0040519163,0.13696767,0.0015321281,0.030304665],"study_design_scores_gemma":[0.0001303454,0.00039857178,0.0005713013,0.000041582145,0.00009092671,0.0001399384,0.00021268657,0.8801834,0.0012419459,0.114433475,0.0024765627,0.00007925627],"about_ca_topic_score_codex":0.009423773,"about_ca_topic_score_gemma":0.005347802,"teacher_disagreement_score":0.01617164,"about_ca_system_score_codex":0.0027584906,"about_ca_system_score_gemma":0.0038205343,"threshold_uncertainty_score":0.0540995},"labels":[],"label_agreement":null},{"id":"W4412917335","doi":"10.1007/s10479-025-06682-w","title":"Improved block rearrangement algorithm","year":2025,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Cryptography and Data Security","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":"York University","funders":"Fonds Wetenschappelijk Onderzoek","keywords":"Theory of computation; Computer science; Block (permutation group theory); Algorithm; Mathematics; Combinatorics","score_opus":0.12811141626620398,"score_gpt":0.4464913557260017,"score_spread":0.3183799394597977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412917335","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.040003706,0.0007281852,0.9307714,0.00058155844,0.00047798656,0.00028679313,0.00061836117,0.0028838431,0.023648083],"genre_scores_gemma":[0.17846137,0.00045798137,0.77571094,0.000351322,0.00027883713,0.00038960148,0.0020763264,0.00059866277,0.04167494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904376,0.00019853617,0.000057611483,0.0002139563,0.00034136605,0.00014475931],"domain_scores_gemma":[0.99919957,0.00012915467,0.00004927027,0.00036230698,0.00021414341,0.000045465844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053201726,0.000697219,0.0010442989,0.0011469923,0.0009673587,0.0011167102,0.001594356,0.00090211135,0.0222989],"category_scores_gemma":[0.0017027534,0.00040285487,0.0007869457,0.001939652,0.00058862055,0.0016765513,0.0015504652,0.0012083799,0.008219448],"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.000938595,0.0003403174,0.0008267501,0.0002068159,0.00009031593,0.0001585791,0.00014385188,0.04959256,0.042551313,0.099390656,0.032733366,0.77302694],"study_design_scores_gemma":[0.00049819937,0.0007033276,0.0017670713,0.00006376651,0.00016234149,0.0006787758,0.00013794626,0.7265446,0.057213176,0.10877855,0.10334751,0.00010479935],"about_ca_topic_score_codex":0.0021372633,"about_ca_topic_score_gemma":0.0029169258,"teacher_disagreement_score":0.0222989,"about_ca_system_score_codex":0.0006936944,"about_ca_system_score_gemma":0.001715493,"threshold_uncertainty_score":0.07459724},"labels":[],"label_agreement":null},{"id":"W4413215598","doi":"10.1007/s10479-025-06765-8","title":"A simple derivation of the waiting-time distribution (in the queue) for the bulk-service $$M/G^{(a,b)}/1$$ queueing system","year":2025,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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":"Royal Military College of Canada","funders":"","keywords":"Simple (philosophy); Theory of computation; Queueing theory; Queueing system; Queue; Computer science; Service (business); Bulk queue; Distribution (mathematics); Mathematical optimization; Mathematics; Discrete mathematics; Applied mathematics; Computer network; Algorithm; Mathematical analysis; Business","score_opus":0.09808665355295156,"score_gpt":0.3930079840448452,"score_spread":0.2949213304918937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413215598","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.009713689,0.0009253291,0.96429336,0.0012329316,0.00061966386,0.000105898194,0.00039479538,0.00029227554,0.022422137],"genre_scores_gemma":[0.37272164,0.0028995972,0.54601043,0.0018571947,0.0010612077,0.00037855437,0.00063049834,0.0009828266,0.07345808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962175,0.00006734896,0.000023695093,0.000051481875,0.00018837594,0.000047254816],"domain_scores_gemma":[0.9992932,0.00033034667,0.000030242658,0.00005545833,0.00024688576,0.00004391301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014414116,0.0007616114,0.0008159256,0.0011459286,0.00075714866,0.0013254093,0.0018648019,0.0011202904,0.011954456],"category_scores_gemma":[0.0048760097,0.0005069664,0.0008780541,0.0011375059,0.00087040645,0.002129365,0.0010807444,0.0020708228,0.0035422966],"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.000025466488,0.000045137353,0.00028281988,0.00009097046,0.000016485958,0.00019367816,0.00015429739,0.034518305,0.004354367,0.9344147,0.007339299,0.018564533],"study_design_scores_gemma":[0.000034845394,0.000035217698,0.00047601855,0.000046870115,0.000022423743,0.00021261607,0.000036575693,0.54343545,0.0010659606,0.4396543,0.014933241,0.000046511133],"about_ca_topic_score_codex":0.008457943,"about_ca_topic_score_gemma":0.007334129,"teacher_disagreement_score":0.011954456,"about_ca_system_score_codex":0.0018224283,"about_ca_system_score_gemma":0.002736825,"threshold_uncertainty_score":0.039991617},"labels":[],"label_agreement":null},{"id":"W4413411476","doi":"10.1007/s10479-025-06781-8","title":"Set-valued $$\\Phi $$-coherent risk measures for sustainable decision-making","year":2025,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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":"Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Set (abstract data type); Computer science; Algorithm","score_opus":0.326874455026115,"score_gpt":0.5719149145548164,"score_spread":0.24504045952870135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413411476","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.011077189,0.0008192958,0.983564,0.0008455482,0.000108099404,0.00003361431,0.00008282201,0.000048329603,0.00342108],"genre_scores_gemma":[0.6385664,0.001961712,0.35244912,0.00044389328,0.00048683147,0.00037453196,0.00033798005,0.000109002955,0.0052704983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99283254,0.003759038,0.00041521687,0.00074128143,0.0019249485,0.0003270249],"domain_scores_gemma":[0.9874856,0.0077380696,0.0014574428,0.0010135368,0.001809206,0.0004962018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009205704,0.0016949703,0.0019406298,0.0023117915,0.0006214565,0.0054732417,0.0016829746,0.0018343393,0.0021710105],"category_scores_gemma":[0.023680363,0.00075077347,0.0016722573,0.0025940102,0.0033450716,0.0067645973,0.0038204256,0.0041815587,0.00035310414],"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.000030134486,0.000048847232,0.00026853426,0.0000965287,0.00007762871,0.000040644623,0.00007931433,0.092774525,0.0005409745,0.8816955,0.0011429715,0.023204334],"study_design_scores_gemma":[0.000007110793,0.000042819203,0.00013315665,0.000041964864,0.000018499588,0.00002386352,0.000022789067,0.24494974,0.00028136664,0.7534547,0.0010057117,0.00001823287],"about_ca_topic_score_codex":0.00081219827,"about_ca_topic_score_gemma":0.00065899885,"teacher_disagreement_score":0.009205704,"about_ca_system_score_codex":0.0022771498,"about_ca_system_score_gemma":0.002051491,"threshold_uncertainty_score":0.048684955},"labels":[],"label_agreement":null},{"id":"W4413940000","doi":"10.1007/s10479-025-06804-4","title":"Randomized algorithms for fully online multiprocessor scheduling with testing","year":2025,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","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 Alberta","funders":"","keywords":"Computer science; Theory of computation; Multiprocessing; Parallel computing; Multiprocessor scheduling; Randomized algorithm; Scheduling (production processes); Algorithm; Fair-share scheduling; Rate-monotonic scheduling; Mathematical optimization; Mathematics; Operating system; Schedule","score_opus":0.20645734329322205,"score_gpt":0.4393213788118706,"score_spread":0.23286403551864857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413940000","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.020314366,0.0006676498,0.969842,0.0013442301,0.000274704,0.00034732133,0.00042720517,0.0019779708,0.0048045237],"genre_scores_gemma":[0.47629252,0.0004205244,0.51314545,0.00076480384,0.0006395806,0.0013734709,0.0011191324,0.0006756928,0.0055688284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98984236,0.0059822267,0.00044566736,0.001386371,0.0011533166,0.0011900716],"domain_scores_gemma":[0.90684223,0.078759186,0.0031922013,0.007413531,0.0020995087,0.0016933801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012760275,0.002801376,0.0045990627,0.0020165106,0.0017308654,0.0033578246,0.007099393,0.003387165,0.009812073],"category_scores_gemma":[0.052651744,0.0019594978,0.0019559043,0.0028347273,0.0042029982,0.008212101,0.0042063682,0.006037776,0.001305841],"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.0023741198,0.0009858583,0.001120366,0.00041477985,0.00016844038,0.00012482308,0.00010379093,0.7788172,0.001169449,0.095213406,0.011898656,0.1076091],"study_design_scores_gemma":[0.00028074882,0.00011611746,0.00009891217,0.000018549703,0.000021989423,0.000018097273,0.000010676912,0.9335143,0.00030485928,0.06521026,0.00039058566,0.000014913266],"about_ca_topic_score_codex":0.0049450565,"about_ca_topic_score_gemma":0.005760421,"teacher_disagreement_score":0.012760275,"about_ca_system_score_codex":0.0034906967,"about_ca_system_score_gemma":0.006662279,"threshold_uncertainty_score":0.067483604},"labels":[],"label_agreement":null},{"id":"W4414171846","doi":"10.1007/s10479-025-06746-x","title":"Comparisons of mean-variance analysis and entropy-based approaches to portfolio selection under asymmetric returns in bear and bull markets","year":2025,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Financial Markets and Investment Strategies","field":"Economics, Econometrics and Finance","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":"Dalhousie University","funders":"","keywords":"Portfolio; Portfolio optimization; Post-modern portfolio theory; Sharpe ratio; Autoregressive model; Capital asset pricing model; Rate of return on a portfolio; Replicating portfolio; Financial market","score_opus":0.24148770661282243,"score_gpt":0.3554903035305996,"score_spread":0.1140025969177772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414171846","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.4745588,0.0017372738,0.5197889,0.0007527154,0.0000764258,0.00008363823,0.0001030778,0.00023536696,0.0026636904],"genre_scores_gemma":[0.9455515,0.0005968573,0.052290455,0.00010145465,0.0001478639,0.00004935139,0.00018520006,0.00007699523,0.0010003046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950604,0.0037363598,0.0001688556,0.00021736973,0.00063273736,0.00018430768],"domain_scores_gemma":[0.91767454,0.07678087,0.0015504641,0.0012779032,0.0022261136,0.000490187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01831936,0.00064091076,0.0015853363,0.0031783762,0.0004981696,0.0020918318,0.0012984804,0.0011257452,0.0011806925],"category_scores_gemma":[0.045963764,0.00051604,0.0014527584,0.0016005497,0.0011976549,0.003753753,0.0013392268,0.0012741758,0.00010930681],"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.0015223713,0.0003591642,0.026284538,0.0002496916,0.001323078,0.00012758219,0.0005042577,0.74125654,0.0017517031,0.08022757,0.0014104315,0.14498316],"study_design_scores_gemma":[0.000041160198,0.00008277175,0.005003197,0.000011408407,0.00006804587,0.000016054637,0.000039846153,0.9759345,0.00031358044,0.018361233,0.00010395635,0.00002422574],"about_ca_topic_score_codex":0.0035691808,"about_ca_topic_score_gemma":0.0036470057,"teacher_disagreement_score":0.01831936,"about_ca_system_score_codex":0.0013583836,"about_ca_system_score_gemma":0.0015230095,"threshold_uncertainty_score":0.09688318},"labels":[],"label_agreement":null},{"id":"W4414213966","doi":"10.1007/s10479-025-06821-3","title":"On the sensitivity of restless bandits solutions to uncertainty in the models of the arms","year":2025,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","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":"McGill University","funders":"","keywords":"Markov decision process; Heuristic; Theory of computation; Equivalence (formal languages); Sensitivity (control systems); Scheduling (production processes); Markov process; Job shop scheduling; Dynamic programming","score_opus":0.601241179788179,"score_gpt":0.5791320940734874,"score_spread":0.022109085714691612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414213966","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.30226892,0.007744518,0.637014,0.015140302,0.00045482692,0.00026308178,0.0012556773,0.00069238094,0.03516624],"genre_scores_gemma":[0.97015196,0.0036665506,0.01611291,0.0010584407,0.00041796663,0.00022543586,0.00045697085,0.0002052648,0.0077044447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99317944,0.0045702304,0.00022725754,0.0006907061,0.00053968845,0.000792759],"domain_scores_gemma":[0.7570537,0.22492358,0.00944693,0.0033278111,0.0031799017,0.0020681077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02055503,0.0029389076,0.0052864314,0.0030940864,0.0015165269,0.006136149,0.0032822248,0.0053770803,0.0063832863],"category_scores_gemma":[0.14462347,0.0024667683,0.002429023,0.002147035,0.00815363,0.007319483,0.0057995045,0.008173896,0.00044809724],"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.0003488671,0.00008405768,0.0013000529,0.0002457321,0.00018324394,0.000115675815,0.00017949878,0.8357634,0.0006382681,0.15327816,0.0023688958,0.0054942286],"study_design_scores_gemma":[0.000045268673,0.000069017726,0.00054057117,0.00009109263,0.000060697035,0.000041869953,0.00009208118,0.83728546,0.00023013809,0.16114783,0.00033485008,0.00006115571],"about_ca_topic_score_codex":0.008136946,"about_ca_topic_score_gemma":0.0027622683,"teacher_disagreement_score":0.02055503,"about_ca_system_score_codex":0.004130454,"about_ca_system_score_gemma":0.0024094514,"threshold_uncertainty_score":0.10870671},"labels":[],"label_agreement":null},{"id":"W4414358657","doi":"10.1007/s10479-025-06845-9","title":"Bayesian network modeling for ROI simulation and scenario analysis: a case study on commercial aquaponics","year":2025,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Innovations in Aquaponics and Hydroponics Systems","field":"Agricultural and Biological Sciences","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 Lethbridge; Lethbridge College","funders":"","keywords":"Flexibility (engineering); Variety (cybernetics); Bayesian network; Resource (disambiguation); Sustainability; Aquaponics; Bayesian probability; Range (aeronautics); Profitability index","score_opus":0.34461525568467055,"score_gpt":0.5005654714985831,"score_spread":0.15595021581391255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414358657","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.27379563,0.0004499599,0.7032962,0.0016848868,0.000056543828,0.0003402723,0.0008974091,0.0005321894,0.018946977],"genre_scores_gemma":[0.8953532,0.00028922257,0.098825015,0.00006702355,0.000015813976,0.00020817481,0.00041508614,0.00009144387,0.004735047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984035,0.0010746932,0.000044210978,0.00016702736,0.00019592057,0.00011471229],"domain_scores_gemma":[0.9882808,0.010454344,0.00030491274,0.00020218338,0.00054902775,0.00020884244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042466247,0.0009933601,0.0008649671,0.0011787091,0.0008753072,0.0018691783,0.0016885792,0.0022433514,0.0047743795],"category_scores_gemma":[0.010839344,0.00071967155,0.0009796891,0.0015275192,0.0007039936,0.0021934144,0.0010194367,0.0017774319,0.00034410998],"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.000039129412,0.000041835734,0.0007864369,0.000016734635,0.000014007216,0.00011125076,0.000057007936,0.9864812,0.00014557819,0.0067373347,0.00028699488,0.005282431],"study_design_scores_gemma":[0.0000064426245,0.000011629029,0.00013365601,0.000003790202,0.0000053542094,0.00001717581,0.000024094232,0.99617094,0.00006827724,0.0033186697,0.00023455614,0.0000053473004],"about_ca_topic_score_codex":0.041162573,"about_ca_topic_score_gemma":0.033168506,"teacher_disagreement_score":0.041162573,"about_ca_system_score_codex":0.0027963223,"about_ca_system_score_gemma":0.0020903463,"threshold_uncertainty_score":0.081846},"labels":[],"label_agreement":null},{"id":"W4416075108","doi":"10.1007/s10479-025-06926-9","title":"Strategic pricing and investment in environmental quality by an incumbent facing a greenwasher entrant","year":2025,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Environmental Sustainability in Business","field":"Business, Management and Accounting","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":"MacEwan University; HEC Montréal","funders":"","keywords":"Greenwashing; Quality (philosophy); Investment (military); Environmental quality; Theory of computation; Competitive advantage; Market size","score_opus":0.1298599074727212,"score_gpt":0.40073058767788733,"score_spread":0.27087068020516614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416075108","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.9915701,0.000011596159,0.00006858592,0.0018933975,0.000013339945,0.000006445445,0.000008245351,0.000002508209,0.0064256703],"genre_scores_gemma":[0.99779993,0.000017670034,0.000039808798,0.000083882725,0.000008066996,0.000001065038,0.000005196908,9.951816e-7,0.0020434307],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951017,0.000116714,0.000015435564,0.000024018225,0.00008701601,0.00024661646],"domain_scores_gemma":[0.99796605,0.0006930583,0.0002479415,0.000031785523,0.00023662536,0.0008245579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094258005,0.00014304543,0.00018814369,0.00047396997,0.0023435892,0.003375321,0.0004320856,0.002001777,0.007156142],"category_scores_gemma":[0.0029450506,0.0001560807,0.0002864496,0.00027570332,0.00061161537,0.0010433313,0.0010845461,0.0021119576,0.00031027428],"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.00419851,0.010455879,0.7362709,0.00008325404,0.0002821911,0.02683443,0.016159732,0.027686734,0.018116536,0.06514365,0.015977398,0.078790836],"study_design_scores_gemma":[0.0002313807,0.002208161,0.69278586,0.000060299484,0.00025643856,0.0027168666,0.15431665,0.10720011,0.0041716243,0.019963497,0.015851166,0.00023796032],"about_ca_topic_score_codex":0.023790402,"about_ca_topic_score_gemma":0.05661496,"teacher_disagreement_score":0.023790402,"about_ca_system_score_codex":0.0031500973,"about_ca_system_score_gemma":0.0024598457,"threshold_uncertainty_score":0.047303855},"labels":[],"label_agreement":null},{"id":"W4416211947","doi":"10.1007/s10479-025-06884-2","title":"Computer-Aided process planning group technology and delayed product differentiation for hybrid manufacturing using a hybridized machine learning and optimization approach","year":2025,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Product Development and Customization","field":"Business, Management and Accounting","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 Windsor; Regional Municipality of Niagara","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cellular manufacturing; Group technology; Theory of computation; Process (computing); Product (mathematics); Production planning; New product development; Production (economics)","score_opus":0.07092728411741997,"score_gpt":0.356019356740556,"score_spread":0.2850920726231361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416211947","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.04408933,0.00016548135,0.95272607,0.000089916786,0.000026557964,0.000034239012,0.000027830492,0.0003276206,0.0025129402],"genre_scores_gemma":[0.79722124,0.00010925168,0.19928344,0.00004174525,0.000018089257,0.00010456013,0.000061391336,0.00005505394,0.003105352],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997112,0.00010724157,0.00001429484,0.000060013186,0.00007197853,0.000035186218],"domain_scores_gemma":[0.9993174,0.00048843515,0.000045052464,0.00003146159,0.000103061524,0.000014591493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071224675,0.0004727483,0.0006740158,0.00076445844,0.00042107003,0.0008531933,0.00062282383,0.00077849434,0.0019983042],"category_scores_gemma":[0.0011988858,0.00053274876,0.00075338804,0.00084451085,0.00048779964,0.0006465856,0.0005103513,0.0006330425,0.00018725243],"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.000036811736,0.000028815739,0.00028337157,0.000014258053,0.000016029506,0.000018544326,0.000015860065,0.9716665,0.0015224844,0.0021437865,0.00009600082,0.024157492],"study_design_scores_gemma":[0.0000017860742,0.000009646425,0.00006154456,7.64305e-7,0.000002676657,0.0000030756173,0.0000019828233,0.99907374,0.0003457599,0.00043383645,0.00006343972,0.0000017442937],"about_ca_topic_score_codex":0.011781729,"about_ca_topic_score_gemma":0.010471888,"teacher_disagreement_score":0.011781729,"about_ca_system_score_codex":0.0011386664,"about_ca_system_score_gemma":0.0014771557,"threshold_uncertainty_score":0.023426294},"labels":[],"label_agreement":null},{"id":"W70512572","doi":"10.1023/a:1014903232563","title":"Operational Decisions in AGV-Served Flowshop Loops: Scheduling","year":2001,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":18,"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":"Natural Sciences and Engineering Research Council of Canada; University of Texas at Dallas","keywords":"Computer science; Theory of computation; Maximization; Sizing; Scheduling (production processes); Mathematical optimization; Decomposition; Job shop scheduling; Minification; Set (abstract data type); Genetic algorithm; Material flow; Schedule; Operations research; Industrial engineering; Algorithm; Mathematics; Engineering","score_opus":0.24446898892206767,"score_gpt":0.43355618102556936,"score_spread":0.1890871921035017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W70512572","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.40439022,0.00049200025,0.58820885,0.00066348526,0.00014082687,0.00013304374,0.00014355691,0.00018825229,0.005639829],"genre_scores_gemma":[0.9746524,0.00018408823,0.022507815,0.000044767963,0.00006217876,0.000030727464,0.00007910351,0.00004005217,0.0023989377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933726,0.00024948677,0.00002236915,0.00010464356,0.00009663947,0.0001896139],"domain_scores_gemma":[0.99786097,0.001353644,0.0002617043,0.00006724265,0.0002608713,0.00019562447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016087275,0.0007684855,0.0010237162,0.00066203333,0.00094135274,0.0018031879,0.0010493916,0.0011575905,0.0025776606],"category_scores_gemma":[0.004582822,0.0005997776,0.00042259187,0.0011957313,0.00089580554,0.0014166813,0.0007480076,0.0006997662,0.0002475893],"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.00047107175,0.00016935372,0.0014233072,0.000071599265,0.000038237078,0.00022285704,0.00014761886,0.9522834,0.0022652135,0.010770144,0.0014842938,0.030652909],"study_design_scores_gemma":[0.0000129620275,0.000054867276,0.0001565628,0.000002463149,0.000009182369,0.000015194519,0.00003998068,0.99380255,0.00042369062,0.0052959085,0.00018258402,0.0000040348104],"about_ca_topic_score_codex":0.006476378,"about_ca_topic_score_gemma":0.005467887,"teacher_disagreement_score":0.006476378,"about_ca_system_score_codex":0.0009938958,"about_ca_system_score_gemma":0.001057494,"threshold_uncertainty_score":0.012877345},"labels":[],"label_agreement":null},{"id":"W75241701","doi":"10.1023/a:1013138919445","title":"A Comprehensive Input Format for Stochastic Linear Programs","year":2001,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Mathematical Programming","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":"Dalhousie University","funders":"","keywords":"Theory of computation; Range (aeronautics); Computer science; Mathematical economics; Mathematical optimization; Mathematics; Applied mathematics; Algorithm; Engineering","score_opus":0.32938202019815765,"score_gpt":0.45775449056652306,"score_spread":0.1283724703683654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75241701","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.0021212918,0.00027189808,0.94152063,0.00085897243,0.00039544943,0.00026093828,0.018054573,0.023220021,0.013296144],"genre_scores_gemma":[0.057573598,0.001253226,0.8742293,0.00054783694,0.00036262063,0.0019804013,0.031658173,0.0105558215,0.021839041],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99723023,0.00078191824,0.00045272068,0.00026683466,0.0010337363,0.00023457546],"domain_scores_gemma":[0.9914077,0.0042125816,0.0002833827,0.0016338665,0.002301904,0.00016056659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002941035,0.0022070769,0.0013996897,0.0021207824,0.0010295489,0.004614274,0.0024710489,0.0019584014,0.08332255],"category_scores_gemma":[0.021740796,0.0012154678,0.0015160395,0.003510644,0.0005701323,0.0050157593,0.0029378876,0.003259807,0.02717921],"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.0010508824,0.00037282892,0.00083288806,0.0014511023,0.00007483792,0.00060813886,0.00033527205,0.07722991,0.006278973,0.19609231,0.26936415,0.44630873],"study_design_scores_gemma":[0.00027020223,0.00021679394,0.00046456564,0.00066088187,0.00006831932,0.00049821584,0.00014553149,0.42155522,0.02761376,0.2303661,0.3179728,0.00016762398],"about_ca_topic_score_codex":0.0015308907,"about_ca_topic_score_gemma":0.0021763379,"teacher_disagreement_score":0.08332255,"about_ca_system_score_codex":0.0010372843,"about_ca_system_score_gemma":0.0019245921,"threshold_uncertainty_score":0.27874172},"labels":[],"label_agreement":null}]}