{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":112,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":112,"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":"00ca961d5c73","filters":{"venue":"Naval Research Logistics (NRL)"}},"results":[{"id":"W2029369144","doi":"10.1002/nav.20308","title":"DEA models for two‐stage processes: Game approach and efficiency decomposition","year":2008,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":526,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Data envelopment analysis; Decomposition; Set (abstract data type); Process (computing); Measure (data warehouse); Computer science; Mathematical optimization; Stage (stratigraphy); Efficiency; Decomposition method (queueing theory); Mathematics; Statistics; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.4504223733606303,"gpt":0.5233901437995412,"spread":0.0729677704389109,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.01274437,0.0002737546,0.0005387799,0.001086769,0.001299497,0.0005899072,0.001533807,0.0001894229,0.00003352047],"category_scores_gemma":[0.03078735,0.0002121956,0.0001480016,0.003431226,0.00171336,0.0004519637,0.0004429469,0.0006054866,0.00009666368],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001781563,"about_ca_system_score_gemma":0.0009067825,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001747352,"about_ca_topic_score_gemma":0.00006371247,"domain_scores_codex":[0.9913809,0.0006411375,0.0009189987,0.001344514,0.004605154,0.001109331],"domain_scores_gemma":[0.9864591,0.008042063,0.000237031,0.0009807626,0.003901232,0.0003797832],"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.001015377,0.003021899,0.003368797,0.0005377186,0.000116985,0.0002252689,0.006436738,0.7997229,0.005650291,0.1534213,0.0103258,0.01615699],"study_design_scores_gemma":[0.0007961986,0.0003943799,0.0002238271,0.00002572261,0.00002171038,0.00004467876,0.0005023944,0.9185651,0.000844798,0.07631882,0.001967146,0.0002952332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1131896,0.0007560428,0.8715434,0.0002568872,0.00009049116,0.0008148916,0.00009168217,0.00007335572,0.01318361],"genre_scores_gemma":[0.9779269,0.0001247662,0.01891794,0.00007409156,0.0001481023,0.00009723988,0.00003095567,0.00003112343,0.002648939],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8647372,"threshold_uncertainty_score":0.9994812,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046280257","doi":"10.1002/nav.20261","title":"What you should know about the vehicle routing problem","year":2007,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":324,"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":"","keywords":"Vehicle routing problem; Heuristics; Metaheuristic; Computer science; Set (abstract data type); Operations research; Mathematical optimization; Routing (electronic design automation); Mathematics; Algorithm; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.1509400784947585,"gpt":0.4200791947934686,"spread":0.26913911629871,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01430049,0.0002571266,0.0002589873,0.0002494139,0.0005913327,0.0006333965,0.0008330612,0.0002909801,0.00008531537],"category_scores_gemma":[0.004324782,0.0002079382,0.00009169793,0.001248796,0.0004091556,0.0003098428,0.000315441,0.001830959,0.0002088022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000394202,"about_ca_system_score_gemma":0.0001183085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008059432,"about_ca_topic_score_gemma":0.00007257233,"domain_scores_codex":[0.9957039,0.00044545,0.0005861902,0.0004085063,0.001400484,0.001455467],"domain_scores_gemma":[0.9955072,0.002751015,0.00006227359,0.0007348369,0.0006627813,0.000281855],"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.0001020417,0.0001404766,0.003928984,0.0003043136,0.0001400923,0.0001493855,0.002929871,0.5787121,0.0121654,0.03591925,0.007047293,0.3584608],"study_design_scores_gemma":[0.00078398,0.000171486,0.003898328,0.000375621,0.00003119236,0.0000241601,0.002227345,0.9255081,0.01330748,0.005287958,0.04774976,0.0006346184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02302049,0.004814268,0.9003319,0.001808621,0.001851382,0.001427105,0.00002215483,0.001289502,0.06543458],"genre_scores_gemma":[0.9477387,0.001292119,0.04750071,0.0001156921,0.0007446971,0.00003608082,0.00001611662,0.0001386846,0.002417191],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9247182,"threshold_uncertainty_score":0.8479473,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2129060502","doi":"10.1002/nav.20267","title":"Ambulance location for maximum survival","year":2007,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":238,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":true},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Survival function; Outcome (game theory); Service (business); Function (biology); Monotonic function; Survival analysis; Emergency medical services; Computer science; Overall survival; Location model; Operations research; Medical emergency; Medicine; Engineering; Business; Mathematics; Internal medicine","retraction":null,"screen_n_in":null,"score":{"opus":0.2365299062568,"gpt":0.4100960435231902,"spread":0.1735661372663902,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.008089085,0.0001585891,0.0001720772,0.0004307023,0.0004346653,0.0002471963,0.000487864,0.00009919602,0.0002252164],"category_scores_gemma":[0.004939898,0.0001567765,0.00006621053,0.001080986,0.0002053567,0.0003402435,0.0002459837,0.0002704199,0.00123962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001459581,"about_ca_system_score_gemma":0.00006135118,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001794054,"about_ca_topic_score_gemma":0.002353364,"domain_scores_codex":[0.9973177,0.00003072345,0.0004024962,0.0004250788,0.001015937,0.0008080193],"domain_scores_gemma":[0.9974144,0.000298605,0.00005797438,0.0004449798,0.001742849,0.00004115582],"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.0005455756,0.0004448145,0.005422623,0.001366809,0.00005821312,0.00001825584,0.0000647389,0.003428463,0.0006469744,0.8417351,0.07366044,0.07260796],"study_design_scores_gemma":[0.0009977345,0.00006746264,0.02582214,0.00004660832,0.00002945902,3.769135e-7,0.0007276486,0.05666701,0.0001963274,0.06386132,0.8511497,0.000434183],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01426349,0.0001946751,0.8544679,0.004065462,0.002240673,0.001623794,0.00001722554,0.0002714375,0.1228554],"genre_scores_gemma":[0.9930376,0.00003143973,0.0009507161,0.0004793892,0.001496062,0.00006447938,0.000143548,0.00002769189,0.003769012],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9787742,"threshold_uncertainty_score":0.999538,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058588258","doi":"10.1002/nav.20285","title":"On the application and extension of system signatures in engineering reliability","year":2008,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Statistical Distribution Estimation and Applications","field":"Mathematics","cited_by":229,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Signature (topology); Reliability (semiconductor); Component (thermodynamics); Independent and identically distributed random variables; Representation (politics); Extension (predicate logic); Stochastic ordering; Computer science; Random variable; Algorithm; Mathematics; Applied mathematics; Statistical physics; Statistics; Physics; Thermodynamics","retraction":null,"screen_n_in":null,"score":{"opus":0.1953360161124612,"gpt":0.426894687470171,"spread":0.2315586713577098,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.001502228,0.00008230012,0.0001517729,0.00009173337,0.0001569049,0.00001179791,0.0001531019,0.00008725884,0.00001892271],"category_scores_gemma":[0.01369939,0.00005888733,0.0000227277,0.0003891591,0.0003092337,0.00002005347,0.00006190818,0.0003923576,0.00001560124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001237275,"about_ca_system_score_gemma":0.00005199655,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004878952,"about_ca_topic_score_gemma":0.000004335119,"domain_scores_codex":[0.9986059,0.000143435,0.0003031091,0.0002187131,0.0005301062,0.0001987397],"domain_scores_gemma":[0.9929304,0.006171747,0.00005837929,0.0003892388,0.0003811958,0.0000689967],"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.00002090154,0.00009599111,0.00006406727,0.0001732269,0.000002326635,0.000002720389,0.00004867397,0.000862446,0.001024473,0.9964161,0.001087597,0.000201484],"study_design_scores_gemma":[0.0004458536,0.0001401739,0.02687654,0.0002432623,0.00001073597,0.000009025999,0.0002246766,0.5810656,0.002380259,0.388011,0.0004171274,0.000175712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1570201,0.00005332416,0.8380352,0.0005740111,0.00002719941,0.0009626218,0.000138733,0.00007289046,0.003115873],"genre_scores_gemma":[0.9961085,0.00001883847,0.00366919,0.00001157481,0.00001669912,0.0001130804,0.00001351247,0.000008873839,0.00003978047],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8390883,"threshold_uncertainty_score":0.9946086,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2047449665","doi":"10.1002/nav.20121","title":"A branch‐and‐cut algorithm for the quay crane scheduling problem in a container terminal","year":2005,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":220,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"Canada Research Chairs","keywords":"Idle; Scheduling (production processes); Computer science; Exploit; Job shop scheduling; Mathematical optimization; Container (type theory); Algorithm; Operations research; Routing (electronic design automation); Mathematics; Engineering; Computer network; Mechanical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.06578689733596091,"gpt":0.3504564598251912,"spread":0.2846695624892304,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002339933,0.0002060725,0.000275814,0.000190369,0.0002205882,0.0001699006,0.0003206863,0.0001702746,0.00007924662],"category_scores_gemma":[0.001127414,0.000155756,0.00005904224,0.0002577735,0.0003582445,0.00007762523,0.000120698,0.000881971,0.00002268966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001586846,"about_ca_system_score_gemma":0.0001096768,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003387738,"about_ca_topic_score_gemma":0.0006050514,"domain_scores_codex":[0.9978319,0.00007177453,0.0004101519,0.0002996938,0.0005178499,0.0008686626],"domain_scores_gemma":[0.9975808,0.001659718,0.00002983706,0.0003045447,0.0002597296,0.0001654186],"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.0001060464,0.000166402,0.0006430139,0.0004811413,0.00008516311,0.0001625185,0.0005976421,0.05321056,0.0004363843,0.01695271,0.003643883,0.9235145],"study_design_scores_gemma":[0.0009867597,0.0001596623,0.0006664317,0.00008240802,0.00002021287,0.00003814793,0.0001287187,0.9341826,0.0002002636,0.004809661,0.05847387,0.0002512421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004010217,0.003803972,0.9761238,0.001790984,0.0002833891,0.001953474,0.0001814508,0.0002100372,0.01164266],"genre_scores_gemma":[0.9498138,0.0006196823,0.04716796,0.00007705312,0.0007293099,0.0002545236,0.00002338346,0.00005735453,0.001256967],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9458035,"threshold_uncertainty_score":0.6351544,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3125747142","doi":"10.1002/nav.20127","title":"Optimal pricing and inventory control policy in periodic‐review systems with fixed ordering cost and lost sales","year":2005,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":184,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de Recherche du Québec-Société et Culture","keywords":"Profit (economics); Economic shortage; Time horizon; Economics; Holding cost; Inventory control; Fixed cost; Lost sales; Microeconomics; Operations research; Operations management; Mathematics; Finance","retraction":null,"screen_n_in":null,"score":{"opus":0.07293796050798713,"gpt":0.3303829225323653,"spread":0.2574449620243782,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002147745,0.0002400792,0.0003998719,0.0006741696,0.000267723,0.0005707873,0.0002654451,0.00007517462,0.000053663],"category_scores_gemma":[0.001231968,0.0002021694,0.00002896816,0.0006883531,0.0004499021,0.0004912645,0.0003821674,0.0004342953,0.0001024345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002308895,"about_ca_system_score_gemma":0.00009883294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001829233,"about_ca_topic_score_gemma":0.0005829795,"domain_scores_codex":[0.9976018,0.00009563348,0.0003894842,0.0004469157,0.0007255016,0.0007406425],"domain_scores_gemma":[0.9990906,0.0001939224,0.0001208624,0.0002715872,0.0002501447,0.00007293171],"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.001661823,0.001349415,0.4942353,0.05345311,0.0005727536,0.001098749,0.001189125,0.0283318,0.001060372,0.2746258,0.06366863,0.07875317],"study_design_scores_gemma":[0.005874231,0.0002514404,0.02107433,0.005551646,0.0001301709,0.00002896072,0.002385585,0.2474722,0.00001138153,0.0002406255,0.7159776,0.001001859],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7314436,0.1188376,0.00942923,0.02580098,0.0007496085,0.0145277,0.0000655951,0.000501585,0.09864407],"genre_scores_gemma":[0.9934208,0.003502087,0.0001574889,0.001186874,0.0009229615,0.0001150744,0.00002115071,0.00003915961,0.000634431],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.652309,"threshold_uncertainty_score":0.8244231,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1963737229","doi":"10.1002/nav.20327","title":"Natural gas storage valuation and optimization: A real options application","year":2009,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Capital Investment and Risk Analysis","field":"Economics, Econometrics and Finance","cited_by":160,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University; Queen's University","funders":"","keywords":"Straddle; Valuation (finance); Natural gas storage; Natural gas; Computer science; Variable (mathematics); Operations research; Mathematical optimization; Mathematics; Economics; Finance; Engineering; Waste management","retraction":null,"screen_n_in":null,"score":{"opus":0.1242354701882944,"gpt":0.3526307477985806,"spread":0.2283952776102862,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001231903,0.0001136406,0.0002152142,0.0004220498,0.0003244637,0.0002201409,0.0001760582,0.0001117827,0.0001207698],"category_scores_gemma":[0.0005248219,0.0001200402,0.00006590821,0.0006144803,0.0001800155,0.0002239105,0.00005687742,0.0003108666,0.0002588336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002056776,"about_ca_system_score_gemma":0.00003552028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005957356,"about_ca_topic_score_gemma":0.00004811892,"domain_scores_codex":[0.9986672,0.00005525606,0.0003777147,0.0004005993,0.0001743559,0.0003248522],"domain_scores_gemma":[0.9990535,0.0001308694,0.0001267983,0.0003012259,0.0002585409,0.0001290272],"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.00001735725,0.0001021511,0.0006379646,0.000009046212,0.00002435819,0.000002522958,0.0001730096,0.01319966,0.0001241642,0.9823291,0.001149072,0.002231642],"study_design_scores_gemma":[0.0002731238,0.0001326083,0.01122983,0.000004979669,0.00001063013,0.000001834222,0.0000762737,0.6272408,0.00001814441,0.3599978,0.0008661324,0.000147823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.213131,0.08367068,0.5831833,0.02165055,0.0009120938,0.004386219,0.0004839804,0.0004863318,0.09209584],"genre_scores_gemma":[0.9788623,0.01231152,0.006763159,0.00008383195,0.0001931047,0.00004698732,0.0002160547,0.00001244904,0.001510628],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7657313,"threshold_uncertainty_score":0.4895096,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167666647","doi":"10.1002/nav.20038","title":"Exact likelihood inference for the exponential distribution under generalized Type‐I and Type‐II hybrid censoring","year":2004,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Statistical Distribution Estimation and Applications","field":"Mathematics","cited_by":150,"is_retracted":false,"has_abstract":true,"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; McMaster University","keywords":"Censoring (clinical trials); Mathematics; Exponential distribution; Estimator; Statistics; Applied mathematics; Confidence interval; Exponential function; Exponential family; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.2947497052201789,"gpt":0.489670309686943,"spread":0.1949206044667641,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0009923015,0.0001521828,0.0001822254,0.00004916857,0.001017669,0.0001464843,0.00025215,0.00008829823,0.0001529002],"category_scores_gemma":[0.01463133,0.0001167056,0.00004317982,0.0004141477,0.0004425163,0.00006441048,0.0001802392,0.0003633928,0.00006018358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002254495,"about_ca_system_score_gemma":0.0002465779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009529416,"about_ca_topic_score_gemma":0.0000209152,"domain_scores_codex":[0.9981762,0.0001004973,0.0003259123,0.0003110531,0.0005729615,0.0005134299],"domain_scores_gemma":[0.9953917,0.002776783,0.00007731761,0.0003633436,0.001202905,0.0001879183],"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.00007955745,0.0001425767,0.00001407132,0.00004537579,0.00002622996,0.000001991323,0.00003899756,0.0002369416,0.0009389231,0.9913576,0.004844409,0.002273322],"study_design_scores_gemma":[0.001264744,0.0002483765,0.001703661,0.00004390139,0.00006591148,0.000009499314,0.0001209324,0.01736478,0.002916987,0.9680396,0.008005477,0.0002161849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02331235,0.0001105653,0.9725051,0.001782218,0.000156616,0.0007518325,0.0008422834,0.00007982743,0.0004592079],"genre_scores_gemma":[0.9891397,0.0001757409,0.009585429,0.00005142356,0.0001647054,0.0001323418,0.0005023379,0.00002065938,0.0002276874],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9658273,"threshold_uncertainty_score":0.9936689,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055668215","doi":"10.1002/nav.20030","title":"The gradual covering problem","year":2004,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":102,"is_retracted":false,"has_abstract":true,"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","keywords":"Constant (computer programming); Extreme point; Point (geometry); Mathematical optimization; Minimum distance; Function (biology); Signed distance function; Zero (linguistics); Mathematics; Computer science; Linear programming; Algorithm; Combinatorics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.158700219429341,"gpt":0.3587539287809016,"spread":0.2000537093515606,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00280712,0.0001482993,0.000120397,0.0001981742,0.001111997,0.0006708617,0.0006754929,0.00005960324,0.0001132723],"category_scores_gemma":[0.001891423,0.0001101075,0.00006565534,0.0008353257,0.0003582759,0.0003500272,0.0005875985,0.0004395711,0.002499535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001704501,"about_ca_system_score_gemma":0.00009087849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004413562,"about_ca_topic_score_gemma":0.002349277,"domain_scores_codex":[0.9973977,0.00003198432,0.0003203044,0.0003337575,0.001183712,0.0007325058],"domain_scores_gemma":[0.9987384,0.0001176619,0.00004218313,0.0004629072,0.0006062405,0.00003262902],"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.00006109945,0.0001340835,0.0004886805,0.0001927021,0.00003176404,0.0000196251,0.0000537101,0.01142995,0.0001500632,0.9558762,0.01937106,0.01219106],"study_design_scores_gemma":[0.0007327992,0.00004657934,0.003582993,0.00004785764,0.00001786541,9.169134e-7,0.0006323314,0.006630292,0.00008409745,0.1928967,0.7950436,0.0002839677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1056784,0.0009937115,0.05273345,0.05865878,0.003531944,0.003704495,0.00002190229,0.0009437061,0.7737336],"genre_scores_gemma":[0.9953429,0.0001664154,0.0002699327,0.0004185433,0.0006826636,0.00007151976,0.00002445162,0.00002163334,0.003002008],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8896645,"threshold_uncertainty_score":0.9982771,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072542441","doi":"10.1002/nav.20114","title":"On the effectiveness of returns policies in the price‐dependent newsvendor model","year":2005,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":99,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Newsvendor model; Product (mathematics); Microeconomics; Economics; Value (mathematics); Channel (broadcasting); Business; Monetary economics; Industrial organization; Supply chain; Marketing; Computer science; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1477682116313944,"gpt":0.3610995371806237,"spread":0.2133313255492293,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01015869,0.0001791251,0.000209505,0.0004330736,0.000266921,0.0002617845,0.001139384,0.00007608511,0.0001263612],"category_scores_gemma":[0.003644646,0.0001027944,0.00008949899,0.00081455,0.0003432467,0.0002228207,0.0004655756,0.0006404548,0.0002044115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001790153,"about_ca_system_score_gemma":0.000058705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001034008,"about_ca_topic_score_gemma":0.0003675623,"domain_scores_codex":[0.9969021,0.0004016693,0.000319508,0.0003024309,0.001461805,0.0006124933],"domain_scores_gemma":[0.9966403,0.002311373,0.0001059565,0.0006398365,0.000285083,0.00001741896],"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.0003149612,0.0003839043,0.0009382073,0.0002626265,0.0000254808,0.00001496351,0.0002662435,0.02245915,0.0004482735,0.9602727,0.01368786,0.0009256045],"study_design_scores_gemma":[0.002962911,0.0003315814,0.02695664,0.0005716638,0.00007360068,0.000002850672,0.005460801,0.4477957,0.001832926,0.4461122,0.06717397,0.0007252044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.4708652,0.0002110238,0.003440332,0.01244952,0.0003272743,0.002968087,0.00002067455,0.00007838925,0.5096396],"genre_scores_gemma":[0.9971733,0.00004078241,0.00003819216,0.001324446,0.0005117873,0.0001320301,0.00001083684,0.00002232183,0.0007463183],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5263081,"threshold_uncertainty_score":0.4363245,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023379762","doi":"10.1002/nav.20099","title":"Properties of the geometric and related processes","year":2005,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","cited_by":88,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; Western University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Process (computing); Geometric series; Computer science; Series (stratigraphy); Complement (music); Stochastic process; Scheduling (production processes); Geometric modeling; Geometric programming; Mathematics; Mathematical optimization; Statistics; Geometry; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.3879670409584782,"gpt":0.4246007972902171,"spread":0.03663375633173893,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.006780767,0.000113665,0.0002299178,0.0004792514,0.0002634192,0.0001480435,0.001048648,0.0001215507,0.00007309062],"category_scores_gemma":[0.130375,0.00005710323,0.00004507022,0.003581506,0.001094944,0.0001247133,0.0004469247,0.0004846326,0.00009541767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006622393,"about_ca_system_score_gemma":0.0004479552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003497794,"about_ca_topic_score_gemma":0.00001399891,"domain_scores_codex":[0.9960138,0.0002914876,0.000523124,0.0003581339,0.002401922,0.0004115066],"domain_scores_gemma":[0.9944187,0.003024521,0.0001054325,0.0005947333,0.001731123,0.0001254392],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008885126,0.002161231,0.02803544,0.002292045,0.0003685744,0.00009635207,0.007885288,0.1997515,0.03920177,0.2288013,0.1061749,0.3843431],"study_design_scores_gemma":[0.003916865,0.002035287,0.06676503,0.001360226,0.000148097,0.0002638865,0.003339757,0.2043871,0.1102563,0.4526789,0.1529685,0.001879943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7709821,0.04003177,0.1017488,0.01191233,0.001514841,0.003505815,0.0001157837,0.0003290428,0.06985947],"genre_scores_gemma":[0.9923772,0.000183347,0.001058999,0.00001480934,0.00006742062,0.00001328415,3.65204e-7,0.00001119072,0.006273354],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3824632,"threshold_uncertainty_score":0.8769502,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2002649216","doi":"10.1002/nav.20370","title":"Dynamic signatures and their use in comparing the reliability of new and used systems","year":2009,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Statistical Distribution Estimation and Applications","field":"Mathematics","cited_by":85,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada","keywords":"Component (thermodynamics); Signature (topology); Reliability (semiconductor); Property (philosophy); Computer science; Representation (politics); Residual; Independent and identically distributed random variables; Element (criminal law); Reliability engineering; Reliability theory; Theoretical computer science; Algorithm; Mathematics; Failure rate; Random variable; Statistics; Engineering; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.3197400540967099,"gpt":0.4742333475043197,"spread":0.1544932934076098,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.001348345,0.00009761471,0.0002229802,0.0000746254,0.0001305618,0.0001012137,0.0001645379,0.00008400535,0.000008758066],"category_scores_gemma":[0.0100029,0.00006354333,0.00001903457,0.000295688,0.0004146782,0.00005190498,0.00007230009,0.0004149862,0.000002026458],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007097868,"about_ca_system_score_gemma":0.00007562071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002747029,"about_ca_topic_score_gemma":0.0001616481,"domain_scores_codex":[0.9986732,0.000216899,0.0003303794,0.0002065285,0.0003365594,0.00023644],"domain_scores_gemma":[0.9940253,0.005232032,0.00006653927,0.0003130862,0.0002470364,0.0001160009],"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.00003916749,0.00013339,0.001537087,0.00009116096,0.000005976117,0.000001489681,0.0003621125,0.0005458989,0.0007372893,0.9938093,0.001554057,0.001183098],"study_design_scores_gemma":[0.0004385277,0.00008539636,0.1029278,0.00008335966,0.000008334267,0.000002897038,0.0004315139,0.3849267,0.00009077293,0.5106521,0.0002590112,0.00009362904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5877383,0.0003271102,0.4081903,0.001287093,0.00003118895,0.00101554,0.0001939344,0.00004752773,0.001169006],"genre_scores_gemma":[0.9972297,0.00004189242,0.002550495,0.00001438658,0.000008965784,0.00001309552,0.00001707856,0.000005658075,0.0001187352],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4831572,"threshold_uncertainty_score":0.9983363,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003554734","doi":"10.1002/nav.21533","title":"Impact of transfer pricing methods for tax purposes on supply chain performance under demand uncertainty","year":2013,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":77,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Transfer pricing; Newsvendor model; Profit (economics); Supply chain; Industrial organization; Business; Microeconomics; Division (mathematics); Multinational corporation; Product (mathematics); Transfer (computing); Economics; Marketing; Computer science; Finance","retraction":null,"screen_n_in":null,"score":{"opus":0.1408753174867184,"gpt":0.415457614479481,"spread":0.2745822969927626,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00393624,0.0002921582,0.0004029165,0.0007064504,0.0003692821,0.0003251595,0.0006022422,0.0001354723,0.0007595086],"category_scores_gemma":[0.001492382,0.0002245022,0.000233285,0.0007310568,0.0003430201,0.0005090372,0.0002159804,0.0004118756,0.0001299876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002660679,"about_ca_system_score_gemma":0.0001005314,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002524655,"about_ca_topic_score_gemma":0.00005257978,"domain_scores_codex":[0.9971571,0.0001377904,0.0004837127,0.0004763673,0.0007837948,0.0009612237],"domain_scores_gemma":[0.9974676,0.0009645206,0.0001012552,0.0004761943,0.000928035,0.00006238967],"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.002547593,0.001999282,0.0367072,0.005913808,0.001121458,0.00002274121,0.0007290861,0.1132639,0.02329775,0.3937402,0.1137716,0.3068854],"study_design_scores_gemma":[0.004870574,0.002329152,0.07803056,0.000592089,0.000185166,0.000002702629,0.001515877,0.7855555,0.003703033,0.06201863,0.05985275,0.001343991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7938521,0.0002590887,0.1629473,0.001628303,0.000641319,0.00503476,0.00005601988,0.0001524111,0.03542877],"genre_scores_gemma":[0.9952301,0.00009219432,0.002014861,0.0003037101,0.0006031292,0.0003062946,0.00007314694,0.0000530285,0.0013235],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6722916,"threshold_uncertainty_score":0.9154934,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099189023","doi":"10.1002/nav.20471","title":"The quay crane scheduling problem with time windows","year":2011,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":73,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Center for Interuniversity Research and Analysis on Organizations","funders":"Deutscher Akademischer Austauschdienst","keywords":"Computer science; Scheduling (production processes); Operations research; Job shop scheduling; Heuristic; Operations management; Engineering; Artificial intelligence; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.09112287755150374,"gpt":0.2983304974547226,"spread":0.2072076199032189,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002217779,0.0002386912,0.0002436013,0.0001262962,0.0005025265,0.0001960809,0.0006161429,0.0001638985,0.0004668113],"category_scores_gemma":[0.0009177012,0.0001551275,0.00005223604,0.0003951057,0.0007271983,0.00007841037,0.0001572145,0.001114487,0.0005468371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000115216,"about_ca_system_score_gemma":0.000156085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002809147,"about_ca_topic_score_gemma":0.0001461904,"domain_scores_codex":[0.9972072,0.0001257619,0.0003582608,0.0003074323,0.000931525,0.00106984],"domain_scores_gemma":[0.9978136,0.0007717606,0.00004069039,0.0006210863,0.0004837758,0.000269115],"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.002160326,0.001316967,0.01033444,0.002195835,0.001553799,0.003934612,0.005328829,0.1304969,0.00687091,0.5447414,0.09047636,0.2005896],"study_design_scores_gemma":[0.003280385,0.002975124,0.006515722,0.0006195341,0.0002025885,0.0002398642,0.001064625,0.5632393,0.007745051,0.09299299,0.3184145,0.002710265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.00724678,0.001787442,0.111778,0.0003552733,0.0004718654,0.00163702,0.00008676299,0.0008918418,0.875745],"genre_scores_gemma":[0.9778554,0.0003729888,0.01594659,0.00002086104,0.0003036313,0.00007999524,0.00002079261,0.00009374708,0.005305937],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9706087,"threshold_uncertainty_score":0.7028667,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2164474269","doi":"10.1002/nav.10043","title":"The stochastic U‐line balancing problem","year":2002,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Assembly Line Balancing Optimization","field":"Engineering","cited_by":69,"is_retracted":false,"has_abstract":true,"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","keywords":"Line (geometry); Computer science; Task (project management); Visibility; Production line; Function (biology); Path (computing); Mathematical optimization; Shortest path problem; Production (economics); Algorithm; Mathematics; Theoretical computer science; Graph; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.0782222590228775,"gpt":0.3220612259787486,"spread":0.2438389669558712,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001535859,0.0001891399,0.0001877474,0.0001502564,0.0005153357,0.0002001959,0.000482112,0.000136837,0.0000718863],"category_scores_gemma":[0.003129397,0.0001479234,0.00004744108,0.0006404473,0.0002070941,0.00009315777,0.0001454063,0.0008913728,0.0005092315],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003030059,"about_ca_system_score_gemma":0.00004363533,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002842804,"about_ca_topic_score_gemma":0.00006951387,"domain_scores_codex":[0.9974005,0.0001238153,0.0003575766,0.0002608982,0.0009383386,0.0009189242],"domain_scores_gemma":[0.9974956,0.001355356,0.00003547779,0.0005001884,0.0004385672,0.0001748477],"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.00001355194,0.00004134235,0.00008154009,0.00008150301,0.00003534364,0.00002355719,0.0002055351,0.9581745,0.001290108,0.005628964,0.02324086,0.01118315],"study_design_scores_gemma":[0.0002595352,0.0001001017,0.000120762,0.00005079731,0.000008467323,0.000009068135,0.00006569637,0.9911817,0.0002674714,0.002106886,0.005652109,0.0001774058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004058742,0.002636945,0.9386669,0.001113061,0.0008119844,0.001057862,0.00003371957,0.0009456068,0.05067515],"genre_scores_gemma":[0.9924729,0.0003773669,0.004544747,0.00001699655,0.0004753146,0.00006396544,0.00001521987,0.00007483589,0.001958651],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9884142,"threshold_uncertainty_score":0.654531,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2513254237","doi":"10.1002/nav.21695","title":"Contracts and coordination: Supply chains with uncertain demand and supply","year":2016,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":64,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"National Natural Science Foundation of China","keywords":"Supply chain; Bargaining problem; Business; Microeconomics; Profit (economics); Consignment; Procurement; Vendor-managed inventory; Revenue sharing; Channel coordination; Production (economics); Industrial organization; Stackelberg competition; Supply chain management; Economics; Marketing","retraction":null,"screen_n_in":null,"score":{"opus":0.08024940735387746,"gpt":0.3134920227540284,"spread":0.2332426154001509,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002073827,0.0002339913,0.0002563553,0.0004372649,0.0004413985,0.0005412344,0.0002742089,0.0001019295,0.0002959628],"category_scores_gemma":[0.001399847,0.0001524326,0.00002780291,0.0004208435,0.0008048829,0.0006388774,0.0004088746,0.0002484489,0.0001112174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009684244,"about_ca_system_score_gemma":0.00005828113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005625454,"about_ca_topic_score_gemma":0.0004015121,"domain_scores_codex":[0.9975494,0.0000694128,0.0002558448,0.0005281956,0.0008704254,0.0007267085],"domain_scores_gemma":[0.9983695,0.0005757199,0.00009869684,0.0003126091,0.0005581258,0.00008540868],"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.0007052078,0.0002731893,0.142188,0.0005724009,0.000149926,0.0004094345,0.000155853,0.00002937842,0.001829135,0.7114372,0.08760922,0.05464106],"study_design_scores_gemma":[0.008134802,0.0006235131,0.1223518,0.0006632779,0.0001264976,0.0000284689,0.001406117,0.01119286,0.0003404329,0.0441781,0.809872,0.001082102],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6999578,0.002635882,0.02251297,0.08277285,0.0009740796,0.004720089,0.0001340267,0.00056917,0.1857231],"genre_scores_gemma":[0.9909478,0.0002787485,0.0001914235,0.0007024775,0.0006986802,0.00006503973,0.00002483384,0.00003540238,0.007055587],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7222628,"threshold_uncertainty_score":0.6216019,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076010882","doi":"10.1002/nav.20204","title":"Bayesian strategies for dynamic pricing in e‐commerce","year":2006,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":60,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Revenue management; Dynamic pricing; Yield management; Revenue; Computer science; E-commerce; Dirichlet distribution; Bayesian probability; Range (aeronautics); Bayesian inference; Operations research; Econometrics; Microeconomics; Business; Economics; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.08615525665716967,"gpt":0.3740145309688234,"spread":0.2878592743116538,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002476035,0.0001978299,0.0002533112,0.0007467199,0.0003586145,0.0007466989,0.0004427739,0.0001256458,0.0001079762],"category_scores_gemma":[0.0008730269,0.0001941631,0.00007921185,0.00097106,0.0001928303,0.000526654,0.000270904,0.0005465472,0.00006399284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001371987,"about_ca_system_score_gemma":0.0001390151,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008849829,"about_ca_topic_score_gemma":0.008492798,"domain_scores_codex":[0.9976487,0.00005334963,0.0003994809,0.00041303,0.0005949826,0.0008905068],"domain_scores_gemma":[0.9983587,0.0007894262,0.00008845478,0.000322971,0.0004190589,0.00002139069],"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.0008351232,0.0009412142,0.3253421,0.00220682,0.00004631873,0.0003382988,0.0001999043,0.00354182,0.01082848,0.4629472,0.01729317,0.1754795],"study_design_scores_gemma":[0.003002382,0.0001076807,0.3881844,0.0003804329,0.0001062774,0.000006425832,0.002692394,0.2316904,0.00008592642,0.2918468,0.0807102,0.001186763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5365897,0.0008701264,0.1526239,0.002980113,0.0009711733,0.002922342,0.00004231193,0.0004285214,0.3025718],"genre_scores_gemma":[0.9976057,0.00001476132,0.0007426842,0.0001039188,0.0004254282,0.00007746511,0.0000700172,0.00004217005,0.0009178324],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.461016,"threshold_uncertainty_score":0.9977503,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048883691","doi":"10.1002/nav.1","title":"Extending the MAD portfolio optimization model to incorporate downside risk aversion","year":2001,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":56,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Downside risk; Portfolio optimization; Mathematical optimization; Stochastic dominance; Portfolio; Quadratic programming; Computer science; Variance (accounting); Modern portfolio theory; Mathematics; Econometrics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.4363420512382304,"gpt":0.5104956728919372,"spread":0.07415362165370676,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.01627914,0.0002590494,0.0003387337,0.001109988,0.001425598,0.0008959759,0.001582582,0.000226045,0.0005103656],"category_scores_gemma":[0.02460215,0.0001683905,0.0001339854,0.004124961,0.0003901043,0.000483677,0.0007255279,0.0008601942,0.001169709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002495529,"about_ca_system_score_gemma":0.0004387056,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005330469,"about_ca_topic_score_gemma":0.0001181415,"domain_scores_codex":[0.9915973,0.001070116,0.000934153,0.0008898589,0.004577581,0.000931011],"domain_scores_gemma":[0.9926202,0.002564581,0.0003986174,0.001355395,0.002562778,0.000498383],"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.0002068959,0.00005596512,0.006479725,0.000001254101,0.000009455988,0.0000649375,0.000216254,0.9303446,0.00006352501,0.004899112,0.03287521,0.02478308],"study_design_scores_gemma":[0.0002894661,0.0001536954,0.001599256,0.00001529865,0.00001580004,0.0000179023,0.0003574567,0.9124043,0.00009037268,0.06904472,0.01580205,0.000209688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01988213,0.0001439629,0.9430053,0.001374353,0.000396959,0.0007302216,0.00006799343,0.00008120343,0.03431783],"genre_scores_gemma":[0.9359024,0.00629516,0.04187441,0.0002830845,0.0003433133,0.000044466,0.00005282275,0.00004626266,0.01515807],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9160203,"threshold_uncertainty_score":0.9998744,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2918288952","doi":"10.1002/nav.21832","title":"Economic and environmental impacts of vertical and horizontal competition and integration","year":2019,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Environmental Sustainability in Business","field":"Business, Management and Accounting","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Competition (biology); Welfare; Duopoly; Market structure; Social Welfare; Industrial organization; Environmental pollution; Sustainability; Business; Economics; Vertical integration; Externality; Environmentally friendly; Microeconomics; Market economy; Environmental science; Environmental protection","retraction":null,"screen_n_in":null,"score":{"opus":0.02403362018165716,"gpt":0.2835970978657265,"spread":0.2595634776840693,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000664156,0.000118601,0.000168135,0.000146399,0.000107754,0.0001464769,0.00008498719,0.00007258784,0.0001246117],"category_scores_gemma":[0.0002972557,0.0001109117,0.00001530661,0.00006460732,0.000755225,0.0004746284,0.0004206233,0.000213532,0.00005500634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001528857,"about_ca_system_score_gemma":0.00001637689,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008427831,"about_ca_topic_score_gemma":0.0001480055,"domain_scores_codex":[0.9989405,0.00003076944,0.0001941325,0.0002796385,0.0002861345,0.0002687742],"domain_scores_gemma":[0.9995382,0.0002031188,0.00004256931,0.0001537162,0.00002826646,0.00003410498],"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.0004415878,0.0002422905,0.8516297,0.0006403444,0.00002354694,0.00001217826,0.000095684,0.00003936244,0.04699753,0.09377399,0.0001110552,0.005992695],"study_design_scores_gemma":[0.001223359,0.0003549226,0.9665987,0.00006774472,0.00002755653,0.00001019254,0.001338981,0.01649364,0.001198046,0.01139539,0.00104661,0.0002447976],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9979394,0.0001285674,0.0001566826,0.0002842712,0.00006622887,0.000374838,0.0000151004,0.00001130666,0.001023571],"genre_scores_gemma":[0.9995153,0.0001508164,0.0000666765,0.00003811908,0.0001225827,0.000006590171,0.00005587402,0.00001394903,0.0000300794],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.114969,"threshold_uncertainty_score":0.4522848,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083594070","doi":"10.1002/nav.10021","title":"Optimal service rates of a service facility with perishable inventory items","year":2002,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":50,"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":"Inventory control; Operations research; Markov decision process; Service (business); Computer science; Poisson distribution; Exponential distribution; Markov chain; Mathematical optimization; Service level; Linear programming; Inventory theory; Markov process; Mathematics; Business; Statistics; Marketing","retraction":null,"screen_n_in":null,"score":{"opus":0.2157233689662252,"gpt":0.3332282016677091,"spread":0.1175048327014838,"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.00194901,0.0002829058,0.0003620111,0.0004742673,0.0003594949,0.0003719373,0.0008653961,0.0001286083,0.002804059],"category_scores_gemma":[0.0006793026,0.0002437565,0.00007251513,0.001919321,0.0003229434,0.000689632,0.0007167149,0.0005458602,0.001521456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001342191,"about_ca_system_score_gemma":0.00005775958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005708534,"about_ca_topic_score_gemma":0.001059052,"domain_scores_codex":[0.9965039,0.00009505658,0.0004499227,0.0005653,0.001511387,0.000874437],"domain_scores_gemma":[0.9970652,0.0001851802,0.0001822829,0.0006955467,0.001800411,0.00007140693],"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.002929317,0.006628739,0.1815276,0.02384987,0.001191556,0.0007638395,0.004599642,0.04128846,0.005265957,0.1024527,0.616815,0.01268724],"study_design_scores_gemma":[0.002694278,0.0003245773,0.005345428,0.0003245368,0.0001069091,0.000004774824,0.005710796,0.4081594,0.0005300162,0.002110717,0.5737691,0.0009194217],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7501731,0.0008922163,0.001508282,0.00863001,0.0006023811,0.002099698,0.00009741292,0.0003411753,0.2356557],"genre_scores_gemma":[0.9934952,0.0000495556,0.0003251625,0.001915343,0.000546982,0.00008692544,0.00009421185,0.00003968503,0.003446943],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.366871,"threshold_uncertainty_score":0.999256,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976621663","doi":"10.1002/nav.20207","title":"Optimal sample size allocation for tests with multiple levels of stress with extreme value regression","year":2006,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Statistical Distribution Estimation and Applications","field":"Mathematics","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Estimator; Statistics; Mathematics; Fisher information; Sample size determination; Covariance matrix; Extreme value theory; Monte Carlo method; Regression analysis; Covariance; Sample (material); Optimal allocation; Variance (accounting); Maximum likelihood; Econometrics; Mathematical optimization; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.3033157505380173,"gpt":0.4600390073891456,"spread":0.1567232568511283,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.000844707,0.0001952887,0.0002904737,0.0001025825,0.0003260581,0.00006651925,0.0002844539,0.0001215426,0.0001348776],"category_scores_gemma":[0.01943435,0.0001403638,0.00004587214,0.0005035789,0.0005747112,0.00007945636,0.00006373045,0.0002684713,0.00001046224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001511106,"about_ca_system_score_gemma":0.0002895859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003182012,"about_ca_topic_score_gemma":0.0002412279,"domain_scores_codex":[0.997465,0.0001387627,0.0004618566,0.0003860777,0.001060025,0.0004882515],"domain_scores_gemma":[0.9822012,0.0151179,0.0002095932,0.0004708126,0.001851785,0.0001487016],"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.0004460655,0.0008167741,0.00167632,0.0003571127,0.00003104331,0.000004582171,0.00006079189,0.004119742,0.003251857,0.9842352,0.003644361,0.001356167],"study_design_scores_gemma":[0.006625502,0.001763529,0.07084312,0.0008038762,0.0001627308,0.00001648375,0.0005645572,0.2508788,0.03912538,0.6267712,0.00167057,0.0007743843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02343858,0.00001658681,0.9700615,0.0003890599,0.00001663115,0.001138165,0.003795988,0.00007507014,0.001068441],"genre_scores_gemma":[0.6786665,0.000002411283,0.3204642,0.000006798637,0.00005420433,0.0002104355,0.0002366795,0.00002610129,0.0003326871],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.655228,"threshold_uncertainty_score":0.9888254,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3104895535","doi":"10.1002/nav.21528","title":"Partial input to output impacts in DEA: Production considerations and resource sharing among business subunits","year":2013,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Data envelopment analysis; Computer science; Set (abstract data type); Production (economics); Variable (mathematics); Operations research; Resource (disambiguation); Mathematical optimization; Economics; Mathematics; Microeconomics","retraction":null,"screen_n_in":null,"score":{"opus":0.3289657199401247,"gpt":0.4641431767433246,"spread":0.1351774568031999,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.01310364,0.0002048939,0.0003929611,0.001735348,0.0007024037,0.001663031,0.0006755308,0.0001631126,0.0001402228],"category_scores_gemma":[0.1962693,0.0001622906,0.00004622586,0.004799719,0.000830624,0.0005683672,0.0007829592,0.0007352464,0.0005215006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002167036,"about_ca_system_score_gemma":0.0003759821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003475567,"about_ca_topic_score_gemma":0.003724175,"domain_scores_codex":[0.9933295,0.0008376429,0.0008850386,0.001086803,0.00294702,0.000914011],"domain_scores_gemma":[0.9899711,0.004412481,0.0001656174,0.001128976,0.003815533,0.0005062862],"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.000241371,0.000886935,0.659243,0.00009562077,0.00006655166,0.0003186052,0.008892658,0.1704869,0.02125438,0.01750307,0.09105893,0.02995201],"study_design_scores_gemma":[0.0006088707,0.0002595445,0.8278013,0.0002124813,0.00002686826,0.00003496748,0.002004538,0.0897861,0.003261631,0.07079775,0.004601263,0.0006046628],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9849409,0.00009882297,0.005101341,0.006513593,0.0001859019,0.0007391751,0.000007819593,0.00004474687,0.002367707],"genre_scores_gemma":[0.9969974,0.00001474123,0.000872691,0.0001242634,0.0002353503,0.00005717463,0.000005892132,0.00001980229,0.001672707],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1831657,"threshold_uncertainty_score":0.9993733,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136354326","doi":"10.1002/nav.20037","title":"Warranty costs: An age‐dependent failure/repair model","year":2004,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Office of Naval Research","keywords":"Warranty; Product (mathematics); Failure rate; Hazard; Function (biology); Poisson distribution; Computer science; Poisson process; Reliability engineering; Operations research; Mathematics; Engineering; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.07931213403529234,"gpt":0.3429327634649323,"spread":0.2636206294296399,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001557606,0.0002026315,0.0002258209,0.0001844748,0.0002141535,0.0001329867,0.0004228387,0.0002429682,0.00004206089],"category_scores_gemma":[0.001413056,0.0001925025,0.00008566926,0.0003618448,0.0003131391,0.0002665342,0.0001084011,0.000882124,0.0001465742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00104285,"about_ca_system_score_gemma":0.000195859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003205082,"about_ca_topic_score_gemma":0.0006546881,"domain_scores_codex":[0.99743,0.0001021984,0.0003221491,0.0004031915,0.000925526,0.0008169943],"domain_scores_gemma":[0.9984066,0.0001438798,0.00002088193,0.0006511136,0.0004703928,0.0003070681],"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.00003865657,0.0001132724,0.00002074002,0.00008271812,0.00001959532,0.00007458014,0.0002356069,0.9665643,0.002524219,0.02768021,0.001604227,0.001041866],"study_design_scores_gemma":[0.0007317447,0.0002168017,0.00007694503,0.00005985645,0.00001081425,0.000008077734,0.0002815324,0.9536059,0.002098635,0.04119375,0.001428823,0.0002871017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03673245,0.0002166791,0.9365272,0.0004432731,0.0003521782,0.0008343695,0.00009870212,0.001107461,0.02368767],"genre_scores_gemma":[0.9677112,0.0004872826,0.03100542,0.00004195284,0.0001408296,0.00005864537,0.00007363714,0.00005642791,0.0004245827],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9309788,"threshold_uncertainty_score":0.7850024,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964000286","doi":"10.1002/nav.10122","title":"Preservation of stochastic orders for random minima and maxima, with applications","year":2003,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Lanzhou University","keywords":"Maxima and minima; Maxima; Order (exchange); Regular polygon; Mathematics; Reliability (semiconductor); Stochastic ordering; Statistical physics; Combinatorics; Mathematical optimization; Applied mathematics; Mathematical analysis; Geometry; Physics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.05179451081522327,"gpt":0.3145093614879406,"spread":0.2627148506727173,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008196675,0.0000837281,0.0001439641,0.0001005317,0.00009327019,0.00002899491,0.00009501071,0.00007321725,0.000009514663],"category_scores_gemma":[0.002080237,0.00007246713,0.00001942953,0.0002871875,0.0002554467,0.0000876249,0.00001511234,0.0001511261,0.000002078026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005162489,"about_ca_system_score_gemma":0.00007118081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002359385,"about_ca_topic_score_gemma":0.00002822233,"domain_scores_codex":[0.9990776,0.00004631723,0.0001830228,0.0001668034,0.0002641835,0.0002620314],"domain_scores_gemma":[0.998381,0.0007542882,0.00002662743,0.0002092524,0.0005617438,0.00006712308],"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.0005454666,0.0001265676,0.0002238646,0.0009669304,0.00006675582,8.887072e-7,0.0002429082,0.8329761,0.001902336,0.1553807,0.001454396,0.00611308],"study_design_scores_gemma":[0.00416962,0.0005998763,0.000320857,0.00009711624,0.00004685893,0.000004901901,0.0003724853,0.9271208,0.001914698,0.05387592,0.011191,0.000285833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002637795,0.0002140187,0.992995,0.00007155789,0.00002572146,0.001213616,0.00003192388,0.00003734726,0.002773065],"genre_scores_gemma":[0.9627485,0.0001164502,0.03637695,0.000004837807,0.00002158684,0.0004773322,0.00003140343,0.00002305327,0.0001999262],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9601107,"threshold_uncertainty_score":0.2955124,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041652723","doi":"10.1002/nav.10110","title":"Facility location models for immobile servers with stochastic demand","year":2003,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":46,"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":"Server; Computer science; Queueing theory; Service (business); Service provider; Heuristic; Operations research; Equivalence (formal languages); Quality of service; Facility location problem; Limit (mathematics); Upper and lower bounds; Computer network; Mathematical optimization; Business; Mathematics; Marketing","retraction":null,"screen_n_in":null,"score":{"opus":0.1671699896375916,"gpt":0.3405624428344305,"spread":0.173392453196839,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002541469,0.0002034467,0.000207163,0.0003073919,0.0005144483,0.000263672,0.0003392043,0.00009132661,0.0002285194],"category_scores_gemma":[0.002315379,0.0001779711,0.00005965208,0.0009165547,0.0002542729,0.0006057383,0.0001164749,0.0002582411,0.000411264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001616694,"about_ca_system_score_gemma":0.0001455772,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001210421,"about_ca_topic_score_gemma":0.001055802,"domain_scores_codex":[0.9974788,0.00006213044,0.0003404758,0.0005325379,0.0009109154,0.0006750989],"domain_scores_gemma":[0.9974805,0.0001679765,0.00005884469,0.0005031587,0.001739759,0.00004976671],"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.0003036528,0.0003146812,0.0003229425,0.0009799742,0.00006118075,0.000003540039,0.00007878893,0.6531944,0.00006330023,0.333175,0.00930802,0.002194503],"study_design_scores_gemma":[0.001906522,0.0001854925,0.0008833766,0.00007385002,0.00008554142,0.0000010166,0.001381818,0.8559642,0.00008074692,0.08087289,0.05798231,0.000582241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01929924,0.0001358059,0.9593005,0.0006209295,0.0003086675,0.001990178,0.00003906315,0.0001360324,0.01816959],"genre_scores_gemma":[0.9969253,0.00001249684,0.0006558046,0.0001784179,0.0001259012,0.0003171517,0.000144291,0.0000197783,0.001620859],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9776261,"threshold_uncertainty_score":0.7257451,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2095338002","doi":"10.1002/(sici)1520-6750(200006)47:4<287::aid-nav2>3.0.co;2-r","title":"Heuristics for the location of inspection stations on a network","year":2000,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":43,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Imperial Oil (Canada); HEC Montréal; Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Heuristics; Tabu search; Heuristic; Computer science; Mathematical optimization; Path (computing); Flow network; Greedy algorithm; Reduction (mathematics); Operations research; Artificial intelligence; Mathematics; Algorithm; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.1918134376875431,"gpt":0.3842398050949423,"spread":0.1924263674073991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001854558,0.0001025718,0.0001117334,0.0001663702,0.0006461376,0.0001260488,0.000302753,0.00005202846,0.0003587678],"category_scores_gemma":[0.00240233,0.00008113994,0.00004659652,0.001265853,0.0002192729,0.0001455504,0.00006020839,0.0002106286,0.0004567883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007392478,"about_ca_system_score_gemma":0.00007132605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001603686,"about_ca_topic_score_gemma":0.0009051007,"domain_scores_codex":[0.9984111,0.0000370589,0.0003238365,0.0002278583,0.0006489493,0.0003511758],"domain_scores_gemma":[0.9978039,0.0004426064,0.0000538626,0.0003713245,0.001312969,0.00001529653],"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.0002663145,0.0002362346,0.00040473,0.0003252071,0.00004033681,7.17836e-7,0.00005798507,0.3250088,0.00001285437,0.5276411,0.113307,0.03269877],"study_design_scores_gemma":[0.0005191386,0.0001255281,0.01434657,0.00006322944,0.00005452566,1.443988e-7,0.0003685853,0.466585,0.00001821333,0.03412741,0.4836214,0.0001702967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04180717,0.00100713,0.6443508,0.02418169,0.003583042,0.007940924,0.0001215024,0.0006815539,0.2763261],"genre_scores_gemma":[0.9953693,0.0001825727,0.0003377356,0.0003729948,0.0009251455,0.0001322101,0.00008155675,0.00001555904,0.002582978],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9535621,"threshold_uncertainty_score":0.5871242,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076551060","doi":"10.1002/nav.21497","title":"Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost","year":2012,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Centre National de la Recherche Scientifique","keywords":"Price of anarchy; Scheduling (production processes); Job shop scheduling; Bounded function; Computer science; Constant (computer programming); Mathematical optimization; Minification; Job scheduler; Mathematical economics; Mathematics; Schedule; Economics; Cloud computing; Price of stability","retraction":null,"screen_n_in":null,"score":{"opus":0.05297727917503071,"gpt":0.3312934852245278,"spread":0.2783162060494971,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00110761,0.0001701987,0.0002749789,0.0004424475,0.000141376,0.00004849117,0.0002300504,0.0001752874,0.0001497763],"category_scores_gemma":[0.0008570549,0.0001553345,0.00003719431,0.001402196,0.0002466968,0.0001341879,0.0000877,0.0007073038,0.0001231418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002541573,"about_ca_system_score_gemma":0.0001291971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001455724,"about_ca_topic_score_gemma":0.00001119462,"domain_scores_codex":[0.9976856,0.0001415578,0.0003709898,0.000187285,0.0008789502,0.0007356433],"domain_scores_gemma":[0.9987827,0.0004040205,0.00005360456,0.0001983577,0.0003812011,0.0001801189],"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.001567043,0.001730361,0.01446863,0.000644129,0.0002427612,0.0001136802,0.003355368,0.886785,0.0441045,0.03382381,0.0006499623,0.01251479],"study_design_scores_gemma":[0.001032065,0.0001721354,0.004079364,0.00005750018,0.00001018783,0.00001081626,0.0001254012,0.9924668,0.001608715,0.0001594751,0.00008251906,0.0001950296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8679103,0.0003790189,0.1154555,0.0001039166,0.0002334172,0.00061584,0.00008915844,0.0002681596,0.01494473],"genre_scores_gemma":[0.9743079,0.00003278836,0.02510616,0.000004968134,0.0001919956,0.00001634294,0.0001562536,0.00004278058,0.0001407917],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1063977,"threshold_uncertainty_score":0.6334357,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024627245","doi":"10.1002/nav.20429","title":"Analytic solution for the nucleolus of a three‐player cooperative game","year":2010,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":40,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Core (optical fiber); Sequence (biology); Solution concept; Function (biology); Nucleolus; Mathematics; Mathematical economics; Algebraic number; Value (mathematics); Computer science; Mathematical optimization; Characteristic function (probability theory); Scale (ratio); Cooperative game theory; Game theory; Mathematical analysis; Physics; Probability density function; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.2656542654392289,"gpt":0.3780780264516544,"spread":0.1124237610124255,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00677175,0.0001252082,0.0003503893,0.0002122225,0.0003106866,0.000097652,0.0005480063,0.0001676704,0.0002182995],"category_scores_gemma":[0.00765335,0.0001013759,0.0001271239,0.0003954667,0.0006511442,0.00007791049,0.0001230198,0.0006744326,0.0003222548],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006983649,"about_ca_system_score_gemma":0.0000888668,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006252577,"about_ca_topic_score_gemma":0.0005911023,"domain_scores_codex":[0.9983751,0.0000739992,0.0005472466,0.0003441496,0.0001433813,0.0005161567],"domain_scores_gemma":[0.9965968,0.002087731,0.0002215631,0.0005471119,0.0004545887,0.00009225395],"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.0001327711,0.0000899916,0.00325587,0.00006524582,0.00008067553,0.000001793065,0.0003570096,0.0003074121,0.001737887,0.9915602,0.001411454,0.0009996932],"study_design_scores_gemma":[0.001780712,0.001092031,0.01607816,0.0000649194,0.00003538145,0.00001189627,0.0003542565,0.4486705,0.001447202,0.4704803,0.05950766,0.0004770585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4222736,0.002063584,0.5098048,0.002841695,0.003039109,0.003287252,0.001297033,0.00009909567,0.05529383],"genre_scores_gemma":[0.9970177,0.00003377443,0.0004821405,0.0000287978,0.0003300226,0.00006686176,0.000009486886,0.00002389837,0.002007345],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.574744,"threshold_uncertainty_score":0.9162328,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021108591","doi":"10.1002/nav.10096","title":"Efficient distributions of arms‐control inspection effort","year":2003,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Defense, Military, and Policy Studies","field":"Economics, Econometrics and Finance","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"Foreign Affairs and International Trade Canada","keywords":"Imperfect; Operations research; Computer science; Control (management); Command and control; Agency (philosophy); Resource (disambiguation); A priori and a posteriori; Resource allocation; Risk analysis (engineering); Computer security; Engineering; Business; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.1448358548846419,"gpt":0.3504681012091209,"spread":0.205632246324479,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002509489,0.0001518583,0.0004180655,0.0003850582,0.0003783759,0.00003464479,0.0002252586,0.0001256397,0.0001194596],"category_scores_gemma":[0.005924632,0.0001594872,0.0001513114,0.0006678024,0.0006081549,0.00003027284,0.00006249994,0.000414257,0.000543136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002863036,"about_ca_system_score_gemma":0.00008237868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001151369,"about_ca_topic_score_gemma":0.0001284823,"domain_scores_codex":[0.9980605,0.00008082687,0.0006220096,0.0003907584,0.0001895536,0.0006563094],"domain_scores_gemma":[0.9984524,0.0004894572,0.000138617,0.0004445633,0.0003277669,0.0001471424],"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.000048179,0.0003175604,0.0395688,0.0000603147,0.00009240987,0.000006789957,0.0003538339,0.001393687,0.00004321062,0.9516754,0.006295495,0.0001442974],"study_design_scores_gemma":[0.004255712,0.001554179,0.2126303,0.00007550108,0.00005743798,0.00002077631,0.001219497,0.01857586,0.00137703,0.4961831,0.2630007,0.001049848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4729622,0.01254536,0.07717953,0.002012235,0.001884827,0.001423736,0.004846493,0.000175242,0.4269704],"genre_scores_gemma":[0.9982435,0.000380731,0.0003370783,0.00003430773,0.0001325267,0.00004271109,0.00002151229,0.00001753896,0.0007901129],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5252813,"threshold_uncertainty_score":0.7092767,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3087437672","doi":"10.1002/nav.21948","title":"Subsidy design in a vessel speed reduction incentive program under government policies","year":2020,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Maritime Transport Emissions and Efficiency","field":"Environmental Science","cited_by":37,"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":"Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Subsidy; Stackelberg competition; Port (circuit theory); Incentive; Profit (economics); Government (linguistics); Business; Public economics; Economics; Environmental economics; Finance; Microeconomics; Engineering; Market economy","retraction":null,"screen_n_in":null,"score":{"opus":0.1635511161109822,"gpt":0.3793721493202123,"spread":0.2158210332092302,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001464163,0.0001608267,0.0001803229,0.00004777528,0.0002305423,0.00009674209,0.0004997693,0.0001255745,0.001379795],"category_scores_gemma":[0.0005322109,0.0001424877,0.00004619315,0.001059081,0.0007212535,0.0001185672,0.0002929123,0.0006327542,0.0003325532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006777769,"about_ca_system_score_gemma":0.00008693639,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002089356,"about_ca_topic_score_gemma":0.00005968336,"domain_scores_codex":[0.9961589,0.0002611089,0.0002996098,0.0005052009,0.002021929,0.000753246],"domain_scores_gemma":[0.9991534,0.0001725154,0.00004727433,0.0002397918,0.00003480878,0.0003521733],"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.003515195,0.01146649,0.1229384,0.0004856088,0.0001287518,0.001064904,0.01787655,0.2923295,0.2399289,0.03454499,0.09544558,0.1802751],"study_design_scores_gemma":[0.005435198,0.007173322,0.4289141,0.0003518288,0.0000853478,0.00003603347,0.01699075,0.3695299,0.04335024,0.02266948,0.1030482,0.002415631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.826141,0.0002627352,0.04545707,0.0184742,0.0003028777,0.004814301,0.00009703566,0.0003393222,0.1041114],"genre_scores_gemma":[0.9961746,0.0001554826,0.002732805,0.00008100123,0.00007385238,0.00004066235,0.000009532133,0.00001870413,0.0007133887],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3059757,"threshold_uncertainty_score":0.9995331,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126912283","doi":"10.1002/nav.20015","title":"A sequential dynamic pricing model and its applications","year":2004,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":35,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"McGill University; Virginia Polytechnic Institute and State University; National Science Foundation","keywords":"Dynamic pricing; Revenue management; Reservation; Dynamic programming; Computer science; Mathematical optimization; Revenue; Order (exchange); Heuristic; Operations research; Stochastic programming; Asymptotically optimal algorithm; Economics; Microeconomics; Mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.1390257483009592,"gpt":0.3692503015738026,"spread":0.2302245532728435,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001160381,0.0001642166,0.0001581729,0.0004578375,0.0005132309,0.0004108559,0.0003912479,0.00008633937,0.00006670202],"category_scores_gemma":[0.0005391296,0.000159752,0.00004783482,0.00062246,0.0001988814,0.0004048152,0.0006414165,0.000387371,0.0004699655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002251416,"about_ca_system_score_gemma":0.00008888278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002909281,"about_ca_topic_score_gemma":0.0001483461,"domain_scores_codex":[0.9979321,0.00001875658,0.0002503669,0.0004354743,0.0007632018,0.0006001064],"domain_scores_gemma":[0.999106,0.00007782908,0.00007195745,0.0003067413,0.0003915257,0.00004593891],"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.00004426443,0.0002107969,0.0001425542,0.0004940648,0.00003828569,0.00003399023,0.00007847343,0.02841422,0.00295146,0.9606363,0.00160303,0.005352521],"study_design_scores_gemma":[0.001220091,0.00003999707,0.0003830691,0.00008301227,0.00005078873,0.000002904635,0.0003591042,0.7062069,0.0001158264,0.2425627,0.04858201,0.00039368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1563648,0.001814902,0.527115,0.009525862,0.0007093032,0.005612405,0.00005701401,0.0008508743,0.2979498],"genre_scores_gemma":[0.9963299,0.0001276571,0.0007460447,0.0004888595,0.0004703106,0.0001694278,0.00004695385,0.00003393235,0.001586913],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8399651,"threshold_uncertainty_score":0.6514497,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053778299","doi":"10.1002/nav.20419","title":"A nested benders decomposition approach for telecommunication network planning","year":2010,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Benders' decomposition; Mathematical optimization; Decomposition method (queueing theory); Decomposition; Computer science; Network planning and design; Integer (computer science); Mathematics; Telecommunications; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1917416443279943,"gpt":0.4616228872456383,"spread":0.2698812429176439,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.007203443,0.0002265069,0.0002864359,0.0003999982,0.00149259,0.0007801794,0.005339309,0.0003358208,0.00001140698],"category_scores_gemma":[0.002277021,0.0002285305,0.000109902,0.001707775,0.0005393359,0.0004502143,0.00188519,0.002579289,0.00003609853],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001963004,"about_ca_system_score_gemma":0.0004633976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000853016,"about_ca_topic_score_gemma":0.00006494335,"domain_scores_codex":[0.9951419,0.001008619,0.0005040378,0.0006800914,0.001319446,0.001345897],"domain_scores_gemma":[0.990519,0.00453889,0.0001537293,0.002955979,0.001476587,0.0003558408],"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.0002516592,0.000759475,0.001751285,0.0001507495,0.0001058408,0.00001370473,0.0009580143,0.1457539,0.008442494,0.712392,0.03657846,0.09284236],"study_design_scores_gemma":[0.0005720638,0.0002077833,0.002006142,0.00003485037,0.000005089447,0.0000177063,0.00008213687,0.9619083,0.0003776429,0.02325206,0.01126427,0.0002719627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002506123,0.0003499044,0.9824862,0.00169966,0.000245584,0.001237894,0.00000764471,0.0002667792,0.01120018],"genre_scores_gemma":[0.6494502,0.00008383248,0.3493554,0.00007889313,0.0003116441,0.0003783724,0.0001599257,0.00002990856,0.0001518058],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8161544,"threshold_uncertainty_score":0.9998074,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967061907","doi":"10.1002/nav.10083","title":"Discrete‐time analysis of <i>MAP</i>/<i>PH</i>/1 multiclass general preemptive priority queue","year":2003,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Priority queue; Triangular matrix; Matrix (chemical analysis); Queue; Block (permutation group theory); Mathematics; Type (biology); Combinatorics; Computation; Applied mathematics; Discrete mathematics; Computer science; Algorithm; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05770800368043046,"gpt":0.3608492425199466,"spread":0.3031412388395162,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005043813,0.0003628426,0.0008606063,0.001538348,0.0004671122,0.0002571038,0.0008418555,0.0002116559,0.0007221443],"category_scores_gemma":[0.01115304,0.0003324353,0.0004516074,0.004902854,0.0009342988,0.0006591654,0.0005075752,0.0007965024,0.0004789589],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002398274,"about_ca_system_score_gemma":0.0001383791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00123481,"about_ca_topic_score_gemma":0.0004918051,"domain_scores_codex":[0.9953035,0.0004569718,0.0007369423,0.0008265524,0.00161802,0.001057993],"domain_scores_gemma":[0.995414,0.001239948,0.0004053928,0.001039156,0.001814249,0.00008726796],"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.0007881592,0.001092606,0.04757309,0.0005080082,0.004263635,0.0001957021,0.0003104891,0.1212467,0.02164277,0.7957125,0.004002755,0.002663625],"study_design_scores_gemma":[0.002370281,0.0002034692,0.008912349,0.0001468296,0.00496201,0.00000252583,0.0007571188,0.7414817,0.00693102,0.169986,0.06251682,0.001729958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7044099,0.000891273,0.1251493,0.001190644,0.0008014077,0.002436835,0.0003521671,0.0006368809,0.1641316],"genre_scores_gemma":[0.9918088,0.00003123918,0.003388925,0.0001607925,0.0004137459,0.00003701695,0.0001463974,0.00005583998,0.003957288],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6257265,"threshold_uncertainty_score":0.9999128,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2109918437","doi":"10.1002/nav.20026","title":"Revenue management: A real options approach","year":2004,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Revenue management; Renting; Revenue; Yield management; Inventory management; Business; Promotion (chess); Operations research; Function (biology); Process (computing); Inventory control; Microeconomics; Computer science; Economics; Operations management; Industrial organization; Marketing; Finance; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1541684962163318,"gpt":0.3528874061435829,"spread":0.1987189099272511,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002433502,0.0002542524,0.0002423077,0.0008363342,0.0006813639,0.0006101229,0.0008966311,0.0001256648,0.0002295514],"category_scores_gemma":[0.0004484871,0.0002484483,0.0001265024,0.001428865,0.0004065378,0.0005135759,0.0009648426,0.0005898,0.002091145],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003309096,"about_ca_system_score_gemma":0.00005402364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001828363,"about_ca_topic_score_gemma":0.0001286361,"domain_scores_codex":[0.9965342,0.00005757105,0.0003788171,0.000637008,0.001389602,0.001002853],"domain_scores_gemma":[0.9986896,0.00006967496,0.000106316,0.0007425098,0.0003289191,0.00006297645],"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.00005441467,0.0004178998,0.0003388354,0.0004625563,0.0000623122,0.0001537924,0.00005528448,0.001857783,0.00004757675,0.9459298,0.04808502,0.002534739],"study_design_scores_gemma":[0.002380074,0.0000827634,0.004800333,0.0001707595,0.0001092202,0.000005343713,0.001439686,0.004890061,0.0000302667,0.3153321,0.6701025,0.0006568246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.005389895,0.000284083,0.01321715,0.002204707,0.0007036122,0.001438367,0.00002981328,0.00031929,0.9764131],"genre_scores_gemma":[0.9728874,0.001015867,0.005708925,0.001079866,0.002795542,0.0003321255,0.0002564168,0.00009688469,0.01582698],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9674975,"threshold_uncertainty_score":0.9999968,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3027296912","doi":"10.1002/nav.21906","title":"Clustered coverage orienteering problem of unmanned surface vehicles for water sampling","year":2020,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":29,"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":"National Natural Science Foundation of China","keywords":"Orienteering; Computer science; Sampling (signal processing); Generalization; Linearization; Mathematical optimization; Node (physics); Drone; Integer programming; Algorithm; Real-time computing; Mathematics; Engineering; Computer vision","retraction":null,"screen_n_in":null,"score":{"opus":0.265185610809218,"gpt":0.3982246204879279,"spread":0.1330390096787099,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002273615,0.0001959893,0.0003553242,0.0001127356,0.0002716815,0.0002208115,0.001486653,0.000132563,0.000004464559],"category_scores_gemma":[0.001702834,0.0001613135,0.00008985671,0.0004982793,0.0001941879,0.0002212086,0.001020197,0.00052102,0.0000512887],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001124782,"about_ca_system_score_gemma":0.0001977841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006842904,"about_ca_topic_score_gemma":0.000001569769,"domain_scores_codex":[0.9965456,0.000208674,0.0004861919,0.0006554299,0.001108749,0.000995393],"domain_scores_gemma":[0.9969968,0.00130474,0.0000899966,0.0005288792,0.0007788996,0.0003006634],"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.0004877218,0.0002990037,0.001502482,0.00154904,0.0001661861,0.0001928142,0.009292321,0.7542588,0.1810616,0.03282248,0.003450352,0.01491725],"study_design_scores_gemma":[0.001056265,0.0009081828,0.0001835942,0.0001241126,0.000009021011,0.000006447609,0.00009951176,0.925786,0.05891658,0.009281852,0.003334509,0.0002939702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02298948,0.00008590293,0.9736586,0.001753258,0.0001816659,0.0006879825,0.00005063911,0.0001433286,0.0004492059],"genre_scores_gemma":[0.6291931,0.00001376268,0.3704006,0.00007078808,0.0001156006,0.00001866049,0.00002044977,0.00002362334,0.0001433469],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6062037,"threshold_uncertainty_score":0.6578175,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2045033756","doi":"10.1002/nav.21494","title":"Priority queue with customer upgrades","year":2012,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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 Waterloo","funders":"National Natural Science Foundation of China","keywords":"Queueing theory; Computer science; Priority queue; Queue; Operations research; Sample (material); Lyapunov optimization; Queueing system; Computer network; Mathematical optimization; Mathematics; Lyapunov equation","retraction":null,"screen_n_in":null,"score":{"opus":0.1041311928030988,"gpt":0.3726042708257927,"spread":0.2684730780226939,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003655784,0.0002281854,0.0002897646,0.0005428419,0.0005451164,0.0002980649,0.0005426995,0.000123531,0.0003757609],"category_scores_gemma":[0.00390783,0.0001781848,0.00008085947,0.001573336,0.0006407816,0.001120462,0.0004323258,0.0008136219,0.002315748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001574293,"about_ca_system_score_gemma":0.00006470351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006646242,"about_ca_topic_score_gemma":0.0001625815,"domain_scores_codex":[0.9969036,0.0001115932,0.0002599835,0.0003748184,0.001185592,0.001164432],"domain_scores_gemma":[0.9978454,0.0005583861,0.0001320404,0.0005849007,0.0008003085,0.00007900555],"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.0003805761,0.0004342111,0.0532143,0.0002681006,0.0001347996,0.00007444613,0.0001130657,0.0009967574,0.000893569,0.9282955,0.008863355,0.006331336],"study_design_scores_gemma":[0.001562878,0.0001197977,0.01813505,0.0001931756,0.0003476237,0.00001657683,0.001417952,0.008159986,0.001049712,0.1452493,0.8223487,0.001399267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.4009411,0.001372128,0.05788393,0.003077963,0.001106061,0.001679738,0.00003212713,0.001109437,0.5327975],"genre_scores_gemma":[0.9931788,0.00002679798,0.001335871,0.0002666048,0.002180398,0.00003224592,0.0000253201,0.00005093113,0.002903008],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8134853,"threshold_uncertainty_score":0.9984611,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2897601180","doi":"10.1002/nav.21809","title":"A distribution‐free control chart for monitoring high‐dimensional processes based on interpoint distances","year":2018,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Advanced Statistical Process Monitoring","field":"Decision Sciences","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Fundo para o Desenvolvimento das Ciências e da Tecnologia; Universidade de Macau; Science and Technology Development Fund; Ryerson University","keywords":"Control chart; Curse of dimensionality; Chart; Statistical process control; Mathematics; Generalization; Log-normal distribution; Euclidean distance; Distribution (mathematics); Process (computing); Computer science; Statistics; Data mining; Artificial intelligence; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.316157549828793,"gpt":0.5291424650935893,"spread":0.2129849152647963,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.006292499,0.0003326551,0.0005379278,0.0003363641,0.001208263,0.0005772571,0.001898133,0.0001693966,0.0001204863],"category_scores_gemma":[0.2402517,0.0002500479,0.0001094855,0.00143708,0.001746799,0.0003192552,0.0003747683,0.0007265955,0.0003091819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000497918,"about_ca_system_score_gemma":0.0007321801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004188684,"about_ca_topic_score_gemma":0.00004244958,"domain_scores_codex":[0.9911804,0.0003738409,0.0009293361,0.001202245,0.005062666,0.001251527],"domain_scores_gemma":[0.9641308,0.02614653,0.0002622318,0.001084469,0.007883262,0.0004927524],"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.04001832,0.004118063,0.02660923,0.001656653,0.000341785,0.0005304019,0.0008823939,0.03570379,0.008396528,0.453544,0.1507806,0.2774182],"study_design_scores_gemma":[0.003899708,0.004242536,0.004662138,0.0005803633,0.00003293907,0.000004481037,0.0003987072,0.1377589,0.01917205,0.8049714,0.02353737,0.0007394399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004038333,0.0001527514,0.9882569,0.001648667,0.001478748,0.0008291078,0.002484796,0.0001071333,0.001003613],"genre_scores_gemma":[0.9818841,0.000008109305,0.01501024,0.00007438507,0.001996335,0.0003058445,0.00005173247,0.00003979618,0.0006294923],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9778457,"threshold_uncertainty_score":0.9999952,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078370404","doi":"10.1002/nav.20378","title":"A sequential auction‐bargaining procurement model","year":2009,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Microeconomics; Reverse auction; Bidding; Eauction; Procurement; English auction; Auction theory; Generalized second-price auction; Revenue equivalence; Forward auction; Vickrey auction; Profit (economics); Proxy bid; Economics; Business; Marketing","retraction":null,"screen_n_in":null,"score":{"opus":0.7318395368925034,"gpt":0.6103299945594963,"spread":0.121509542333007,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.01005294,0.0001481272,0.0002143108,0.0004595604,0.0009918526,0.0004325261,0.001072566,0.0001349583,0.0004087954],"category_scores_gemma":[0.01072792,0.0001187865,0.0001074834,0.001526506,0.0004808599,0.0002481536,0.0002072836,0.0007027939,0.001407388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001971709,"about_ca_system_score_gemma":0.0004228891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001416085,"about_ca_topic_score_gemma":0.000008087667,"domain_scores_codex":[0.9942495,0.0004481036,0.000615054,0.000667963,0.003382567,0.0006368018],"domain_scores_gemma":[0.9963434,0.0007884599,0.0001421454,0.0008336756,0.001598654,0.0002936716],"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.00009433765,0.0001896366,0.000041217,0.000002093945,0.000009611906,0.000008236128,0.0003334513,0.03491284,0.00365488,0.9092417,0.02783483,0.0236772],"study_design_scores_gemma":[0.0002170915,0.0001618307,0.000139477,0.000007646568,0.000005501317,0.000008043628,0.0003552495,0.1241751,0.001984814,0.8589121,0.01390837,0.0001248281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004940602,0.00007375189,0.8943784,0.003736061,0.0001447252,0.0005522486,0.00002966975,0.0001277,0.09601682],"genre_scores_gemma":[0.9823596,0.00002858565,0.00601167,0.0002133309,0.0003701696,0.00005486854,0.000009701954,0.00001105532,0.01094097],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.977419,"threshold_uncertainty_score":0.9993702,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2161522387","doi":"10.1002/nav.21570","title":"Scheduling twin robots on a line","year":2014,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":25,"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":"University of Southampton","keywords":"Robot; Job shop scheduling; Computer science; Scheduling (production processes); Heuristic; Mathematical optimization; Operations research; Distributed computing; Artificial intelligence; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.1157917923890393,"gpt":0.3706061346618391,"spread":0.2548143422727998,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001109437,0.0002035124,0.0002175626,0.0002676149,0.0002134901,0.00009897233,0.0003172962,0.0001772216,0.00004228415],"category_scores_gemma":[0.004457312,0.0001953376,0.00004755687,0.0002982331,0.0001737676,0.00006284766,0.00009278124,0.0009728819,0.0003474045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001863509,"about_ca_system_score_gemma":0.00003348296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002163075,"about_ca_topic_score_gemma":0.00001178027,"domain_scores_codex":[0.9979317,0.0001134845,0.0002634043,0.000324563,0.0006631026,0.0007038055],"domain_scores_gemma":[0.9980812,0.00096451,0.00002704646,0.0004700126,0.0002484067,0.0002088274],"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.00002834811,0.00003640441,0.00001307894,0.00006433488,0.00001224042,0.00001123996,0.0000334921,0.9647734,0.0003784398,0.02233451,0.0005628333,0.01175164],"study_design_scores_gemma":[0.0004007374,0.000321242,0.00009483672,0.0000687779,0.000006958322,0.000002559064,0.00002287989,0.9610836,0.006999498,0.02248702,0.008251826,0.0002600435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002426062,0.0001126937,0.9667335,0.0001202833,0.000398613,0.0001906556,0.00001300974,0.0004396876,0.02956548],"genre_scores_gemma":[0.9538261,0.0001884574,0.04463166,0.0000474083,0.0005405835,0.00002362189,0.00004108237,0.00006573179,0.0006353965],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9514,"threshold_uncertainty_score":0.7965638,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091947536","doi":"10.1002/nav.10000","title":"The collection depots location problem on networks","year":2002,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University; University of Toronto","funders":"","keywords":"Facility location problem; Computer science; Operations research; Service (business); Data collection; Set (abstract data type); Mathematical optimization; Transport engineering; Business; Mathematics; Engineering; Statistics; Marketing","retraction":null,"screen_n_in":null,"score":{"opus":0.1689033997130301,"gpt":0.3298235023918266,"spread":0.1609201026787964,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002304864,0.000147267,0.0001085864,0.000265695,0.00145288,0.0005651927,0.00043428,0.00009132439,0.000338556],"category_scores_gemma":[0.002001488,0.0001123337,0.00004795111,0.001704991,0.0002153432,0.0002448756,0.000202661,0.0004666807,0.002407665],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001809105,"about_ca_system_score_gemma":0.00002181803,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001334873,"about_ca_topic_score_gemma":0.001835866,"domain_scores_codex":[0.9976323,0.00008183748,0.0003271236,0.0003501256,0.0010083,0.0006002653],"domain_scores_gemma":[0.9983087,0.0002294951,0.00005954528,0.0004492719,0.0009239805,0.00002905832],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00014842,0.0004043542,0.001100468,0.00020546,0.00004842662,0.000009451486,0.00006112451,0.1031032,0.00002269989,0.3107813,0.5078229,0.07629218],"study_design_scores_gemma":[0.0002784982,0.00005716045,0.00312148,0.00003165466,0.00001216211,3.552026e-7,0.0001577147,0.6726011,0.000008115183,0.006315015,0.3172596,0.00015714],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.01035453,0.001307303,0.0845437,0.03256822,0.003595189,0.004065353,0.000004420786,0.0007001131,0.8628612],"genre_scores_gemma":[0.9851941,0.0004508646,0.0000685454,0.0004917862,0.0008258895,0.0001394169,0.00002281242,0.00002069073,0.01278583],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9748396,"threshold_uncertainty_score":0.9998471,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2903293455","doi":"10.1002/nav.21811","title":"A new computation method for signature: Markov process method","year":2018,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"National Natural Science Foundation of China; China Scholarship Council; McMaster University","keywords":"Signature (topology); Computation; Independent and identically distributed random variables; Markov process; Computer science; Markov chain; Algorithm; Reliability (semiconductor); Process (computing); Component (thermodynamics); Measure (data warehouse); Field (mathematics); Mathematics; Applied mathematics; Theoretical computer science; Data mining; Statistics; Random variable; Physics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.07392465770975362,"gpt":0.4493967958756881,"spread":0.3754721381659345,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003209744,0.0001614385,0.0002237493,0.0001904288,0.0001953535,0.0001152528,0.0002907155,0.0002428934,0.00006049726],"category_scores_gemma":[0.004620703,0.0001502512,0.00006395043,0.0006469013,0.0001273742,0.0001313429,0.00005486275,0.0004962464,0.00003737176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001918794,"about_ca_system_score_gemma":0.0002144013,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000725847,"about_ca_topic_score_gemma":0.00004544008,"domain_scores_codex":[0.9979939,0.0002125807,0.0002826465,0.0003545125,0.0005562464,0.000600072],"domain_scores_gemma":[0.9966969,0.001491807,0.00003623076,0.0002456789,0.001340222,0.0001891699],"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.0003979344,0.00007145059,0.00002218636,0.0007755346,0.00008483448,0.000006226466,0.0008478697,0.5864694,0.005361659,0.01736605,0.07197988,0.316617],"study_design_scores_gemma":[0.000460755,0.0002881412,0.00004972215,0.00004178001,0.00001536234,0.000003353971,0.00008344826,0.9069274,0.007093688,0.0773076,0.007560935,0.0001677776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007094699,0.0001291844,0.9908486,0.0003417328,0.0003839941,0.0008056728,0.00002901188,0.0001998033,0.007191077],"genre_scores_gemma":[0.0874052,0.00005907228,0.9108733,0.00004150109,0.0005959846,0.00008714652,0.00006027707,0.00005315481,0.0008243798],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3204581,"threshold_uncertainty_score":0.6127065,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3206694125","doi":"10.1002/nav.22029","title":"Optimal subsidy design for shore power usage in ship berthing operations","year":2021,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Maritime Transport Emissions and Efficiency","field":"Environmental Science","cited_by":24,"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":"National Natural Science Foundation of China","keywords":"Subsidy; Port (circuit theory); Computer science; Binomial distribution; Operations research; Mathematical optimization; Economics; Engineering; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1541484593492621,"gpt":0.3880518394310475,"spread":0.2339033800817854,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00288612,0.0001407507,0.0001754919,0.00009175044,0.0004759433,0.0001348753,0.0004105449,0.0001454972,0.005064214],"category_scores_gemma":[0.00241394,0.0001295426,0.00006475042,0.000698684,0.0003739883,0.0001416117,0.0002080723,0.0005577566,0.000168795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002813639,"about_ca_system_score_gemma":0.0002259098,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005851503,"about_ca_topic_score_gemma":0.0008815938,"domain_scores_codex":[0.9973164,0.0002457404,0.0003138862,0.0005244565,0.0008017949,0.0007977872],"domain_scores_gemma":[0.9984474,0.000807483,0.00001564932,0.0003745271,0.0001003956,0.0002545504],"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.0003531429,0.001943157,0.03433581,0.00009841557,0.00002726381,0.001407706,0.003922272,0.8604374,0.05607431,0.01675608,0.01384645,0.010798],"study_design_scores_gemma":[0.003572881,0.001829699,0.07672316,0.000310577,0.00005406009,0.00008712069,0.004050765,0.8026619,0.02797172,0.01189184,0.06901204,0.001834279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3480323,0.0004080344,0.5811958,0.003287503,0.0002609628,0.001821209,0.0001470872,0.00008692576,0.06476026],"genre_scores_gemma":[0.9488924,0.00005277216,0.0465093,0.0000670588,0.00003338601,0.00008156759,0.00004757999,0.00002105765,0.004294907],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6008601,"threshold_uncertainty_score":0.9958453,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2121014767","doi":"10.1002/nav.20386","title":"Base‐stock policies in capacitated assembly systems: Convexity properties","year":2009,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"National Science Foundation","keywords":"Convexity; Holding cost; Stock (firearms); Stockout; Time horizon; Operations research; Mathematical optimization; Economic shortage; Computer science; Order (exchange); Economic order quantity; Inventory cost; Regular polygon; Function (biology); Economics; Operations management; Business; Mathematics; Finance; Supply chain; Marketing; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.2784652558371828,"gpt":0.355016285551859,"spread":0.0765510297146762,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003990924,0.0002627089,0.0003576616,0.001165813,0.0004619415,0.001040511,0.0007003861,0.0001627248,0.0001175327],"category_scores_gemma":[0.003977366,0.000233608,0.00007352335,0.001242434,0.0004523657,0.0006813051,0.0002839979,0.0006635083,0.0005444179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004180742,"about_ca_system_score_gemma":0.0001519666,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01210976,"about_ca_topic_score_gemma":0.0008162681,"domain_scores_codex":[0.9962,0.0002070706,0.0005160464,0.0004762122,0.001425331,0.001175339],"domain_scores_gemma":[0.9982456,0.0001799994,0.0001210942,0.0005146787,0.0008753305,0.00006332278],"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.0004679079,0.001083484,0.01657857,0.001489887,0.0000802935,0.0004460559,0.0007791074,0.00262625,0.00423893,0.8026321,0.1647725,0.004804908],"study_design_scores_gemma":[0.004420704,0.0006246881,0.05605062,0.001522979,0.00009041178,0.000007166155,0.01584605,0.2133245,0.0009237981,0.03807724,0.6670271,0.002084777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.491867,0.001636101,0.001596643,0.01208975,0.001603003,0.00381751,0.00002411826,0.0006348889,0.486731],"genre_scores_gemma":[0.9933805,0.00007659881,0.00004751882,0.001134736,0.001058699,0.00008100187,0.00003547228,0.000030475,0.004154971],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7645549,"threshold_uncertainty_score":0.9999965,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2086250731","doi":"10.1002/nav.20068","title":"Shock model in Markovian environment","year":2005,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Shock (circulatory); Markov process; Reliability (semiconductor); Exponential function; Applied mathematics; Exponential distribution; Statistical physics; Markov chain; Mathematics; Magnitude (astronomy); Phase-type distribution; Markovian arrival process; Statistics; Physics; Mathematical analysis; Thermodynamics","retraction":null,"screen_n_in":null,"score":{"opus":0.06579873709004619,"gpt":0.3170136294650935,"spread":0.2512148923750473,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00105241,0.000114882,0.0001342702,0.0001648501,0.00005997052,0.00004074633,0.0002287519,0.0001350245,0.0001209318],"category_scores_gemma":[0.0005022382,0.0001144721,0.00003263101,0.0001876953,0.0001513532,0.0001078919,0.00008886297,0.0005610459,0.0002403145],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006274702,"about_ca_system_score_gemma":0.00004691764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003524595,"about_ca_topic_score_gemma":0.00009099217,"domain_scores_codex":[0.9984064,0.00006168297,0.0002405739,0.0002272223,0.0004968478,0.0005673222],"domain_scores_gemma":[0.9993359,0.0001470597,0.00001046216,0.0003278198,0.00005593976,0.00012285],"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.00001950672,0.00005514012,0.0001423864,0.00003445226,0.000003965968,0.000006976081,0.0001052115,0.9832857,0.0005958684,0.003493286,0.002416992,0.009840484],"study_design_scores_gemma":[0.0002374143,0.00003563857,0.0003464223,0.00001836589,0.000001764112,9.690064e-7,0.00003392913,0.9854395,0.0004549217,0.004864601,0.008446929,0.000119484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04253618,0.0007310379,0.8260594,0.001630686,0.0001915405,0.0009990816,0.00005697276,0.0002710228,0.1275241],"genre_scores_gemma":[0.9781643,0.001421877,0.01876634,0.000027999,0.00009185739,0.00004539291,0.0000171931,0.00002847139,0.001436628],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9356281,"threshold_uncertainty_score":0.4668036,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030345531","doi":"10.1002/nav.21506","title":"Optimal pricing for a short life‐cycle product when customer price‐sensitivity varies over time","year":2012,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Innovation Diffusion and Forecasting","field":"Decision Sciences","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Sensitivity (control systems); Product (mathematics); Product lifecycle; Set (abstract data type); Dynamic pricing; Economics; Econometrics; New product development; Microeconomics; Computer science; Mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.3133588404535415,"gpt":0.4708253001477556,"spread":0.1574664596942141,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["metaresearch","insufficient_payload"],"category_scores_codex":[0.03014894,0.0002583611,0.0004745121,0.0007900454,0.0009597769,0.0006310872,0.000666097,0.000186067,0.00111282],"category_scores_gemma":[0.1111203,0.0001972773,0.0001445227,0.001814533,0.0006679231,0.0006451727,0.0007775736,0.0007781691,0.001363317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001945871,"about_ca_system_score_gemma":0.0004900567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006672826,"about_ca_topic_score_gemma":0.00001003609,"domain_scores_codex":[0.9922348,0.0006686563,0.0008977902,0.0007701407,0.003906291,0.001522268],"domain_scores_gemma":[0.9875095,0.007367841,0.0002076854,0.0008645936,0.003547945,0.0005024186],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001955466,0.002230905,0.04735946,0.000196308,0.0002329354,0.00008694897,0.008254059,0.005239634,0.04869902,0.167099,0.5306139,0.1880323],"study_design_scores_gemma":[0.001832712,0.000637602,0.07356121,0.0001161192,0.00006618279,0.00008173008,0.001463155,0.4645329,0.007998765,0.02749582,0.4207198,0.001493953],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5786782,0.0003374817,0.308382,0.003246464,0.001953566,0.003136141,0.000254033,0.0003078734,0.1037042],"genre_scores_gemma":[0.9724221,0.000005099454,0.01574474,0.0002559569,0.001213523,0.00005455542,0.00002402986,0.00004030995,0.01023968],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4592933,"threshold_uncertainty_score":0.9998003,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3000225146","doi":"10.1002/nav.21885","title":"Schedule design for liner services under vessel speed reduction incentive programs","year":2020,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Maritime Transport Emissions and Efficiency","field":"Environmental Science","cited_by":20,"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":"National Natural Science Foundation of China","keywords":"Schedule; Reduction (mathematics); Minification; Computer science; Limit (mathematics); Nonlinear system; Piecewise linear function; Cost reduction; Incentive; Operations research; Mathematical optimization; Piecewise; Engineering; Mathematics; Business; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.2018412727594271,"gpt":0.374165840108919,"spread":0.1723245673494918,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001393391,0.0001586549,0.0001693764,0.0000459888,0.0004264581,0.0001290738,0.0005644244,0.0001548122,0.001018189],"category_scores_gemma":[0.000236915,0.0001341161,0.000065944,0.0006901029,0.0005309971,0.0001512332,0.0002154207,0.0004418229,0.0003787572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001576718,"about_ca_system_score_gemma":0.00008135983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005527012,"about_ca_topic_score_gemma":0.00001395597,"domain_scores_codex":[0.9972697,0.0001363136,0.0002595434,0.0005599859,0.001090158,0.000684285],"domain_scores_gemma":[0.9990311,0.0001634886,0.00005311263,0.0002421751,0.0001181104,0.000392045],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.004167778,0.005865613,0.01540688,0.00184853,0.0002313853,0.000190473,0.007402147,0.2627597,0.4991502,0.02523118,0.07288317,0.104863],"study_design_scores_gemma":[0.003152479,0.003823678,0.009187982,0.0002353581,0.0001080499,0.00001197732,0.00490433,0.7684864,0.03671237,0.02459437,0.1475005,0.001282491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.297215,0.0003478815,0.6528553,0.0190764,0.0005360377,0.005816866,0.0001170919,0.0004304757,0.02360496],"genre_scores_gemma":[0.9810422,0.00006082815,0.01748422,0.000105072,0.0002510444,0.00005298496,0.00006929743,0.00002726015,0.0009070841],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6838272,"threshold_uncertainty_score":0.999895,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2085632850","doi":"10.1002/nav.20173","title":"Inventory control and periodic price discounting campaigns","year":2006,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Discounting; Inventory control; Economics; Order (exchange); Perpetual inventory; Inventory valuation; Inventory theory; Econometrics; Distribution (mathematics); Constant (computer programming); Economic order quantity; Microeconomics; Computer science; Mathematics; Operations management; Business; Marketing; Supply chain","retraction":null,"screen_n_in":null,"score":{"opus":0.06124910798283708,"gpt":0.3041215364402198,"spread":0.2428724284573827,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002948709,0.0002547822,0.0002837409,0.0005739704,0.0007418907,0.001049037,0.0004614863,0.0001137678,0.0003378669],"category_scores_gemma":[0.001289292,0.0002326706,0.00008048265,0.0006511889,0.0006449617,0.0006035233,0.000522469,0.000525376,0.0004608031],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001688413,"about_ca_system_score_gemma":0.00006847631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002518312,"about_ca_topic_score_gemma":0.00033753,"domain_scores_codex":[0.996779,0.00008280712,0.0004071328,0.0005462538,0.001202669,0.0009821865],"domain_scores_gemma":[0.9987115,0.0002491065,0.0001464642,0.0003979405,0.0004444123,0.00005053434],"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.0002338998,0.0005628055,0.1619032,0.001228676,0.0001038816,0.0002871829,0.0001687353,0.0004650373,0.002101967,0.6841135,0.1449684,0.003862685],"study_design_scores_gemma":[0.002978003,0.000106352,0.03977882,0.0001631747,0.00009869833,0.000005051895,0.002092622,0.06015782,0.00004202975,0.05215504,0.8415841,0.0008383057],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3885826,0.001837922,0.01074129,0.004157889,0.001414851,0.002336997,0.00003219476,0.0005175281,0.5903788],"genre_scores_gemma":[0.9923791,0.00003048572,0.0001001694,0.0008781066,0.002520866,0.00007262441,0.00004814142,0.00004608136,0.003924401],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6966157,"threshold_uncertainty_score":0.999988,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2130762776","doi":"10.1002/nav.20093","title":"A dynamic allocation heuristic for centralized safety stock","year":2005,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stock (firearms); Computer science; Heuristic; Economic shortage; Safety stock; Operations research; Upper and lower bounds; Mathematical optimization; Operations management; Mathematics; Supply chain; Business; Economics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.1193222032691538,"gpt":0.3778237813262478,"spread":0.258501578057094,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002500227,0.0002278369,0.0002551512,0.0004742963,0.0005434845,0.0004267194,0.0006073761,0.0001159294,0.0005875418],"category_scores_gemma":[0.00285375,0.0002191107,0.000124984,0.0006010801,0.0002303688,0.0004394317,0.0003384029,0.000345805,0.000884543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004503643,"about_ca_system_score_gemma":0.0000827815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003026938,"about_ca_topic_score_gemma":0.0003840808,"domain_scores_codex":[0.9970105,0.00005882769,0.0004592605,0.0005114281,0.0009873848,0.000972597],"domain_scores_gemma":[0.9982002,0.0003839987,0.000131389,0.0004823536,0.0007462189,0.00005581699],"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.001395555,0.0009409757,0.001098485,0.001320852,0.0001679458,0.00003137933,0.0001733047,0.005436335,0.0008903371,0.6513369,0.2381893,0.09901866],"study_design_scores_gemma":[0.001392805,0.0000536391,0.001316749,0.00004600014,0.00004015205,6.126877e-7,0.0001908776,0.3028583,0.00002593091,0.01316121,0.6806587,0.0002549975],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03828643,0.001639931,0.5908931,0.04696891,0.004276275,0.0136081,0.0002406086,0.001485341,0.3026013],"genre_scores_gemma":[0.986277,0.0001103723,0.002338236,0.001115804,0.001429708,0.0002199633,0.0003648184,0.00006081147,0.008083225],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9479907,"threshold_uncertainty_score":0.9998934,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077698456","doi":"10.1002/nav.20066","title":"On the asymptotic optimality of algorithms for the flow shop problem with release dates","year":2005,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Heuristics; Heuristic; Probabilistic logic; Focus (optics); Probabilistic analysis of algorithms; Computer science; Mathematical optimization; Asymptotically optimal algorithm; Algorithm; Flow (mathematics); Flow shop scheduling; Analysis of algorithms; Mathematics; Artificial intelligence; Job shop scheduling; Routing (electronic design automation)","retraction":null,"screen_n_in":null,"score":{"opus":0.09894512376433645,"gpt":0.3454533077296663,"spread":0.2465081839653298,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002197785,0.0001706155,0.0001821716,0.00009294562,0.000304325,0.0001061729,0.0005452765,0.00009743235,0.00007952948],"category_scores_gemma":[0.002157826,0.00009213372,0.00006150922,0.0004409533,0.0003895987,0.00005856093,0.0000670848,0.0006080859,0.00003856865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001061354,"about_ca_system_score_gemma":0.0001154872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002695583,"about_ca_topic_score_gemma":0.00002007894,"domain_scores_codex":[0.9980602,0.0001180983,0.0002819036,0.0002411588,0.0007866404,0.0005119991],"domain_scores_gemma":[0.9950193,0.003688088,0.00004071343,0.0005677834,0.0005713803,0.0001127249],"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.00009376884,0.00006984653,0.00002166328,0.0000613797,0.00006971913,0.00000233346,0.0001364941,0.9739763,0.0000375274,0.009592044,0.002244608,0.01369436],"study_design_scores_gemma":[0.0004320864,0.000248101,0.00005223842,0.00005405503,0.00002300037,0.000002908686,0.0001712918,0.9945313,0.001782627,0.001249796,0.001327721,0.0001249279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003787168,0.000595858,0.9852685,0.003143904,0.0001699378,0.001477602,0.0001934518,0.000208556,0.005155034],"genre_scores_gemma":[0.6991305,0.0002470169,0.2992513,0.00007895478,0.0003493357,0.0002198564,0.00004167649,0.00006865998,0.0006127286],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6953433,"threshold_uncertainty_score":0.3757104,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003584295","doi":"10.1002/nav.10047","title":"Analysis of a finite‐buffer bulk‐service queue with discrete‐Markovian arrival process: D‐MAP/<i>G</i><sup><i>a,b</i></sup>/1/<i>N</i>","year":2003,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markovian arrival process; Queue; Markov chain; Computer science; Markov process; Process (computing); Real-time computing; Random variable; Service (business); Queueing theory; Discrete time and continuous time; Algorithm; Applied mathematics; Mathematical optimization; Computer network; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.04644666103468515,"gpt":0.3287920339748899,"spread":0.2823453729402047,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004622542,0.0005934056,0.001139414,0.002266124,0.000637,0.0004576075,0.001332711,0.0002638971,0.0008306185],"category_scores_gemma":[0.008572642,0.0004932337,0.000362424,0.0112864,0.0008914688,0.0009717655,0.0003922262,0.001152754,0.0002843488],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001651017,"about_ca_system_score_gemma":0.0003063386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001146202,"about_ca_topic_score_gemma":0.001106522,"domain_scores_codex":[0.9935884,0.0003658499,0.0009154556,0.001179631,0.002476765,0.001473912],"domain_scores_gemma":[0.9927802,0.001775705,0.0005349526,0.001452645,0.003309684,0.0001468114],"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.002029611,0.001021202,0.0324355,0.001866447,0.003917291,0.0003230908,0.0008209512,0.790019,0.0005058018,0.1644332,0.001453253,0.001174643],"study_design_scores_gemma":[0.004321518,0.0005120935,0.001465993,0.0007560696,0.008303167,0.00001041525,0.007807294,0.7569242,0.001621954,0.1282974,0.08699495,0.002984969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5565393,0.001138083,0.207899,0.005366896,0.000465681,0.003898976,0.0004441301,0.001153093,0.2230948],"genre_scores_gemma":[0.9959947,0.00003286159,0.001258196,0.0009757214,0.0004049937,0.0001082458,0.0002444406,0.0001158244,0.0008650438],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4394554,"threshold_uncertainty_score":0.9997786,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}