{"meta":{"query_hash":"00ca961d5c73","filters":{"venue":"Naval Research Logistics (NRL)"},"cohort_total":112,"direct_labels_cover":0,"predictions_cover":112,"exported":112,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/00ca961d5c73","api":"https://metacan.xera.ac/api/v1/cohort?venue=Naval+Research+Logistics+%28NRL%29"},"results":[{"id":"W1870907521","doi":"10.1002/nav.21662","title":"Tests for homogeneity of distributions of component lifetimes from system lifetime data with known system signatures","year":2015,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Statistical Distribution Estimation and Applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Nonparametric statistics; Homogeneity (statistics); Parametric statistics; Estimator; Monte Carlo method; Statistic; Computer science; Component (thermodynamics); Applied mathematics; Mathematics; Statistics; Physics","score_opus":0.3975805029814286,"score_gpt":0.4827586505962704,"score_spread":0.08517814761484177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1870907521","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6564063,0.0003597006,0.33902183,0.00035402522,0.000040118226,0.00014049052,0.0006785451,0.00025204985,0.002746863],"genre_scores_gemma":[0.987936,0.00005472497,0.011228985,0.000033307413,0.000035554665,0.00008750598,0.00040992213,0.00001946634,0.00019452749],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9768446,0.012017145,0.0013844668,0.0033090734,0.0056754583,0.00076918304],"domain_scores_gemma":[0.631565,0.32485625,0.02025004,0.014992865,0.0072764144,0.0010594272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03315302,0.00048366206,0.0011679962,0.002826165,0.0007043066,0.0018400326,0.0020781157,0.0013322941,0.002685043],"category_scores_gemma":[0.18890606,0.00035548978,0.00084753067,0.0024537235,0.0032118093,0.0042280187,0.00209038,0.0015594199,0.00049260876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024660206,0.0006174307,0.45141995,0.0006052467,0.0012580496,0.0010088065,0.0020518329,0.2150356,0.015782652,0.0557738,0.0015656799,0.25241482],"study_design_scores_gemma":[0.00016103974,0.0017563375,0.24575995,0.00014480736,0.00027513487,0.0011919977,0.0018368522,0.62973696,0.023084132,0.09241441,0.0034293327,0.00020901635],"about_ca_topic_score_codex":0.0011802152,"about_ca_topic_score_gemma":0.0005468915,"teacher_disagreement_score":0.03315302,"about_ca_system_score_codex":0.0010726225,"about_ca_system_score_gemma":0.0011994707,"threshold_uncertainty_score":0.17533201},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.12423547018829438,"score_gpt":0.35263074779858056,"score_spread":0.22839527761028616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963737229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04174467,0.00022449924,0.9526108,0.00056091335,0.000022943666,0.000062066225,0.000055315835,0.00013572979,0.0045830416],"genre_scores_gemma":[0.62980145,0.00024360736,0.36505753,0.00007881358,0.000041014715,0.00015219965,0.00008740691,0.00007006537,0.004467926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996302,0.00020164484,0.000014790173,0.000046585283,0.00007072232,0.00003611874],"domain_scores_gemma":[0.9985921,0.0011104273,0.0000732221,0.000045740628,0.00012768629,0.00005077857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001637454,0.0006405257,0.0008616093,0.0005604521,0.00041236548,0.0011656726,0.0008487186,0.0013681523,0.004305083],"category_scores_gemma":[0.0043130536,0.000447777,0.0005513072,0.00051307864,0.00085386867,0.001418183,0.0010377329,0.0011247488,0.0002514077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000467092,0.000028026549,0.00039814448,0.000021886379,0.000012510985,0.000069372996,0.00004232928,0.9458377,0.0002995126,0.037726242,0.00043620137,0.015081317],"study_design_scores_gemma":[0.0000084161065,0.0000075056705,0.000030399038,0.0000035613143,0.0000012634139,0.000008113104,0.0000049687055,0.9925404,0.00009686414,0.007076116,0.00022025948,0.0000021602666],"about_ca_topic_score_codex":0.0046544736,"about_ca_topic_score_gemma":0.0031151387,"teacher_disagreement_score":0.0046544736,"about_ca_system_score_codex":0.0012819269,"about_ca_system_score_gemma":0.0010779261,"threshold_uncertainty_score":0.014401972},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.05179451081522327,"score_gpt":0.31450936148794056,"score_spread":0.26271485067271727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964000286","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12085265,0.0011519464,0.8445019,0.0010912319,0.00016169166,0.00006857695,0.00033407396,0.00029658046,0.031541396],"genre_scores_gemma":[0.9029692,0.0015323048,0.07862621,0.00022866575,0.00050807366,0.00010749962,0.0003048567,0.00022333869,0.015499842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982256,0.0005234334,0.00014220859,0.0004155435,0.00048453207,0.00020866621],"domain_scores_gemma":[0.99055415,0.0045644855,0.0017037346,0.0013193412,0.0012235144,0.00063488167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039218175,0.0007665189,0.0007965113,0.0017140759,0.001081229,0.0027822147,0.0010221204,0.0005320251,0.0037193843],"category_scores_gemma":[0.016056154,0.000402378,0.0013930484,0.0016685225,0.0037150807,0.0041712327,0.0025973914,0.0025946035,0.00046094783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008794829,0.000025436802,0.00058579684,0.000053217827,0.000023558045,0.00018363487,0.00022321874,0.022755558,0.003164418,0.9520296,0.0008531381,0.020014497],"study_design_scores_gemma":[0.000019246394,0.00009784142,0.00070093764,0.000026970565,0.00002622284,0.00025593254,0.00011285809,0.11172873,0.00420311,0.87906307,0.0037356878,0.000029374685],"about_ca_topic_score_codex":0.0018262994,"about_ca_topic_score_gemma":0.0013709364,"teacher_disagreement_score":0.0039218175,"about_ca_system_score_codex":0.0014907179,"about_ca_system_score_gemma":0.0012038104,"threshold_uncertainty_score":0.020740807},"labels":[],"label_agreement":null},{"id":"W1964398475","doi":"10.1002/nav.20065","title":"Scheduling and lot streaming in two‐machine open shops with no‐wait in process","year":2005,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; McMaster University; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; University of Texas at Dallas","keywords":"Travelling salesman problem; Open shop; Job shop scheduling; Computer science; Scheduling (production processes); Schedule; Mathematical optimization; Heuristic; Open-shop scheduling; Product (mathematics); Process (computing); Sequence (biology); Operations research; Flow shop scheduling; Artificial intelligence; Mathematics; Algorithm; Operating system","score_opus":0.06277714681801318,"score_gpt":0.39091044203848735,"score_spread":0.3281332952204742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964398475","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5647561,0.000437001,0.4307413,0.00019403502,0.000046807414,0.00021238816,0.00014046342,0.00027174354,0.0032001191],"genre_scores_gemma":[0.9512411,0.00010951681,0.04702737,0.000023839539,0.000025381316,0.000071386385,0.0001240839,0.000029856574,0.0013474973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992969,0.00028333298,0.000037122976,0.000110162546,0.00014831005,0.00012413366],"domain_scores_gemma":[0.99759763,0.0014901068,0.00030842694,0.00015874686,0.00016647941,0.0002784835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015827202,0.00058264256,0.00095887174,0.00033684424,0.00046647465,0.0007052449,0.0009713762,0.00048055276,0.0019836014],"category_scores_gemma":[0.002766467,0.0004649528,0.0005885863,0.0006522223,0.0007401638,0.001454344,0.0007318475,0.0005301266,0.00015982306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007818461,0.0003021293,0.0016424113,0.0001836389,0.00006520123,0.00036235625,0.00014936802,0.94844735,0.0076043154,0.014154232,0.0005206581,0.025786497],"study_design_scores_gemma":[0.000057165642,0.00020231698,0.0004421404,0.0000055389537,0.000013329001,0.000049717364,0.000030842108,0.9854091,0.0018630176,0.011520225,0.00039805708,0.000008563646],"about_ca_topic_score_codex":0.002024126,"about_ca_topic_score_gemma":0.001411787,"teacher_disagreement_score":0.002024126,"about_ca_system_score_codex":0.00064271735,"about_ca_system_score_gemma":0.0005782019,"threshold_uncertainty_score":0.00837034},"labels":[],"label_agreement":null},{"id":"W1966591675","doi":"10.1002/nav.10010","title":"Duality in constrained multi‐facility location models","year":2002,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Facility location problem; Dual (grammatical number); Lagrangian; Mathematical optimization; Duality (order theory); Differentiable function; Computer science; Lagrangian relaxation; Norm (philosophy); Strong duality; Applied mathematics; Mathematics; Optimization problem; Combinatorics; Mathematical analysis","score_opus":0.4383456549586343,"score_gpt":0.3826477963674146,"score_spread":0.05569785859121973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966591675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037299685,0.0010375986,0.9352462,0.001568486,0.0001169594,0.00006279292,0.00039216582,0.00011531402,0.024160804],"genre_scores_gemma":[0.91626585,0.0011995808,0.07135615,0.0002624723,0.00015772154,0.00023975926,0.0003989737,0.00008341293,0.010036091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979607,0.0012976984,0.000045783036,0.00019938103,0.00026045338,0.00023605589],"domain_scores_gemma":[0.9976986,0.0014341129,0.0003096758,0.00012703106,0.00025674838,0.00017374981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029706412,0.0008374709,0.0016833448,0.0010283251,0.0007051817,0.002929026,0.0014998706,0.0018521573,0.0054075825],"category_scores_gemma":[0.0063922415,0.0009264034,0.0009875454,0.0017860221,0.00174774,0.0028504774,0.0022547632,0.0017750645,0.0004962381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004513774,0.00003253556,0.0001836571,0.000061644685,0.00002411436,0.00008257085,0.0000350206,0.8024496,0.00009488388,0.19051805,0.001960407,0.0045123836],"study_design_scores_gemma":[0.000017040422,0.000016177673,0.000059369242,0.000016470358,0.000005286711,0.000029439701,0.000024592537,0.8981554,0.000055976707,0.100196175,0.0014175241,0.0000065783324],"about_ca_topic_score_codex":0.004338677,"about_ca_topic_score_gemma":0.0029804332,"teacher_disagreement_score":0.0054075825,"about_ca_system_score_codex":0.0025518674,"about_ca_system_score_gemma":0.0015297972,"threshold_uncertainty_score":0.01851517},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.057708003680430456,"score_gpt":0.3608492425199466,"score_spread":0.30314123883951616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967061907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49451715,0.00048243345,0.4955511,0.00077245577,0.000097199314,0.00007260388,0.0001261732,0.00025964892,0.008121213],"genre_scores_gemma":[0.9898553,0.00008990354,0.008592493,0.000029394701,0.00003022327,0.000015401714,0.000035606758,0.000019376308,0.0013321945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994549,0.000104399696,0.000011164763,0.00005574944,0.00023118168,0.00014260631],"domain_scores_gemma":[0.99773586,0.0011181113,0.000392389,0.000069581336,0.00044486104,0.00023917435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013518358,0.00032983406,0.00055656,0.00078382145,0.00042205624,0.0010068004,0.00090699946,0.00032709466,0.0017350536],"category_scores_gemma":[0.003896277,0.00031432047,0.00032112657,0.00043812933,0.0008246707,0.0007398094,0.00050478877,0.0007674993,0.00014344617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017246784,0.000062641666,0.0026558524,0.00005883186,0.00004228413,0.00030680312,0.00017542271,0.86728334,0.007667423,0.11087443,0.0012591265,0.009441423],"study_design_scores_gemma":[0.0000022793117,0.000006685483,0.00018956787,0.000001117249,0.0000018284975,0.00000889367,0.0000072571065,0.9972869,0.00018709828,0.00222777,0.00007776631,0.0000028030292],"about_ca_topic_score_codex":0.008853198,"about_ca_topic_score_gemma":0.0041297595,"teacher_disagreement_score":0.008853198,"about_ca_system_score_codex":0.0019689782,"about_ca_system_score_gemma":0.0012593948,"threshold_uncertainty_score":0.017603338},"labels":[],"label_agreement":null},{"id":"W1967496564","doi":"10.1002/nav.20185","title":"Stochastic programming models for replication of electricity forward contracts for industry","year":2006,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Electric Power System Optimization","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of New Brunswick","funders":"","keywords":"Forward contract; Spot market; Spot contract; Arbitrage; Procurement; Electricity; Stochastic programming; Electricity market; Economics; Forward price; Database transaction; Microeconomics; Forward market; Computer science; Operations research; Industrial organization; Mathematical optimization; Futures contract; Financial economics","score_opus":0.08350826714057481,"score_gpt":0.35848784185826027,"score_spread":0.27497957471768547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967496564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08057325,0.0012919892,0.8925607,0.0024895244,0.00014421849,0.00019615922,0.0007115251,0.00035608705,0.021676542],"genre_scores_gemma":[0.9029572,0.0011312126,0.060805127,0.00030801288,0.00014178763,0.0005646507,0.0006684901,0.00019296067,0.03323056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978155,0.0012060027,0.00008535955,0.0003037912,0.00028604074,0.0003032048],"domain_scores_gemma":[0.98941505,0.00804397,0.0010954054,0.00033621932,0.00068340625,0.00042599742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052483827,0.0015264577,0.0019261874,0.0010130405,0.0008018532,0.002736614,0.0023706644,0.0031196123,0.01087134],"category_scores_gemma":[0.017387083,0.0013603288,0.0017029324,0.0012808223,0.0018435279,0.0028458852,0.0015549769,0.0034631372,0.0009224144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028455564,0.000019929683,0.00020901584,0.00001850952,0.000014742377,0.000047679925,0.000030056699,0.92558926,0.00009478379,0.07162033,0.00067634904,0.0016508917],"study_design_scores_gemma":[0.000009668148,0.000009837609,0.00004131653,0.0000042815573,0.000003404673,0.000006327418,0.000009173945,0.97108644,0.00002088523,0.028437657,0.0003654751,0.0000054708084],"about_ca_topic_score_codex":0.016675716,"about_ca_topic_score_gemma":0.009062931,"teacher_disagreement_score":0.016675716,"about_ca_system_score_codex":0.0039779865,"about_ca_system_score_gemma":0.0019209991,"threshold_uncertainty_score":0.03636831},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.30331575053801735,"score_gpt":0.4600390073891456,"score_spread":0.15672325685112826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976621663","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18890953,0.00019957409,0.80844057,0.00041099673,0.000026030793,0.00043789527,0.000034978457,0.00013835738,0.0014020193],"genre_scores_gemma":[0.63281524,0.000084869855,0.36544657,0.00012618068,0.000029018483,0.000916806,0.00006261301,0.000057925463,0.0004607067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9738176,0.021688905,0.00072501734,0.0014457756,0.0016923144,0.00063040474],"domain_scores_gemma":[0.93492216,0.0541079,0.004076393,0.0035687736,0.0025837484,0.00074088346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024929902,0.00076200924,0.0022072154,0.0011209528,0.0005416991,0.0012293245,0.0016871707,0.0013903063,0.0019457726],"category_scores_gemma":[0.08432195,0.00056326075,0.00050716475,0.00084851,0.002362899,0.0019975435,0.0022517412,0.0015717391,0.0003495469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0061299265,0.0017685482,0.019055253,0.0005359796,0.00028265183,0.0003331968,0.0008049522,0.4382391,0.029718744,0.13989899,0.0013079302,0.3619248],"study_design_scores_gemma":[0.00077206135,0.0022155398,0.015104772,0.00010259286,0.000072738956,0.00013571916,0.0002833632,0.7930954,0.017783688,0.16874851,0.0015712386,0.00011436735],"about_ca_topic_score_codex":0.000447779,"about_ca_topic_score_gemma":0.00033678339,"teacher_disagreement_score":0.024929902,"about_ca_system_score_codex":0.0011555067,"about_ca_system_score_gemma":0.0010935985,"threshold_uncertainty_score":0.13184345},"labels":[],"label_agreement":null},{"id":"W1982007135","doi":"10.1002/nav.21537","title":"Analysis of the finite‐source multiclass priority queue with an unreliable server and setup time","year":2013,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Queue; Queueing theory; Service (business); Class (philosophy); Duration (music); Process (computing); Operations research; Population; Queueing system; Real-time computing; Mathematical optimization; Computer network; Mathematics; Operating system; Artificial intelligence","score_opus":0.04220800871140818,"score_gpt":0.31111681109413525,"score_spread":0.2689088023827271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982007135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42740825,0.0007919086,0.56330854,0.0010949181,0.0001663331,0.000079603175,0.0001339123,0.00046080872,0.0065556895],"genre_scores_gemma":[0.9888601,0.00014173871,0.0088219,0.00004207579,0.00006511502,0.00002563478,0.000039730206,0.000038045637,0.0019657079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879444,0.00031213497,0.000034432647,0.00012888602,0.0004539783,0.00027614727],"domain_scores_gemma":[0.9943387,0.0035463837,0.0008062569,0.0002131685,0.00073762325,0.00035785005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031147064,0.0006308567,0.0009977748,0.001202197,0.00087966403,0.0019306237,0.002438762,0.0009768528,0.0021553433],"category_scores_gemma":[0.0077126166,0.0006200694,0.000727602,0.00085131207,0.0015376762,0.0015539179,0.000954961,0.0013872029,0.00019358327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012447675,0.000075727905,0.0014556436,0.0000615795,0.000047499896,0.00035554325,0.0001449235,0.9347655,0.003168959,0.054826993,0.0006418201,0.00433129],"study_design_scores_gemma":[0.0000055058067,0.000008703301,0.00010814068,0.0000020725272,0.000004884801,0.000014191289,0.000009443416,0.9974861,0.0000949783,0.0022010987,0.00006066848,0.0000041919175],"about_ca_topic_score_codex":0.015135604,"about_ca_topic_score_gemma":0.0060808673,"teacher_disagreement_score":0.015135604,"about_ca_system_score_codex":0.0037205205,"about_ca_system_score_gemma":0.0024134745,"threshold_uncertainty_score":0.03009504},"labels":[],"label_agreement":null},{"id":"W1988827780","doi":"10.1002/nav.20387","title":"A multiobjective coverage‐based model for Civilian search and rescue","year":2009,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Backup; Integer programming; Operations research; Search and rescue; Genetic algorithm; Computer science; Mathematical optimization; Aviation; Set (abstract data type); Software; Service (business); Engineering; Mathematics; Business; Algorithm; Artificial intelligence; Machine learning; Database; Operating system","score_opus":0.2170046447746286,"score_gpt":0.3952744577784756,"score_spread":0.17826981300384698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988827780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12155247,0.0010291428,0.84653986,0.0009785055,0.000101100464,0.00018253163,0.0006694072,0.0002743249,0.028672788],"genre_scores_gemma":[0.9369808,0.00052366225,0.046972487,0.00010482862,0.000032481825,0.00036825778,0.00032105896,0.000058510737,0.014637817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994137,0.0002576763,0.000017746259,0.000102638194,0.00009051036,0.00011765652],"domain_scores_gemma":[0.99915886,0.0005209649,0.00011485712,0.00002773865,0.00010892888,0.000068631685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011554345,0.001149962,0.0011571385,0.0010424277,0.0005674863,0.0018908583,0.0021243505,0.0023069035,0.0062240697],"category_scores_gemma":[0.0020674535,0.00070123887,0.0011110165,0.0012527466,0.0011204717,0.001238247,0.0011220746,0.0012294422,0.0006154203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011980873,0.000009620377,0.000092652954,0.0000108249205,0.0000094594,0.000027638607,0.000012698038,0.9951965,0.000093819624,0.0034625842,0.000121569065,0.0009506288],"study_design_scores_gemma":[0.0000070363703,0.000010896751,0.000044597327,0.0000031065188,0.0000037081293,0.0000051009833,0.000008205031,0.998164,0.000023519458,0.001564128,0.00016332437,0.000002518184],"about_ca_topic_score_codex":0.023585223,"about_ca_topic_score_gemma":0.01020559,"teacher_disagreement_score":0.023585223,"about_ca_system_score_codex":0.0025660624,"about_ca_system_score_gemma":0.0014229423,"threshold_uncertainty_score":0.04689592},"labels":[],"label_agreement":null},{"id":"W1990317354","doi":"10.1002/nav.10102","title":"Effects of lethality in naval combat models","year":2003,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Military Defense Systems Analysis","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lethality; Offensive; Context (archaeology); Operations research; Computer science; Balance (ability); Engineering; Psychology; History; Biology","score_opus":0.07271698726149724,"score_gpt":0.32600094179331723,"score_spread":0.25328395453182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990317354","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8631554,0.0008238272,0.09206199,0.0024963878,0.00012135315,0.00006895397,0.00034338643,0.0001633228,0.04076544],"genre_scores_gemma":[0.9964897,0.00018800091,0.00096469437,0.0000706943,0.000024127768,0.000018727305,0.00003279796,0.000010516824,0.0022007262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979081,0.0014052794,0.000044935325,0.00007860619,0.0002459084,0.00031713053],"domain_scores_gemma":[0.9884792,0.008062378,0.0019038185,0.00035343642,0.00037509113,0.0008260954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021592674,0.0014428124,0.00092623034,0.0010572599,0.0006921893,0.0022088354,0.0010292351,0.0008786906,0.006424775],"category_scores_gemma":[0.012403068,0.00038910427,0.00077801745,0.00041864102,0.0026421642,0.0018295636,0.0027118744,0.0020180629,0.00034344647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019994017,0.00006263642,0.0024196487,0.00004764632,0.000041677285,0.00022703121,0.000087032,0.9147969,0.0007721683,0.07841838,0.0004418505,0.0024850986],"study_design_scores_gemma":[0.00015149126,0.00045244992,0.0015675079,0.000046054593,0.00005747986,0.000082770915,0.00020931309,0.9257281,0.0006558237,0.07006571,0.0009296312,0.000053684424],"about_ca_topic_score_codex":0.003991793,"about_ca_topic_score_gemma":0.002235196,"teacher_disagreement_score":0.006424775,"about_ca_system_score_codex":0.0011506715,"about_ca_system_score_gemma":0.0006063048,"threshold_uncertainty_score":0.021493018},"labels":[],"label_agreement":null},{"id":"W1997855661","doi":"10.1002/nav.21531","title":"Some implications of pricing bundles","year":2013,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Business; Mathematics; Computer science","score_opus":0.141275996853924,"score_gpt":0.3696973861094222,"score_spread":0.2284213892554982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997855661","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56886375,0.002575087,0.22355407,0.016076822,0.00040978988,0.00022544569,0.00022766211,0.00019835326,0.18786901],"genre_scores_gemma":[0.9891206,0.00031643218,0.0073071923,0.00029796385,0.00011633211,0.00003978364,0.00003787434,0.000030024195,0.002733724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99608994,0.0022064229,0.0001065956,0.0003833632,0.00073880714,0.00047490973],"domain_scores_gemma":[0.98729473,0.00813299,0.0012933608,0.0012696394,0.001262002,0.00074727775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037027663,0.0006963418,0.0010413701,0.0006514312,0.0019893083,0.0032375185,0.0018650522,0.003243183,0.01594235],"category_scores_gemma":[0.020440925,0.0005401019,0.0010671477,0.0012567994,0.0032615578,0.006246801,0.0023405866,0.0031565966,0.0006257435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028543652,0.00040769888,0.004078749,0.00014488827,0.00008856624,0.0005543066,0.00039930517,0.21539101,0.0018585962,0.7356432,0.0063169943,0.034831304],"study_design_scores_gemma":[0.00008113502,0.00023645765,0.0017247968,0.000063037725,0.000031289168,0.00030866932,0.0005791843,0.26070905,0.00063896744,0.7290877,0.0065062707,0.00003345591],"about_ca_topic_score_codex":0.0020294723,"about_ca_topic_score_gemma":0.0013516981,"teacher_disagreement_score":0.01594235,"about_ca_system_score_codex":0.001892087,"about_ca_system_score_gemma":0.0009965303,"threshold_uncertainty_score":0.053332508},"labels":[],"label_agreement":null},{"id":"W1998610558","doi":"10.1002/nav.20486","title":"Irreducibility of joint inventory positions in an assemble‐to‐order system under (<i>r, nQ</i>) policies","year":2011,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada; Hong Kong Polytechnic University; National Science Council","keywords":"Irreducibility; Markov chain; Diophantine equation; Supply chain; Computer science; Order (exchange); Measure (data warehouse); Operations research; Context (archaeology); Stationary distribution; Purchasing; Mathematics; Mathematical optimization; Operations management; Discrete mathematics; Business; Economics; Marketing; Pure mathematics; Finance; Data mining","score_opus":0.3599092297887334,"score_gpt":0.38096008462883396,"score_spread":0.021050854840100552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998610558","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7237651,0.00020237043,0.26005086,0.0010910785,0.00005359619,0.00008632314,0.00031496593,0.00036132414,0.01407446],"genre_scores_gemma":[0.9932836,0.00007899896,0.005428049,0.000042987464,0.000019124167,0.000028073708,0.00005032304,0.000017881053,0.0010508918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968645,0.0005832816,0.00030401442,0.0005924083,0.00083419314,0.00082152965],"domain_scores_gemma":[0.98514557,0.009139738,0.0024844501,0.0011444913,0.0012105685,0.0008752648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045264587,0.0004666781,0.001136837,0.0010711249,0.0014939309,0.0031002187,0.0010943395,0.0009553609,0.004025276],"category_scores_gemma":[0.014906364,0.00066630944,0.0010467363,0.0007013508,0.004707197,0.0031567465,0.0019438594,0.0032240713,0.00029902707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023369075,0.00015623648,0.0045878235,0.00009714886,0.000039537666,0.0010394837,0.0012946816,0.103194445,0.007557145,0.8736369,0.0006336479,0.0075293737],"study_design_scores_gemma":[0.00009365164,0.00017355949,0.0019866736,0.000042020274,0.00003650586,0.00033767504,0.00030843238,0.5135996,0.0059974096,0.47604814,0.0013042603,0.000072100745],"about_ca_topic_score_codex":0.004630338,"about_ca_topic_score_gemma":0.0024670535,"teacher_disagreement_score":0.004630338,"about_ca_system_score_codex":0.0029702897,"about_ca_system_score_gemma":0.0031426328,"threshold_uncertainty_score":0.023938477},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.31974005409670986,"score_gpt":0.47423334750431967,"score_spread":0.1544932934076098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002649216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46659046,0.0005798069,0.5252471,0.0002614455,0.00012908148,0.000132883,0.00049002474,0.0005996896,0.0059695416],"genre_scores_gemma":[0.9697502,0.00006833254,0.02942532,0.000027506478,0.000032728487,0.000061571736,0.00016204471,0.00004448621,0.00042786662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99280614,0.0029996245,0.00060091005,0.00074523746,0.0024926574,0.000355606],"domain_scores_gemma":[0.96233225,0.017802987,0.009989284,0.0051919343,0.003915452,0.0007681037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077801133,0.0005391486,0.0008371578,0.005403824,0.0004905445,0.0021013212,0.0015591541,0.0008267495,0.001550004],"category_scores_gemma":[0.050908256,0.00034243835,0.0006213594,0.0034133692,0.0025082808,0.0038681102,0.0029598202,0.0010668442,0.00022066462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017002033,0.0002886021,0.053900983,0.0002993784,0.0002832721,0.000594649,0.0013265541,0.3133027,0.013938968,0.39287716,0.0012185153,0.22026905],"study_design_scores_gemma":[0.000053395488,0.0011923324,0.015747098,0.00010433543,0.000082492275,0.00070677017,0.00066590664,0.7073613,0.019060595,0.24981594,0.0050499286,0.00015984655],"about_ca_topic_score_codex":0.0006782024,"about_ca_topic_score_gemma":0.00028213492,"teacher_disagreement_score":0.0077801133,"about_ca_system_score_codex":0.0014751084,"about_ca_system_score_gemma":0.00091584807,"threshold_uncertainty_score":0.041145682},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.14087531748671844,"score_gpt":0.41545761447948104,"score_spread":0.2745822969927626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003554734","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8948722,0.0009655663,0.09559994,0.00046943195,0.00006540489,0.00012619983,0.00007763883,0.000193961,0.007629614],"genre_scores_gemma":[0.99679,0.000071727634,0.002847863,0.000010746065,0.0000087344315,0.000010558841,0.0000106879515,0.0000063474695,0.00024331026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965132,0.0020689543,0.00010279878,0.0002048135,0.0007433175,0.00036703338],"domain_scores_gemma":[0.96175283,0.031191224,0.002962117,0.0019083944,0.0016553212,0.00053011056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005893714,0.00067859166,0.0008762564,0.0010931335,0.00059616286,0.001645354,0.0010897071,0.0010323378,0.0027954108],"category_scores_gemma":[0.025760131,0.00023948264,0.0005388059,0.0012934542,0.0013928999,0.002654973,0.0013813187,0.0013118308,0.00017109337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043450363,0.00018449963,0.0033230209,0.000050096914,0.000053590138,0.00010176083,0.00005977876,0.96022356,0.0007714158,0.010830712,0.00035151225,0.02361549],"study_design_scores_gemma":[0.000029671684,0.00022015485,0.00102984,0.000007836702,0.0000241629,0.000028951077,0.00006788361,0.99232626,0.0008479231,0.0052391845,0.00016089815,0.000017205832],"about_ca_topic_score_codex":0.0032385834,"about_ca_topic_score_gemma":0.0014920606,"teacher_disagreement_score":0.005893714,"about_ca_system_score_codex":0.001971193,"about_ca_system_score_gemma":0.000980572,"threshold_uncertainty_score":0.031169295},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","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","score_opus":0.04644666103468515,"score_gpt":0.3287920339748899,"score_spread":0.28234537294020473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003584295","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5598138,0.0005447656,0.43519673,0.0005829152,0.000087114,0.0000547618,0.00012827969,0.00029403952,0.0032974845],"genre_scores_gemma":[0.99038297,0.00011133208,0.008412411,0.000029790926,0.00002498231,0.000016877057,0.000045364697,0.00001862351,0.0009576543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959713,0.000100568875,0.000013488267,0.00005224216,0.00014431486,0.00009235666],"domain_scores_gemma":[0.9978715,0.0013383623,0.00023555243,0.00006542028,0.0003310563,0.00015813186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016959695,0.00046736927,0.0006206287,0.0006814211,0.00046619165,0.0012306947,0.0010704924,0.00058859447,0.0011397733],"category_scores_gemma":[0.0026941164,0.0003365353,0.0005247809,0.0003574307,0.0010751387,0.0008873072,0.00057945924,0.00063550216,0.000100225676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033189313,0.0000685432,0.0025063613,0.00007489309,0.000052473722,0.00034620473,0.000104347106,0.9394775,0.0112375645,0.0395494,0.00060218136,0.0056487303],"study_design_scores_gemma":[0.0000059228078,0.000014125851,0.00018301832,0.0000012086716,0.0000042619154,0.000010655007,0.000009389031,0.99785405,0.00028519213,0.0015868134,0.00004189233,0.0000034576635],"about_ca_topic_score_codex":0.0097440155,"about_ca_topic_score_gemma":0.003038101,"teacher_disagreement_score":0.0097440155,"about_ca_system_score_codex":0.0019214475,"about_ca_system_score_gemma":0.0017495188,"threshold_uncertainty_score":0.019374609},"labels":[],"label_agreement":null},{"id":"W2019243921","doi":"10.1002/nav.20194","title":"On optimality of one‐bug‐look‐ahead policies for a software testing model","year":2007,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Software Reliability and Analysis Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Counterexample; Monotonic function; Software; Computer science; Sample (material); Sense (electronics); Mathematical optimization; Mathematical economics; Mathematics; Discrete mathematics; Programming language","score_opus":0.36816490180597294,"score_gpt":0.4710107124231524,"score_spread":0.10284581061717946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019243921","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3492997,0.0009827629,0.63398296,0.0048116157,0.000102026104,0.00029951,0.0006391707,0.00059651025,0.009285783],"genre_scores_gemma":[0.9614993,0.00043428148,0.03496793,0.00033383505,0.000057226778,0.00017478742,0.00030734716,0.00010848265,0.0021168862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935806,0.0035255228,0.00041646478,0.0009118976,0.0006858686,0.00087960256],"domain_scores_gemma":[0.836873,0.14408492,0.011231185,0.0031617803,0.0027267248,0.0019223777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020648023,0.0016115138,0.0048943576,0.0016534934,0.001085451,0.0028683818,0.0027150926,0.0038296408,0.004275617],"category_scores_gemma":[0.08255496,0.0013096331,0.0018025931,0.0009455515,0.0039175563,0.0040451195,0.0022085716,0.0058496944,0.00037973066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071998,0.0003247365,0.0054670433,0.00035459193,0.00016973235,0.00032900885,0.00028595948,0.76754016,0.001465724,0.20333822,0.002580373,0.017424535],"study_design_scores_gemma":[0.00012250898,0.0002469172,0.0011795369,0.00006915892,0.000042701464,0.000069346745,0.00007484012,0.8262855,0.0006466488,0.17068146,0.00053964334,0.000041833227],"about_ca_topic_score_codex":0.0045029237,"about_ca_topic_score_gemma":0.0021406494,"teacher_disagreement_score":0.020648023,"about_ca_system_score_codex":0.0026076091,"about_ca_system_score_gemma":0.0038161902,"threshold_uncertainty_score":0.10919845},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.1448358548846419,"score_gpt":0.35046810120912086,"score_spread":0.20563224632447896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021108591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4496581,0.0006072366,0.51808584,0.0022979088,0.00005659681,0.0002896863,0.00070422067,0.00039223646,0.027908174],"genre_scores_gemma":[0.98334324,0.00019630574,0.010996942,0.00008833396,0.000039723906,0.00012468768,0.00010118551,0.00003220697,0.0050773066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99531823,0.0022583196,0.00022830298,0.0007410556,0.00064997043,0.0008040918],"domain_scores_gemma":[0.9615947,0.025427626,0.0058865463,0.0038034832,0.0022570593,0.0010306024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008215601,0.0009090114,0.0016513837,0.0016816397,0.0005243034,0.002731624,0.0021677085,0.0025385718,0.00896638],"category_scores_gemma":[0.04024321,0.0012034854,0.00066771364,0.0009611135,0.0029531578,0.0045941295,0.0015972378,0.0017517686,0.0009675389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057624857,0.00018588603,0.005499218,0.00012515423,0.00008530863,0.00021011363,0.00021760857,0.46890092,0.00197127,0.492511,0.0029377916,0.0267794],"study_design_scores_gemma":[0.00016390377,0.00021296159,0.0055406075,0.00007283334,0.000037218862,0.00010986835,0.00017523507,0.6419398,0.0012401149,0.34815958,0.0022983088,0.000049623046],"about_ca_topic_score_codex":0.002518974,"about_ca_topic_score_gemma":0.0012351983,"teacher_disagreement_score":0.00896638,"about_ca_system_score_codex":0.002835036,"about_ca_system_score_gemma":0.0011151275,"threshold_uncertainty_score":0.043448806},"labels":[],"label_agreement":null},{"id":"W2022337982","doi":"10.1002/nav.21505","title":"Interchange fee rate, merchant discount rate, and retail price in a credit card network: A game‐theoretic analysis","year":2012,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Issuer; Negotiation; Business; Microeconomics; Economics; Monetary economics; Finance","score_opus":0.3815939376214226,"score_gpt":0.4944232845445638,"score_spread":0.11282934692314123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022337982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27419806,0.0008603451,0.67768586,0.001872424,0.00009666742,0.00030409417,0.00016718775,0.00008989657,0.044725515],"genre_scores_gemma":[0.9800085,0.00040545288,0.015967272,0.00009267354,0.000036793797,0.00009164654,0.000038182585,0.000018732739,0.0033407332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838674,0.0008833594,0.00003879212,0.00019802735,0.00022157526,0.00027146438],"domain_scores_gemma":[0.9923999,0.00581436,0.0006917385,0.00018079396,0.00050717784,0.00040606956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036015522,0.0010931335,0.0011547838,0.0016018181,0.001244186,0.0034854342,0.0023214114,0.0022244607,0.005210297],"category_scores_gemma":[0.012734848,0.00072368036,0.0010168556,0.0011462595,0.0034749268,0.0061550657,0.0016411501,0.0023461673,0.00028678516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096399584,0.000116731644,0.0011287199,0.00005496718,0.000043587406,0.00022620668,0.00017740102,0.65361863,0.0011846022,0.3375242,0.0013127113,0.0045159175],"study_design_scores_gemma":[0.00001857742,0.00003923912,0.00027514296,0.000016998698,0.000020344121,0.00006872823,0.000119376484,0.95238805,0.0002388779,0.046179123,0.00061334023,0.000022231736],"about_ca_topic_score_codex":0.007511836,"about_ca_topic_score_gemma":0.0041672573,"teacher_disagreement_score":0.007511836,"about_ca_system_score_codex":0.006745137,"about_ca_system_score_gemma":0.0019464394,"threshold_uncertainty_score":0.048939586},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.38796704095847817,"score_gpt":0.4246007972902171,"score_spread":0.03663375633173893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023379762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21951601,0.0009753264,0.7348487,0.0014481139,0.00023462085,0.0002766147,0.00044495962,0.000332956,0.041922744],"genre_scores_gemma":[0.9333126,0.0011499521,0.049816493,0.00039549172,0.0005889492,0.00044239085,0.00047916584,0.000119492855,0.013695445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738544,0.00068498735,0.00014115481,0.00055491016,0.00095135,0.00028227747],"domain_scores_gemma":[0.9840338,0.0082368525,0.0032723525,0.0011775112,0.0024119727,0.0008675296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004605078,0.001070385,0.001430848,0.0028457835,0.001229643,0.0029735565,0.0017831686,0.001993719,0.01203616],"category_scores_gemma":[0.023144629,0.00046018264,0.0016454362,0.0014900018,0.005116816,0.004434883,0.0020729434,0.0023496912,0.0013295922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018949897,0.000018253211,0.0004985753,0.00003055424,0.000010964535,0.00007414608,0.000068790854,0.010222358,0.00082128844,0.9841403,0.00045940152,0.0036364915],"study_design_scores_gemma":[0.000034220346,0.0001141664,0.0005299527,0.000026561034,0.000017669348,0.0004027532,0.00006941244,0.1296004,0.0011720676,0.86419314,0.0038053838,0.000034314035],"about_ca_topic_score_codex":0.0008481313,"about_ca_topic_score_gemma":0.00038086143,"teacher_disagreement_score":0.01203616,"about_ca_system_score_codex":0.0015171234,"about_ca_system_score_gemma":0.0013222112,"threshold_uncertainty_score":0.040265024},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.26565426543922893,"score_gpt":0.37807802645165445,"score_spread":0.11242376101242552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024627245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08029034,0.00008228098,0.90542775,0.00025931053,0.000018409952,0.00005679486,0.000036667243,0.000087275555,0.013741108],"genre_scores_gemma":[0.8909524,0.00015368793,0.102655515,0.00008044387,0.000016645092,0.00020341769,0.00006032625,0.00006893404,0.0058086636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963844,0.00014432013,0.000009724006,0.000049471615,0.00008092322,0.00007712195],"domain_scores_gemma":[0.9984158,0.0010455181,0.00012770027,0.000046001704,0.00025428465,0.00011066092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012113175,0.00042255176,0.0005227562,0.0008887347,0.00064056175,0.0010134454,0.00085219793,0.0010560614,0.0048279045],"category_scores_gemma":[0.004998847,0.0002828365,0.00050611875,0.0003947929,0.0017075057,0.0013802141,0.001073815,0.000888554,0.00040786288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033266657,0.00002912662,0.0004601435,0.000043777767,0.000010635016,0.00010989599,0.0002477572,0.224016,0.0029119444,0.76436424,0.0010442672,0.006728916],"study_design_scores_gemma":[0.000011878517,0.000018083512,0.00010859796,0.000013903615,0.0000040271416,0.000039823186,0.00011029066,0.8354224,0.0006387126,0.16246046,0.0011614839,0.0000102565855],"about_ca_topic_score_codex":0.002856299,"about_ca_topic_score_gemma":0.0014488706,"teacher_disagreement_score":0.0048279045,"about_ca_system_score_codex":0.0016402433,"about_ca_system_score_gemma":0.0012541226,"threshold_uncertainty_score":0.016151011},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Data envelopment analysis; 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","score_opus":0.4504223733606303,"score_gpt":0.5233901437995412,"score_spread":0.0729677704389109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029369144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02434389,0.00031581166,0.9710497,0.00020124126,0.000020788088,0.00012443482,0.00010202759,0.000038296963,0.0038039032],"genre_scores_gemma":[0.8342421,0.0008791785,0.15569484,0.00008152222,0.000049007955,0.0007539358,0.00024464706,0.000052909032,0.008001932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99562955,0.0026952229,0.00016780886,0.00054931594,0.00059610285,0.00036202217],"domain_scores_gemma":[0.98995703,0.0079632895,0.00084987417,0.00029513895,0.0007201633,0.00021443945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007988966,0.001859439,0.0022384971,0.0018303938,0.0007292281,0.0035136417,0.0017373413,0.0015253752,0.003589867],"category_scores_gemma":[0.011185814,0.0009739701,0.0023815574,0.0016817942,0.0019515733,0.0023493113,0.0021888847,0.0024870513,0.00034406883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002441276,0.000038052433,0.00029705427,0.00003877465,0.000046860136,0.000037745725,0.00004859606,0.8875938,0.0002057146,0.10848921,0.00017272774,0.0030070306],"study_design_scores_gemma":[0.0000073385095,0.000009673834,0.00007949481,0.0000068467302,0.0000070239903,0.000005237239,0.000012321893,0.97232133,0.00007137642,0.027249157,0.00022344338,0.0000067431083],"about_ca_topic_score_codex":0.010420472,"about_ca_topic_score_gemma":0.006454579,"teacher_disagreement_score":0.010420472,"about_ca_system_score_codex":0.0045222216,"about_ca_system_score_gemma":0.0017986293,"threshold_uncertainty_score":0.042250156},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.31335884045354145,"score_gpt":0.4708253001477556,"score_spread":0.15746645969421413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030345531","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9380724,0.00028827167,0.058149647,0.00042731012,0.000032969085,0.00007327177,0.00010066369,0.00004387738,0.002811513],"genre_scores_gemma":[0.99471515,0.00007893495,0.0046408977,0.000017170349,0.000007888171,0.000015730122,0.0000349333,0.000006003758,0.00048326972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995035,0.0001822754,0.000027931039,0.000090219866,0.000067309345,0.00012875779],"domain_scores_gemma":[0.99441975,0.0042499253,0.00061349594,0.00013237959,0.0002595847,0.00032480253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018531899,0.0005022381,0.0009968133,0.0007060984,0.00039905804,0.0015521058,0.001114149,0.0016279884,0.0019063414],"category_scores_gemma":[0.009142745,0.0007338585,0.0007872356,0.00049770233,0.0010294248,0.0017986344,0.00049748085,0.0014489513,0.00012773348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066817214,0.00032021452,0.0061225668,0.000108079046,0.00010011152,0.00028982956,0.00011705449,0.9531834,0.007481243,0.017983012,0.00065128907,0.012975053],"study_design_scores_gemma":[0.000030863004,0.00012801612,0.0031489965,0.000008812194,0.000034451718,0.0000426074,0.00006956492,0.98680764,0.0011252936,0.008436817,0.00013933984,0.000027532633],"about_ca_topic_score_codex":0.0049496978,"about_ca_topic_score_gemma":0.0027478768,"teacher_disagreement_score":0.0049496978,"about_ca_system_score_codex":0.0015850639,"about_ca_system_score_gemma":0.001016937,"threshold_uncertainty_score":0.011500537},"labels":[],"label_agreement":null},{"id":"W2033535334","doi":"10.1002/nav.20091","title":"Project scheduling under competition","year":2005,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Heuristics; Computer science; Profit (economics); Scheduling (production processes); Mathematical optimization; Operations research; Job shop scheduling; Mathematics; Microeconomics; Economics","score_opus":0.5793536814083795,"score_gpt":0.5661915052106762,"score_spread":0.013162176197703324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033535334","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47846112,0.0012055577,0.46184644,0.0021193062,0.0002738591,0.00071168854,0.0007305918,0.0005102436,0.054141253],"genre_scores_gemma":[0.9478563,0.00038621057,0.04471998,0.00012005541,0.00008994393,0.00027660804,0.0003970515,0.000085642605,0.006068206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997006,0.0013187709,0.00008807964,0.00046794055,0.0003938101,0.0007254274],"domain_scores_gemma":[0.99445194,0.0032410943,0.00048522613,0.0002366254,0.00043877392,0.00114641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024381147,0.0009061145,0.0015153612,0.00072406564,0.0011040474,0.0019188164,0.001479037,0.0012266565,0.0074504805],"category_scores_gemma":[0.0075648697,0.0005921151,0.00079900475,0.0017528823,0.0013318425,0.002029591,0.0014018553,0.0015469261,0.000741349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054282555,0.00020313798,0.0014830016,0.00024267635,0.00007272581,0.00060438924,0.00019316319,0.8683281,0.0028814517,0.09036938,0.0053679063,0.029711084],"study_design_scores_gemma":[0.0002256434,0.00054912484,0.00094492704,0.000029733175,0.00002753404,0.00033420362,0.00022897743,0.8972703,0.0014192964,0.09020481,0.008714562,0.000050851195],"about_ca_topic_score_codex":0.006131332,"about_ca_topic_score_gemma":0.0033468062,"teacher_disagreement_score":0.0074504805,"about_ca_system_score_codex":0.0019400276,"about_ca_system_score_gemma":0.002662091,"threshold_uncertainty_score":0.024924397},"labels":[],"label_agreement":null},{"id":"W2035508719","doi":"10.1002/nav.20023","title":"A unified model incorporating yield, burn‐in, and reliability","year":2004,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Science Foundation","keywords":"Reliability (semiconductor); Yield (engineering); Reliability engineering; Burn-in; Function (biology); Poisson distribution; Computer science; Mathematics; Applied mathematics; Statistics; Engineering; Physics; Thermodynamics","score_opus":0.07724833844691953,"score_gpt":0.3232252662938739,"score_spread":0.24597692784695435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035508719","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076758,0.0009636859,0.89481413,0.0010200831,0.00014169203,0.00021471552,0.0009725125,0.00070559786,0.024409575],"genre_scores_gemma":[0.90280765,0.001382351,0.046270814,0.00016609415,0.00011209463,0.0006433877,0.00058461016,0.00018616855,0.047846716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914455,0.00024307809,0.000040095016,0.00020935785,0.00022041811,0.00014236421],"domain_scores_gemma":[0.99870825,0.00060263154,0.00020776705,0.00010073323,0.0002901749,0.00009049841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019247632,0.0014765721,0.0018750947,0.0012281442,0.0005539812,0.0022561818,0.003826257,0.0031678139,0.0049219313],"category_scores_gemma":[0.0042388933,0.0010346358,0.0013288232,0.0011082514,0.0013214842,0.0030551096,0.001172775,0.0014321608,0.00095854426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023789395,0.000022451202,0.00019215613,0.000027877946,0.00001409475,0.0000802084,0.00003248965,0.97974604,0.0006716692,0.016670268,0.00032071976,0.002198252],"study_design_scores_gemma":[0.000008700694,0.00002447962,0.000085171196,0.000004833972,0.000015507587,0.000018756544,0.000006354779,0.99561846,0.00014029907,0.003668046,0.0004013283,0.000008104666],"about_ca_topic_score_codex":0.008599743,"about_ca_topic_score_gemma":0.004940446,"teacher_disagreement_score":0.008599743,"about_ca_system_score_codex":0.0019135881,"about_ca_system_score_gemma":0.0016950639,"threshold_uncertainty_score":0.01709938},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Server; Computer science; 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","score_opus":0.16716998963759158,"score_gpt":0.34056244283443055,"score_spread":0.17339245319683896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041652723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19188862,0.0015155739,0.78378063,0.0034065049,0.00022189702,0.00015991178,0.0013748123,0.00051153306,0.017140632],"genre_scores_gemma":[0.96736777,0.0007128994,0.014769203,0.0001489052,0.00012170615,0.00018725797,0.00037775026,0.000078177414,0.016236383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772125,0.0008319002,0.00007062464,0.0003724123,0.00031389642,0.00068983855],"domain_scores_gemma":[0.99507385,0.002432552,0.0010512333,0.00022940307,0.00067014334,0.0005429119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025826637,0.0015908957,0.0023795553,0.0019650504,0.0012002691,0.0032183272,0.0050014346,0.004631298,0.009616589],"category_scores_gemma":[0.006987859,0.0015747478,0.001606742,0.0025453519,0.0032844923,0.0031531265,0.002534823,0.0027473294,0.0012224842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055565743,0.000029148081,0.00035745464,0.000027317245,0.000018846391,0.00013768848,0.00006683301,0.9501526,0.00019586262,0.04714692,0.00088769844,0.00092412875],"study_design_scores_gemma":[0.000030044082,0.000026426062,0.00015889651,0.000011116596,0.000010954672,0.000034664918,0.00006729956,0.98271495,0.000057558547,0.016253501,0.00061622617,0.000018382645],"about_ca_topic_score_codex":0.019663453,"about_ca_topic_score_gemma":0.009363345,"teacher_disagreement_score":0.019663453,"about_ca_system_score_codex":0.0047969995,"about_ca_system_score_gemma":0.0015065919,"threshold_uncertainty_score":0.039098024},"labels":[],"label_agreement":null},{"id":"W2042221491","doi":"10.1002/nav.20361","title":"A branch‐and‐cut algorithm for the nonpreemptive swapping problem","year":2009,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Object (grammar); Algorithm; Computer science; Type (biology); Graph; State (computer science); Set (abstract data type); Mathematical optimization; Mathematics; Combinatorics; Theoretical computer science; Artificial intelligence","score_opus":0.061385523781149906,"score_gpt":0.34468182088325583,"score_spread":0.2832962971021059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042221491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08450854,0.0007314629,0.89669156,0.0008144614,0.00010738563,0.00063512067,0.0006067905,0.0012955854,0.014609084],"genre_scores_gemma":[0.24790423,0.00025094228,0.74393994,0.00018415214,0.00007068014,0.000553246,0.0012813108,0.00019393535,0.0056216046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924576,0.00036286507,0.00003536022,0.0001219141,0.00011788124,0.000116144445],"domain_scores_gemma":[0.99828374,0.0013030836,0.00010603572,0.000068658876,0.00014349792,0.00009501708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016384668,0.001118638,0.0012617926,0.001298784,0.00075670175,0.0010330639,0.0019017301,0.0018695873,0.009156751],"category_scores_gemma":[0.002888724,0.0006595401,0.0006697129,0.0018240052,0.0006744681,0.0016726785,0.0009884575,0.0013641262,0.00096521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044537432,0.00059171335,0.0008573974,0.00026957024,0.00006111225,0.00020074182,0.00016865639,0.7046635,0.0014188653,0.03287037,0.013074428,0.2453783],"study_design_scores_gemma":[0.00010908388,0.000101488346,0.00015487586,0.000015088967,0.000011765025,0.000043143897,0.00002601311,0.98187166,0.00046554438,0.015905129,0.0012882717,0.000007865792],"about_ca_topic_score_codex":0.0049163154,"about_ca_topic_score_gemma":0.00437877,"teacher_disagreement_score":0.009156751,"about_ca_system_score_codex":0.001262149,"about_ca_system_score_gemma":0.0017670947,"threshold_uncertainty_score":0.030632436},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.1041311928030988,"score_gpt":0.37260427082579267,"score_spread":0.2684730780226939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045033756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23466744,0.00072247715,0.7479494,0.0015899554,0.0006800645,0.00017824657,0.00027594983,0.000963296,0.012973138],"genre_scores_gemma":[0.98032975,0.00015588706,0.014222039,0.00017071184,0.00024799514,0.000038203554,0.00008788514,0.000020093226,0.0047274013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798113,0.0005581201,0.000082107406,0.0003694215,0.0005689077,0.00044032835],"domain_scores_gemma":[0.9955545,0.001726417,0.0005776078,0.00046584883,0.0012170846,0.00045856374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002083184,0.0005708478,0.0008300102,0.00059502665,0.00068653317,0.0015612036,0.0017866334,0.0010408057,0.003667979],"category_scores_gemma":[0.007235435,0.00033667876,0.00051600416,0.0007911918,0.00081502576,0.0014260522,0.0009872185,0.0018185913,0.00040000223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015433412,0.00043823745,0.0074740965,0.00047314097,0.00016286527,0.0025897631,0.0005204705,0.5570524,0.025604807,0.2996477,0.012579943,0.09191333],"study_design_scores_gemma":[0.00006749122,0.00015556972,0.0007745693,0.0000063298194,0.0000366034,0.00022737097,0.00002603831,0.9781447,0.0014143368,0.017212505,0.0019117272,0.00002285886],"about_ca_topic_score_codex":0.0033111037,"about_ca_topic_score_gemma":0.0021119467,"teacher_disagreement_score":0.003667979,"about_ca_system_score_codex":0.0014892536,"about_ca_system_score_gemma":0.0013049409,"threshold_uncertainty_score":0.012270629},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Vehicle routing problem; Heuristics; Metaheuristic; Computer science; Set (abstract data type); Operations research; Mathematical optimization; Routing (electronic design automation); Mathematics; Algorithm; Computer network","score_opus":0.15094007849475852,"score_gpt":0.42007919479346856,"score_spread":0.26913911629871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046280257","genre_codex":"commentary","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039889766,0.2159455,0.07165062,0.6243197,0.037081145,0.000052511543,0.0005708003,0.00038110296,0.04600963],"genre_scores_gemma":[0.15795587,0.38830906,0.08810495,0.2227243,0.08892414,0.00021660987,0.0014198214,0.0006699429,0.051675282],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745804,0.0010857738,0.00016182651,0.0004025258,0.00072355324,0.00016830055],"domain_scores_gemma":[0.9842726,0.009315971,0.00066474924,0.0010081382,0.0037735137,0.00096515147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003842909,0.0010450572,0.0012311478,0.0012610027,0.0015504417,0.005553321,0.002030477,0.0051317737,0.018051185],"category_scores_gemma":[0.02356099,0.00039786645,0.00091279205,0.0017497428,0.0037685095,0.019117303,0.0014010713,0.0077823433,0.007928578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002122225,0.00017697315,0.0017085358,0.0025968752,0.00015052519,0.0004004377,0.00053712376,0.006489118,0.00040330793,0.17655274,0.40741405,0.40335807],"study_design_scores_gemma":[0.00003613751,0.000084114894,0.0006910006,0.0028148105,0.000046490062,0.00072646653,0.0011904651,0.00411091,0.00040493513,0.47631964,0.51350105,0.00007397968],"about_ca_topic_score_codex":0.0026905918,"about_ca_topic_score_gemma":0.0016047193,"teacher_disagreement_score":0.018051185,"about_ca_system_score_codex":0.0014258465,"about_ca_system_score_gemma":0.0017363696,"threshold_uncertainty_score":0.060387194},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.06578689733596091,"score_gpt":0.35045645982519125,"score_spread":0.28466956248923037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047449665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04989672,0.0005320149,0.93843293,0.00072417915,0.000089125344,0.0003394944,0.00040734748,0.00084949285,0.008728702],"genre_scores_gemma":[0.1864457,0.00036270882,0.8060301,0.00018730322,0.000059256454,0.0004321938,0.000957675,0.00020827244,0.00531679],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994628,0.00018635843,0.000025971709,0.00012246372,0.00008568412,0.0001167678],"domain_scores_gemma":[0.99880266,0.0008722488,0.00007637633,0.000037077163,0.00011621325,0.000095514675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011393538,0.0009255079,0.0014126713,0.000708887,0.0010295528,0.00148926,0.001296621,0.0017228723,0.00859902],"category_scores_gemma":[0.0020037834,0.0007916918,0.00066665723,0.0013837335,0.0005443847,0.0014588633,0.0011556939,0.001462158,0.0008091061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034180313,0.00024377437,0.0005240679,0.00021438894,0.00004213496,0.00021121878,0.00016814859,0.8608971,0.0022970163,0.015134277,0.0074047362,0.11252142],"study_design_scores_gemma":[0.00006755478,0.000047343616,0.00008232758,0.00001115919,0.000009820434,0.00002126553,0.000027184973,0.99303,0.00047283625,0.0050475467,0.0011767211,0.0000062791883],"about_ca_topic_score_codex":0.012430661,"about_ca_topic_score_gemma":0.009312788,"teacher_disagreement_score":0.012430661,"about_ca_system_score_codex":0.0014635887,"about_ca_system_score_gemma":0.0018326698,"threshold_uncertainty_score":0.028766572},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Downside risk; Portfolio optimization; Mathematical optimization; Stochastic dominance; Portfolio; Quadratic programming; Computer science; Variance (accounting); Modern portfolio theory; Mathematics; Econometrics; Economics","score_opus":0.43634205123823044,"score_gpt":0.5104956728919372,"score_spread":0.07415362165370676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048883691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058071394,0.0003682371,0.92548114,0.0007609616,0.00007695187,0.000049690636,0.00015839282,0.00013435497,0.0148989055],"genre_scores_gemma":[0.93151504,0.00026675282,0.058588237,0.00015766734,0.00008097905,0.00009655188,0.00009269386,0.000025410984,0.009176631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953187,0.00019482321,0.000021133254,0.00007081707,0.00011566938,0.00006569946],"domain_scores_gemma":[0.99933076,0.0003006706,0.00012640905,0.00007698778,0.000107210675,0.00005805089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012134493,0.0004771224,0.00064425735,0.0004944649,0.00028136265,0.0015366399,0.000993751,0.00083505246,0.0030975037],"category_scores_gemma":[0.002607051,0.0002865646,0.0007872434,0.0005894745,0.0005178279,0.0009318512,0.0010553945,0.00095389294,0.00031327846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004408084,0.000029206345,0.000580608,0.000022003425,0.000032628675,0.00008594544,0.000031373544,0.8974938,0.00066889194,0.0852513,0.00083673676,0.0149234105],"study_design_scores_gemma":[0.0000046891746,0.000014342171,0.000092321156,0.0000026464973,0.000004034311,0.000013972294,0.0000029342677,0.9795761,0.000082789935,0.019436615,0.00076608895,0.0000034781913],"about_ca_topic_score_codex":0.0033252223,"about_ca_topic_score_gemma":0.002207478,"teacher_disagreement_score":0.0033252223,"about_ca_system_score_codex":0.0011007184,"about_ca_system_score_gemma":0.0006818014,"threshold_uncertainty_score":0.010362208},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Benders' decomposition; Mathematical optimization; Decomposition method (queueing theory); Decomposition; Computer science; Network planning and design; Integer (computer science); Mathematics; Telecommunications; Discrete mathematics","score_opus":0.19174164432799432,"score_gpt":0.46162288724563827,"score_spread":0.2698812429176439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053778299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002667057,0.00008109797,0.99507755,0.00004541481,0.0000103311095,0.000039812756,0.00003576574,0.00009217032,0.0019507739],"genre_scores_gemma":[0.08822833,0.00020273756,0.9083517,0.0000576723,0.000024380057,0.00018957038,0.00019685955,0.00010548142,0.002643236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990829,0.00042489148,0.000035236848,0.00013359684,0.00023056554,0.00009274471],"domain_scores_gemma":[0.9993774,0.0003819043,0.000056635614,0.00005701583,0.0000916295,0.000035499233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013351268,0.001105207,0.00073327584,0.0009876493,0.0004733124,0.0010277438,0.0009531317,0.00088328443,0.005316112],"category_scores_gemma":[0.0019244564,0.0009199226,0.0013660587,0.0011172168,0.0008928835,0.0011499237,0.00095812103,0.001497861,0.0005420909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034897996,0.000038137805,0.00015953358,0.00006625502,0.000031142932,0.000049698352,0.00005781545,0.9227446,0.0014713835,0.037122007,0.001049315,0.037175227],"study_design_scores_gemma":[0.000010155962,0.000016618513,0.000040620398,0.000009901247,0.0000067380665,0.000013831167,0.000011277103,0.9762225,0.00043267148,0.021870285,0.0013610192,0.0000043977016],"about_ca_topic_score_codex":0.005384379,"about_ca_topic_score_gemma":0.0069549973,"teacher_disagreement_score":0.005384379,"about_ca_system_score_codex":0.0012480257,"about_ca_system_score_gemma":0.0013039793,"threshold_uncertainty_score":0.017784178},"labels":[],"label_agreement":null},{"id":"W2054651473","doi":"10.1002/nav.10028","title":"Managing waiting times of backordered demands in single‐stage (<i>Q</i>, <i>r</i>) inventory systems","year":2002,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Mathematical optimization; Lead time; Quasiconvex function; Service (business); Operations research; Measure (data warehouse); Upper and lower bounds; Service level; Inventory control; Mathematics; Operations management; Economics; Data mining; Statistics","score_opus":0.1273790875965748,"score_gpt":0.32372615877037497,"score_spread":0.19634707117380018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054651473","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50024897,0.0003918951,0.49585354,0.0005518004,0.000053194668,0.000105509425,0.00016022121,0.00028423584,0.0023506621],"genre_scores_gemma":[0.98283136,0.0000935134,0.015684178,0.000038045408,0.000018155166,0.00003706498,0.000047327238,0.000038007256,0.001212292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988833,0.00037739074,0.00006096705,0.00015312884,0.0002096443,0.0003155236],"domain_scores_gemma":[0.99663407,0.0019402973,0.00065848883,0.00012383569,0.0003245147,0.00031894958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023772235,0.0008930461,0.0012002672,0.0006017226,0.00080106047,0.0022933043,0.0015894028,0.0011283552,0.0021098936],"category_scores_gemma":[0.005465844,0.0009108919,0.0005284902,0.0009711606,0.00094393716,0.0017497719,0.0009192633,0.00093801145,0.00021851482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022958327,0.000063946,0.0008154946,0.000048877464,0.000025194058,0.00010976767,0.000078342535,0.9820239,0.002819172,0.0056265993,0.000371417,0.007787741],"study_design_scores_gemma":[0.000012452064,0.00005359973,0.00021459059,0.0000039813003,0.0000098980045,0.000018183457,0.000022080518,0.9958134,0.000731329,0.0030083118,0.00010366241,0.000008479277],"about_ca_topic_score_codex":0.010232445,"about_ca_topic_score_gemma":0.006087643,"teacher_disagreement_score":0.010232445,"about_ca_system_score_codex":0.0023544827,"about_ca_system_score_gemma":0.0019849213,"threshold_uncertainty_score":0.020345807},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.15870021942934098,"score_gpt":0.3587539287809016,"score_spread":0.20005370935156064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055668215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20035563,0.0026168297,0.7079856,0.0031579237,0.00023882865,0.00034891596,0.000870614,0.00027680962,0.084148936],"genre_scores_gemma":[0.86429083,0.0022677188,0.113248914,0.00027644404,0.00027831955,0.00026188503,0.00094870455,0.000087031876,0.018340077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858177,0.0005724935,0.0000529532,0.00023972278,0.00029587193,0.0002572554],"domain_scores_gemma":[0.9980665,0.0012240495,0.00023318076,0.000139922,0.00011795746,0.0002184789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012167809,0.00079202425,0.0007976947,0.000703622,0.0008098292,0.0021958337,0.0014772683,0.0013412916,0.010740948],"category_scores_gemma":[0.0041689593,0.00044796467,0.0009251142,0.0013252818,0.0016316382,0.0036983732,0.0023604836,0.0014624253,0.00065603544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018426687,0.000115575494,0.0010513058,0.00036271344,0.00009288028,0.00054298475,0.00030087013,0.15854894,0.0015833179,0.7631852,0.009945095,0.06408694],"study_design_scores_gemma":[0.00010625969,0.00017327792,0.0008487786,0.00010164271,0.00005091297,0.00084721495,0.00042715203,0.31652972,0.0013236844,0.64261603,0.036938798,0.000036553116],"about_ca_topic_score_codex":0.001238418,"about_ca_topic_score_gemma":0.0010944318,"teacher_disagreement_score":0.010740948,"about_ca_system_score_codex":0.001159089,"about_ca_system_score_gemma":0.000776573,"threshold_uncertainty_score":0.035932004},"labels":[],"label_agreement":null},{"id":"W2058306514","doi":"10.1002/nav.20475","title":"Concavity and monotonicity properties in a groundwater management model","year":2011,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Water resources management and optimization","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; PepsiCo; National Science Foundation","keywords":"Monotonic function; Groundwater; Stock (firearms); Mathematical optimization; Function (biology); Computer science; Mathematics; Operations research; Geology; Geography","score_opus":0.21084680814617282,"score_gpt":0.28950822624699213,"score_spread":0.07866141810081931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058306514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24280852,0.0015115419,0.64363587,0.007728665,0.00008338675,0.0001762453,0.000986671,0.00043214482,0.10263697],"genre_scores_gemma":[0.94495195,0.0009628356,0.04060685,0.0003871214,0.00009500752,0.00019599528,0.00022282133,0.00009069971,0.012486735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896944,0.00045518336,0.00004492743,0.00015749945,0.00016526357,0.00020766091],"domain_scores_gemma":[0.99672085,0.0020145383,0.0006041846,0.00018948593,0.00030360094,0.00016739467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016926579,0.0005839229,0.0009224012,0.0008013628,0.00096782926,0.0023014138,0.0016576059,0.0017843838,0.0052244538],"category_scores_gemma":[0.0061913817,0.0007369242,0.000936368,0.0008769876,0.0021337161,0.0032792964,0.001128712,0.0015248734,0.00057963934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074233474,0.00012343813,0.0017597384,0.0001506034,0.000051675604,0.00036896375,0.00022071601,0.21431369,0.001868599,0.7668544,0.003546243,0.010667781],"study_design_scores_gemma":[0.000022549784,0.00003178692,0.0004948323,0.000027898746,0.00001864733,0.00011116946,0.00006096239,0.7790996,0.0002902,0.21677783,0.0030420804,0.000022400174],"about_ca_topic_score_codex":0.011708306,"about_ca_topic_score_gemma":0.008946846,"teacher_disagreement_score":0.011708306,"about_ca_system_score_codex":0.0029725316,"about_ca_system_score_gemma":0.0021610928,"threshold_uncertainty_score":0.023280323},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.19533601611246118,"score_gpt":0.42689468747017095,"score_spread":0.23155867135770977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058588258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024903765,0.00087824196,0.9656063,0.0006803042,0.00010121781,0.000031370768,0.000055886165,0.000109469795,0.007633418],"genre_scores_gemma":[0.76856863,0.0025179912,0.22286983,0.00041466896,0.0004604909,0.00015428802,0.0001575557,0.00014461903,0.0047119674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99573946,0.0018927617,0.00023132165,0.0004819153,0.001425075,0.0002293565],"domain_scores_gemma":[0.98282826,0.010806197,0.0016893044,0.0026339332,0.0017491747,0.00029307092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062785656,0.0006704994,0.00078684004,0.0021916453,0.0006219907,0.0019207735,0.001142455,0.0009785192,0.001733366],"category_scores_gemma":[0.03045891,0.00041603934,0.00090925046,0.0023044937,0.0037544132,0.005339094,0.0028062342,0.002379621,0.00039499358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046084264,0.000021026339,0.0006608954,0.00005122342,0.000015253605,0.00008404859,0.0002235078,0.047174137,0.0013309559,0.91137725,0.00046957293,0.038545933],"study_design_scores_gemma":[0.000010020073,0.000079713966,0.0004251945,0.000044268774,0.000013255452,0.0002150328,0.000044100052,0.27972686,0.0020513753,0.7128105,0.004548918,0.000030751587],"about_ca_topic_score_codex":0.00079914404,"about_ca_topic_score_gemma":0.00029796953,"teacher_disagreement_score":0.0062785656,"about_ca_system_score_codex":0.0010891644,"about_ca_system_score_gemma":0.0011834246,"threshold_uncertainty_score":0.033204615},"labels":[],"label_agreement":null},{"id":"W2061851585","doi":"10.1002/nav.20187","title":"Effective attacks in the salvo combat model: Salvo sizes and quantities of targets","year":2006,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Military Defense Systems Analysis","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Adversary; Offensive; Context (archaeology); Operations research; Firepower; Set (abstract data type); Computer science; Balance (ability); Power (physics); Computer security; Engineering; Psychology","score_opus":0.040523528461552626,"score_gpt":0.32450151841965713,"score_spread":0.2839779899581045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061851585","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49834427,0.00082387746,0.46189645,0.0025862583,0.00007896498,0.000082343875,0.00024417843,0.00015595542,0.035787743],"genre_scores_gemma":[0.98949337,0.0002099583,0.0055326563,0.00007465333,0.000043114207,0.000057631154,0.00005675877,0.000029712126,0.0045021423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911827,0.00033099958,0.000024340818,0.00012803287,0.00013951765,0.00025893212],"domain_scores_gemma":[0.9961538,0.0024694758,0.0006315465,0.00018463128,0.00017627656,0.00038441914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017115574,0.00085561327,0.0009508169,0.00064588466,0.00062064384,0.0019275178,0.0013312922,0.0010471152,0.003749736],"category_scores_gemma":[0.0072026346,0.00046677308,0.00052714464,0.0003635925,0.002605396,0.0027025037,0.0018350868,0.0010688911,0.00031179193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012395273,0.00003286946,0.00085369055,0.000031692172,0.000026226893,0.00010390096,0.00004877009,0.8655988,0.0011496264,0.12906383,0.00064913434,0.0023176156],"study_design_scores_gemma":[0.000032072956,0.00006679588,0.0004178698,0.0000074227623,0.000014271037,0.0000411461,0.00006606568,0.9293736,0.00031779657,0.06913537,0.0005089963,0.000018619403],"about_ca_topic_score_codex":0.002836032,"about_ca_topic_score_gemma":0.0012794647,"teacher_disagreement_score":0.003749736,"about_ca_system_score_codex":0.0013011254,"about_ca_system_score_gemma":0.00076526124,"threshold_uncertainty_score":0.0125440955},"labels":[],"label_agreement":null},{"id":"W2067397577","doi":"10.1002/nav.20287","title":"Warranty claims modeling","year":2008,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Statistical Distribution Estimation and Applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Warranty; Poisson distribution; Interval (graph theory); Poisson regression; Measure (data warehouse); Computer science; Compound Poisson process; Poisson process; Quarter (Canadian coin); Operations research; Actuarial science; Econometrics; Business; Statistics; Economics; Mathematics; Data mining","score_opus":0.825661570677046,"score_gpt":0.5812108259919275,"score_spread":0.24445074468511852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067397577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14647658,0.0018409237,0.83351743,0.0018658446,0.00011026366,0.00016889907,0.0017791293,0.0009242461,0.013316693],"genre_scores_gemma":[0.9404392,0.0010080249,0.044642404,0.00013545938,0.00020857748,0.00014354843,0.0013214115,0.000079930105,0.012021484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832433,0.0005342648,0.00012162303,0.0004247993,0.00042892716,0.00016605327],"domain_scores_gemma":[0.9944998,0.0031540773,0.0013711052,0.00041450092,0.00044124655,0.00011921027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031773837,0.0009866758,0.001074382,0.0016648283,0.00045693445,0.0019101624,0.0026825084,0.0024257875,0.004505053],"category_scores_gemma":[0.011550329,0.00041898558,0.0011057014,0.002030789,0.0008834515,0.0021124764,0.00087140925,0.0012427198,0.00085007586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011162715,0.00013398823,0.009517236,0.00018468928,0.000114083115,0.0005913896,0.00030790662,0.7869158,0.0022329746,0.15417115,0.0028472445,0.042871922],"study_design_scores_gemma":[0.000009945217,0.000027253522,0.0012379863,0.000016355349,0.000015944332,0.00008982857,0.000029864108,0.9623462,0.00034579958,0.03401027,0.0018576303,0.000013023613],"about_ca_topic_score_codex":0.0058764988,"about_ca_topic_score_gemma":0.0032511314,"teacher_disagreement_score":0.0058764988,"about_ca_system_score_codex":0.0012474451,"about_ca_system_score_gemma":0.0010913543,"threshold_uncertainty_score":0.01680386},"labels":[],"label_agreement":null},{"id":"W2071713280","doi":"10.1002/nav.20051","title":"A robust policy for serial agile production systems","year":2004,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"National Science Foundation","keywords":"Markovian arrival process; Computer science; Agile software development; Production (economics); Process (computing); Upstream (networking); Focus (optics); Operations research; Arrival time; Workstation; Mathematical optimization; Markov process; Markov decision process; Queueing theory; Industrial engineering; Economics; Mathematics; Microeconomics; Statistics; Telecommunications; Engineering","score_opus":0.15902731055303307,"score_gpt":0.3659694919759751,"score_spread":0.20694218142294205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071713280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06019689,0.0001999048,0.9343929,0.00035588248,0.000040112835,0.00009872317,0.000102171616,0.0006019172,0.004011397],"genre_scores_gemma":[0.9330205,0.00014336802,0.063713655,0.00009975633,0.000032892134,0.00015652532,0.00008995962,0.000083880615,0.002659549],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981158,0.0006748859,0.00009623586,0.00033487458,0.00044320582,0.0003350468],"domain_scores_gemma":[0.99525815,0.0026790851,0.00089785404,0.00031136905,0.0005380742,0.00031541547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003710063,0.0011497457,0.0013451421,0.00092218805,0.0005198581,0.001431419,0.0010097721,0.0013760003,0.0036078223],"category_scores_gemma":[0.0071618324,0.0007170714,0.00060877437,0.00053824025,0.0012859011,0.0011069451,0.0016447869,0.001577821,0.0005914949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008605034,0.000029174671,0.00013394852,0.000032404045,0.000017962768,0.000039489893,0.000024922572,0.98390007,0.0010252877,0.008970959,0.0002794545,0.0054603377],"study_design_scores_gemma":[0.000011745328,0.000043169668,0.000037347552,0.000005842312,0.0000030900126,0.00000899718,0.0000043131,0.995574,0.00029610874,0.0038820535,0.00012940128,0.000004018553],"about_ca_topic_score_codex":0.002528914,"about_ca_topic_score_gemma":0.0009225299,"teacher_disagreement_score":0.003710063,"about_ca_system_score_codex":0.0015924127,"about_ca_system_score_gemma":0.0015979093,"threshold_uncertainty_score":0.019620895},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.14776821163139436,"score_gpt":0.3610995371806237,"score_spread":0.21333132554922934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072542441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41598538,0.005923912,0.4919872,0.01053915,0.00048696043,0.00020294411,0.00044484393,0.00090406777,0.07352548],"genre_scores_gemma":[0.9856117,0.0019127707,0.0066144043,0.00027208906,0.00018901599,0.00005044093,0.000058854555,0.000073790034,0.005216829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977436,0.0013420888,0.00007889188,0.00022143632,0.00020795691,0.00040608665],"domain_scores_gemma":[0.967182,0.026472006,0.003508999,0.0010924132,0.0008695269,0.0008751549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00771964,0.0015627949,0.0027192766,0.0011800712,0.0011320312,0.0032223738,0.0022699882,0.003134502,0.006872296],"category_scores_gemma":[0.037251636,0.0008323372,0.0012851935,0.00076225726,0.003797043,0.0075635775,0.0016848359,0.003144665,0.00063235866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005692504,0.00019895537,0.0010623442,0.0002081602,0.00009247334,0.00033487586,0.00017898735,0.42226985,0.0008325594,0.5586607,0.0036066624,0.011985304],"study_design_scores_gemma":[0.00019704002,0.00018453514,0.000357948,0.000050267365,0.00006994538,0.00011082445,0.0001345984,0.7274266,0.00042091083,0.26935595,0.0016419947,0.0000493555],"about_ca_topic_score_codex":0.0031854438,"about_ca_topic_score_gemma":0.0011060502,"teacher_disagreement_score":0.00771964,"about_ca_system_score_codex":0.0025862763,"about_ca_system_score_gemma":0.0014663634,"threshold_uncertainty_score":0.040825844},"labels":[],"label_agreement":null},{"id":"W2073967620","doi":"10.1002/nav.20477","title":"An exact analysis of a joint production-inventory problem in two-echelon inventory systems","year":2011,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Stock (firearms); Stockout; Operations research; Computer science; Warehouse; Inventory theory; Inventory control; Holding cost; Safety stock; Business; Operations management; Supply chain; Mathematical optimization; Economics; Mathematics; Marketing; Engineering","score_opus":0.23783753784549144,"score_gpt":0.3665375915651201,"score_spread":0.12870005371962867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073967620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13296188,0.003193361,0.82093656,0.0022329628,0.00026925994,0.00036444556,0.0010727015,0.0004259135,0.038542952],"genre_scores_gemma":[0.9022468,0.0013424346,0.081838146,0.00020903729,0.00022692344,0.00029866837,0.000512535,0.00018698977,0.01313837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816245,0.00059995434,0.00007153279,0.0002443897,0.00043573536,0.00048597087],"domain_scores_gemma":[0.99112296,0.0070715924,0.00064077345,0.00028567607,0.00052087725,0.00035815063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045324164,0.0016909249,0.002628663,0.0015984611,0.0012215554,0.003699807,0.0025696529,0.0025271694,0.010791702],"category_scores_gemma":[0.014996565,0.0019299604,0.0015943341,0.0023102665,0.00195396,0.004622034,0.0027191085,0.0020577563,0.00061478035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000593282,0.000040529143,0.0004645916,0.00009545505,0.000027791244,0.000118273245,0.000049558847,0.9797141,0.00019870346,0.01500887,0.0006333256,0.0035895654],"study_design_scores_gemma":[0.000013294489,0.000017674003,0.00013306901,0.000009159574,0.000009019563,0.000019745075,0.000024444544,0.9921375,0.00005811786,0.0073214737,0.00024950202,0.0000070174588],"about_ca_topic_score_codex":0.023397047,"about_ca_topic_score_gemma":0.013942449,"teacher_disagreement_score":0.023397047,"about_ca_system_score_codex":0.004105511,"about_ca_system_score_gemma":0.0036209715,"threshold_uncertainty_score":0.046521723},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Revenue management; 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","score_opus":0.08615525665716967,"score_gpt":0.3740145309688234,"score_spread":0.28785927431165376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076010882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07224923,0.00034120408,0.9146929,0.0012460332,0.00004227123,0.00008188664,0.00007505996,0.0001761775,0.011095371],"genre_scores_gemma":[0.9186917,0.00037033827,0.074986875,0.0001556203,0.00007554169,0.00014817578,0.00008202452,0.000050398838,0.0054392405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979025,0.0010849687,0.00007767492,0.00023870997,0.0005016096,0.0001944307],"domain_scores_gemma":[0.9920994,0.0062249573,0.0004979806,0.00034979687,0.0006173517,0.00021050224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047010244,0.00061121356,0.0013917171,0.0010680549,0.0006279836,0.0022408427,0.002359103,0.0019999128,0.0047072954],"category_scores_gemma":[0.020956755,0.0009349216,0.00078645354,0.0008932405,0.0017239944,0.0044808146,0.0012012303,0.001843341,0.000559633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009946126,0.00014422547,0.00095711317,0.000049464823,0.000044196655,0.00009201286,0.00016338087,0.52946496,0.000724003,0.42934704,0.0016412149,0.037272885],"study_design_scores_gemma":[0.000018064115,0.000015971671,0.00016041975,0.0000063098523,0.0000057570437,0.000019640767,0.000014271206,0.88596106,0.00010439897,0.11322993,0.00045370453,0.000010467456],"about_ca_topic_score_codex":0.0046606986,"about_ca_topic_score_gemma":0.0033088054,"teacher_disagreement_score":0.0047072954,"about_ca_system_score_codex":0.0022437987,"about_ca_system_score_gemma":0.0010432961,"threshold_uncertainty_score":0.024861634},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05297727917503071,"score_gpt":0.33129348522452784,"score_spread":0.27831620604949714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076551060","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48246038,0.000492548,0.4795513,0.001519712,0.00007550141,0.00031042536,0.0003692437,0.000537628,0.034683354],"genre_scores_gemma":[0.9681227,0.00016058244,0.029055562,0.00009319992,0.000032284002,0.00016376449,0.00009872471,0.00009405207,0.0021790166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968405,0.0018572287,0.00012076984,0.00035961723,0.00037809403,0.00044385908],"domain_scores_gemma":[0.9839352,0.012444298,0.0014343057,0.0009199353,0.00062532903,0.0006410777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004574876,0.000954142,0.0016019393,0.0013248124,0.0009795309,0.0025976347,0.0021211728,0.0014383744,0.0066246027],"category_scores_gemma":[0.018978987,0.00065997714,0.0009381343,0.0011027992,0.0018929851,0.0033047146,0.0018853176,0.0012453841,0.0006116387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010581005,0.0003230285,0.0017186544,0.00027731818,0.00014097623,0.00021427465,0.00017929504,0.59743506,0.00391478,0.3748449,0.0030186374,0.016875032],"study_design_scores_gemma":[0.00011823699,0.0001131529,0.00029765654,0.000024191448,0.00002080003,0.000061494415,0.000059480008,0.84255,0.0009907489,0.15507235,0.0006761983,0.000015755957],"about_ca_topic_score_codex":0.0012124019,"about_ca_topic_score_gemma":0.0008987889,"teacher_disagreement_score":0.0066246027,"about_ca_system_score_codex":0.002341461,"about_ca_system_score_gemma":0.0012698221,"threshold_uncertainty_score":0.024194539},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.09894512376433645,"score_gpt":0.34545330772966626,"score_spread":0.2465081839653298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077698456","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19553638,0.0046209297,0.7718562,0.0025917138,0.000303766,0.00022908676,0.0003179711,0.0023402607,0.022203643],"genre_scores_gemma":[0.8003817,0.0017972118,0.19261926,0.00060292135,0.0005498899,0.00035410555,0.0006463382,0.0006893936,0.0023591765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9897114,0.0052086916,0.00043289125,0.0011997459,0.0020701955,0.0013769561],"domain_scores_gemma":[0.8978118,0.08996797,0.0032363103,0.0050458913,0.0029671045,0.0009709463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015343749,0.0018295924,0.0022318498,0.0022694871,0.002123346,0.0041591697,0.0034553143,0.0026624748,0.0044425363],"category_scores_gemma":[0.079216026,0.0011703946,0.0016196998,0.0022671106,0.0038043226,0.0069286544,0.002991314,0.0033484942,0.0010197301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024261996,0.00048226604,0.003254413,0.0004549241,0.00020989486,0.00009222801,0.0002879459,0.8010748,0.0043800496,0.098103404,0.005634722,0.083599254],"study_design_scores_gemma":[0.00022254356,0.00016080841,0.00059552566,0.000048469414,0.000053777276,0.000066526954,0.000040704555,0.9452621,0.00157633,0.051160585,0.00079439743,0.00001828912],"about_ca_topic_score_codex":0.0029391942,"about_ca_topic_score_gemma":0.0024956223,"teacher_disagreement_score":0.015343749,"about_ca_system_score_codex":0.0044135903,"about_ca_system_score_gemma":0.0048544863,"threshold_uncertainty_score":0.08114648},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.7318395368925034,"score_gpt":0.6103299945594963,"score_spread":0.12150954233300704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078370404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081302784,0.0004593756,0.81574273,0.0014202152,0.00019460464,0.00027870407,0.00044940013,0.0002026318,0.09994959],"genre_scores_gemma":[0.907701,0.000354145,0.046052508,0.00016070358,0.00009471435,0.00032635406,0.0002494515,0.000035834226,0.045025304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982401,0.00073586893,0.00007975195,0.0002906378,0.00036963972,0.0002840574],"domain_scores_gemma":[0.9986349,0.0006473368,0.00017634155,0.00012642043,0.00024073831,0.00017431502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002269893,0.00081250595,0.0012320417,0.0006421228,0.00086592406,0.0021278416,0.0021936167,0.001993313,0.019227972],"category_scores_gemma":[0.0028557545,0.00066910556,0.0011864846,0.0010850814,0.0014565748,0.0021424396,0.0011164636,0.001215528,0.0020395885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018285916,0.00014405204,0.0006637942,0.00010522481,0.000064175096,0.00040549404,0.00012915254,0.5080563,0.0011534085,0.47520024,0.0028927927,0.011002559],"study_design_scores_gemma":[0.00010081035,0.000080430684,0.000166937,0.000014252886,0.000018996952,0.000110285604,0.00004817419,0.8662446,0.000164638,0.13019226,0.002838848,0.000019700801],"about_ca_topic_score_codex":0.004152131,"about_ca_topic_score_gemma":0.0024749634,"teacher_disagreement_score":0.019227972,"about_ca_system_score_codex":0.0017908103,"about_ca_system_score_gemma":0.0016248417,"threshold_uncertainty_score":0.06432402},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.2157233689662252,"score_gpt":0.33322820166770906,"score_spread":0.11750483270148385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083594070","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7445875,0.0006422629,0.24913633,0.0006194102,0.0000704269,0.00018710854,0.00013587289,0.00036497312,0.004256186],"genre_scores_gemma":[0.9906222,0.000091322014,0.008506934,0.000031916905,0.0000119443,0.00003507931,0.00002254015,0.000021111322,0.0006569945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987388,0.00047429814,0.000053914195,0.0001641181,0.00017480414,0.0003940805],"domain_scores_gemma":[0.9962865,0.0016065842,0.0008274748,0.00024278369,0.0005807688,0.00045594675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033311946,0.00061461807,0.00080724934,0.00090558844,0.0005944556,0.0017441066,0.0013822148,0.0009744847,0.0018934367],"category_scores_gemma":[0.009492866,0.0006878017,0.00046585873,0.00054715114,0.0010008109,0.0016655623,0.0008599656,0.0010823843,0.00047274967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094493193,0.00021182018,0.0023128015,0.00009098603,0.00003965132,0.0000868806,0.0001499511,0.95298016,0.011056707,0.01253734,0.0006679093,0.018920925],"study_design_scores_gemma":[0.00010790131,0.0004009716,0.001102603,0.000028122866,0.00003423928,0.000045414265,0.00009810818,0.9845181,0.0052433363,0.0077989623,0.000588858,0.00003335274],"about_ca_topic_score_codex":0.0030587951,"about_ca_topic_score_gemma":0.0013177458,"teacher_disagreement_score":0.0033311946,"about_ca_system_score_codex":0.0017858597,"about_ca_system_score_gemma":0.0012191909,"threshold_uncertainty_score":0.017617285},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06124910798283708,"score_gpt":0.30412153644021983,"score_spread":0.24287242845738274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085632850","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4972443,0.0019743918,0.44852895,0.0027186957,0.0002730089,0.00030912424,0.00043969575,0.00055249356,0.04795931],"genre_scores_gemma":[0.9923172,0.00022296855,0.0033433593,0.000055248143,0.000053617936,0.00003489315,0.00003162828,0.00001274162,0.0039282925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852365,0.00040349286,0.000053746582,0.00025801067,0.00032487456,0.0004362798],"domain_scores_gemma":[0.9939002,0.0036014442,0.001464594,0.00031577674,0.00039999775,0.00031799127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027893092,0.0009840351,0.0012332204,0.00065481954,0.00042668352,0.0022248144,0.002030128,0.00174092,0.0047936337],"category_scores_gemma":[0.0110815,0.00067392905,0.0008366406,0.00047052043,0.0015668477,0.002124016,0.00065961713,0.0015477763,0.0004530525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027832977,0.00018040619,0.0018388353,0.000083408115,0.000059110695,0.0003178539,0.00012437603,0.8996218,0.001862985,0.080074206,0.0010859143,0.014472845],"study_design_scores_gemma":[0.000075866956,0.00012491966,0.0005937077,0.000016831844,0.000028752409,0.000056416004,0.000027909413,0.97597754,0.00041120834,0.022036936,0.000629532,0.00002037955],"about_ca_topic_score_codex":0.006440244,"about_ca_topic_score_gemma":0.0021276088,"teacher_disagreement_score":0.006440244,"about_ca_system_score_codex":0.0021960512,"about_ca_system_score_gemma":0.0010572472,"threshold_uncertainty_score":0.016036332},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06579873709004619,"score_gpt":0.31701362946509354,"score_spread":0.25121489237504735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086250731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3291459,0.0013022296,0.6452354,0.0019709405,0.00038821297,0.00014537536,0.00096970587,0.00062858337,0.020213645],"genre_scores_gemma":[0.98392856,0.00050635904,0.0044934293,0.00013527737,0.00009024884,0.000089351684,0.00019179433,0.000027156084,0.010537926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990621,0.00026868843,0.000038896294,0.00017263099,0.00019088692,0.0002667348],"domain_scores_gemma":[0.998251,0.00069473375,0.00043726747,0.000107809705,0.00031467888,0.00019461884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008381096,0.0008172842,0.0013363353,0.00082447584,0.0006381728,0.0016313088,0.0015453361,0.0015464275,0.0043980847],"category_scores_gemma":[0.0028301657,0.00046726834,0.0007482522,0.00085916906,0.0011409862,0.0016883244,0.0012471178,0.0014386626,0.00057430915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002032957,0.00007449177,0.0017075224,0.00008769125,0.00007955307,0.0006233337,0.0001485346,0.85333115,0.0019979149,0.13508272,0.0020620686,0.0046016634],"study_design_scores_gemma":[0.000032755448,0.00004398887,0.00031784707,0.000006888608,0.000019993464,0.000054800043,0.00002702246,0.97609895,0.00017013986,0.022676213,0.0005355182,0.000015768539],"about_ca_topic_score_codex":0.010072536,"about_ca_topic_score_gemma":0.0038818738,"teacher_disagreement_score":0.010072536,"about_ca_system_score_codex":0.0011189502,"about_ca_system_score_gemma":0.0009358248,"threshold_uncertainty_score":0.020027816},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.16890339971303014,"score_gpt":0.32982350239182656,"score_spread":0.16092010267879642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091947536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28514567,0.0040333467,0.6480828,0.005288087,0.0003617579,0.00043463352,0.0025609161,0.00054846314,0.05354427],"genre_scores_gemma":[0.8734286,0.0033660694,0.09144552,0.00031293815,0.00031366406,0.00037819467,0.002054664,0.00023122644,0.028469076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815506,0.0008672744,0.00007616175,0.00033231016,0.00023827495,0.0003309641],"domain_scores_gemma":[0.9972594,0.0016606457,0.00037702933,0.00015664301,0.00029118307,0.00025517493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001588753,0.001215014,0.0015045804,0.0011941594,0.0016796443,0.0030382613,0.0018954166,0.0025876914,0.008627595],"category_scores_gemma":[0.0052986518,0.00078580744,0.00071967975,0.0030315781,0.0014950631,0.0050338204,0.0023385554,0.0012557307,0.00090186385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050822244,0.00014652315,0.0018379119,0.00047156643,0.00013510979,0.00085728394,0.0003034541,0.7540914,0.0016335063,0.17707391,0.017527513,0.045413695],"study_design_scores_gemma":[0.00014056005,0.00013196035,0.00089982315,0.0001323513,0.00007663683,0.0005987265,0.0008186934,0.74462754,0.0022435347,0.22072601,0.029553229,0.000051046514],"about_ca_topic_score_codex":0.0060137487,"about_ca_topic_score_gemma":0.003849303,"teacher_disagreement_score":0.008627595,"about_ca_system_score_codex":0.002387959,"about_ca_system_score_gemma":0.0010052382,"threshold_uncertainty_score":0.028862178},"labels":[],"label_agreement":null},{"id":"W2095150328","doi":"10.1002/nav.20312","title":"Replacing nonidentical vital components to extend system life","year":2008,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"U.S. National Library of Medicine; Agency for Healthcare Research and Quality; National Science Foundation","keywords":"Spare part; Component (thermodynamics); Counterintuitive; Computer science; Independent and identically distributed random variables; Scheduling (production processes); A priori and a posteriori; Mathematical optimization; Distributed computing; Mathematics; Random variable; Operations management; Statistics; Economics","score_opus":0.1468013988448786,"score_gpt":0.3308095670622263,"score_spread":0.1840081682173477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095150328","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7502976,0.00024995845,0.24639347,0.0002604226,0.00004141782,0.000030089606,0.00004346623,0.00015374563,0.002529826],"genre_scores_gemma":[0.9921176,0.000048530117,0.0072156293,0.000021335778,0.000011435084,0.000006918025,0.000011922252,0.000013193773,0.0005533876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948454,0.00017300813,0.0000242633,0.00007948501,0.00013453854,0.00010414791],"domain_scores_gemma":[0.9975183,0.0010162949,0.00061122066,0.0003075706,0.00021890436,0.00032771175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016441561,0.00053299713,0.0005284293,0.00041093002,0.00029127006,0.00047991646,0.00080517586,0.00052915554,0.001229527],"category_scores_gemma":[0.0038339163,0.00022075829,0.00024406242,0.0003742688,0.00079305697,0.00088448584,0.0005590343,0.00048292865,0.0001927232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039003242,0.00017403235,0.004580166,0.00007580466,0.00004483972,0.00021132512,0.000117085736,0.91190314,0.023116983,0.028434398,0.00058358925,0.030368619],"study_design_scores_gemma":[0.000044381613,0.00061714713,0.0015778083,0.000011802798,0.000045037035,0.00026210526,0.000059254347,0.9562106,0.009019971,0.030826103,0.0013081225,0.000017573913],"about_ca_topic_score_codex":0.00042877274,"about_ca_topic_score_gemma":0.0006176378,"teacher_disagreement_score":0.0016441561,"about_ca_system_score_codex":0.0005257642,"about_ca_system_score_gemma":0.0005493237,"threshold_uncertainty_score":0.008695185},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.19181343768754314,"score_gpt":0.38423980509494227,"score_spread":0.19242636740739913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095338002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06769042,0.0019189616,0.92078376,0.0003240092,0.00007109783,0.00032141048,0.0002497956,0.0010904798,0.0075499928],"genre_scores_gemma":[0.397649,0.001401827,0.5972588,0.00010342908,0.00004347454,0.00033620288,0.0004461568,0.00011340995,0.0026477654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990723,0.0005021485,0.00003937622,0.00011156281,0.00014089538,0.00013368424],"domain_scores_gemma":[0.9979571,0.0015055678,0.00021110976,0.000117303345,0.00013771832,0.00007106812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016283217,0.0010392194,0.000911775,0.0018402806,0.0007470805,0.0012812446,0.0014310436,0.0011937988,0.002664187],"category_scores_gemma":[0.0049166186,0.00088352856,0.0006418488,0.0018619364,0.0009930587,0.0011810412,0.0008520968,0.0006832018,0.00046229633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008538817,0.000033919816,0.0004891777,0.00010509328,0.00003700982,0.0000759774,0.000079948004,0.9461721,0.00047598686,0.011732749,0.0017988009,0.038913812],"study_design_scores_gemma":[0.00008627918,0.0000675956,0.00025348825,0.000039277937,0.000040131847,0.00007221294,0.000083676656,0.9779744,0.00071121287,0.016924234,0.0037310782,0.000016415226],"about_ca_topic_score_codex":0.008540005,"about_ca_topic_score_gemma":0.011314783,"teacher_disagreement_score":0.008540005,"about_ca_system_score_codex":0.0017245666,"about_ca_system_score_gemma":0.0020219705,"threshold_uncertainty_score":0.016980588},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09112287755150374,"score_gpt":0.2983304974547226,"score_spread":0.2072076199032189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099189023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3028838,0.004941243,0.6474913,0.002022945,0.0003943989,0.00081757753,0.0020918292,0.0007273426,0.03862962],"genre_scores_gemma":[0.83704853,0.0022545618,0.14370747,0.0001430325,0.00014754849,0.00039367584,0.0010108056,0.00017503496,0.015119388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922574,0.00027697615,0.000046692992,0.00018906624,0.000098993965,0.00016254446],"domain_scores_gemma":[0.9990909,0.0005614842,0.000094632785,0.000060171424,0.000074308875,0.000118453885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088910054,0.0012015462,0.0012842941,0.00040795095,0.0011452356,0.0020038013,0.0011032474,0.0014712008,0.0062182504],"category_scores_gemma":[0.0020022125,0.0007143421,0.00080225023,0.0011391481,0.00075148675,0.0028808399,0.00097657,0.001258483,0.000504924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004896451,0.00013632025,0.0006578793,0.0004571169,0.00008061863,0.00042687677,0.00018902705,0.91770977,0.004729766,0.040200595,0.00468963,0.030232724],"study_design_scores_gemma":[0.0001345782,0.0002811071,0.0007734365,0.000040441468,0.000048172125,0.0002113361,0.00021326273,0.9597768,0.002562247,0.022898067,0.013022375,0.000038154125],"about_ca_topic_score_codex":0.01837659,"about_ca_topic_score_gemma":0.013148487,"teacher_disagreement_score":0.01837659,"about_ca_system_score_codex":0.0012933305,"about_ca_system_score_gemma":0.0018136599,"threshold_uncertainty_score":0.036539257},"labels":[],"label_agreement":null},{"id":"W2101936477","doi":"10.1002/nav.10008","title":"Optimal switchover times between two activities utilizing the same resource","year":2002,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Switchover; Time horizon; Computer science; Mathematical optimization; Resource (disambiguation); Sequence (biology); Function (biology); Variable (mathematics); Operations research; Order (exchange); Nonlinear system; Horizon; Component (thermodynamics); Production (economics); Fraction (chemistry); Mathematics; Economics","score_opus":0.1037950778199091,"score_gpt":0.334109150956844,"score_spread":0.23031407313693492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101936477","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86403304,0.0005706861,0.11898741,0.00079574797,0.00009217779,0.00018194201,0.00026095938,0.0002851525,0.01479284],"genre_scores_gemma":[0.99292964,0.00007504022,0.0051485267,0.000028302802,0.00000657248,0.000030334433,0.00006969528,0.000016552991,0.0016953527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944335,0.00015726987,0.000026474121,0.00009445957,0.00006326873,0.00021521821],"domain_scores_gemma":[0.9983388,0.0008409845,0.0002399382,0.000092373855,0.000119234486,0.00036865208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013433588,0.0006156834,0.00086942327,0.00062140287,0.000566527,0.0010871087,0.0010617883,0.0009791842,0.009603219],"category_scores_gemma":[0.003844709,0.000550178,0.0004965173,0.00043107476,0.0009047208,0.0015022977,0.00066121964,0.0010979709,0.0004956642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017363335,0.0003631628,0.0022770213,0.000120453136,0.000068030524,0.00019085036,0.000096114425,0.94367856,0.0041864174,0.017987305,0.0016252554,0.027670505],"study_design_scores_gemma":[0.00013712152,0.00044543235,0.0016042197,0.000025671809,0.000048957507,0.000048625185,0.00019251194,0.979502,0.0019295188,0.01521325,0.0008295042,0.000023161425],"about_ca_topic_score_codex":0.00680572,"about_ca_topic_score_gemma":0.0047305194,"teacher_disagreement_score":0.009603219,"about_ca_system_score_codex":0.0016483818,"about_ca_system_score_gemma":0.0013953886,"threshold_uncertainty_score":0.03212601},"labels":[],"label_agreement":null},{"id":"W2107669229","doi":"10.1002/nav.21502","title":"Parametric inference for component distributions from lifetimes of systems with dependent components","year":2012,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Statistical Distribution Estimation and Applications","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Estimator; Component (thermodynamics); Scale (ratio); Inference; Reliability (semiconductor); Parametric statistics; Independent and identically distributed random variables; Scale parameter; Mathematics; Applied mathematics; Computer science; Parametric model; Statistics; Mathematical optimization; Random variable; Artificial intelligence","score_opus":0.39453674983467535,"score_gpt":0.4949253840519714,"score_spread":0.10038863421729605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107669229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10717496,0.00019005753,0.8914626,0.00012657385,0.000013236223,0.000031132742,0.00009623145,0.00018193256,0.0007232528],"genre_scores_gemma":[0.9495076,0.00015220359,0.049482767,0.000036923167,0.000029182762,0.000056370194,0.00021968587,0.000042623848,0.00047273282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997661,0.00133592,0.000088496825,0.00038106903,0.0004190456,0.00011454753],"domain_scores_gemma":[0.9528791,0.040905226,0.002675525,0.002123603,0.0011983559,0.00021815713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009346525,0.00051970425,0.0006882531,0.0017608595,0.00031374893,0.0009159143,0.0012049921,0.000859271,0.0011989914],"category_scores_gemma":[0.072082825,0.00043796812,0.00068603153,0.0009894124,0.0015206083,0.0022969719,0.0012373456,0.0015745672,0.00017768904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029501301,0.00012333406,0.019511387,0.00016244366,0.00020489535,0.00029759773,0.00046948562,0.7826206,0.003855852,0.11935858,0.0009750539,0.07212584],"study_design_scores_gemma":[0.000014867469,0.000032528555,0.0024489125,0.000015397189,0.00001599583,0.00004530486,0.000040922034,0.94852704,0.0014241771,0.04710609,0.00030882546,0.000020022095],"about_ca_topic_score_codex":0.0016376472,"about_ca_topic_score_gemma":0.0010441393,"teacher_disagreement_score":0.009346525,"about_ca_system_score_codex":0.0006885602,"about_ca_system_score_gemma":0.0005263283,"threshold_uncertainty_score":0.049429774},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.15416849621633183,"score_gpt":0.3528874061435829,"score_spread":0.19871890992725105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109918437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02201431,0.0016846408,0.91201943,0.0047672256,0.00027426242,0.00021067291,0.00024944314,0.00019560204,0.05858441],"genre_scores_gemma":[0.8723041,0.0017234656,0.09517531,0.000351511,0.0004520428,0.000410421,0.0001936199,0.00009939797,0.029290205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728394,0.0018335903,0.00005478842,0.00022665874,0.00036687724,0.00023413372],"domain_scores_gemma":[0.996018,0.0029309972,0.00030121597,0.00013059498,0.0003499492,0.00026921323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004674263,0.0018348686,0.0011910219,0.0016570039,0.0008153104,0.0051717754,0.0029122627,0.003457642,0.012102768],"category_scores_gemma":[0.008625401,0.000951265,0.0013703202,0.0014526172,0.0019823103,0.0045875227,0.0018884552,0.0037324312,0.0010767335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035785404,0.000113117014,0.0002731271,0.000058554193,0.00003553968,0.00020299641,0.00008226221,0.7274579,0.00014997265,0.25786695,0.0017720232,0.0119518],"study_design_scores_gemma":[0.000019307154,0.000029592995,0.00006636742,0.0000335026,0.000011312409,0.000037743754,0.00005027605,0.89836085,0.000068193214,0.09892826,0.002377108,0.000017482378],"about_ca_topic_score_codex":0.0036585827,"about_ca_topic_score_gemma":0.0026826053,"teacher_disagreement_score":0.012102768,"about_ca_system_score_codex":0.003426006,"about_ca_system_score_gemma":0.0020678844,"threshold_uncertainty_score":0.040487766},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.27846525583718285,"score_gpt":0.35501628555185905,"score_spread":0.0765510297146762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121014767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25525978,0.0016384022,0.7016974,0.0018655879,0.000076437755,0.00013621581,0.00048661872,0.00031180432,0.0385278],"genre_scores_gemma":[0.98012894,0.0009268086,0.015005648,0.00010323149,0.00005117601,0.00007914588,0.00012705212,0.00009949114,0.0034784623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921036,0.0002601868,0.000026603695,0.00006946865,0.00019754044,0.00023585207],"domain_scores_gemma":[0.9946179,0.0036808546,0.0006880734,0.00019726042,0.0004958162,0.00032007965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021543384,0.0010412073,0.0011758337,0.0009962332,0.0010588438,0.003293039,0.0012158036,0.00092983176,0.0035617629],"category_scores_gemma":[0.0070077665,0.0008730203,0.00074411725,0.0013050877,0.0022872875,0.0030410443,0.0011935999,0.0019484987,0.00038798916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073936106,0.000040861392,0.0007817734,0.00006201464,0.000024889801,0.00019327039,0.00013070383,0.8898502,0.001202848,0.10117745,0.0014156405,0.00504638],"study_design_scores_gemma":[0.000008740051,0.000019285033,0.00024658986,0.000021290067,0.000007993039,0.000029295432,0.000038593964,0.97144586,0.00045316247,0.027169442,0.00055025227,0.000009542725],"about_ca_topic_score_codex":0.010297847,"about_ca_topic_score_gemma":0.0043562893,"teacher_disagreement_score":0.010297847,"about_ca_system_score_codex":0.004392966,"about_ca_system_score_gemma":0.0020308304,"threshold_uncertainty_score":0.031873345},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.13902574830095915,"score_gpt":0.3692503015738026,"score_spread":0.23022455327284347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126912283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043316737,0.0009441055,0.9230763,0.001917476,0.00023108162,0.00008806802,0.00020264639,0.0002489773,0.029974584],"genre_scores_gemma":[0.89479524,0.0011808462,0.081949785,0.00026218776,0.0002537518,0.00016758393,0.00023619852,0.00008100083,0.021073364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898106,0.00036303373,0.000038478163,0.00020184646,0.00027690883,0.00013867664],"domain_scores_gemma":[0.99852884,0.0008141873,0.00014848549,0.00009965527,0.00025643248,0.00015251916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013994911,0.0009049385,0.00122538,0.0006399863,0.000795747,0.0016792902,0.0018757364,0.00177018,0.010059399],"category_scores_gemma":[0.004588289,0.0006816942,0.00082217675,0.0014159685,0.0011735159,0.002194857,0.0013316789,0.0018641594,0.0007753936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007296692,0.00011043597,0.0004776108,0.00006374389,0.00003438076,0.00026221675,0.00008798377,0.6717857,0.0006211991,0.30613023,0.0027873858,0.017566156],"study_design_scores_gemma":[0.000016733418,0.000018521252,0.000052837917,0.000004905631,0.0000058656083,0.000046956986,0.00001306829,0.91542053,0.000058833368,0.0825168,0.0018379487,0.0000069365465],"about_ca_topic_score_codex":0.009331381,"about_ca_topic_score_gemma":0.0046487493,"teacher_disagreement_score":0.010059399,"about_ca_system_score_codex":0.001804876,"about_ca_system_score_gemma":0.0013110546,"threshold_uncertainty_score":0.033652008},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.23652990625680004,"score_gpt":0.41009604352319023,"score_spread":0.1735661372663902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129060502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14903975,0.0008439192,0.82917136,0.0023958876,0.000120849705,0.00009071818,0.00093783054,0.0005903958,0.016809344],"genre_scores_gemma":[0.973826,0.00043846804,0.018958455,0.00013788762,0.00007531072,0.00010386351,0.00034582792,0.000086906424,0.006027286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982949,0.00084598176,0.000039878752,0.00035695493,0.00018384053,0.00027839103],"domain_scores_gemma":[0.9919926,0.0053609954,0.0012184115,0.00042665817,0.00067705545,0.00032430066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002625647,0.000998062,0.0013199218,0.0008803902,0.00063091744,0.001714121,0.0018028814,0.001278375,0.0077127],"category_scores_gemma":[0.012203591,0.0006299095,0.0013068551,0.00085043884,0.0014332865,0.0027165818,0.0014294084,0.0014307513,0.0010985966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050362003,0.000018739875,0.0019217659,0.000040256804,0.000025422067,0.000055829878,0.00010313401,0.9055365,0.00022013631,0.081726566,0.0018949972,0.008406365],"study_design_scores_gemma":[0.000013518845,0.000048465554,0.000782222,0.00002658364,0.0000187111,0.000075633034,0.000050294366,0.94431555,0.00013746157,0.052909903,0.00160487,0.000016858106],"about_ca_topic_score_codex":0.007935396,"about_ca_topic_score_gemma":0.0053819916,"teacher_disagreement_score":0.007935396,"about_ca_system_score_codex":0.0027750875,"about_ca_system_score_gemma":0.0013168268,"threshold_uncertainty_score":0.02580154},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.11932220326915376,"score_gpt":0.3778237813262478,"score_spread":0.258501578057094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130762776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23049389,0.0007129704,0.75075597,0.00035880934,0.0000989497,0.00039488418,0.00018016154,0.00095212384,0.016052255],"genre_scores_gemma":[0.92426443,0.000100720026,0.07342414,0.000055249002,0.000019787305,0.000101775586,0.000096612224,0.000046556415,0.0018906803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993832,0.00019946271,0.000023840152,0.00009787978,0.0001239486,0.00017173162],"domain_scores_gemma":[0.99898416,0.0005422043,0.00013722689,0.0000867277,0.0001333994,0.00011628881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012425754,0.00075094524,0.0011779099,0.0013279383,0.0006373923,0.0013806033,0.0014511566,0.0008174867,0.0049159424],"category_scores_gemma":[0.0018670993,0.00062575086,0.0003439416,0.0008687679,0.00074959034,0.0011336624,0.00083941675,0.00053839525,0.00033338173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015173937,0.00010583351,0.00043785354,0.000051935807,0.000025115762,0.00006975808,0.00005575705,0.9560625,0.0010683232,0.005371807,0.00089879247,0.03570062],"study_design_scores_gemma":[0.000043219574,0.000058657828,0.00011646538,0.000009359117,0.000010826595,0.000021357015,0.000028200082,0.9954625,0.0005817191,0.0030156737,0.0006441497,0.00000787768],"about_ca_topic_score_codex":0.0061067147,"about_ca_topic_score_gemma":0.004812305,"teacher_disagreement_score":0.0061067147,"about_ca_system_score_codex":0.0019406767,"about_ca_system_score_gemma":0.0022988294,"threshold_uncertainty_score":0.016445518},"labels":[],"label_agreement":null},{"id":"W2134025716","doi":"10.1002/nav.21513","title":"Accuracy assessment of detection performance for sidescan sonars","year":2012,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Defence Research and Development Canada","keywords":"Piecewise; Sonar; Computer science; Range (aeronautics); Interval (graph theory); Representation (politics); Function (biology); Logistic regression; Data mining; Marine engineering; Artificial intelligence; Machine learning; Mathematics; Engineering; Aerospace engineering","score_opus":0.556571151684996,"score_gpt":0.6155996670772744,"score_spread":0.05902851539227838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134025716","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8778472,0.00060434523,0.118193746,0.00018998512,0.000050529205,0.00004811168,0.00039702473,0.00046677914,0.0022022473],"genre_scores_gemma":[0.9861135,0.00006814744,0.013287157,0.000016554428,0.000006904823,0.000020003215,0.00024739964,0.000029658737,0.00021066233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99386084,0.0029185654,0.0003632899,0.00069591467,0.0018620065,0.0002994224],"domain_scores_gemma":[0.9173855,0.064814515,0.0045319293,0.0041354257,0.008758103,0.00037461155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013539867,0.0005423783,0.0005476095,0.0013682871,0.0002268458,0.0009719728,0.0009777984,0.000760944,0.0007717105],"category_scores_gemma":[0.06786457,0.00029833536,0.00060803624,0.0009205802,0.0006524707,0.00070072414,0.0010436097,0.00072105037,0.00026848132],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030872985,0.000107290114,0.11503619,0.00025320527,0.00044303393,0.00013750046,0.00036082338,0.74175245,0.011981435,0.003065098,0.0010862354,0.122689456],"study_design_scores_gemma":[0.000039071045,0.0005986947,0.027958078,0.000048520247,0.000058443984,0.0001238253,0.000091925474,0.9535631,0.015948368,0.0010388897,0.00045607577,0.00007504041],"about_ca_topic_score_codex":0.0072483523,"about_ca_topic_score_gemma":0.0024728666,"teacher_disagreement_score":0.013539867,"about_ca_system_score_codex":0.0007732773,"about_ca_system_score_gemma":0.0005832165,"threshold_uncertainty_score":0.07160652},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07931213403529234,"score_gpt":0.3429327634649323,"score_spread":0.26362062942963993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136354326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29962122,0.002548507,0.66682285,0.0022867708,0.0002175008,0.00019478766,0.0016232964,0.00045915952,0.02622597],"genre_scores_gemma":[0.9695143,0.00074202847,0.011197881,0.00006661473,0.00007564407,0.00010111316,0.00029568354,0.000051350453,0.017955292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990959,0.0003088869,0.000050923805,0.00013565352,0.00023423298,0.00017430338],"domain_scores_gemma":[0.99818295,0.0008157927,0.0004777033,0.000110762325,0.00025146705,0.00016124877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023013833,0.0011807751,0.001092409,0.0015905004,0.00047274376,0.0016157735,0.0028888283,0.0022392438,0.005707195],"category_scores_gemma":[0.0043330775,0.00077113224,0.000890822,0.001159482,0.0009191389,0.0016108251,0.00066080823,0.001366138,0.00082004257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007193753,0.000047319587,0.00041793814,0.000034997785,0.000015107815,0.00016730827,0.000031604206,0.97106475,0.00045511904,0.02302101,0.0005176046,0.0041552894],"study_design_scores_gemma":[0.000013339162,0.000037200305,0.0002827996,0.0000074671443,0.00001612128,0.000046464793,0.000011644536,0.9910704,0.00012552147,0.007843563,0.0005360307,0.000009371061],"about_ca_topic_score_codex":0.007924202,"about_ca_topic_score_gemma":0.0045052716,"teacher_disagreement_score":0.007924202,"about_ca_system_score_codex":0.0020082204,"about_ca_system_score_gemma":0.001102565,"threshold_uncertainty_score":0.0190925},"labels":[],"label_agreement":null},{"id":"W2152839609","doi":"10.1002/nav.21620","title":"Optimal FCFS allocation rules for periodic‐review assemble‐to‐order systems","year":2015,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Order (exchange); Business","score_opus":0.18232144162654743,"score_gpt":0.40719826499271466,"score_spread":0.22487682336616724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152839609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23297164,0.0006492724,0.7450278,0.00056638,0.00010587473,0.0005589578,0.000459158,0.0008523341,0.018808624],"genre_scores_gemma":[0.9320992,0.00014954936,0.064136446,0.0000636244,0.000038513528,0.00014049452,0.00017782848,0.00007652671,0.0031176093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984257,0.00039520196,0.0001051244,0.00020841189,0.00049469573,0.00037094488],"domain_scores_gemma":[0.9960835,0.0021132147,0.0005267864,0.00027094793,0.00077278103,0.0002327512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002398696,0.0009659311,0.0012644256,0.0012932318,0.0009715395,0.0020662488,0.0017506884,0.0011606462,0.004780183],"category_scores_gemma":[0.007412543,0.000539145,0.00067095674,0.0010489059,0.000718024,0.001267993,0.0007825841,0.0009655839,0.0005416689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014106634,0.0000946885,0.0006848131,0.00006078209,0.00002783112,0.00010343553,0.00009470981,0.9465042,0.0016476881,0.0130837355,0.001921233,0.03563589],"study_design_scores_gemma":[0.000013712881,0.000019412653,0.00014562893,0.000005474431,0.000005789093,0.000019446934,0.000017303653,0.9951245,0.00044770562,0.0036795733,0.0005148695,0.000006589886],"about_ca_topic_score_codex":0.017884733,"about_ca_topic_score_gemma":0.009660361,"teacher_disagreement_score":0.017884733,"about_ca_system_score_codex":0.0021881827,"about_ca_system_score_gemma":0.0015809566,"threshold_uncertainty_score":0.035561264},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.11579179238903929,"score_gpt":0.37060613466183906,"score_spread":0.25481434227279975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161522387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30210802,0.00039620305,0.67306787,0.00071821903,0.0003460378,0.0003923486,0.0004465247,0.00090033095,0.021624466],"genre_scores_gemma":[0.8742703,0.00014102385,0.11538981,0.00009156874,0.00005095251,0.00015671967,0.0003729833,0.000093633374,0.009432969],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892634,0.000323076,0.00005552761,0.00028777617,0.00016982763,0.00023752464],"domain_scores_gemma":[0.9987268,0.00048239747,0.00019545299,0.00020117789,0.00015093155,0.00024319784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006397128,0.000776633,0.001163223,0.00041271036,0.0007797821,0.0011084033,0.0014262125,0.0010796896,0.012513688],"category_scores_gemma":[0.001945328,0.00046184746,0.00060852035,0.00076169707,0.00078299025,0.0014401136,0.0013342167,0.00094180135,0.001194425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010348718,0.00021400151,0.0011204508,0.00021122448,0.000082178725,0.0008669434,0.00018043346,0.9218446,0.007837897,0.020146018,0.003375815,0.04308567],"study_design_scores_gemma":[0.000090736736,0.00027774816,0.00026327482,0.000012371899,0.000013497067,0.00010277389,0.000119710254,0.97883475,0.0019481446,0.014432264,0.003889249,0.000015463149],"about_ca_topic_score_codex":0.002441291,"about_ca_topic_score_gemma":0.001575419,"teacher_disagreement_score":0.012513688,"about_ca_system_score_codex":0.0006413079,"about_ca_system_score_gemma":0.00074622664,"threshold_uncertainty_score":0.041862488},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.0782222590228775,"score_gpt":0.32206122597874864,"score_spread":0.24383896695587115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164474269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29258093,0.0007895462,0.67108554,0.0020329047,0.00019563224,0.00032708384,0.0016837434,0.0005771295,0.030727513],"genre_scores_gemma":[0.9103372,0.0003732586,0.07814766,0.0002317694,0.00013802465,0.0002349843,0.0014066369,0.00011589713,0.00901446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988205,0.00047624335,0.000048790902,0.00026081776,0.00014401045,0.00024967495],"domain_scores_gemma":[0.9985135,0.0009046787,0.00021297329,0.00007489582,0.00014677252,0.00014714853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097294105,0.0009363952,0.0011104844,0.0005861874,0.0008182111,0.0014188834,0.0012206243,0.0014863937,0.007005978],"category_scores_gemma":[0.00282286,0.0004446032,0.0007463046,0.0012200983,0.0006749221,0.0015365405,0.0008545275,0.00084010966,0.0005791782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023453523,0.00018439259,0.00082499254,0.00017390658,0.00006408511,0.00026808016,0.000071897826,0.9266814,0.0011035346,0.032731004,0.0073955976,0.03026656],"study_design_scores_gemma":[0.0000636892,0.0000738442,0.00036885223,0.000015030013,0.000014024912,0.00009601414,0.00006793687,0.9645175,0.0004853275,0.03174078,0.0025451737,0.000011885819],"about_ca_topic_score_codex":0.0049766134,"about_ca_topic_score_gemma":0.0032516227,"teacher_disagreement_score":0.007005978,"about_ca_system_score_codex":0.0010970435,"about_ca_system_score_gemma":0.001093394,"threshold_uncertainty_score":0.02343738},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; McMaster University","keywords":"Censoring (clinical trials); Mathematics; Exponential distribution; Estimator; Statistics; Applied mathematics; Confidence interval; Exponential function; Exponential family; Mathematical analysis","score_opus":0.2947497052201789,"score_gpt":0.489670309686943,"score_spread":0.19492060446676407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167666647","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03288983,0.00025587532,0.9658252,0.00013445059,0.000019316793,0.000026766664,0.000060121016,0.00009259434,0.00069588656],"genre_scores_gemma":[0.77337307,0.0005060489,0.22331378,0.00020370417,0.00012119198,0.00016726438,0.00035033232,0.00006769619,0.0018969116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9920813,0.004614303,0.00034960776,0.000851818,0.00169449,0.00040847372],"domain_scores_gemma":[0.92782146,0.05398296,0.004828121,0.009446162,0.0033869036,0.00053435983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017020224,0.0006817299,0.001366369,0.0015150699,0.00048543338,0.00197554,0.0025615797,0.0020146556,0.0018191369],"category_scores_gemma":[0.07510585,0.0007414681,0.001241539,0.0018358941,0.0033319264,0.003917435,0.0028827842,0.0022214877,0.00034339787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080207654,0.00012844121,0.015847469,0.00032780867,0.00035499522,0.000715819,0.00059911987,0.46101862,0.0051119993,0.39918995,0.0016251192,0.114278644],"study_design_scores_gemma":[0.00010197572,0.00007764425,0.0026091647,0.00005577517,0.000048168036,0.00023361025,0.000060946462,0.8180996,0.0031056753,0.17464532,0.0008992991,0.00006285251],"about_ca_topic_score_codex":0.0016294112,"about_ca_topic_score_gemma":0.0012478033,"teacher_disagreement_score":0.017020224,"about_ca_system_score_codex":0.0012748471,"about_ca_system_score_gemma":0.0008438311,"threshold_uncertainty_score":0.09001261},"labels":[],"label_agreement":null},{"id":"W2169755126","doi":"10.1002/nav.20156","title":"On‐line parameter estimation for a partially observable system subject to random failure","year":2006,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Structural Health Monitoring Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"U.S. Navy","keywords":"Observable; Constraint (computer-aided design); State (computer science); Computer science; Domain (mathematical analysis); Projection (relational algebra); State space; Algorithm; Mathematical optimization; Line (geometry); Process (computing); Estimation; Estimation theory; Mathematics; Statistics","score_opus":0.12708486433123758,"score_gpt":0.4047882520786528,"score_spread":0.2777033877474152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169755126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104812145,0.000080901176,0.8940542,0.00018241101,0.0000065774293,0.00003111668,0.0000436878,0.00026018417,0.0005288334],"genre_scores_gemma":[0.96774846,0.00006391571,0.031179726,0.000032037424,0.0000139806,0.000049143007,0.000088017056,0.000043232405,0.00078156206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990897,0.00043003287,0.00003114239,0.00018799111,0.00017921,0.000081899474],"domain_scores_gemma":[0.99460006,0.0041489336,0.0006822629,0.00022220996,0.0002729382,0.00007362268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017769337,0.000844945,0.0013953695,0.0005814875,0.0003268783,0.0009895792,0.00082297076,0.0013452312,0.001119816],"category_scores_gemma":[0.008838361,0.0006725835,0.0005393763,0.00038547078,0.0012624286,0.0013128514,0.0010085516,0.0009461697,0.0001764296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047043686,0.000017700855,0.00080435036,0.000026788764,0.000019822808,0.00007625385,0.00004875548,0.9874385,0.0011669716,0.0012578875,0.000092330105,0.009003608],"study_design_scores_gemma":[0.000002815522,0.000009612812,0.0001654865,0.0000014175897,0.0000015794942,0.0000068417157,0.000004325328,0.9990395,0.00018439641,0.0005576954,0.000023413388,0.000002812688],"about_ca_topic_score_codex":0.008957261,"about_ca_topic_score_gemma":0.003948007,"teacher_disagreement_score":0.008957261,"about_ca_system_score_codex":0.0007593239,"about_ca_system_score_gemma":0.000690275,"threshold_uncertainty_score":0.017810285},"labels":[],"label_agreement":null},{"id":"W2276622541","doi":"10.1002/nav.21672","title":"Using a birth‐and‐death process to estimate the steady‐state distribution of a periodic queue","year":2015,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Division of Civil, Mechanical and Manufacturing Innovation; National Science Foundation","keywords":"Steady state (chemistry); Queue; Queueing theory; Poisson distribution; Burke's theorem; Applied mathematics; Distribution (mathematics); Parametric statistics; Function (biology); Mathematics; State (computer science); Bulk queue; Birth–death process; Computer science; Mathematical optimization; Statistics; Mathematical analysis; Algorithm; Fork–join queue; Queue management system; Population","score_opus":0.1770562333190942,"score_gpt":0.44507910199850137,"score_spread":0.26802286867940717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2276622541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14620312,0.00006254905,0.85246277,0.00010080008,0.000017639337,0.00006775663,0.00007341977,0.00032547105,0.00068651926],"genre_scores_gemma":[0.87640876,0.00014295336,0.121954195,0.00005142249,0.000029096354,0.00015973598,0.0003049945,0.0000450148,0.00090390415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942005,0.00019369752,0.000038792477,0.0001286042,0.00016315648,0.0000557694],"domain_scores_gemma":[0.9947849,0.0032082277,0.00077324174,0.0005549855,0.00056148577,0.000117183656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041738716,0.00059520564,0.000597357,0.0017303227,0.00052160147,0.0009153263,0.0011354684,0.0010255304,0.00097070367],"category_scores_gemma":[0.019301036,0.0005494417,0.00069191994,0.0009942155,0.00081743684,0.0017269261,0.0010105132,0.0012680824,0.00021358127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021830984,0.00014113329,0.024567602,0.000109246306,0.000121383455,0.00020895299,0.0004091296,0.8702836,0.007722246,0.046231538,0.0006591324,0.049327772],"study_design_scores_gemma":[0.000008586964,0.000021119933,0.0014402756,0.0000067571373,0.000007359306,0.000027988706,0.00001597301,0.9920258,0.0008418919,0.005438683,0.00015166524,0.000013945092],"about_ca_topic_score_codex":0.006184649,"about_ca_topic_score_gemma":0.0027095631,"teacher_disagreement_score":0.006184649,"about_ca_system_score_codex":0.0011078338,"about_ca_system_score_gemma":0.0011549526,"threshold_uncertainty_score":0.022073805},"labels":[],"label_agreement":null},{"id":"W2425386664","doi":"10.1002/nav.21690","title":"Minimizing the false alarm rate in systems with transient abnormality","year":2016,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Advanced Statistical Process Monitoring","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Lagrange multiplier; Abnormality; False alarm; Transient (computer programming); Multiplier (economics); Markov decision process; Partially observable Markov decision process; Observable; ALARM; Markov process; Limit (mathematics); Mathematics; Computer science; Control theory (sociology); Mathematical optimization; Statistics; Control (management); Artificial intelligence; Engineering","score_opus":0.47855275849656786,"score_gpt":0.5339279314822801,"score_spread":0.05537517298571226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2425386664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20854911,0.00024512204,0.7891909,0.0004950865,0.000025239644,0.000041098607,0.00005829675,0.00023744904,0.0011576647],"genre_scores_gemma":[0.9849155,0.000058552643,0.014578152,0.00003788137,0.000014729294,0.000020568968,0.000024315881,0.0000127267485,0.0003377225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998319,0.00064852217,0.00008227875,0.00028852263,0.00036585896,0.0002959436],"domain_scores_gemma":[0.9884824,0.008542042,0.0016900764,0.00037633674,0.0006123098,0.00029682546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036429188,0.00096436706,0.0012931303,0.0006093462,0.00034288198,0.0014270241,0.0012174753,0.0012459162,0.00065830426],"category_scores_gemma":[0.015717564,0.0005071766,0.0005402669,0.000488646,0.0010933293,0.001355849,0.0010273899,0.0010834597,0.00008796112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017540542,0.000041449857,0.0017452068,0.000053797383,0.000036982052,0.00010385493,0.000050050647,0.9743401,0.0025470208,0.010513874,0.00023343193,0.010158928],"study_design_scores_gemma":[0.000007842319,0.00004199847,0.00030389146,0.0000045087977,0.000008121907,0.000018232076,0.00000601588,0.9949818,0.0007167401,0.0038582552,0.00004749801,0.000005145223],"about_ca_topic_score_codex":0.0033487363,"about_ca_topic_score_gemma":0.0012182925,"teacher_disagreement_score":0.0036429188,"about_ca_system_score_codex":0.0013966445,"about_ca_system_score_gemma":0.001451339,"threshold_uncertainty_score":0.01926583},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08024940735387746,"score_gpt":0.3134920227540284,"score_spread":0.2332426154001509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2513254237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2459093,0.0014165042,0.71503353,0.0043663974,0.00016147138,0.00015478901,0.00021802327,0.00012014271,0.032619875],"genre_scores_gemma":[0.9832591,0.0005162295,0.012109544,0.000090114016,0.00006742885,0.000059934264,0.00003522272,0.000018692665,0.0038437687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99617416,0.0021030589,0.00014917833,0.0004938547,0.00058010337,0.0004997278],"domain_scores_gemma":[0.9876936,0.008676477,0.0019135372,0.00046258522,0.00072892534,0.00052486756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054076537,0.00083845144,0.0012641143,0.0008283412,0.001410161,0.0034457927,0.0016255466,0.0028190624,0.0068930974],"category_scores_gemma":[0.018525997,0.00086168566,0.0008811569,0.0016917025,0.0035568567,0.0046727965,0.001838359,0.002026712,0.0003579243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008492383,0.000035234756,0.0009598667,0.00004054135,0.00003465341,0.00024297657,0.00015088067,0.7727398,0.00041029855,0.22053431,0.0007095824,0.004056873],"study_design_scores_gemma":[0.00004385671,0.000050314156,0.00036178876,0.00002733538,0.00001541675,0.00005596519,0.00015045764,0.832048,0.00016166104,0.16593741,0.0011240104,0.000023845709],"about_ca_topic_score_codex":0.010132133,"about_ca_topic_score_gemma":0.0046668984,"teacher_disagreement_score":0.010132133,"about_ca_system_score_codex":0.0037932445,"about_ca_system_score_gemma":0.002408544,"threshold_uncertainty_score":0.028598726},"labels":[],"label_agreement":null},{"id":"W2518829358","doi":"10.1002/nav.21701","title":"Column generation for stochastic green telecommunication network planning with switchable base stations","year":2016,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Column generation; Base station; Mathematical optimization; Computer science; Column (typography); Base (topology); Energy consumption; Reduction (mathematics); Telecommunications network; Network planning and design; Scheme (mathematics); Operations research; Telecommunications; Mathematics; Engineering; Electrical engineering","score_opus":0.20237634617127043,"score_gpt":0.401718522681826,"score_spread":0.19934217651055558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518829358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095059775,0.0005709033,0.89354885,0.00058034685,0.00009426592,0.00018348667,0.00093903823,0.000345439,0.008677892],"genre_scores_gemma":[0.8805721,0.00039389217,0.113490224,0.00016368744,0.00004490518,0.00030128754,0.00078412174,0.00009908026,0.0041506747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946195,0.00024476508,0.000014527382,0.000073702926,0.000098443394,0.00010660066],"domain_scores_gemma":[0.9984907,0.0011411424,0.00013394273,0.000047781883,0.000111842804,0.00007457723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010951478,0.0010556711,0.0012586826,0.0006221181,0.0003798192,0.0011774539,0.0008376613,0.00083093613,0.0046002306],"category_scores_gemma":[0.002021324,0.0006748642,0.0008689877,0.0013416741,0.00069658837,0.00067983416,0.0007734951,0.0012178407,0.00025547974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024098403,0.000012112493,0.000102902595,0.000019283649,0.000009972686,0.000033092387,0.000008046821,0.99315965,0.00014099739,0.0033585082,0.00035311744,0.0027782866],"study_design_scores_gemma":[0.0000084253525,0.000010294201,0.000038425285,0.0000027168373,0.0000032869943,0.0000041506864,0.0000058831174,0.99732375,0.000108304805,0.00231418,0.00017818918,0.0000024161334],"about_ca_topic_score_codex":0.010580223,"about_ca_topic_score_gemma":0.009302565,"teacher_disagreement_score":0.010580223,"about_ca_system_score_codex":0.0013981728,"about_ca_system_score_gemma":0.0013734258,"threshold_uncertainty_score":0.02103728},"labels":[],"label_agreement":null},{"id":"W2626322824","doi":"10.1002/nav.21744","title":"Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness","year":2017,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Program of Shanghai Subject Chief Scientist; National Science Foundation","keywords":"Tardiness; Computer science; Mathematical optimization; Rule-based system; Scheduling (production processes); Due date; Generalization; Heuristic; Flexibility (engineering); Job shop scheduling; Mathematics; Artificial intelligence; Schedule; Statistics","score_opus":0.053385622953814126,"score_gpt":0.35910513682206563,"score_spread":0.3057195138682515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626322824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05023794,0.00022938118,0.9477302,0.0001196982,0.000053880267,0.00012011605,0.00007672346,0.00016901479,0.0012631123],"genre_scores_gemma":[0.5319388,0.00032262757,0.4650886,0.0000888321,0.000105214334,0.00027953516,0.00024824735,0.00016016715,0.0017679452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810934,0.00059236225,0.00013560892,0.00044131448,0.0005293378,0.00019195127],"domain_scores_gemma":[0.99707615,0.0016330049,0.00043039804,0.00020573167,0.00045666622,0.00019802425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002914285,0.001318005,0.0019402095,0.0008886419,0.00049640296,0.0008672655,0.0014623099,0.00071430265,0.0011680796],"category_scores_gemma":[0.0053068213,0.0004904512,0.0011873257,0.0012924691,0.0007499069,0.0010097986,0.00059011986,0.0012283864,0.00020189983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058750353,0.000045481916,0.00048208193,0.00006709385,0.000023202081,0.000058201054,0.000024579494,0.9751354,0.0030140425,0.0036920565,0.00037433728,0.017024795],"study_design_scores_gemma":[0.000012590362,0.00006291802,0.00013780908,0.0000030631131,0.000007982097,0.000017567874,0.0000043417776,0.9959461,0.0007039086,0.0028168724,0.00028067242,0.000006228308],"about_ca_topic_score_codex":0.0036591091,"about_ca_topic_score_gemma":0.0022591883,"teacher_disagreement_score":0.0036591091,"about_ca_system_score_codex":0.0007952175,"about_ca_system_score_gemma":0.002120859,"threshold_uncertainty_score":0.01541239},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.31615754982879296,"score_gpt":0.5291424650935893,"score_spread":0.21298491526479635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897601180","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010058125,0.00019570568,0.9886126,0.000045442765,0.000041521886,0.000048923062,0.000060889448,0.00043056134,0.00050622865],"genre_scores_gemma":[0.7557567,0.0004901192,0.24132349,0.00010838356,0.00016447903,0.00036560986,0.00042001894,0.00012302426,0.0012481399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992922,0.0017731942,0.0005053875,0.0017769228,0.0026312894,0.00039116092],"domain_scores_gemma":[0.9840508,0.0072313827,0.0027327717,0.0012814645,0.004168748,0.0005347122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005610023,0.0015730754,0.0014984395,0.0026971535,0.0009732772,0.003096545,0.0018129979,0.0010262785,0.0010312127],"category_scores_gemma":[0.020266246,0.00034548648,0.00081162574,0.0017740104,0.0021557596,0.0027077624,0.0015826983,0.0016555768,0.0002704655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073706603,0.00020990739,0.0041857073,0.00033435703,0.00012373428,0.00025379137,0.00029548266,0.6022179,0.016593007,0.08603424,0.0027158791,0.28629887],"study_design_scores_gemma":[0.000022139006,0.00017234025,0.00081268075,0.000015317642,0.000020014015,0.0000497846,0.000016676375,0.983827,0.0062317047,0.007714343,0.0010577735,0.00006023483],"about_ca_topic_score_codex":0.004631668,"about_ca_topic_score_gemma":0.0017336675,"teacher_disagreement_score":0.005610023,"about_ca_system_score_codex":0.0014398388,"about_ca_system_score_gemma":0.0021766329,"threshold_uncertainty_score":0.029668987},"labels":[],"label_agreement":null},{"id":"W2902347415","doi":"10.1002/nav.21812","title":"On the optimality of the sequential approach for network design problems of service operations","year":2018,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Queueing theory; Computer science; Service (business); Network planning and design; Mathematical optimization; Blocking (statistics); Operations research; Node (physics); Service level; Computer network; Mathematics; Engineering; Business","score_opus":0.3588176909191449,"score_gpt":0.3746397095365279,"score_spread":0.015822018617383027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902347415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029559419,0.00032367613,0.9587095,0.0005992439,0.000052011797,0.00021537638,0.00014345738,0.00012328904,0.010274019],"genre_scores_gemma":[0.49573988,0.00096870004,0.49339524,0.0003557173,0.00017674333,0.00080604333,0.00048234503,0.00022054247,0.007854796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967751,0.0019647758,0.00009957317,0.00037306675,0.00048188865,0.0003056476],"domain_scores_gemma":[0.98669213,0.01170352,0.00043202486,0.0002684484,0.00066511356,0.00023874268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064095124,0.001998751,0.0018499892,0.0015743979,0.0009830348,0.0015551723,0.0013138409,0.0014213773,0.00811811],"category_scores_gemma":[0.015239803,0.0013528179,0.0011101098,0.0015130154,0.0021041858,0.0026972485,0.0016359946,0.0017054521,0.0005873204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017067556,0.00008979435,0.00038382522,0.00012622062,0.000035054145,0.00004402775,0.000061050516,0.9355658,0.0006458623,0.04860978,0.0007735642,0.013494301],"study_design_scores_gemma":[0.000070338356,0.00009120212,0.00007543535,0.000013825712,0.0000105305535,0.000011748958,0.000012905823,0.9563619,0.00023670992,0.04249672,0.00061388576,0.0000047821136],"about_ca_topic_score_codex":0.008064914,"about_ca_topic_score_gemma":0.0073803538,"teacher_disagreement_score":0.00811811,"about_ca_system_score_codex":0.0030862512,"about_ca_system_score_gemma":0.003572228,"threshold_uncertainty_score":0.03389716},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.07392465770975362,"score_gpt":0.44939679587568815,"score_spread":0.3754721381659345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903293455","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009592661,0.000040510855,0.9982266,0.00003726615,0.000022277583,0.000019226321,0.000021705955,0.0001505471,0.00052272977],"genre_scores_gemma":[0.15285803,0.00025131012,0.8430764,0.00013682626,0.0001384333,0.00024193167,0.00020521139,0.0003052705,0.002786533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850094,0.0005097657,0.00009730571,0.00023338776,0.0005336886,0.00012489536],"domain_scores_gemma":[0.997692,0.00096904923,0.00016230237,0.00036358568,0.00070093235,0.000112123984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016440431,0.0007064164,0.0010846949,0.0020709608,0.00076669594,0.0011389556,0.0018462472,0.00084797415,0.005806489],"category_scores_gemma":[0.0059446525,0.0004206454,0.0012310774,0.0016007441,0.0011636313,0.002312271,0.0018034074,0.0019744996,0.0012796475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013474216,0.00009775974,0.001266009,0.00022640429,0.000086476786,0.00019291486,0.00016439984,0.20035921,0.008914225,0.51879627,0.005350974,0.2644106],"study_design_scores_gemma":[0.00001155327,0.000016094722,0.00006961277,0.000012094821,0.000007940363,0.000044607397,0.000008035034,0.9367129,0.0012678608,0.059998434,0.0018364262,0.000014328096],"about_ca_topic_score_codex":0.002866082,"about_ca_topic_score_gemma":0.0021180192,"teacher_disagreement_score":0.005806489,"about_ca_system_score_codex":0.0011017969,"about_ca_system_score_gemma":0.002256332,"threshold_uncertainty_score":0.019424617},"labels":[],"label_agreement":null},{"id":"W2911482137","doi":"10.1002/nav.21829","title":"Stability in a general oligopoly model","year":2019,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Oligopoly; Monotonic function; Affine transformation; Operator (biology); Mathematical economics; Competitor analysis; Economics; Piecewise; Nash equilibrium; Stability (learning theory); Convergence (economics); Mathematics; Cournot competition; Computer science","score_opus":0.17802495443545704,"score_gpt":0.37538903404606255,"score_spread":0.1973640796106055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911482137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44028804,0.0006264943,0.49527404,0.0023308066,0.00008024154,0.000120164,0.0003846231,0.00034660244,0.06054899],"genre_scores_gemma":[0.9877336,0.0001569054,0.0064130323,0.000074604475,0.00001873153,0.00003960759,0.00006077941,0.000024616002,0.005478025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995388,0.00018938267,0.000013075331,0.00009364622,0.00008866812,0.00007647739],"domain_scores_gemma":[0.9993311,0.00030747906,0.00011375218,0.0000612233,0.000109445224,0.00007697548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007140021,0.00052447384,0.00084866444,0.00057605037,0.00073344284,0.0016410814,0.00093703956,0.00130315,0.0039955447],"category_scores_gemma":[0.00216999,0.00037318034,0.0007628251,0.0004772268,0.0019072626,0.0014297903,0.0012411546,0.0009386274,0.0004196809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058749305,0.000034950477,0.0004865155,0.00004359009,0.00002548997,0.00021662196,0.00012514743,0.7143061,0.00217511,0.27926433,0.0009560499,0.0023073598],"study_design_scores_gemma":[0.000012312249,0.000020367706,0.00010893085,0.000005464502,0.000004968582,0.000028040955,0.000024231995,0.9408957,0.000081970466,0.058313992,0.0004970079,0.0000070742485],"about_ca_topic_score_codex":0.007419508,"about_ca_topic_score_gemma":0.002892711,"teacher_disagreement_score":0.007419508,"about_ca_system_score_codex":0.001457773,"about_ca_system_score_gemma":0.0009864287,"threshold_uncertainty_score":0.014752626},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02403362018165716,"score_gpt":0.28359709786572646,"score_spread":0.2595634776840693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918288952","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9492956,0.00034580688,0.006825371,0.0005110751,0.00001935653,0.0000580063,0.00012489801,0.000012200771,0.04280781],"genre_scores_gemma":[0.9983725,0.0000857037,0.00049188116,0.000020960417,0.0000071518543,0.000012640598,0.000018621045,0.0000019128636,0.0009886979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989046,0.00033472304,0.00002221008,0.000080999576,0.00021279273,0.00044460132],"domain_scores_gemma":[0.995858,0.0021425206,0.0010512775,0.0001382385,0.0003429681,0.0004670074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011795762,0.00042716254,0.0005020976,0.0007588888,0.0008058563,0.0023926334,0.0005605291,0.00079928647,0.010961428],"category_scores_gemma":[0.00311643,0.00028498162,0.00073288946,0.0007927789,0.00247869,0.0024061874,0.0026320757,0.0008910524,0.00021405076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081698387,0.0014102504,0.05341397,0.00024235998,0.0003260553,0.0011264307,0.0002901339,0.48108488,0.010083932,0.4110391,0.0019490747,0.038216732],"study_design_scores_gemma":[0.00032279477,0.0019172063,0.08438858,0.00020177552,0.0004321097,0.00034987187,0.0034424432,0.59223604,0.005603126,0.30301803,0.007903806,0.00018415602],"about_ca_topic_score_codex":0.0069904868,"about_ca_topic_score_gemma":0.0074891397,"teacher_disagreement_score":0.010961428,"about_ca_system_score_codex":0.0026086138,"about_ca_system_score_gemma":0.0013668219,"threshold_uncertainty_score":0.03666967},"labels":[],"label_agreement":null},{"id":"W2994279688","doi":"10.1002/nav.21881","title":"Integrating decisions with advance supply information in an assemble‐to‐order system","year":2019,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Fundamental Research Funds for the Central Universities; Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Stochastic programming; Computer science; Mathematical optimization; Component (thermodynamics); Dynamic programming; Lead time; Heuristic; Newsvendor model; Operations research; Order (exchange); Inventory control; Supply chain; Mathematics; Economics; Operations management; Algorithm","score_opus":0.06738627273388267,"score_gpt":0.34090367214070644,"score_spread":0.27351739940682374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994279688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47036025,0.00030469903,0.5187267,0.00088951504,0.00006664495,0.00020317858,0.00039072707,0.00026277898,0.008795477],"genre_scores_gemma":[0.9851837,0.00011394113,0.0125301145,0.000031938016,0.000024590323,0.000054544777,0.00007281266,0.000013455355,0.0019748725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863774,0.00052193983,0.000052299292,0.0001913076,0.00032532468,0.00027142055],"domain_scores_gemma":[0.996894,0.0019874137,0.0005167521,0.00011752196,0.00027061425,0.0002136878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00245966,0.00096934324,0.0015325462,0.0007527439,0.0007466759,0.001972668,0.0011190233,0.0015070768,0.002762459],"category_scores_gemma":[0.005680615,0.001297877,0.00085565564,0.0010531147,0.000885391,0.0015872326,0.00096190866,0.0015051579,0.00023091542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004308362,0.000025857433,0.0002786221,0.000010038131,0.0000079332685,0.000064059364,0.000018588831,0.99540013,0.00021885615,0.0023845327,0.00006824803,0.001480098],"study_design_scores_gemma":[0.000009214318,0.000032482905,0.00013568909,0.0000019283725,0.0000062890863,0.000007501475,0.000008901471,0.99835,0.00011829472,0.0012410224,0.00008321557,0.0000054346337],"about_ca_topic_score_codex":0.0142621305,"about_ca_topic_score_gemma":0.009805338,"teacher_disagreement_score":0.0142621305,"about_ca_system_score_codex":0.0017860298,"about_ca_system_score_gemma":0.0021183195,"threshold_uncertainty_score":0.028358221},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.20184127275942712,"score_gpt":0.37416584010891896,"score_spread":0.17232456734949184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000225146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16739973,0.00012628312,0.8228663,0.0002831203,0.00005199134,0.00041373406,0.00029140757,0.00036819265,0.008199193],"genre_scores_gemma":[0.85887444,0.00017437736,0.13580336,0.000041429197,0.000022052078,0.0002287629,0.00026062882,0.00008265197,0.004512305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958795,0.00015904767,0.000012572308,0.00006898152,0.00007378346,0.000097606644],"domain_scores_gemma":[0.9989976,0.0004720021,0.00020470434,0.000046064513,0.00016268426,0.000116889234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010622061,0.000838626,0.0008916228,0.00062513124,0.00045019994,0.00093452487,0.00091714965,0.0007071,0.00603571],"category_scores_gemma":[0.0028594749,0.00041267418,0.0005292862,0.00061274,0.00040801064,0.00066691905,0.00065927836,0.0007298135,0.00037766562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005849107,0.00004287595,0.0003433,0.000062823674,0.000008929023,0.00004077113,0.00003541095,0.9806246,0.0008885124,0.004728014,0.0005336433,0.012632566],"study_design_scores_gemma":[0.0000110606825,0.000038238457,0.00006429223,0.0000026326022,0.0000036968702,0.0000042550714,0.000018549692,0.9985613,0.00019047779,0.00085048215,0.00025305856,0.0000019267638],"about_ca_topic_score_codex":0.010473903,"about_ca_topic_score_gemma":0.008100984,"teacher_disagreement_score":0.010473903,"about_ca_system_score_codex":0.0017065014,"about_ca_system_score_gemma":0.0023265998,"threshold_uncertainty_score":0.020825863},"labels":[],"label_agreement":null},{"id":"W3015682257","doi":"10.1002/nav.21901","title":"Efficient algorithms for flexible job shop scheduling with parallel machines","year":2020,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Job shop scheduling; Computer science; Scheduling (production processes); Schedule; Upper and lower bounds; Mathematical optimization; Algorithm; Flow shop scheduling; Mathematics","score_opus":0.13850951942115866,"score_gpt":0.3646678265404282,"score_spread":0.2261583071192695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015682257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014654054,0.00022338796,0.98266035,0.00012147595,0.000042044026,0.00008991479,0.00005533988,0.0003953236,0.0017581587],"genre_scores_gemma":[0.31056172,0.00025448378,0.6861794,0.000049579994,0.00007416148,0.0003780025,0.00021154703,0.00015848842,0.002132526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884546,0.00043353238,0.000062804065,0.00018593683,0.00029024412,0.00018196198],"domain_scores_gemma":[0.9985374,0.00094096566,0.0001319167,0.00018323136,0.00014681257,0.000059685004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017648159,0.0009940639,0.0010292693,0.00088609324,0.0008468776,0.0010326141,0.0016983851,0.0009609569,0.0028265535],"category_scores_gemma":[0.0040856376,0.0007135879,0.0008376074,0.0015524485,0.0008741228,0.0012457668,0.001597247,0.001103813,0.00047191983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013345035,0.00006437324,0.00018032824,0.00008276099,0.00002691788,0.000044697754,0.000048906488,0.91499466,0.0011844708,0.023657637,0.0013381733,0.058243588],"study_design_scores_gemma":[0.00003767119,0.000021125841,0.000044528275,0.0000036806066,0.0000030619203,0.000009326844,0.000007097675,0.9829974,0.00028691394,0.016035799,0.00054922065,0.000004173081],"about_ca_topic_score_codex":0.0030087365,"about_ca_topic_score_gemma":0.0025402156,"teacher_disagreement_score":0.0030087365,"about_ca_system_score_codex":0.0010441467,"about_ca_system_score_gemma":0.0014703863,"threshold_uncertainty_score":0.00945574},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.26518561080921804,"score_gpt":0.3982246204879279,"score_spread":0.13303900967870985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027296912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33581358,0.00087537844,0.6534513,0.0005077054,0.000058157464,0.00032956997,0.0006195419,0.000394809,0.007950052],"genre_scores_gemma":[0.9035616,0.00029697444,0.09279968,0.00008463689,0.000028488195,0.00019730363,0.0005908588,0.00006416296,0.0023763108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948466,0.00017560965,0.000017550492,0.00012947606,0.00007874426,0.00011400273],"domain_scores_gemma":[0.99925727,0.0004281655,0.00010352845,0.000044255747,0.000086497465,0.00008026806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006984547,0.0012385425,0.0010654564,0.00068521575,0.00051026815,0.00092570274,0.0012820753,0.0010126358,0.0027124975],"category_scores_gemma":[0.0016104693,0.00044238588,0.0006907755,0.0013434849,0.00055331027,0.001101907,0.0007099904,0.0006202009,0.00018273284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064647465,0.000057851652,0.0006936904,0.000066789595,0.00003012011,0.000106554544,0.000041183404,0.9825033,0.0007472469,0.003738063,0.0008268911,0.011123795],"study_design_scores_gemma":[0.00001618007,0.00003990611,0.00021719752,0.0000052855935,0.0000084327685,0.000020051686,0.00005482853,0.99640405,0.00040172235,0.0023531653,0.00047471418,0.000004403284],"about_ca_topic_score_codex":0.018118447,"about_ca_topic_score_gemma":0.009539776,"teacher_disagreement_score":0.018118447,"about_ca_system_score_codex":0.0012720452,"about_ca_system_score_gemma":0.0010487749,"threshold_uncertainty_score":0.03602594},"labels":[],"label_agreement":null},{"id":"W3034227841","doi":"10.1002/nav.21908","title":"Multiclass state‐dependent service systems with returns","year":2020,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Workload; Computer science; Service system; Service (business); Rework; Queueing theory; Markov chain; Markov process; Stability (learning theory); Operations research; System dynamics; Mathematical optimization; Computer network; Mathematics; Economics; Statistics","score_opus":0.14137741078807226,"score_gpt":0.3397664212838575,"score_spread":0.19838901049578522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034227841","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7824343,0.0002853911,0.20946464,0.0013420504,0.00009777265,0.00007255502,0.00016036924,0.00028092338,0.005861936],"genre_scores_gemma":[0.9963775,0.00005115775,0.0018029808,0.00003539595,0.000022443637,0.000018374089,0.000022405848,0.000008358356,0.0016613472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986469,0.00031506317,0.000059078488,0.00026420463,0.00028286988,0.00043192008],"domain_scores_gemma":[0.996268,0.0018549532,0.000861342,0.00019395568,0.00050352846,0.0003181502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016602294,0.00060545304,0.0011646593,0.00074720825,0.00096704904,0.0026332429,0.0013779078,0.001552407,0.0024127157],"category_scores_gemma":[0.0066098957,0.00043481015,0.0005706798,0.00077147706,0.0016135926,0.0016528876,0.0013718219,0.0015090205,0.00026755602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021871223,0.00015663546,0.005423701,0.000053463827,0.00008318093,0.0009094066,0.0003771987,0.9084182,0.00499695,0.071050584,0.00067191594,0.007640037],"study_design_scores_gemma":[0.000010250711,0.000019378922,0.00043549694,0.0000036421918,0.000009489493,0.00003349559,0.000050006147,0.99110913,0.00029939887,0.00784148,0.00017877005,0.000009459731],"about_ca_topic_score_codex":0.014344688,"about_ca_topic_score_gemma":0.005793552,"teacher_disagreement_score":0.014344688,"about_ca_system_score_codex":0.0025018074,"about_ca_system_score_gemma":0.0010824343,"threshold_uncertainty_score":0.028522372},"labels":[],"label_agreement":null},{"id":"W3043896928","doi":"10.1002/nav.21931","title":"Optimal policies for stochastic clearing systems with time‐dependent delay penalties","year":2020,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Clearing; Markov decision process; Mathematical optimization; Markov process; Computer science; Function (biology); Nonlinear system; Sequence (biology); Time horizon; Process (computing); State (computer science); Control theory (sociology); Mathematics; Algorithm; Economics; Finance","score_opus":0.10854618172520832,"score_gpt":0.3431260228406786,"score_spread":0.2345798411154703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043896928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36721107,0.00029710578,0.62659353,0.0004950467,0.00006492776,0.00015668054,0.00015656256,0.00041583774,0.0046092058],"genre_scores_gemma":[0.9806748,0.000070828326,0.018359274,0.0000308706,0.0000075547114,0.00003662445,0.000039457973,0.000023794126,0.0007567493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853265,0.0005748147,0.00007415864,0.00019650676,0.00021131171,0.0004105732],"domain_scores_gemma":[0.9917344,0.0057246597,0.001084057,0.00024722767,0.00070580473,0.00050388195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031236766,0.000642473,0.0012599521,0.0007483296,0.00067863823,0.001915166,0.00093363086,0.0009828612,0.003089677],"category_scores_gemma":[0.009178096,0.00067638705,0.00039820018,0.00063200464,0.0015566658,0.0015115378,0.00082447584,0.0010212901,0.00022583519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046427325,0.000028080083,0.00020365661,0.000011753115,0.0000065641793,0.000016814638,0.000020060601,0.9897425,0.00037140335,0.007833521,0.00012966317,0.0015895447],"study_design_scores_gemma":[0.000008636112,0.000011271931,0.000045180437,0.0000019422314,0.0000017544858,0.0000022709364,0.000007878913,0.99689806,0.00015555124,0.002811531,0.000053096945,0.000002769665],"about_ca_topic_score_codex":0.012314025,"about_ca_topic_score_gemma":0.0056644212,"teacher_disagreement_score":0.012314025,"about_ca_system_score_codex":0.0034097333,"about_ca_system_score_gemma":0.0033710697,"threshold_uncertainty_score":0.024739444},"labels":[],"label_agreement":null},{"id":"W3046948313","doi":"10.1002/nav.21932","title":"Application of Markov renewal theory and <scp>semi‐Markov</scp> decision processes in maintenance modeling and optimization of multi‐unit systems","year":2020,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Partially observable Markov decision process; Markov decision process; Markov chain; Mathematical optimization; Renewal theory; Markov process; Markov renewal process; Dynamic programming; Markov model; Expression (computer science); Computer science; Production (economics); Mathematics; Variable-order Markov model; Statistics; Economics","score_opus":0.04714117010832025,"score_gpt":0.30967470172001044,"score_spread":0.2625335316116902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046948313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028498074,0.00032325764,0.9682843,0.00032417546,0.000041049414,0.00004200244,0.00004351946,0.00007939891,0.0023641973],"genre_scores_gemma":[0.9557148,0.00047641763,0.04118827,0.00007061381,0.000053197484,0.0001708552,0.00006708113,0.000027245294,0.002231582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988943,0.00047305843,0.000041545776,0.00012210655,0.00031485103,0.00015416002],"domain_scores_gemma":[0.9968015,0.0024704572,0.00027839135,0.00006642421,0.00030686017,0.00007633773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023482833,0.00065702526,0.001283784,0.0008009856,0.0005533132,0.0012258728,0.0011933123,0.00101558,0.0016829803],"category_scores_gemma":[0.0038963065,0.00058703753,0.0012165629,0.000769474,0.0015029944,0.0011755998,0.0007267278,0.0014582645,0.00014636958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010630254,0.000014546154,0.00020020628,0.000015890777,0.000014439191,0.000028373257,0.000014301515,0.9779654,0.00017427781,0.01985681,0.00010261809,0.0016024692],"study_design_scores_gemma":[0.0000020092632,0.0000048517613,0.000030998563,0.00000192649,0.0000018364647,0.0000022841753,0.0000016362667,0.99688464,0.000040614585,0.002987438,0.00003985958,0.0000018771271],"about_ca_topic_score_codex":0.014575934,"about_ca_topic_score_gemma":0.0064416323,"teacher_disagreement_score":0.014575934,"about_ca_system_score_codex":0.0019747438,"about_ca_system_score_gemma":0.0022338065,"threshold_uncertainty_score":0.028982162},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.16355111611098216,"score_gpt":0.37937214932021235,"score_spread":0.21582103320923018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3087437672","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65502095,0.00016232653,0.32690358,0.00096211064,0.000059345064,0.0007726718,0.000096207295,0.00030552142,0.015717307],"genre_scores_gemma":[0.9861085,0.000042888936,0.012256064,0.000044217853,0.000005484477,0.000120743345,0.00001176435,0.0000073415754,0.001402914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817634,0.0009735459,0.00005491883,0.00023649902,0.00017469487,0.00038397938],"domain_scores_gemma":[0.99720484,0.0016172729,0.00044301548,0.0001653008,0.00031081573,0.00025868602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026948778,0.00056312303,0.0010695751,0.0006023311,0.0005048631,0.0011111806,0.0009936861,0.0014697837,0.003982684],"category_scores_gemma":[0.0057228454,0.00049408537,0.00060096435,0.0003830766,0.0011025874,0.0016636376,0.0010265034,0.0010311415,0.000189276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075673364,0.0010745531,0.0031306492,0.00022165227,0.00007053233,0.00029371437,0.00016168725,0.8548279,0.0049705934,0.097355776,0.0009548664,0.036181416],"study_design_scores_gemma":[0.00034086258,0.00055346795,0.0016872095,0.00003194482,0.000053031497,0.000034263685,0.00012045413,0.9704718,0.0014764487,0.024052417,0.0011582101,0.000019777004],"about_ca_topic_score_codex":0.0036383383,"about_ca_topic_score_gemma":0.0024092752,"teacher_disagreement_score":0.003982684,"about_ca_system_score_codex":0.002329595,"about_ca_system_score_gemma":0.0026285918,"threshold_uncertainty_score":0.016902447},"labels":[],"label_agreement":null},{"id":"W3090010980","doi":"10.1002/nav.21940","title":"Responsive make‐to‐order supply chain network design","year":2020,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Computer science; Supply chain; Probabilistic logic; Linear programming; Response time; Constraint (computer-aided design); Lead time; Function (biology); Network planning and design; Time constraint; Supply chain network; Integer programming; Operations research; Supply chain management; Operations management; Mathematics; Engineering","score_opus":0.14886809413607202,"score_gpt":0.3424499092739956,"score_spread":0.19358181513792358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090010980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05502669,0.00030516842,0.9290566,0.00060547,0.000065301734,0.00028314238,0.00013565758,0.00021530129,0.01430664],"genre_scores_gemma":[0.8418826,0.00049665786,0.14248267,0.00020053111,0.00005241244,0.00048389036,0.00019407916,0.00008483025,0.014122368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878615,0.0005172342,0.000025487203,0.00019698995,0.00029206523,0.0001821397],"domain_scores_gemma":[0.9989095,0.00060033175,0.00016648781,0.000047200887,0.00017339653,0.00010313712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011532595,0.0012645165,0.0009921367,0.0009735191,0.0007398461,0.0014691917,0.0015779216,0.0017827682,0.0055468073],"category_scores_gemma":[0.0026665675,0.0007457116,0.0008751158,0.0009188916,0.0008384507,0.0013472211,0.0012384356,0.0012960975,0.00041033755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002442518,0.000026270978,0.00009725645,0.000032218646,0.000011437398,0.00005173948,0.000019339792,0.99023855,0.00066378893,0.0047766487,0.00019889194,0.0038593712],"study_design_scores_gemma":[0.000011203708,0.000044276967,0.00003590339,0.0000067707974,0.0000069069215,0.000009851706,0.000023596149,0.99386156,0.00041473156,0.004991719,0.000588295,0.000005154268],"about_ca_topic_score_codex":0.0039479616,"about_ca_topic_score_gemma":0.0036920458,"teacher_disagreement_score":0.0055468073,"about_ca_system_score_codex":0.0017058402,"about_ca_system_score_gemma":0.0013179616,"threshold_uncertainty_score":0.01855594},"labels":[],"label_agreement":null},{"id":"W3091971017","doi":"10.1002/nav.21951","title":"Cost‐raising internalization in supply chain design","year":2020,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Supply chain; Stylized fact; Profitability index; Business; Industrial organization; Competition (biology); Microeconomics; Raising (metalworking); Economics; Marketing","score_opus":0.44491130844910554,"score_gpt":0.39475618875211743,"score_spread":0.050155119696988104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091971017","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48091543,0.0005015328,0.45231062,0.0018359442,0.000043049316,0.0002726302,0.000037511345,0.000076147786,0.06400703],"genre_scores_gemma":[0.9881593,0.00009858031,0.010337732,0.000038076152,0.000008122853,0.00004087087,0.000005446191,0.000005215629,0.0013066249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99629945,0.0019594766,0.000118229545,0.0002907211,0.00066423527,0.0006679578],"domain_scores_gemma":[0.99297756,0.004101864,0.0010326646,0.00073990354,0.0007536601,0.00039434753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034505464,0.0006590174,0.00071361987,0.0007157773,0.0013292662,0.0029693,0.0010171192,0.0014391101,0.0035411504],"category_scores_gemma":[0.0085428925,0.0006258368,0.0008297529,0.0006749813,0.0039956262,0.003174547,0.0026262964,0.0017482186,0.0001759785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013873239,0.00018936282,0.003915368,0.00021016118,0.00008951301,0.0003862303,0.0008714362,0.3117624,0.0042727143,0.6498841,0.0005857731,0.027694298],"study_design_scores_gemma":[0.000059496095,0.00027291625,0.0027572191,0.00012859542,0.0001129285,0.00023575209,0.001144425,0.45250183,0.0037921343,0.5349558,0.003956961,0.00008195268],"about_ca_topic_score_codex":0.0029867527,"about_ca_topic_score_gemma":0.0032804501,"teacher_disagreement_score":0.004865385,"about_ca_system_score_codex":0.004865385,"about_ca_system_score_gemma":0.0031933964,"threshold_uncertainty_score":0.03530097},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Data envelopment analysis; Computer science; Set (abstract data type); Production (economics); Variable (mathematics); Operations research; Resource (disambiguation); Mathematical optimization; Economics; Mathematics; Microeconomics","score_opus":0.32896571994012475,"score_gpt":0.4641431767433246,"score_spread":0.13517745680319987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104895535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16427991,0.00055359886,0.8232043,0.00041120427,0.00002318146,0.0001586831,0.00009208948,0.000028778211,0.011248353],"genre_scores_gemma":[0.9225889,0.000270984,0.07627438,0.000027464655,0.000014892965,0.00016120997,0.000041777035,0.000014812765,0.00060561736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99066085,0.0057465383,0.0004424764,0.00070402987,0.0019190059,0.00052700844],"domain_scores_gemma":[0.9837795,0.012335863,0.0013835136,0.00088737014,0.0013663693,0.00024739827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015680825,0.0012011548,0.0016827264,0.0020067673,0.00093158934,0.004231236,0.0011543136,0.00091329264,0.0020662518],"category_scores_gemma":[0.032412853,0.00081353675,0.0013360719,0.0031566175,0.0022667483,0.002701221,0.003301567,0.0013455516,0.00011023023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080953476,0.000045555444,0.0025925674,0.00010227165,0.00012182284,0.00012894155,0.00017539396,0.86101514,0.00093851145,0.10969207,0.00015193477,0.02495491],"study_design_scores_gemma":[0.000017686016,0.0000972104,0.0021659145,0.00007531953,0.00006693469,0.000043741802,0.00020802952,0.8895206,0.0017018325,0.104804076,0.0012720254,0.000026686044],"about_ca_topic_score_codex":0.004292355,"about_ca_topic_score_gemma":0.0026443566,"teacher_disagreement_score":0.015680825,"about_ca_system_score_codex":0.0032419176,"about_ca_system_score_gemma":0.0021959373,"threshold_uncertainty_score":0.082929075},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.07293796050798713,"score_gpt":0.33038292253236534,"score_spread":0.2574449620243782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125747142","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6581295,0.00087024615,0.32952031,0.0010374842,0.0001342676,0.00020524839,0.0002383855,0.00039179047,0.009472735],"genre_scores_gemma":[0.9945201,0.00007906479,0.0038007551,0.000026464832,0.000019325964,0.000030374504,0.000035158577,0.000012495428,0.0014762538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984067,0.0005419694,0.000062017716,0.00025352056,0.00028136934,0.00045442744],"domain_scores_gemma":[0.99559647,0.0024658863,0.00097377517,0.00022643602,0.000490077,0.0002473528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028659252,0.00091547327,0.0018707231,0.00068836,0.0006756999,0.0020234163,0.0021169754,0.001913784,0.003078854],"category_scores_gemma":[0.008908562,0.0010509738,0.00075416086,0.00067334576,0.0012927528,0.0018431126,0.00080132077,0.0011955895,0.00034047724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021223801,0.000069169444,0.0005929365,0.00004610918,0.000030929918,0.00022636636,0.000052669737,0.98317033,0.0011406512,0.008164759,0.00044328286,0.005850453],"study_design_scores_gemma":[0.000021194863,0.000060246308,0.00030606514,0.0000038803664,0.000008757309,0.000023820752,0.000015951628,0.9965389,0.0001886645,0.0027176565,0.00010455444,0.000010415999],"about_ca_topic_score_codex":0.012025783,"about_ca_topic_score_gemma":0.0053507243,"teacher_disagreement_score":0.012025783,"about_ca_system_score_codex":0.0021635466,"about_ca_system_score_gemma":0.0012579275,"threshold_uncertainty_score":0.023911536},"labels":[],"label_agreement":null},{"id":"W3133252064","doi":"10.1002/nav.21976","title":"Simulation optimization in security screening systems subject to budget and waiting time constraints","year":2021,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Science and Technology, Taiwan","keywords":"Bounding overwatch; Computer science; Nexus (standard); Mathematical optimization; Convergence (economics); Process (computing); Markov process; Operations research; Budget constraint; Engineering; Mathematics; Artificial intelligence; Statistics","score_opus":0.3057143339623625,"score_gpt":0.5150770859493352,"score_spread":0.20936275198697274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133252064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21323752,0.0006640617,0.76598144,0.001442292,0.00007574733,0.00018974245,0.00023675748,0.00029755716,0.017874917],"genre_scores_gemma":[0.96563596,0.00024891738,0.029849315,0.00010723195,0.00001908888,0.00018431073,0.000102519814,0.000029840487,0.0038228363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990729,0.0005287792,0.000025425199,0.00009126266,0.00009463289,0.00018699451],"domain_scores_gemma":[0.9941612,0.0048448537,0.00034629888,0.000089265384,0.00037161325,0.00018677676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021291696,0.0009445223,0.0012403333,0.000642567,0.00057140604,0.0011114893,0.0007595167,0.0010935138,0.0037223594],"category_scores_gemma":[0.0059739556,0.0005829742,0.0007530528,0.00071075704,0.001291051,0.0007555186,0.0010428781,0.0011653523,0.00018861951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017782162,0.000006657623,0.00013526362,0.0000056320355,0.0000037475997,0.0000078037665,0.000005772544,0.9969285,0.0000513208,0.0023876657,0.000045067565,0.00040469],"study_design_scores_gemma":[0.000004944796,0.0000057837483,0.000024566341,0.0000014198131,0.0000013460236,9.900933e-7,0.0000031428756,0.9992694,0.000039449093,0.00061002956,0.000037811,0.0000010799927],"about_ca_topic_score_codex":0.023354864,"about_ca_topic_score_gemma":0.009580837,"teacher_disagreement_score":0.023354864,"about_ca_system_score_codex":0.0022097572,"about_ca_system_score_gemma":0.002321632,"threshold_uncertainty_score":0.04643786},"labels":[],"label_agreement":null},{"id":"W3159071455","doi":"10.1002/nav.21994","title":"Dynamically scheduling and maintaining a flexible server","year":2021,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scheduling (production processes); Computer science; Markov decision process; Markov chain; Mathematical optimization; Semiconductor device fabrication; Schedule; Fair-share scheduling; Job shop scheduling; Dynamic priority scheduling; Operations research; Distributed computing; Real-time computing; Markov process; Mathematics; Engineering; Operating system","score_opus":0.06027633868240124,"score_gpt":0.3365222179903641,"score_spread":0.27624587930796285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159071455","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6045593,0.00013603218,0.39036956,0.0002901383,0.000052140964,0.00007375522,0.000096381256,0.0004929633,0.003929686],"genre_scores_gemma":[0.98274326,0.000026420119,0.016404547,0.000020520592,0.000009328746,0.000018506094,0.000033171422,0.000020988598,0.0007231957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993062,0.0001533413,0.000040389783,0.00018327277,0.0001394634,0.00017730183],"domain_scores_gemma":[0.99787736,0.00085697364,0.00036874673,0.000269246,0.00031471413,0.00031290058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014028517,0.00049891975,0.0006140443,0.000586776,0.0006608296,0.0010750935,0.0014208679,0.0006339729,0.0015020274],"category_scores_gemma":[0.0027828855,0.0003969243,0.00032474223,0.0006651807,0.0006828724,0.00081516354,0.0007496961,0.0006720767,0.00036288745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027315976,0.00014122677,0.002509956,0.00004032378,0.000033364166,0.0001542433,0.00006742653,0.95056385,0.015764877,0.008267483,0.00091567246,0.021268431],"study_design_scores_gemma":[0.000014095541,0.000052729614,0.00037348806,0.0000023883786,0.0000069690204,0.000022983088,0.0000193915,0.99436635,0.0022493722,0.0026988103,0.00018746153,0.000005882932],"about_ca_topic_score_codex":0.004563262,"about_ca_topic_score_gemma":0.0028837356,"teacher_disagreement_score":0.004563262,"about_ca_system_score_codex":0.00089801755,"about_ca_system_score_gemma":0.0011886428,"threshold_uncertainty_score":0.009073436},"labels":[],"label_agreement":null},{"id":"W3173854027","doi":"10.1002/nav.22011","title":"Business analytics in service operations—Lessons from healthcare operations","year":2021,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Big Data and Business Intelligence","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Business analytics; Analytics; Computer science; Data science; Business intelligence; Knowledge management; Management science; Process management; Business model; Business; Business analysis; Engineering; Marketing","score_opus":0.4203332503718576,"score_gpt":0.46562658725085254,"score_spread":0.04529333687899495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173854027","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12594603,0.038149808,0.1393595,0.5610897,0.0016041533,0.00031471017,0.00045412016,0.00042910437,0.13265294],"genre_scores_gemma":[0.9439075,0.019506486,0.027132265,0.0051567694,0.0009767475,0.00013341563,0.0001643902,0.00008637413,0.002936212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99542445,0.0034180204,0.000159393,0.0001606983,0.000492514,0.0003450403],"domain_scores_gemma":[0.9779743,0.017049683,0.0007483582,0.00087888836,0.0020148137,0.0013339744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009538095,0.00061757636,0.0005028591,0.0029181326,0.0018801437,0.010163793,0.0014462658,0.0023096378,0.002807351],"category_scores_gemma":[0.02095365,0.00029886572,0.00059967383,0.003933645,0.008896282,0.010064799,0.0036029043,0.004327206,0.0004978791],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009982133,0.000211403,0.009903635,0.00046887225,0.00003581586,0.00073294307,0.010032333,0.009268138,0.000194287,0.8376576,0.019760573,0.11163457],"study_design_scores_gemma":[0.000034452984,0.00008459384,0.004574819,0.001164478,0.000016183356,0.00028742367,0.021237336,0.023772981,0.00034050588,0.87578154,0.07265393,0.000051783773],"about_ca_topic_score_codex":0.009430631,"about_ca_topic_score_gemma":0.0050421716,"teacher_disagreement_score":0.010163793,"about_ca_system_score_codex":0.004035775,"about_ca_system_score_gemma":0.0063996264,"threshold_uncertainty_score":0.050442874},"labels":[],"label_agreement":null},{"id":"W3180222222","doi":"10.1002/nav.22013","title":"Pricing optimization and competition under the linear nested stochastic choice model","year":2021,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Oligopoly; Mathematical optimization; Markup language; Preference; Mathematical economics; Nash equilibrium; Economics; Constant (computer programming); Computer science; Econometrics; Mathematics; Microeconomics; Cournot competition","score_opus":0.1459314656769739,"score_gpt":0.36488013025984284,"score_spread":0.21894866458286893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3180222222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36911348,0.00034725934,0.6173839,0.0012099326,0.000073030795,0.00017110357,0.0002669094,0.00011945594,0.0113149155],"genre_scores_gemma":[0.9718374,0.00012346695,0.022326892,0.00009043491,0.000028672657,0.000093129864,0.00007756848,0.000019258321,0.005403196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99580115,0.0024289405,0.000106342566,0.00054365024,0.000528731,0.000591111],"domain_scores_gemma":[0.99387544,0.004265448,0.00080456963,0.00018839621,0.00041624624,0.00044986312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004563375,0.0009258704,0.0019802416,0.0007209006,0.0005794413,0.0017946527,0.0018217952,0.0017584967,0.0052473224],"category_scores_gemma":[0.009072095,0.0009279369,0.0018195854,0.00086701143,0.0021844837,0.0024191537,0.0015724711,0.0019464114,0.00031934452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014103453,0.00016667973,0.0012348266,0.000067291476,0.000069853646,0.00023685764,0.000089823545,0.8988021,0.0010587875,0.09432225,0.0003685618,0.0034418984],"study_design_scores_gemma":[0.000021358384,0.000045332446,0.00026883563,0.0000029983398,0.000008604855,0.000017566632,0.0000167836,0.982588,0.000077506724,0.016841972,0.00009965795,0.0000113995275],"about_ca_topic_score_codex":0.012124738,"about_ca_topic_score_gemma":0.0076729697,"teacher_disagreement_score":0.012124738,"about_ca_system_score_codex":0.0024179318,"about_ca_system_score_gemma":0.0016537533,"threshold_uncertainty_score":0.024133742},"labels":[],"label_agreement":null},{"id":"W3188565123","doi":"10.1002/nav.22018","title":"Price and revenue bounds for bundles of information goods","year":2021,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Bundle; Revenue; Upper and lower bounds; Function (biology); Extant taxon; Sharpening; Space (punctuation); Mathematical economics; Econometrics; Computer science; Economics; Microeconomics; Mathematical optimization; Mathematics; Finance","score_opus":0.3779754257471216,"score_gpt":0.5393977548915635,"score_spread":0.16142232914444188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3188565123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14775233,0.0023079298,0.8029008,0.0019073036,0.0001224854,0.0001638675,0.00038454606,0.00033969517,0.044121064],"genre_scores_gemma":[0.9397761,0.0015933821,0.05119927,0.0002775606,0.00024726268,0.00021323284,0.0003402841,0.00025380342,0.006099112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99510175,0.0023413263,0.00017197043,0.00057477906,0.0011120513,0.000698214],"domain_scores_gemma":[0.96344036,0.029344657,0.002589802,0.0021396768,0.0016078047,0.00087775366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00772975,0.0013748326,0.0019145493,0.0018709644,0.0008545976,0.004453432,0.0025812748,0.0017909389,0.011328229],"category_scores_gemma":[0.045705635,0.0010760691,0.0017662075,0.0016565078,0.0033002244,0.011103731,0.0020265,0.004048462,0.0011675257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030429277,0.00028510205,0.001525721,0.00030771384,0.00011062379,0.00029541683,0.00021245105,0.3240093,0.004348042,0.6437878,0.0033653546,0.02144816],"study_design_scores_gemma":[0.000044409117,0.00014887376,0.0010013673,0.000116627016,0.000046192446,0.0002921232,0.00009025241,0.6093928,0.0018735279,0.3849105,0.0020314679,0.000051860337],"about_ca_topic_score_codex":0.0006841169,"about_ca_topic_score_gemma":0.00040095148,"teacher_disagreement_score":0.011328229,"about_ca_system_score_codex":0.0037833506,"about_ca_system_score_gemma":0.0009504048,"threshold_uncertainty_score":0.04087931},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.1541484593492621,"score_gpt":0.3880518394310475,"score_spread":0.23390338008178538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206694125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4451878,0.0006955943,0.5250384,0.0010272485,0.000111178284,0.0005457684,0.00037464994,0.0003035504,0.026715776],"genre_scores_gemma":[0.99110913,0.00007006987,0.0075922506,0.000028788172,0.0000055339165,0.00006707598,0.000032403175,0.000014786244,0.0010798458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993555,0.00025889088,0.000019556603,0.000086687316,0.00009161456,0.00018777931],"domain_scores_gemma":[0.998536,0.000975781,0.00016576788,0.000042890006,0.0001739585,0.00010559552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015298991,0.0006942582,0.0012717721,0.0007772249,0.00054770947,0.001426711,0.0007859329,0.0013010107,0.00483228],"category_scores_gemma":[0.004341205,0.00065464573,0.00049533194,0.000538172,0.00062971807,0.0010099337,0.0008119878,0.0010301601,0.00022171828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011105914,0.000086167245,0.0006094073,0.000071751754,0.000011989572,0.00006271873,0.000028972061,0.98575926,0.001014284,0.0051750764,0.0005997534,0.006469564],"study_design_scores_gemma":[0.000018380893,0.000059730595,0.00049788743,0.000009645078,0.000008984483,0.0000085773645,0.000037086123,0.9972543,0.00027949404,0.001585282,0.00023545479,0.000005102506],"about_ca_topic_score_codex":0.009714061,"about_ca_topic_score_gemma":0.005940053,"teacher_disagreement_score":0.009714061,"about_ca_system_score_codex":0.0018810843,"about_ca_system_score_gemma":0.0019990003,"threshold_uncertainty_score":0.019315064},"labels":[],"label_agreement":null},{"id":"W3208895056","doi":"10.1002/nav.22027","title":"Capacity expansion strategies for electric vehicle charging networks: Model, algorithms, and case study","year":2021,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McMaster University","funders":"Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Range (aeronautics); Electric vehicle; Solver; Mathematical optimization; Heuristic; Operations research; Charging station; Algorithm; Engineering; Mathematics; Power (physics)","score_opus":0.17174004318455505,"score_gpt":0.3823817313621871,"score_spread":0.21064168817763207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208895056","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6139155,0.0018797326,0.3176161,0.0027050471,0.00011079834,0.0008945203,0.0014071835,0.00050654204,0.06096467],"genre_scores_gemma":[0.9624875,0.0004155965,0.030805338,0.000056498888,0.00001979488,0.00027517628,0.00019396553,0.000024903184,0.005721124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993476,0.00036902638,0.0000148816225,0.00006244757,0.000064480766,0.0001414927],"domain_scores_gemma":[0.9962457,0.0030341193,0.0002505452,0.00006454575,0.00026614068,0.00013885078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019220838,0.0011812397,0.0010569033,0.0015704512,0.0011191762,0.0019505315,0.0017993795,0.002414949,0.005281645],"category_scores_gemma":[0.004235831,0.00072041195,0.0008317081,0.002186194,0.0010490282,0.0015217114,0.0011467765,0.0016327937,0.00020089497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001960253,0.00003626299,0.00028805103,0.000017404118,0.000004991054,0.00004516188,0.000010224739,0.9950546,0.000041216626,0.0028261663,0.00027941,0.0013768041],"study_design_scores_gemma":[0.000010468699,0.000014966444,0.000069475194,0.0000045190845,0.0000041929757,0.0000091682205,0.00003306424,0.9984395,0.000049981438,0.0012103165,0.00015049738,0.0000037894727],"about_ca_topic_score_codex":0.049177255,"about_ca_topic_score_gemma":0.035434004,"teacher_disagreement_score":0.049177255,"about_ca_system_score_codex":0.005093339,"about_ca_system_score_gemma":0.0021072198,"threshold_uncertainty_score":0.097782016},"labels":[],"label_agreement":null},{"id":"W3210401002","doi":"10.1002/nav.22031","title":"Modeling and optimization of multilevel marketing operations","year":2021,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Securities Regulation and Market Practices","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Supervisor; Randomness; Mathematical optimization; Computer science; Operations research; Nonlinear programming; Nonlinear system; Mathematics; Economics; Statistics","score_opus":0.14890611281578572,"score_gpt":0.37666184253244506,"score_spread":0.22775572971665933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210401002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25803572,0.00061131036,0.7129829,0.0017562489,0.00007430474,0.00012349503,0.0006660304,0.00022172682,0.025528261],"genre_scores_gemma":[0.96300405,0.00031132845,0.027954595,0.0000722223,0.000039555613,0.00016268034,0.00016443072,0.000042705255,0.008248375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875844,0.0005457041,0.00004272449,0.00022528066,0.00018060167,0.00024721344],"domain_scores_gemma":[0.99716944,0.0018624236,0.0004329309,0.00011271683,0.00019232987,0.00023022933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016629488,0.0006390757,0.0010253233,0.00071261614,0.00046680355,0.0017482318,0.0013017333,0.001272676,0.007903962],"category_scores_gemma":[0.005329381,0.0005162056,0.0009656423,0.00088344223,0.0011853148,0.0016024443,0.0014428378,0.0015740021,0.00048224075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039413095,0.00003659937,0.0006227951,0.000024637215,0.000016730544,0.00003853072,0.00003539077,0.9658242,0.00028856847,0.029086107,0.00034668064,0.0036403995],"study_design_scores_gemma":[0.0000061958667,0.0000146741295,0.00020208945,0.0000040031,0.0000034663276,0.0000033925528,0.000015098885,0.9897132,0.00004806293,0.009756642,0.00023000107,0.0000031349757],"about_ca_topic_score_codex":0.012092408,"about_ca_topic_score_gemma":0.006597333,"teacher_disagreement_score":0.012092408,"about_ca_system_score_codex":0.0025265,"about_ca_system_score_gemma":0.0011373563,"threshold_uncertainty_score":0.026441395},"labels":[],"label_agreement":null},{"id":"W4289868536","doi":"10.1002/nav.22073","title":"Utilizing partial flexibility to improve emergency department flow: Theory and implementation","year":2022,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Emergency and Acute Care Studies","field":"Medicine","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Staffing; Queueing theory; Flexibility (engineering); Computer science; Emergency department; Psychological intervention; Heuristic; Operations research; Reduction (mathematics); Operations management; Work flow; Mathematical optimization; Nursing; Medicine; Industrial engineering; Mathematics; Artificial intelligence; Computer network; Statistics; Economics","score_opus":0.12766287440018487,"score_gpt":0.47725924603986264,"score_spread":0.34959637163967777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289868536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15494666,0.00035954642,0.83312935,0.0016124798,0.00009139171,0.00017851853,0.000063105734,0.00033133128,0.009287539],"genre_scores_gemma":[0.9658924,0.00013952769,0.03306488,0.000095633404,0.00003240113,0.00010328591,0.000013501329,0.000015620391,0.00064288406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982151,0.0010685395,0.00004555457,0.00017085206,0.00023545271,0.00026450705],"domain_scores_gemma":[0.99268675,0.005265027,0.000604868,0.00044872597,0.00064459373,0.00035006838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037123512,0.00086961227,0.00071460195,0.00062902767,0.00083104183,0.0012402849,0.0015106954,0.0012916869,0.002733745],"category_scores_gemma":[0.011045913,0.000576201,0.0007740816,0.0006366097,0.0021345506,0.0016539099,0.0022599902,0.0012612093,0.00013888263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053430656,0.00012162611,0.0008805543,0.00003934417,0.000019001443,0.00004131259,0.000055802935,0.9565628,0.00057565334,0.031041993,0.000399773,0.010208615],"study_design_scores_gemma":[0.000015292757,0.000057940535,0.00011458557,0.000006430762,0.000005352364,0.000006624097,0.000017969194,0.99287647,0.00015529295,0.0065730284,0.0001642432,0.0000066556827],"about_ca_topic_score_codex":0.00813459,"about_ca_topic_score_gemma":0.0036993797,"teacher_disagreement_score":0.00813459,"about_ca_system_score_codex":0.001910526,"about_ca_system_score_gemma":0.0024646244,"threshold_uncertainty_score":0.019633055},"labels":[],"label_agreement":null},{"id":"W4295233197","doi":"10.1002/nav.22079","title":"Traffic channeling under uncertain conversion rates on e‐commerce platforms","year":2022,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Baycrest Hospital; University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Spillover effect; Business; Product (mathematics); Channel (broadcasting); Competition (biology); Industrial organization; Microeconomics; Computer science; Commerce; Economics; Telecommunications","score_opus":0.2239226144608143,"score_gpt":0.3693479171244493,"score_spread":0.14542530266363501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295233197","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9293803,0.0002013877,0.056752168,0.00080030935,0.000065731685,0.00007193826,0.00020359513,0.00012366583,0.012400968],"genre_scores_gemma":[0.99770576,0.00007522061,0.0010771727,0.000024926634,0.0000132366185,0.000013749631,0.000029467072,0.000012290932,0.0010482027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876666,0.00037110515,0.00002815587,0.00017083531,0.00014432608,0.00051907834],"domain_scores_gemma":[0.9882599,0.00744576,0.0015192355,0.00048479257,0.0012181978,0.001072152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019687824,0.00085294247,0.00088036293,0.0011287938,0.001225843,0.0025878057,0.0013127576,0.0014596218,0.006001837],"category_scores_gemma":[0.010569077,0.00048070785,0.0007414508,0.00065087207,0.0018287603,0.003160491,0.0019857963,0.0019729498,0.00038067883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000535902,0.00020493,0.006439234,0.00007104021,0.000046403908,0.0007195987,0.00018708355,0.90873003,0.004871592,0.06694128,0.0017238274,0.009529104],"study_design_scores_gemma":[0.000016227457,0.00010354445,0.0017550719,0.000013894502,0.00002356391,0.00007369908,0.00029480646,0.97466034,0.0005991216,0.022077259,0.00035264352,0.00002983357],"about_ca_topic_score_codex":0.009299863,"about_ca_topic_score_gemma":0.004613271,"teacher_disagreement_score":0.009299863,"about_ca_system_score_codex":0.003187858,"about_ca_system_score_gemma":0.0010210902,"threshold_uncertainty_score":0.023129702},"labels":[],"label_agreement":null},{"id":"W4316037013","doi":"10.1002/nav.22100","title":"Demand information acquisition strategy in a dual channel supply chain","year":2023,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Dalhousie University","funders":"National Key Research and Development Program of China; National Social Science Fund of China; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Supply chain; Business; Dual (grammatical number); Signaling game; Context (archaeology); Channel (broadcasting); Private information retrieval; Industrial organization; Product (mathematics); Marketing; Microeconomics; Computer science; Economics; Telecommunications","score_opus":0.10976893665241333,"score_gpt":0.3387087399400263,"score_spread":0.228939803287613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4316037013","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8623277,0.00035001038,0.09548305,0.0017857774,0.00004148888,0.00024789092,0.00015624311,0.00009538453,0.039512485],"genre_scores_gemma":[0.9929732,0.00009261847,0.00326393,0.0000515708,0.000008855692,0.000026304842,0.0000194772,0.0000037069196,0.0035602488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984479,0.0004031061,0.00006844616,0.00026581122,0.0003721355,0.00044256714],"domain_scores_gemma":[0.9947031,0.0026776793,0.0009671146,0.00037437445,0.0007701264,0.0005075944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015401175,0.0004929686,0.00065120956,0.001258266,0.0009251706,0.0033369279,0.0011373666,0.0024437902,0.008590861],"category_scores_gemma":[0.0049890727,0.0006139202,0.00051540864,0.00084814016,0.0015682874,0.0040704547,0.0023462765,0.0013192489,0.0007938244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034669575,0.0017631479,0.043550547,0.000705017,0.000354084,0.0078093517,0.0026589106,0.42276832,0.048473913,0.36117545,0.0062718466,0.101002395],"study_design_scores_gemma":[0.00016871205,0.00047030658,0.0039824783,0.0000924547,0.00011012026,0.0008096472,0.0014608654,0.9096979,0.006392699,0.0725383,0.0041377274,0.00013890056],"about_ca_topic_score_codex":0.0032137076,"about_ca_topic_score_gemma":0.0022346165,"teacher_disagreement_score":0.008590861,"about_ca_system_score_codex":0.0022434175,"about_ca_system_score_gemma":0.0013849211,"threshold_uncertainty_score":0.028739274},"labels":[],"label_agreement":null},{"id":"W4387297450","doi":"10.1002/nav.22155","title":"Investment strategies of information‐provision technology in the platform‐based supply chain","year":2023,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institute on Governance","funders":"National Natural Science Foundation of China","keywords":"Profit (economics); Business; Supply chain; Investment (military); Service provider; Industrial organization; Service (business); Marketing; Economics; Microeconomics","score_opus":0.11573910918857114,"score_gpt":0.3485651543449335,"score_spread":0.23282604515636238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387297450","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8471102,0.0009552049,0.108531944,0.0015821127,0.000039322582,0.00023236383,0.00023918082,0.00008499212,0.041224632],"genre_scores_gemma":[0.99473816,0.00019986315,0.002166991,0.0000269287,0.000004978777,0.000023415812,0.000021072496,0.000003497409,0.0028150945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900997,0.00034377057,0.000038748614,0.00013837428,0.00016394176,0.00030512054],"domain_scores_gemma":[0.99807274,0.0009318563,0.00044825138,0.0000970592,0.00022797094,0.00022218937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012919251,0.00067114923,0.0004718789,0.0010019132,0.0007778721,0.003370554,0.00095630396,0.0019500989,0.006202168],"category_scores_gemma":[0.004501026,0.0006067652,0.00057205587,0.0010809287,0.0010886114,0.00521023,0.001524247,0.0011139717,0.00038269078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054918526,0.0003359892,0.02226346,0.00029570362,0.00014564887,0.0013174696,0.0005202044,0.6567252,0.0070370464,0.25451943,0.0020273672,0.05426326],"study_design_scores_gemma":[0.000048475653,0.00035519514,0.0066812304,0.00009352627,0.00013233832,0.00022663327,0.0009538193,0.9133441,0.0026458506,0.0720086,0.0034334594,0.00007681099],"about_ca_topic_score_codex":0.0046188775,"about_ca_topic_score_gemma":0.0030634445,"teacher_disagreement_score":0.006202168,"about_ca_system_score_codex":0.003497858,"about_ca_system_score_gemma":0.0013838843,"threshold_uncertainty_score":0.025378823},"labels":[],"label_agreement":null},{"id":"W4392347941","doi":"10.1002/nav.22179","title":"Effects of behavioral bias regarding demand forecasting in a competitive market","year":2024,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"National Natural Science Foundation of China","keywords":"Demand forecasting; Econometrics; Economics; Computer science; Operations management","score_opus":0.17069626122325826,"score_gpt":0.37597874584871166,"score_spread":0.2052824846254534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392347941","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99094605,0.000110365654,0.0064588366,0.00047500397,0.000011610831,0.000032792497,0.000043315835,0.000026189278,0.0018958185],"genre_scores_gemma":[0.99909174,0.000024101493,0.0006622878,0.000043135446,0.000008916685,0.0000052550276,0.000015173652,0.0000026232715,0.00014672535],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99527353,0.0027740728,0.00022886429,0.0005023906,0.0007193658,0.0005018191],"domain_scores_gemma":[0.8334434,0.13219474,0.025052251,0.00461747,0.0033203438,0.0013717954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0155197475,0.0004195081,0.0005961251,0.00072903145,0.00054597243,0.0020295002,0.00063351897,0.0014177752,0.0023980923],"category_scores_gemma":[0.07443317,0.00034810428,0.00051054475,0.0005183546,0.0014645841,0.0016921117,0.001100342,0.0013515147,0.0001458798],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004202715,0.0014767649,0.54687,0.00025906923,0.00078695547,0.00084089104,0.0019490183,0.327049,0.009858628,0.034857795,0.0017634911,0.07008572],"study_design_scores_gemma":[0.00023645307,0.0014042158,0.24005903,0.00007115646,0.0003930343,0.00016018802,0.0014732184,0.72104704,0.0037126173,0.030371688,0.00091580045,0.00015559871],"about_ca_topic_score_codex":0.007199334,"about_ca_topic_score_gemma":0.0057682865,"teacher_disagreement_score":0.0155197475,"about_ca_system_score_codex":0.0018428601,"about_ca_system_score_gemma":0.0008932222,"threshold_uncertainty_score":0.082077265},"labels":[],"label_agreement":null},{"id":"W4395010296","doi":"10.1002/nav.22190","title":"Forecasting using reference prices with exposure effect","year":2024,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Forecasting Techniques and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Econometrics; Economics; Computer science; Statistics; Mathematics","score_opus":0.7213806515626001,"score_gpt":0.5756521973754204,"score_spread":0.14572845418717972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395010296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28696048,0.00049987837,0.7065428,0.0005262583,0.00018382314,0.000069601076,0.0004851944,0.000739,0.003992992],"genre_scores_gemma":[0.96528685,0.00019380084,0.032975014,0.000073566785,0.00012544445,0.000033434386,0.000348927,0.000022685796,0.00094030594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985812,0.00042181407,0.00008887307,0.00042893685,0.00037584905,0.00010333376],"domain_scores_gemma":[0.99021626,0.0066290577,0.0009974025,0.0011325291,0.00086092035,0.00016393693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033425705,0.0008114471,0.0010285578,0.0014062398,0.00024054377,0.0013323652,0.0013002619,0.0013904454,0.0020648972],"category_scores_gemma":[0.019308131,0.00041182866,0.0007852812,0.0014927705,0.0004739982,0.0030193313,0.0007129503,0.0015923732,0.00044632432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033683892,0.00023470608,0.033511218,0.000097336924,0.00021186726,0.00021290449,0.000117665644,0.806247,0.0031679943,0.023028985,0.0018760868,0.13095742],"study_design_scores_gemma":[0.0000061709497,0.00003692217,0.0025131523,0.0000056143745,0.000016067263,0.000018166493,0.0000066729403,0.990864,0.00048908335,0.005800082,0.0002298775,0.000014161146],"about_ca_topic_score_codex":0.0051830555,"about_ca_topic_score_gemma":0.002311733,"teacher_disagreement_score":0.0051830555,"about_ca_system_score_codex":0.0006131516,"about_ca_system_score_gemma":0.00038340891,"threshold_uncertainty_score":0.017677426},"labels":[],"label_agreement":null},{"id":"W4399741457","doi":"10.1002/nav.22192","title":"On monitoring high‐dimensional processes with individual observations","year":2024,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Advanced Statistical Process Monitoring","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.6359304930851263,"score_gpt":0.5634846539932403,"score_spread":0.07244583909188596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399741457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0888606,0.0001824669,0.9101495,0.00005018151,0.000018526918,0.00003647431,0.00005533069,0.00029379418,0.00035314023],"genre_scores_gemma":[0.83506376,0.00021578751,0.16414292,0.000035708363,0.00004978044,0.00006802402,0.00014347989,0.000027221637,0.00025335938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860245,0.00055462855,0.00006371519,0.00027964273,0.00042655042,0.00007305024],"domain_scores_gemma":[0.99512815,0.0025755432,0.0010715246,0.0004876841,0.0006182253,0.00011880695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028239165,0.0006862859,0.0007207003,0.0011137723,0.0004477045,0.0008475485,0.0005827742,0.00060552516,0.00026716653],"category_scores_gemma":[0.008850634,0.00018082815,0.00034363923,0.0011786496,0.0008905504,0.0010640286,0.0007274356,0.0007314835,0.00007572655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046937718,0.0002248301,0.0153464805,0.00022612255,0.0001543658,0.00022944779,0.00021472812,0.6677048,0.03549613,0.012679516,0.00083570095,0.26641846],"study_design_scores_gemma":[0.000008876716,0.00014449042,0.003072353,0.0000064565625,0.000014341049,0.000034544744,0.000022001701,0.9839908,0.00916308,0.0031408328,0.0003793808,0.00002289393],"about_ca_topic_score_codex":0.0020041582,"about_ca_topic_score_gemma":0.001466293,"teacher_disagreement_score":0.0028239165,"about_ca_system_score_codex":0.00043862595,"about_ca_system_score_gemma":0.00071074895,"threshold_uncertainty_score":0.01493448},"labels":[],"label_agreement":null},{"id":"W4401963879","doi":"10.1002/nav.22224","title":"Double‐sided queues and their applications to vaccine inventory management","year":2024,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Queue; Computer science; Stationary distribution; Markov process; Queueing theory; Abandonment (legal); Mathematical optimization; Markovian arrival process; Operations research; Markov chain; Mathematics; Statistics; Computer network","score_opus":0.10390181316815085,"score_gpt":0.38600428031670203,"score_spread":0.2821024671485512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401963879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06348877,0.0013450038,0.92862207,0.0009211404,0.00048390686,0.00006764359,0.00012608858,0.00018179453,0.0047636614],"genre_scores_gemma":[0.9345922,0.0011179262,0.0566176,0.0002896171,0.00036847085,0.000111158835,0.00011578682,0.00004989018,0.006737439],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987325,0.0003594855,0.00008910823,0.00020339,0.00034590432,0.00026966672],"domain_scores_gemma":[0.9958021,0.0021535729,0.00073040486,0.00025342553,0.0007021448,0.00035832307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002786984,0.00092690485,0.0010555775,0.0011912057,0.00095552707,0.002138661,0.0018824993,0.001715035,0.002568937],"category_scores_gemma":[0.005283982,0.00068754866,0.0011977843,0.0010934008,0.001485303,0.002202523,0.0017522583,0.0019935227,0.0002952641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009742243,0.000114023125,0.0017017004,0.000082217426,0.000055008142,0.00045928344,0.00014589832,0.653187,0.0030684404,0.33282968,0.0012349793,0.007024313],"study_design_scores_gemma":[0.0000072393655,0.000018316774,0.00007150798,0.0000059630092,0.000006807308,0.000031036943,0.000013106746,0.9797633,0.00018334802,0.01950914,0.0003812163,0.00000915784],"about_ca_topic_score_codex":0.007206284,"about_ca_topic_score_gemma":0.0039847866,"teacher_disagreement_score":0.007206284,"about_ca_system_score_codex":0.0019526706,"about_ca_system_score_gemma":0.001993478,"threshold_uncertainty_score":0.014739156},"labels":[],"label_agreement":null},{"id":"W4410013534","doi":"10.1002/nav.22265","title":"Abundant Neighborhoods, Two‐Sided Markets, and Maximal Matchings","year":2025,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Computer science; Business","score_opus":0.10442767891851185,"score_gpt":0.36241541412433304,"score_spread":0.2579877352058212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410013534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23448569,0.0005240817,0.75039005,0.0006925358,0.00004515913,0.00014106127,0.00037643788,0.00031239048,0.013032574],"genre_scores_gemma":[0.8611118,0.0002352888,0.13477747,0.000104546074,0.000041419873,0.00010975283,0.00031057617,0.00008562719,0.003223469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987042,0.00052844494,0.00006598789,0.00028881925,0.00025302044,0.00015958514],"domain_scores_gemma":[0.99677473,0.0019384357,0.00045247996,0.000380123,0.00019586153,0.00025837406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001461212,0.0004356422,0.00081937446,0.0009101289,0.0008551145,0.0016398529,0.0011807042,0.00074758433,0.005034226],"category_scores_gemma":[0.005403634,0.00043148833,0.0007230062,0.0010281522,0.0014739002,0.0046234597,0.0017173045,0.0011197275,0.00039287235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002589156,0.00020941324,0.0020857924,0.00014789248,0.00006111524,0.00019852506,0.00026154873,0.15608034,0.005755505,0.78591275,0.0035942742,0.04543388],"study_design_scores_gemma":[0.000035478268,0.00009915655,0.00043947695,0.000019163197,0.000016053804,0.00012909582,0.000115768096,0.38127244,0.0021754308,0.61233884,0.0033447165,0.000014351409],"about_ca_topic_score_codex":0.0012852001,"about_ca_topic_score_gemma":0.001132411,"teacher_disagreement_score":0.005034226,"about_ca_system_score_codex":0.0009593254,"about_ca_system_score_gemma":0.00063548004,"threshold_uncertainty_score":0.016841233},"labels":[],"label_agreement":null},{"id":"W4411220608","doi":"10.1002/nav.22270","title":"Improved Regression Tree Models Using Generalization Error‐Based Splitting Criteria","year":2025,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Statistical Methods and Inference","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Generalization; Regression; Statistics; Tree (set theory); Computer science; Generalization error; Mathematics; Artificial intelligence; Machine learning; Combinatorics; Artificial neural network","score_opus":0.5783586031195144,"score_gpt":0.5822616368050783,"score_spread":0.0039030336855638836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411220608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047244318,0.00050214294,0.9500513,0.0003668795,0.00004479941,0.00005400919,0.00015062967,0.0005142118,0.0010717497],"genre_scores_gemma":[0.8015928,0.00035400153,0.19413695,0.000326717,0.000083107494,0.00028574924,0.00073482416,0.00031658856,0.0021692908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723154,0.0015683139,0.00013269416,0.00048797048,0.00041864222,0.00016083733],"domain_scores_gemma":[0.9852593,0.009937293,0.0014095813,0.0010437594,0.0020053983,0.00034474692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009290628,0.0014376047,0.0018197907,0.0014495875,0.00058712653,0.0013595568,0.0026167398,0.0016376443,0.0017384713],"category_scores_gemma":[0.023028692,0.00058159645,0.0013886496,0.0011644207,0.0010209924,0.0027043945,0.0017926722,0.002842484,0.00054375647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005012275,0.000043889864,0.0010662981,0.00003271571,0.000037873768,0.00003190119,0.000045535293,0.9764865,0.0006266375,0.006386605,0.00073415734,0.014457719],"study_design_scores_gemma":[0.0000023089738,0.000009301135,0.000051871637,0.00000374822,0.0000031436648,0.0000025850647,0.000001631615,0.9978955,0.00008575022,0.0018919405,0.00005006299,0.0000022352165],"about_ca_topic_score_codex":0.0068456256,"about_ca_topic_score_gemma":0.0057264394,"teacher_disagreement_score":0.009290628,"about_ca_system_score_codex":0.0012798462,"about_ca_system_score_gemma":0.0014313877,"threshold_uncertainty_score":0.049134076},"labels":[],"label_agreement":null},{"id":"W4412044797","doi":"10.1002/nav.70000","title":"Mass and Niche Service Competition With Heterogeneous Customers and Waiting Line","year":2025,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Competition (biology); Niche; Business; Service (business); Marketing; Line (geometry); Advertising; Ecology; Biology","score_opus":0.054101143671753255,"score_gpt":0.33596552572956406,"score_spread":0.28186438205781084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412044797","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8419423,0.00049035525,0.12210192,0.0024037447,0.00010983373,0.00013871511,0.00033537686,0.00016253362,0.032315142],"genre_scores_gemma":[0.9960025,0.00005248553,0.0015094269,0.000063012136,0.00002614129,0.000021579332,0.00002350654,0.0000070182145,0.0022942715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816185,0.00064327504,0.000032019416,0.0002314273,0.00018407355,0.0007474292],"domain_scores_gemma":[0.993946,0.0033876894,0.00090177625,0.00021804577,0.000502174,0.0010443329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026544859,0.0007997764,0.0014608379,0.00081361196,0.0013380094,0.0029425288,0.0021010842,0.0021663185,0.010374945],"category_scores_gemma":[0.005601993,0.00054184656,0.0007868284,0.0009286109,0.00275498,0.003179171,0.0018690003,0.0017139667,0.00043551202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073420705,0.0003452974,0.0034336227,0.00013487099,0.000104692015,0.0010633941,0.0003069143,0.6548437,0.00273332,0.3248109,0.0039970255,0.007492058],"study_design_scores_gemma":[0.000101027785,0.0001447515,0.0011401451,0.000014431862,0.000020509815,0.00010759686,0.00031095164,0.94692844,0.00019406335,0.05007499,0.0009245874,0.000038513088],"about_ca_topic_score_codex":0.013043035,"about_ca_topic_score_gemma":0.008958451,"teacher_disagreement_score":0.013043035,"about_ca_system_score_codex":0.0036731882,"about_ca_system_score_gemma":0.0016295655,"threshold_uncertainty_score":0.034707606},"labels":[],"label_agreement":null},{"id":"W4413240178","doi":"10.1002/nav.70011","title":"Assortment Planning in Omnichannel Retailing Under Product Returns and Showcase Capacity","year":2025,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Consumer Retail Behavior Studies","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Profit (economics); Multinomial logistic regression; Omnichannel; Business; Microeconomics; Economics; Marketing; Econometrics; Industrial organization; Computer science","score_opus":0.26285337759404626,"score_gpt":0.4098107973790568,"score_spread":0.14695741978501053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413240178","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93716437,0.00028156233,0.049673453,0.000589354,0.000019414558,0.000114327675,0.0001935565,0.00010720873,0.011856688],"genre_scores_gemma":[0.9947967,0.00007976502,0.0023921542,0.000020204792,0.000004792852,0.000020306961,0.000036851834,0.0000120361365,0.0026372282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845016,0.00045648092,0.000056003162,0.00030466064,0.00014597383,0.00058665185],"domain_scores_gemma":[0.99173963,0.005392714,0.0013472448,0.00030262803,0.00032769234,0.0008900418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026881427,0.0008058905,0.001531399,0.00082178944,0.00087734294,0.0030213518,0.0015919495,0.0015751926,0.007618798],"category_scores_gemma":[0.009100805,0.0010065291,0.001018451,0.0008206305,0.0020385804,0.0027595547,0.0014950787,0.0013567248,0.00048361436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005871314,0.0002349807,0.0068912855,0.000060712293,0.00010038826,0.0006737574,0.00018128521,0.9567869,0.0016865314,0.023607267,0.00045004842,0.008739615],"study_design_scores_gemma":[0.000039614522,0.0002628777,0.005721327,0.000022555707,0.000083191,0.000110934285,0.00046384684,0.9661727,0.0010743756,0.02553657,0.00043824533,0.00007367953],"about_ca_topic_score_codex":0.02133636,"about_ca_topic_score_gemma":0.011784432,"teacher_disagreement_score":0.02133636,"about_ca_system_score_codex":0.0035454973,"about_ca_system_score_gemma":0.0014696115,"threshold_uncertainty_score":0.04242432},"labels":[],"label_agreement":null},{"id":"W4414832767","doi":"10.1002/nav.70020","title":"Pricing and Assortment Optimization Under Logit‐Based Choice Models With Tree‐Structured Consideration Sets","year":2025,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institute on Governance","funders":"National Natural Science Foundation of China","keywords":"Tree (set theory); Set (abstract data type); Multinomial logistic regression; Node (physics); Path (computing); Revenue; Product (mathematics); Nested logit","score_opus":0.11439546209739933,"score_gpt":0.3586934059996934,"score_spread":0.2442979439022941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414832767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22593372,0.0008280754,0.7628986,0.0016515689,0.00008840068,0.0002069174,0.0005110424,0.00021741953,0.0076643317],"genre_scores_gemma":[0.94389826,0.00044997115,0.04975831,0.0001314488,0.000048789505,0.00020946447,0.00023986882,0.00003922213,0.005224633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964683,0.0022414983,0.00008581478,0.00035332207,0.00036057364,0.0004905494],"domain_scores_gemma":[0.99235606,0.0061882837,0.00062134967,0.00012398192,0.0002885637,0.00042180673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041836184,0.0011033225,0.0020823693,0.0012750136,0.0006141376,0.002234659,0.0018857474,0.0017850328,0.0052586216],"category_scores_gemma":[0.009509712,0.0013227232,0.001921472,0.0020611973,0.0015626804,0.0030697377,0.001611912,0.002111843,0.0003682363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009486565,0.000075852644,0.0006306365,0.000040959803,0.00004551469,0.00007512783,0.000033855787,0.96143687,0.00015732284,0.03363761,0.00043781134,0.0033335753],"study_design_scores_gemma":[0.000013008803,0.000020555286,0.000112055815,0.0000036951258,0.0000064066785,0.0000076273272,0.000009842041,0.9841204,0.00003331816,0.015558494,0.00010892439,0.000005654942],"about_ca_topic_score_codex":0.012897942,"about_ca_topic_score_gemma":0.008140402,"teacher_disagreement_score":0.012897942,"about_ca_system_score_codex":0.0034749615,"about_ca_system_score_gemma":0.0017445915,"threshold_uncertainty_score":0.025645733},"labels":[],"label_agreement":null},{"id":"W4415342619","doi":"10.1002/nav.70023","title":"Socially Responsible Newsvendor","year":2025,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Innovation and Socioeconomic Development","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Economic surplus; Profit maximization; Profit (economics); Negotiation; Net profit; Social Welfare; Social responsibility; Corporate social responsibility; For profit","score_opus":0.13793032461162572,"score_gpt":0.41053520586927317,"score_spread":0.2726048812576475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415342619","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03983444,0.0025007615,0.034832098,0.037385356,0.0017476954,0.00010604433,0.0003965814,0.00032968054,0.88286734],"genre_scores_gemma":[0.8164704,0.0029676463,0.007992368,0.004101285,0.0013129276,0.00016482333,0.0003215383,0.00027452264,0.16639452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962345,0.00167566,0.00022346714,0.0005923131,0.00086218986,0.00041183984],"domain_scores_gemma":[0.9866371,0.0066803712,0.0020218936,0.0021017052,0.0018452319,0.0007135358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038563854,0.0005205599,0.00044343463,0.0015396248,0.0024676132,0.009659687,0.0010518087,0.0031358537,0.039651405],"category_scores_gemma":[0.01930494,0.00033653673,0.00046215978,0.0015462994,0.0038022161,0.008865002,0.0028536194,0.0029146136,0.004720869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006215178,0.00003724936,0.0012157263,0.00018888716,0.000024415427,0.00052096875,0.0025004079,0.00195449,0.0003202392,0.9258948,0.033952564,0.033328142],"study_design_scores_gemma":[0.000034199253,0.00003513918,0.00091108424,0.000281844,0.000036941197,0.0004885187,0.003933657,0.007623346,0.0007949772,0.49248737,0.49332577,0.000047144178],"about_ca_topic_score_codex":0.0020346001,"about_ca_topic_score_gemma":0.002221434,"teacher_disagreement_score":0.039651405,"about_ca_system_score_codex":0.0030580666,"about_ca_system_score_gemma":0.0029403528,"threshold_uncertainty_score":0.13264716},"labels":[],"label_agreement":null},{"id":"W4416594889","doi":"10.1002/nav.70031","title":"Platforms' Search‐Pattern Preference: The Role of Assortment","year":2025,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institute on Governance","funders":"National Natural Science Foundation of China","keywords":"Preference; Search cost; Benchmark (surveying); Key (lock); Search algorithm; Pattern search","score_opus":0.13812215593334431,"score_gpt":0.3634698001969587,"score_spread":0.22534764426361437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416594889","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9899997,0.000054313394,0.003473615,0.00013322802,0.0000044649146,0.000017277469,0.000035802135,0.000011387159,0.0062702475],"genre_scores_gemma":[0.99929893,0.000014874398,0.00036512502,0.000009843592,0.0000022669471,0.0000036903125,0.000008440364,0.0000016578304,0.00029519573],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995178,0.00018835059,0.000029574889,0.0000910401,0.00009810324,0.00007516918],"domain_scores_gemma":[0.9918173,0.0046081706,0.0017728929,0.0008303536,0.0004566696,0.0005146579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011178263,0.0002556223,0.0003485619,0.00054102653,0.0003076319,0.001819983,0.00039636827,0.00070354895,0.005937131],"category_scores_gemma":[0.009629377,0.00016231752,0.0003531991,0.0004914475,0.00064884924,0.0015717676,0.00068060757,0.0005469084,0.0003206365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0065472485,0.002719718,0.5800088,0.00062901276,0.0007884076,0.0016407028,0.0019885448,0.11136099,0.058242574,0.11995862,0.0027238948,0.11339156],"study_design_scores_gemma":[0.00045267632,0.0020230194,0.49728894,0.00008237129,0.0004205588,0.00083025533,0.00402926,0.37791547,0.0102694845,0.10333212,0.0031676658,0.00018829569],"about_ca_topic_score_codex":0.002362664,"about_ca_topic_score_gemma":0.002038112,"teacher_disagreement_score":0.005937131,"about_ca_system_score_codex":0.0006656262,"about_ca_system_score_gemma":0.00036492734,"threshold_uncertainty_score":0.019861698},"labels":[],"label_agreement":null},{"id":"W7115059627","doi":"10.1002/nav.70038","title":"Strategic Joining and Optimal Pricing in a Single‐Server Batch Arrival Queue With Different Information of Batch Size","year":2025,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Central University of Finance and Economics; National Natural Science Foundation of China","keywords":"Unobservable; Key (lock); Queue; Nash equilibrium; Bridge (graph theory); Variance (accounting); Batch production; Queueing theory","score_opus":0.05762231900422283,"score_gpt":0.3178885239063977,"score_spread":0.2602662049021749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7115059627","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.887687,0.00017104803,0.10679918,0.0010014431,0.0000473219,0.00011198899,0.00009771728,0.00007517825,0.0040090284],"genre_scores_gemma":[0.9957973,0.00004435132,0.0033243974,0.000037492227,0.000010167655,0.000014752808,0.000016289368,0.000005536853,0.00074972224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611354,0.0019269037,0.00016428348,0.00041810426,0.0004934596,0.00088367605],"domain_scores_gemma":[0.97235084,0.020835847,0.0031272068,0.0008095735,0.0013298058,0.0015467419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074348305,0.0006535729,0.001457646,0.0007053837,0.0010477254,0.0031011177,0.001934099,0.0019113955,0.0026980168],"category_scores_gemma":[0.02337766,0.0006515181,0.0007487233,0.000751044,0.0017376579,0.0032701355,0.0013026051,0.0020630753,0.00023558104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013171904,0.0006852186,0.0071154325,0.000097523596,0.00009444778,0.0005106398,0.0005304385,0.8717418,0.0065924367,0.09851557,0.0010267685,0.011772576],"study_design_scores_gemma":[0.000039258768,0.00012410006,0.0006750856,0.0000040201935,0.000014096826,0.000026044285,0.00013871533,0.98848593,0.00042741394,0.009972385,0.00007174138,0.000021161843],"about_ca_topic_score_codex":0.006684899,"about_ca_topic_score_gemma":0.004416501,"teacher_disagreement_score":0.0074348305,"about_ca_system_score_codex":0.0027256787,"about_ca_system_score_gemma":0.0029802874,"threshold_uncertainty_score":0.039319634},"labels":[],"label_agreement":null}]}