{"meta":{"query_hash":"fe945fa9143d","filters":{"venue":"OR Spectrum"},"cohort_total":28,"direct_labels_cover":0,"predictions_cover":28,"exported":28,"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/fe945fa9143d","api":"https://metacan.xera.ac/api/v1/cohort?venue=OR+Spectrum"},"results":[{"id":"W1913567289","doi":"10.1007/s00291-015-0413-z","title":"Constructive and blocking power in collaborative transportation","year":2015,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Game Theory and Voting Systems","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":"Université Laval","funders":"","keywords":"Constructive; Blocking (statistics); Computer science; Block (permutation group theory); Power (physics); Operations research; Business; Industrial organization; Computer network; Process (computing); Engineering; Mathematics","score_opus":0.02700309089256899,"score_gpt":0.22783416986780383,"score_spread":0.20083107897523483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1913567289","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96983594,0.00037840835,0.00023236411,0.00029071554,0.00034316466,0.00013173294,0.000056352466,0.000018241537,0.028713113],"genre_scores_gemma":[0.9992615,0.000008486373,0.00017482898,0.000032078296,0.000035356836,0.0000059642607,0.0000027317462,0.000007957461,0.0004711143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941945,0.000015937232,0.0002438563,0.00017754044,0.000016827082,0.00012638164],"domain_scores_gemma":[0.99971294,0.000028602533,0.00012532945,0.00007385187,0.00001204176,0.000047231533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003240831,0.00006969679,0.00019270026,0.00010633886,0.000024501305,0.00002755764,0.000042620184,0.000044416705,0.00009258596],"category_scores_gemma":[0.000053558546,0.00007127171,0.000012997746,0.00021790591,0.00004594141,0.000119841236,0.000003796026,0.00006864575,0.00005291884],"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.00009782856,0.000021955399,0.20033371,0.000007702012,0.0000152324055,0.000016405233,0.009283357,0.000037233134,0.000008305635,0.790034,0.00008368773,0.0000605752],"study_design_scores_gemma":[0.0054797996,0.0007507221,0.32737556,0.00013347222,0.000010479367,0.000047186466,0.021324681,0.00067711686,0.0008904143,0.6101723,0.032273896,0.0008643842],"about_ca_topic_score_codex":0.00013402323,"about_ca_topic_score_gemma":0.00039483892,"teacher_disagreement_score":0.1798617,"about_ca_system_score_codex":0.00004881746,"about_ca_system_score_gemma":0.000021606098,"threshold_uncertainty_score":0.29063758},"labels":[],"label_agreement":null},{"id":"W1993152726","doi":"10.1007/s00291-007-0117-0","title":"A shelf-space-dependent wholesale price when manufacturer and retailer brands compete","year":2008,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Universidad de Valladolid","keywords":"National brand; Incentive; Business; Profit (economics); Order (exchange); Imitation; Microeconomics; Competition (biology); Private label; Space (punctuation); Nash equilibrium; Game theory; Benchmark (surveying); Industrial organization; Marketing; Advertising; Economics; Computer science; Finance","score_opus":0.019804268302463946,"score_gpt":0.2147099716133769,"score_spread":0.19490570331091295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993152726","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91127944,0.00026853205,0.00021063162,0.0027233995,0.00040573935,0.00029407744,0.000003588891,0.0002408882,0.08457368],"genre_scores_gemma":[0.9898857,0.00008822399,0.00016777463,0.0009505299,0.00048052362,0.000011152468,0.000009995845,0.000041934218,0.00836416],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9987063,0.000012651305,0.00021798929,0.00038064015,0.00028437775,0.0003980551],"domain_scores_gemma":[0.99946195,0.000045034674,0.000121158344,0.00030921734,0.000031002568,0.00003164728],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019880726,0.00024250672,0.00026596733,0.00019660911,0.0003314071,0.00023594759,0.00019918363,0.000066081055,0.003475003],"category_scores_gemma":[0.00002372543,0.00019663738,0.0000687681,0.00018611804,0.00007806297,0.0006284269,0.00022415846,0.00022915428,0.00029199582],"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.00046455578,0.00017137566,0.9659484,0.00029234154,0.000101467755,0.00082893186,0.0006889992,0.000004955107,0.0013786005,0.0015100376,0.019085564,0.009524742],"study_design_scores_gemma":[0.0017154523,0.000023664286,0.6851671,0.000056433255,0.00014148084,0.00019538387,0.00015096534,0.00020960289,0.00071315275,0.0007003719,0.31031418,0.000612211],"about_ca_topic_score_codex":0.00047850827,"about_ca_topic_score_gemma":0.00047701263,"teacher_disagreement_score":0.29122862,"about_ca_system_score_codex":0.000025177078,"about_ca_system_score_gemma":0.000023098966,"threshold_uncertainty_score":0.9974359},"labels":[],"label_agreement":null},{"id":"W1996765127","doi":"10.1007/s00291-004-0184-4","title":"Maximizing cover probability by using multivariate normal distributions","year":2004,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Soil Geostatistics and Mapping","field":"Environmental 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":"McMaster University","funders":"","keywords":"Multivariate statistics; Multivariate normal distribution; Cover (algebra); Selection (genetic algorithm); Hypercube; Mathematics; Mathematical optimization; Probability distribution; Statistics; Computer science; Combinatorics; Artificial intelligence","score_opus":0.019054642963723,"score_gpt":0.24580754057660562,"score_spread":0.22675289761288261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996765127","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7976232,0.000010394873,0.19438647,0.00069972855,0.00019902023,0.00024795366,0.0001883456,0.000067133595,0.0065777306],"genre_scores_gemma":[0.9853793,0.0000031093261,0.014208253,0.000072770425,0.0000264171,0.000005301336,0.000023194953,0.0000088470515,0.00027284416],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9991555,0.000014365864,0.00013837147,0.0002302422,0.0001516964,0.00030980748],"domain_scores_gemma":[0.99967575,0.000019413694,0.000050079634,0.00016764371,0.000002868557,0.00008426251],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010766778,0.000098709934,0.000088161294,0.000008780021,0.00022281401,0.000039984967,0.00010595231,0.00003531949,0.0017251008],"category_scores_gemma":[0.000060127553,0.00008521616,0.000030135587,0.00015626213,0.00009946062,0.00013948527,0.00013023219,0.000092358634,0.00028243178],"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.00065594015,0.0034845306,0.29295015,0.00016589524,0.00023283195,0.00043346942,0.0036023483,0.220226,0.3655039,0.06832033,0.017465428,0.02695918],"study_design_scores_gemma":[0.008257461,0.0006621035,0.52637976,0.00018825506,0.00021145806,0.0002849799,0.00028803723,0.05286231,0.081256025,0.19438593,0.13216813,0.0030555194],"about_ca_topic_score_codex":0.0034152577,"about_ca_topic_score_gemma":0.00027330234,"teacher_disagreement_score":0.28424788,"about_ca_system_score_codex":0.00041473634,"about_ca_system_score_gemma":0.000022766457,"threshold_uncertainty_score":0.99918747},"labels":[],"label_agreement":null},{"id":"W2000726943","doi":"10.1007/s00291-012-0294-3","title":"Availability maximization under partial observations","year":2012,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Unobservable; Mathematical optimization; Computer science; Maximization; Control limits; Markov decision process; Observable; Optimal control; Markov process; Mathematics; Process (computing); Econometrics; Statistics; Control chart","score_opus":0.029221920826680358,"score_gpt":0.2253394337205343,"score_spread":0.19611751289385396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000726943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3098172,0.00017793423,0.67091596,0.0019318479,0.0021664167,0.00046589368,0.00001579382,0.0010166405,0.013492334],"genre_scores_gemma":[0.9940688,0.00008610343,0.00477698,0.0000864938,0.0002195051,0.000022564453,0.000028878294,0.000021495453,0.0006891674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999359,0.00001732679,0.00016489998,0.000096822056,0.00008877798,0.00027316637],"domain_scores_gemma":[0.99964255,0.000026618643,0.000018691471,0.00022097734,0.000018790886,0.000072364244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001425969,0.00009113349,0.00008829934,0.000028173607,0.00006155552,0.000024124367,0.00006260024,0.000064673724,0.0008687306],"category_scores_gemma":[0.000058761463,0.000079079386,0.000032223918,0.00020594847,0.00002747924,0.00039856028,0.000013195432,0.00008118289,0.00014065868],"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.000053071348,0.00022854994,0.049241185,0.00010878117,0.00004916778,8.5371363e-7,0.0006294808,0.8823061,0.0016854365,0.055032838,0.008966895,0.0016976595],"study_design_scores_gemma":[0.0009942724,0.00010043652,0.3083288,0.00004110167,0.00007890357,0.000017934315,0.000279594,0.58117163,0.016780423,0.009831775,0.081466995,0.0009081342],"about_ca_topic_score_codex":0.000011579363,"about_ca_topic_score_gemma":0.000036243877,"teacher_disagreement_score":0.6842516,"about_ca_system_score_codex":0.00011234522,"about_ca_system_score_gemma":0.000014075144,"threshold_uncertainty_score":0.9511991},"labels":[],"label_agreement":null},{"id":"W2002130487","doi":"10.1007/s00291-011-0243-6","title":"DEA based models for reallocations of police personnel","year":2011,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":27,"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":"Centre for Management of Technology and Entrepreneurship, University of Toronto","keywords":"Data envelopment analysis; Productivity; Computer science; Unit (ring theory); Set (abstract data type); Service (business); Metropolitan area; Operations research; Operations management; Business; Risk analysis (engineering); Marketing; Economics","score_opus":0.23199072897976242,"score_gpt":0.3833863458772496,"score_spread":0.1513956168974872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002130487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15244028,0.00004152362,0.7974381,0.0017276321,0.0002129563,0.0003300842,0.00006399111,0.00006867323,0.047676783],"genre_scores_gemma":[0.97566456,0.0000018211346,0.021825502,0.00018666376,0.000040812563,0.000013584002,0.0000022828885,0.000011670019,0.0022530935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982191,0.00006633685,0.00047784884,0.0003662932,0.00061834505,0.0002520928],"domain_scores_gemma":[0.9979787,0.000688292,0.00025105767,0.0007677531,0.00023452908,0.00007966103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012947775,0.00010362718,0.00024893365,0.000400468,0.00016440073,0.00004101016,0.00074526423,0.000055150045,0.0006992692],"category_scores_gemma":[0.00069171784,0.00007207352,0.00019483824,0.0011425435,0.00011441647,0.00019062855,0.000036409798,0.000054038406,0.000075390206],"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.0016610895,0.0035744247,0.012152152,0.00009306122,0.00032108452,0.000014612755,0.07562332,0.07264179,0.008978468,0.7813651,0.02775243,0.015822448],"study_design_scores_gemma":[0.00065424124,0.00034973273,0.0028236276,0.000024567855,0.00010767387,0.000004760432,0.0038167976,0.85966927,0.014269776,0.11631225,0.001666796,0.00030047822],"about_ca_topic_score_codex":0.0018154213,"about_ca_topic_score_gemma":0.002472094,"teacher_disagreement_score":0.8232243,"about_ca_system_score_codex":0.00003190369,"about_ca_system_score_gemma":0.00019149671,"threshold_uncertainty_score":0.7656507},"labels":[],"label_agreement":null},{"id":"W2003896377","doi":"10.1007/s00291-012-0300-9","title":"A dynamic game with monopolist manufacturer and price-competing duopolist retailers","year":2012,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"HEC Montréal","funders":"","keywords":"Microeconomics; Purchasing; Payment; Product (mathematics); Nash equilibrium; Business; Dynamic pricing; Revenue; Quality (philosophy); Production (economics); Sequential game; Game theory; Industrial organization; Economics; Commerce; Marketing","score_opus":0.012194503151284553,"score_gpt":0.2134554923158673,"score_spread":0.20126098916458274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003896377","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7988595,0.00025970454,0.00035496976,0.0039727828,0.0006760722,0.0005214492,0.0000029007651,0.0003024095,0.19505024],"genre_scores_gemma":[0.99185115,0.00002062637,0.0002381068,0.0023483706,0.0008149372,0.00002234625,0.000018529312,0.000051201085,0.0046347533],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99861,0.0000092306655,0.00019560041,0.00029508027,0.00024555015,0.0006445043],"domain_scores_gemma":[0.99946725,0.000020111402,0.00016464006,0.00028617214,0.000016848884,0.000044964836],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024371858,0.0002615687,0.00021774533,0.00022241512,0.0001892264,0.00031960552,0.0001873745,0.000041811305,0.0016325623],"category_scores_gemma":[0.000021074282,0.00018951963,0.000045196666,0.00026850376,0.000107155494,0.0010297368,0.00018206523,0.00015421472,0.00028163515],"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.0013983902,0.0009802831,0.65726566,0.0021557265,0.00069271616,0.00028193663,0.0025083197,0.00016246166,0.0005143323,0.28453398,0.04049084,0.009015367],"study_design_scores_gemma":[0.0018707266,0.000065683715,0.14606614,0.00014239573,0.0001981323,0.00004565921,0.0033361106,0.0053830897,0.00015852948,0.0021012235,0.8395511,0.0010811826],"about_ca_topic_score_codex":0.00035879307,"about_ca_topic_score_gemma":0.00035211473,"teacher_disagreement_score":0.7990603,"about_ca_system_score_codex":0.00008382584,"about_ca_system_score_gemma":0.000009462684,"threshold_uncertainty_score":0.9992801},"labels":[],"label_agreement":null},{"id":"W2011182425","doi":"10.1007/s00291-011-0280-1","title":"The impact of client choice on preventive healthcare facility network design","year":2011,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Urban Transport and Accessibility","field":"Social Sciences","cited_by":116,"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; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Facility location problem; Attractiveness; Computer science; Time limit; Workload; Probabilistic logic; Quality (philosophy); Health care; Network planning and design; Operations research; Artificial intelligence; Engineering","score_opus":0.08406994656302978,"score_gpt":0.3576396471445394,"score_spread":0.2735697005815096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011182425","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98472685,0.0002234541,0.0005246279,0.0006295861,0.00034643261,0.00072371133,0.00003440821,0.000054891843,0.012736032],"genre_scores_gemma":[0.99870324,0.000055482327,0.00008818283,0.000021138176,0.00014857187,0.000010344324,0.0000018210665,0.0000040234154,0.0009671769],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.998576,0.0003321811,0.00022567999,0.0002082653,0.00024137105,0.00041649572],"domain_scores_gemma":[0.9991802,0.00024132125,0.0001394587,0.00028492592,0.00003996792,0.00011414794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010732234,0.00009851923,0.00015364906,0.0000131895395,0.00054891483,0.000022021415,0.00033285219,0.00006358649,0.0006923733],"category_scores_gemma":[0.000090385875,0.000054890697,0.00014947118,0.00026581078,0.00027063684,0.00009769304,0.000014709406,0.0001460932,0.000021692587],"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.0007795247,0.00026098752,0.97876567,0.000011579871,0.00005981204,0.0000036195088,0.009509862,0.00005232352,0.0000042644556,0.0032275598,0.0016459947,0.005678832],"study_design_scores_gemma":[0.00012995035,0.00044744185,0.98134106,0.00001794214,0.000009603102,4.9816528e-8,0.00040543484,0.0000061892465,0.00026749165,0.01615131,0.0011352317,0.00008826562],"about_ca_topic_score_codex":0.02285644,"about_ca_topic_score_gemma":0.027105704,"teacher_disagreement_score":0.0139764035,"about_ca_system_score_codex":0.00014496472,"about_ca_system_score_gemma":0.00030789454,"threshold_uncertainty_score":0.9906471},"labels":[],"label_agreement":null},{"id":"W2016796137","doi":"10.1007/s00291-004-0175-5","title":"A replenishment decision involving partial postponement","year":2004,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Product Development and Customization","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 Calgary","funders":"","keywords":"Postponement; Computer science; Operations research; Order (exchange); Stock (firearms); Inventory management; Set (abstract data type); Operations management; Economics; Mathematics; Finance","score_opus":0.013700719927159868,"score_gpt":0.21906040075208164,"score_spread":0.20535968082492176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016796137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9617153,0.00016193026,0.0054598604,0.013350877,0.0020146663,0.0006433696,0.0000010352672,0.0004763083,0.016176658],"genre_scores_gemma":[0.9947247,0.00002930144,0.0015221696,0.0017791213,0.0013552144,0.00002230266,0.00002984261,0.00002530465,0.0005120697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987441,0.0000029955029,0.0002757087,0.0003341449,0.00032980295,0.0003132517],"domain_scores_gemma":[0.99955547,0.000008697434,0.00013158191,0.0002483735,0.000041391082,0.000014468803],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00027342356,0.00015459572,0.00013577259,0.00017389846,0.0002301675,0.0002709032,0.00018172202,0.00004143432,0.0011132808],"category_scores_gemma":[0.00010968199,0.00012521882,0.00004621377,0.00043368092,0.000018561828,0.0007559521,0.0001642603,0.00007604555,0.00092883455],"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.004143555,0.0019891912,0.08353534,0.00048391407,0.00030325423,0.00061499904,0.0015122307,0.0034724814,0.013407515,0.71619856,0.079112925,0.09522601],"study_design_scores_gemma":[0.009810989,0.00016332083,0.07023414,0.0006101536,0.00019483436,0.000035134544,0.000749209,0.0017015144,0.026345612,0.16054481,0.727577,0.0020333282],"about_ca_topic_score_codex":0.00015206255,"about_ca_topic_score_gemma":0.0002453479,"teacher_disagreement_score":0.648464,"about_ca_system_score_codex":0.0001359094,"about_ca_system_score_gemma":0.00005752607,"threshold_uncertainty_score":0.9998491},"labels":[],"label_agreement":null},{"id":"W2030580634","doi":"10.1007/s00291-009-0192-5","title":"Deriving a minimum distance-based collective preorder: a binary mathematical programming approach","year":2010,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Multi-Criteria Decision Making","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":"Defence Research and Development Canada; Université Laval","funders":"","keywords":"Preorder; Binary relation; Transitive relation; Mathematics; Linear programming; Ranking (information retrieval); Binary number; Preference; Computer science; Combinatorics; Mathematical optimization; Algorithm; Discrete mathematics; Artificial intelligence; Statistics","score_opus":0.09501258977061526,"score_gpt":0.3844359962684172,"score_spread":0.2894234064978019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030580634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46991712,0.000044983386,0.5050877,0.0015486999,0.0010265951,0.001531365,0.00002448911,0.00033899464,0.020480083],"genre_scores_gemma":[0.78887284,5.2407e-7,0.20617741,0.000116051015,0.00018759782,0.00015274667,0.0000028266045,0.000050660095,0.0044393498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99453396,0.00026329656,0.0010734546,0.0011985865,0.002106114,0.0008245948],"domain_scores_gemma":[0.99456525,0.0030374445,0.00041690687,0.001454935,0.0002098259,0.00031565444],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0029685462,0.00038791355,0.0006741852,0.000571108,0.000514425,0.001223558,0.0014494134,0.00021101281,0.003316857],"category_scores_gemma":[0.008116497,0.00026219376,0.00026144402,0.0021659604,0.00032580327,0.0003980841,0.00034706213,0.000613626,0.00044374738],"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.010584305,0.0159127,0.08393056,0.0007014616,0.00054153986,0.0027514582,0.031397324,0.0012715491,0.12559418,0.111873,0.051721662,0.5637202],"study_design_scores_gemma":[0.005128827,0.0010054829,0.015183129,0.0003133727,0.00009624264,0.00048112188,0.004288921,0.70156085,0.006309133,0.15601718,0.107451364,0.0021643827],"about_ca_topic_score_codex":0.000007599794,"about_ca_topic_score_gemma":0.00016560078,"teacher_disagreement_score":0.7002893,"about_ca_system_score_codex":0.00012583887,"about_ca_system_score_gemma":0.0004958371,"threshold_uncertainty_score":0.999983},"labels":[],"label_agreement":null},{"id":"W2055819286","doi":"10.1007/s00291-008-0135-6","title":"Dynamic transportation of patients in hospitals","year":2008,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":224,"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; Heuristic; Context (archaeology); Scheme (mathematics); Tabu search; Service (business); Quality (philosophy); Operations research; Simple (philosophy); Phase (matter); Mathematical optimization; Algorithm; Artificial intelligence; Mathematics","score_opus":0.006537182786802548,"score_gpt":0.2320161659181334,"score_spread":0.22547898313133086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055819286","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98718184,0.000023234674,0.012071303,0.0000099848585,0.00010118285,0.00009948211,0.000009964706,0.000075732794,0.00042724394],"genre_scores_gemma":[0.98238486,0.00009278028,0.017411705,0.0000035543787,0.0000040492228,0.0000050847625,0.000017127293,0.00001773586,0.00006312845],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99954665,0.000011236373,0.00018723315,0.000067638466,0.00008246595,0.000104773506],"domain_scores_gemma":[0.99984574,0.000017393708,0.000025268646,0.00008343591,0.000009949457,0.000018194058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004853898,0.000058917994,0.00010388203,0.0000789831,0.000011008804,0.0000016124519,0.0000496866,0.000035411307,0.00007870727],"category_scores_gemma":[0.000011901249,0.000058713413,0.000020416062,0.00022429136,0.000012897942,0.00006274759,0.0000014496518,0.00005345307,0.0000054930097],"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.000022621987,0.000060013368,0.54480433,0.00006164886,0.000012349166,0.000013189569,0.0015217905,0.45032448,0.00042315928,0.000089087036,0.00004892938,0.0026183787],"study_design_scores_gemma":[0.00039087012,0.000049045022,0.9405306,0.0000131785755,0.0000027256353,5.25233e-7,0.000016311902,0.05602889,0.002790213,0.000044415636,0.000046562913,0.00008664486],"about_ca_topic_score_codex":0.000013670745,"about_ca_topic_score_gemma":0.00008445877,"teacher_disagreement_score":0.39572626,"about_ca_system_score_codex":0.000040113246,"about_ca_system_score_gemma":0.000007972475,"threshold_uncertainty_score":0.23942634},"labels":[],"label_agreement":null},{"id":"W2058943753","doi":"10.1007/s00291-012-0288-1","title":"Health care operations management","year":2012,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Health care; Operations management; Process management; Business","score_opus":0.06171319000001652,"score_gpt":0.45349590834938613,"score_spread":0.3917827183493696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058943753","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14754763,0.006241638,0.1672785,0.25983226,0.013613446,0.01097249,0.00022689247,0.0016401911,0.39264694],"genre_scores_gemma":[0.93544,0.00042427547,0.042281453,0.00595986,0.00090727536,0.00025236091,0.0001661782,0.00003608917,0.0145325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983338,0.00028580055,0.00039939297,0.00016472112,0.00015701867,0.00065924576],"domain_scores_gemma":[0.9992788,0.000037725535,0.0000540808,0.0003046165,0.000060411454,0.00026435792],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00042557408,0.00010954771,0.00016714646,0.0000977617,0.0017508058,0.00001695033,0.0000911445,0.0000843984,0.001903021],"category_scores_gemma":[0.000028969185,0.00008573927,0.000029290928,0.00027131566,0.000013505259,0.00020861939,0.00005206689,0.0002800019,0.0010041125],"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.00014618554,0.00047913098,0.09192336,0.0015946196,0.00012257775,0.000011384045,0.10203302,0.0043490645,0.000018452418,0.67658114,0.082086064,0.040655013],"study_design_scores_gemma":[0.0021778601,0.00039469948,0.07939034,0.00044084954,0.000043409753,0.000012284322,0.05775253,0.0032140643,0.000041838182,0.00011232702,0.8557047,0.0007150911],"about_ca_topic_score_codex":0.0004927751,"about_ca_topic_score_gemma":0.0025724627,"teacher_disagreement_score":0.7878924,"about_ca_system_score_codex":0.0004235208,"about_ca_system_score_gemma":0.00037127986,"threshold_uncertainty_score":0.99977374},"labels":[],"label_agreement":null},{"id":"W2086702508","doi":"10.1007/s00291-005-0026-z","title":"Semi-Markov information model for revenue management and dynamic pricing","year":2006,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"University of British Columbia","funders":"","keywords":"Revenue management; Yield management; Revenue; Dynamic pricing; Computer science; Variable (mathematics); Markov decision process; Markov chain; Operations research; Business; Yield (engineering); Microeconomics; Markov process; Marketing; Economics; Finance; Mathematics","score_opus":0.008316954873898075,"score_gpt":0.2042421732937018,"score_spread":0.19592521841980373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086702508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17433901,0.00034777424,0.48946294,0.013550798,0.0020532953,0.005845231,0.000087985994,0.00089187484,0.3134211],"genre_scores_gemma":[0.9760866,0.000034556157,0.0024247305,0.0021613738,0.0004017881,0.00012257247,0.00016847496,0.00002916029,0.018570745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912524,0.0000025283941,0.0002481846,0.00018025396,0.00016149817,0.00028230206],"domain_scores_gemma":[0.9996387,0.000010599619,0.0001410548,0.00017852207,0.000022578162,0.000008592927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021269449,0.00015010168,0.00012846339,0.00026045647,0.0001807429,0.00027664634,0.00013144413,0.000035668938,0.00006242016],"category_scores_gemma":[0.000010628185,0.00013513147,0.000046904963,0.00020143294,0.000022849856,0.0011760964,0.00013786528,0.000050034076,0.000055062912],"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.00047582097,0.00023514038,0.00465221,0.0040104254,0.00015726384,0.000024935,0.00023806293,0.015291136,0.000105321495,0.56294066,0.35590723,0.055961806],"study_design_scores_gemma":[0.0008103561,0.000010781508,0.002539736,0.000052947125,0.00005967434,0.0000010519923,0.00014585486,0.7114749,0.000010870379,0.02178012,0.2628881,0.00022561691],"about_ca_topic_score_codex":0.00015906054,"about_ca_topic_score_gemma":0.0003462556,"teacher_disagreement_score":0.80174756,"about_ca_system_score_codex":0.00006891424,"about_ca_system_score_gemma":0.0000052642804,"threshold_uncertainty_score":0.5510501},"labels":[],"label_agreement":null},{"id":"W2102515551","doi":"10.1007/s00291-010-0229-9","title":"Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints","year":2010,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":107,"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":"Austrian Science Fund","keywords":"Column generation; Computer science; Variable neighborhood search; Mathematical optimization; Heuristic; Integer programming; Algorithm; Set (abstract data type); Variable (mathematics); Relaxation (psychology); Linear programming; Mathematics; Metaheuristic; Artificial intelligence","score_opus":0.01607248361109651,"score_gpt":0.2482842718808206,"score_spread":0.2322117882697241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102515551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096560866,0.00007294222,0.89957243,0.0006339815,0.00037420617,0.0007996182,0.000027850881,0.00044867193,0.0015094465],"genre_scores_gemma":[0.78259856,0.00003647706,0.21694385,0.000025550155,0.00006905721,0.000045476558,0.0000036963038,0.000055264787,0.00022206624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993011,0.000017202514,0.00015706371,0.00017363355,0.00009351899,0.00025749326],"domain_scores_gemma":[0.99946874,0.00019789742,0.000035837627,0.00020552869,0.000023357463,0.00006864432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022857552,0.00014415882,0.00014357975,0.00003625406,0.00012034525,0.00006269492,0.00011783689,0.00008333259,0.00008382682],"category_scores_gemma":[0.000023799692,0.00009248704,0.000028879162,0.00011259583,0.000129561,0.00008263555,0.000021125461,0.00021455319,0.000003435619],"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.000036864716,0.000016651196,0.00020090288,0.000040211617,0.00015758375,0.000018023156,0.0006350752,0.95477945,0.0028995234,0.0027888753,0.00008782815,0.038339008],"study_design_scores_gemma":[0.00064041134,0.000064069005,0.00009247989,0.000013483426,0.000036205955,0.00021297541,0.00001860626,0.9909228,0.0056346296,0.0016700099,0.0005200281,0.00017426371],"about_ca_topic_score_codex":0.000007992927,"about_ca_topic_score_gemma":0.00006740356,"teacher_disagreement_score":0.6860377,"about_ca_system_score_codex":0.000016406366,"about_ca_system_score_gemma":0.000023329298,"threshold_uncertainty_score":0.37715122},"labels":[],"label_agreement":null},{"id":"W2106822515","doi":"10.1007/s00291-013-0327-6","title":"The design of robust value-creating supply chain networks","year":2013,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","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":"Université Laval","funders":"","keywords":"Network planning and design; Computer science; Time horizon; Futures contract; Supply chain; Supply chain network; Set (abstract data type); Scenario planning; Sample (material); Operations research; Monte Carlo method; Supply chain management; Adaptation (eye); Mathematical optimization; Industrial engineering","score_opus":0.013291670692594631,"score_gpt":0.19816036414582347,"score_spread":0.18486869345322884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106822515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06404017,0.0017118338,0.6390102,0.056229252,0.0038690446,0.01168669,0.0000029842156,0.0014513896,0.22199845],"genre_scores_gemma":[0.98603773,0.00005904408,0.0019082958,0.0010816167,0.001567993,0.0001735126,0.000008488853,0.00007048939,0.009092825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982315,0.00004180043,0.00038859085,0.00030019955,0.00033571356,0.00070225424],"domain_scores_gemma":[0.9987452,0.0003148818,0.0003077228,0.00050928415,0.00010537953,0.000017533455],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00097440346,0.00023799624,0.0002342309,0.00017619767,0.00048194235,0.000574514,0.0006016296,0.000061659455,0.001396205],"category_scores_gemma":[0.00021729176,0.00015622153,0.00008471585,0.0007393056,0.00010598958,0.00066599797,0.00036978984,0.0001689249,0.00023042544],"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.00025568792,0.0001880181,0.021288762,0.00039474032,0.00026751313,0.00007686985,0.00019526735,0.4598353,0.00012419872,0.36254004,0.13203982,0.022793792],"study_design_scores_gemma":[0.00081979204,0.000056961188,0.012347504,0.00009188383,0.00009283434,0.000003096952,0.004075215,0.9282542,0.00007913036,0.01948311,0.03421078,0.000485523],"about_ca_topic_score_codex":0.0022884707,"about_ca_topic_score_gemma":0.00008441665,"teacher_disagreement_score":0.92199755,"about_ca_system_score_codex":0.00008111525,"about_ca_system_score_gemma":0.000027280275,"threshold_uncertainty_score":0.99951667},"labels":[],"label_agreement":null},{"id":"W2120506189","doi":"10.1007/s00291-009-0182-7","title":"A variable neighborhood search heuristic for the design of multicommodity production–distribution networks with alternative facility configurations","year":2009,"lang":"en","type":"article","venue":"OR Spectrum","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Mathematical optimization; Tabu search; Solver; Variable neighborhood search; Computer science; Variable (mathematics); Heuristic; Network planning and design; Integer programming; Facility location problem; Extension (predicate logic); Metaheuristic; Mathematics","score_opus":0.04701076197470409,"score_gpt":0.2547918940508524,"score_spread":0.2077811320761483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120506189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019007387,0.000022701433,0.98900557,0.0065631196,0.00028450304,0.0014314832,0.000040048148,0.0000633756,0.0006884775],"genre_scores_gemma":[0.9981692,0.000012695835,0.0006655068,0.00021172383,0.0003053471,0.000078741505,0.00016794437,0.000005224759,0.00038365537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900675,0.000025180594,0.00025216158,0.00026111025,0.00021386205,0.00024092213],"domain_scores_gemma":[0.999236,0.00007509215,0.000086162974,0.0003279176,0.0002633542,0.000011460648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005952544,0.00013350787,0.00014780466,0.000049146507,0.00036159213,0.000096883836,0.00020479033,0.000029895307,0.00029922053],"category_scores_gemma":[0.00024333895,0.000085941116,0.000038949227,0.00046998682,0.00007162217,0.00034857937,0.000027476646,0.00010431064,0.000020696205],"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.0007876489,0.0004310266,0.0004001457,0.00011469805,0.00010493278,8.0281313e-7,0.00009263868,0.8380522,0.00007540415,0.1491672,0.006152796,0.004620493],"study_design_scores_gemma":[0.00064450427,0.00011570485,0.012149922,0.00002327984,0.000118857235,8.9952636e-7,0.00027579366,0.9746989,0.0001956712,0.004712611,0.006880751,0.00018307765],"about_ca_topic_score_codex":0.0006139601,"about_ca_topic_score_gemma":0.0002096842,"teacher_disagreement_score":0.99626845,"about_ca_system_score_codex":0.000051362313,"about_ca_system_score_gemma":0.00003998486,"threshold_uncertainty_score":0.3504577},"labels":[],"label_agreement":null},{"id":"W2143046423","doi":"10.1007/s00291-013-0348-1","title":"Self-imposed time windows in vehicle routing problems","year":2013,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"HEC Montréal","funders":"","keywords":"Vehicle routing problem; Benchmark (surveying); Heuristic; Computer science; Tabu search; Mathematical optimization; Routing (electronic design automation); Order (exchange); Operations research; Mathematics; Economics","score_opus":0.009466649504264044,"score_gpt":0.22174500512405423,"score_spread":0.2122783556197902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143046423","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9247241,0.0001391636,0.017200828,0.0013083658,0.00046774154,0.00155222,0.0000043072882,0.003520705,0.051082555],"genre_scores_gemma":[0.93420714,0.000018157554,0.064338334,0.00006297517,0.00012359065,0.000048297265,0.000004145984,0.000088414374,0.0011089224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877745,0.00006916515,0.00032688977,0.00020945177,0.00014474953,0.00047228436],"domain_scores_gemma":[0.99950796,0.00008879834,0.00004196269,0.0002565805,0.000016954824,0.000087754954],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00033010144,0.00017496945,0.00021277547,0.00012558437,0.000049846814,0.000090783935,0.00018442853,0.000101690355,0.0010692636],"category_scores_gemma":[0.000056058496,0.0001653122,0.00003856031,0.00048816716,0.000012888863,0.00025342777,0.000040782674,0.0002427865,0.0010438159],"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.000017682652,0.00017606502,0.028303223,0.0002513658,0.00010543607,0.000041027815,0.003063238,0.8927053,0.061067287,0.00067620695,0.0018481882,0.011744949],"study_design_scores_gemma":[0.0005865949,0.000034006014,0.0073661394,0.000039673025,0.000005794014,0.000009719727,0.000028611645,0.9846748,0.005934264,0.00023820643,0.00082552864,0.00025662087],"about_ca_topic_score_codex":0.000059032776,"about_ca_topic_score_gemma":0.000026230648,"teacher_disagreement_score":0.09196951,"about_ca_system_score_codex":0.000161223,"about_ca_system_score_gemma":0.000023567378,"threshold_uncertainty_score":0.9998439},"labels":[],"label_agreement":null},{"id":"W2511288762","doi":"10.1007/s00291-016-0457-8","title":"A continuous approximation model for the fleet composition problem on the rectangular grid","year":2016,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Transportation and Mobility Innovations","field":"Engineering","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 Toronto","funders":"","keywords":"Grid; Computer science; Computation; Constraint (computer-aided design); Mathematical optimization; Heuristic; Sensitivity (control systems); Service (business); Limit (mathematics); Mathematics; Algorithm; Geometry","score_opus":0.01910561187786955,"score_gpt":0.22390535650125223,"score_spread":0.20479974462338268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2511288762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05075636,0.0000184452,0.9262235,0.018830847,0.00025006503,0.0012775045,0.00014658638,0.00034188025,0.002154778],"genre_scores_gemma":[0.99734205,0.000015071481,0.0015075657,0.00021099763,0.000083745115,0.00033101582,0.00002192652,0.000017634764,0.00047000128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995508,0.000007624511,0.00014609178,0.0000868175,0.000085516884,0.00012313481],"domain_scores_gemma":[0.9996191,0.00013084552,0.000025775407,0.00018375994,0.000026675798,0.000013800501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013935548,0.00007685936,0.0000626539,0.000027408701,0.00011682805,0.000022430931,0.00008916003,0.000030826,0.000056597542],"category_scores_gemma":[0.000010503583,0.000034136934,0.000038844682,0.000106702886,0.00002464322,0.00006148904,0.0000020893601,0.000053532458,0.000017320424],"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.0002489315,0.00013171125,0.00007051513,0.00008742815,0.00016393843,0.0000011725483,0.0021094356,0.09837033,0.07071383,0.7881778,0.024414292,0.015510618],"study_design_scores_gemma":[0.0013325913,0.00016024319,0.0015643474,0.0001135909,0.00007215539,0.0000063764387,0.00017437233,0.9090178,0.044800557,0.023005825,0.019429663,0.00032246046],"about_ca_topic_score_codex":0.0000027741635,"about_ca_topic_score_gemma":0.000060537634,"teacher_disagreement_score":0.94658566,"about_ca_system_score_codex":0.000042489257,"about_ca_system_score_gemma":0.000011681205,"threshold_uncertainty_score":0.13920638},"labels":[],"label_agreement":null},{"id":"W2767827514","doi":"10.1007/s00291-017-0494-y","title":"Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem","year":2017,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Center for Interuniversity Research and Analysis on Organizations; Université Laval; GLS Industries (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada; Alfaisal University","keywords":"Vehicle routing problem; Solver; Mathematical optimization; Computer science; Routing (electronic design automation); Lexicographical order; Set (abstract data type); Variable (mathematics); Index (typography); Mathematics","score_opus":0.028535133580071145,"score_gpt":0.30224196025263855,"score_spread":0.2737068266725674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767827514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32451895,0.00022110251,0.6702934,0.0019972655,0.00040476443,0.0011801551,0.00004250516,0.00027713852,0.0010647486],"genre_scores_gemma":[0.82521695,0.000048836446,0.17405096,0.000026784004,0.0001193374,0.000046854308,0.0000011340901,0.0000395369,0.00044963622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927205,0.000019343068,0.00018377468,0.0001901771,0.00006806344,0.00026660046],"domain_scores_gemma":[0.99906516,0.00044808493,0.00009695086,0.00030179272,0.00002895916,0.000059072085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036776424,0.00014071573,0.00014430587,0.000024414367,0.0008345141,0.00036405653,0.00017413188,0.000056954712,0.00000994563],"category_scores_gemma":[0.0004287585,0.00010464091,0.00003137324,0.000042397136,0.000072238836,0.0001993985,0.000086963315,0.00012531156,9.54232e-7],"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.0007309068,0.0003201106,0.117691614,0.001264324,0.0020459504,0.000031333475,0.024131782,0.25143453,0.17127985,0.07059151,0.00060749264,0.3598706],"study_design_scores_gemma":[0.0011119583,0.00004270061,0.0227616,0.000022437009,0.000031928143,0.000007784348,0.000062825806,0.97015464,0.003636103,0.0014952355,0.0005143069,0.00015849438],"about_ca_topic_score_codex":0.00010482698,"about_ca_topic_score_gemma":0.00026324598,"teacher_disagreement_score":0.7187201,"about_ca_system_score_codex":0.00003920161,"about_ca_system_score_gemma":0.00001457287,"threshold_uncertainty_score":0.6418492},"labels":[],"label_agreement":null},{"id":"W2771722649","doi":"10.1007/s00291-017-0502-2","title":"Equilibrium consumption and portfolio decisions with stochastic discount rate and time-varying utility functions","year":2017,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Portfolio; Consumption (sociology); Stochastic discount factor; Economics; Expected utility hypothesis; Mathematical economics; Computer science; Microeconomics; Econometrics; Mathematical optimization; Mathematics; Financial economics; Capital asset pricing model","score_opus":0.04128172389244446,"score_gpt":0.2532613614766722,"score_spread":0.21197963758422778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771722649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27910012,0.0007600592,0.7111634,0.0016427068,0.00016030871,0.0003988794,0.00031119084,0.000051897,0.0064114425],"genre_scores_gemma":[0.9980988,0.000086650645,0.00064303755,0.000048954415,0.00008127937,0.000054944907,0.000012719671,0.000017695122,0.0009559325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99902177,0.0000021870922,0.00027190175,0.00043569622,0.000031121832,0.00023733095],"domain_scores_gemma":[0.9990274,0.00009293013,0.00028230308,0.00046619013,0.000019185238,0.000112021946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020358512,0.0001425834,0.0002641701,0.000087493056,0.00059188815,0.00026154262,0.0001439966,0.000058275196,0.00026577845],"category_scores_gemma":[0.00021045364,0.00012633672,0.000026202311,0.000073987176,0.00024322244,0.00032330322,0.00012079114,0.000112124704,0.00020813664],"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.00054256193,0.00022515141,0.03871107,0.00006607735,0.00011994633,0.000017521386,0.00025449003,0.000073008625,0.00015979425,0.9521696,0.0005696872,0.007091073],"study_design_scores_gemma":[0.0015772653,0.0002877622,0.6004895,0.00009907952,0.00006395255,0.00010666895,0.00004180956,0.02727843,0.00003022206,0.36536363,0.0040461007,0.00061556866],"about_ca_topic_score_codex":0.00017597934,"about_ca_topic_score_gemma":0.00011218545,"teacher_disagreement_score":0.7189987,"about_ca_system_score_codex":0.000026694679,"about_ca_system_score_gemma":0.000033247503,"threshold_uncertainty_score":0.5151862},"labels":[],"label_agreement":null},{"id":"W2799898928","doi":"10.1007/s00291-018-0518-2","title":"Multilevel rationing policy for spare parts when demand is state dependent","year":2018,"lang":"en","type":"article","venue":"OR Spectrum","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":"University of Toronto","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Spare part; Rationing; State (computer science); Microeconomics; Computer science; Economics; Operations management","score_opus":0.03858298356223652,"score_gpt":0.27131534546809005,"score_spread":0.23273236190585353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799898928","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2817051,0.00030258828,0.2658055,0.09971612,0.009029189,0.008180585,0.00016780113,0.0018217709,0.33327132],"genre_scores_gemma":[0.9525684,0.000010554369,0.00069369166,0.009499572,0.005156419,0.00009429965,0.000037888698,0.00005095844,0.031888228],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986579,0.000006820275,0.000263687,0.0003624021,0.00023925131,0.0004699648],"domain_scores_gemma":[0.99941444,0.000023263441,0.00016505343,0.00029114628,0.0000819218,0.000024188],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026890813,0.00019872944,0.00017403,0.00025867918,0.00038685757,0.0004360554,0.00024506167,0.00003960239,0.0028713634],"category_scores_gemma":[0.00009190272,0.00017041866,0.00007454591,0.00016999891,0.00005577598,0.0006800514,0.00017894877,0.000057619756,0.000692056],"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.00090265146,0.00039605296,0.020666901,0.00075151585,0.0003684492,0.000048773833,0.0033669241,0.00037145973,0.00035882884,0.12670965,0.80637527,0.03968355],"study_design_scores_gemma":[0.001601871,0.00007027546,0.0027677664,0.000060224298,0.000054179895,0.0000016960032,0.00038983673,0.02378305,0.0022133824,0.02960854,0.93903005,0.00041915211],"about_ca_topic_score_codex":0.00061380625,"about_ca_topic_score_gemma":0.0013963586,"teacher_disagreement_score":0.6708633,"about_ca_system_score_codex":0.00007988593,"about_ca_system_score_gemma":0.000033999695,"threshold_uncertainty_score":0.99804014},"labels":[],"label_agreement":null},{"id":"W4220718688","doi":"10.1007/s00291-022-00670-3","title":"Mobile healthcare services in rural areas: an application with periodic location routing problem","year":2022,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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 Toronto","funders":"","keywords":"Health care; Christian ministry; Heuristic; Computer science; Routing (electronic design automation); Population; Rural area; Focus (optics); Operations research; Business; Computer network; Mathematics; Artificial intelligence; Economic growth; Medicine; Economics; Environmental health","score_opus":0.007366936327757205,"score_gpt":0.25197933688144364,"score_spread":0.24461240055368644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220718688","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94531244,0.00023771916,0.0518478,0.0003346875,0.000092317605,0.001006892,0.000011451986,0.00064652215,0.000510165],"genre_scores_gemma":[0.9814069,0.000011995912,0.017780805,0.000057202822,0.000052601255,0.00052303827,0.00007247275,0.000050601866,0.00004435486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901134,0.00010569264,0.00022612538,0.00020378226,0.00019211897,0.00026095644],"domain_scores_gemma":[0.99957794,0.000015428708,0.00006659153,0.00025648903,0.000024195582,0.00005936979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032807793,0.00012742403,0.00013629561,0.00011813934,0.00018665053,0.000048429345,0.00017376742,0.000035297282,0.00006364865],"category_scores_gemma":[0.0000024712733,0.00012540763,0.000012459151,0.0007744157,0.000011159973,0.00014965989,0.000038177957,0.00023262147,0.000005291154],"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.000036682497,0.000035077977,0.030344645,0.00014489637,0.0000058355517,0.0000029996907,0.003541395,0.95359904,0.00041673597,0.00038659322,0.0000026647713,0.011483441],"study_design_scores_gemma":[0.00042214314,0.0002885119,0.009741032,0.000049973547,0.0000065115714,0.00003862263,0.0055919904,0.98260903,0.00040835835,0.00013814708,0.0004687205,0.00023696233],"about_ca_topic_score_codex":0.0004314561,"about_ca_topic_score_gemma":0.0011141222,"teacher_disagreement_score":0.036094483,"about_ca_system_score_codex":0.00034384357,"about_ca_system_score_gemma":0.0000531633,"threshold_uncertainty_score":0.5113975},"labels":[],"label_agreement":null},{"id":"W4281298271","doi":"10.1007/s00291-022-00684-x","title":"Synchronous resource allocation: modeling, capacity, and optimization","year":2022,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Advanced Queuing Theory Analysis","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Resource allocation; Resource (disambiguation); Mathematical optimization; Operations research; Mathematics; Computer network","score_opus":0.01579009083569939,"score_gpt":0.21495144112349152,"score_spread":0.19916135028779214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281298271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.286672,0.00029775588,0.6561515,0.013442741,0.000411637,0.00053547573,0.000007163431,0.00080593926,0.04167585],"genre_scores_gemma":[0.9956117,0.000006894757,0.0018350558,0.0010863559,0.00040250173,0.000024059962,0.000032171014,0.000026412905,0.0009747916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992644,0.000016778962,0.00014290241,0.00023869885,0.00017323293,0.00016394095],"domain_scores_gemma":[0.99964416,0.000016804313,0.00010358552,0.00020628296,0.00002064899,0.000008546754],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026650517,0.00010037217,0.000114362934,0.00016507372,0.00052434055,0.00010904304,0.00015458318,0.000018089782,0.0016075507],"category_scores_gemma":[0.00005123846,0.00009970521,0.000030867082,0.00043309186,0.00002843338,0.0004065153,0.00024957937,0.00011993837,0.000023379838],"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.000042179327,0.000024729667,0.00010433531,0.00001528407,0.00001592621,0.000005806562,0.000042262556,0.9635364,0.000016736354,0.035467163,0.00026239158,0.00046680484],"study_design_scores_gemma":[0.00018803966,0.000011628422,0.000007125754,0.000004768339,0.0000499966,0.0000089622445,0.00029328643,0.9682871,0.000008121997,0.011554171,0.019440418,0.00014635977],"about_ca_topic_score_codex":0.00013467697,"about_ca_topic_score_gemma":0.00006468347,"teacher_disagreement_score":0.7089398,"about_ca_system_score_codex":0.000067340145,"about_ca_system_score_gemma":0.000009560924,"threshold_uncertainty_score":0.9993051},"labels":[],"label_agreement":null},{"id":"W4297492116","doi":"10.1007/s00291-022-00693-w","title":"Machine learning techniques for cross-sectional equity returns’ prediction","year":2022,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Financial Markets and Investment Strategies","field":"Economics, Econometrics and Finance","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Universität Bremen","keywords":"Machine learning; Computer science; Artificial intelligence; Random forest; Support vector machine; Portfolio; Benchmark (surveying); Artificial neural network; Stock (firearms); Econometrics; Decision tree; Regression; Economics; Financial economics; Mathematics; Statistics","score_opus":0.05480379686306359,"score_gpt":0.2802640547166015,"score_spread":0.2254602578535379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297492116","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35157782,0.0033317208,0.01348338,0.0038269798,0.006444903,0.0023812498,0.0055422275,0.0012866841,0.61212504],"genre_scores_gemma":[0.9849431,0.00014603138,0.00083579257,0.00021066992,0.00036491727,0.0002675572,0.00013919674,0.000026508946,0.013066208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998998,0.0000126123705,0.00036726356,0.00031902298,0.00005139227,0.0002517088],"domain_scores_gemma":[0.999575,0.000030656367,0.00021614936,0.00013395357,0.000010686966,0.00003352179],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00068674085,0.00010635695,0.00017689889,0.00013549085,0.00064363144,0.00011904088,0.00016686512,0.000050665793,0.003063614],"category_scores_gemma":[0.000088774184,0.00011506978,0.0001017956,0.00015990135,0.000042315198,0.00020836147,0.0001478333,0.00024081665,0.000020831605],"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.00022892529,0.00007346549,0.32790536,0.000026469837,0.000021294663,0.0000022715835,0.000055651584,0.00009463627,0.000052294785,0.66960347,0.0016077742,0.0003283789],"study_design_scores_gemma":[0.00039145676,0.00089274306,0.20068516,0.0000027203653,0.0000024902106,0.00001443662,0.000022444417,0.0031270352,0.00030003476,0.2242158,0.5701494,0.00019626837],"about_ca_topic_score_codex":0.00016552181,"about_ca_topic_score_gemma":0.000029406508,"teacher_disagreement_score":0.6333653,"about_ca_system_score_codex":0.00024389925,"about_ca_system_score_gemma":0.000031096497,"threshold_uncertainty_score":0.99784774},"labels":[],"label_agreement":null},{"id":"W4316591874","doi":"10.1007/s00291-023-00706-2","title":"An alternative approach to address uncertainty in hub location","year":2023,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Transportation Planning and Optimization","field":"Social 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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematical optimization; Measure (data warehouse); Network planning and design; Flow network; Scale (ratio); Operations research; Data mining; Mathematics","score_opus":0.04089472222849712,"score_gpt":0.3383161528936501,"score_spread":0.297421430665153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4316591874","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8676671,0.000015580827,0.024701662,0.0059876507,0.00075159885,0.0009736935,0.00003764962,0.0007840588,0.099081],"genre_scores_gemma":[0.9973437,0.000016954256,0.0005538348,0.000100092344,0.00011988984,0.00002920089,0.00010578579,0.0000069804423,0.0017235345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99925345,0.0000751002,0.00010424917,0.00017624345,0.00020202328,0.0001889241],"domain_scores_gemma":[0.9997463,0.00003277366,0.000030111958,0.00008474921,0.000030936902,0.00007512293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034335206,0.000050625476,0.000065441556,0.00015348496,0.0001424011,0.000046306755,0.00013780071,0.00004032086,0.000059128062],"category_scores_gemma":[0.00005784752,0.000047564983,0.000010479541,0.0011789594,0.000029487319,0.0001603092,0.0000032712112,0.000055914436,0.000069276546],"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.00006347678,0.00007770027,0.0113801835,0.000007226255,0.0000046403134,0.0000074482746,0.060712837,0.88591653,0.00001885979,0.03950813,0.0008126166,0.0014903524],"study_design_scores_gemma":[0.0015521358,0.00033964802,0.6857734,0.00013689749,0.000021516795,0.0000010757461,0.07388565,0.20077154,0.00043644657,0.007825836,0.028381214,0.0008746452],"about_ca_topic_score_codex":0.004826705,"about_ca_topic_score_gemma":0.015132848,"teacher_disagreement_score":0.68514496,"about_ca_system_score_codex":0.00007408582,"about_ca_system_score_gemma":0.00009022782,"threshold_uncertainty_score":0.84444845},"labels":[],"label_agreement":null},{"id":"W4392139766","doi":"10.1007/s00291-024-00749-z","title":"Optimal consumption and investment in general affine GARCH models","year":2024,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","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":"Western University","funders":"","keywords":"Homoscedasticity; Autoregressive conditional heteroskedasticity; Consumption (sociology); Heteroscedasticity; Conditional variance; Econometrics; Economics; Variance (accounting); Affine transformation; Gaussian; Mathematics; Computer science; Volatility (finance)","score_opus":0.047938874374722745,"score_gpt":0.2571650337813429,"score_spread":0.20922615940662018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392139766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42451602,0.011747218,0.5440101,0.0034442157,0.00030524528,0.00040078783,0.00014224704,0.00009271966,0.015341434],"genre_scores_gemma":[0.9921672,0.000605805,0.0053731482,0.00018509886,0.00014928124,0.00010145453,0.000011363526,0.0000168613,0.00138983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992889,0.0000010843919,0.00023326495,0.00028605436,0.000018243618,0.00017244414],"domain_scores_gemma":[0.99979895,0.000018802277,0.000031487412,0.00010588612,0.000003219165,0.00004163782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011015075,0.00008067358,0.000146006,0.00015697746,0.000037377296,0.0000670454,0.000065599124,0.000045656714,0.00016615832],"category_scores_gemma":[0.000009559183,0.000081450984,0.000022496755,0.00019118607,0.000035804376,0.000118997574,0.000039074377,0.000091986636,0.00018812784],"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.000010440924,0.000023495362,0.00041228824,0.000030422078,0.0000058547275,0.0000062115264,0.00014481606,0.0003195096,0.00001648938,0.99817944,0.00010499512,0.0007460288],"study_design_scores_gemma":[0.00025645108,0.00006243372,0.00618336,0.000025041949,0.000003260711,0.00001419192,0.000009803,0.18538557,0.00004765108,0.7957321,0.012115921,0.00016421537],"about_ca_topic_score_codex":0.00018276686,"about_ca_topic_score_gemma":0.00011632967,"teacher_disagreement_score":0.56765115,"about_ca_system_score_codex":0.0000691347,"about_ca_system_score_gemma":0.000022435748,"threshold_uncertainty_score":0.33214748},"labels":[],"label_agreement":null},{"id":"W4392634046","doi":"10.1007/s00291-024-00750-6","title":"Optimization models for disaster response operations: a literature review","year":2024,"lang":"en","type":"review","venue":"OR Spectrum","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; Wilfrid Laurier University; University of Ottawa; University of New Brunswick","funders":"Government of Ontario","keywords":"Natural disaster; Emergency management; Humanitarian Logistics; Disaster response; Distribution (mathematics); Plan (archaeology); Operations research; Population; Relief Work; Coronavirus disease 2019 (COVID-19); Operations management; Business; Computer science; Geography; Economics; Sociology; Engineering; Economic growth; Medical emergency; Demography; Mathematics; Medicine","score_opus":0.07134355448486228,"score_gpt":0.33404815905212626,"score_spread":0.26270460456726397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392634046","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.0130398e-8,0.97356457,0.016487416,0.0039752745,0.0010485818,0.0031393634,0.00007453145,0.00021288998,0.001497337],"genre_scores_gemma":[3.0514283e-7,0.971339,0.0009581138,0.0020901163,0.0009005221,0.0010497792,0.0013666113,0.00009064678,0.022204923],"study_design_codex":"systematic_review","study_design_gemma":"not_applicable","domain_scores_codex":[0.99799126,0.00004469638,0.00077646336,0.0006368644,0.00024747875,0.00030325633],"domain_scores_gemma":[0.9991242,0.00002592515,0.00010086517,0.00061577954,0.00011577756,0.00001744142],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000780539,0.00048788427,0.00092140964,0.0004767485,0.00016356564,0.0008240279,0.00038960847,0.00016353623,0.0009601238],"category_scores_gemma":[0.00020221055,0.00032973365,0.00052231457,0.0013579532,0.000020135682,0.00103761,0.00019280218,0.0002246644,0.001013696],"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.0001798368,0.00011399371,2.4804711e-8,0.53984314,0.00030499665,0.000018828576,0.00004533138,0.012407385,1.2509342e-8,0.041517824,0.22891042,0.1766582],"study_design_scores_gemma":[0.00009851924,0.000013924516,2.2548212e-8,0.06261215,0.0015000842,0.0000029080982,0.0000071499608,0.05761993,4.8271325e-9,0.00028816256,0.8774984,0.00035875826],"about_ca_topic_score_codex":0.000015660566,"about_ca_topic_score_gemma":0.00008165397,"teacher_disagreement_score":0.64858794,"about_ca_system_score_codex":0.00010975143,"about_ca_system_score_gemma":0.00009783041,"threshold_uncertainty_score":0.99995315},"labels":[],"label_agreement":null},{"id":"W4400765328","doi":"10.1007/s00291-024-00781-z","title":"New formulations for the robust vehicle routing problem with time windows under demand and travel time uncertainty","year":2024,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Vehicle Routing Optimization Methods","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":"Transport Canada; Université Laval","funders":"Fonds de recherche du Québec – Nature et technologies; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Time travel; Vehicle routing problem; Travel time; Computer science; Routing (electronic design automation); Operations research; Transport engineering; Engineering; Computer network; Artificial intelligence","score_opus":0.016687559788272018,"score_gpt":0.24562073554589928,"score_spread":0.22893317575762726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400765328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004103883,0.00027156493,0.99099654,0.001845504,0.00006918763,0.00060796144,0.000014478955,0.0004411706,0.0016497087],"genre_scores_gemma":[0.59340346,0.000041967378,0.38972098,0.00011712529,0.00053517154,0.00007673597,0.00003440665,0.00022072335,0.015849404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916613,0.000022420763,0.00018800476,0.00021108071,0.000114300026,0.00029808818],"domain_scores_gemma":[0.99926275,0.00045285196,0.000023926808,0.00016815435,0.000016778162,0.00007552665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033045356,0.0001654171,0.00015480572,0.00005903804,0.00019528983,0.00020588278,0.0001000164,0.00006533714,0.00018252147],"category_scores_gemma":[0.000021742855,0.00010673858,0.00004000221,0.0003107485,0.000025293664,0.00016466063,0.000022350654,0.00015299892,0.000034865647],"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.000023001108,0.0000037827547,0.000052415002,0.000045740435,0.000093227885,0.0000017402293,0.00037215554,0.9904249,0.0008832471,0.003019034,0.0008784798,0.004202295],"study_design_scores_gemma":[0.0004337868,0.00005958665,0.00067417155,0.000079435646,0.00008131513,0.000027550734,0.000045570836,0.99576443,0.00054648065,0.0012398817,0.00087068457,0.0001771172],"about_ca_topic_score_codex":0.000021596063,"about_ca_topic_score_gemma":0.000049736627,"teacher_disagreement_score":0.60127556,"about_ca_system_score_codex":0.00007954465,"about_ca_system_score_gemma":0.00007132515,"threshold_uncertainty_score":0.43526733},"labels":[],"label_agreement":null},{"id":"W4407921182","doi":"10.1007/s00291-025-00811-4","title":"The consistent biennial Malmquist productivity change index and ranking using the cross validation method","year":2025,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","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":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ranking (information retrieval); Index (typography); Malmquist index; Productivity; Econometrics; Statistics; Economics; Computer science; Mathematics; Total factor productivity; Information retrieval; Macroeconomics","score_opus":0.14945013684973044,"score_gpt":0.4578281526203708,"score_spread":0.3083780157706404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407921182","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.876224,0.0005376736,0.096371576,0.023250816,0.0014991057,0.00054881605,0.000006133384,0.000045797453,0.001516087],"genre_scores_gemma":[0.99661195,0.00001245442,0.00086938584,0.0002623552,0.00023520096,0.000012588149,4.5800874e-7,0.0000070836686,0.0019885441],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969813,0.0007547504,0.00046934336,0.0005774898,0.000892771,0.0003243192],"domain_scores_gemma":[0.99639404,0.0022430813,0.00029572082,0.0008596006,0.000172798,0.000034746365],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.009620177,0.00014544527,0.00024007006,0.00021353574,0.0018118887,0.0014321561,0.0006462847,0.00005665696,0.000048014233],"category_scores_gemma":[0.0036631313,0.00006730066,0.000105260006,0.0019659414,0.0004924375,0.0002715111,0.00031809948,0.00020480996,0.000010180774],"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.00164904,0.0004486411,0.51314455,0.00006337083,0.00052674295,0.00006270535,0.009948176,0.009051247,0.012502735,0.09924694,0.0019873946,0.35136843],"study_design_scores_gemma":[0.0017951917,0.00016271877,0.36929896,0.00015810109,0.00044230293,0.0001815003,0.0031394367,0.37801605,0.0305531,0.13281795,0.08256926,0.00086543104],"about_ca_topic_score_codex":0.0002916951,"about_ca_topic_score_gemma":0.0007403064,"teacher_disagreement_score":0.3689648,"about_ca_system_score_codex":0.000083365136,"about_ca_system_score_gemma":0.00012381942,"threshold_uncertainty_score":0.99960446},"labels":[],"label_agreement":null}]}