{"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":"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.33117568,0.00047123144,0.59425265,0.002194413,0.00012154898,0.00009208414,0.00014126174,0.00019193887,0.071359225],"genre_scores_gemma":[0.98180056,0.00017264325,0.009726337,0.00010938683,0.000081306986,0.00007576931,0.000040320836,0.00005439989,0.007939217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944576,0.0030920617,0.00021500385,0.00057031336,0.00076354697,0.0009014431],"domain_scores_gemma":[0.9429734,0.0455759,0.003186931,0.0033511312,0.0027082816,0.0022043292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059736897,0.00072614837,0.0019915113,0.0017430186,0.0026460448,0.005440369,0.0031996197,0.0026196649,0.014206383],"category_scores_gemma":[0.039737966,0.0008955606,0.0011619001,0.0018634222,0.0067610005,0.009075466,0.0032218655,0.0025253992,0.00083571277],"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.00006188098,0.00004225562,0.00037853332,0.000029465155,0.000012861489,0.000039499413,0.00021070182,0.023229558,0.00042324103,0.97216076,0.0005872923,0.002823868],"study_design_scores_gemma":[0.000039306145,0.000026409718,0.00017750433,0.000012071099,0.000017054746,0.000045698966,0.00021460478,0.11877535,0.00036047184,0.87951434,0.0007999339,0.000017294993],"about_ca_topic_score_codex":0.0034815462,"about_ca_topic_score_gemma":0.0026850214,"teacher_disagreement_score":0.014206383,"about_ca_system_score_codex":0.0024120088,"about_ca_system_score_gemma":0.0021097932,"threshold_uncertainty_score":0.04752505},"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":"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.9856127,0.000054965367,0.003510108,0.00035472188,0.000021252541,0.0000145275835,0.00008407139,0.00002759213,0.010320136],"genre_scores_gemma":[0.99869776,0.000014183508,0.00029316117,0.0000348965,0.0000047643875,0.0000031904146,0.000031286927,0.0000070835517,0.00091363204],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995679,0.00011775652,0.000021072348,0.00010750911,0.00009715835,0.00008864991],"domain_scores_gemma":[0.994175,0.0042464854,0.00047545272,0.00031426284,0.00041764413,0.0003710872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011475589,0.00015997278,0.00042626495,0.00029737668,0.00040400442,0.0021670896,0.00075381604,0.0012854377,0.00839504],"category_scores_gemma":[0.012887791,0.00042792177,0.00033898655,0.0003122262,0.000776975,0.0023521709,0.00059239817,0.0012518914,0.00074625295],"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.018567484,0.003899654,0.45067453,0.00047977155,0.00046310184,0.003495224,0.004369145,0.06894014,0.14066903,0.19328797,0.012251029,0.10290287],"study_design_scores_gemma":[0.00025539644,0.000771015,0.5662937,0.000057363923,0.0003590448,0.00093627145,0.004660304,0.33072013,0.00940691,0.08407534,0.0022786574,0.00018588179],"about_ca_topic_score_codex":0.0030969337,"about_ca_topic_score_gemma":0.005095828,"teacher_disagreement_score":0.00839504,"about_ca_system_score_codex":0.0007664739,"about_ca_system_score_gemma":0.00046013764,"threshold_uncertainty_score":0.028084219},"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":"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.009950712,0.00007861023,0.98883724,0.000079762,0.0000074953305,0.0000140913235,0.000034359105,0.00016291696,0.0008348586],"genre_scores_gemma":[0.48634115,0.000575772,0.5079359,0.00014199986,0.00014384948,0.00017617764,0.00035398328,0.00036697552,0.003964264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897987,0.00044727034,0.00004232117,0.00016969345,0.00028258207,0.00007828887],"domain_scores_gemma":[0.99668413,0.0025156392,0.00020680329,0.00025829687,0.00025700981,0.00007811119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029435083,0.0008395243,0.0011364564,0.0015545719,0.00034319234,0.0011946759,0.0011457016,0.00092389464,0.0021276178],"category_scores_gemma":[0.0123430565,0.0006481638,0.00084486534,0.0014629045,0.0010161371,0.003030041,0.0014657833,0.00068333594,0.00048719096],"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.00013802276,0.00007420179,0.0016639137,0.00010942476,0.00007421779,0.000071898685,0.00008428774,0.79265565,0.004313676,0.07498029,0.0017084049,0.124126084],"study_design_scores_gemma":[0.000010036888,0.000011195473,0.00020655795,0.0000067863325,0.000008575293,0.000043469383,0.00000726298,0.94829875,0.0008961339,0.04990757,0.0005962054,0.0000074418713],"about_ca_topic_score_codex":0.0016920253,"about_ca_topic_score_gemma":0.0023040234,"teacher_disagreement_score":0.0029435083,"about_ca_system_score_codex":0.0007257191,"about_ca_system_score_gemma":0.0008246637,"threshold_uncertainty_score":0.0155668855},"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":"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.10693261,0.0007993758,0.8809071,0.0016525476,0.00009813796,0.00006344233,0.0010001365,0.00033941574,0.008207257],"genre_scores_gemma":[0.95132565,0.00066373806,0.040587734,0.00018396095,0.00033164755,0.000114167975,0.0005888758,0.00013857051,0.006065692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864024,0.00062013976,0.000047629343,0.00030001331,0.00024020894,0.00015176165],"domain_scores_gemma":[0.98944086,0.008837088,0.0007163227,0.00041022128,0.0003985526,0.00019704588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002168119,0.0013649396,0.0020049927,0.0007536626,0.0004125094,0.0017793128,0.0012820923,0.001429045,0.0033473645],"category_scores_gemma":[0.011987465,0.0011977113,0.00091566925,0.0014129444,0.0015283143,0.0028107492,0.0015018936,0.0015622252,0.00046899397],"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.00047304382,0.0000621737,0.0009609023,0.0002763042,0.00013774907,0.00028396715,0.000116825664,0.9229359,0.0028308504,0.05054003,0.002819346,0.018562896],"study_design_scores_gemma":[0.000022612516,0.000030861636,0.0004524065,0.000015869402,0.000019532434,0.00005710972,0.000017158098,0.9536383,0.0005660747,0.044872202,0.00029511823,0.000012698875],"about_ca_topic_score_codex":0.0020296287,"about_ca_topic_score_gemma":0.0013144673,"teacher_disagreement_score":0.0033473645,"about_ca_system_score_codex":0.00092353957,"about_ca_system_score_gemma":0.0008613803,"threshold_uncertainty_score":0.011466265},"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":"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.0465499,0.0007344644,0.93651277,0.0012672363,0.0001220183,0.00014348148,0.0010600826,0.0001948044,0.01341534],"genre_scores_gemma":[0.886929,0.0013084054,0.074174546,0.00026663122,0.00015129181,0.0005423815,0.000959129,0.00016643401,0.03550215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721164,0.0016127041,0.000106814914,0.00039062905,0.0003208057,0.00035732923],"domain_scores_gemma":[0.98992974,0.008127852,0.00071324495,0.0003908864,0.0006268585,0.0002114415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005619629,0.001839657,0.0029827976,0.002391608,0.0008706914,0.0036529065,0.0029696403,0.0028739804,0.010230412],"category_scores_gemma":[0.013582093,0.00169233,0.002209177,0.002953305,0.0014850165,0.0038324744,0.0018585533,0.0029838544,0.0011087771],"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.000022982542,0.00002051513,0.00017144803,0.000021783912,0.000021215117,0.000015188287,0.000015607297,0.97274745,0.000059151767,0.024529813,0.00033368965,0.0020411138],"study_design_scores_gemma":[0.0000060752627,0.0000066401235,0.00008298774,0.0000057468715,0.000009188512,0.0000073815504,0.000012795733,0.98511314,0.000044797827,0.014400865,0.00030500285,0.0000054169896],"about_ca_topic_score_codex":0.016957594,"about_ca_topic_score_gemma":0.013028183,"teacher_disagreement_score":0.016957594,"about_ca_system_score_codex":0.004541619,"about_ca_system_score_gemma":0.0017963876,"threshold_uncertainty_score":0.034224153},"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":"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.42222366,0.00085089536,0.33105677,0.008122061,0.00039733518,0.0008559758,0.0016999375,0.000349781,0.23444353],"genre_scores_gemma":[0.9548991,0.0003099049,0.013483222,0.00035077328,0.00008662696,0.00016064687,0.0001293645,0.000022120515,0.030558206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979972,0.00086518214,0.00006640376,0.0003950124,0.00028202668,0.00039413277],"domain_scores_gemma":[0.9956221,0.0029544844,0.00029687773,0.00016435598,0.00019879319,0.0007634554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021703742,0.0015694264,0.002366949,0.0010504079,0.0017600625,0.0052790623,0.0035280136,0.0068783876,0.015046643],"category_scores_gemma":[0.004571885,0.0016920859,0.001198907,0.0011829152,0.003429622,0.0062256805,0.0029427246,0.002487186,0.00093746197],"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.0013070015,0.00054126786,0.0012950952,0.00036443278,0.0001762277,0.002561656,0.0004244455,0.45214903,0.00476026,0.5211336,0.006542129,0.008744857],"study_design_scores_gemma":[0.00066700455,0.0006303495,0.0006906042,0.00006260609,0.000110061155,0.00068831147,0.00051280856,0.8374778,0.0006155655,0.15155225,0.006852472,0.00014011594],"about_ca_topic_score_codex":0.007464776,"about_ca_topic_score_gemma":0.0070363167,"teacher_disagreement_score":0.015046643,"about_ca_system_score_codex":0.0037382534,"about_ca_system_score_gemma":0.002283128,"threshold_uncertainty_score":0.050336063},"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":"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.990864,0.00011113532,0.000986686,0.0006660613,0.000010457181,0.000030853895,0.00013706363,0.000013347289,0.0071802754],"genre_scores_gemma":[0.99887735,0.000022720507,0.000307589,0.000025771134,0.0000043053305,0.000008138137,0.000017065873,0.0000072993007,0.00072978187],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9869043,0.009943808,0.00032779053,0.0004557492,0.0011706718,0.0011976525],"domain_scores_gemma":[0.90144604,0.08342866,0.004320926,0.0024680286,0.0034141983,0.004922162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006846397,0.00022291251,0.0004098848,0.00088550197,0.0011010692,0.0030478784,0.0014433147,0.001339163,0.025413025],"category_scores_gemma":[0.06396573,0.0002941147,0.00066026463,0.0012154302,0.0007879171,0.0013996182,0.0013886787,0.001059153,0.0009505325],"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.0026729603,0.0018785554,0.93180925,0.00007307732,0.00018053566,0.0005483643,0.002074918,0.0043917303,0.00091539155,0.0048620603,0.001211374,0.049381983],"study_design_scores_gemma":[0.00029948764,0.0021041778,0.9142679,0.00012778224,0.0005392284,0.0015108822,0.017884616,0.04896498,0.0019836812,0.009264133,0.0029660095,0.00008715837],"about_ca_topic_score_codex":0.024793403,"about_ca_topic_score_gemma":0.040797763,"teacher_disagreement_score":0.025413025,"about_ca_system_score_codex":0.0038202968,"about_ca_system_score_gemma":0.0032089073,"threshold_uncertainty_score":0.08501506},"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":"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.7297211,0.0008537476,0.17976438,0.0030196365,0.0004041302,0.00092326564,0.00045981293,0.00091646,0.08393731],"genre_scores_gemma":[0.9698495,0.000101027035,0.019063732,0.000114183254,0.00006637062,0.000048683723,0.00006336004,0.00004346022,0.010649645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979842,0.0005594303,0.00011785294,0.00038005866,0.00047400844,0.0004844426],"domain_scores_gemma":[0.9952129,0.0029099847,0.00032321183,0.0004261472,0.00047950205,0.0006482616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043601873,0.0011882053,0.001463333,0.0016060561,0.0015127511,0.004110101,0.0022308636,0.003945094,0.024649901],"category_scores_gemma":[0.0095098335,0.0010584152,0.0011987716,0.0009544184,0.0010282967,0.0039772857,0.0015764746,0.0020212654,0.0011713638],"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.009804925,0.0020646881,0.0070358906,0.00064176583,0.00024152416,0.006284018,0.0010787664,0.4606055,0.04859245,0.12090586,0.0110578565,0.3316867],"study_design_scores_gemma":[0.00042290264,0.0032340835,0.0055069206,0.00013701437,0.00032618418,0.0013830587,0.00090238417,0.9086534,0.012966894,0.055115,0.011139435,0.00021271817],"about_ca_topic_score_codex":0.002615763,"about_ca_topic_score_gemma":0.0027484412,"teacher_disagreement_score":0.024649901,"about_ca_system_score_codex":0.0014858143,"about_ca_system_score_gemma":0.0025250043,"threshold_uncertainty_score":0.08246207},"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":"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.0048125447,0.000062066945,0.99183476,0.0002085624,0.000024872505,0.000028945016,0.0000233835,0.000019313911,0.0029855403],"genre_scores_gemma":[0.23606306,0.0003479038,0.7565985,0.00022337135,0.00015975935,0.00039103997,0.00013651005,0.00010508375,0.005974729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697065,0.0012708821,0.00018469142,0.00039791025,0.0009874236,0.00018850484],"domain_scores_gemma":[0.993884,0.0042631486,0.0004799808,0.00037896747,0.0007307604,0.00026303335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048806695,0.0011717761,0.0019232589,0.0028889878,0.0012062863,0.0033410217,0.0026146949,0.0020357226,0.0042720237],"category_scores_gemma":[0.011569404,0.0008817557,0.0020719967,0.0021905869,0.0026893918,0.0060287514,0.003233523,0.0037587336,0.0006186267],"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.00004696631,0.00014106276,0.00035295467,0.0002139212,0.00006397897,0.000082652936,0.0002494199,0.23782153,0.0016728046,0.7242762,0.0015238585,0.03355462],"study_design_scores_gemma":[0.000009319641,0.00005893684,0.0001035817,0.00004557697,0.000016768701,0.000036600228,0.000052711122,0.595573,0.00062748353,0.40220985,0.0012458519,0.000020283107],"about_ca_topic_score_codex":0.0009635933,"about_ca_topic_score_gemma":0.0012673157,"teacher_disagreement_score":0.0048806695,"about_ca_system_score_codex":0.0021875438,"about_ca_system_score_gemma":0.0021267007,"threshold_uncertainty_score":0.025811732},"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":"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.27536526,0.0009324872,0.68784064,0.0045640855,0.00046322893,0.00021404367,0.0012823051,0.0003481369,0.028989848],"genre_scores_gemma":[0.97063905,0.00033428124,0.020738285,0.0001430477,0.00007578848,0.00007966117,0.00035298144,0.00005259275,0.007584411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898297,0.0005091749,0.000026746748,0.0001960597,0.00008713582,0.00019781255],"domain_scores_gemma":[0.999398,0.00031716426,0.00010080203,0.00002912013,0.00006423862,0.00009074757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000932931,0.000828136,0.0008791319,0.0008369875,0.00067517074,0.0015925878,0.0014835768,0.0013556328,0.0062573864],"category_scores_gemma":[0.0029897813,0.0005997913,0.00071973255,0.001317941,0.0006338584,0.0016166914,0.0011979418,0.00086785527,0.00040363232],"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.00010793661,0.000047217916,0.0012489591,0.000031847543,0.000035348363,0.00009162916,0.00005254103,0.9676051,0.0002267982,0.015762702,0.0023316543,0.012458239],"study_design_scores_gemma":[0.000015529864,0.000029868268,0.00039360882,0.0000088009565,0.000015043981,0.000031266205,0.00017756793,0.98705894,0.00010413256,0.011075613,0.0010820939,0.000007524735],"about_ca_topic_score_codex":0.016402248,"about_ca_topic_score_gemma":0.011463154,"teacher_disagreement_score":0.016402248,"about_ca_system_score_codex":0.0021107562,"about_ca_system_score_gemma":0.001568545,"threshold_uncertainty_score":0.032613575},"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":"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.012481563,0.056044716,0.21742111,0.08047511,0.011874133,0.0017354878,0.0038351393,0.0007701393,0.6153626],"genre_scores_gemma":[0.4826096,0.121084966,0.14572152,0.010279207,0.016768435,0.0019425557,0.006126138,0.0002867011,0.21518093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9951159,0.0016840579,0.0004356417,0.00056782906,0.0017400426,0.00045658604],"domain_scores_gemma":[0.9953347,0.0018508587,0.0006028943,0.00041287704,0.001308403,0.0004903303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032119406,0.0010337027,0.0009080474,0.0018615174,0.0013322363,0.006369779,0.0012742893,0.001883418,0.03492999],"category_scores_gemma":[0.008603635,0.0002716162,0.0006958655,0.0043452713,0.0011901429,0.0028047548,0.0017399723,0.0020838738,0.006071813],"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.00006808706,0.00012604699,0.0015442569,0.00080004515,0.000102218386,0.00015846998,0.00023147037,0.016382964,0.00046128812,0.44181728,0.24747083,0.29083705],"study_design_scores_gemma":[0.000042134518,0.00019214457,0.0017996496,0.00065635215,0.000032970485,0.00022829007,0.000772786,0.036168464,0.00058142893,0.28682265,0.6726455,0.00005757552],"about_ca_topic_score_codex":0.0027585917,"about_ca_topic_score_gemma":0.0017826299,"teacher_disagreement_score":0.03492999,"about_ca_system_score_codex":0.003966533,"about_ca_system_score_gemma":0.0068822326,"threshold_uncertainty_score":0.11685246},"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":"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.024089495,0.0012468639,0.95944214,0.0025699602,0.00024304145,0.0001126736,0.0014970787,0.00054289104,0.01025585],"genre_scores_gemma":[0.8653962,0.0028311897,0.06990115,0.00087639573,0.0006623478,0.0005691517,0.002166112,0.0003386935,0.05725883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712807,0.0011443782,0.0001399728,0.00050147803,0.00052163715,0.0005644251],"domain_scores_gemma":[0.9837194,0.013111211,0.00093712716,0.0006894628,0.0010729564,0.00046990204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055611264,0.0021031778,0.004983504,0.0020001172,0.0014680296,0.0046724835,0.0052374774,0.00522938,0.018927751],"category_scores_gemma":[0.016466616,0.0023336643,0.0024392656,0.0030505979,0.003302755,0.009806622,0.0023811858,0.005633253,0.0024727841],"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.00015850565,0.00011216732,0.00038587887,0.000109153254,0.00007776608,0.00018777177,0.00010567628,0.53739756,0.00032715217,0.44893086,0.0045621186,0.0076453257],"study_design_scores_gemma":[0.000018906172,0.000011678788,0.00006491864,0.000010837287,0.000013993537,0.000018353521,0.000009383355,0.89409095,0.000047317902,0.105252795,0.00044309316,0.000017759467],"about_ca_topic_score_codex":0.0188615,"about_ca_topic_score_gemma":0.012460603,"teacher_disagreement_score":0.018927751,"about_ca_system_score_codex":0.0049956483,"about_ca_system_score_gemma":0.0034712877,"threshold_uncertainty_score":0.06331962},"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":"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.006083138,0.00040253947,0.98858273,0.00035855052,0.000041594987,0.00010745903,0.00018979216,0.00017569956,0.004058594],"genre_scores_gemma":[0.23702171,0.0017468018,0.74938506,0.00028621632,0.00017308486,0.0010123056,0.0010924381,0.00032625638,0.00895618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986833,0.0005231199,0.000055918452,0.00027336334,0.00022558229,0.00023869952],"domain_scores_gemma":[0.99667823,0.002469199,0.00033896216,0.00016587973,0.00022290969,0.00012479463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026669886,0.002108009,0.0020085233,0.001112697,0.0011903753,0.0029353858,0.003989541,0.0027609724,0.006688611],"category_scores_gemma":[0.0063978676,0.0013782083,0.00215321,0.00180777,0.0012923995,0.0034344804,0.0020449192,0.003210532,0.0011442597],"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.00002054323,0.000049773942,0.00017006663,0.000058220387,0.000020044354,0.000032300486,0.00004899479,0.9572593,0.00009321976,0.032652985,0.0014649368,0.008129643],"study_design_scores_gemma":[0.000017282227,0.000011604542,0.00004096018,0.0000127050125,0.000008345217,0.000014214752,0.000023075176,0.975807,0.000062450024,0.022947017,0.0010486391,0.000006683741],"about_ca_topic_score_codex":0.014351201,"about_ca_topic_score_gemma":0.0132595375,"teacher_disagreement_score":0.014351201,"about_ca_system_score_codex":0.0029726063,"about_ca_system_score_gemma":0.0029288756,"threshold_uncertainty_score":0.028535306},"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":"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.02005787,0.00017160515,0.9716465,0.00032918178,0.000054066648,0.000090555564,0.00003896563,0.00019210344,0.00741916],"genre_scores_gemma":[0.77086586,0.0004710828,0.22347526,0.00011462645,0.000055774875,0.00022335582,0.000084378014,0.00009506492,0.0046145786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817383,0.0007065684,0.00008025784,0.00034166945,0.00054123724,0.00015641507],"domain_scores_gemma":[0.9960998,0.0019700713,0.0006467021,0.0005488071,0.0005456908,0.00018888648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020327293,0.00055688026,0.0005150504,0.00066651177,0.00069682044,0.002431003,0.0017272761,0.0012966297,0.0031531292],"category_scores_gemma":[0.009688843,0.0005594181,0.00040164296,0.0006062701,0.0015251791,0.002989791,0.0024456738,0.0008796871,0.00051656837],"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.00015765076,0.000082105435,0.0005783396,0.0001827076,0.0000357941,0.00015721312,0.00022054029,0.59977585,0.012734622,0.30751836,0.0011341594,0.07742275],"study_design_scores_gemma":[0.000023839888,0.000087938606,0.0000840621,0.00003434869,0.00001847903,0.000059058053,0.00007558489,0.8626299,0.005012567,0.12641686,0.0055426704,0.000014677626],"about_ca_topic_score_codex":0.0006214926,"about_ca_topic_score_gemma":0.0007027482,"teacher_disagreement_score":0.0031531292,"about_ca_system_score_codex":0.0011971518,"about_ca_system_score_gemma":0.0010644469,"threshold_uncertainty_score":0.010750234},"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":"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.09957747,0.000893427,0.8885036,0.000314903,0.000112578055,0.00023879482,0.0001448372,0.00035657125,0.009857801],"genre_scores_gemma":[0.68621045,0.00022195949,0.30915165,0.000103843966,0.000043516633,0.00037677845,0.00018416904,0.00008702152,0.0036206173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939215,0.00032839316,0.000017348882,0.000069652866,0.00010541388,0.000086929176],"domain_scores_gemma":[0.9987198,0.0009695693,0.000092355534,0.000030269437,0.00011489602,0.00007309144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014234214,0.0009429214,0.0016144511,0.0013852662,0.00069372676,0.0008087446,0.0017351212,0.0014108233,0.003123377],"category_scores_gemma":[0.0026292396,0.0010747259,0.00066499686,0.0011072715,0.00076259463,0.0011030955,0.00080669293,0.00074255356,0.00024048575],"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.00007887581,0.000042890333,0.00016389384,0.000028323082,0.000019679632,0.00003670897,0.000025729918,0.9824385,0.00020102497,0.0025675197,0.0005706255,0.013826223],"study_design_scores_gemma":[0.000023193285,0.000034787274,0.000045141118,0.000004923238,0.0000067651613,0.0000068149443,0.000008443211,0.9985518,0.00006766184,0.0010173954,0.00022995757,0.0000031276434],"about_ca_topic_score_codex":0.008110135,"about_ca_topic_score_gemma":0.0075570084,"teacher_disagreement_score":0.008110135,"about_ca_system_score_codex":0.0012864249,"about_ca_system_score_gemma":0.0012447976,"threshold_uncertainty_score":0.016125858},"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":"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.030569982,0.0008213651,0.9606667,0.00040227652,0.00024708585,0.000026215264,0.000055795168,0.0000512904,0.0071592964],"genre_scores_gemma":[0.87747663,0.0021802273,0.09413267,0.00021820245,0.00045989497,0.00018911548,0.00014954888,0.0002292194,0.024964394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994692,0.00028166824,0.000018238312,0.000073852985,0.000092925606,0.00006413589],"domain_scores_gemma":[0.99761,0.001723153,0.0002380145,0.00012871354,0.00017818202,0.0001220785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019200944,0.00080465,0.00070890825,0.00040973868,0.00032428713,0.001055653,0.0012589289,0.0011693515,0.002227656],"category_scores_gemma":[0.0064691813,0.00064831146,0.0005853491,0.0005563036,0.0010458521,0.0023130267,0.0012076647,0.0018481269,0.00022833985],"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.00009570432,0.000053362863,0.00033094658,0.00011343274,0.0000359073,0.00009086215,0.00008105521,0.749406,0.0014308104,0.2359333,0.00138158,0.011046945],"study_design_scores_gemma":[0.000008877678,0.000013936292,0.00006397575,0.000010096143,0.0000073042434,0.000009721216,0.000015156453,0.96746564,0.0002540467,0.03140807,0.000737572,0.0000057465722],"about_ca_topic_score_codex":0.0019657454,"about_ca_topic_score_gemma":0.0013673231,"teacher_disagreement_score":0.002227656,"about_ca_system_score_codex":0.0007257527,"about_ca_system_score_gemma":0.00087226863,"threshold_uncertainty_score":0.010154545},"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":"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.028874239,0.0005122774,0.9618077,0.0010081199,0.00010001807,0.00004973136,0.0003943824,0.00017013356,0.007083384],"genre_scores_gemma":[0.79961336,0.0012810024,0.17125124,0.00024675738,0.00013137268,0.0002314214,0.0009329073,0.00019783693,0.02611402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930894,0.00027957218,0.000023718103,0.00015589145,0.000097040494,0.00013476852],"domain_scores_gemma":[0.998376,0.0010391584,0.00015732547,0.000077878336,0.00018922226,0.00016041144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015745583,0.0008812509,0.001780243,0.0007559389,0.00050087506,0.0020466617,0.003038647,0.0022526176,0.008638034],"category_scores_gemma":[0.005124298,0.00079691067,0.0010982272,0.001742876,0.0012459613,0.0021011261,0.0014921253,0.0023871502,0.0006935909],"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.00005467912,0.000022559914,0.0002535951,0.00004287616,0.000014107283,0.000056082663,0.000032168547,0.9387013,0.00017961075,0.055924885,0.001302148,0.0034160474],"study_design_scores_gemma":[0.000005629304,0.000005776478,0.000022597349,0.0000034327138,0.0000024695055,0.000006233806,0.000009436558,0.99253947,0.000018258856,0.007081868,0.0003024908,0.0000023472496],"about_ca_topic_score_codex":0.025107106,"about_ca_topic_score_gemma":0.011823099,"teacher_disagreement_score":0.025107106,"about_ca_system_score_codex":0.002023525,"about_ca_system_score_gemma":0.0016713955,"threshold_uncertainty_score":0.04992193},"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":"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.03666268,0.01296775,0.89207435,0.0025700289,0.0008875195,0.00034854875,0.0012585848,0.00080013723,0.05243034],"genre_scores_gemma":[0.29414052,0.008685576,0.6852851,0.0012152401,0.0008607359,0.0006890912,0.002116641,0.00078220177,0.006224833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9910069,0.0036524546,0.0003565401,0.0009254882,0.0031290266,0.0009296441],"domain_scores_gemma":[0.9814641,0.01376817,0.0014085299,0.0013265935,0.0016763108,0.00035635484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008336602,0.0029739367,0.001669305,0.0035054218,0.0009432633,0.0056925723,0.0042934027,0.0029778457,0.012470629],"category_scores_gemma":[0.021801805,0.001084793,0.0029677786,0.003946567,0.0015060052,0.007208604,0.0025561848,0.0063058427,0.0014049822],"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.00033969615,0.00027599937,0.0008887779,0.0008231957,0.00019732105,0.00014754554,0.00018507292,0.79146606,0.001594334,0.122735575,0.008785235,0.07256115],"study_design_scores_gemma":[0.000096703894,0.00020960179,0.00043881134,0.00029975575,0.000094497365,0.00013020218,0.0001544907,0.9319537,0.0016924761,0.05150627,0.013382264,0.00004109492],"about_ca_topic_score_codex":0.0034134067,"about_ca_topic_score_gemma":0.0050924346,"teacher_disagreement_score":0.012470629,"about_ca_system_score_codex":0.004789684,"about_ca_system_score_gemma":0.0032860162,"threshold_uncertainty_score":0.04408872},"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":"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.36924085,0.001424614,0.59466666,0.0039291736,0.0001756138,0.00013041326,0.00097051746,0.00026166352,0.0292005],"genre_scores_gemma":[0.9371765,0.0012257993,0.025981436,0.0001928638,0.00014000449,0.00011965446,0.00043624916,0.000097335556,0.03463017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988017,0.00058028323,0.0000516229,0.0002374846,0.00014217211,0.00018670213],"domain_scores_gemma":[0.99490535,0.0036158378,0.0006371724,0.00024067993,0.0003186661,0.0002823718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002956501,0.0011408133,0.0016736351,0.0010453874,0.0004967317,0.0043823346,0.0019412994,0.0032940924,0.007560636],"category_scores_gemma":[0.014759881,0.0012819372,0.0014376664,0.0012351802,0.0021309482,0.0063325544,0.0015989589,0.002160917,0.00089629815],"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.00017220396,0.00011373535,0.0010763016,0.00007875611,0.00007801834,0.0002890406,0.00015948956,0.24803817,0.00068422494,0.7416806,0.0018440358,0.005785365],"study_design_scores_gemma":[0.000066367356,0.000034511933,0.0006416217,0.000029179993,0.00003584979,0.00008104696,0.000087723965,0.5892274,0.00022753442,0.40883636,0.0006967814,0.000035682926],"about_ca_topic_score_codex":0.0049357763,"about_ca_topic_score_gemma":0.003171671,"teacher_disagreement_score":0.007560636,"about_ca_system_score_codex":0.0023916287,"about_ca_system_score_gemma":0.001226303,"threshold_uncertainty_score":0.025292873},"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":"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.49686274,0.0008815823,0.4234038,0.003275935,0.0003444054,0.00055408233,0.0014961851,0.0013622374,0.07181907],"genre_scores_gemma":[0.9826209,0.000106150816,0.012612895,0.00015056947,0.000065036635,0.000038197497,0.00010368887,0.000035422214,0.00426719],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977794,0.0006068939,0.0001053039,0.00053630443,0.0002899891,0.00068211067],"domain_scores_gemma":[0.9956546,0.002492874,0.00053328264,0.0005540705,0.00042512253,0.00034005407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028951024,0.00060860586,0.0018416966,0.0008628951,0.0005920937,0.0030051155,0.0020065142,0.001506911,0.022571947],"category_scores_gemma":[0.0068625333,0.00062536134,0.0013514832,0.00081813976,0.0007442421,0.0035353957,0.0018113374,0.0017906536,0.0011111742],"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.0023109436,0.0009225803,0.01310831,0.00072308996,0.00055724924,0.0006668389,0.00056262035,0.48893392,0.018048,0.27356142,0.010082031,0.19052303],"study_design_scores_gemma":[0.00017137657,0.0007298948,0.0117535,0.00010921965,0.00023141276,0.00030832813,0.00036515194,0.8592246,0.0039669047,0.11605412,0.006976458,0.000109053115],"about_ca_topic_score_codex":0.0046985797,"about_ca_topic_score_gemma":0.00593636,"teacher_disagreement_score":0.022571947,"about_ca_system_score_codex":0.0020179448,"about_ca_system_score_gemma":0.0016537957,"threshold_uncertainty_score":0.07551068},"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":"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.39560828,0.0017772333,0.57830566,0.003423195,0.00038975678,0.00021115081,0.0005826531,0.00037832657,0.019323679],"genre_scores_gemma":[0.9155262,0.00087475026,0.07420968,0.00011836414,0.0001267736,0.000072088485,0.00019807316,0.00006181887,0.008812282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995927,0.00022002208,0.000010002957,0.00007107125,0.00004507498,0.00006115913],"domain_scores_gemma":[0.9990965,0.0006651378,0.00008227062,0.000025537098,0.000072111965,0.000058471727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008155828,0.0008770002,0.0007611368,0.0005607305,0.00062688923,0.0010283868,0.0009648426,0.0019637444,0.0035764975],"category_scores_gemma":[0.0018185973,0.00037684332,0.00081843144,0.0011083981,0.00047042605,0.00082018913,0.00070919143,0.00064539665,0.00016610751],"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.00008677464,0.00011254861,0.0010541028,0.00009386523,0.00003300335,0.00034756577,0.00004833906,0.97376347,0.0006939353,0.008510029,0.0019519937,0.013304424],"study_design_scores_gemma":[0.000011481735,0.000032843265,0.000208721,0.000003935969,0.000010335253,0.000053381256,0.00006307919,0.99663925,0.00011818069,0.0023873122,0.00046676976,0.000004635781],"about_ca_topic_score_codex":0.012307885,"about_ca_topic_score_gemma":0.0076012933,"teacher_disagreement_score":0.012307885,"about_ca_system_score_codex":0.00088111404,"about_ca_system_score_gemma":0.00085618946,"threshold_uncertainty_score":0.024472475},"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":"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.044164397,0.00077896327,0.9419621,0.0007443297,0.00011823956,0.000041505005,0.000114207636,0.000173755,0.011902468],"genre_scores_gemma":[0.94446194,0.000816813,0.043057535,0.000109292945,0.00018417393,0.00008713511,0.00007762191,0.00008867423,0.0111168325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907744,0.0003693311,0.000025197205,0.00012662334,0.00023150753,0.00016978839],"domain_scores_gemma":[0.99771106,0.0015759883,0.00022456716,0.000105983876,0.00025636886,0.0001260121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001630458,0.0006916493,0.0010021523,0.00063294714,0.0005097152,0.0019074243,0.0015509172,0.0009401668,0.004046471],"category_scores_gemma":[0.004291426,0.0006303516,0.00053836545,0.0012784274,0.0011999598,0.0019888226,0.00073696143,0.0011397472,0.00032125702],"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.000025969377,0.000043705983,0.000281923,0.000023859742,0.0000122544825,0.000028330496,0.00002550388,0.9126449,0.00048063404,0.0803578,0.0008297755,0.0052452604],"study_design_scores_gemma":[0.0000019581187,0.0000033204751,0.000043206364,0.0000011986439,0.0000029538803,0.0000036343572,0.000004401622,0.9917427,0.000060108698,0.007974783,0.00015996977,0.0000017095862],"about_ca_topic_score_codex":0.013063178,"about_ca_topic_score_gemma":0.011944006,"teacher_disagreement_score":0.013063178,"about_ca_system_score_codex":0.0025041634,"about_ca_system_score_gemma":0.0026544265,"threshold_uncertainty_score":0.025974333},"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":"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.3743217,0.00584179,0.6105172,0.0015709879,0.00021734358,0.00008292135,0.000889347,0.0026236363,0.003935124],"genre_scores_gemma":[0.93984604,0.0007798401,0.05702301,0.00009602251,0.00013694135,0.0000664478,0.0007512979,0.000048319358,0.001252138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871576,0.0006552098,0.00011026176,0.0001922264,0.00023850794,0.00008811381],"domain_scores_gemma":[0.9910499,0.007170112,0.0006142395,0.00045874645,0.00060575386,0.00010126243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005560388,0.0006818144,0.0009210311,0.003137315,0.00029904186,0.0009175958,0.00083994283,0.0009495979,0.0020060914],"category_scores_gemma":[0.015631376,0.00029841787,0.0007111866,0.0020815984,0.00033885293,0.0012758122,0.0008201567,0.001380402,0.0009325044],"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.0002078821,0.00023171624,0.03356589,0.000113237256,0.00034473438,0.00011264552,0.0000611086,0.74793476,0.0011715207,0.0043110973,0.0020573628,0.20988809],"study_design_scores_gemma":[0.0000034344473,0.000019367753,0.001948393,0.0000075049,0.000007261031,0.000013691815,0.000005613036,0.99593145,0.00017631304,0.0017401739,0.0001427497,0.0000040080217],"about_ca_topic_score_codex":0.0048836884,"about_ca_topic_score_gemma":0.0028614264,"teacher_disagreement_score":0.005560388,"about_ca_system_score_codex":0.00054128934,"about_ca_system_score_gemma":0.0006523038,"threshold_uncertainty_score":0.029406488},"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":"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.0043140105,0.00016965422,0.9832582,0.0016468161,0.00023530335,0.000045010864,0.00019768662,0.00005872069,0.010074628],"genre_scores_gemma":[0.47682175,0.0007892408,0.49203527,0.0014411252,0.0009233692,0.00032097945,0.00032545632,0.00012933208,0.027213408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980476,0.0008260921,0.00006409031,0.0003558975,0.0005571128,0.00014910256],"domain_scores_gemma":[0.9979437,0.0010102035,0.00019373906,0.00023556028,0.00052014703,0.000096649674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018111755,0.0011598134,0.0015723686,0.0016982356,0.0007457745,0.0029035695,0.0040704296,0.0032826865,0.01071711],"category_scores_gemma":[0.0061559817,0.0005840501,0.0021053236,0.0028556786,0.001098842,0.00370354,0.0022703575,0.0023403706,0.00070646754],"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.000073462405,0.00020307409,0.000826163,0.00021395598,0.00028421136,0.00018411294,0.00018397823,0.5072401,0.001167026,0.41239133,0.006791805,0.0704408],"study_design_scores_gemma":[0.00002750762,0.00006726054,0.00022174537,0.000031611384,0.000049537804,0.00006391024,0.00007496946,0.8137751,0.0003116836,0.1789647,0.0063891965,0.000022837197],"about_ca_topic_score_codex":0.0075829155,"about_ca_topic_score_gemma":0.00801193,"teacher_disagreement_score":0.01071711,"about_ca_system_score_codex":0.0016507038,"about_ca_system_score_gemma":0.0022207915,"threshold_uncertainty_score":0.035852373},"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":"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.644576,0.003087755,0.33302486,0.004100244,0.0001521205,0.000037019116,0.00032544884,0.00027590618,0.014420649],"genre_scores_gemma":[0.9845318,0.0009196569,0.0074843164,0.000089590656,0.00008312406,0.000016269834,0.000116090836,0.000047919955,0.006711199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940777,0.0003337292,0.000027066028,0.000101269565,0.000048781752,0.00008152525],"domain_scores_gemma":[0.9953172,0.003656472,0.00048357417,0.000177869,0.00016602252,0.00019885723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00221472,0.0006435234,0.0015599509,0.0006914671,0.00037003652,0.0027703466,0.0009427009,0.0017693663,0.0032697034],"category_scores_gemma":[0.011984134,0.00095844065,0.0008005675,0.0009671767,0.0017607933,0.0041320957,0.0009961212,0.0014459353,0.00018774961],"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.00016006961,0.000084260464,0.0022690857,0.00010653441,0.00009694335,0.00020988447,0.00016566405,0.47431657,0.0008114799,0.512882,0.0013972822,0.007500173],"study_design_scores_gemma":[0.000026254827,0.000020067902,0.000932238,0.000012986922,0.000019925941,0.000022154922,0.000052030686,0.6234919,0.000107521664,0.3750185,0.00027931028,0.000017178872],"about_ca_topic_score_codex":0.0057945163,"about_ca_topic_score_gemma":0.005026279,"teacher_disagreement_score":0.0057945163,"about_ca_system_score_codex":0.0016565637,"about_ca_system_score_gemma":0.0009209566,"threshold_uncertainty_score":0.012019277},"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":"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.00045521444,0.9928785,0.0042706276,0.00041638687,0.00014046887,0.000013322829,0.0001007787,0.000018627186,0.0017060947],"genre_scores_gemma":[0.0052165813,0.99084526,0.0030789236,0.00013090923,0.00021787192,0.000018519146,0.00011517595,0.000008974802,0.00036779777],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99953115,0.00013328853,0.000071038005,0.000092927294,0.000141462,0.000030250261],"domain_scores_gemma":[0.99612135,0.003232683,0.0002013658,0.00006177417,0.00034641678,0.00003636937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013760175,0.0015910752,0.0022023586,0.0024056905,0.00030794938,0.0020932846,0.0015791429,0.0014127453,0.0064962106],"category_scores_gemma":[0.0049370085,0.000705577,0.0014047815,0.0062923552,0.0004384429,0.0019571958,0.00069167075,0.0013807649,0.0010190795],"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.000096627205,0.00030006838,0.0007624028,0.06666228,0.0005238616,0.00017200316,0.00010801441,0.04714478,0.00050262874,0.029812818,0.030933816,0.82298064],"study_design_scores_gemma":[0.0001044224,0.00039584655,0.004359648,0.07719764,0.002643965,0.0008211993,0.0007107701,0.064598136,0.0010409564,0.0684711,0.77940583,0.00025041774],"about_ca_topic_score_codex":0.005223685,"about_ca_topic_score_gemma":0.0069757197,"teacher_disagreement_score":0.0064962106,"about_ca_system_score_codex":0.0007766138,"about_ca_system_score_gemma":0.0021561238,"threshold_uncertainty_score":0.021732032},"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":"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.001147303,0.00027564383,0.99550855,0.00012750657,0.00006316236,0.00001966646,0.000058042184,0.000032013213,0.0027680967],"genre_scores_gemma":[0.23006417,0.0031199786,0.7367485,0.00051313173,0.0006684845,0.0005927199,0.00066702423,0.00058581197,0.027040198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991227,0.00034166907,0.000043079966,0.00016187753,0.0002544324,0.000076281394],"domain_scores_gemma":[0.99845207,0.00094295124,0.00021771183,0.00008075245,0.0002505332,0.00005602121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022459188,0.0018587905,0.0010966047,0.00089014706,0.00029452803,0.0018584101,0.0020669086,0.001856245,0.0065469705],"category_scores_gemma":[0.005068684,0.0008464459,0.0012573118,0.0010782146,0.00078817725,0.0027414516,0.0015087395,0.0024006744,0.0008767942],"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.00002947751,0.00003743746,0.00011137011,0.00013466057,0.000042551088,0.000061022285,0.00004856285,0.8583754,0.0011502493,0.11835354,0.0024514487,0.01920431],"study_design_scores_gemma":[0.0000048235393,0.000009148398,0.000026441114,0.000011894167,0.0000069163693,0.000011064317,0.000009128119,0.98291093,0.00011511145,0.015476893,0.0014122492,0.000005449204],"about_ca_topic_score_codex":0.003395447,"about_ca_topic_score_gemma":0.0032696535,"teacher_disagreement_score":0.0065469705,"about_ca_system_score_codex":0.0014302772,"about_ca_system_score_gemma":0.0013572824,"threshold_uncertainty_score":0.021901786},"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":"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.13704857,0.0006228376,0.8559107,0.00026184443,0.00008093835,0.00009374895,0.00054033264,0.0002797359,0.00516124],"genre_scores_gemma":[0.8210128,0.00017410882,0.17404522,0.00007278328,0.00006108618,0.00015992536,0.0011297152,0.000112984446,0.003231328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9898436,0.004727991,0.0005897011,0.0011457854,0.0032282923,0.00046447237],"domain_scores_gemma":[0.9855656,0.008608791,0.001004931,0.0018025448,0.0027929677,0.00022530553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0151570765,0.0007698397,0.0013570343,0.00555276,0.0009698152,0.0033023644,0.0014667336,0.0013993377,0.0021090163],"category_scores_gemma":[0.03399269,0.0002990955,0.001188956,0.0031893465,0.0009848643,0.0023028518,0.0011803292,0.0015198527,0.0006349673],"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.00047832797,0.00038799903,0.062395614,0.00030377725,0.0008175025,0.00018010236,0.00025014873,0.44488177,0.004499425,0.07491198,0.0053263037,0.40556714],"study_design_scores_gemma":[0.000022560416,0.00015767074,0.022445971,0.00006454462,0.000057840538,0.00007129654,0.00010218155,0.94549924,0.00293097,0.026565006,0.0020219556,0.000060808008],"about_ca_topic_score_codex":0.0043158536,"about_ca_topic_score_gemma":0.0050795916,"teacher_disagreement_score":0.0151570765,"about_ca_system_score_codex":0.0013399975,"about_ca_system_score_gemma":0.0023999414,"threshold_uncertainty_score":0.08015925},"labels":[],"label_agreement":null}]}