{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":28,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":28,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"fe945fa9143d","filters":{"venue":"OR Spectrum"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.006537182786802548,"gpt":0.2320161659181334,"spread":0.2254789831313309,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004853898,0.00005891799,0.000103882,0.0000789831,0.0000110088,0.000001612452,0.0000496866,0.00003541131,0.00007870727],"category_scores_gemma":[0.00001190125,0.00005871341,0.00002041606,0.0002242914,0.00001289794,0.00006274759,0.000001449652,0.00005345307,0.00000549301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004011325,"about_ca_system_score_gemma":0.000007972475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001367074,"about_ca_topic_score_gemma":0.00008445877,"domain_scores_codex":[0.9995466,0.00001123637,0.0001872331,0.00006763847,0.00008246595,0.0001047735],"domain_scores_gemma":[0.9998457,0.00001739371,0.00002526865,0.00008343591,0.000009949457,0.00001819406],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00002262199,0.00006001337,0.5448043,0.00006164886,0.00001234917,0.00001318957,0.001521791,0.4503245,0.0004231593,0.00008908704,0.00004892938,0.002618379],"study_design_scores_gemma":[0.0003908701,0.00004904502,0.9405306,0.00001317858,0.000002725635,5.25233e-7,0.0000163119,0.05602889,0.002790213,0.00004441564,0.00004656291,0.00008664486],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9871818,0.00002323467,0.0120713,0.000009984858,0.0001011828,0.00009948211,0.000009964706,0.00007573279,0.0004272439],"genre_scores_gemma":[0.9823849,0.00009278028,0.01741171,0.000003554379,0.000004049223,0.000005084763,0.00001712729,0.00001773586,0.00006312845],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3957263,"threshold_uncertainty_score":0.2394263,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08406994656302978,"gpt":0.3576396471445394,"spread":0.2735697005815096,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001073223,0.00009851923,0.0001536491,0.00001318954,0.0005489148,0.00002202142,0.0003328522,0.00006358649,0.0006923733],"category_scores_gemma":[0.00009038587,0.0000548907,0.0001494712,0.0002658108,0.0002706368,0.00009769304,0.00001470941,0.0001460932,0.00002169259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001449647,"about_ca_system_score_gemma":0.0003078945,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.02285644,"about_ca_topic_score_gemma":0.0271057,"domain_scores_codex":[0.998576,0.0003321811,0.00022568,0.0002082653,0.000241371,0.0004164957],"domain_scores_gemma":[0.9991802,0.0002413212,0.0001394587,0.0002849259,0.00003996792,0.0001141479],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0007795247,0.0002609875,0.9787657,0.00001157987,0.00005981204,0.000003619509,0.009509862,0.00005232352,0.000004264456,0.00322756,0.001645995,0.005678832],"study_design_scores_gemma":[0.0001299503,0.0004474419,0.9813411,0.00001794214,0.000009603102,4.981653e-8,0.0004054348,0.000006189247,0.0002674916,0.01615131,0.001135232,0.00008826562],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9847268,0.0002234541,0.0005246279,0.0006295861,0.0003464326,0.0007237113,0.00003440821,0.00005489184,0.01273603],"genre_scores_gemma":[0.9987032,0.00005548233,0.00008818283,0.00002113818,0.0001485719,0.00001034432,0.000001821066,0.000004023415,0.0009671769],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0139764,"threshold_uncertainty_score":0.9906471,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01607248361109651,"gpt":0.2482842718808206,"spread":0.2322117882697241,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002285755,0.0001441588,0.0001435797,0.00003625406,0.0001203452,0.00006269492,0.0001178369,0.00008333259,0.00008382682],"category_scores_gemma":[0.00002379969,0.00009248704,0.00002887916,0.0001125958,0.000129561,0.00008263555,0.00002112546,0.0002145532,0.000003435619],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001640637,"about_ca_system_score_gemma":0.0000233293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007992927,"about_ca_topic_score_gemma":0.00006740356,"domain_scores_codex":[0.9993011,0.00001720251,0.0001570637,0.0001736336,0.00009351899,0.0002574933],"domain_scores_gemma":[0.9994687,0.0001978974,0.00003583763,0.0002055287,0.00002335746,0.00006864432],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003686472,0.0000166512,0.0002009029,0.00004021162,0.0001575838,0.00001802316,0.0006350752,0.9547794,0.002899523,0.002788875,0.00008782815,0.03833901],"study_design_scores_gemma":[0.0006404113,0.00006406901,0.00009247989,0.00001348343,0.00003620595,0.0002129754,0.00001860626,0.9909228,0.00563463,0.00167001,0.0005200281,0.0001742637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09656087,0.00007294222,0.8995724,0.0006339815,0.0003742062,0.0007996182,0.00002785088,0.0004486719,0.001509447],"genre_scores_gemma":[0.7825986,0.00003647706,0.2169438,0.00002555015,0.00006905721,0.00004547656,0.000003696304,0.00005526479,0.0002220662],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6860377,"threshold_uncertainty_score":0.3771512,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.009466649504264044,"gpt":0.2217450051240542,"spread":0.2122783556197902,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003301014,0.0001749694,0.0002127755,0.0001255844,0.00004984681,0.00009078393,0.0001844285,0.0001016904,0.001069264],"category_scores_gemma":[0.0000560585,0.0001653122,0.00003856031,0.0004881672,0.00001288886,0.0002534278,0.00004078267,0.0002427865,0.001043816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000161223,"about_ca_system_score_gemma":0.00002356738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005903278,"about_ca_topic_score_gemma":0.00002623065,"domain_scores_codex":[0.9987774,0.00006916515,0.0003268898,0.0002094518,0.0001447495,0.0004722844],"domain_scores_gemma":[0.999508,0.00008879834,0.00004196269,0.0002565805,0.00001695482,0.00008775495],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001768265,0.000176065,0.02830322,0.0002513658,0.0001054361,0.00004102782,0.003063238,0.8927053,0.06106729,0.000676207,0.001848188,0.01174495],"study_design_scores_gemma":[0.0005865949,0.00003400601,0.007366139,0.00003967302,0.000005794014,0.000009719727,0.00002861164,0.9846748,0.005934264,0.0002382064,0.0008255286,0.0002566209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9247241,0.0001391636,0.01720083,0.001308366,0.0004677415,0.00155222,0.000004307288,0.003520705,0.05108256],"genre_scores_gemma":[0.9342071,0.00001815755,0.06433833,0.00006297517,0.0001235907,0.00004829726,0.000004145984,0.00008841437,0.001108922],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09196951,"threshold_uncertainty_score":0.9998439,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01329167069259463,"gpt":0.1981603641458235,"spread":0.1848686934532288,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009744035,0.0002379962,0.0002342309,0.0001761977,0.0004819423,0.000574514,0.0006016296,0.00006165946,0.001396205],"category_scores_gemma":[0.0002172918,0.0001562215,0.00008471585,0.0007393056,0.0001059896,0.000665998,0.0003697898,0.0001689249,0.0002304254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008111525,"about_ca_system_score_gemma":0.00002728028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002288471,"about_ca_topic_score_gemma":0.00008441665,"domain_scores_codex":[0.9982315,0.00004180043,0.0003885909,0.0003001996,0.0003357136,0.0007022542],"domain_scores_gemma":[0.9987452,0.0003148818,0.0003077228,0.0005092841,0.0001053795,0.00001753346],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002556879,0.0001880181,0.02128876,0.0003947403,0.0002675131,0.00007686985,0.0001952673,0.4598353,0.0001241987,0.36254,0.1320398,0.02279379],"study_design_scores_gemma":[0.000819792,0.00005696119,0.0123475,0.00009188383,0.00009283434,0.000003096952,0.004075215,0.9282542,0.00007913036,0.01948311,0.03421078,0.000485523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06404017,0.001711834,0.6390102,0.05622925,0.003869045,0.01168669,0.000002984216,0.00145139,0.2219985],"genre_scores_gemma":[0.9860377,0.00005904408,0.001908296,0.001081617,0.001567993,0.0001735126,0.000008488853,0.00007048939,0.009092825],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9219975,"threshold_uncertainty_score":0.9995167,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04701076197470409,"gpt":0.2547918940508524,"spread":0.2077811320761483,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005952544,0.0001335079,0.0001478047,0.00004914651,0.0003615921,0.00009688384,0.0002047903,0.00002989531,0.0002992205],"category_scores_gemma":[0.0002433389,0.00008594112,0.00003894923,0.0004699868,0.00007162217,0.0003485794,0.00002747665,0.0001043106,0.0000206962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005136231,"about_ca_system_score_gemma":0.00003998486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006139601,"about_ca_topic_score_gemma":0.0002096842,"domain_scores_codex":[0.9990067,0.00002518059,0.0002521616,0.0002611103,0.000213862,0.0002409221],"domain_scores_gemma":[0.999236,0.00007509215,0.00008616297,0.0003279176,0.0002633542,0.00001146065],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007876489,0.0004310266,0.0004001457,0.0001146981,0.0001049328,8.028131e-7,0.00009263868,0.8380522,0.00007540415,0.1491672,0.006152796,0.004620493],"study_design_scores_gemma":[0.0006445043,0.0001157048,0.01214992,0.00002327984,0.0001188572,8.995264e-7,0.0002757937,0.9746989,0.0001956712,0.004712611,0.006880751,0.0001830776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001900739,0.00002270143,0.9890056,0.00656312,0.000284503,0.001431483,0.00004004815,0.0000633756,0.0006884775],"genre_scores_gemma":[0.9981692,0.00001269583,0.0006655068,0.0002117238,0.0003053471,0.0000787415,0.0001679444,0.000005224759,0.0003836554],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9962685,"threshold_uncertainty_score":0.3504577,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07134355448486228,"gpt":0.3340481590521263,"spread":0.262704604567264,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000780539,0.0004878843,0.0009214096,0.0004767485,0.0001635656,0.0008240279,0.0003896085,0.0001635362,0.0009601238],"category_scores_gemma":[0.0002022105,0.0003297337,0.0005223146,0.001357953,0.00002013568,0.00103761,0.0001928022,0.0002246644,0.001013696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001097514,"about_ca_system_score_gemma":0.00009783041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001566057,"about_ca_topic_score_gemma":0.00008165397,"domain_scores_codex":[0.9979913,0.00004469638,0.0007764634,0.0006368644,0.0002474787,0.0003032563],"domain_scores_gemma":[0.9991242,0.00002592515,0.0001008652,0.0006157795,0.0001157776,0.00001744142],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"systematic_review","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001798368,0.0001139937,2.480471e-8,0.5398431,0.0003049966,0.00001882858,0.00004533138,0.01240738,1.250934e-8,0.04151782,0.2289104,0.1766582],"study_design_scores_gemma":[0.00009851924,0.00001392452,2.254821e-8,0.06261215,0.001500084,0.000002908098,0.000007149961,0.05761993,4.827132e-9,0.0002881626,0.8774984,0.0003587583],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[3.01304e-8,0.9735646,0.01648742,0.003975275,0.001048582,0.003139363,0.00007453145,0.00021289,0.001497337],"genre_scores_gemma":[3.051428e-7,0.971339,0.0009581138,0.002090116,0.0009005221,0.001049779,0.001366611,0.00009064678,0.02220492],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.6485879,"threshold_uncertainty_score":0.9999532,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02700309089256899,"gpt":0.2278341698678038,"spread":0.2008310789752348,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003240831,0.00006969679,0.0001927003,0.0001063389,0.00002450131,0.00002755764,0.00004262018,0.00004441671,0.00009258596],"category_scores_gemma":[0.00005355855,0.00007127171,0.00001299775,0.0002179059,0.00004594141,0.0001198412,0.000003796026,0.00006864575,0.00005291884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004881746,"about_ca_system_score_gemma":0.0000216061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001340232,"about_ca_topic_score_gemma":0.0003948389,"domain_scores_codex":[0.9994195,0.00001593723,0.0002438563,0.0001775404,0.00001682708,0.0001263816],"domain_scores_gemma":[0.9997129,0.00002860253,0.0001253294,0.00007385187,0.00001204176,0.00004723153],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009782856,0.0000219554,0.2003337,0.000007702012,0.00001523241,0.00001640523,0.009283357,0.00003723313,0.000008305635,0.790034,0.00008368773,0.0000605752],"study_design_scores_gemma":[0.0054798,0.0007507221,0.3273756,0.0001334722,0.00001047937,0.00004718647,0.02132468,0.0006771169,0.0008904143,0.6101723,0.0322739,0.0008643842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9698359,0.0003784084,0.0002323641,0.0002907155,0.0003431647,0.0001317329,0.00005635247,0.00001824154,0.02871311],"genre_scores_gemma":[0.9992615,0.000008486373,0.000174829,0.0000320783,0.00003535684,0.000005964261,0.000002731746,0.000007957461,0.0004711143],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1798617,"threshold_uncertainty_score":0.2906376,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01219450315128455,"gpt":0.2134554923158673,"spread":0.2012609891645827,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002437186,0.0002615687,0.0002177453,0.0002224151,0.0001892264,0.0003196055,0.0001873745,0.0000418113,0.001632562],"category_scores_gemma":[0.00002107428,0.0001895196,0.00004519667,0.0002685038,0.0001071555,0.001029737,0.0001820652,0.0001542147,0.0002816351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008382584,"about_ca_system_score_gemma":0.000009462684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003587931,"about_ca_topic_score_gemma":0.0003521147,"domain_scores_codex":[0.99861,0.000009230665,0.0001956004,0.0002950803,0.0002455502,0.0006445043],"domain_scores_gemma":[0.9994673,0.0000201114,0.0001646401,0.0002861721,0.00001684888,0.00004496484],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00139839,0.0009802831,0.6572657,0.002155727,0.0006927162,0.0002819366,0.00250832,0.0001624617,0.0005143323,0.284534,0.04049084,0.009015367],"study_design_scores_gemma":[0.001870727,0.00006568371,0.1460661,0.0001423957,0.0001981323,0.00004565921,0.003336111,0.00538309,0.0001585295,0.002101223,0.8395511,0.001081183],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7988595,0.0002597045,0.0003549698,0.003972783,0.0006760722,0.0005214492,0.000002900765,0.0003024095,0.1950502],"genre_scores_gemma":[0.9918512,0.00002062637,0.0002381068,0.002348371,0.0008149372,0.00002234625,0.00001852931,0.00005120108,0.004634753],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7990603,"threshold_uncertainty_score":0.9992801,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02853513358007114,"gpt":0.3022419602526386,"spread":0.2737068266725674,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003677642,0.0001407157,0.0001443059,0.00002441437,0.0008345141,0.0003640565,0.0001741319,0.00005695471,0.00000994563],"category_scores_gemma":[0.0004287585,0.0001046409,0.00003137324,0.00004239714,0.00007223884,0.0001993985,0.00008696331,0.0001253116,9.54232e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003920161,"about_ca_system_score_gemma":0.00001457287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000104827,"about_ca_topic_score_gemma":0.000263246,"domain_scores_codex":[0.999272,0.00001934307,0.0001837747,0.0001901771,0.00006806344,0.0002666005],"domain_scores_gemma":[0.9990652,0.0004480849,0.00009695086,0.0003017927,0.00002895916,0.00005907208],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007309068,0.0003201106,0.1176916,0.001264324,0.00204595,0.00003133347,0.02413178,0.2514345,0.1712798,0.07059151,0.0006074926,0.3598706],"study_design_scores_gemma":[0.001111958,0.00004270061,0.0227616,0.00002243701,0.00003192814,0.000007784348,0.00006282581,0.9701546,0.003636103,0.001495235,0.0005143069,0.0001584944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3245189,0.0002211025,0.6702934,0.001997265,0.0004047644,0.001180155,0.00004250516,0.0002771385,0.001064749],"genre_scores_gemma":[0.8252169,0.00004883645,0.174051,0.000026784,0.0001193374,0.00004685431,0.00000113409,0.0000395369,0.0004496362],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7187201,"threshold_uncertainty_score":0.6418492,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.2319907289797624,"gpt":0.3833863458772496,"spread":0.1513956168974872,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001294777,0.0001036272,0.0002489336,0.000400468,0.0001644007,0.00004101016,0.0007452642,0.00005515005,0.0006992692],"category_scores_gemma":[0.0006917178,0.00007207352,0.0001948382,0.001142544,0.0001144165,0.0001906285,0.0000364098,0.00005403841,0.00007539021],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003190369,"about_ca_system_score_gemma":0.0001914967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001815421,"about_ca_topic_score_gemma":0.002472094,"domain_scores_codex":[0.9982191,0.00006633685,0.0004778488,0.0003662932,0.000618345,0.0002520928],"domain_scores_gemma":[0.9979787,0.000688292,0.0002510577,0.0007677531,0.0002345291,0.00007966103],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001661089,0.003574425,0.01215215,0.00009306122,0.0003210845,0.00001461275,0.07562332,0.07264179,0.008978468,0.7813651,0.02775243,0.01582245],"study_design_scores_gemma":[0.0006542412,0.0003497327,0.002823628,0.00002456785,0.0001076739,0.000004760432,0.003816798,0.8596693,0.01426978,0.1163123,0.001666796,0.0003004782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1524403,0.00004152362,0.7974381,0.001727632,0.0002129563,0.0003300842,0.00006399111,0.00006867323,0.04767678],"genre_scores_gemma":[0.9756646,0.000001821135,0.0218255,0.0001866638,0.00004081256,0.000013584,0.000002282889,0.00001167002,0.002253094],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8232243,"threshold_uncertainty_score":0.7656507,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Health care; Operations management; Process management; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.06171319000001652,"gpt":0.4534959083493861,"spread":0.3917827183493696,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004255741,0.0001095477,0.0001671465,0.0000977617,0.001750806,0.00001695033,0.0000911445,0.0000843984,0.001903021],"category_scores_gemma":[0.00002896919,0.00008573927,0.00002929093,0.0002713157,0.00001350526,0.0002086194,0.00005206689,0.0002800019,0.001004113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004235208,"about_ca_system_score_gemma":0.0003712799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004927751,"about_ca_topic_score_gemma":0.002572463,"domain_scores_codex":[0.9983338,0.0002858005,0.000399393,0.0001647211,0.0001570187,0.0006592458],"domain_scores_gemma":[0.9992788,0.00003772553,0.0000540808,0.0003046165,0.00006041145,0.0002643579],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001461855,0.000479131,0.09192336,0.00159462,0.0001225778,0.00001138405,0.102033,0.004349065,0.00001845242,0.6765811,0.08208606,0.04065501],"study_design_scores_gemma":[0.00217786,0.0003946995,0.07939034,0.0004408495,0.00004340975,0.00001228432,0.05775253,0.003214064,0.00004183818,0.000112327,0.8557047,0.0007150911],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1475476,0.006241638,0.1672785,0.2598323,0.01361345,0.01097249,0.0002268925,0.001640191,0.3926469],"genre_scores_gemma":[0.93544,0.0004242755,0.04228145,0.00595986,0.0009072754,0.0002523609,0.0001661782,0.00003608917,0.0145325],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7878924,"threshold_uncertainty_score":0.9997737,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007366936327757205,"gpt":0.2519793368814436,"spread":0.2446124005536864,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003280779,0.000127424,0.0001362956,0.0001181393,0.0001866505,0.00004842935,0.0001737674,0.00003529728,0.00006364865],"category_scores_gemma":[0.000002471273,0.0001254076,0.00001245915,0.0007744157,0.00001115997,0.0001496599,0.00003817796,0.0002326215,0.000005291154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003438436,"about_ca_system_score_gemma":0.0000531633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004314561,"about_ca_topic_score_gemma":0.001114122,"domain_scores_codex":[0.9990113,0.0001056926,0.0002261254,0.0002037823,0.000192119,0.0002609564],"domain_scores_gemma":[0.9995779,0.00001542871,0.00006659153,0.000256489,0.00002419558,0.00005936979],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000366825,0.00003507798,0.03034464,0.0001448964,0.000005835552,0.000002999691,0.003541395,0.953599,0.000416736,0.0003865932,0.000002664771,0.01148344],"study_design_scores_gemma":[0.0004221431,0.0002885119,0.009741032,0.00004997355,0.000006511571,0.00003862263,0.00559199,0.982609,0.0004083583,0.0001381471,0.0004687205,0.0002369623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9453124,0.0002377192,0.0518478,0.0003346875,0.0000923176,0.001006892,0.00001145199,0.0006465222,0.000510165],"genre_scores_gemma":[0.9814069,0.00001199591,0.01778081,0.00005720282,0.00005260126,0.0005230383,0.00007247275,0.00005060187,0.00004435486],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03609448,"threshold_uncertainty_score":0.5113975,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02922192082668036,"gpt":0.2253394337205343,"spread":0.196117512893854,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001425969,0.00009113349,0.00008829934,0.00002817361,0.00006155552,0.00002412437,0.00006260024,0.00006467372,0.0008687306],"category_scores_gemma":[0.00005876146,0.00007907939,0.00003222392,0.0002059485,0.00002747924,0.0003985603,0.00001319543,0.00008118289,0.0001406587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001123452,"about_ca_system_score_gemma":0.00001407514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001157936,"about_ca_topic_score_gemma":0.00003624388,"domain_scores_codex":[0.999359,0.00001732679,0.0001649,0.00009682206,0.00008877798,0.0002731664],"domain_scores_gemma":[0.9996426,0.00002661864,0.00001869147,0.0002209773,0.00001879089,0.00007236424],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005307135,0.0002285499,0.04924119,0.0001087812,0.00004916778,8.537136e-7,0.0006294808,0.8823061,0.001685436,0.05503284,0.008966895,0.001697659],"study_design_scores_gemma":[0.0009942724,0.0001004365,0.3083288,0.00004110167,0.00007890357,0.00001793432,0.000279594,0.5811716,0.01678042,0.009831775,0.081467,0.0009081342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3098172,0.0001779342,0.670916,0.001931848,0.002166417,0.0004658937,0.00001579382,0.00101664,0.01349233],"genre_scores_gemma":[0.9940688,0.00008610343,0.00477698,0.0000864938,0.0002195051,0.00002256445,0.00002887829,0.00002149545,0.0006891674],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6842516,"threshold_uncertainty_score":0.9511991,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01980426830246395,"gpt":0.2147099716133769,"spread":0.1949057033109129,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001988073,0.0002425067,0.0002659673,0.0001966091,0.0003314071,0.0002359476,0.0001991836,0.00006608105,0.003475003],"category_scores_gemma":[0.00002372543,0.0001966374,0.0000687681,0.000186118,0.00007806297,0.0006284269,0.0002241585,0.0002291543,0.0002919958],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002517708,"about_ca_system_score_gemma":0.00002309897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004785083,"about_ca_topic_score_gemma":0.0004770126,"domain_scores_codex":[0.9987063,0.00001265131,0.0002179893,0.0003806402,0.0002843777,0.0003980551],"domain_scores_gemma":[0.9994619,0.00004503467,0.0001211583,0.0003092173,0.00003100257,0.00003164728],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0004645558,0.0001713757,0.9659484,0.0002923415,0.0001014678,0.0008289319,0.0006889992,0.000004955107,0.0013786,0.001510038,0.01908556,0.009524742],"study_design_scores_gemma":[0.001715452,0.00002366429,0.6851671,0.00005643325,0.0001414808,0.0001953839,0.0001509653,0.0002096029,0.0007131528,0.0007003719,0.3103142,0.000612211],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9112794,0.0002685321,0.0002106316,0.0027234,0.0004057394,0.0002940774,0.000003588891,0.0002408882,0.08457368],"genre_scores_gemma":[0.9898857,0.00008822399,0.0001677746,0.0009505299,0.0004805236,0.00001115247,0.000009995845,0.00004193422,0.00836416],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2912286,"threshold_uncertainty_score":0.9974359,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05480379686306359,"gpt":0.2802640547166015,"spread":0.2254602578535379,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006867409,0.000106357,0.0001768989,0.0001354908,0.0006436314,0.0001190409,0.0001668651,0.00005066579,0.003063614],"category_scores_gemma":[0.00008877418,0.0001150698,0.0001017956,0.0001599013,0.0000423152,0.0002083615,0.0001478333,0.0002408166,0.00002083161],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002438993,"about_ca_system_score_gemma":0.0000310965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001655218,"about_ca_topic_score_gemma":0.00002940651,"domain_scores_codex":[0.998998,0.00001261237,0.0003672636,0.000319023,0.00005139227,0.0002517088],"domain_scores_gemma":[0.999575,0.00003065637,0.0002161494,0.0001339536,0.00001068697,0.00003352179],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002289253,0.00007346549,0.3279054,0.00002646984,0.00002129466,0.000002271584,0.00005565158,0.00009463627,0.00005229478,0.6696035,0.001607774,0.0003283789],"study_design_scores_gemma":[0.0003914568,0.0008927431,0.2006852,0.000002720365,0.000002490211,0.00001443662,0.00002244442,0.003127035,0.0003000348,0.2242158,0.5701494,0.0001962684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3515778,0.003331721,0.01348338,0.00382698,0.006444903,0.00238125,0.005542228,0.001286684,0.612125],"genre_scores_gemma":[0.9849431,0.0001460314,0.0008357926,0.0002106699,0.0003649173,0.0002675572,0.0001391967,0.00002650895,0.01306621],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6333653,"threshold_uncertainty_score":0.9978477,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008316954873898075,"gpt":0.2042421732937018,"spread":0.1959252184198037,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002126945,0.0001501017,0.0001284634,0.0002604565,0.0001807429,0.0002766463,0.0001314441,0.00003566894,0.00006242016],"category_scores_gemma":[0.00001062819,0.0001351315,0.00004690496,0.0002014329,0.00002284986,0.001176096,0.0001378653,0.00005003408,0.00005506291],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006891424,"about_ca_system_score_gemma":0.00000526428,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001590605,"about_ca_topic_score_gemma":0.0003462556,"domain_scores_codex":[0.9991252,0.000002528394,0.0002481846,0.000180254,0.0001614982,0.0002823021],"domain_scores_gemma":[0.9996387,0.00001059962,0.0001410548,0.0001785221,0.00002257816,0.000008592927],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000475821,0.0002351404,0.00465221,0.004010425,0.0001572638,0.000024935,0.0002380629,0.01529114,0.0001053215,0.5629407,0.3559072,0.05596181],"study_design_scores_gemma":[0.0008103561,0.00001078151,0.002539736,0.00005294713,0.00005967434,0.000001051992,0.0001458549,0.7114749,0.00001087038,0.02178012,0.2628881,0.0002256169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.174339,0.0003477742,0.4894629,0.0135508,0.002053295,0.005845231,0.00008798599,0.0008918748,0.3134211],"genre_scores_gemma":[0.9760866,0.00003455616,0.00242473,0.002161374,0.0004017881,0.0001225725,0.000168475,0.00002916029,0.01857075],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8017476,"threshold_uncertainty_score":0.5510501,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01910561187786955,"gpt":0.2239053565012522,"spread":0.2047997446233827,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001393555,0.00007685936,0.0000626539,0.0000274087,0.0001168281,0.00002243093,0.00008916003,0.000030826,0.00005659754],"category_scores_gemma":[0.00001050358,0.00003413693,0.00003884468,0.0001067029,0.00002464322,0.00006148904,0.00000208936,0.00005353246,0.00001732042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004248926,"about_ca_system_score_gemma":0.00001168121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002774163,"about_ca_topic_score_gemma":0.00006053763,"domain_scores_codex":[0.9995508,0.000007624511,0.0001460918,0.0000868175,0.00008551688,0.0001231348],"domain_scores_gemma":[0.9996191,0.0001308455,0.00002577541,0.0001837599,0.0000266758,0.0000138005],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002489315,0.0001317112,0.00007051513,0.00008742815,0.0001639384,0.000001172548,0.002109436,0.09837033,0.07071383,0.7881778,0.02441429,0.01551062],"study_design_scores_gemma":[0.001332591,0.0001602432,0.001564347,0.0001135909,0.00007215539,0.000006376439,0.0001743723,0.9090178,0.04480056,0.02300582,0.01942966,0.0003224605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05075636,0.0000184452,0.9262235,0.01883085,0.000250065,0.001277504,0.0001465864,0.0003418803,0.002154778],"genre_scores_gemma":[0.9973421,0.00001507148,0.001507566,0.0002109976,0.00008374512,0.0003310158,0.00002192652,0.00001763476,0.0004700013],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9465857,"threshold_uncertainty_score":0.1392064,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01370071992715987,"gpt":0.2190604007520816,"spread":0.2053596808249218,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002734236,0.0001545957,0.0001357726,0.0001738985,0.0002301675,0.0002709032,0.000181722,0.00004143432,0.001113281],"category_scores_gemma":[0.000109682,0.0001252188,0.00004621377,0.0004336809,0.00001856183,0.0007559521,0.0001642603,0.00007604555,0.0009288345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001359094,"about_ca_system_score_gemma":0.00005752607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001520626,"about_ca_topic_score_gemma":0.0002453479,"domain_scores_codex":[0.9987441,0.000002995503,0.0002757087,0.0003341449,0.0003298029,0.0003132517],"domain_scores_gemma":[0.9995555,0.000008697434,0.0001315819,0.0002483735,0.00004139108,0.0000144688],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.004143555,0.001989191,0.08353534,0.0004839141,0.0003032542,0.000614999,0.001512231,0.003472481,0.01340752,0.7161986,0.07911292,0.09522601],"study_design_scores_gemma":[0.009810989,0.0001633208,0.07023414,0.0006101536,0.0001948344,0.00003513454,0.000749209,0.001701514,0.02634561,0.1605448,0.727577,0.002033328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9617153,0.0001619303,0.00545986,0.01335088,0.002014666,0.0006433696,0.000001035267,0.0004763083,0.01617666],"genre_scores_gemma":[0.9947247,0.00002930144,0.00152217,0.001779121,0.001355214,0.00002230266,0.00002984261,0.00002530465,0.0005120697],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.648464,"threshold_uncertainty_score":0.9998491,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.09501258977061526,"gpt":0.3844359962684172,"spread":0.2894234064978019,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002968546,0.0003879135,0.0006741852,0.000571108,0.000514425,0.001223558,0.001449413,0.0002110128,0.003316857],"category_scores_gemma":[0.008116497,0.0002621938,0.000261444,0.00216596,0.0003258033,0.0003980841,0.0003470621,0.000613626,0.0004437474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001258389,"about_ca_system_score_gemma":0.0004958371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007599794,"about_ca_topic_score_gemma":0.0001656008,"domain_scores_codex":[0.994534,0.0002632966,0.001073455,0.001198587,0.002106114,0.0008245948],"domain_scores_gemma":[0.9945652,0.003037445,0.0004169069,0.001454935,0.0002098259,0.0003156544],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.01058431,0.0159127,0.08393056,0.0007014616,0.0005415399,0.002751458,0.03139732,0.001271549,0.1255942,0.111873,0.05172166,0.5637202],"study_design_scores_gemma":[0.005128827,0.001005483,0.01518313,0.0003133727,0.00009624264,0.0004811219,0.004288921,0.7015609,0.006309133,0.1560172,0.1074514,0.002164383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4699171,0.00004498339,0.5050877,0.0015487,0.001026595,0.001531365,0.00002448911,0.0003389946,0.02048008],"genre_scores_gemma":[0.7888728,5.2407e-7,0.2061774,0.000116051,0.0001875978,0.0001527467,0.000002826604,0.0000506601,0.00443935],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7002893,"threshold_uncertainty_score":0.999983,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04128172389244446,"gpt":0.2532613614766722,"spread":0.2119796375842278,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002035851,0.0001425834,0.0002641701,0.00008749306,0.0005918882,0.0002615426,0.0001439966,0.0000582752,0.0002657784],"category_scores_gemma":[0.0002104536,0.0001263367,0.00002620231,0.00007398718,0.0002432224,0.0003233032,0.0001207911,0.0001121247,0.0002081366],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002669468,"about_ca_system_score_gemma":0.0000332475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001759793,"about_ca_topic_score_gemma":0.0001121855,"domain_scores_codex":[0.9990218,0.000002187092,0.0002719018,0.0004356962,0.00003112183,0.000237331],"domain_scores_gemma":[0.9990274,0.00009293013,0.0002823031,0.0004661901,0.00001918524,0.0001120219],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0005425619,0.0002251514,0.03871107,0.00006607735,0.0001199463,0.00001752139,0.00025449,0.00007300862,0.0001597942,0.9521696,0.0005696872,0.007091073],"study_design_scores_gemma":[0.001577265,0.0002877622,0.6004895,0.00009907952,0.00006395255,0.000106669,0.00004180956,0.02727843,0.00003022206,0.3653636,0.004046101,0.0006155687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2791001,0.0007600592,0.7111634,0.001642707,0.0001603087,0.0003988794,0.0003111908,0.000051897,0.006411443],"genre_scores_gemma":[0.9980988,0.00008665065,0.0006430376,0.00004895441,0.00008127937,0.00005494491,0.00001271967,0.00001769512,0.0009559325],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7189987,"threshold_uncertainty_score":0.5151862,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04089472222849712,"gpt":0.3383161528936501,"spread":0.297421430665153,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003433521,0.00005062548,0.00006544156,0.000153485,0.0001424011,0.00004630676,0.0001378007,0.00004032086,0.00005912806],"category_scores_gemma":[0.00005784752,0.00004756498,0.00001047954,0.001178959,0.00002948732,0.0001603092,0.000003271211,0.00005591444,0.00006927655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007408582,"about_ca_system_score_gemma":0.00009022782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004826705,"about_ca_topic_score_gemma":0.01513285,"domain_scores_codex":[0.9992535,0.0000751002,0.0001042492,0.0001762435,0.0002020233,0.0001889241],"domain_scores_gemma":[0.9997463,0.00003277366,0.00003011196,0.00008474921,0.0000309369,0.00007512293],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.00006347678,0.00007770027,0.01138018,0.000007226255,0.000004640313,0.000007448275,0.06071284,0.8859165,0.00001885979,0.03950813,0.0008126166,0.001490352],"study_design_scores_gemma":[0.001552136,0.000339648,0.6857734,0.0001368975,0.00002151679,0.000001075746,0.07388565,0.2007715,0.0004364466,0.007825836,0.02838121,0.0008746452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8676671,0.00001558083,0.02470166,0.005987651,0.0007515989,0.0009736935,0.00003764962,0.0007840588,0.099081],"genre_scores_gemma":[0.9973437,0.00001695426,0.0005538348,0.0001000923,0.0001198898,0.00002920089,0.0001057858,0.000006980442,0.001723535],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.685145,"threshold_uncertainty_score":0.8444484,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01668755978827202,"gpt":0.2456207355458993,"spread":0.2289331757576273,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003304536,0.0001654171,0.0001548057,0.00005903804,0.0001952898,0.0002058828,0.0001000164,0.00006533714,0.0001825215],"category_scores_gemma":[0.00002174286,0.0001067386,0.00004000221,0.0003107485,0.00002529366,0.0001646606,0.00002235065,0.0001529989,0.00003486565],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007954465,"about_ca_system_score_gemma":0.00007132515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002159606,"about_ca_topic_score_gemma":0.00004973663,"domain_scores_codex":[0.9991661,0.00002242076,0.0001880048,0.0002110807,0.0001143,0.0002980882],"domain_scores_gemma":[0.9992628,0.000452852,0.00002392681,0.0001681544,0.00001677816,0.00007552665],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002300111,0.000003782755,0.000052415,0.00004574043,0.00009322789,0.000001740229,0.0003721555,0.9904249,0.0008832471,0.003019034,0.0008784798,0.004202295],"study_design_scores_gemma":[0.0004337868,0.00005958665,0.0006741715,0.00007943565,0.00008131513,0.00002755073,0.00004557084,0.9957644,0.0005464806,0.001239882,0.0008706846,0.0001771172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004103883,0.0002715649,0.9909965,0.001845504,0.00006918763,0.0006079614,0.00001447895,0.0004411706,0.001649709],"genre_scores_gemma":[0.5934035,0.00004196738,0.389721,0.0001171253,0.0005351715,0.00007673597,0.00003440665,0.0002207233,0.0158494],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6012756,"threshold_uncertainty_score":0.4352673,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03858298356223652,"gpt":0.2713153454680901,"spread":0.2327323619058535,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002689081,0.0001987294,0.00017403,0.0002586792,0.0003868576,0.0004360554,0.0002450617,0.00003960239,0.002871363],"category_scores_gemma":[0.00009190272,0.0001704187,0.00007454591,0.0001699989,0.00005577598,0.0006800514,0.0001789488,0.00005761976,0.000692056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007988593,"about_ca_system_score_gemma":0.0000339997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006138062,"about_ca_topic_score_gemma":0.001396359,"domain_scores_codex":[0.9986579,0.000006820275,0.000263687,0.0003624021,0.0002392513,0.0004699648],"domain_scores_gemma":[0.9994144,0.00002326344,0.0001650534,0.0002911463,0.0000819218,0.000024188],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0009026515,0.000396053,0.0206669,0.0007515159,0.0003684492,0.00004877383,0.003366924,0.0003714597,0.0003588288,0.1267097,0.8063753,0.03968355],"study_design_scores_gemma":[0.001601871,0.00007027546,0.002767766,0.0000602243,0.00005417989,0.000001696003,0.0003898367,0.02378305,0.002213382,0.02960854,0.9390301,0.0004191521],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2817051,0.0003025883,0.2658055,0.09971612,0.009029189,0.008180585,0.0001678011,0.001821771,0.3332713],"genre_scores_gemma":[0.9525684,0.00001055437,0.0006936917,0.009499572,0.005156419,0.00009429965,0.0000378887,0.00005095844,0.03188823],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6708633,"threshold_uncertainty_score":0.9980401,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.04793887437472275,"gpt":0.2571650337813429,"spread":0.2092261594066202,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001101508,0.00008067358,0.000146006,0.0001569775,0.0000373773,0.0000670454,0.00006559912,0.00004565671,0.0001661583],"category_scores_gemma":[0.000009559183,0.00008145098,0.00002249676,0.0001911861,0.00003580438,0.0001189976,0.00003907438,0.00009198664,0.0001881278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000691347,"about_ca_system_score_gemma":0.00002243575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001827669,"about_ca_topic_score_gemma":0.0001163297,"domain_scores_codex":[0.9992889,0.000001084392,0.0002332649,0.0002860544,0.00001824362,0.0001724441],"domain_scores_gemma":[0.999799,0.00001880228,0.00003148741,0.0001058861,0.000003219165,0.00004163782],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001044092,0.00002349536,0.0004122882,0.00003042208,0.000005854728,0.000006211526,0.0001448161,0.0003195096,0.00001648938,0.9981794,0.0001049951,0.0007460288],"study_design_scores_gemma":[0.0002564511,0.00006243372,0.00618336,0.00002504195,0.000003260711,0.00001419192,0.000009803,0.1853856,0.00004765108,0.7957321,0.01211592,0.0001642154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.424516,0.01174722,0.5440101,0.003444216,0.0003052453,0.0004007878,0.000142247,0.00009271966,0.01534143],"genre_scores_gemma":[0.9921672,0.000605805,0.005373148,0.0001850989,0.0001492812,0.0001014545,0.00001136353,0.0000168613,0.00138983],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5676512,"threshold_uncertainty_score":0.3321475,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.019054642963723,"gpt":0.2458075405766056,"spread":0.2267528976128826,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001076678,0.00009870993,0.00008816129,0.000008780021,0.000222814,0.00003998497,0.0001059523,0.00003531949,0.001725101],"category_scores_gemma":[0.00006012755,0.00008521616,0.00003013559,0.0001562621,0.00009946062,0.0001394853,0.0001302322,0.00009235863,0.0002824318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004147363,"about_ca_system_score_gemma":0.00002276646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003415258,"about_ca_topic_score_gemma":0.0002733023,"domain_scores_codex":[0.9991555,0.00001436586,0.0001383715,0.0002302422,0.0001516964,0.0003098075],"domain_scores_gemma":[0.9996758,0.00001941369,0.00005007963,0.0001676437,0.000002868557,0.00008426251],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.0006559402,0.003484531,0.2929502,0.0001658952,0.000232832,0.0004334694,0.003602348,0.220226,0.3655039,0.06832033,0.01746543,0.02695918],"study_design_scores_gemma":[0.008257461,0.0006621035,0.5263798,0.0001882551,0.0002114581,0.0002849799,0.0002880372,0.05286231,0.08125602,0.1943859,0.1321681,0.003055519],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7976232,0.00001039487,0.1943865,0.0006997286,0.0001990202,0.0002479537,0.0001883456,0.00006713359,0.006577731],"genre_scores_gemma":[0.9853793,0.000003109326,0.01420825,0.00007277042,0.0000264171,0.000005301336,0.00002319495,0.000008847052,0.0002728442],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2842479,"threshold_uncertainty_score":0.9991875,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01579009083569939,"gpt":0.2149514411234915,"spread":0.1991613502877921,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002665052,0.0001003722,0.0001143629,0.0001650737,0.0005243405,0.000109043,0.0001545832,0.00001808978,0.001607551],"category_scores_gemma":[0.00005123846,0.00009970521,0.00003086708,0.0004330919,0.00002843338,0.0004065153,0.0002495794,0.0001199384,0.00002337984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006734014,"about_ca_system_score_gemma":0.000009560924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000134677,"about_ca_topic_score_gemma":0.00006468347,"domain_scores_codex":[0.9992644,0.00001677896,0.0001429024,0.0002386988,0.0001732329,0.0001639409],"domain_scores_gemma":[0.9996442,0.00001680431,0.0001035855,0.000206283,0.00002064899,0.000008546754],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004217933,0.00002472967,0.0001043353,0.00001528407,0.00001592621,0.000005806562,0.00004226256,0.9635364,0.00001673635,0.03546716,0.0002623916,0.0004668048],"study_design_scores_gemma":[0.0001880397,0.00001162842,0.000007125754,0.000004768339,0.0000499966,0.000008962244,0.0002932864,0.9682871,0.000008121997,0.01155417,0.01944042,0.0001463598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.286672,0.0002977559,0.6561515,0.01344274,0.000411637,0.0005354757,0.000007163431,0.0008059393,0.04167585],"genre_scores_gemma":[0.9956117,0.000006894757,0.001835056,0.001086356,0.0004025017,0.00002405996,0.00003217101,0.0000264129,0.0009747916],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7089398,"threshold_uncertainty_score":0.9993051,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1494501368497304,"gpt":0.4578281526203708,"spread":0.3083780157706404,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.009620177,0.0001454453,0.0002400701,0.0002135357,0.001811889,0.001432156,0.0006462847,0.00005665696,0.00004801423],"category_scores_gemma":[0.003663131,0.00006730066,0.00010526,0.001965941,0.0004924375,0.0002715111,0.0003180995,0.00020481,0.00001018077],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008336514,"about_ca_system_score_gemma":0.0001238194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002916951,"about_ca_topic_score_gemma":0.0007403064,"domain_scores_codex":[0.9969813,0.0007547504,0.0004693434,0.0005774898,0.000892771,0.0003243192],"domain_scores_gemma":[0.996394,0.002243081,0.0002957208,0.0008596006,0.000172798,0.00003474636],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00164904,0.0004486411,0.5131446,0.00006337083,0.000526743,0.00006270535,0.009948176,0.009051247,0.01250273,0.09924694,0.001987395,0.3513684],"study_design_scores_gemma":[0.001795192,0.0001627188,0.369299,0.0001581011,0.0004423029,0.0001815003,0.003139437,0.3780161,0.0305531,0.132818,0.08256926,0.000865431],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.876224,0.0005376736,0.09637158,0.02325082,0.001499106,0.0005488161,0.000006133384,0.00004579745,0.001516087],"genre_scores_gemma":[0.996612,0.00001245442,0.0008693858,0.0002623552,0.000235201,0.00001258815,4.580087e-7,0.000007083669,0.001988544],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3689648,"threshold_uncertainty_score":0.9996045,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}