{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067266915,0.00024189222,0.925661,0.00022867134,0.00007505435,0.0013245044,0.064049274,0.00012589281,0.0015669847],"genre_scores_gemma":[0.92960215,0.0000048976376,0.065547965,0.0000029427817,0.000106687716,0.00015799004,0.0044929334,0.000026048874,0.000058373604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966446,0.00033897278,0.00079806073,0.00047820128,0.0013027727,0.00043737958],"domain_scores_gemma":[0.9883219,0.0065989303,0.00034988037,0.0013606169,0.0029759302,0.0003927668],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.002111007,0.00020690057,0.0005630946,0.00012444932,0.00022987,0.000052792704,0.00096470775,0.000176441,0.000025959205],"category_scores_gemma":[0.013160754,0.00016600372,0.000065824446,0.0005485731,0.0007589362,0.00007339006,0.00038514423,0.00032280438,0.0000336012],"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.00027769912,0.000529893,0.00019249407,0.0008643741,0.00011970229,0.000005480098,0.00005126314,0.00018005235,0.00077293016,0.9687814,0.027958779,0.00026594618],"study_design_scores_gemma":[0.008250876,0.0023182523,0.014914232,0.0034123587,0.0012897622,0.00004206111,0.0057882736,0.73440033,0.020503663,0.19605117,0.011553241,0.0014757817],"about_ca_topic_score_codex":0.00037990804,"about_ca_topic_score_gemma":0.000054679942,"teacher_disagreement_score":0.92287546,"about_ca_system_score_codex":0.00031408618,"about_ca_system_score_gemma":0.0006295598,"threshold_uncertainty_score":0.9951518},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21313098,0.083670676,0.58318335,0.02165055,0.0009120938,0.0043862187,0.00048398043,0.0004863318,0.092095844],"genre_scores_gemma":[0.9788623,0.012311518,0.006763159,0.000083831954,0.00019310472,0.00004698732,0.00021605473,0.00001244904,0.0015106281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866724,0.000055256056,0.00037771472,0.00040059927,0.00017435585,0.00032485215],"domain_scores_gemma":[0.99905354,0.00013086936,0.0001267983,0.00030122593,0.00025854094,0.00012902722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001231903,0.00011364059,0.00021521421,0.00042204984,0.0003244637,0.00022014092,0.00017605815,0.0001117827,0.00012076979],"category_scores_gemma":[0.00052482187,0.00012004018,0.00006590821,0.00061448035,0.00018001549,0.0002239105,0.000056877423,0.00031086663,0.00025883364],"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.00001735725,0.00010215109,0.00063796464,0.000009046212,0.000024358185,0.000002522958,0.00017300958,0.013199664,0.00012416423,0.9823291,0.0011490716,0.002231642],"study_design_scores_gemma":[0.00027312385,0.00013260829,0.011229828,0.000004979669,0.000010630132,0.0000018342215,0.000076273696,0.62724084,0.00001814441,0.35999778,0.00086613244,0.00014782297],"about_ca_topic_score_codex":0.0005957356,"about_ca_topic_score_gemma":0.000048118916,"teacher_disagreement_score":0.7657313,"about_ca_system_score_codex":0.00020567756,"about_ca_system_score_gemma":0.000035520276,"threshold_uncertainty_score":0.48950964},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002637795,0.0002140187,0.99299496,0.000071557886,0.000025721458,0.0012136161,0.000031923882,0.000037347265,0.002773065],"genre_scores_gemma":[0.96274847,0.00011645022,0.03637695,0.0000048378065,0.000021586844,0.00047733219,0.000031403426,0.00002305327,0.0001999262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990776,0.000046317225,0.00018302284,0.0001668034,0.0002641835,0.0002620314],"domain_scores_gemma":[0.99838096,0.0007542882,0.000026627433,0.00020925242,0.0005617438,0.00006712308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081966753,0.0000837281,0.00014396409,0.00010053165,0.00009327019,0.000028994911,0.000095010706,0.00007321725,0.000009514663],"category_scores_gemma":[0.002080237,0.000072467126,0.000019429526,0.00028718752,0.00025544674,0.000087624896,0.000015112337,0.00015112608,0.0000020780265],"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.0005454666,0.00012656757,0.00022386458,0.00096693035,0.00006675582,8.887072e-7,0.00024290817,0.8329761,0.001902336,0.15538071,0.0014543964,0.0061130803],"study_design_scores_gemma":[0.00416962,0.0005998763,0.00032085695,0.00009711624,0.000046858928,0.000004901901,0.0003724853,0.9271208,0.0019146984,0.053875923,0.011191,0.000285833],"about_ca_topic_score_codex":0.000023593851,"about_ca_topic_score_gemma":0.000028222334,"teacher_disagreement_score":0.96011066,"about_ca_system_score_codex":0.00005162489,"about_ca_system_score_gemma":0.00007118081,"threshold_uncertainty_score":0.29551238},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8860811,0.0021066514,0.07642717,0.0006885645,0.00019407045,0.0015916323,0.00005216161,0.00033634636,0.03252231],"genre_scores_gemma":[0.9047129,0.00017641409,0.0946825,0.000022881233,0.0001368136,0.00004651654,0.00002050934,0.00004679466,0.00015468421],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981343,0.00008631794,0.0003084885,0.0003495271,0.00051065645,0.00061068404],"domain_scores_gemma":[0.9989759,0.0003465447,0.000024538953,0.0002286667,0.00025433715,0.00017005867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015224684,0.00018161806,0.00025373933,0.00039205767,0.00009945209,0.00025882994,0.00042981654,0.000091603986,0.000044172386],"category_scores_gemma":[0.0011416808,0.00016602493,0.000011832142,0.000828879,0.0001406963,0.00024975504,0.00017509065,0.00097170676,0.000035804667],"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.000090167116,0.000088425746,0.010188101,0.000106181615,0.000012442341,0.00006061429,0.00054809795,0.97455686,0.00010117275,0.00056888803,0.00001360864,0.013665415],"study_design_scores_gemma":[0.0015677676,0.00008566208,0.0011922141,0.00020994271,0.0000033739823,0.000008187215,0.00042330663,0.9954812,0.0004138382,0.0002655788,0.00013054363,0.00021836607],"about_ca_topic_score_codex":0.00047357887,"about_ca_topic_score_gemma":0.0026333388,"teacher_disagreement_score":0.032367624,"about_ca_system_score_codex":0.00020378467,"about_ca_system_score_gemma":0.00013923566,"threshold_uncertainty_score":0.67702997},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23656034,0.00114324,0.3137098,0.019357381,0.0021876441,0.005816407,0.00020072742,0.0010638327,0.41996062],"genre_scores_gemma":[0.99675375,0.00007830173,0.00035974753,0.00036705393,0.00016268139,0.00007617057,0.00009474971,0.000011965168,0.0020955529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692327,0.00012846921,0.0005809689,0.00056692417,0.001083246,0.0007170996],"domain_scores_gemma":[0.99811655,0.00013176736,0.00005730169,0.0005853029,0.0010623259,0.00004674856],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0039974647,0.00019879699,0.00023488195,0.0005250819,0.00028466884,0.00023885051,0.0004672485,0.00013175253,0.0013371329],"category_scores_gemma":[0.003780947,0.00020126248,0.00006146083,0.0015218555,0.0004344181,0.00070604874,0.0003430616,0.0005205719,0.0025570923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030166487,0.0042771907,0.020702137,0.0030276163,0.000101618716,0.00011712614,0.000997536,0.18738674,0.00044028988,0.64676106,0.049722504,0.08616449],"study_design_scores_gemma":[0.000947408,0.00001731999,0.0082844915,0.000033522665,0.000009659002,3.461477e-7,0.00050338963,0.95747304,0.000014819259,0.01453011,0.01791299,0.00027291462],"about_ca_topic_score_codex":0.007293006,"about_ca_topic_score_gemma":0.0038761515,"teacher_disagreement_score":0.7700863,"about_ca_system_score_codex":0.00021960006,"about_ca_system_score_gemma":0.00004572828,"threshold_uncertainty_score":0.9995758},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7044099,0.000891273,0.12514932,0.0011906443,0.00080140773,0.0024368346,0.00035216706,0.00063688087,0.16413157],"genre_scores_gemma":[0.9918088,0.000031239182,0.0033889245,0.00016079248,0.00041374587,0.00003701695,0.00014639739,0.00005583998,0.0039572883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953035,0.00045697176,0.00073694234,0.0008265524,0.0016180202,0.0010579933],"domain_scores_gemma":[0.99541396,0.0012399477,0.0004053928,0.001039156,0.0018142493,0.00008726796],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0050438135,0.00036284263,0.00086060626,0.0015383484,0.0004671122,0.0002571038,0.00084185554,0.00021165595,0.0007221443],"category_scores_gemma":[0.011153038,0.00033243527,0.0004516074,0.004902854,0.0009342988,0.0006591654,0.0005075752,0.0007965024,0.00047895894],"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.0007881592,0.0010926059,0.04757309,0.0005080082,0.0042636353,0.00019570213,0.00031048912,0.12124667,0.021642765,0.7957125,0.004002755,0.0026636247],"study_design_scores_gemma":[0.0023702807,0.00020346923,0.008912349,0.0001468296,0.00496201,0.00000252583,0.0007571188,0.74148166,0.00693102,0.16998598,0.062516816,0.0017299575],"about_ca_topic_score_codex":0.0012348103,"about_ca_topic_score_gemma":0.00049180514,"teacher_disagreement_score":0.6257265,"about_ca_system_score_codex":0.00023982736,"about_ca_system_score_gemma":0.00013837914,"threshold_uncertainty_score":0.9999128},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003893364,0.00040658723,0.99142444,0.000048601192,0.00010443695,0.0027084379,0.00008455981,0.00017272407,0.0011568385],"genre_scores_gemma":[0.9774765,0.000012124163,0.021005303,0.000003640423,0.0002061638,0.0008516893,0.00013860951,0.000061134815,0.00024484925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977186,0.00005871016,0.0005264189,0.00036409413,0.00056183786,0.00077036157],"domain_scores_gemma":[0.99664176,0.001394121,0.000110377536,0.00046798092,0.0012846362,0.000101156125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021998072,0.00016151591,0.00029169326,0.00031743382,0.00013671936,0.00006395482,0.00028547758,0.0003991913,0.000001551862],"category_scores_gemma":[0.0039016367,0.00017164485,0.00007978923,0.00068435224,0.000078011326,0.00013660252,0.000026335732,0.00050324394,0.0000018275707],"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.00013575399,0.00011690099,0.000037974707,0.0004176102,0.00004644229,9.164954e-7,0.000037755875,0.94161165,0.0056990604,0.035238363,0.0035094004,0.0131481765],"study_design_scores_gemma":[0.0006933491,0.00033337087,0.000047810125,0.000050168084,0.000026780344,0.000002972825,0.000013072843,0.9679548,0.010166992,0.019737275,0.0008100026,0.00016338559],"about_ca_topic_score_codex":0.00011705167,"about_ca_topic_score_gemma":0.000033665132,"teacher_disagreement_score":0.9735831,"about_ca_system_score_codex":0.0003991413,"about_ca_system_score_gemma":0.00018546476,"threshold_uncertainty_score":0.6999474},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02343858,0.000016586808,0.9700615,0.0003890599,0.000016631153,0.0011381647,0.0037959877,0.00007507014,0.0010684408],"genre_scores_gemma":[0.67866653,0.0000024112828,0.32046416,0.000006798637,0.000054204334,0.00021043554,0.00023667951,0.000026101288,0.00033268708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997465,0.0001387627,0.00046185657,0.0003860777,0.0010600252,0.00048825148],"domain_scores_gemma":[0.9822012,0.015117899,0.00020959317,0.0004708126,0.0018517849,0.0001487016],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.000844707,0.00019528868,0.0002904737,0.00010258253,0.00032605807,0.00006651925,0.00028445394,0.00012154264,0.00013487757],"category_scores_gemma":[0.019434346,0.00014036376,0.000045872137,0.00050357886,0.00057471124,0.00007945636,0.00006373045,0.0002684713,0.000010462238],"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.00044606553,0.0008167741,0.0016763199,0.00035711267,0.00003104331,0.000004582171,0.00006079189,0.004119742,0.0032518567,0.98423517,0.0036443612,0.0013561666],"study_design_scores_gemma":[0.006625502,0.0017635293,0.070843115,0.0008038762,0.00016273078,0.000016483755,0.00056455715,0.25087875,0.03912538,0.62677115,0.0016705705,0.0007743843],"about_ca_topic_score_codex":0.00031820123,"about_ca_topic_score_gemma":0.00024122794,"teacher_disagreement_score":0.65522796,"about_ca_system_score_codex":0.00015111057,"about_ca_system_score_gemma":0.00028958588,"threshold_uncertainty_score":0.9888254},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98849696,0.0000554215,0.005741749,0.00061342464,0.00004101775,0.000525529,0.000022031903,0.00008250701,0.0044213478],"genre_scores_gemma":[0.99474144,0.000009673197,0.00069165777,0.00018366578,0.00013635097,0.00002191751,0.000033614037,0.000030155112,0.0041514994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975099,0.0001996534,0.0003176982,0.00045948615,0.0009738168,0.0005394505],"domain_scores_gemma":[0.9964671,0.0011219032,0.0002163637,0.00086843164,0.0012723162,0.00005385729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023276568,0.00019792675,0.00040755028,0.00058066205,0.00044182406,0.0003407247,0.0006446154,0.00011403484,0.0004862165],"category_scores_gemma":[0.004151346,0.00013125947,0.0001098851,0.003028872,0.00076032913,0.0007528662,0.0005980004,0.00051362935,0.00017555115],"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.0011425212,0.0014320761,0.4231699,0.00095798663,0.0042741275,0.000056811637,0.0007239039,0.4601023,0.0096630715,0.0805724,0.002773246,0.015131657],"study_design_scores_gemma":[0.00053991604,0.000076203265,0.03081124,0.000058733964,0.00096302206,6.533411e-7,0.0004281134,0.9490835,0.00023347259,0.012647075,0.0048452504,0.00031281525],"about_ca_topic_score_codex":0.005260849,"about_ca_topic_score_gemma":0.0009772892,"teacher_disagreement_score":0.48898122,"about_ca_system_score_codex":0.000070796996,"about_ca_system_score_gemma":0.000055445154,"threshold_uncertainty_score":0.7952865},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101701885,0.0002367773,0.83329964,0.013915657,0.00038839705,0.00422393,0.00012669837,0.0003594421,0.04574758],"genre_scores_gemma":[0.99432546,0.00004755185,0.001370377,0.0012953886,0.00030845377,0.000086963206,0.000086188695,0.000020631882,0.0024589566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745005,0.00005018039,0.00030499272,0.00055360177,0.0009032862,0.0007378984],"domain_scores_gemma":[0.9982222,0.00015524281,0.000020328984,0.00040798032,0.001135055,0.000059245558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026151906,0.00019233517,0.00021110426,0.0005298585,0.00057169126,0.00037493632,0.0003544982,0.000109123626,0.00007832167],"category_scores_gemma":[0.0025227559,0.00018555476,0.00007880742,0.0006136694,0.00022028349,0.0003694273,0.00018969699,0.00038150727,0.00014281856],"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.0013854434,0.0009784994,0.00078074855,0.0012225285,0.00007034557,0.000025209833,0.00037276704,0.5728913,0.0013755911,0.33505303,0.024850158,0.06099437],"study_design_scores_gemma":[0.0009986905,0.000088065615,0.0030625123,0.000030561077,0.000016225422,1.4662575e-7,0.0001618111,0.9703296,0.00005709154,0.017853301,0.0071953977,0.00020660901],"about_ca_topic_score_codex":0.0019280172,"about_ca_topic_score_gemma":0.0028990258,"teacher_disagreement_score":0.8926236,"about_ca_system_score_codex":0.00013701511,"about_ca_system_score_gemma":0.00012810274,"threshold_uncertainty_score":0.75667036},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85133797,0.007693418,0.071377926,0.00003623921,0.00051438017,0.0012069596,0.00007533478,0.0002032959,0.0675545],"genre_scores_gemma":[0.9983292,0.00026646737,0.0009447371,0.000004933235,0.000043202166,0.00003919788,0.000008212926,0.000041495503,0.0003225424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99635404,0.00083196186,0.00056830666,0.00034370268,0.0011388873,0.0007630698],"domain_scores_gemma":[0.9972777,0.001565042,0.00003400424,0.0006023918,0.00032457433,0.00019633753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035497819,0.00020884258,0.00053404906,0.0004767526,0.00006290363,0.000024393119,0.0003522755,0.00021729265,0.000046775378],"category_scores_gemma":[0.0031968302,0.00020674299,0.00012776097,0.0010033901,0.0002583619,0.0001001016,0.00008258447,0.0008369238,0.000071548275],"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.000093698836,0.00050618034,0.0043042875,0.0041375333,0.00037948028,0.0006185962,0.0014893222,0.7066799,0.038095385,0.23653725,0.0054103304,0.0017480358],"study_design_scores_gemma":[0.003340333,0.0005407406,0.008068021,0.00061947136,0.00011298734,0.000029572075,0.00074497395,0.8256535,0.053409368,0.10116658,0.005096116,0.0012183276],"about_ca_topic_score_codex":0.0017383848,"about_ca_topic_score_gemma":0.00046983347,"teacher_disagreement_score":0.14699127,"about_ca_system_score_codex":0.00032480794,"about_ca_system_score_gemma":0.00010673216,"threshold_uncertainty_score":0.8430735},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8537489,0.00085738604,0.002970634,0.0043061245,0.00048608799,0.0014476066,0.000019643687,0.00023223938,0.13593137],"genre_scores_gemma":[0.997897,0.00006671731,0.00036804428,0.0001550721,0.0006176824,0.00007059482,0.000021749796,0.000026141302,0.00077699794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9981473,0.000040450617,0.0003562246,0.00028971728,0.0006004443,0.00056586193],"domain_scores_gemma":[0.9976277,0.00063560536,0.00012443349,0.00047129896,0.001105736,0.00003526719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013243218,0.0001357834,0.00020869577,0.0005101269,0.0003338122,0.00032631098,0.0005165531,0.00008706778,0.0005949217],"category_scores_gemma":[0.0020797027,0.00012296037,0.000072224306,0.00082791003,0.000303553,0.00062387524,0.000502622,0.0004060243,0.000701208],"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.00005263624,0.00046888535,0.34770343,0.0007117881,0.00006163286,0.00001217924,0.00011016841,0.000062124454,0.05016593,0.41451657,0.02993425,0.15620042],"study_design_scores_gemma":[0.0005727601,0.000046475474,0.7959108,0.00012854199,0.00007902144,0.0000031018128,0.00042995234,0.0028785663,0.00080312486,0.16809511,0.030615585,0.00043700618],"about_ca_topic_score_codex":0.0055349395,"about_ca_topic_score_gemma":0.00012449479,"teacher_disagreement_score":0.44820732,"about_ca_system_score_codex":0.00005075955,"about_ca_system_score_gemma":0.00007896451,"threshold_uncertainty_score":0.9012844},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81211126,0.0001205391,0.004148082,0.0012113096,0.00081125996,0.001609271,0.00002747714,0.00020793226,0.1797529],"genre_scores_gemma":[0.9977582,0.0000072103785,0.00058870285,0.00051390415,0.00042170472,0.00009887577,0.00003644837,0.000040797564,0.000534156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99662334,0.0001973559,0.00066367676,0.0006036049,0.0010825453,0.00082947],"domain_scores_gemma":[0.997652,0.00009978332,0.00015217316,0.0009354106,0.0010633265,0.00009732895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040529436,0.00023592601,0.00036725774,0.0013338198,0.00024000989,0.0001996827,0.00072190806,0.00013203439,0.0003065153],"category_scores_gemma":[0.0011027384,0.00022642966,0.00009292164,0.0016335138,0.0003789509,0.000582726,0.00077277474,0.00044756097,0.0003419277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026632432,0.0021017755,0.06412019,0.0017690255,0.00008122292,0.00007563138,0.0011574314,0.001099974,0.004519474,0.9106003,0.013352406,0.00085621834],"study_design_scores_gemma":[0.0037742371,0.0011830477,0.74125063,0.0015642807,0.00021120408,0.000007965833,0.047858406,0.047303367,0.0036884171,0.12806025,0.022860484,0.0022377053],"about_ca_topic_score_codex":0.012286767,"about_ca_topic_score_gemma":0.0020694686,"teacher_disagreement_score":0.7825401,"about_ca_system_score_codex":0.00040294457,"about_ca_system_score_gemma":0.00013651491,"threshold_uncertainty_score":0.9942905},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5877383,0.00032711017,0.40819034,0.0012870932,0.000031188945,0.0010155395,0.00019393438,0.000047527727,0.0011690055],"genre_scores_gemma":[0.9972297,0.000041892417,0.0025504946,0.000014386585,0.000008965784,0.000013095518,0.000017078562,0.0000056580748,0.000118735225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986732,0.00021689905,0.0003303794,0.00020652854,0.00033655943,0.00023644001],"domain_scores_gemma":[0.9940253,0.005232032,0.00006653927,0.0003130862,0.00024703637,0.00011600095],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.001348345,0.000097614706,0.00022298023,0.0000746254,0.00013056185,0.00010121371,0.00016453792,0.000084005354,0.000008758066],"category_scores_gemma":[0.010002895,0.00006354333,0.000019034575,0.00029568796,0.0004146782,0.00005190498,0.00007230009,0.00041498616,0.000002026458],"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.000039167488,0.00013339001,0.0015370866,0.00009116096,0.000005976117,0.0000014896812,0.00036211248,0.00054589886,0.0007372893,0.9938093,0.0015540574,0.0011830981],"study_design_scores_gemma":[0.0004385277,0.000085396365,0.10292776,0.00008335966,0.0000083342675,0.0000028970383,0.0004315139,0.3849267,0.000090772926,0.51065207,0.0002590112,0.00009362904],"about_ca_topic_score_codex":0.00027470294,"about_ca_topic_score_gemma":0.00016164807,"teacher_disagreement_score":0.4831572,"about_ca_system_score_codex":0.000070978684,"about_ca_system_score_gemma":0.00007562071,"threshold_uncertainty_score":0.99833626},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7938521,0.00025908873,0.16294727,0.0016283027,0.000641319,0.00503476,0.000056019882,0.00015241106,0.03542877],"genre_scores_gemma":[0.99523014,0.00009219432,0.0020148612,0.00030371005,0.00060312916,0.00030629465,0.00007314694,0.0000530285,0.0013234998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971571,0.00013779037,0.0004837127,0.00047636734,0.0007837948,0.0009612237],"domain_scores_gemma":[0.9974676,0.00096452056,0.00010125518,0.00047619428,0.000928035,0.00006238967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039362404,0.00029215825,0.00040291654,0.00070645043,0.00036928206,0.0003251595,0.00060224225,0.0001354723,0.0007595086],"category_scores_gemma":[0.0014923821,0.0002245022,0.00023328497,0.00073105685,0.00034302013,0.00050903717,0.00021598044,0.00041187558,0.0001299876],"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.0025475929,0.0019992816,0.036707204,0.005913808,0.0011214581,0.000022741215,0.00072908605,0.11326388,0.023297748,0.3937402,0.11377161,0.30688536],"study_design_scores_gemma":[0.0048705745,0.0023291518,0.07803056,0.000592089,0.00018516602,0.0000027026294,0.001515877,0.7855555,0.0037030329,0.062018625,0.059852753,0.0013439906],"about_ca_topic_score_codex":0.0025246553,"about_ca_topic_score_gemma":0.000052579784,"teacher_disagreement_score":0.6722916,"about_ca_system_score_codex":0.00026606786,"about_ca_system_score_gemma":0.00010053139,"threshold_uncertainty_score":0.9154934},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5565393,0.001138083,0.207899,0.0053668963,0.000465681,0.0038989757,0.00044413013,0.0011530932,0.22309482],"genre_scores_gemma":[0.9959947,0.000032861593,0.0012581962,0.0009757214,0.00040499374,0.00010824581,0.0002444406,0.00011582437,0.0008650438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935884,0.0003658499,0.00091545563,0.0011796313,0.0024767646,0.0014739118],"domain_scores_gemma":[0.9927802,0.0017757048,0.00053495256,0.0014526446,0.0033096839,0.00014681142],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004622542,0.0005934056,0.0011394145,0.0022661237,0.00063699996,0.0004576075,0.0013327107,0.00026389715,0.0008306185],"category_scores_gemma":[0.008572642,0.0004932337,0.00036242398,0.011286398,0.00089146884,0.00097176555,0.00039222624,0.0011527543,0.00028434885],"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.0020296108,0.0010212016,0.032435495,0.0018664466,0.0039172913,0.00032309082,0.00082095125,0.790019,0.00050580176,0.16443324,0.0014532525,0.001174643],"study_design_scores_gemma":[0.0043215184,0.00051209354,0.0014659927,0.00075606955,0.008303167,0.000010415251,0.007807294,0.7569242,0.0016219544,0.12829736,0.08699495,0.002984969],"about_ca_topic_score_codex":0.0011462021,"about_ca_topic_score_gemma":0.0011065224,"teacher_disagreement_score":0.43945536,"about_ca_system_score_codex":0.00016510165,"about_ca_system_score_gemma":0.0003063386,"threshold_uncertainty_score":0.99977857},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03127173,0.000115350675,0.9647072,0.0005220106,0.000053164455,0.00060246146,0.000070822534,0.00017404363,0.0024831994],"genre_scores_gemma":[0.71848434,0.000023610115,0.2808486,0.00007270461,0.000101278834,0.000040988038,0.000009149521,0.000021122876,0.00039819043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937728,0.00030949924,0.0007272652,0.0008534282,0.0027727615,0.0015642459],"domain_scores_gemma":[0.97656965,0.017908363,0.0001504629,0.0014500136,0.0034708625,0.00045064779],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.012903073,0.00023839175,0.0004990114,0.0007513315,0.0005636523,0.00024348048,0.0022069553,0.0002435421,0.000009711425],"category_scores_gemma":[0.06462536,0.00021905218,0.00023136594,0.0021396372,0.0008984037,0.00021430873,0.0009833343,0.0009646769,0.00003926756],"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.0008660515,0.003078399,0.012865019,0.0015139162,0.00025753397,0.000075942124,0.001422727,0.13596028,0.008689629,0.64567375,0.003430839,0.18616594],"study_design_scores_gemma":[0.00063960947,0.0012457012,0.0025918693,0.00016232055,0.000015548143,0.0000036875133,0.00008561203,0.7177476,0.008019355,0.26892677,0.00022948817,0.0003324308],"about_ca_topic_score_codex":0.000812068,"about_ca_topic_score_gemma":0.000089252266,"teacher_disagreement_score":0.68721265,"about_ca_system_score_codex":0.00036617467,"about_ca_system_score_gemma":0.00092662446,"threshold_uncertainty_score":0.9432537},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47296217,0.012545362,0.07717953,0.0020122349,0.0018848267,0.0014237363,0.0048464932,0.000175242,0.42697042],"genre_scores_gemma":[0.9982435,0.00038073104,0.00033707827,0.000034307726,0.00013252671,0.00004271109,0.00002151229,0.00001753896,0.00079011294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980605,0.000080826874,0.00062200957,0.00039075836,0.00018955361,0.0006563094],"domain_scores_gemma":[0.9984524,0.00048945716,0.00013861702,0.00044456334,0.00032776687,0.00014714243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025094892,0.00015185829,0.00041806547,0.0003850582,0.00037837587,0.000034644785,0.0002252586,0.00012563968,0.00011945955],"category_scores_gemma":[0.0059246323,0.00015948719,0.00015131135,0.0006678024,0.00060815486,0.000030272837,0.000062499945,0.00041425703,0.00054313603],"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.000048178998,0.00031756042,0.039568804,0.000060314702,0.00009240987,0.0000067899573,0.00035383386,0.0013936873,0.000043210617,0.9516754,0.0062954947,0.00014429736],"study_design_scores_gemma":[0.0042557125,0.0015541789,0.21263032,0.000075501084,0.00005743798,0.000020776306,0.0012194972,0.018575858,0.00137703,0.49618313,0.26300073,0.0010498476],"about_ca_topic_score_codex":0.0011513688,"about_ca_topic_score_gemma":0.00012848226,"teacher_disagreement_score":0.5252813,"about_ca_system_score_codex":0.00028630364,"about_ca_system_score_gemma":0.000082378676,"threshold_uncertainty_score":0.7092767},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5005638,0.0033085083,0.45088586,0.0046178834,0.0009115656,0.0021130645,0.00035998644,0.00013633553,0.037102968],"genre_scores_gemma":[0.9940773,0.0004657996,0.00048179948,0.000105807376,0.0005627591,0.00019889906,0.000027402673,0.000021062728,0.0040591676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924286,0.0030269204,0.00082478375,0.0007771254,0.0016766308,0.0012659386],"domain_scores_gemma":[0.9888358,0.008508658,0.00021037902,0.0010467903,0.0008790127,0.0005193359],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.036782052,0.0002382574,0.00056989,0.0010292911,0.00043097616,0.00040214942,0.0010091747,0.00020101192,0.0008242546],"category_scores_gemma":[0.018320482,0.0001767772,0.00015585001,0.005846823,0.001479051,0.0003761159,0.0007841267,0.0009560572,0.00046969397],"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.00079911645,0.0005437091,0.031979356,0.000049734183,0.00034042177,0.000058307854,0.0057552434,0.0039098286,0.0011210552,0.92472464,0.013760911,0.016957678],"study_design_scores_gemma":[0.001069995,0.00043703735,0.08613153,0.000089452624,0.0002942618,0.00002840739,0.0078037106,0.044625442,0.00052864547,0.747591,0.110564,0.0008365225],"about_ca_topic_score_codex":0.0002606733,"about_ca_topic_score_gemma":0.00053748715,"teacher_disagreement_score":0.4935135,"about_ca_system_score_codex":0.00023682436,"about_ca_system_score_gemma":0.0001629235,"threshold_uncertainty_score":0.9918356},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77098215,0.040031772,0.10174879,0.01191233,0.0015148413,0.0035058148,0.000115783674,0.00032904284,0.06985947],"genre_scores_gemma":[0.9923772,0.00018334697,0.0010589992,0.000014809345,0.000067420624,0.000013284151,3.6520396e-7,0.000011190716,0.0062733544],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960138,0.00029148758,0.000523124,0.00035813393,0.0024019221,0.00041150657],"domain_scores_gemma":[0.99441874,0.003024521,0.000105432504,0.0005947333,0.0017311233,0.00012543917],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.006780767,0.000113665,0.00022991783,0.00047925138,0.00026341918,0.00014804355,0.0010486485,0.00012155069,0.000073090625],"category_scores_gemma":[0.13037503,0.000057103232,0.000045070225,0.0035815057,0.0010949438,0.0001247133,0.00044692468,0.00048463262,0.00009541767],"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.00088851264,0.0021612314,0.028035443,0.002292045,0.0003685744,0.000096352065,0.0078852875,0.19975147,0.039201766,0.22880134,0.10617486,0.38434312],"study_design_scores_gemma":[0.0039168647,0.0020352874,0.06676503,0.0013602263,0.00014809704,0.00026388647,0.0033397567,0.20438711,0.11025633,0.45267895,0.15296851,0.0018799433],"about_ca_topic_score_codex":0.000034977937,"about_ca_topic_score_gemma":0.000013998914,"teacher_disagreement_score":0.3824632,"about_ca_system_score_codex":0.00006622393,"about_ca_system_score_gemma":0.00044795516,"threshold_uncertainty_score":0.8769502},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42227364,0.0020635836,0.5098048,0.002841695,0.0030391093,0.0032872523,0.0012970329,0.00009909567,0.05529383],"genre_scores_gemma":[0.9970177,0.000033774428,0.00048214052,0.000028797796,0.0003300226,0.00006686176,0.000009486886,0.000023898368,0.0020073454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837506,0.000073999196,0.0005472466,0.00034414956,0.00014338129,0.0005161567],"domain_scores_gemma":[0.99659675,0.0020877314,0.00022156312,0.0005471119,0.0004545887,0.00009225395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00677175,0.00012520823,0.00035038925,0.00021222247,0.00031068662,0.000097651995,0.0005480063,0.00016767035,0.0002182995],"category_scores_gemma":[0.00765335,0.00010137595,0.0001271239,0.00039546675,0.00065114425,0.00007791049,0.00012301984,0.0006744326,0.0003222548],"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.0001327711,0.0000899916,0.00325587,0.00006524582,0.00008067553,0.0000017930654,0.00035700962,0.00030741206,0.0017378867,0.9915602,0.0014114539,0.0009996932],"study_design_scores_gemma":[0.0017807122,0.0010920306,0.016078155,0.0000649194,0.000035381447,0.000011896274,0.00035425648,0.44867048,0.0014472017,0.47048026,0.059507664,0.00047705852],"about_ca_topic_score_codex":0.00062525773,"about_ca_topic_score_gemma":0.00059110235,"teacher_disagreement_score":0.57474405,"about_ca_system_score_codex":0.00006983649,"about_ca_system_score_gemma":0.0000888668,"threshold_uncertainty_score":0.91623276},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11318962,0.0007560428,0.8715434,0.00025688717,0.000090491165,0.0008148916,0.000091682174,0.00007335572,0.013183608],"genre_scores_gemma":[0.97792685,0.00012476617,0.018917937,0.00007409156,0.00014810228,0.000097239885,0.00003095567,0.00003112343,0.0026489394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9913809,0.0006411375,0.0009189987,0.0013445144,0.0046051536,0.0011093315],"domain_scores_gemma":[0.98645914,0.008042063,0.00023703102,0.0009807626,0.0039012316,0.0003797832],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.012744375,0.00027375465,0.00053877995,0.0010867689,0.0012994971,0.00058990717,0.0015338068,0.00018942295,0.000033520475],"category_scores_gemma":[0.030787354,0.00021219559,0.00014800164,0.0034312264,0.0017133604,0.00045196366,0.00044294685,0.0006054866,0.00009666368],"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.0010153771,0.003021899,0.0033687965,0.0005377186,0.00011698497,0.00022526893,0.0064367377,0.79972285,0.0056502908,0.15342128,0.010325795,0.01615699],"study_design_scores_gemma":[0.00079619855,0.00039437987,0.00022382705,0.00002572261,0.00002171038,0.00004467876,0.0005023944,0.9185651,0.000844798,0.07631882,0.0019671458,0.00029523319],"about_ca_topic_score_codex":0.00017473524,"about_ca_topic_score_gemma":0.00006371247,"teacher_disagreement_score":0.8647372,"about_ca_system_score_codex":0.00017815633,"about_ca_system_score_gemma":0.00090678246,"threshold_uncertainty_score":0.9994812},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5786782,0.0003374817,0.30838203,0.0032464636,0.0019535657,0.0031361412,0.00025403305,0.00030787336,0.1037042],"genre_scores_gemma":[0.9724221,0.0000050994545,0.015744736,0.0002559569,0.0012135227,0.000054555425,0.000024029861,0.000040309948,0.01023968],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9922348,0.0006686563,0.0008977902,0.00077014073,0.003906291,0.0015222677],"domain_scores_gemma":[0.9875095,0.0073678414,0.00020768544,0.0008645936,0.0035479453,0.0005024186],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["metaresearch","insufficient_payload"],"category_scores_codex":[0.03014894,0.0002583611,0.00047451205,0.00079004536,0.0009597769,0.00063108717,0.00066609704,0.00018606703,0.0011128203],"category_scores_gemma":[0.111120336,0.00019727726,0.00014452267,0.0018145333,0.0006679231,0.00064517267,0.00077757356,0.0007781691,0.0013633171],"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.0019554659,0.0022309055,0.047359463,0.00019630803,0.00023293545,0.000086948974,0.008254059,0.005239634,0.048699018,0.16709901,0.5306139,0.18803231],"study_design_scores_gemma":[0.001832712,0.000637602,0.07356121,0.00011611923,0.000066182794,0.00008173008,0.0014631548,0.46453294,0.007998765,0.027495818,0.4207198,0.0014939533],"about_ca_topic_score_codex":0.00006672826,"about_ca_topic_score_gemma":0.000010036094,"teacher_disagreement_score":0.4592933,"about_ca_system_score_codex":0.00019458706,"about_ca_system_score_gemma":0.0004900567,"threshold_uncertainty_score":0.9998003},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.301938,0.00085538445,0.41253752,0.010213044,0.00077936554,0.0021180601,0.00012735346,0.00045265394,0.27097863],"genre_scores_gemma":[0.93920285,0.00006219053,0.056213234,0.00027731314,0.0010531998,0.0000456338,0.00001991892,0.00004258843,0.003083094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9882958,0.0015299006,0.0011317097,0.0011516458,0.0064734677,0.0014174628],"domain_scores_gemma":[0.98706955,0.008767525,0.00023642162,0.0012492026,0.0023100667,0.0003672482],"candidate_categories":["metaresearch","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.021552527,0.00030082234,0.00047432605,0.0014893031,0.0008502078,0.0012667606,0.001962229,0.000319268,0.0009069263],"category_scores_gemma":[0.0459164,0.00023931838,0.00020345685,0.002870731,0.0012630639,0.0004404601,0.0006984018,0.001776328,0.003660538],"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.0007006005,0.00088175805,0.0059719477,0.0000836299,0.00014323975,0.00025841093,0.0029605082,0.08958638,0.02149918,0.60550815,0.013713225,0.25869298],"study_design_scores_gemma":[0.0034928434,0.0011775017,0.0053802775,0.00032399117,0.000048026104,0.00024072158,0.016121281,0.4055954,0.010484478,0.28913754,0.26629516,0.001702776],"about_ca_topic_score_codex":0.00019043694,"about_ca_topic_score_gemma":0.00018060394,"teacher_disagreement_score":0.63726485,"about_ca_system_score_codex":0.00044448712,"about_ca_system_score_gemma":0.001143556,"threshold_uncertainty_score":0.99977005},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3943624,0.00027673322,0.57913774,0.00078704883,0.00017283927,0.0008226086,0.000027314441,0.00027332225,0.02413999],"genre_scores_gemma":[0.9796507,0.00037994917,0.01973193,0.000018361405,0.000041392275,0.000035010624,0.000009765076,0.000023921697,0.00010897249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983722,0.000062479325,0.00032615315,0.00031475126,0.00042798364,0.0004964188],"domain_scores_gemma":[0.99880236,0.00036396118,0.000023000484,0.0003573194,0.00031039098,0.00014298367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020031559,0.00013919658,0.00019543404,0.00016968808,0.00011583358,0.000077541124,0.00018518932,0.00019166578,0.0000068176405],"category_scores_gemma":[0.004972487,0.00013375819,0.000028053728,0.00048559663,0.000331716,0.00015661554,0.000115241,0.00079155335,0.000014023189],"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.00003188323,0.000044648037,0.00037663348,0.00012949709,0.0000029256041,0.000015920532,0.00025707902,0.98121613,0.001095832,0.016006034,0.00009859285,0.0007248136],"study_design_scores_gemma":[0.0003837458,0.000074637435,0.0005059009,0.00008525704,0.000002097479,0.0000025476538,0.00015002805,0.82572836,0.0005765466,0.17229523,0.0000559895,0.00013967464],"about_ca_topic_score_codex":0.00037844453,"about_ca_topic_score_gemma":0.0002353848,"teacher_disagreement_score":0.5852883,"about_ca_system_score_codex":0.00039659918,"about_ca_system_score_gemma":0.0001554718,"threshold_uncertainty_score":0.5952891},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019299239,0.00013580585,0.9593005,0.00062092947,0.00030866748,0.0019901784,0.000039063147,0.00013603241,0.018169586],"genre_scores_gemma":[0.9969253,0.000012496843,0.00065580464,0.00017841792,0.00012590122,0.00031715172,0.00014429097,0.000019778305,0.0016208595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747884,0.00006213044,0.0003404758,0.00053253793,0.0009109154,0.0006750989],"domain_scores_gemma":[0.9974805,0.00016797647,0.00005884469,0.00050315866,0.0017397591,0.000049766713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002541469,0.00020344673,0.000207163,0.0003073919,0.0005144483,0.00026367203,0.00033920433,0.00009132661,0.00022851944],"category_scores_gemma":[0.0023153785,0.00017797112,0.000059652077,0.0009165547,0.0002542729,0.00060573826,0.0001164749,0.0002582411,0.00041126402],"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.00030365284,0.00031468118,0.00032294248,0.0009799742,0.00006118075,0.0000035400394,0.00007878893,0.65319437,0.000063300235,0.33317503,0.00930802,0.002194503],"study_design_scores_gemma":[0.0019065215,0.00018549249,0.0008833766,0.00007385002,0.00008554142,0.0000010165995,0.001381818,0.8559642,0.00008074692,0.08087289,0.05798231,0.000582241],"about_ca_topic_score_codex":0.0012104207,"about_ca_topic_score_gemma":0.0010558023,"teacher_disagreement_score":0.9776261,"about_ca_system_score_codex":0.00016166938,"about_ca_system_score_gemma":0.00014557719,"threshold_uncertainty_score":0.72574514},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009657888,0.00081135175,0.9917936,0.0003052112,0.00014688793,0.0007462753,0.000053073192,0.00021218378,0.0058348416],"genre_scores_gemma":[0.8510668,0.0013536494,0.14580843,0.00007220913,0.0004451611,0.0001447599,0.00003807454,0.00005057328,0.0010203262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840134,0.000046429734,0.00022519456,0.00028143267,0.00040355275,0.0006420419],"domain_scores_gemma":[0.9979272,0.0013329854,0.000028999764,0.00029131022,0.0002975991,0.00012189943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008697589,0.00018201386,0.00018348277,0.00012542128,0.00041582255,0.0001309168,0.00027860346,0.00012909407,0.000010213041],"category_scores_gemma":[0.0008401233,0.00014165897,0.00004805746,0.00022207234,0.00022780235,0.00008891357,0.00006474387,0.00058833696,0.000017667075],"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.00004135948,0.000042794083,0.0000055663536,0.000097408185,0.000057223904,0.000009898223,0.00038351366,0.50364286,0.00035625516,0.012868032,0.0025957024,0.4798994],"study_design_scores_gemma":[0.00060933427,0.0003223606,0.0003117878,0.000058260914,0.000024272818,0.00000868064,0.000121480036,0.89681983,0.0022002335,0.08558281,0.01366054,0.00028038447],"about_ca_topic_score_codex":0.00002394589,"about_ca_topic_score_gemma":0.0000133345475,"teacher_disagreement_score":0.8509702,"about_ca_system_score_codex":0.00012512959,"about_ca_system_score_gemma":0.000041616484,"threshold_uncertainty_score":0.5776685},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40094107,0.0013721279,0.057883933,0.003077963,0.0011060607,0.0016797377,0.00003212713,0.0011094367,0.5327975],"genre_scores_gemma":[0.99317884,0.000026797983,0.0013358706,0.00026660482,0.0021803977,0.000032245924,0.0000253201,0.00005093113,0.0029030084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969036,0.00011159315,0.00025998353,0.0003748184,0.0011855924,0.0011644319],"domain_scores_gemma":[0.99784535,0.0005583861,0.0001320404,0.00058490067,0.0008003085,0.00007900555],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0036557843,0.00022818537,0.00028976458,0.00054284185,0.0005451164,0.00029806487,0.00054269953,0.000123531,0.00037576092],"category_scores_gemma":[0.00390783,0.00017818477,0.00008085947,0.0015733362,0.0006407816,0.0011204621,0.00043232576,0.0008136219,0.0023157483],"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.00038057612,0.0004342111,0.053214297,0.00026810064,0.00013479959,0.00007444613,0.000113065704,0.0009967574,0.000893569,0.9282955,0.008863355,0.0063313358],"study_design_scores_gemma":[0.0015628778,0.00011979769,0.018135047,0.00019317557,0.0003476237,0.000016576827,0.0014179524,0.008159986,0.0010497116,0.1452493,0.82234865,0.0013992669],"about_ca_topic_score_codex":0.0006646242,"about_ca_topic_score_gemma":0.00016258153,"teacher_disagreement_score":0.8134853,"about_ca_system_score_codex":0.00015742927,"about_ca_system_score_gemma":0.00006470351,"threshold_uncertainty_score":0.99846107},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023020493,0.0048142676,0.9003319,0.0018086213,0.001851382,0.0014271046,0.000022154834,0.0012895023,0.065434575],"genre_scores_gemma":[0.9477387,0.0012921192,0.04750071,0.00011569208,0.0007446971,0.000036080823,0.000016116619,0.00013868457,0.002417191],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957039,0.00044544996,0.0005861902,0.00040850628,0.0014004845,0.0014554674],"domain_scores_gemma":[0.99550724,0.0027510154,0.00006227359,0.00073483685,0.0006627813,0.000281855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014300492,0.00025712664,0.0002589873,0.00024941386,0.00059133273,0.0006333965,0.0008330612,0.0002909801,0.00008531537],"category_scores_gemma":[0.0043247817,0.00020793818,0.00009169793,0.0012487964,0.00040915565,0.00030984276,0.000315441,0.001830959,0.00020880217],"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.00010204171,0.00014047661,0.003928984,0.0003043136,0.00014009228,0.00014938547,0.0029298707,0.5787121,0.012165396,0.035919245,0.007047293,0.3584608],"study_design_scores_gemma":[0.00078397995,0.000171486,0.0038983284,0.00037562105,0.00003119236,0.0000241601,0.0022273455,0.9255081,0.0133074755,0.0052879583,0.04774976,0.0006346184],"about_ca_topic_score_codex":0.00008059432,"about_ca_topic_score_gemma":0.00007257233,"teacher_disagreement_score":0.9247182,"about_ca_system_score_codex":0.00039420195,"about_ca_system_score_gemma":0.00011830845,"threshold_uncertainty_score":0.8479473},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004010217,0.0038039724,0.9761238,0.001790984,0.0002833891,0.0019534742,0.00018145084,0.00021003724,0.011642664],"genre_scores_gemma":[0.9498138,0.0006196823,0.047167957,0.00007705312,0.0007293099,0.0002545236,0.00002338346,0.00005735453,0.0012569674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978319,0.00007177453,0.00041015193,0.0002996938,0.00051784987,0.0008686626],"domain_scores_gemma":[0.99758077,0.0016597178,0.000029837056,0.00030454466,0.00025972963,0.00016541865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023399333,0.00020607248,0.000275814,0.00019036897,0.00022058823,0.00016990055,0.00032068635,0.00017027458,0.000079246616],"category_scores_gemma":[0.0011274139,0.00015575596,0.000059042235,0.00025777353,0.00035824452,0.00007762523,0.00012069796,0.000881971,0.00002268966],"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.00010604638,0.00016640198,0.00064301386,0.0004811413,0.00008516311,0.00016251848,0.0005976421,0.053210557,0.00043638432,0.01695271,0.0036438834,0.92351454],"study_design_scores_gemma":[0.0009867597,0.00015966229,0.00066643173,0.00008240802,0.000020212867,0.000038147926,0.00012871875,0.93418264,0.00020026357,0.0048096613,0.058473866,0.0002512421],"about_ca_topic_score_codex":0.00033877383,"about_ca_topic_score_gemma":0.0006050514,"teacher_disagreement_score":0.9458035,"about_ca_system_score_codex":0.00015868456,"about_ca_system_score_gemma":0.0001096768,"threshold_uncertainty_score":0.63515437},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019882133,0.00014396294,0.9430053,0.0013743527,0.00039695905,0.00073022157,0.00006799343,0.00008120343,0.03431783],"genre_scores_gemma":[0.9359024,0.0062951604,0.04187441,0.00028308452,0.00034331332,0.000044465996,0.000052822747,0.000046262663,0.015158074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9915973,0.0010701163,0.00093415304,0.0008898589,0.004577581,0.00093101105],"domain_scores_gemma":[0.9926202,0.002564581,0.00039861744,0.0013553947,0.0025627776,0.00049838296],"candidate_categories":["metaresearch","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.016279137,0.00025904944,0.00033873366,0.0011099876,0.0014255977,0.00089597586,0.0015825817,0.00022604504,0.00051036564],"category_scores_gemma":[0.024602149,0.00016839054,0.00013398539,0.004124961,0.0003901043,0.00048367702,0.0007255279,0.0008601942,0.0011697089],"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.00020689589,0.000055965116,0.0064797252,0.0000012541014,0.000009455988,0.0000649375,0.00021625399,0.9303446,0.00006352501,0.0048991116,0.032875206,0.024783079],"study_design_scores_gemma":[0.0002894661,0.00015369536,0.001599256,0.000015298654,0.000015800044,0.000017902305,0.0003574567,0.9124043,0.000090372676,0.06904472,0.01580205,0.00020968803],"about_ca_topic_score_codex":0.0005330469,"about_ca_topic_score_gemma":0.000118141455,"teacher_disagreement_score":0.9160203,"about_ca_system_score_codex":0.0002495529,"about_ca_system_score_gemma":0.00043870564,"threshold_uncertainty_score":0.9998744},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002506123,0.00034990438,0.98248625,0.00169966,0.00024558397,0.0012378941,0.0000076447095,0.00026677916,0.011200185],"genre_scores_gemma":[0.64945024,0.00008383248,0.3493554,0.00007889313,0.00031164414,0.00037837235,0.00015992572,0.000029908555,0.0001518058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951419,0.0010086194,0.0005040378,0.00068009144,0.0013194465,0.0013458967],"domain_scores_gemma":[0.990519,0.0045388904,0.00015372927,0.002955979,0.0014765871,0.0003558408],"candidate_categories":["sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0072034434,0.00022650695,0.00028643585,0.0003999982,0.0014925897,0.0007801794,0.005339309,0.00033582083,0.000011406982],"category_scores_gemma":[0.0022770206,0.00022853051,0.000109902016,0.0017077754,0.00053933595,0.0004502143,0.00188519,0.002579289,0.00003609853],"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.0002516592,0.00075947505,0.0017512846,0.0001507495,0.00010584084,0.00001370473,0.00095801434,0.14575395,0.008442494,0.712392,0.036578458,0.09284236],"study_design_scores_gemma":[0.00057206384,0.00020778333,0.002006142,0.000034850375,0.000005089447,0.000017706296,0.00008213687,0.9619083,0.00037764286,0.02325206,0.011264266,0.00027196266],"about_ca_topic_score_codex":0.0000853016,"about_ca_topic_score_gemma":0.00006494335,"teacher_disagreement_score":0.81615436,"about_ca_system_score_codex":0.00019630045,"about_ca_system_score_gemma":0.00046339765,"threshold_uncertainty_score":0.99980736},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3257389,0.0054416135,0.01785208,0.0015897781,0.0009382487,0.0017635865,0.000033877746,0.0005681006,0.6460738],"genre_scores_gemma":[0.9948831,0.000094673436,0.00024972315,0.00010863242,0.0005106693,0.000027466698,0.000021746946,0.00006058135,0.0040433872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964052,0.00020611567,0.0007560995,0.0005404124,0.0011546643,0.0009375265],"domain_scores_gemma":[0.997639,0.000750241,0.00035082147,0.00059686665,0.0006179389,0.00004512934],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003787827,0.00026030932,0.0005095488,0.0012443844,0.0002812794,0.00030147328,0.00070365076,0.00014448077,0.0004683917],"category_scores_gemma":[0.0045413957,0.0002644218,0.00012312185,0.0019913192,0.00046075205,0.0006474614,0.0005608131,0.0006830182,0.00028560904],"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.00032557713,0.0012126155,0.020949297,0.0042437576,0.00026509655,0.0007882124,0.0004547691,0.16549674,0.010269851,0.7753589,0.0066006426,0.014034528],"study_design_scores_gemma":[0.0010390022,0.000059655064,0.00015074201,0.00059686106,0.000064429136,0.0000028121867,0.0018447193,0.9279971,0.00029137084,0.048364274,0.019084442,0.00050456886],"about_ca_topic_score_codex":0.0009569375,"about_ca_topic_score_gemma":0.00018282741,"teacher_disagreement_score":0.7625004,"about_ca_system_score_codex":0.00021377823,"about_ca_system_score_gemma":0.000022918626,"threshold_uncertainty_score":0.9999808},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10567838,0.0009937115,0.052733455,0.05865878,0.0035319445,0.0037044953,0.000021902288,0.00094370614,0.7737336],"genre_scores_gemma":[0.99534285,0.00016641544,0.00026993273,0.00041854332,0.0006826636,0.00007151976,0.000024451618,0.00002163334,0.003002008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973977,0.000031984317,0.00032030436,0.00033375752,0.0011837116,0.00073250575],"domain_scores_gemma":[0.9987384,0.000117661875,0.000042183132,0.00046290716,0.00060624053,0.000032629017],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0028071199,0.00014829932,0.00012039704,0.00019817415,0.0011119966,0.0006708617,0.0006754929,0.000059603237,0.00011327226],"category_scores_gemma":[0.0018914232,0.00011010752,0.00006565534,0.00083532574,0.0003582759,0.0003500272,0.00058759854,0.0004395711,0.002499535],"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.00006109945,0.00013408346,0.0004886805,0.00019270208,0.000031764044,0.0000196251,0.000053710097,0.011429945,0.00015006319,0.95587623,0.019371064,0.01219106],"study_design_scores_gemma":[0.0007327992,0.000046579342,0.0035829933,0.000047857644,0.000017865412,9.169134e-7,0.0006323314,0.006630292,0.000084097446,0.19289674,0.7950436,0.00028396773],"about_ca_topic_score_codex":0.0044135624,"about_ca_topic_score_gemma":0.002349277,"teacher_disagreement_score":0.8896645,"about_ca_system_score_codex":0.00017045013,"about_ca_system_score_gemma":0.000090878486,"threshold_uncertainty_score":0.9982771},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.807795,0.00030686596,0.0754366,0.000040832812,0.0000842773,0.0009954235,0.000005095506,0.00022813595,0.115107775],"genre_scores_gemma":[0.9947621,0.00036908488,0.0034417831,0.000011568638,0.00001757723,0.00006593838,0.0000055118385,0.000024066434,0.0013023394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878097,0.000057873498,0.00017905205,0.00021489663,0.00032812977,0.0004390817],"domain_scores_gemma":[0.99963236,0.000018949371,0.00001089601,0.00020387702,0.000059943482,0.00007399652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065075094,0.0001234099,0.00012831109,0.00024432788,0.000075370364,0.00008679875,0.00020544644,0.00006904065,0.000020108111],"category_scores_gemma":[0.00003814238,0.00010530328,0.000017735681,0.00017898432,0.00016414665,0.00013638445,0.0002625878,0.00027957157,0.00002743247],"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.00054378575,0.0007187309,0.021973668,0.0024039324,0.00025388924,0.00039916768,0.010680635,0.88886136,0.0011863649,0.047897983,0.0021082796,0.02297223],"study_design_scores_gemma":[0.0003969663,0.00006199612,0.0044676038,0.00003718848,0.000010327722,6.2806765e-7,0.00014689477,0.98788303,0.0008064942,0.005530642,0.00049944175,0.0001587599],"about_ca_topic_score_codex":0.00019710347,"about_ca_topic_score_gemma":0.00010216048,"teacher_disagreement_score":0.18696713,"about_ca_system_score_codex":0.000114966395,"about_ca_system_score_gemma":0.0000062351737,"threshold_uncertainty_score":0.42941433},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15702014,0.000053324162,0.8380352,0.00057401106,0.000027199412,0.0009626218,0.00013873304,0.000072890456,0.0031158729],"genre_scores_gemma":[0.9961085,0.000018838475,0.0036691898,0.000011574809,0.00001669912,0.00011308036,0.000013512467,0.000008873839,0.000039780472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986059,0.00014343503,0.00030310915,0.00021871315,0.0005301062,0.0001987397],"domain_scores_gemma":[0.9929304,0.006171747,0.000058379293,0.00038923882,0.00038119583,0.0000689967],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0015022282,0.000082300125,0.00015177288,0.000091733375,0.00015690488,0.00001179791,0.00015310191,0.000087258835,0.000018922707],"category_scores_gemma":[0.013699389,0.000058887334,0.000022727703,0.00038915913,0.00030923373,0.000020053467,0.000061908184,0.00039235756,0.00001560124],"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.000020901542,0.00009599111,0.000064067266,0.00017322693,0.0000023266348,0.0000027203891,0.000048673974,0.00086244603,0.0010244726,0.9964161,0.0010875965,0.000201484],"study_design_scores_gemma":[0.0004458536,0.00014017394,0.026876543,0.00024326233,0.000010735972,0.000009025999,0.00022467664,0.5810656,0.002380259,0.38801104,0.00041712742,0.00017571205],"about_ca_topic_score_codex":0.000048789516,"about_ca_topic_score_gemma":0.000004335119,"teacher_disagreement_score":0.8390883,"about_ca_system_score_codex":0.0001237275,"about_ca_system_score_gemma":0.00005199655,"threshold_uncertainty_score":0.99460864},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93860596,0.011995953,0.02207562,0.0001377342,0.00013802215,0.0011054542,0.00020148295,0.00012457682,0.025615165],"genre_scores_gemma":[0.9987805,0.00029260854,0.000510116,0.00000673834,0.0000845304,0.000056735094,0.00001969581,0.000032323842,0.0002167667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997482,0.00044858304,0.00041755935,0.00026192414,0.000861611,0.000528335],"domain_scores_gemma":[0.9971966,0.0020242636,0.000033503515,0.00043354483,0.0002512752,0.000060791095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025418643,0.00018838249,0.00041434474,0.00035497214,0.000107135565,0.000050777297,0.0003216109,0.00013747519,0.000013816464],"category_scores_gemma":[0.0009460381,0.00014375006,0.000082844024,0.00053918676,0.00045534017,0.00007992606,0.000103176106,0.00058821746,0.000016870212],"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.000111245296,0.00018907351,0.013893303,0.0011485716,0.00020945394,0.00013168408,0.002569125,0.83504426,0.009190567,0.11996182,0.01656455,0.0009863578],"study_design_scores_gemma":[0.00069978024,0.00025611912,0.023123505,0.00013469181,0.000047227433,0.0000098165165,0.001437009,0.93930006,0.0015753362,0.03214324,0.0009329,0.000340318],"about_ca_topic_score_codex":0.0046151793,"about_ca_topic_score_gemma":0.0032667653,"teacher_disagreement_score":0.10425581,"about_ca_system_score_codex":0.00012591173,"about_ca_system_score_gemma":0.000041021347,"threshold_uncertainty_score":0.6976801},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011568339,0.00003454818,0.9592267,0.00076643087,0.000067023415,0.00037677845,0.00026637185,0.00018031074,0.027513446],"genre_scores_gemma":[0.9673593,0.00008215586,0.030740313,0.00006061848,0.00013598026,0.00009405701,0.00010271102,0.00002673253,0.001398109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972196,0.00018582775,0.00044637776,0.00035616968,0.001171124,0.00062088127],"domain_scores_gemma":[0.99610394,0.002023462,0.00005312476,0.0005124974,0.0009974766,0.00030952468],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001157374,0.00015243028,0.00022920406,0.00013631795,0.000809801,0.000053582567,0.0003787032,0.00014702263,0.00074245094],"category_scores_gemma":[0.010314737,0.00013881999,0.000074813855,0.0005626488,0.00055621867,0.00006740254,0.00013325995,0.0006776969,0.0009274171],"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.000021617783,0.00020260198,0.000038970327,0.0000393954,0.000011789784,0.00002838151,0.00010596783,0.0004824526,0.00021692883,0.9756805,0.02228207,0.0008893816],"study_design_scores_gemma":[0.00029915138,0.00004620005,0.00018270893,0.00001815204,0.000008925942,0.000022701244,0.000085163316,0.35653353,0.00019679466,0.64038616,0.0020754314,0.00014508195],"about_ca_topic_score_codex":0.000059576723,"about_ca_topic_score_gemma":0.000009666528,"teacher_disagreement_score":0.955791,"about_ca_system_score_codex":0.00018090366,"about_ca_system_score_gemma":0.00024610525,"threshold_uncertainty_score":0.99985045},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009149398,0.0005667649,0.9779697,0.00096513634,0.003960527,0.0014427239,0.00012533915,0.0007662685,0.00505416],"genre_scores_gemma":[0.89812505,0.00026140647,0.09282198,0.000017586624,0.0062191114,0.00030843826,0.00012462176,0.00010980425,0.0020119927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983625,0.00005087387,0.00024111597,0.0002642578,0.00051148253,0.0005698097],"domain_scores_gemma":[0.99877506,0.0001470563,0.000023100276,0.0002923888,0.00060083286,0.00016156337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010492472,0.00013260424,0.00016414443,0.00029761528,0.00022185664,0.0001672505,0.00021256761,0.00015492448,0.000009135386],"category_scores_gemma":[0.003931727,0.00013176753,0.00004668144,0.0006063096,0.000117402466,0.00008542278,0.000039782975,0.00035842526,0.0000859359],"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.000033386492,0.00003496645,0.000005425059,0.0001425394,0.000020236306,0.000004159892,0.000116807416,0.9848166,0.0008491607,0.011461469,0.0016724874,0.0008427243],"study_design_scores_gemma":[0.001802517,0.000351498,0.000051948286,0.00015510047,0.000019367639,0.00003244683,0.00048057712,0.97347665,0.0076351203,0.0062764147,0.00927162,0.00044673763],"about_ca_topic_score_codex":0.00026390795,"about_ca_topic_score_gemma":0.000023318536,"teacher_disagreement_score":0.8889757,"about_ca_system_score_codex":0.0004743357,"about_ca_system_score_gemma":0.00026603637,"threshold_uncertainty_score":0.5373324},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47086516,0.0002110238,0.003440332,0.01244952,0.00032727432,0.002968087,0.000020674546,0.00007838925,0.50963956],"genre_scores_gemma":[0.9971733,0.00004078241,0.000038192156,0.0013244457,0.0005117873,0.00013203005,0.000010836838,0.000022321829,0.0007463183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969021,0.00040166927,0.000319508,0.0003024309,0.001461805,0.0006124933],"domain_scores_gemma":[0.9966403,0.002311373,0.00010595645,0.00063983654,0.000285083,0.00001741896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0101586925,0.00017912505,0.00020950504,0.00043307364,0.00026692098,0.00026178453,0.0011393845,0.00007608511,0.00012636122],"category_scores_gemma":[0.0036446461,0.000102794394,0.00008949899,0.00081455003,0.00034324668,0.00022282074,0.0004655756,0.00064045476,0.00020441145],"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.00031496116,0.0003839043,0.0009382073,0.00026262648,0.000025480804,0.000014963511,0.00026624347,0.022459153,0.0004482735,0.9602727,0.013687857,0.00092560455],"study_design_scores_gemma":[0.0029629108,0.0003315814,0.026956642,0.00057166384,0.000073600684,0.000002850672,0.0054608006,0.4477957,0.0018329257,0.44611216,0.06717397,0.00072520436],"about_ca_topic_score_codex":0.001034008,"about_ca_topic_score_gemma":0.00036756234,"teacher_disagreement_score":0.5263081,"about_ca_system_score_codex":0.00017901533,"about_ca_system_score_gemma":0.000058704998,"threshold_uncertainty_score":0.4363245},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7621235,0.0008589741,0.0024126454,0.00037151872,0.0021358677,0.0039445595,0.000024083007,0.00038476594,0.22774407],"genre_scores_gemma":[0.99748623,0.000050577684,0.0002475453,0.00008241105,0.00067810673,0.00018602733,0.00009449093,0.000046778732,0.0011278423],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99563295,0.0002946438,0.0009004188,0.00078940514,0.0015210361,0.00086154527],"domain_scores_gemma":[0.99758595,0.00006225827,0.0003663111,0.0009949192,0.0009105506,0.00008000625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0072347643,0.00028820336,0.0006020289,0.0037305828,0.00020128845,0.00021464394,0.00079343456,0.000118609074,0.00045340363],"category_scores_gemma":[0.0011340658,0.00027367848,0.00019205736,0.0037735826,0.00045885966,0.0008098126,0.0004240135,0.00058490515,0.00015700796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007444617,0.0051575215,0.5283963,0.0041531716,0.0018754003,0.0003219881,0.0027418605,0.021410871,0.0053178994,0.40528822,0.020403279,0.0041890275],"study_design_scores_gemma":[0.0042555113,0.00082330033,0.155664,0.0012276954,0.002126493,0.0000047977446,0.017421246,0.71764237,0.001749961,0.044818416,0.051701814,0.0025644149],"about_ca_topic_score_codex":0.018782262,"about_ca_topic_score_gemma":0.0022129214,"teacher_disagreement_score":0.6962315,"about_ca_system_score_codex":0.00038547502,"about_ca_system_score_gemma":0.00012555976,"threshold_uncertainty_score":0.99997157},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53658974,0.0008701264,0.15262389,0.002980113,0.00097117334,0.0029223422,0.00004231193,0.00042852142,0.30257177],"genre_scores_gemma":[0.99760574,0.000014761322,0.00074268423,0.0001039188,0.00042542818,0.000077465105,0.0000700172,0.00004217005,0.00091783237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99764866,0.000053349635,0.0003994809,0.00041303,0.00059498264,0.0008905068],"domain_scores_gemma":[0.9983587,0.0007894262,0.00008845478,0.00032297097,0.0004190589,0.000021390688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002476035,0.00019782988,0.00025331118,0.0007467199,0.00035861452,0.0007466989,0.00044277386,0.00012564578,0.000107976186],"category_scores_gemma":[0.0008730269,0.00019416308,0.00007921185,0.00097106,0.00019283028,0.00052665395,0.00027090398,0.00054654723,0.00006399284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008351232,0.00094121415,0.32534215,0.0022068203,0.00004631873,0.00033829882,0.00019990427,0.0035418195,0.010828482,0.4629472,0.017293174,0.17547952],"study_design_scores_gemma":[0.0030023823,0.000107680695,0.38818437,0.00038043287,0.00010627744,0.0000064258315,0.0026923944,0.23169039,0.00008592642,0.29184675,0.0807102,0.0011867627],"about_ca_topic_score_codex":0.008849829,"about_ca_topic_score_gemma":0.008492798,"teacher_disagreement_score":0.46101597,"about_ca_system_score_codex":0.00013719867,"about_ca_system_score_gemma":0.00013901509,"threshold_uncertainty_score":0.99775034},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86791027,0.00037901886,0.11545549,0.0001039166,0.00023341723,0.00061583996,0.00008915844,0.00026815955,0.014944727],"genre_scores_gemma":[0.9743079,0.00003278836,0.025106156,0.0000049681344,0.00019199557,0.000016342936,0.00015625365,0.000042780583,0.00014079174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768555,0.00014155779,0.00037098976,0.00018728495,0.00087895023,0.00073564326],"domain_scores_gemma":[0.9987827,0.00040402045,0.000053604563,0.00019835771,0.00038120107,0.00018011888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011076097,0.00017019873,0.00027497887,0.00044244755,0.00014137599,0.00004849117,0.00023005043,0.00017528744,0.00014977634],"category_scores_gemma":[0.0008570549,0.00015533449,0.00003719431,0.001402196,0.00024669684,0.00013418788,0.0000877,0.00070730376,0.00012314177],"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.0015670425,0.0017303613,0.01446863,0.000644129,0.0002427612,0.00011368018,0.0033553678,0.886785,0.044104498,0.033823814,0.0006499623,0.012514786],"study_design_scores_gemma":[0.0010320646,0.00017213545,0.0040793642,0.000057500183,0.000010187835,0.000010816265,0.00012540125,0.9924668,0.0016087148,0.0001594751,0.00008251906,0.00019502956],"about_ca_topic_score_codex":0.00014557235,"about_ca_topic_score_gemma":0.000011194621,"teacher_disagreement_score":0.10639766,"about_ca_system_score_codex":0.0002541573,"about_ca_system_score_gemma":0.0001291971,"threshold_uncertainty_score":0.63343567},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037871678,0.00059585803,0.9852685,0.0031439036,0.0001699378,0.0014776017,0.0001934518,0.000208556,0.0051550344],"genre_scores_gemma":[0.6991305,0.00024701693,0.29925132,0.00007895478,0.0003493357,0.00021985637,0.000041676492,0.00006865998,0.0006127286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980602,0.00011809828,0.00028190363,0.00024115879,0.00078664045,0.0005119991],"domain_scores_gemma":[0.9950193,0.003688088,0.00004071343,0.00056778337,0.00057138025,0.00011272492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021977848,0.0001706155,0.00018217161,0.00009294562,0.00030432496,0.000106172905,0.0005452765,0.00009743235,0.000079529476],"category_scores_gemma":[0.0021578255,0.00009213372,0.00006150922,0.0004409533,0.00038959872,0.00005856093,0.0000670848,0.00060808595,0.000038568647],"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.00009376884,0.00006984653,0.000021663283,0.0000613797,0.00006971913,0.0000023334603,0.0001364941,0.97397625,0.000037527396,0.009592044,0.0022446085,0.013694365],"study_design_scores_gemma":[0.00043208635,0.00024810105,0.00005223842,0.000054055028,0.000023000372,0.0000029086862,0.00017129176,0.9945313,0.0017826268,0.0012497964,0.0013277207,0.00012492794],"about_ca_topic_score_codex":0.00002695583,"about_ca_topic_score_gemma":0.000020078938,"teacher_disagreement_score":0.6953433,"about_ca_system_score_codex":0.00010613543,"about_ca_system_score_gemma":0.000115487215,"threshold_uncertainty_score":0.3757104},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049406025,0.000073751886,0.8943784,0.003736061,0.00014472519,0.00055224856,0.000029669745,0.00012770001,0.096016824],"genre_scores_gemma":[0.98235965,0.000028585648,0.0060116695,0.00021333093,0.00037016955,0.00005486854,0.000009701954,0.000011055324,0.010940969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942495,0.00044810362,0.000615054,0.000667963,0.0033825669,0.0006368018],"domain_scores_gemma":[0.9963434,0.0007884599,0.00014214544,0.0008336756,0.0015986541,0.00029367162],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.010052942,0.00014812725,0.00021431084,0.0004595604,0.0009918526,0.00043252614,0.0010725656,0.00013495827,0.0004087954],"category_scores_gemma":[0.010727922,0.00011878649,0.000107483385,0.0015265063,0.00048085986,0.00024815364,0.00020728362,0.00070279394,0.001407388],"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.00009433765,0.00018963664,0.000041217,0.0000020939449,0.000009611906,0.000008236128,0.0003334513,0.03491284,0.00365488,0.9092417,0.027834833,0.023677202],"study_design_scores_gemma":[0.00021709151,0.00016183069,0.00013947698,0.000007646568,0.000005501317,0.000008043628,0.00035524947,0.12417511,0.0019848142,0.85891205,0.01390837,0.0001248281],"about_ca_topic_score_codex":0.000014160852,"about_ca_topic_score_gemma":0.000008087667,"teacher_disagreement_score":0.977419,"about_ca_system_score_codex":0.00019717091,"about_ca_system_score_gemma":0.00042288908,"threshold_uncertainty_score":0.99937016},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7501731,0.00089221634,0.0015082823,0.00863001,0.0006023811,0.0020996984,0.00009741292,0.00034117527,0.23565574],"genre_scores_gemma":[0.99349517,0.0000495556,0.00032516252,0.0019153428,0.00054698205,0.000086925436,0.00009421185,0.000039685026,0.0034469427],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965039,0.00009505658,0.00044992272,0.0005653,0.0015113867,0.000874437],"domain_scores_gemma":[0.9970652,0.00018518016,0.00018228288,0.00069554674,0.001800411,0.00007140693],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0019490102,0.0002829058,0.0003620111,0.00047426732,0.00035949485,0.00037193726,0.0008653961,0.00012860828,0.002804059],"category_scores_gemma":[0.0006793026,0.00024375653,0.000072515126,0.0019193213,0.00032294344,0.00068963197,0.0007167149,0.00054586015,0.0015214559],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002929317,0.0066287387,0.18152763,0.023849871,0.0011915556,0.0007638395,0.0045996425,0.041288458,0.0052659567,0.10245274,0.61681503,0.01268724],"study_design_scores_gemma":[0.0026942783,0.0003245773,0.005345428,0.00032453684,0.0001069091,0.0000047748235,0.0057107965,0.40815943,0.0005300162,0.002110717,0.5737691,0.00091942167],"about_ca_topic_score_codex":0.0057085343,"about_ca_topic_score_gemma":0.0010590522,"teacher_disagreement_score":0.36687097,"about_ca_system_score_codex":0.00013421908,"about_ca_system_score_gemma":0.000057759582,"threshold_uncertainty_score":0.99925596},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38858256,0.001837922,0.010741288,0.004157889,0.0014148514,0.002336997,0.00003219476,0.0005175281,0.59037876],"genre_scores_gemma":[0.9923791,0.000030485724,0.00010016937,0.00087810657,0.0025208655,0.00007262441,0.000048141417,0.000046081357,0.0039244005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99677896,0.00008280712,0.00040713281,0.0005462538,0.001202669,0.0009821865],"domain_scores_gemma":[0.9987115,0.0002491065,0.00014646421,0.00039794054,0.00044441226,0.000050534338],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0029487093,0.00025478224,0.0002837409,0.0005739704,0.00074189075,0.0010490374,0.0004614863,0.00011376785,0.00033786695],"category_scores_gemma":[0.0012892918,0.00023267057,0.00008048265,0.0006511889,0.00064496166,0.0006035233,0.000522469,0.000525376,0.0004608031],"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.0002338998,0.0005628055,0.16190322,0.0012286761,0.000103881575,0.0002871829,0.00016873534,0.00046503733,0.0021019673,0.6841135,0.1449684,0.0038626853],"study_design_scores_gemma":[0.002978003,0.00010635197,0.039778825,0.00016317469,0.00009869833,0.0000050518947,0.0020926218,0.06015782,0.000042029747,0.052155044,0.8415841,0.00083830574],"about_ca_topic_score_codex":0.0025183116,"about_ca_topic_score_gemma":0.00033752996,"teacher_disagreement_score":0.6966157,"about_ca_system_score_codex":0.0001688413,"about_ca_system_score_gemma":0.00006847631,"threshold_uncertainty_score":0.99998796},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042536184,0.0007310379,0.8260594,0.0016306863,0.00019154049,0.0009990816,0.00005697276,0.00027102281,0.12752406],"genre_scores_gemma":[0.97816426,0.0014218768,0.018766342,0.000027998998,0.000091857386,0.000045392913,0.000017193095,0.000028471388,0.0014366282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840635,0.00006168297,0.00024057386,0.00022722228,0.0004968478,0.0005673222],"domain_scores_gemma":[0.9993359,0.00014705975,0.000010462159,0.00032781975,0.000055939763,0.00012284998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010524105,0.00011488202,0.00013427023,0.0001648501,0.000059970516,0.000040746327,0.00022875193,0.00013502451,0.00012093181],"category_scores_gemma":[0.0005022382,0.00011447207,0.000032631007,0.00018769532,0.00015135323,0.00010789194,0.00008886297,0.0005610459,0.00024031448],"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.000019506722,0.000055140124,0.00014238645,0.000034452263,0.000003965968,0.0000069760813,0.000105211504,0.9832857,0.00059586845,0.0034932855,0.0024169923,0.009840484],"study_design_scores_gemma":[0.00023741432,0.00003563857,0.00034642234,0.000018365892,0.0000017641124,9.690064e-7,0.000033929133,0.98543954,0.0004549217,0.0048646014,0.008446929,0.00011948404],"about_ca_topic_score_codex":0.00003524595,"about_ca_topic_score_gemma":0.00009099217,"teacher_disagreement_score":0.93562806,"about_ca_system_score_codex":0.0006274702,"about_ca_system_score_gemma":0.000046917638,"threshold_uncertainty_score":0.46680355},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010354535,0.0013073031,0.084543705,0.032568216,0.0035951894,0.0040653534,0.0000044207864,0.00070011313,0.86286116],"genre_scores_gemma":[0.98519415,0.00045086464,0.0000685454,0.0004917862,0.0008258895,0.00013941692,0.000022812423,0.000020690726,0.012785834],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976323,0.00008183748,0.00032712365,0.0003501256,0.0010083003,0.00060026534],"domain_scores_gemma":[0.99830866,0.00022949508,0.000059545284,0.00044927187,0.0009239805,0.000029058318],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0023048643,0.00014726698,0.00010858644,0.00026569495,0.0014528803,0.0005651927,0.00043427997,0.000091324386,0.00033855604],"category_scores_gemma":[0.002001488,0.00011233375,0.00004795111,0.0017049913,0.00021534324,0.0002448756,0.00020266105,0.00046668068,0.002407665],"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.00014842005,0.00040435418,0.0011004679,0.00020546002,0.000048426624,0.000009451486,0.000061124505,0.1031032,0.000022699895,0.3107813,0.50782293,0.07629218],"study_design_scores_gemma":[0.00027849825,0.00005716045,0.0031214799,0.00003165466,0.000012162108,3.5520264e-7,0.00015771469,0.6726011,0.000008115183,0.006315015,0.3172596,0.00015713996],"about_ca_topic_score_codex":0.001334873,"about_ca_topic_score_gemma":0.0018358661,"teacher_disagreement_score":0.9748396,"about_ca_system_score_codex":0.00018091055,"about_ca_system_score_gemma":0.000021818032,"threshold_uncertainty_score":0.9998471},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39503658,0.00023312982,0.56758326,0.00031277406,0.0012985547,0.0010587205,0.00005722614,0.00075288303,0.033666857],"genre_scores_gemma":[0.9941512,0.000111551235,0.004880042,0.000024466877,0.00023000594,0.000041035502,0.000023353703,0.00004313469,0.0004952211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973773,0.00013200635,0.00038877904,0.0003596699,0.0009825598,0.00075970625],"domain_scores_gemma":[0.9981568,0.00040772549,0.000019772147,0.00048869225,0.0004537269,0.0004733123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012400385,0.00016418131,0.00026330582,0.00022790511,0.0003044608,0.00009027982,0.00032608953,0.00015405251,0.000031001713],"category_scores_gemma":[0.0037552726,0.00016108772,0.000065028864,0.00048221977,0.000240817,0.00012504747,0.00017830545,0.00059275114,0.0006609752],"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.0004387439,0.0003106436,0.0021933084,0.0013629046,0.00013192586,0.0010908243,0.0011849283,0.90032744,0.018168405,0.031789936,0.041189913,0.0018110229],"study_design_scores_gemma":[0.0009999776,0.00039581518,0.006879481,0.00043209692,0.000021200744,0.00016804838,0.00061667664,0.97663313,0.0034085119,0.0006719105,0.009124182,0.0006489448],"about_ca_topic_score_codex":0.00012892415,"about_ca_topic_score_gemma":0.000012456444,"teacher_disagreement_score":0.5991146,"about_ca_system_score_codex":0.0005055858,"about_ca_system_score_gemma":0.00009385221,"threshold_uncertainty_score":0.8495719},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041807167,0.0010071299,0.6443508,0.02418169,0.0035830417,0.007940924,0.000121502395,0.00068155385,0.27632615],"genre_scores_gemma":[0.99536926,0.00018257265,0.00033773563,0.00037299484,0.00092514546,0.00013221013,0.00008155675,0.000015559044,0.0025829785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984111,0.000037058897,0.0003238365,0.00022785827,0.0006489493,0.00035117575],"domain_scores_gemma":[0.9978039,0.00044260643,0.000053862605,0.0003713245,0.0013129694,0.00001529653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018545575,0.000102571845,0.000111733396,0.00016637024,0.0006461376,0.0001260488,0.00030275297,0.000052028456,0.0003587678],"category_scores_gemma":[0.0024023303,0.000081139944,0.000046596517,0.0012658531,0.00021927294,0.00014555042,0.000060208386,0.00021062857,0.0004567883],"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.00026631448,0.00023623464,0.00040473003,0.00032520707,0.000040336814,7.17836e-7,0.000057985068,0.3250088,0.000012854373,0.52764106,0.113306984,0.03269877],"study_design_scores_gemma":[0.0005191386,0.00012552805,0.014346574,0.00006322944,0.000054525663,1.4439878e-7,0.00036858532,0.46658495,0.000018213334,0.034127407,0.48362142,0.0001702967],"about_ca_topic_score_codex":0.0016036859,"about_ca_topic_score_gemma":0.00090510066,"teacher_disagreement_score":0.9535621,"about_ca_system_score_codex":0.00007392478,"about_ca_system_score_gemma":0.00007132605,"threshold_uncertainty_score":0.58712417},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072467797,0.0017874418,0.111778,0.00035527334,0.00047186535,0.0016370201,0.000086762986,0.0008918418,0.875745],"genre_scores_gemma":[0.97785544,0.0003729888,0.015946591,0.000020861042,0.0003036313,0.00007999524,0.000020792613,0.000093747076,0.0053059366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720716,0.00012576193,0.0003582608,0.00030743226,0.00093152496,0.0010698403],"domain_scores_gemma":[0.9978136,0.0007717606,0.000040690393,0.0006210863,0.00048377583,0.000269115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022177787,0.00023869124,0.00024360126,0.00012629623,0.0005025265,0.00019608095,0.00061614293,0.00016389854,0.00046681133],"category_scores_gemma":[0.0009177012,0.0001551275,0.000052236042,0.00039510574,0.0007271983,0.00007841037,0.00015721447,0.0011144868,0.00054683705],"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.0021603259,0.0013169673,0.0103344405,0.0021958346,0.0015537988,0.0039346116,0.0053288294,0.13049695,0.00687091,0.5447414,0.09047636,0.20058957],"study_design_scores_gemma":[0.0032803852,0.0029751242,0.006515722,0.00061953405,0.00020258852,0.00023986421,0.0010646248,0.56323934,0.0077450513,0.09299299,0.31841454,0.0027102646],"about_ca_topic_score_codex":0.0002809147,"about_ca_topic_score_gemma":0.00014619042,"teacher_disagreement_score":0.97060865,"about_ca_system_score_codex":0.00011521605,"about_ca_system_score_gemma":0.00015608496,"threshold_uncertainty_score":0.7028667},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15931267,0.0028620677,0.12772979,0.0040121665,0.00071801315,0.001920507,0.00020715555,0.0013188544,0.7019188],"genre_scores_gemma":[0.992743,0.00043396052,0.0022928724,0.000038115104,0.00041919333,0.000034296954,0.000016358981,0.000050564933,0.003971606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976586,0.00020454887,0.0002700542,0.00028430717,0.00079782936,0.00078467175],"domain_scores_gemma":[0.9975332,0.0016017965,0.000029063982,0.00053603254,0.00016429464,0.00013559608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001482273,0.0001873139,0.0002230075,0.0001376458,0.00036171952,0.00020875879,0.00048324847,0.00014323804,0.00032628363],"category_scores_gemma":[0.0017533669,0.00014371618,0.000078654986,0.0004389714,0.0005098242,0.00017903364,0.0001766928,0.0010509349,0.00019996034],"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.00005843913,0.000084806634,0.00089207647,0.00017893054,0.00012802304,0.000033174398,0.0018165783,0.8673706,0.0010803066,0.015614137,0.08506482,0.027678091],"study_design_scores_gemma":[0.000657485,0.00019724059,0.0008025169,0.00010870417,0.000035755544,0.000008639195,0.0018854277,0.8610483,0.0029150518,0.0040670014,0.12782568,0.00044818787],"about_ca_topic_score_codex":0.00008980793,"about_ca_topic_score_gemma":0.000017267137,"teacher_disagreement_score":0.83343035,"about_ca_system_score_codex":0.00023717454,"about_ca_system_score_gemma":0.000028838096,"threshold_uncertainty_score":0.5860576},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026871268,0.00015542151,0.96167696,0.00015741368,0.0001044167,0.0011431065,0.008745878,0.00006267619,0.0010828571],"genre_scores_gemma":[0.97167045,0.000021306381,0.026250195,0.0000063144676,0.00009480242,0.0004083007,0.0014163889,0.000020098616,0.00011215617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997153,0.00024706149,0.0005798667,0.0002719069,0.0011174494,0.0006307488],"domain_scores_gemma":[0.98680156,0.010864656,0.00021144109,0.0004898114,0.0012575564,0.0003749856],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0012280954,0.00017722783,0.0003732202,0.00016849092,0.00032232676,0.000078903395,0.0003638248,0.0001239987,0.00011772333],"category_scores_gemma":[0.011343865,0.00014471247,0.000061873056,0.0006104206,0.0004965168,0.00008356464,0.000128265,0.00033757067,0.00009224023],"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.000087567925,0.00097523286,0.0027424025,0.00015178925,0.00006942879,0.0000010813942,0.000047034297,0.00015126346,0.00043133652,0.9921323,0.0028773511,0.00033321345],"study_design_scores_gemma":[0.0051728026,0.0010753073,0.12817292,0.0006894618,0.0005383718,0.000019265157,0.0011754785,0.20091146,0.0068475483,0.64295655,0.011143817,0.0012970419],"about_ca_topic_score_codex":0.00040580408,"about_ca_topic_score_gemma":0.000010845329,"teacher_disagreement_score":0.9447992,"about_ca_system_score_codex":0.0002317263,"about_ca_system_score_gemma":0.00014163829,"threshold_uncertainty_score":0.996984},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053898953,0.00028408298,0.013217153,0.0022047074,0.00070361217,0.0014383666,0.000029813282,0.00031929,0.9764131],"genre_scores_gemma":[0.9728874,0.0010158666,0.0057089254,0.0010798657,0.0027955421,0.0003321255,0.0002564168,0.00009688469,0.015826978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99653417,0.00005757105,0.00037881706,0.000637008,0.0013896016,0.0010028528],"domain_scores_gemma":[0.9986896,0.00006967496,0.000106315965,0.0007425098,0.0003289191,0.000062976455],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0024335023,0.00025425243,0.0002423077,0.0008363342,0.00068136386,0.0006101229,0.0008966311,0.00012566478,0.00022955136],"category_scores_gemma":[0.00044848712,0.00024844834,0.00012650236,0.0014288648,0.0004065378,0.0005135759,0.00096484256,0.0005898,0.0020911447],"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.00005441467,0.0004178998,0.0003388354,0.0004625563,0.000062312196,0.00015379238,0.000055284483,0.001857783,0.000047576752,0.94592977,0.04808502,0.0025347387],"study_design_scores_gemma":[0.0023800735,0.0000827634,0.004800333,0.00017075948,0.00010922022,0.0000053437134,0.001439686,0.004890061,0.0000302667,0.3153321,0.67010254,0.0006568246],"about_ca_topic_score_codex":0.0018283627,"about_ca_topic_score_gemma":0.0001286361,"teacher_disagreement_score":0.9674975,"about_ca_system_score_codex":0.00033090956,"about_ca_system_score_gemma":0.000054023643,"threshold_uncertainty_score":0.9999968},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.491867,0.0016361013,0.001596643,0.012089745,0.0016030031,0.00381751,0.000024118264,0.0006348889,0.486731],"genre_scores_gemma":[0.99338055,0.00007659881,0.000047518824,0.0011347355,0.0010586989,0.00008100187,0.00003547228,0.000030475001,0.004154971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962,0.00020707064,0.00051604636,0.00047621215,0.0014253308,0.001175339],"domain_scores_gemma":[0.9982456,0.00017999939,0.00012109419,0.0005146787,0.00087533053,0.00006332278],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0039909235,0.0002627089,0.00035766163,0.0011658128,0.0004619415,0.001040511,0.0007003861,0.00016272478,0.00011753267],"category_scores_gemma":[0.0039773663,0.00023360798,0.00007352335,0.0012424344,0.00045236567,0.00068130513,0.00028399786,0.0006635083,0.0005444179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046790787,0.0010834836,0.01657857,0.0014898871,0.0000802935,0.00044605593,0.0007791074,0.0026262498,0.0042389296,0.8026321,0.16477251,0.0048049083],"study_design_scores_gemma":[0.0044207037,0.00062468805,0.056050617,0.001522979,0.000090411784,0.000007166155,0.015846053,0.21332453,0.0009237981,0.038077235,0.66702706,0.0020847765],"about_ca_topic_score_codex":0.0121097565,"about_ca_topic_score_gemma":0.0008162681,"teacher_disagreement_score":0.76455486,"about_ca_system_score_codex":0.0004180742,"about_ca_system_score_gemma":0.00015196657,"threshold_uncertainty_score":0.9999965},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15636478,0.001814902,0.52711505,0.009525862,0.0007093032,0.005612405,0.000057014015,0.00085087435,0.29794982],"genre_scores_gemma":[0.9963299,0.00012765714,0.00074604474,0.00048885954,0.00047031062,0.00016942782,0.000046953846,0.000033932345,0.0015869131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979321,0.00001875658,0.0002503669,0.00043547427,0.0007632018,0.00060010643],"domain_scores_gemma":[0.999106,0.00007782908,0.000071957445,0.0003067413,0.0003915257,0.000045938912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011603809,0.0001642166,0.00015817286,0.0004578375,0.00051323086,0.00041085592,0.00039124794,0.00008633937,0.00006670202],"category_scores_gemma":[0.0005391296,0.00015975199,0.000047834823,0.00062246004,0.00019888142,0.00040481522,0.0006414165,0.00038737102,0.00046996545],"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.000044264434,0.00021079695,0.00014255419,0.00049406476,0.000038285692,0.000033990233,0.00007847343,0.028414218,0.00295146,0.9606363,0.0016030296,0.0053525213],"study_design_scores_gemma":[0.0012200909,0.00003999707,0.00038306907,0.000083012266,0.00005078873,0.0000029046353,0.00035910416,0.70620686,0.000115826384,0.24256267,0.048582006,0.00039367998],"about_ca_topic_score_codex":0.0002909281,"about_ca_topic_score_gemma":0.00014834611,"teacher_disagreement_score":0.8399651,"about_ca_system_score_codex":0.00022514156,"about_ca_system_score_gemma":0.00008888278,"threshold_uncertainty_score":0.6514497},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014263495,0.00019467511,0.85446787,0.0040654624,0.0022406734,0.0016237935,0.000017225544,0.00027143746,0.12285537],"genre_scores_gemma":[0.99303764,0.000031439726,0.0009507161,0.00047938924,0.0014960624,0.00006447938,0.00014354802,0.000027691895,0.0037690117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99731773,0.000030723448,0.00040249623,0.00042507876,0.0010159366,0.0008080193],"domain_scores_gemma":[0.9974144,0.00029860495,0.000057974383,0.00044497976,0.0017428489,0.000041155818],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.008089085,0.0001585891,0.0001720772,0.00043070232,0.00043466533,0.0002471963,0.00048786405,0.00009919602,0.00022521637],"category_scores_gemma":[0.0049398984,0.00015677653,0.00006621053,0.001080986,0.00020535669,0.00034024345,0.0002459837,0.00027041987,0.0012396196],"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.0005455756,0.00044481448,0.0054226234,0.0013668091,0.000058213118,0.000018255838,0.0000647389,0.0034284627,0.0006469744,0.8417351,0.07366044,0.07260796],"study_design_scores_gemma":[0.0009977345,0.000067462635,0.025822137,0.000046608322,0.000029459017,3.7691348e-7,0.00072764856,0.056667008,0.00019632738,0.06386132,0.85114974,0.00043418302],"about_ca_topic_score_codex":0.0017940536,"about_ca_topic_score_gemma":0.0023533637,"teacher_disagreement_score":0.9787742,"about_ca_system_score_codex":0.00014595808,"about_ca_system_score_gemma":0.00006135118,"threshold_uncertainty_score":0.999538},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038286425,0.0016399309,0.59089315,0.046968907,0.0042762747,0.013608097,0.00024060856,0.0014853405,0.30260128],"genre_scores_gemma":[0.98627704,0.00011037231,0.0023382362,0.0011158043,0.0014297081,0.00021996329,0.0003648184,0.00006081147,0.008083225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970105,0.00005882769,0.00045926045,0.0005114281,0.0009873848,0.000972597],"domain_scores_gemma":[0.99820024,0.0003839987,0.00013138898,0.00048235361,0.0007462189,0.00005581699],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0025002267,0.00022783688,0.00025515116,0.00047429628,0.0005434845,0.0004267194,0.0006073761,0.00011592936,0.00058754184],"category_scores_gemma":[0.0028537503,0.00021911073,0.00012498397,0.00060108013,0.00023036875,0.00043943172,0.00033840287,0.00034580505,0.000884543],"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.001395555,0.00094097573,0.0010984847,0.0013208523,0.00016794582,0.000031379328,0.00017330468,0.005436335,0.0008903371,0.6513369,0.23818925,0.099018656],"study_design_scores_gemma":[0.0013928046,0.000053639098,0.0013167489,0.000046000136,0.000040152052,6.126877e-7,0.00019087756,0.30285832,0.000025930909,0.013161211,0.6806587,0.00025499755],"about_ca_topic_score_codex":0.00030269384,"about_ca_topic_score_gemma":0.00038408083,"teacher_disagreement_score":0.94799066,"about_ca_system_score_codex":0.00045036428,"about_ca_system_score_gemma":0.0000827815,"threshold_uncertainty_score":0.99989337},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025458407,0.000088564986,0.96984977,0.00004804341,0.00020233002,0.00069646083,0.000095363226,0.00003388623,0.0035271673],"genre_scores_gemma":[0.58940214,0.000081369544,0.41000375,0.0000070093174,0.0001429284,0.000099331395,0.000004533191,0.000022569404,0.0002363864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973901,0.0002825175,0.00043796404,0.00024268955,0.0008256727,0.0008210413],"domain_scores_gemma":[0.9877886,0.01066423,0.0001533657,0.00038135474,0.000773958,0.0002384624],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.00476996,0.00014915466,0.0003168569,0.0001390258,0.0002480164,0.000024676145,0.00024183244,0.00012519509,0.000039462575],"category_scores_gemma":[0.021524899,0.00012702374,0.0000787735,0.00023449807,0.00029066377,0.00018171185,0.00014091644,0.00049040554,0.000005917489],"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.00018680547,0.00044579883,0.00073232816,0.0009184076,0.000044227807,0.0000017714609,0.00019169222,0.00018129103,0.01487437,0.65229917,0.0005542085,0.32956994],"study_design_scores_gemma":[0.00085339876,0.0011586038,0.002915285,0.000118542135,0.000057543817,0.000007301202,0.0002770967,0.09875982,0.03079267,0.8589484,0.0057938686,0.00031746135],"about_ca_topic_score_codex":0.00002296975,"about_ca_topic_score_gemma":0.000012208823,"teacher_disagreement_score":0.5639437,"about_ca_system_score_codex":0.00021807943,"about_ca_system_score_gemma":0.00016634073,"threshold_uncertainty_score":0.9867172},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036732446,0.0002166791,0.9365272,0.0004432731,0.0003521782,0.0008343695,0.00009870212,0.0011074608,0.02368767],"genre_scores_gemma":[0.9677112,0.00048728264,0.031005418,0.000041952844,0.00014082961,0.00005864537,0.000073637144,0.000056427907,0.00042458266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742997,0.000102198406,0.00032214908,0.00040319146,0.00092552596,0.00081699435],"domain_scores_gemma":[0.99840665,0.00014387985,0.000020881926,0.0006511136,0.00047039276,0.0003070681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015576059,0.00020263149,0.00022582088,0.00018447483,0.00021415354,0.00013298668,0.0004228387,0.00024296825,0.000042060892],"category_scores_gemma":[0.001413056,0.00019250248,0.00008566926,0.00036184478,0.00031313914,0.00026653422,0.00010840108,0.000882124,0.00014657415],"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.00003865657,0.000113272385,0.000020740017,0.00008271812,0.00001959532,0.000074580144,0.00023560686,0.9665643,0.0025242185,0.02768021,0.0016042273,0.0010418657],"study_design_scores_gemma":[0.0007317447,0.00021680171,0.000076945034,0.000059856455,0.000010814251,0.0000080777345,0.00028153238,0.95360595,0.0020986348,0.041193746,0.0014288228,0.00028710175],"about_ca_topic_score_codex":0.00032050823,"about_ca_topic_score_gemma":0.0006546881,"teacher_disagreement_score":0.9309788,"about_ca_system_score_codex":0.0010428498,"about_ca_system_score_gemma":0.00019585897,"threshold_uncertainty_score":0.78500235},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013577415,0.015370276,0.9749825,0.00066110975,0.0010418887,0.0014234436,0.000094448296,0.0003749847,0.004693606],"genre_scores_gemma":[0.21403019,0.007998267,0.76884604,0.00028547365,0.0018990913,0.0016905906,0.0007614438,0.00028889018,0.004199994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761605,0.00013301003,0.00039017215,0.0003102007,0.00092069426,0.00062988984],"domain_scores_gemma":[0.9967021,0.00040629753,0.000033878685,0.00040046524,0.0019949598,0.00046234843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028478,0.0001921532,0.0003085724,0.00022162171,0.00016084236,0.00023949974,0.00039494399,0.00015565612,0.000023410621],"category_scores_gemma":[0.0052564465,0.00018351861,0.00005516279,0.0005966011,0.00008428256,0.00009668962,0.00008053158,0.0003765986,0.0004856692],"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.000029567997,0.000046975623,0.000021145175,0.0011190197,0.00004411484,0.0000072757607,0.0001734611,0.9573116,0.00009093413,0.0038351053,0.032719973,0.0046008546],"study_design_scores_gemma":[0.00045209916,0.00019924676,0.000017232709,0.00044853595,0.000024105739,0.000010844023,0.0002912094,0.9583502,0.00016598226,0.00013316442,0.039640646,0.00026676187],"about_ca_topic_score_codex":0.000062152896,"about_ca_topic_score_gemma":0.0000066624343,"teacher_disagreement_score":0.21267246,"about_ca_system_score_codex":0.0002950898,"about_ca_system_score_gemma":0.0003020895,"threshold_uncertainty_score":0.7483672},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002426062,0.000112693684,0.9667335,0.00012028326,0.000398613,0.00019065556,0.000013009739,0.0004396876,0.029565481],"genre_scores_gemma":[0.95382607,0.00018845736,0.044631664,0.000047408295,0.00054058345,0.000023621888,0.00004108237,0.00006573179,0.0006353965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793166,0.000113484544,0.0002634043,0.00032456304,0.0006631026,0.0007038055],"domain_scores_gemma":[0.9980812,0.00096451,0.000027046459,0.00047001257,0.00024840672,0.00020882745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011094369,0.00020351245,0.00021756259,0.00026761487,0.00021349013,0.00009897233,0.0003172962,0.00017722163,0.00004228415],"category_scores_gemma":[0.0044573117,0.00019533763,0.00004755687,0.0002982331,0.00017376756,0.000062847655,0.00009278124,0.0009728819,0.0003474045],"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.000028348113,0.000036404406,0.000013078941,0.00006433488,0.000012240423,0.000011239956,0.000033492095,0.9647734,0.00037843984,0.022334512,0.00056283333,0.011751635],"study_design_scores_gemma":[0.0004007374,0.00032124203,0.000094836716,0.000068777896,0.000006958322,0.0000025590643,0.00002287989,0.9610836,0.006999498,0.022487024,0.008251826,0.00026004354],"about_ca_topic_score_codex":0.000021630747,"about_ca_topic_score_gemma":0.000011780273,"teacher_disagreement_score":0.9514,"about_ca_system_score_codex":0.00018635085,"about_ca_system_score_gemma":0.00003348296,"threshold_uncertainty_score":0.7965638},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004058742,0.002636945,0.93866694,0.0011130613,0.00081198436,0.0010578621,0.000033719574,0.0009456068,0.050675154],"genre_scores_gemma":[0.9924729,0.0003773669,0.0045447466,0.000016996551,0.0004753146,0.00006396544,0.000015219872,0.000074835894,0.0019586515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740046,0.00012381533,0.0003575766,0.00026089817,0.00093833864,0.00091892417],"domain_scores_gemma":[0.9974956,0.0013553564,0.00003547779,0.00050018844,0.0004385672,0.00017484774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015358592,0.00018913993,0.00018774744,0.00015025637,0.0005153357,0.00020019594,0.000482112,0.00013683696,0.0000718863],"category_scores_gemma":[0.0031293968,0.00014792339,0.000047441084,0.00064044725,0.00020709414,0.00009315777,0.00014540627,0.0008913728,0.00050923147],"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.000013551941,0.000041342348,0.000081540085,0.00008150301,0.000035343637,0.00002355719,0.00020553508,0.9581745,0.0012901084,0.005628964,0.02324086,0.011183147],"study_design_scores_gemma":[0.0002595352,0.00010010174,0.000120762015,0.000050797313,0.000008467323,0.000009068135,0.000065696375,0.9911817,0.00026747145,0.002106886,0.0056521087,0.0001774058],"about_ca_topic_score_codex":0.000028428041,"about_ca_topic_score_gemma":0.00006951387,"teacher_disagreement_score":0.98841417,"about_ca_system_score_codex":0.00030300592,"about_ca_system_score_gemma":0.00004363533,"threshold_uncertainty_score":0.654531},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023312353,0.00011056531,0.9725051,0.001782218,0.00015661605,0.0007518325,0.00084228336,0.000079827434,0.00045920795],"genre_scores_gemma":[0.9891397,0.0001757409,0.009585429,0.00005142356,0.00016470537,0.00013234181,0.00050233793,0.000020659376,0.00022768736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817616,0.00010049727,0.00032591235,0.0003110531,0.00057296146,0.0005134299],"domain_scores_gemma":[0.9953917,0.0027767832,0.000077317614,0.00036334357,0.0012029051,0.00018791833],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0009923015,0.00015218281,0.0001822254,0.00004916857,0.0010176686,0.00014648426,0.00025215003,0.000088298235,0.0001529002],"category_scores_gemma":[0.014631328,0.00011670561,0.00004317982,0.00041414768,0.00044251632,0.00006441048,0.00018023919,0.00036339276,0.00006018358],"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.000079557445,0.00014257674,0.000014071316,0.00004537579,0.000026229956,0.0000019913225,0.00003899756,0.00023694162,0.0009389231,0.9913576,0.0048444094,0.0022733216],"study_design_scores_gemma":[0.0012647439,0.00024837645,0.0017036609,0.00004390139,0.00006591148,0.000009499314,0.0001209324,0.01736478,0.002916987,0.9680396,0.0080054775,0.00021618487],"about_ca_topic_score_codex":0.000095294155,"about_ca_topic_score_gemma":0.000020915197,"teacher_disagreement_score":0.96582735,"about_ca_system_score_codex":0.00022544955,"about_ca_system_score_gemma":0.00024657787,"threshold_uncertainty_score":0.99366885},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2553697,0.00014245078,0.73658675,0.00042987298,0.00092924805,0.0034593085,0.00017878674,0.001775173,0.001128705],"genre_scores_gemma":[0.90157443,0.0000056298863,0.0969432,0.000016493468,0.000531032,0.0006441807,0.000049875594,0.000064063184,0.0001710643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741423,0.00012960212,0.00045649844,0.0003390633,0.0007558939,0.00090469397],"domain_scores_gemma":[0.99627596,0.0025529794,0.00003669099,0.0004724185,0.00045699294,0.0002049493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015442339,0.00022315506,0.00033520313,0.00026629498,0.00022595357,0.00014227857,0.00035843888,0.00021314385,0.000007862868],"category_scores_gemma":[0.0030789853,0.00020162037,0.000077142526,0.00043717466,0.000067271976,0.000076429096,0.0000634539,0.0004888706,0.000074422474],"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.0014936699,0.00006831499,0.00030188178,0.0026829853,0.000055133314,0.00006441626,0.00011626625,0.83810854,0.003602846,0.061189514,0.069771595,0.022544807],"study_design_scores_gemma":[0.0015953045,0.0011775275,0.001354439,0.00045169523,0.000022044167,0.00000984268,0.00003455086,0.92204386,0.030056644,0.03726857,0.0055530476,0.0004324757],"about_ca_topic_score_codex":0.00049461954,"about_ca_topic_score_gemma":0.00015587047,"teacher_disagreement_score":0.64620477,"about_ca_system_score_codex":0.0007291762,"about_ca_system_score_gemma":0.00009224373,"threshold_uncertainty_score":0.82218397},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8747674,0.00017903521,0.12115454,0.00082822586,0.00010514334,0.000598149,0.000049068694,0.000093133574,0.0022252828],"genre_scores_gemma":[0.9987042,0.00000768839,0.00063662016,0.000082576415,0.00022742258,0.000028644856,0.000030650295,0.000027871509,0.00025430246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976549,0.00011625358,0.00033502825,0.00036190468,0.00096187764,0.000570019],"domain_scores_gemma":[0.9974363,0.0003028304,0.00017042855,0.00040092925,0.0016179105,0.00007158924],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.003953226,0.00017785978,0.0002783449,0.00027714696,0.00042650267,0.0003245983,0.00047011458,0.00006105301,0.000014523757],"category_scores_gemma":[0.009919754,0.00013009022,0.00005267162,0.0013698724,0.0004114772,0.00038504135,0.00051417423,0.00038716535,0.00006519442],"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.002343702,0.0004973153,0.026993182,0.0018397848,0.00025824617,0.00020915808,0.002414936,0.42928955,0.0031723853,0.51502675,0.0013096976,0.016645253],"study_design_scores_gemma":[0.0010629683,0.0001757175,0.0023783185,0.0003455608,0.00017628452,0.000012646504,0.002952292,0.5799926,0.0006546575,0.3990878,0.012588916,0.0005722418],"about_ca_topic_score_codex":0.000962604,"about_ca_topic_score_gemma":0.00012981075,"teacher_disagreement_score":0.15070304,"about_ca_system_score_codex":0.00015408595,"about_ca_system_score_gemma":0.00017037474,"threshold_uncertainty_score":0.9984201},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062102914,0.00062525115,0.9241645,0.003363699,0.00066748296,0.0010227213,0.00015782301,0.00006684281,0.007828809],"genre_scores_gemma":[0.9966482,0.00007890642,0.0014328719,0.000033019387,0.00016675121,0.00009096654,0.0000010890815,0.000024014082,0.0015241617],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99109644,0.0017672878,0.0009057774,0.00082961883,0.004240135,0.0011607162],"domain_scores_gemma":[0.9705516,0.026319826,0.00016493139,0.0009849808,0.0016508028,0.00032782968],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.020109132,0.00021656268,0.00040311954,0.00032794,0.00045031466,0.00044635392,0.0015438219,0.00011599947,0.000047697908],"category_scores_gemma":[0.047124792,0.00009485481,0.000051782234,0.0015518552,0.0013711182,0.0003435008,0.00028821462,0.000786749,0.00028891224],"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.0055828323,0.0011996655,0.09158581,0.00044219053,0.00017438913,0.0049830265,0.005469278,0.041853,0.014128021,0.39546692,0.011692789,0.42742208],"study_design_scores_gemma":[0.00883096,0.0028996444,0.17185336,0.0019826612,0.00005820831,0.00014413601,0.016563823,0.05550353,0.0067258715,0.6158852,0.11723352,0.00231908],"about_ca_topic_score_codex":0.00027658662,"about_ca_topic_score_gemma":0.0002840134,"teacher_disagreement_score":0.9345453,"about_ca_system_score_codex":0.00033428473,"about_ca_system_score_gemma":0.00034240086,"threshold_uncertainty_score":0.9609017},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69995785,0.0026358822,0.022512967,0.08277285,0.0009740796,0.004720089,0.00013402668,0.00056917005,0.18572308],"genre_scores_gemma":[0.9909478,0.00027874854,0.00019142346,0.0007024775,0.00069868023,0.00006503973,0.000024833837,0.000035402376,0.007055587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975494,0.0000694128,0.00025584485,0.00052819564,0.0008704254,0.0007267085],"domain_scores_gemma":[0.99836946,0.00057571987,0.00009869684,0.00031260913,0.0005581258,0.00008540868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002073827,0.00023399132,0.0002563553,0.00043726485,0.00044139853,0.00054123445,0.00027420893,0.00010192946,0.00029596282],"category_scores_gemma":[0.0013998474,0.00015243256,0.000027802907,0.0004208435,0.0008048829,0.00063887745,0.00040887462,0.00024844892,0.0001112174],"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.0007052078,0.00027318927,0.14218801,0.0005724009,0.00014992597,0.0004094345,0.00015585296,0.00002937842,0.0018291349,0.71143717,0.08760922,0.054641064],"study_design_scores_gemma":[0.008134802,0.0006235131,0.12235182,0.0006632779,0.00012649765,0.000028468901,0.0014061175,0.011192862,0.0003404329,0.0441781,0.80987203,0.0010821017],"about_ca_topic_score_codex":0.0005625454,"about_ca_topic_score_gemma":0.00040151208,"teacher_disagreement_score":0.7222628,"about_ca_system_score_codex":0.00009684244,"about_ca_system_score_gemma":0.000058281134,"threshold_uncertainty_score":0.62160194},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043823356,0.00015259851,0.99325264,0.0003989192,0.000119432625,0.000710952,0.00006729429,0.00022990996,0.00068593945],"genre_scores_gemma":[0.6396829,0.00003712316,0.35872254,0.000022073817,0.00039692354,0.0002757871,0.00010303066,0.00007292795,0.0006867016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802774,0.0002761292,0.00031022934,0.00026714144,0.0004741765,0.0006445811],"domain_scores_gemma":[0.99595934,0.002536093,0.00005917145,0.0005164519,0.0007749793,0.00015398047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025087595,0.00015091614,0.0001784581,0.00017417206,0.00049737934,0.000109697976,0.00030844516,0.00012217775,0.00003417527],"category_scores_gemma":[0.0022996087,0.0001241746,0.000029336114,0.00053597643,0.00013639012,0.00016405826,0.00007152146,0.00030815325,0.00002414078],"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.000050654206,0.000021506776,0.0002323983,0.000040807034,0.00003429175,0.0000020452635,0.0001235301,0.9763256,0.005666968,0.0033404378,0.0049004476,0.009261371],"study_design_scores_gemma":[0.00072945136,0.00022697508,0.0002502048,0.00011111743,0.000018819053,0.0000033696424,0.00004578446,0.9935603,0.0008257088,0.0026659714,0.0013577185,0.0002045543],"about_ca_topic_score_codex":0.000059862825,"about_ca_topic_score_gemma":0.0001413953,"teacher_disagreement_score":0.6353006,"about_ca_system_score_codex":0.00030378913,"about_ca_system_score_gemma":0.00016367395,"threshold_uncertainty_score":0.50636935},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17440127,0.00021040377,0.81675,0.0005953037,0.0004393355,0.00055530237,0.00019369408,0.00036639307,0.0064882995],"genre_scores_gemma":[0.6907833,0.000040467603,0.30862913,0.0000233195,0.00019593506,0.000042477808,0.000057407895,0.0000544177,0.0001735176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969438,0.00014069775,0.0004205384,0.00057212065,0.0010070497,0.0009158233],"domain_scores_gemma":[0.9971826,0.00052946946,0.00007518207,0.0010221575,0.00065204763,0.0005385557],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015265405,0.0003312686,0.00045419735,0.00022656933,0.00095302524,0.00066854816,0.000772769,0.0001853711,0.00009453627],"category_scores_gemma":[0.0021652982,0.00028750653,0.00008319316,0.0002938162,0.0006524481,0.00019826932,0.00031645317,0.0010496097,0.00013257652],"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.00055328413,0.00020794365,0.013072078,0.00023348481,0.00022336708,0.0002549833,0.00046575326,0.9688301,0.0015618992,0.0019166546,0.00017987836,0.012500545],"study_design_scores_gemma":[0.0016607811,0.00011631388,0.010251574,0.000218132,0.000027501257,0.000033081757,0.00017096652,0.9850011,0.000957494,0.0009613823,0.00010334395,0.0004983566],"about_ca_topic_score_codex":0.00034359162,"about_ca_topic_score_gemma":0.00005730599,"teacher_disagreement_score":0.51638204,"about_ca_system_score_codex":0.00021284589,"about_ca_system_score_gemma":0.00014770981,"threshold_uncertainty_score":0.9999577},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004038333,0.00015275135,0.9882569,0.0016486668,0.0014787482,0.00082910777,0.0024847959,0.00010713332,0.0010036131],"genre_scores_gemma":[0.98188406,0.000008109305,0.015010242,0.00007438507,0.0019963349,0.0003058445,0.000051732473,0.000039796178,0.0006294923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99118036,0.0003738409,0.00092933606,0.0012022455,0.0050626663,0.001251527],"domain_scores_gemma":[0.96413076,0.026146531,0.0002622318,0.001084469,0.007883262,0.00049275236],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0062924987,0.00033265506,0.0005379278,0.00033636412,0.0012082632,0.00057725713,0.0018981334,0.00016939658,0.000120486344],"category_scores_gemma":[0.24025166,0.00025004792,0.000109485474,0.00143708,0.0017467994,0.0003192552,0.00037476828,0.0007265955,0.00030918187],"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.04001832,0.0041180635,0.026609235,0.0016566531,0.000341785,0.0005304019,0.00088239386,0.035703786,0.008396528,0.45354402,0.15078063,0.2774182],"study_design_scores_gemma":[0.0038997082,0.0042425357,0.004662138,0.00058036327,0.00003293907,0.000004481037,0.00039870717,0.13775885,0.019172048,0.8049714,0.023537368,0.0007394399],"about_ca_topic_score_codex":0.00004188684,"about_ca_topic_score_gemma":0.000042449585,"teacher_disagreement_score":0.9778457,"about_ca_system_score_codex":0.000497918,"about_ca_system_score_gemma":0.0007321801,"threshold_uncertainty_score":0.9999952},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008066713,0.00004826778,0.9439205,0.00941201,0.00067812984,0.003804204,0.00004040761,0.00004435294,0.033985414],"genre_scores_gemma":[0.99328023,0.0000068959757,0.0048377714,0.0006282412,0.00056323205,0.00018177401,0.000025441794,0.000013452652,0.00046298624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813724,0.00016366677,0.0003621542,0.00024813993,0.00072931213,0.00035951083],"domain_scores_gemma":[0.9969958,0.00035816059,0.000070881164,0.00059607293,0.0019659763,0.000013117348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052350713,0.00011017316,0.00014110089,0.00008137327,0.00067796564,0.00011243801,0.00079149887,0.00006014457,0.00019225797],"category_scores_gemma":[0.0031286615,0.00006611044,0.00007367892,0.0010278899,0.0005292115,0.00013381844,0.0004019939,0.00020232688,0.000046992885],"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.000114103386,0.00019342774,0.000087267435,0.0004704059,0.00003826811,6.0816475e-8,0.000086121916,0.43311355,0.0003160605,0.5427591,0.022561152,0.00026045987],"study_design_scores_gemma":[0.0002775095,0.00009659153,0.00063529523,0.0000592996,0.000041569445,7.9118884e-8,0.0002382839,0.9587325,0.0003981065,0.031035068,0.0083693685,0.00011632421],"about_ca_topic_score_codex":0.0023919754,"about_ca_topic_score_gemma":0.00083081087,"teacher_disagreement_score":0.9852135,"about_ca_system_score_codex":0.00003664308,"about_ca_system_score_gemma":0.00009481053,"threshold_uncertainty_score":0.52144325},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007094699,0.00012918442,0.9908486,0.00034173284,0.00038399413,0.0008056728,0.000029011882,0.00019980334,0.0071910773],"genre_scores_gemma":[0.087405205,0.000059072278,0.9108733,0.000041501087,0.0005959846,0.00008714652,0.00006027707,0.000053154814,0.0008243798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799395,0.0002125807,0.0002826465,0.0003545125,0.00055624644,0.000600072],"domain_scores_gemma":[0.9966969,0.0014918072,0.00003623076,0.0002456789,0.0013402221,0.00018916988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032097443,0.00016143848,0.00022374933,0.00019042882,0.0001953535,0.000115252784,0.0002907155,0.00024289335,0.00006049726],"category_scores_gemma":[0.0046207034,0.00015025119,0.00006395043,0.0006469013,0.00012737421,0.00013134292,0.000054862754,0.00049624644,0.000037371763],"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.00039793437,0.000071450595,0.000022186363,0.0007755346,0.00008483448,0.000006226466,0.00084786967,0.58646935,0.0053616595,0.017366052,0.07197988,0.31661704],"study_design_scores_gemma":[0.000460755,0.00028814116,0.000049722148,0.00004178001,0.000015362344,0.000003353971,0.00008344826,0.9069274,0.0070936875,0.077307604,0.007560935,0.00016777756],"about_ca_topic_score_codex":0.0000725847,"about_ca_topic_score_gemma":0.000045440083,"teacher_disagreement_score":0.3204581,"about_ca_system_score_codex":0.00019187936,"about_ca_system_score_gemma":0.00021440125,"threshold_uncertainty_score":0.61270654},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8962684,0.00009076922,0.0007003181,0.00032963738,0.00024023316,0.00050294516,0.000009004832,0.00006726656,0.10179139],"genre_scores_gemma":[0.9974995,0.00002005282,0.00034362185,0.00019303337,0.00029052523,0.000029125804,0.000021560038,0.00002954885,0.0015729936],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735224,0.000072850766,0.00034486805,0.00048533865,0.0009139985,0.00083070947],"domain_scores_gemma":[0.9985728,0.000326838,0.000060869977,0.00055200333,0.0004510453,0.00003640434],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0033986126,0.00017556894,0.00026106558,0.00048180568,0.00014844532,0.00032773556,0.0005075757,0.00012823567,0.00078825635],"category_scores_gemma":[0.0013910218,0.00016664255,0.00007471319,0.000880863,0.00018460678,0.0004229932,0.00063200755,0.0007792979,0.0007870473],"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.00045225967,0.0004242822,0.88518953,0.0005177352,0.00001720534,0.00008642766,0.00015133698,0.0020132207,0.011093719,0.07307956,0.002931833,0.024042873],"study_design_scores_gemma":[0.0018658863,0.000050996332,0.17546712,0.00010399488,0.000034122848,0.0000021483356,0.00033076943,0.7595718,0.00040198767,0.04659959,0.0148526495,0.00071893004],"about_ca_topic_score_codex":0.0048559164,"about_ca_topic_score_gemma":0.0011552254,"teacher_disagreement_score":0.7575586,"about_ca_system_score_codex":0.00014740798,"about_ca_system_score_gemma":0.00016570944,"threshold_uncertainty_score":0.99999094},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9979394,0.00012856741,0.00015668264,0.00028427117,0.000066228866,0.00037483804,0.0000151004015,0.000011306659,0.0010235708],"genre_scores_gemma":[0.9995153,0.00015081643,0.0000666765,0.000038119084,0.0001225827,0.000006590171,0.00005587402,0.000013949027,0.0000300794],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9989405,0.00003076944,0.0001941325,0.0002796385,0.00028613448,0.00026877422],"domain_scores_gemma":[0.99953824,0.0002031188,0.000042569307,0.00015371617,0.000028266455,0.00003410498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066415605,0.000118600976,0.00016813503,0.00014639896,0.000107754,0.0001464769,0.000084987194,0.00007258784,0.00012461169],"category_scores_gemma":[0.00029725567,0.000110911715,0.00001530661,0.00006460732,0.000755225,0.0004746284,0.00042062334,0.00021353198,0.000055006338],"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.00044158776,0.00024229051,0.85162973,0.0006403444,0.000023546942,0.0000121782605,0.000095684,0.000039362436,0.046997532,0.09377399,0.00011105524,0.0059926948],"study_design_scores_gemma":[0.0012233594,0.00035492258,0.96659875,0.000067744724,0.000027556527,0.000010192538,0.0013389806,0.01649364,0.0011980456,0.0113953855,0.0010466104,0.00024479764],"about_ca_topic_score_codex":0.0008427831,"about_ca_topic_score_gemma":0.00014800548,"teacher_disagreement_score":0.11496903,"about_ca_system_score_codex":0.00015288567,"about_ca_system_score_gemma":0.000016376885,"threshold_uncertainty_score":0.45228484},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6878774,0.0000560201,0.05901825,0.0013710378,0.0010334568,0.0036234525,0.000021022313,0.00035059324,0.24664876],"genre_scores_gemma":[0.9946908,0.0000070553065,0.0036266611,0.00060453784,0.00028390973,0.00011801864,0.000107022555,0.000029766561,0.00053228036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705034,0.00007202667,0.00046219057,0.00037708727,0.0013101391,0.0007282288],"domain_scores_gemma":[0.9977798,0.00033150736,0.00012529884,0.0005823987,0.001118029,0.000062964864],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002548756,0.00021080957,0.00025598067,0.0011349877,0.0002295009,0.00085816096,0.0006607012,0.00009026272,0.00017295663],"category_scores_gemma":[0.0021332444,0.00016996855,0.000032609867,0.0018477545,0.000073735275,0.0023987128,0.0004535567,0.0005318016,0.0022979393],"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.0009253427,0.00041572496,0.14504576,0.0013521349,0.00004590288,0.00011854951,0.00074568985,0.03804718,0.0006636743,0.75366765,0.012425967,0.04654643],"study_design_scores_gemma":[0.00398404,0.0008506385,0.041862126,0.002414524,0.000036605605,0.0000063492203,0.034338783,0.5544522,0.00013489123,0.00531447,0.35529736,0.0013080059],"about_ca_topic_score_codex":0.0010985971,"about_ca_topic_score_gemma":0.001220892,"teacher_disagreement_score":0.7483532,"about_ca_system_score_codex":0.00033302617,"about_ca_system_score_gemma":0.00010031571,"threshold_uncertainty_score":0.9984789},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.297215,0.00034788152,0.6528553,0.0190764,0.00053603767,0.0058168657,0.00011709193,0.00043047572,0.023604961],"genre_scores_gemma":[0.9810422,0.000060828148,0.01748422,0.00010507202,0.00025104443,0.00005298496,0.00006929743,0.00002726015,0.00090708415],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972697,0.00013631355,0.00025954345,0.00055998587,0.0010901575,0.00068428495],"domain_scores_gemma":[0.99903107,0.00016348857,0.00005311263,0.00024217511,0.00011811035,0.00039204498],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013933914,0.00015865488,0.00016937642,0.000045988803,0.00042645808,0.00012907384,0.0005644244,0.00015481224,0.0010181894],"category_scores_gemma":[0.00023691503,0.0001341161,0.000065944,0.00069010287,0.0005309971,0.0001512332,0.00021542066,0.0004418229,0.00037875722],"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.004167778,0.005865613,0.015406881,0.0018485304,0.00023138532,0.00019047303,0.007402147,0.2627597,0.49915022,0.025231183,0.07288317,0.10486296],"study_design_scores_gemma":[0.0031524794,0.0038236778,0.009187982,0.00023535811,0.00010804993,0.000011977324,0.00490433,0.76848644,0.03671237,0.024594367,0.1475005,0.0012824909],"about_ca_topic_score_codex":0.00055270124,"about_ca_topic_score_gemma":0.000013955967,"teacher_disagreement_score":0.6838272,"about_ca_system_score_codex":0.00015767178,"about_ca_system_score_gemma":0.00008135983,"threshold_uncertainty_score":0.99989504},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051217657,0.00069102977,0.988597,0.00088524935,0.00025804152,0.0006098367,0.00007551636,0.0007176167,0.0030439761],"genre_scores_gemma":[0.35123813,0.00008142359,0.6470777,0.00011729844,0.0007358426,0.00013746753,0.00006744317,0.000118506534,0.00042620255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742883,0.000066363595,0.0003306583,0.00045274955,0.00088179717,0.000839575],"domain_scores_gemma":[0.9980311,0.0005839201,0.00003263959,0.0003026033,0.0006067713,0.00044298553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087028206,0.00026195886,0.00030499147,0.00018567636,0.0003113958,0.00020372766,0.00043657023,0.00016277055,0.00006096331],"category_scores_gemma":[0.0016552452,0.00022473786,0.00008018841,0.0008063423,0.0002038288,0.000045069537,0.00010239346,0.0007352559,0.00011634112],"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.00012755605,0.00003645477,0.00013058305,0.00018305452,0.000048936916,0.000021531092,0.00025491,0.991729,0.00022511258,0.002385925,0.0005605415,0.0042963442],"study_design_scores_gemma":[0.0010249811,0.00030628088,0.00004540499,0.000039609127,0.000018831277,0.0000051539755,0.00023427654,0.9959961,0.00067173166,0.00030375164,0.0010636846,0.0002901885],"about_ca_topic_score_codex":0.000021224045,"about_ca_topic_score_gemma":0.000005397231,"teacher_disagreement_score":0.34611636,"about_ca_system_score_codex":0.00011396774,"about_ca_system_score_gemma":0.00014652571,"threshold_uncertainty_score":0.9164544},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02298948,0.00008590293,0.97365856,0.0017532584,0.00018166594,0.0006879825,0.00005063911,0.00014332862,0.0004492059],"genre_scores_gemma":[0.6291931,0.000013762685,0.37040064,0.00007078808,0.00011560057,0.000018660492,0.000020449774,0.000023623339,0.00014334689],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654555,0.00020867396,0.00048619192,0.0006554299,0.0011087491,0.000995393],"domain_scores_gemma":[0.9969968,0.0013047401,0.000089996596,0.00052887923,0.00077889964,0.00030066344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022736148,0.00019598931,0.00035532415,0.000112735586,0.00027168146,0.00022081149,0.0014866529,0.00013256303,0.000004464559],"category_scores_gemma":[0.0017028336,0.00016131352,0.00008985671,0.00049827935,0.00019418787,0.00022120857,0.0010201974,0.00052102003,0.000051288698],"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.00048772185,0.00029900367,0.0015024815,0.0015490396,0.00016618612,0.00019281419,0.009292321,0.75425875,0.1810616,0.03282248,0.0034503525,0.014917248],"study_design_scores_gemma":[0.0010562649,0.0009081828,0.00018359421,0.00012411262,0.0000090210115,0.0000064476094,0.00009951176,0.92578596,0.058916576,0.009281852,0.0033345092,0.00029397022],"about_ca_topic_score_codex":0.000068429035,"about_ca_topic_score_gemma":0.0000015697685,"teacher_disagreement_score":0.6062037,"about_ca_system_score_codex":0.00011247823,"about_ca_system_score_gemma":0.00019778407,"threshold_uncertainty_score":0.6578175},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54319376,0.0013452184,0.26495916,0.040001795,0.0015702294,0.005896993,0.0002383721,0.0029497645,0.1398447],"genre_scores_gemma":[0.99605703,0.000019896575,0.00044660168,0.0012447537,0.0010458556,0.000042124087,0.000048451322,0.00006984967,0.0010254078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963467,0.00014878345,0.00038758735,0.0006458578,0.0016216694,0.0008493775],"domain_scores_gemma":[0.9968702,0.00055717543,0.00019553192,0.0005368669,0.0017340704,0.00010614433],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001981106,0.00026385958,0.00037424473,0.00027385398,0.00040428637,0.00067986967,0.0008153425,0.00010166297,0.00010865156],"category_scores_gemma":[0.0033417451,0.00021348492,0.000059657505,0.0018605868,0.00024056008,0.0005943396,0.0006020686,0.000892423,0.0013492918],"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.0049495664,0.0007601433,0.01240911,0.0057997876,0.0009924339,0.0032544467,0.0016818632,0.68005747,0.0146623235,0.25782943,0.012798132,0.0048053027],"study_design_scores_gemma":[0.0021781533,0.00021971026,0.0004705736,0.00026566058,0.00021185355,0.000009267303,0.004239869,0.89819527,0.0006696093,0.018072268,0.074494176,0.0009735947],"about_ca_topic_score_codex":0.0012996745,"about_ca_topic_score_gemma":0.00058896554,"teacher_disagreement_score":0.45286328,"about_ca_system_score_codex":0.00015374192,"about_ca_system_score_gemma":0.00009766562,"threshold_uncertainty_score":0.9994283},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054544937,0.00038237733,0.92843384,0.002862631,0.00021458253,0.0017921801,0.00006529383,0.0005113641,0.011192823],"genre_scores_gemma":[0.99493074,0.000005633478,0.0012885759,0.0003537909,0.0016625536,0.00010473306,0.000045100325,0.00007898858,0.001529892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970435,0.000072856856,0.00036162784,0.00053488766,0.0011045785,0.00088252965],"domain_scores_gemma":[0.9970687,0.0009588035,0.00018245832,0.0003531884,0.0013556527,0.00008121708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018424497,0.00025952575,0.0004121981,0.00037163202,0.00065052573,0.0007556733,0.0006644883,0.0000979676,0.00009541302],"category_scores_gemma":[0.006037396,0.0002166862,0.00009666663,0.00080149644,0.00040349524,0.00050168537,0.00052100484,0.0005431499,0.00065038446],"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.0011169456,0.000063917774,0.00010013316,0.0005217793,0.00016432257,0.00006377732,0.00018631294,0.90077066,0.0007912683,0.0930835,0.002723129,0.0004142618],"study_design_scores_gemma":[0.00095608085,0.00028305757,0.000036603407,0.00014894658,0.00018562903,0.0000072540806,0.0023426304,0.983479,0.000080639904,0.005154598,0.006842169,0.00048338357],"about_ca_topic_score_codex":0.0004904821,"about_ca_topic_score_gemma":0.000038265593,"teacher_disagreement_score":0.9403858,"about_ca_system_score_codex":0.00013146507,"about_ca_system_score_gemma":0.00009121774,"threshold_uncertainty_score":0.8836207},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055571616,0.0015886582,0.9417194,0.000023737699,0.00003354298,0.00057613174,0.000031320713,0.00004056924,0.00041503384],"genre_scores_gemma":[0.9684462,0.0049937824,0.0264166,0.0000050621834,0.000026666306,0.000036284364,0.000026354188,0.00002748234,0.000021597205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834317,0.00016482847,0.00048951874,0.00030228685,0.00040563635,0.000294553],"domain_scores_gemma":[0.9973699,0.0014363313,0.00007996274,0.00020440218,0.000795016,0.00011441647],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0019165968,0.000136803,0.00028446334,0.00018425882,0.00005372367,0.00004068242,0.00017929367,0.00016532927,0.0000011840997],"category_scores_gemma":[0.012398998,0.00012866798,0.00001811003,0.0006672238,0.00021788612,0.00014418407,0.00011002497,0.00029066287,6.547911e-7],"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.00012285622,0.000033666,0.0006754281,0.0015286951,0.000009170013,0.0000016530109,0.0004910187,0.99135745,0.0019532836,0.0016350679,0.00002707354,0.0021646216],"study_design_scores_gemma":[0.0004897048,0.000085369844,0.000098918,0.00029650045,0.000008035324,0.0000019364757,0.00078337133,0.9957146,0.00070875906,0.0017203592,0.00003388029,0.00005856034],"about_ca_topic_score_codex":0.000097263925,"about_ca_topic_score_gemma":0.000025771395,"teacher_disagreement_score":0.9153028,"about_ca_system_score_codex":0.000060183058,"about_ca_system_score_gemma":0.00007817406,"threshold_uncertainty_score":0.99592},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.826141,0.0002627352,0.045457065,0.018474203,0.0003028777,0.0048143007,0.00009703566,0.00033932217,0.10411144],"genre_scores_gemma":[0.9961746,0.00015548264,0.0027328047,0.00008100123,0.00007385238,0.00004066235,0.000009532133,0.000018704131,0.00071338867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9961589,0.00026110891,0.00029960985,0.0005052009,0.002021929,0.00075324596],"domain_scores_gemma":[0.99915344,0.00017251539,0.00004727433,0.0002397918,0.000034808778,0.00035217332],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014641634,0.00016082672,0.00018032285,0.00004777528,0.00023054233,0.000096742086,0.0004997693,0.0001255745,0.0013797954],"category_scores_gemma":[0.0005322109,0.00014248767,0.00004619315,0.001059081,0.0007212535,0.00011856722,0.00029291227,0.0006327542,0.00033255323],"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.0035151953,0.011466485,0.122938424,0.00048560882,0.0001287518,0.0010649042,0.017876554,0.29232955,0.23992889,0.034544993,0.09544558,0.18027507],"study_design_scores_gemma":[0.0054351976,0.007173322,0.4289141,0.00035182884,0.000085347805,0.000036033467,0.016990753,0.36952987,0.04335024,0.022669477,0.103048205,0.0024156305],"about_ca_topic_score_codex":0.0020893558,"about_ca_topic_score_gemma":0.00005968336,"teacher_disagreement_score":0.30597568,"about_ca_system_score_codex":0.0006777769,"about_ca_system_score_gemma":0.00008693639,"threshold_uncertainty_score":0.99953306},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004251646,0.00068129256,0.7708647,0.13236773,0.001406952,0.008365996,0.00003630834,0.0011037453,0.0809216],"genre_scores_gemma":[0.9247317,0.00007623242,0.027325206,0.027613655,0.010541223,0.00052801287,0.00011960755,0.0002626584,0.0088017285],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99374413,0.00037760445,0.00055221934,0.0010357955,0.002125774,0.00216447],"domain_scores_gemma":[0.9951225,0.0015196329,0.00014579557,0.0007754419,0.0022319227,0.00020470282],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0062702573,0.0004176752,0.00046040403,0.0007505845,0.00076448364,0.0010552718,0.0014490507,0.00019290832,0.00084685226],"category_scores_gemma":[0.023307882,0.00041552712,0.000109968394,0.0050054714,0.00033777163,0.00035126784,0.0023332553,0.0010273082,0.0040335697],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002043721,0.00014416312,0.0017511004,0.00054771936,0.00011830124,0.0015432579,0.0003449382,0.12745343,0.00025824067,0.17346647,0.6804534,0.011875257],"study_design_scores_gemma":[0.0012530803,0.00032696885,0.0017291077,0.00009578294,0.00005997494,0.0000018301251,0.002847278,0.09655578,0.000073074465,0.046245147,0.85003734,0.0007746646],"about_ca_topic_score_codex":0.0006371215,"about_ca_topic_score_gemma":0.00008114851,"teacher_disagreement_score":0.92048,"about_ca_system_score_codex":0.00032691567,"about_ca_system_score_gemma":0.00030904054,"threshold_uncertainty_score":0.9999817},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010671238,0.00037263232,0.876498,0.015102018,0.0009652029,0.0029403456,0.0000115969015,0.00037162434,0.093067385],"genre_scores_gemma":[0.9941292,0.00006039589,0.00051734294,0.003297261,0.0013299775,0.00006917734,0.00005982803,0.00004558445,0.00049122324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722564,0.00014588279,0.00040678284,0.00048071964,0.0010201494,0.00072081084],"domain_scores_gemma":[0.99895984,0.00027181927,0.000101781174,0.00025824076,0.00034775425,0.000060591992],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002693399,0.00019592406,0.00023189737,0.000587742,0.00019480755,0.00059193425,0.0006336503,0.00009785888,0.0006878507],"category_scores_gemma":[0.004056891,0.00019491921,0.00005911185,0.001360211,0.00018828353,0.0005210885,0.00061116816,0.0005289098,0.00094309123],"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.0013773139,0.00071937375,0.063449465,0.0015711908,0.00011548246,0.0011330441,0.0016807278,0.03173638,0.003180535,0.5001931,0.31916785,0.075675525],"study_design_scores_gemma":[0.0020724921,0.00016042452,0.004133513,0.00027219043,0.000025754456,0.0000013284471,0.001234731,0.5732494,0.00052982307,0.03623854,0.38148803,0.00059375365],"about_ca_topic_score_codex":0.0007631381,"about_ca_topic_score_gemma":0.000105857165,"teacher_disagreement_score":0.983458,"about_ca_system_score_codex":0.00020301413,"about_ca_system_score_gemma":0.000062154286,"threshold_uncertainty_score":0.9998348},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9849409,0.000098822966,0.0051013413,0.0065135933,0.00018590185,0.0007391751,0.000007819593,0.000044746866,0.002367707],"genre_scores_gemma":[0.99699736,0.00001474123,0.000872691,0.00012426337,0.0002353503,0.00005717463,0.0000058921323,0.00001980229,0.0016727069],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99332947,0.0008376429,0.0008850386,0.0010868027,0.00294702,0.000914011],"domain_scores_gemma":[0.9899711,0.0044124806,0.00016561738,0.0011289763,0.0038155334,0.00050628616],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.013103638,0.00020489388,0.00039296105,0.0017353485,0.00070240366,0.0016630313,0.0006755308,0.00016311264,0.00014022276],"category_scores_gemma":[0.1962693,0.00016229063,0.00004622586,0.004799719,0.000830624,0.0005683672,0.0007829592,0.0007352464,0.0005215006],"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.00024137096,0.00088693504,0.659243,0.000095620766,0.00006655166,0.00031860522,0.008892658,0.17048688,0.021254385,0.01750307,0.09105893,0.029952014],"study_design_scores_gemma":[0.0006088707,0.00025954453,0.82780135,0.00021248132,0.000026868263,0.000034967485,0.0020045382,0.0897861,0.0032616314,0.07079775,0.0046012634,0.00060466275],"about_ca_topic_score_codex":0.0034755673,"about_ca_topic_score_gemma":0.0037241748,"teacher_disagreement_score":0.18316567,"about_ca_system_score_codex":0.00021670356,"about_ca_system_score_gemma":0.00037598205,"threshold_uncertainty_score":0.9993733},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73144364,0.11883762,0.00942923,0.025800977,0.0007496085,0.014527699,0.0000655951,0.00050158496,0.09864407],"genre_scores_gemma":[0.9934208,0.0035020865,0.00015748887,0.0011868739,0.00092296145,0.00011507444,0.000021150712,0.000039159615,0.00063443097],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976018,0.000095633484,0.00038948416,0.00044691574,0.00072550157,0.0007406425],"domain_scores_gemma":[0.99909055,0.00019392237,0.000120862416,0.00027158723,0.00025014475,0.00007293171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021477453,0.00024007924,0.00039987187,0.0006741696,0.00026772302,0.00057078735,0.00026544512,0.00007517462,0.000053663003],"category_scores_gemma":[0.0012319678,0.00020216944,0.000028968165,0.0006883531,0.0004499021,0.00049126445,0.00038216743,0.00043429527,0.00010243455],"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.0016618228,0.0013494148,0.49423528,0.053453106,0.0005727536,0.0010987489,0.0011891245,0.0283318,0.001060372,0.27462578,0.06366863,0.078753166],"study_design_scores_gemma":[0.005874231,0.00025144042,0.021074327,0.005551646,0.00013017093,0.000028960716,0.002385585,0.24747215,0.000011381528,0.00024062551,0.7159776,0.0010018593],"about_ca_topic_score_codex":0.0018292334,"about_ca_topic_score_gemma":0.00058297947,"teacher_disagreement_score":0.652309,"about_ca_system_score_codex":0.00023088953,"about_ca_system_score_gemma":0.00009883294,"threshold_uncertainty_score":0.8244231},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094015226,0.00011597639,0.8966876,0.0007131056,0.00005715034,0.00079736544,0.00009094561,0.00008565955,0.0074369353],"genre_scores_gemma":[0.9874563,0.00001303659,0.011821184,0.00005121546,0.00008394344,0.000036737445,0.000040907315,0.000013441823,0.00048319393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960117,0.00068721786,0.0006527385,0.00059996836,0.001646817,0.00040158644],"domain_scores_gemma":[0.98900115,0.008173353,0.00010883837,0.00046169662,0.0020466207,0.00020835818],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0073387073,0.00011558038,0.00024787406,0.00050345337,0.00031948395,0.0006489144,0.00031545974,0.00014268956,0.0002212471],"category_scores_gemma":[0.03531335,0.00010952058,0.0000358369,0.002010506,0.00022775693,0.00017121498,0.0003190702,0.00036763333,0.00009007175],"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.000020360916,0.000039122307,0.0036663827,0.000008861346,0.000003617482,0.000019000392,0.00020723692,0.97340935,0.00037438291,0.010126367,0.0003915875,0.011733732],"study_design_scores_gemma":[0.00021533162,0.000042550673,0.0013595524,0.00005092197,0.0000023686741,0.000004347625,0.00063009135,0.9864002,0.00025398567,0.0095000025,0.001424549,0.0001160905],"about_ca_topic_score_codex":0.00013716948,"about_ca_topic_score_gemma":0.000030587278,"teacher_disagreement_score":0.89344114,"about_ca_system_score_codex":0.00011050549,"about_ca_system_score_gemma":0.0001807351,"threshold_uncertainty_score":0.9728126},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21354719,0.001523667,0.7429184,0.0010046136,0.00044311187,0.00039854733,0.000029729765,0.0005129121,0.039621856],"genre_scores_gemma":[0.96517116,0.00093803264,0.03293886,0.000037785863,0.0000906927,0.000016870188,0.000032567932,0.00003318266,0.00074083277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839354,0.00010671003,0.00021662658,0.00028513843,0.00044165587,0.00055636046],"domain_scores_gemma":[0.99860615,0.00040495614,0.000013311843,0.0002958644,0.0005139344,0.00016576488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001227076,0.000118711374,0.00016665136,0.0001022651,0.00016277253,0.000169972,0.00014177285,0.00014743158,0.00007653849],"category_scores_gemma":[0.0031819702,0.00012133996,0.00003596266,0.0004483579,0.00020192897,0.00011630512,0.00017891526,0.00064806786,0.000044370634],"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.00005289201,0.000063772866,0.000876684,0.00043037074,0.000055157085,0.000194625,0.00029015436,0.8828396,0.009350461,0.09416729,0.0005422573,0.0111366995],"study_design_scores_gemma":[0.00030275743,0.00006721301,0.00075831084,0.0001304728,0.000008966592,0.000019822028,0.00043712376,0.9672517,0.0028446666,0.025943538,0.002035244,0.00020018025],"about_ca_topic_score_codex":0.000031444728,"about_ca_topic_score_gemma":0.000050492705,"teacher_disagreement_score":0.751624,"about_ca_system_score_codex":0.00019160712,"about_ca_system_score_gemma":0.00013693435,"threshold_uncertainty_score":0.49481},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4185734,0.004886571,0.14955199,0.3704761,0.0048557515,0.0028009787,0.0023301092,0.0006624665,0.04586262],"genre_scores_gemma":[0.9897426,0.00048000194,0.0019302747,0.0028788273,0.0014916039,0.00006105571,0.0023161075,0.000044494394,0.0010550636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678266,0.000114526214,0.00055853574,0.0007215699,0.0010622666,0.0007604475],"domain_scores_gemma":[0.9928682,0.0003339908,0.000047625923,0.00085561554,0.0058363476,0.00005823653],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001141874,0.00024386003,0.00034072713,0.00053276436,0.000672253,0.0014018107,0.0008170017,0.0002291227,0.00090807735],"category_scores_gemma":[0.005475723,0.00023921538,0.000047409867,0.0055105365,0.00019740089,0.0010678917,0.00092234346,0.00085573725,0.0011655912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022767443,0.0019782376,0.036613278,0.0016308712,0.00013895558,0.0013373259,0.00044475228,0.11157037,0.00830641,0.7871809,0.018588828,0.03198239],"study_design_scores_gemma":[0.0016267328,0.00003178283,0.119356014,0.0010161216,0.00012161065,0.000018823039,0.0032269969,0.6017937,0.001611887,0.040416468,0.2292834,0.0014964639],"about_ca_topic_score_codex":0.048030794,"about_ca_topic_score_gemma":0.15152256,"teacher_disagreement_score":0.7467644,"about_ca_system_score_codex":0.00018148274,"about_ca_system_score_gemma":0.0008490792,"threshold_uncertainty_score":0.9996348},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074119404,0.00033551213,0.9124733,0.0021727104,0.00025222226,0.00045654035,0.000006920384,0.00011751421,0.010065861],"genre_scores_gemma":[0.99669284,0.000065527114,0.0017382678,0.00042030364,0.0004554558,0.000019277004,0.000077737226,0.00002939809,0.00050118734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983003,0.00008602822,0.00022774968,0.00032819927,0.0006475603,0.00041014832],"domain_scores_gemma":[0.9977125,0.0011159909,0.000073753596,0.00029790803,0.00077116676,0.000028673981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013547802,0.00013994236,0.00015227997,0.00019286199,0.0006841476,0.0005274433,0.00020445893,0.000087138724,0.00013277773],"category_scores_gemma":[0.0025148692,0.0001145725,0.00003705814,0.0007997084,0.00021747523,0.0003138237,0.00042797846,0.00052006805,0.00003436734],"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.00006939922,0.00014304683,0.0030554896,0.00024155027,0.000031593645,0.000035497655,0.000089082845,0.8977324,0.0014215854,0.08859443,0.00038802155,0.008197936],"study_design_scores_gemma":[0.0003563286,0.000007975714,0.0039758403,0.00006577294,0.00006134379,0.000005025762,0.00031661848,0.988633,0.000021099291,0.005446128,0.00095957366,0.0001512893],"about_ca_topic_score_codex":0.0005335879,"about_ca_topic_score_gemma":0.00028530756,"teacher_disagreement_score":0.92257345,"about_ca_system_score_codex":0.000054280903,"about_ca_system_score_gemma":0.000122052035,"threshold_uncertainty_score":0.5261979},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05791247,0.0005051447,0.9010724,0.0037598466,0.0003023239,0.00072679814,0.00092970935,0.000030548814,0.03476077],"genre_scores_gemma":[0.98725706,0.00009943702,0.00712834,0.000060747574,0.000096659445,0.000052233823,0.000029845558,0.0000048502548,0.0052708383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787027,0.00024799327,0.00043805793,0.00020145667,0.001015466,0.00022677313],"domain_scores_gemma":[0.9930667,0.0044616163,0.00014450427,0.00042084677,0.0018017875,0.00010453513],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.006315048,0.000059900256,0.00015063421,0.00018467578,0.00036151242,0.00023380782,0.00033947546,0.00008277804,0.00009370068],"category_scores_gemma":[0.035218153,0.00005015028,0.000047037025,0.0008992944,0.0004846708,0.00027533618,0.00019595168,0.00019581545,0.000079343255],"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.00008043818,0.00007859354,0.00048218423,0.000049719427,0.000012369632,0.0000012350159,0.00054168736,0.000098614364,0.0025229687,0.92269856,0.020983327,0.05245028],"study_design_scores_gemma":[0.00021845287,0.000102365375,0.0020415327,0.000012741948,0.000004693487,0.000007373064,0.00129527,0.0011528512,0.0053824717,0.6711996,0.31852123,0.000061389015],"about_ca_topic_score_codex":0.000019215866,"about_ca_topic_score_gemma":0.000020630305,"teacher_disagreement_score":0.9293446,"about_ca_system_score_codex":0.00003569421,"about_ca_system_score_gemma":0.00030084504,"threshold_uncertainty_score":0.9729086},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34803227,0.0004080344,0.5811958,0.0032875033,0.0002609628,0.0018212087,0.00014708716,0.00008692576,0.06476026],"genre_scores_gemma":[0.94889235,0.000052772157,0.0465093,0.0000670588,0.00003338601,0.00008156759,0.000047579993,0.00002105765,0.004294907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731636,0.0002457404,0.0003138862,0.0005244565,0.00080179493,0.0007977872],"domain_scores_gemma":[0.9984474,0.000807483,0.000015649317,0.00037452712,0.00010039557,0.00025455037],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0028861205,0.00014075071,0.00017549194,0.000091750444,0.00047594332,0.00013487526,0.00041054486,0.00014549724,0.0050642136],"category_scores_gemma":[0.00241394,0.00012954262,0.00006475042,0.000698684,0.00037398833,0.00014161174,0.00020807226,0.0005577566,0.00016879498],"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.00035314288,0.001943157,0.034335814,0.00009841557,0.000027263806,0.0014077062,0.0039222725,0.8604374,0.056074306,0.016756078,0.01384645,0.010797995],"study_design_scores_gemma":[0.0035728808,0.0018296995,0.07672316,0.00031057696,0.000054060092,0.000087120694,0.004050765,0.8026619,0.02797172,0.011891835,0.06901204,0.0018342794],"about_ca_topic_score_codex":0.00058515026,"about_ca_topic_score_gemma":0.00088159385,"teacher_disagreement_score":0.6008601,"about_ca_system_score_codex":0.00028136387,"about_ca_system_score_gemma":0.00022590984,"threshold_uncertainty_score":0.9958453},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62743264,0.00024917175,0.37137276,0.00004667409,0.00007840679,0.00044950817,0.00004778651,0.000120430355,0.00020261994],"genre_scores_gemma":[0.9970071,0.00013062728,0.0025005704,0.000016089904,0.00008432142,0.0001357408,0.000041349107,0.000027011778,0.000057205398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998596,0.000067423105,0.00027250004,0.00027514852,0.0003339947,0.00045489182],"domain_scores_gemma":[0.9985631,0.00037391076,0.000016591131,0.0002410959,0.00069115637,0.0001141422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086948206,0.00012703214,0.00016498571,0.00015467747,0.00033211315,0.00015527382,0.000085435655,0.00009454404,0.000008756666],"category_scores_gemma":[0.00027791163,0.00013494813,0.000029744471,0.00066898455,0.00007676392,0.00014592541,0.00002283143,0.0004860374,0.000001815841],"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.000038672188,0.0004595633,0.0010157495,0.00028136632,0.00011550839,0.0009616551,0.0032283901,0.9305972,0.018407589,0.02745807,0.00080234144,0.016633902],"study_design_scores_gemma":[0.0005160983,0.00012334544,0.00071292126,0.000011451105,0.000018323242,0.000043921213,0.0049590287,0.98992944,0.0006124634,0.0028268849,0.000106215695,0.00013990203],"about_ca_topic_score_codex":0.00018947685,"about_ca_topic_score_gemma":0.00083365064,"teacher_disagreement_score":0.36957446,"about_ca_system_score_codex":0.00009262216,"about_ca_system_score_gemma":0.00019125352,"threshold_uncertainty_score":0.5503025},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17962347,0.0011851054,0.7125582,0.002936632,0.00050013146,0.000616696,0.000025479021,0.00013288048,0.10242141],"genre_scores_gemma":[0.98329884,0.00028749864,0.0151092475,0.00014437082,0.00031755152,0.000011135265,0.00006866237,0.00001737425,0.00074529444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985997,0.00011379966,0.00026807562,0.00023687062,0.0005117976,0.00026973026],"domain_scores_gemma":[0.99756145,0.00059334113,0.000050777915,0.00018230415,0.0015918989,0.000020219792],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0024174086,0.00008599996,0.00013085282,0.00023018602,0.00035559144,0.00042509838,0.000119354496,0.00007203955,0.00041281592],"category_scores_gemma":[0.014121687,0.00008772067,0.000028390325,0.00039055155,0.00012587661,0.00070321426,0.00034414334,0.00022060974,0.000011201901],"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.00014242393,0.00013509287,0.0007233424,0.00048494196,0.000033258697,0.000022158842,0.000119715616,0.88953227,0.0013646767,0.09498844,0.0006842097,0.01176946],"study_design_scores_gemma":[0.00029760535,0.000004620168,0.00043740246,0.00005867975,0.000015054585,0.000002294706,0.0007313346,0.99446934,0.00006155816,0.0011330517,0.0026977665,0.00009125804],"about_ca_topic_score_codex":0.00044534015,"about_ca_topic_score_gemma":0.00016617254,"teacher_disagreement_score":0.8036754,"about_ca_system_score_codex":0.000025293804,"about_ca_system_score_gemma":0.000096830714,"threshold_uncertainty_score":0.99418277},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9738983,0.0040724035,0.0038738989,0.0031810545,0.0017364491,0.0030035498,0.00090716564,0.00012340806,0.0092037935],"genre_scores_gemma":[0.99697405,0.0007132409,0.00055219315,0.00019092787,0.00031097824,0.00046913762,0.00012486849,0.000021879992,0.0006427306],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99668384,0.0005740969,0.0004158194,0.00054491166,0.0011043522,0.0006770087],"domain_scores_gemma":[0.9985348,0.00032838446,0.000045469948,0.00038077732,0.00043071696,0.00027987317],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0044552777,0.0001605558,0.00024977382,0.00015652024,0.0009054957,0.000017376497,0.00015004676,0.000041447176,0.0017681717],"category_scores_gemma":[0.0025575056,0.00014561761,0.00008063248,0.00043463238,0.00017007331,0.000045714463,0.00082794676,0.0005592782,0.000027019225],"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.010683782,0.0019867346,0.07520558,0.0012636941,0.001200716,0.00067470165,0.01650687,0.00032654373,0.07527497,0.22186364,0.26338556,0.33162722],"study_design_scores_gemma":[0.009687774,0.025865061,0.09789617,0.00012472551,0.0009299967,0.00010089178,0.1474451,0.0052540805,0.05457555,0.14655001,0.50935143,0.0022192188],"about_ca_topic_score_codex":0.00022747942,"about_ca_topic_score_gemma":0.000121251556,"teacher_disagreement_score":0.329408,"about_ca_system_score_codex":0.00030579054,"about_ca_system_score_gemma":0.00020149148,"threshold_uncertainty_score":0.9991444},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82606417,0.00061173027,0.004980368,0.014502407,0.0053468402,0.0032872695,0.00005775358,0.0008465423,0.14430289],"genre_scores_gemma":[0.9905192,0.00004258975,0.000044915254,0.0036319436,0.0008414915,0.000109767425,0.00016924879,0.00005178119,0.0045890356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963492,0.00007561596,0.00032858903,0.0005490248,0.001786759,0.0009107919],"domain_scores_gemma":[0.998693,0.00042851325,0.00011736245,0.0004465953,0.00026273882,0.00005179793],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0033800562,0.00024462325,0.00024027421,0.0008209655,0.0015027452,0.00036159158,0.00082255487,0.00007614662,0.0025317227],"category_scores_gemma":[0.00054347795,0.00022495615,0.00011157135,0.0010969313,0.00022942507,0.00031942266,0.00093079865,0.0010018349,0.0010124097],"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.0011525565,0.001149715,0.0011382604,0.00056433235,0.00015689274,0.00034957417,0.0003504777,0.38461903,0.0003287571,0.3132319,0.2802392,0.016719349],"study_design_scores_gemma":[0.0021928232,0.00045220926,0.0005125558,0.00008508613,0.000043944994,0.0000031751,0.0138620185,0.4623,0.00017226125,0.029795872,0.48985568,0.0007243955],"about_ca_topic_score_codex":0.0004661895,"about_ca_topic_score_gemma":0.000038678532,"teacher_disagreement_score":0.283436,"about_ca_system_score_codex":0.0004585189,"about_ca_system_score_gemma":0.00006981394,"threshold_uncertainty_score":0.99979717},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47486356,0.00032112937,0.008337618,0.015397725,0.00274642,0.0054124207,0.00014561253,0.001579547,0.49119598],"genre_scores_gemma":[0.9961474,0.000098622855,0.000015502612,0.00067977386,0.000921589,0.00013793011,0.00059579866,0.00002333909,0.0013800776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971282,0.00007648189,0.0004401871,0.00029768544,0.0011673738,0.0008901108],"domain_scores_gemma":[0.99898666,0.00017663107,0.00010290507,0.00030067516,0.00039280695,0.000040328934],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0040776413,0.0001888001,0.00020071174,0.00177963,0.00029141607,0.0006627632,0.000296198,0.0001365138,0.0004148447],"category_scores_gemma":[0.0010296507,0.00018579086,0.000058498146,0.0021877927,0.00016861365,0.0014621749,0.00052410795,0.00043769172,0.0036244618],"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.0005491629,0.00041187124,0.0081900805,0.0017039432,0.00007572216,0.000698906,0.0007113214,0.030518781,0.00045479418,0.4819709,0.4520429,0.022671597],"study_design_scores_gemma":[0.003509448,0.0002443213,0.08949085,0.00029945295,0.000030201676,0.000004749812,0.006073538,0.57176113,0.00013838467,0.12199539,0.20558348,0.0008690696],"about_ca_topic_score_codex":0.001182221,"about_ca_topic_score_gemma":0.0002551737,"teacher_disagreement_score":0.5412423,"about_ca_system_score_codex":0.00017595373,"about_ca_system_score_gemma":0.00006396945,"threshold_uncertainty_score":0.9971513},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5290391,0.0002913054,0.006800584,0.040999677,0.001298328,0.006335489,0.00008513611,0.0009716523,0.41417873],"genre_scores_gemma":[0.9982714,0.000034117762,0.00014063211,0.0009039333,0.00014995113,0.00015151844,0.00017901408,0.000013275563,0.00015613115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746734,0.00005065505,0.0004648903,0.00020481854,0.001202102,0.0006101881],"domain_scores_gemma":[0.99874777,0.00026566596,0.00014065483,0.0004774238,0.00035256418,0.000015906991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040152464,0.00015576126,0.00019090454,0.002286082,0.00022594287,0.0003640117,0.0008869945,0.00012588505,0.00011143271],"category_scores_gemma":[0.0016372974,0.00011384276,0.000053048603,0.0033516993,0.000431247,0.0008514694,0.00049182854,0.00046042798,0.00068558345],"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.000065020744,0.00011619454,0.0022914032,0.00046414018,0.000012714539,0.000034376717,0.00021454587,0.0029428643,0.00016376046,0.9603657,0.027864236,0.0054650074],"study_design_scores_gemma":[0.0021821747,0.000297616,0.017756028,0.00024001319,0.000022543767,0.0000010480361,0.04018639,0.16895857,0.00044065015,0.4641135,0.30540705,0.00039438906],"about_ca_topic_score_codex":0.00087666156,"about_ca_topic_score_gemma":0.00015380685,"teacher_disagreement_score":0.4962522,"about_ca_system_score_codex":0.00009861335,"about_ca_system_score_gemma":0.00014494448,"threshold_uncertainty_score":0.8812017},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9039636,0.0015328659,0.0011167568,0.00015530792,0.0007484208,0.00089560257,0.000014477682,0.00014653245,0.09142641],"genre_scores_gemma":[0.998599,0.000060819046,0.00021559451,0.000024645293,0.00038128393,0.000048269278,0.000014858054,0.00004439067,0.00061117194],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99735045,0.00016150608,0.00044704057,0.0004607597,0.0008572321,0.000723021],"domain_scores_gemma":[0.9962902,0.0029426897,0.00008507286,0.0002277945,0.0004193802,0.000034851353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004334143,0.00021316049,0.0003543149,0.0011820841,0.00018301932,0.00048788454,0.00034742308,0.00012971432,0.00020619282],"category_scores_gemma":[0.0031298837,0.00019869753,0.000118419106,0.0015928602,0.00028660378,0.00044102373,0.00057526067,0.0008500528,0.000054867807],"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.0013327157,0.0010255822,0.5691627,0.015833894,0.00017268668,0.008176334,0.0011691786,0.000118271586,0.014045109,0.09317479,0.012736253,0.28305247],"study_design_scores_gemma":[0.008157797,0.00073954003,0.50273997,0.021401023,0.001298195,0.00010525227,0.00518284,0.29868022,0.0075735543,0.043706484,0.106994145,0.0034209674],"about_ca_topic_score_codex":0.0024541216,"about_ca_topic_score_gemma":0.00076622167,"teacher_disagreement_score":0.29856193,"about_ca_system_score_codex":0.00012297269,"about_ca_system_score_gemma":0.000110681496,"threshold_uncertainty_score":0.81026495},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5296095,0.0013132185,0.38573125,0.00084357435,0.00031344203,0.0015491494,0.0001438584,0.0007334286,0.07976257],"genre_scores_gemma":[0.9637225,0.000020322203,0.03464551,0.0000139939375,0.00021151223,0.00007422001,0.000008593355,0.000032351796,0.0012709858],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946567,0.00035314666,0.00049667543,0.00084394636,0.00292803,0.00072153343],"domain_scores_gemma":[0.98881376,0.008958108,0.000100134814,0.0008338928,0.0010795081,0.00021460402],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.011092089,0.00020016279,0.00028121407,0.00055679184,0.0006136097,0.0013292184,0.0011880586,0.00015749459,0.00014173285],"category_scores_gemma":[0.012705046,0.00012198012,0.00007302478,0.0027710162,0.00060688634,0.00022870353,0.00048468064,0.0010138805,0.00022850983],"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.00049335737,0.00023884265,0.011672383,0.0005366536,0.00012178812,0.0010695483,0.0009996741,0.0045510936,0.0128211165,0.31433165,0.03693036,0.6162335],"study_design_scores_gemma":[0.0003289671,0.002760643,0.00077652984,0.0008692403,0.000044523276,0.00024439977,0.00036753755,0.7016068,0.0059822267,0.19330245,0.09312995,0.0005867494],"about_ca_topic_score_codex":0.00025342611,"about_ca_topic_score_gemma":0.00007762186,"teacher_disagreement_score":0.6970557,"about_ca_system_score_codex":0.00016413108,"about_ca_system_score_gemma":0.0003794099,"threshold_uncertainty_score":0.9997075},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34085795,0.003103088,0.63348484,0.0034704998,0.004246155,0.001445037,0.0011502161,0.0009067416,0.011335499],"genre_scores_gemma":[0.9731738,0.000030761163,0.023820218,0.000036526526,0.00073070335,0.00009209954,0.0000194135,0.000049230068,0.0020472633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.989246,0.0002812485,0.0006134199,0.0010942514,0.007851072,0.0009140162],"domain_scores_gemma":[0.9611397,0.034735218,0.00008321444,0.0006320927,0.003046027,0.00036374645],"candidate_categories":["metaresearch","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004293475,0.00026649452,0.00031645497,0.00072654424,0.0007630487,0.001343486,0.0012120196,0.00014466415,0.000114241906],"category_scores_gemma":[0.0939484,0.00018028425,0.000044115874,0.0037556312,0.0007521202,0.00055158866,0.00044516366,0.0014190647,0.0008387373],"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.00084086723,0.0006359213,0.0139762,0.00071281474,0.00021338438,0.0021936842,0.0011746418,0.05740933,0.002084666,0.77027404,0.019450687,0.13103373],"study_design_scores_gemma":[0.00043338953,0.0011151077,0.01386625,0.0008264769,0.000029728972,0.000020522395,0.0005261696,0.0059953993,0.0049984287,0.9655862,0.00611134,0.00049097725],"about_ca_topic_score_codex":0.000060698847,"about_ca_topic_score_gemma":0.000034561734,"teacher_disagreement_score":0.6323159,"about_ca_system_score_codex":0.00026109125,"about_ca_system_score_gemma":0.0014231765,"threshold_uncertainty_score":0.9999392},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05990595,0.008428059,0.5255712,0.020033443,0.0011119202,0.0067988434,0.00007299755,0.002697734,0.37537986],"genre_scores_gemma":[0.99161905,0.00018463434,0.0007436304,0.00052441907,0.0011376739,0.0003954294,0.000054189753,0.000058265472,0.0052827094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997994,0.000043899145,0.0002924878,0.0006080414,0.0005085999,0.0005529665],"domain_scores_gemma":[0.9986039,0.00039467754,0.00004430476,0.00053834665,0.00035484278,0.000063970074],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021724359,0.00020863504,0.0002254971,0.0010035646,0.00039590872,0.00068549137,0.00048311177,0.00007199435,0.0001515619],"category_scores_gemma":[0.00045653043,0.00017328895,0.0000719604,0.001818138,0.00014836802,0.00038312346,0.0008977833,0.00042236087,0.0010217235],"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.00013319246,0.00007189558,0.00016566845,0.0005937495,0.000147,0.00006114166,0.000084440326,0.0009014231,0.0006196684,0.9547579,0.011335716,0.031128166],"study_design_scores_gemma":[0.00038856856,0.00002751298,0.00016566455,0.00020121118,0.00008754723,0.000002097745,0.00071018015,0.02023897,0.00020996755,0.43257698,0.5450723,0.00031896494],"about_ca_topic_score_codex":0.00024945705,"about_ca_topic_score_gemma":0.00019862337,"teacher_disagreement_score":0.9317131,"about_ca_system_score_codex":0.00013900563,"about_ca_system_score_gemma":0.000028882112,"threshold_uncertainty_score":0.9997561},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37748772,0.004953058,0.02940573,0.0031029696,0.0016771811,0.0013577313,0.00043084435,0.00021053263,0.5813742],"genre_scores_gemma":[0.9851005,0.0001955519,0.0007190601,0.00016248165,0.00018688985,0.000040956642,0.000015082755,0.000029962193,0.013549526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99740136,0.00022911186,0.0007134994,0.0006700794,0.00016495588,0.0008210011],"domain_scores_gemma":[0.99751174,0.001422468,0.00016351485,0.0005541055,0.00015812869,0.0001900331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072123664,0.00021461307,0.0005073611,0.0005641563,0.00042981765,0.00035517378,0.0005214592,0.00017680695,0.00025201234],"category_scores_gemma":[0.005332115,0.00022939897,0.00008951913,0.00056916557,0.00047245092,0.00012839214,0.00040660246,0.0008098408,0.0005491901],"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.00014302132,0.00008202288,0.019561589,0.00017434284,0.00006112092,0.000032247663,0.0001838158,0.000016377642,0.00012302035,0.9741348,0.0035192147,0.0019684439],"study_design_scores_gemma":[0.00128661,0.00016186101,0.031781062,0.00015538167,0.0000096888025,0.000017188724,0.00027729856,0.0059530092,0.00019495212,0.89989275,0.059903525,0.00036666048],"about_ca_topic_score_codex":0.0009170847,"about_ca_topic_score_gemma":0.00004313438,"teacher_disagreement_score":0.6076128,"about_ca_system_score_codex":0.00018617616,"about_ca_system_score_gemma":0.000101508595,"threshold_uncertainty_score":0.9354618},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006721018,0.00010217328,0.9789554,0.00024279533,0.0003048128,0.00046907947,0.00006025852,0.000092225026,0.01305222],"genre_scores_gemma":[0.33625147,0.00001754165,0.6621876,0.00009661059,0.00014330207,0.000032195498,0.00001998336,0.00003481152,0.0012165065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99621254,0.0010358959,0.0006301054,0.0005408999,0.00082039816,0.0007601728],"domain_scores_gemma":[0.99321187,0.0046213698,0.0001377775,0.00064964587,0.001195112,0.00018423442],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.003871352,0.00024123298,0.0004056794,0.00036167854,0.00047965586,0.00021477572,0.00043662096,0.00025913178,0.0001264023],"category_scores_gemma":[0.03300882,0.00019912083,0.000082711806,0.0007915277,0.00034850495,0.000102219405,0.00031328626,0.0006459483,0.000005260515],"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.00022674166,0.00024696076,0.00012652737,0.0007017867,0.00003295693,0.000032144053,0.00012439534,0.00089356984,0.073329866,0.8747167,0.0031446035,0.046423726],"study_design_scores_gemma":[0.00031865665,0.0000734814,0.00003707873,0.00027771862,0.00002175138,7.2011375e-7,0.000049456627,0.58423716,0.0051060393,0.40961286,0.00014418467,0.0001208753],"about_ca_topic_score_codex":0.00020959228,"about_ca_topic_score_gemma":0.000029566441,"teacher_disagreement_score":0.5833436,"about_ca_system_score_codex":0.0002999905,"about_ca_system_score_gemma":0.00049988396,"threshold_uncertainty_score":0.9751366},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8731648,0.0010872713,0.053091608,0.0072445404,0.00019510045,0.0009049352,0.000024429482,0.00036714214,0.063920215],"genre_scores_gemma":[0.9975365,0.00008209522,0.0008179745,0.000778091,0.00022015515,0.000016007076,0.000031952968,0.000021691616,0.0004955631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984904,0.00006847334,0.00020129059,0.00039557615,0.00041739093,0.00042688183],"domain_scores_gemma":[0.99843127,0.00053516135,0.00008369639,0.00024947943,0.00067005353,0.00003035274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001318502,0.00015825375,0.00021765404,0.00043435732,0.00046881477,0.0003218335,0.00019961255,0.00007850299,0.00003047172],"category_scores_gemma":[0.0011458808,0.00013717843,0.000022872006,0.001068736,0.00033425848,0.0002487928,0.00035153577,0.00041785432,0.000035394325],"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.0012571905,0.00019397555,0.016738841,0.0026671505,0.0004058207,0.00038372754,0.00011602224,0.041015435,0.0091470005,0.90088004,0.00043622378,0.026758565],"study_design_scores_gemma":[0.0023508605,0.0001506165,0.001275362,0.0007685001,0.00039814095,0.000019295512,0.0017296068,0.74646306,0.0012264984,0.21191126,0.032911737,0.00079503894],"about_ca_topic_score_codex":0.00032530047,"about_ca_topic_score_gemma":0.000373599,"teacher_disagreement_score":0.7054476,"about_ca_system_score_codex":0.00005941208,"about_ca_system_score_gemma":0.00003568002,"threshold_uncertainty_score":0.5593974},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98037374,0.0019957467,0.00037135484,0.0024930341,0.000375047,0.00078605686,0.000010037643,0.00010302484,0.013491959],"genre_scores_gemma":[0.99832153,0.00010193934,0.00016132994,0.00011638262,0.00015832082,0.0000753263,0.000015502319,0.000023804549,0.0010258596],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99724555,0.00008873392,0.00041104993,0.00067811366,0.0007596223,0.0008169083],"domain_scores_gemma":[0.9983145,0.00056567637,0.0000907059,0.0004431641,0.00055390137,0.000032031676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031466023,0.0002451722,0.00035402732,0.00086452015,0.00047776653,0.00042149314,0.0003278417,0.00011215437,0.000029633808],"category_scores_gemma":[0.005574174,0.0002307975,0.000051590556,0.0011702105,0.00045381446,0.0003147174,0.0010168646,0.000964631,0.000040701514],"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.00014207208,0.00022279768,0.95818394,0.00064843305,0.0000830253,0.00029059037,0.00023011766,0.00012752945,0.0014937993,0.02869148,0.0014088876,0.008477345],"study_design_scores_gemma":[0.0028894297,0.000086260894,0.9301963,0.0014167167,0.0002743158,0.000011737369,0.006145501,0.008681498,0.00079373067,0.030524334,0.017815063,0.0011651047],"about_ca_topic_score_codex":0.0018313152,"about_ca_topic_score_gemma":0.003947211,"teacher_disagreement_score":0.027987612,"about_ca_system_score_codex":0.00026645634,"about_ca_system_score_gemma":0.00013045242,"threshold_uncertainty_score":0.9411649},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10579387,0.00032514805,0.8280228,0.0038915037,0.00036553887,0.0017188189,0.000013245799,0.0002740025,0.059595097],"genre_scores_gemma":[0.99417204,0.00002826791,0.0046751727,0.0006042513,0.00012341101,0.000039746832,0.00008754789,0.000023633014,0.00024594078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980569,0.000084549225,0.00027952573,0.0004466683,0.0006746592,0.00045772328],"domain_scores_gemma":[0.998044,0.00089799915,0.00010631508,0.00028795516,0.00063242944,0.0000312984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011172761,0.00020474313,0.00022366812,0.0005688765,0.000554982,0.0007703,0.00016597584,0.00012777178,0.000076379634],"category_scores_gemma":[0.0011848768,0.0001734964,0.000030987663,0.00079376757,0.00021745914,0.00048104837,0.00019529051,0.00040445477,0.0000052337878],"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.0009741065,0.00036170523,0.11174875,0.0009990785,0.00020166485,0.0001081372,0.0000881274,0.695932,0.0015518833,0.09627517,0.004313625,0.08744579],"study_design_scores_gemma":[0.0016076515,0.000043799693,0.030996734,0.0001640368,0.00014667328,0.0000018637709,0.0001508542,0.9495048,0.00017837656,0.015423948,0.0014836023,0.00029766673],"about_ca_topic_score_codex":0.0010747012,"about_ca_topic_score_gemma":0.0009354505,"teacher_disagreement_score":0.88837814,"about_ca_system_score_codex":0.00013512089,"about_ca_system_score_gemma":0.00020811874,"threshold_uncertainty_score":0.742802},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016821895,0.000058452868,0.0036053676,0.022371253,0.0012916565,0.0004688873,0.0000056602285,0.00016371816,0.9552131],"genre_scores_gemma":[0.8809629,0.00003415571,0.0022253597,0.006967269,0.0012863822,0.00006933845,0.000062657025,0.000031006908,0.10836091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981705,0.00004942177,0.0003679146,0.0003193788,0.000510408,0.00058239966],"domain_scores_gemma":[0.9982806,0.00034196227,0.00008232691,0.00027439056,0.0010032158,0.000017514229],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0034700853,0.00013230773,0.00019271222,0.00075022556,0.00063894014,0.00051999727,0.000466149,0.00013541742,0.000677508],"category_scores_gemma":[0.0035177951,0.00013257541,0.000058598864,0.0011115451,0.00026123595,0.0002532864,0.00046562264,0.000491698,0.002327287],"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.00007208119,0.000048798523,0.00177329,0.00006264045,0.000023872439,0.000014267563,0.00003070485,0.000012264667,0.00021536557,0.81455344,0.17358185,0.009611423],"study_design_scores_gemma":[0.0005461374,0.000008242241,0.008051675,0.00003153652,0.0000073042943,2.1826631e-7,0.00038152136,0.0008274557,0.000117555035,0.25730792,0.73256665,0.00015376548],"about_ca_topic_score_codex":0.00036343804,"about_ca_topic_score_gemma":0.00023744586,"teacher_disagreement_score":0.86414105,"about_ca_system_score_codex":0.0002985517,"about_ca_system_score_gemma":0.0013876949,"threshold_uncertainty_score":0.9984495},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68091965,0.0008603035,0.0021427514,0.001174632,0.0004705814,0.0011272522,0.00002983429,0.0001023328,0.31317264],"genre_scores_gemma":[0.99784565,0.00007103093,0.000031217147,0.00016169067,0.0002047342,0.00004463949,0.000024934167,0.000015638074,0.0016004927],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9975533,0.000051675805,0.00035030214,0.00030810354,0.0011106874,0.00062593236],"domain_scores_gemma":[0.99777746,0.00079020136,0.00008224182,0.0005538642,0.00077304046,0.000023216562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031728663,0.00015875761,0.00021888754,0.00045092576,0.00042477102,0.00031121753,0.00084453775,0.00010288949,0.0003983978],"category_scores_gemma":[0.0012025732,0.000109890134,0.00008675066,0.0009781499,0.00036089742,0.00021649232,0.001027371,0.00074391183,0.00015911691],"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.00020537147,0.0002852401,0.46301752,0.0004027066,0.000103444145,0.000021230344,0.00014877893,0.00006501246,0.0022008826,0.09907369,0.0051401188,0.429336],"study_design_scores_gemma":[0.0015496485,0.00011049906,0.6618175,0.00048540602,0.0002438184,0.0000021946953,0.0029165102,0.019568447,0.004000287,0.1354233,0.17329112,0.00059126824],"about_ca_topic_score_codex":0.0037843662,"about_ca_topic_score_gemma":0.00044862196,"teacher_disagreement_score":0.42874473,"about_ca_system_score_codex":0.000079101206,"about_ca_system_score_gemma":0.00018111228,"threshold_uncertainty_score":0.5720855},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9732152,0.000048239912,0.011383486,0.0003340979,0.000053080214,0.00030712504,0.000003400298,0.00004583162,0.014609491],"genre_scores_gemma":[0.99859774,0.000017876926,0.00095893425,0.00010422694,0.00008604754,0.000019049614,0.00001839077,0.000014832839,0.00018292904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979299,0.000090781985,0.00049737457,0.0002845316,0.00069089205,0.00050653017],"domain_scores_gemma":[0.9978985,0.0009610535,0.00020433278,0.0003029805,0.0006069778,0.000026139644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017742001,0.00019975322,0.00036843252,0.00072848564,0.00019275965,0.0003292995,0.00029593124,0.000104503444,0.000048958547],"category_scores_gemma":[0.0031574725,0.00016445889,0.00004454201,0.0014443684,0.00031500577,0.000924929,0.00039772352,0.0005670651,0.0000088000015],"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.0030116842,0.0007370612,0.10344951,0.0037435929,0.00033231173,0.00012415575,0.0009749014,0.10899515,0.009881041,0.7568035,0.0002963891,0.011650689],"study_design_scores_gemma":[0.008244766,0.00078642514,0.09270231,0.0038143762,0.0004483568,0.000008475259,0.019944338,0.523603,0.005068023,0.34163776,0.0020582592,0.0016838924],"about_ca_topic_score_codex":0.0008363749,"about_ca_topic_score_gemma":0.0004678605,"teacher_disagreement_score":0.41516575,"about_ca_system_score_codex":0.00015997289,"about_ca_system_score_gemma":0.000095045405,"threshold_uncertainty_score":0.6706439},"labels":[],"label_agreement":null}]}