{"meta":{"query_hash":"e6fd5d97faf8","filters":{"venue":"Queueing Systems"},"cohort_total":62,"direct_labels_cover":0,"predictions_cover":62,"exported":62,"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/e6fd5d97faf8","api":"https://metacan.xera.ac/api/v1/cohort?venue=Queueing+Systems"},"results":[{"id":"W1484666374","doi":"10.1023/a:1017975331468","title":"Perturbation Theory for the Asymptotic Decay Rates in the Queues with Markovian Arrival Process and/or Markovian Service Process – Correction","year":2001,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Mathematics","score_opus":0.01254046748760409,"score_gpt":0.25532031781259557,"score_spread":0.24277985032499147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484666374","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.95609313,0.00086687173,0.025474334,0.0038809907,0.001081981,0.0037517522,0.000003417191,0.00041454803,0.008432957],"genre_scores_gemma":[0.9962369,0.0000139640415,0.000013492017,0.0008722194,0.0008034352,0.0005460913,0.000018715076,0.000050701565,0.0014444463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984479,0.00014868847,0.0003592208,0.00039758818,0.00030199383,0.00034461913],"domain_scores_gemma":[0.9979327,0.0010176023,0.00038632096,0.00032084316,0.00032912256,0.00001342913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021359152,0.00027595277,0.00028276423,0.0002147797,0.0006179611,0.000624361,0.00041379165,0.00008001389,0.000017896506],"category_scores_gemma":[0.0003468769,0.00014249535,0.00004707807,0.0012197266,0.00007582793,0.0012011988,0.000030465242,0.00018666132,0.000010235565],"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.015093769,0.00081520854,0.12705521,0.013735696,0.0012076196,0.00015676169,0.026244365,0.5278677,0.00041535034,0.2417833,0.0012675093,0.044357534],"study_design_scores_gemma":[0.0015672245,0.000082958024,0.0029129365,0.0016429551,0.0005720127,0.00014359932,0.07093344,0.895857,0.00007689187,0.019731438,0.0056587346,0.0008208126],"about_ca_topic_score_codex":0.00045253598,"about_ca_topic_score_gemma":0.0017498417,"teacher_disagreement_score":0.36798933,"about_ca_system_score_codex":0.000051819945,"about_ca_system_score_gemma":0.000040180134,"threshold_uncertainty_score":0.6020727},"labels":[],"label_agreement":null},{"id":"W1537366078","doi":"10.1023/a:1020941305448","title":"Two M/M/1 Queues with Transfers of Customers","year":2002,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Science Foundation","keywords":"Queueing theory; Transfer (computing); Bulk queue; Burke's theorem; Queue; Stationary distribution; Mathematics; Markov chain; Computer science; Applied mathematics; Mathematical optimization; Fork–join queue; Queue management system; Statistics; Computer network; Parallel computing","score_opus":0.014183741449590143,"score_gpt":0.2123957937844073,"score_spread":0.19821205233481715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537366078","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.8336644,0.00082268944,0.0042485315,0.0003031011,0.000544193,0.0005194369,0.0000045344423,0.00058191834,0.15931116],"genre_scores_gemma":[0.99822456,0.000008153886,0.00007762715,0.00012448197,0.00040142008,0.000019024716,0.0000040756718,0.00004414091,0.001096549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987718,0.000029184088,0.0003523645,0.00027151877,0.00029944582,0.0002756753],"domain_scores_gemma":[0.9992135,0.000058906036,0.00024745273,0.00033075438,0.00013483613,0.000014507422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003434542,0.000197213,0.00037570525,0.00032939512,0.0001175807,0.00009915223,0.00023822814,0.000044295535,0.00012092258],"category_scores_gemma":[0.000036427948,0.0001619999,0.00009789649,0.0007255475,0.00010309028,0.0008003089,0.000023390468,0.00010869279,0.00017081585],"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.00023244804,0.0003045806,0.015296618,0.0025081953,0.00085280044,0.00013078928,0.00127569,0.3352849,0.008208753,0.6244211,0.0020760184,0.009408089],"study_design_scores_gemma":[0.00765389,0.0002735747,0.00044532726,0.0040713716,0.0020509039,0.00007430663,0.015311276,0.81641865,0.002749055,0.004208098,0.14301561,0.003727962],"about_ca_topic_score_codex":0.0015142923,"about_ca_topic_score_gemma":0.000097724565,"teacher_disagreement_score":0.62021303,"about_ca_system_score_codex":0.000033591983,"about_ca_system_score_gemma":0.0000047087706,"threshold_uncertainty_score":0.6606164},"labels":[],"label_agreement":null},{"id":"W1541967644","doi":"10.1023/a:1019150312811","title":"Overflow and losses in a network queue with a self-similar input","year":2000,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; University of Ottawa","funders":"","keywords":"Computer science; Mathematics","score_opus":0.004166838745077293,"score_gpt":0.18051843837150056,"score_spread":0.17635159962642327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541967644","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.842855,0.012361192,0.12097732,0.0019889686,0.0011561507,0.0015639282,0.0000028428353,0.0017104984,0.017384104],"genre_scores_gemma":[0.99588823,0.000106062405,0.0027203928,0.00027923493,0.0003196842,0.0000559909,6.500665e-7,0.000014084581,0.0006156938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854124,0.00016575215,0.0002664748,0.00041749817,0.00021653116,0.0003925197],"domain_scores_gemma":[0.99928194,0.00013625828,0.00006751058,0.00037486016,0.000034954854,0.00010446974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000382833,0.00018018355,0.00028094448,0.000059764814,0.00010883659,0.0002926009,0.00031735116,0.00008132027,0.000009867603],"category_scores_gemma":[0.000005179775,0.00014923207,0.000024283914,0.000450682,0.00003065953,0.00034694214,0.000034486864,0.00016150805,0.000026628446],"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.00017504166,0.00024004575,0.06782828,0.0002814564,0.0002187828,0.0008250832,0.0043741353,0.4111469,0.00001543165,0.12821947,0.006695953,0.3799794],"study_design_scores_gemma":[0.0012012938,0.00016892907,0.0032179602,0.0005811277,0.000012644061,0.00018941429,0.000039522798,0.96025735,0.0000022796519,0.00021185631,0.033743236,0.00037436257],"about_ca_topic_score_codex":0.00024643046,"about_ca_topic_score_gemma":0.00017664119,"teacher_disagreement_score":0.5491105,"about_ca_system_score_codex":0.00004349054,"about_ca_system_score_gemma":0.00008607049,"threshold_uncertainty_score":0.6085508},"labels":[],"label_agreement":null},{"id":"W1553681817","doi":"10.1023/a:1024420505098","title":"Stability Conditions of the MMAP[K]/G[K]/1/LCFS Preemptive Repeat Queue","year":2003,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain; Ergodic theory; Computer science; Queueing theory; Stability (learning theory); Queue; Mathematical optimization; Applied mathematics; Mathematics; Computer network","score_opus":0.017521673416354393,"score_gpt":0.2273393239317797,"score_spread":0.2098176505154253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553681817","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.8965073,0.00039130592,0.004972006,0.00020985873,0.0015334047,0.001005942,0.000023471914,0.00027251546,0.0950842],"genre_scores_gemma":[0.9983623,0.0000014397298,0.000046251014,0.00013849768,0.000263437,0.00005505179,0.000008835386,0.00003076958,0.00109344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99825984,0.00020366478,0.00055037864,0.00036985503,0.00032969948,0.00028655017],"domain_scores_gemma":[0.9979844,0.00020552016,0.0006101681,0.00087142695,0.00031398772,0.000014514761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012313498,0.0002087724,0.000368214,0.00013192675,0.00034703332,0.00011427054,0.00036095327,0.00008506204,0.0001845091],"category_scores_gemma":[0.0010963758,0.00015707537,0.00021701754,0.0007939655,0.00019653881,0.0007231493,0.00009900736,0.00018334757,0.00008113227],"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.000023140195,0.00012469475,0.04565937,0.0005456108,0.00016267734,0.000006297431,0.00032275074,0.009142824,0.0040062997,0.9391039,0.0008346734,0.00006776771],"study_design_scores_gemma":[0.006222646,0.00014705473,0.037917536,0.005979093,0.003256575,0.00013744537,0.040729526,0.061700918,0.050357245,0.36736292,0.42050868,0.0056803576],"about_ca_topic_score_codex":0.00095211604,"about_ca_topic_score_gemma":0.00012334321,"teacher_disagreement_score":0.571741,"about_ca_system_score_codex":0.00009413699,"about_ca_system_score_gemma":0.00004029735,"threshold_uncertainty_score":0.64053476},"labels":[],"label_agreement":null},{"id":"W1563193306","doi":"10.1023/a:1015733902430","title":"Buffer Overflow Probabilities for a Markov-Modulated Fluid Model","year":2002,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Markov chain; Computer science; Markov process; Upper and lower bounds; Computation; Applied mathematics; Mathematical optimization; Algorithm; Mathematics; Statistics; Mathematical analysis","score_opus":0.02503933709661368,"score_gpt":0.21891681383820277,"score_spread":0.1938774767415891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563193306","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.7873587,0.002106625,0.13700913,0.0012356341,0.002188095,0.0037967437,0.000057875,0.00258073,0.0636665],"genre_scores_gemma":[0.98390216,0.000003946934,0.0006984061,0.00033817964,0.0009929356,0.00020972775,0.000032992077,0.00007407556,0.0137476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837106,0.000025179706,0.0004631524,0.00044761083,0.0002501066,0.00044291382],"domain_scores_gemma":[0.99886984,0.00011086967,0.00023760101,0.0004847905,0.00027906784,0.000017820701],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055821537,0.000270929,0.00040436815,0.0002456703,0.00029030076,0.00036743336,0.00027543431,0.0001087836,0.0001049301],"category_scores_gemma":[0.00033785283,0.0002527783,0.0001707988,0.00042088213,0.00005390597,0.0012114928,0.000080846155,0.000098773926,0.00016717247],"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.00014038637,0.00019850196,0.00095854246,0.0026381572,0.0003126228,0.00001184147,0.00046711808,0.74266744,0.004665924,0.2165369,0.029798806,0.0016037835],"study_design_scores_gemma":[0.00038862796,0.000008194478,0.000009226223,0.00016549052,0.00009413403,0.0000020834832,0.00014812332,0.9659284,0.00003059197,0.011344015,0.021553071,0.00032806376],"about_ca_topic_score_codex":0.00019304262,"about_ca_topic_score_gemma":0.000022397864,"teacher_disagreement_score":0.22326095,"about_ca_system_score_codex":0.00008829222,"about_ca_system_score_gemma":0.000007910394,"threshold_uncertainty_score":0.99999243},"labels":[],"label_agreement":null},{"id":"W1574606017","doi":"10.1023/a:1019113204634","title":"A sufficient condition and a necessary condition for the diffusion approximations of multiclass queueing networks under priority service disciplines","year":2000,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Queueing theory; Computer science; Limit (mathematics); Heavy traffic approximation; Queue; Stability (learning theory); Mathematical optimization; Mathematics; Diffusion; Layered queueing network; Matrix (chemical analysis); Mean value analysis; Applied mathematics; Topology (electrical circuits); Discrete mathematics; Computer network; Combinatorics; Mathematical analysis","score_opus":0.01366989263858857,"score_gpt":0.25586891955800917,"score_spread":0.2421990269194206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574606017","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.85156345,0.0003882754,0.14553852,0.0007257587,0.00026732837,0.0009670195,0.000013396588,0.00013740428,0.00039884468],"genre_scores_gemma":[0.99857324,0.000019605111,0.00012056077,0.00023461178,0.00056307646,0.00014568226,0.00011549857,0.000028715502,0.00019901051],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987304,0.000053950807,0.00046926626,0.0003015047,0.00020592386,0.00023894686],"domain_scores_gemma":[0.9985803,0.00047087055,0.00041250352,0.0002862875,0.00023508935,0.000014971317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007092941,0.00018928933,0.00029296862,0.00012877048,0.00065423123,0.00023497765,0.00017467613,0.000087239874,0.00003352955],"category_scores_gemma":[0.0000707231,0.00014331812,0.00008361965,0.0005367735,0.00009267295,0.00080619147,0.00007245713,0.00011555887,0.000007842725],"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.00011293637,0.00014897287,0.001655475,0.0010747579,0.00012019168,0.0000012221889,0.00049388496,0.9052469,0.0014373088,0.087421715,0.00013698344,0.0021496387],"study_design_scores_gemma":[0.0005522147,0.000008936942,0.0027375144,0.00034451357,0.00021577613,0.0000026607652,0.0019517521,0.99015474,0.00001992221,0.002620382,0.001207196,0.00018437188],"about_ca_topic_score_codex":0.0010908714,"about_ca_topic_score_gemma":0.00031143567,"teacher_disagreement_score":0.14700979,"about_ca_system_score_codex":0.000042280542,"about_ca_system_score_gemma":0.000012923407,"threshold_uncertainty_score":0.5844343},"labels":[],"label_agreement":null},{"id":"W1585114454","doi":"10.1023/a:1019998829007","title":"Bounds on Queues with Delayed Generalized Exponential Arrivals","year":2002,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Mathematics","score_opus":0.020168842380834474,"score_gpt":0.21732453084951517,"score_spread":0.1971556884686807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585114454","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.95321804,0.00056548906,0.004994264,0.00043006762,0.0010369029,0.0004883112,0.0000040876675,0.00088754337,0.038375262],"genre_scores_gemma":[0.9926139,0.0000094008055,0.00014157286,0.0006596043,0.0021665336,0.000071064176,0.000022224023,0.00008432187,0.004231391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802953,0.0000715727,0.0004503377,0.0005050799,0.00048100352,0.00046248751],"domain_scores_gemma":[0.99875575,0.00007521475,0.00042161203,0.0005746559,0.00014510649,0.000027628263],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00045862983,0.000339236,0.00046673988,0.00038043465,0.0003968485,0.00062894536,0.00033516332,0.00009665382,0.00035744786],"category_scores_gemma":[0.00008554663,0.00027599224,0.00013520116,0.00059817353,0.000077441204,0.0009383358,0.00006429882,0.00017260543,0.0009806281],"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.0010992973,0.0006272239,0.004280699,0.0008528403,0.001563159,0.0005505593,0.000807569,0.23941582,0.013077474,0.70634174,0.027259434,0.004124176],"study_design_scores_gemma":[0.005027325,0.00023915475,0.00020250148,0.001427228,0.0009099255,0.000060266855,0.0013650174,0.6585289,0.001079911,0.0064407527,0.3218828,0.0028361562],"about_ca_topic_score_codex":0.0012479421,"about_ca_topic_score_gemma":0.00008992397,"teacher_disagreement_score":0.699901,"about_ca_system_score_codex":0.00007872602,"about_ca_system_score_gemma":0.0000063947555,"threshold_uncertainty_score":0.99996924},"labels":[],"label_agreement":null},{"id":"W1587039046","doi":"10.1023/a:1010947911863","title":"Discrete Time Geo/G/1 Queue with Multiple Adaptive Vacations","year":2001,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":91,"is_retracted":false,"has_abstract":false,"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":"Computer science; Mathematics; Business","score_opus":0.010746301556932469,"score_gpt":0.2103868682623396,"score_spread":0.19964056670540714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587039046","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.6024695,0.0007765549,0.22453195,0.0014990128,0.0009694276,0.0020736826,0.000023069939,0.0025736038,0.16508317],"genre_scores_gemma":[0.990435,0.0000033874337,0.00035861984,0.00021677723,0.0010672087,0.000090645764,0.000047269263,0.00006492447,0.007716142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850166,0.00004466887,0.0003425791,0.00042693169,0.00029249451,0.0003916687],"domain_scores_gemma":[0.9987606,0.00014328182,0.00035636584,0.0004916342,0.00022327935,0.000024837544],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004226395,0.00026291306,0.0003441094,0.00028416686,0.0003939335,0.0002983753,0.0002986928,0.00007327776,0.0001296481],"category_scores_gemma":[0.00013758309,0.00021741918,0.0000912558,0.00085757737,0.0000751382,0.0013985449,0.00008677187,0.00016032477,0.0014037456],"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.0008873951,0.00035992393,0.10178798,0.0005201423,0.001205844,0.00038327166,0.00076226785,0.44033602,0.004894066,0.4395098,0.0058731185,0.0034801613],"study_design_scores_gemma":[0.0014690437,0.00005415412,0.0032582295,0.0008080522,0.0004626533,0.000054025,0.0021132056,0.82972574,0.000059408445,0.004351153,0.15630946,0.0013348613],"about_ca_topic_score_codex":0.002505404,"about_ca_topic_score_gemma":0.00031068933,"teacher_disagreement_score":0.43515864,"about_ca_system_score_codex":0.000082176026,"about_ca_system_score_gemma":0.000020210366,"threshold_uncertainty_score":0.9993738},"labels":[],"label_agreement":null},{"id":"W1593254397","doi":"10.1023/a:1020993322286","title":"Exact Asymptotics for k i -limited Exponential Polling Models","year":2002,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Polling system; Queue; Class (philosophy); Polling; Heuristics; Mathematics; Exponential function; Applied mathematics; Computer science; Discrete mathematics; Combinatorics; Mathematical optimization; Mathematical analysis; Computer network","score_opus":0.1805786110144647,"score_gpt":0.3364654264797178,"score_spread":0.15588681546525307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593254397","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.07236476,0.0012759796,0.90919346,0.00010400545,0.0019083143,0.001101221,0.000032073065,0.00035061827,0.013669547],"genre_scores_gemma":[0.94317895,0.00004250463,0.04804053,0.000046852678,0.0008839718,0.000134594,0.0000068536215,0.000099518606,0.007566193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981333,0.00019947374,0.00057975313,0.00033978483,0.0002900283,0.0004576856],"domain_scores_gemma":[0.9981952,0.0007939092,0.00023958107,0.00049415976,0.00014804947,0.00012915226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010195861,0.0002454791,0.00047176174,0.00013566205,0.00018331378,0.00013127348,0.0002102509,0.00018277802,0.000014034227],"category_scores_gemma":[0.00037556552,0.00022689019,0.00021457254,0.00014015884,0.000024233637,0.00016255928,0.00004090373,0.00013725956,6.220828e-7],"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.000087812616,0.00044861363,0.0001221129,0.0031967764,0.00047349316,0.000044869656,0.0075988383,0.007426014,0.015618399,0.9243665,0.032433104,0.008183506],"study_design_scores_gemma":[0.000957451,0.00009876933,6.6072107e-7,0.00040601598,0.000097538665,0.000029975961,0.00071982853,0.98017794,0.0012291858,0.004763385,0.011081165,0.00043809757],"about_ca_topic_score_codex":0.000067657005,"about_ca_topic_score_gemma":0.0000071886257,"teacher_disagreement_score":0.9727519,"about_ca_system_score_codex":0.00009007084,"about_ca_system_score_gemma":0.0000130660765,"threshold_uncertainty_score":0.92523134},"labels":[],"label_agreement":null},{"id":"W1593591280","doi":"10.1023/a:1019139405059","title":"An analytical solution for a tandem queue with blocking","year":2000,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":70,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Eigenvalues and eigenvectors; Mathematics; Simple (philosophy); Line (geometry); Poisson distribution; Applied mathematics; Combinatorics; Statistics; Physics; Geometry","score_opus":0.016891255627030206,"score_gpt":0.2540141036912759,"score_spread":0.23712284806424572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593591280","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.7792865,0.00020037843,0.19904117,0.00042946954,0.00033932272,0.001014543,0.000004514309,0.0009936753,0.018690445],"genre_scores_gemma":[0.99613124,0.0000014046437,0.0005315371,0.00026686,0.0016534632,0.00007439367,0.000030724277,0.000053234286,0.001257167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985689,0.000032189622,0.00033308988,0.00042214096,0.00024403125,0.00039966326],"domain_scores_gemma":[0.9991872,0.00007129186,0.0001861603,0.0003743483,0.00015626878,0.000024782756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071882136,0.00021233741,0.00033123844,0.00020518994,0.0003806175,0.0004086899,0.00022986693,0.000086522065,0.00011329811],"category_scores_gemma":[0.000055197484,0.00018013758,0.000093092785,0.0005118741,0.000055398392,0.0012004912,0.000016539814,0.00010851275,0.00009463153],"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.00094156514,0.0004561921,0.024077533,0.0010690726,0.00066336,0.00009179632,0.00040362397,0.41888475,0.0025061266,0.5006118,0.001980124,0.048314046],"study_design_scores_gemma":[0.00058380543,0.000041425992,0.00020313036,0.00023977812,0.00022722963,0.000010282264,0.0002321971,0.95732147,0.000018209475,0.001926226,0.038822092,0.0003741481],"about_ca_topic_score_codex":0.0006972777,"about_ca_topic_score_gemma":0.00015368278,"teacher_disagreement_score":0.5384367,"about_ca_system_score_codex":0.00007445413,"about_ca_system_score_gemma":0.000018596313,"threshold_uncertainty_score":0.73457974},"labels":[],"label_agreement":null},{"id":"W1597828655","doi":"10.1023/a:1019106530558","title":"Threshold-based interventions to optimize performance in preemptive priority queues","year":2000,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Preemption; Computer science; Service (business); Queueing theory; Queue; Laplace–Stieltjes transform; Computer network; Mathematics; Operating system","score_opus":0.020956963750579694,"score_gpt":0.26308035138373437,"score_spread":0.24212338763315466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597828655","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.9741035,0.0001995576,0.0023558957,0.00024748003,0.00029953342,0.0006417576,0.0000030121835,0.0003157113,0.02183354],"genre_scores_gemma":[0.9965197,0.000005445033,0.00040644323,0.000314445,0.00042288983,0.00014109345,0.000014737172,0.000037223657,0.0021380386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983513,0.000039329512,0.0005475363,0.00042724726,0.00025062237,0.00038397542],"domain_scores_gemma":[0.99919313,0.000060446553,0.00017864017,0.0004340476,0.000109475346,0.000024233554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008793173,0.00023339197,0.00037675767,0.00048807572,0.00018859227,0.0002719197,0.00036594697,0.00007683691,0.0003538723],"category_scores_gemma":[0.000095622876,0.00023138468,0.00017659989,0.000947629,0.00004267864,0.0011254787,0.0000693782,0.00019535431,0.00075376267],"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.00017436827,0.00017426844,0.03407629,0.0010298477,0.000039433475,0.000021897558,0.00019065475,0.9497208,0.0000986083,0.010444313,0.00023143135,0.003798077],"study_design_scores_gemma":[0.0019908103,0.00009370391,0.019481106,0.0071693943,0.0002060247,0.0000048222414,0.0008537736,0.94009495,0.00020434443,0.0015076014,0.026951088,0.0014423579],"about_ca_topic_score_codex":0.001071555,"about_ca_topic_score_gemma":0.00036657802,"teacher_disagreement_score":0.026719656,"about_ca_system_score_codex":0.00013881142,"about_ca_system_score_gemma":0.000020249918,"threshold_uncertainty_score":0.9688345},"labels":[],"label_agreement":null},{"id":"W1606855494","doi":"10.1023/a:1019110631467","title":"Ergodicity of the BMAP/PH/s/s+K retrial queue with PH-retrial times","year":2000,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University; University of Winnipeg; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Retrial queue; Ergodicity; Ergodic theory; Mathematics; Queueing theory; Queue; Burke's theorem; Queueing system; Applied mathematics; Computer science; Discrete mathematics; Computer network; Pure mathematics; Queue management system; Statistics; Fork–join queue","score_opus":0.00887618401332673,"score_gpt":0.20348233799078214,"score_spread":0.1946061539774554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606855494","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.9389156,0.0003094285,0.00082654034,0.00040292938,0.0016227446,0.00087068847,0.000010377365,0.00034819567,0.05669351],"genre_scores_gemma":[0.9911523,0.000005016667,0.00004532266,0.00018613045,0.0033016433,0.000021432761,0.000010020102,0.00005408189,0.0052240947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99774414,0.00014791613,0.00065851834,0.00043386614,0.0006260227,0.00038951682],"domain_scores_gemma":[0.99818176,0.0001865095,0.0006562715,0.00076122535,0.000193761,0.000020482044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011938335,0.0003035482,0.00060523814,0.00021157032,0.00035362618,0.00023371873,0.00062713964,0.00014213801,0.00065181777],"category_scores_gemma":[0.00034786004,0.00020114334,0.00023629896,0.0013153696,0.00019268974,0.0008023147,0.000103702805,0.00027111178,0.00026821633],"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.010832778,0.0009497891,0.05946642,0.0036228683,0.0027729885,0.00017726872,0.001558653,0.3304301,0.013890041,0.52199095,0.032907356,0.021400804],"study_design_scores_gemma":[0.024253493,0.0003893981,0.0057265656,0.0089882435,0.0045197196,0.00011951953,0.0034382439,0.26555234,0.008001064,0.028918546,0.6440765,0.0060163303],"about_ca_topic_score_codex":0.0031596315,"about_ca_topic_score_gemma":0.00016931233,"teacher_disagreement_score":0.61116916,"about_ca_system_score_codex":0.000076351214,"about_ca_system_score_gemma":0.00005078405,"threshold_uncertainty_score":0.8202387},"labels":[],"label_agreement":null},{"id":"W1608769416","doi":"10.1023/a:1019165221472","title":"On approximating higher order MAPs with MAPs of order two","year":2000,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; Manitoba Beekeepers' Association","funders":"","keywords":"Computer science; Mathematics","score_opus":0.009491983175894652,"score_gpt":0.21984683829162951,"score_spread":0.21035485511573487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608769416","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.59218395,0.00033866108,0.009645846,0.0005267537,0.000876109,0.0011218876,0.000015796964,0.0009492827,0.39434168],"genre_scores_gemma":[0.98758805,0.0000014852177,0.001312484,0.00039938415,0.0007989181,0.000044824807,0.00004642943,0.00008436656,0.009724061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982476,0.00005009699,0.0005256812,0.00040786597,0.00040707758,0.000361654],"domain_scores_gemma":[0.9986561,0.000113051035,0.000452226,0.0005097006,0.00025277998,0.000016148739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058588886,0.00028244572,0.0004758479,0.00025100276,0.00019123254,0.00017755292,0.00027794435,0.00006794597,0.0006793988],"category_scores_gemma":[0.00007903421,0.00022366113,0.00006997352,0.0011949885,0.000077364515,0.00066824356,0.00004342577,0.00017728121,0.00044565214],"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.0003655392,0.00022698077,0.0033710469,0.0013737386,0.0003732255,0.000055464432,0.00021160417,0.396164,0.0006226316,0.5869414,0.0029108464,0.00738347],"study_design_scores_gemma":[0.011775843,0.000332068,0.0006381035,0.009979746,0.0016026311,0.000058577236,0.0033206884,0.29663223,0.00069273694,0.09891631,0.57070583,0.0053452277],"about_ca_topic_score_codex":0.0011232358,"about_ca_topic_score_gemma":0.000038072583,"teacher_disagreement_score":0.567795,"about_ca_system_score_codex":0.000042350413,"about_ca_system_score_gemma":0.000015788837,"threshold_uncertainty_score":0.9120636},"labels":[],"label_agreement":null},{"id":"W1752242982","doi":"10.1023/a:1010952012771","title":"Existence Condition for the Diffusion Approximations of Multiclass Priority Queueing Networks","year":2001,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Semimartingale; Heavy traffic approximation; Queueing theory; Mathematics; Brownian motion; Stability (learning theory); Diffusion; Reflected Brownian motion; Applied mathematics; Computer science; Mathematical optimization; Diffusion process; Discrete mathematics; Physics; Geometric Brownian motion","score_opus":0.02045667733063701,"score_gpt":0.25825566694790636,"score_spread":0.23779898961726936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1752242982","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.37362096,0.00042697784,0.62233806,0.00022027503,0.00066191336,0.0011052735,0.000004146854,0.00020816454,0.0014142041],"genre_scores_gemma":[0.9978889,0.000018697481,0.00044567767,0.00009377755,0.0009863565,0.00013789658,0.00003597295,0.000029152758,0.00036355652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987117,0.000043185057,0.00048136865,0.0002686561,0.00022177925,0.00027329833],"domain_scores_gemma":[0.99822676,0.00048964296,0.0005952582,0.00040123914,0.00027561956,0.00001149324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009725913,0.00017008485,0.00028519542,0.00014129671,0.00052769686,0.00018332204,0.0003001774,0.00008161585,0.000013455606],"category_scores_gemma":[0.00035199767,0.00013032906,0.00014352195,0.00054054044,0.00009442004,0.0007768897,0.00008443515,0.00012363747,0.000012936059],"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.00013840305,0.00017064763,0.028876122,0.0007393374,0.00022201115,0.0000052394107,0.0002822589,0.40447614,0.0026717961,0.5551132,0.0003912227,0.0069136503],"study_design_scores_gemma":[0.0003971303,0.000007376834,0.0019140998,0.00024114194,0.00016051525,0.0000041334015,0.0007220895,0.9883818,0.000023185754,0.0029358317,0.0050299754,0.00018270325],"about_ca_topic_score_codex":0.0012313261,"about_ca_topic_score_gemma":0.00010734351,"teacher_disagreement_score":0.62426794,"about_ca_system_score_codex":0.000053988802,"about_ca_system_score_gemma":0.000011846972,"threshold_uncertainty_score":0.53146654},"labels":[],"label_agreement":null},{"id":"W1919642343","doi":"10.1023/a:1019942711261","title":"The Finite Element Method for Computing the Stationary Distribution of an SRBM in a Hypercube with Applications to Finite Buffer Queueing Networks","year":2002,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Applied mathematics; Brownian motion; Fractional Brownian motion; Stationary distribution; Reflected Brownian motion; Piecewise; Subspace topology; Queueing theory; Algorithm; Mathematical optimization; Computer science; Markov chain; Diffusion process; Mathematical analysis; Geometric Brownian motion","score_opus":0.01804850739439129,"score_gpt":0.2668036029076193,"score_spread":0.248755095513228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1919642343","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.027242158,0.00024052983,0.97022194,0.0005060765,0.0000831334,0.0014341366,0.0000134382935,0.00007526437,0.00018335601],"genre_scores_gemma":[0.9952402,0.0000055532546,0.0032253538,0.00028341595,0.0005248824,0.000469282,0.000121920544,0.000033044602,0.00009632846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984144,0.00013826556,0.0005536969,0.00032129293,0.00023624208,0.000336124],"domain_scores_gemma":[0.9973913,0.0014807123,0.00042728288,0.0004360444,0.00024767718,0.000016994765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019489775,0.00018218132,0.00025806454,0.000117294534,0.00064897456,0.0002335651,0.00035479237,0.000047831487,0.000004360794],"category_scores_gemma":[0.00020273942,0.000118669406,0.0000662849,0.00093992305,0.000046888545,0.0004037342,0.00008130421,0.00014415773,0.000007617747],"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.00004140851,0.00004207907,0.0016414048,0.0000718941,0.00005182892,7.9659014e-7,0.00019811674,0.93021923,0.000031282572,0.05689097,0.00009450288,0.010716466],"study_design_scores_gemma":[0.0002720478,0.000022656694,0.00073451345,0.00015397267,0.00007272627,0.0000014843353,0.0011975082,0.9842708,0.0000071405457,0.0010097232,0.01208926,0.00016818264],"about_ca_topic_score_codex":0.0007478579,"about_ca_topic_score_gemma":0.00030157907,"teacher_disagreement_score":0.9679981,"about_ca_system_score_codex":0.00008238089,"about_ca_system_score_gemma":0.000008903936,"threshold_uncertainty_score":0.4991453},"labels":[],"label_agreement":null},{"id":"W1946123031","doi":"10.1007/s11134-015-9461-y","title":"State-dependent M/G/1 queueing systems","year":2015,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Markovian arrival process; Queueing theory; Markov chain; Queue; Computer science; State (computer science); Markov process; Queueing system; Burke's theorem; Bulk queue; Expression (computer science); Applied mathematics; Mathematics; Algorithm; Queue management system; Fork–join queue; Computer network; Statistics","score_opus":0.025806455490490023,"score_gpt":0.23984586639002742,"score_spread":0.2140394108995374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1946123031","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.7945815,0.006216415,0.052296694,0.000534308,0.014670564,0.0022190572,0.000018576622,0.0039136806,0.1255492],"genre_scores_gemma":[0.9897219,0.000006073378,0.000061273044,0.000241454,0.0027559006,0.00009709143,0.000024910978,0.00012359829,0.0069677937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967213,0.00013585214,0.0008767207,0.0006753908,0.0008672703,0.000723443],"domain_scores_gemma":[0.9977453,0.000118046286,0.0007390017,0.00079932343,0.0005157034,0.00008263084],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002503558,0.00044084789,0.000690084,0.0005564409,0.00030071408,0.0012627514,0.00061146583,0.00013897203,0.000024069399],"category_scores_gemma":[0.00042499785,0.00041385295,0.00015153168,0.0008278385,0.00007098423,0.0020984567,0.00026927952,0.00029733923,0.0018777839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.0001762206,0.0001688604,0.016334135,0.0015474799,0.00045997562,0.00043653868,0.000742446,0.69631076,0.0013556316,0.27056724,0.010417885,0.001482832],"study_design_scores_gemma":[0.0029110794,0.00006460716,0.00021970345,0.0018454752,0.000499891,0.00011106078,0.013408642,0.5840249,0.00015988338,0.012994906,0.3810559,0.0027039296],"about_ca_topic_score_codex":0.010210663,"about_ca_topic_score_gemma":0.00016837548,"teacher_disagreement_score":0.370638,"about_ca_system_score_codex":0.00031733935,"about_ca_system_score_gemma":0.00006643521,"threshold_uncertainty_score":0.9998313},"labels":[],"label_agreement":null},{"id":"W1984895351","doi":"10.1007/s11134-012-9302-1","title":"Analysis of queueing systems with customer interjections","year":2012,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of Waterloo","funders":"","keywords":"Joins; Queueing theory; Queue; Computer science; Join (topology); Variance (accounting); Service (business); Queueing system; Operations research; Mathematics; Computer network; Business; Marketing; Combinatorics","score_opus":0.013810463852252833,"score_gpt":0.2360998558738797,"score_spread":0.22228939202162684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984895351","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.857517,0.0020041456,0.0757357,0.00007773337,0.0026352792,0.0008052314,0.000011270057,0.0008344832,0.060379144],"genre_scores_gemma":[0.9972958,0.000003760958,0.00005846559,0.000060342012,0.0011174795,0.00006785595,0.000030671068,0.0000597475,0.0013058569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978941,0.00008453599,0.0006999782,0.0003519763,0.00043812982,0.0005312768],"domain_scores_gemma":[0.998002,0.00015283513,0.00085396314,0.0006239349,0.0003289612,0.000038303766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011501132,0.00030332545,0.0008280609,0.001745536,0.0002497679,0.000257064,0.0003065305,0.000102831975,0.00006606239],"category_scores_gemma":[0.00010996635,0.000250574,0.00026774846,0.003831144,0.00009186805,0.001947394,0.00010404967,0.00018480746,0.00017906302],"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.00008658935,0.00020374253,0.32127538,0.0009808599,0.005454947,0.00001124647,0.00063849945,0.47483775,0.0010498845,0.1947449,0.00043083922,0.00028533948],"study_design_scores_gemma":[0.0014263565,0.000059563827,0.015850002,0.0023419976,0.02220194,0.00004962692,0.020708803,0.8280708,0.00019744699,0.0001733406,0.106350176,0.0025699502],"about_ca_topic_score_codex":0.006500753,"about_ca_topic_score_gemma":0.0002137366,"teacher_disagreement_score":0.35323304,"about_ca_system_score_codex":0.00012105906,"about_ca_system_score_gemma":0.000016088976,"threshold_uncertainty_score":0.99999464},"labels":[],"label_agreement":null},{"id":"W1993490452","doi":"10.1007/s11134-015-9437-y","title":"Perfect and nearly perfect sampling of work-conserving queues","year":2015,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Queue; Idle; Poisson distribution; Mathematics; Limit (mathematics); Sampling (signal processing); Class (philosophy); Duration (music); Computer science; Service (business); Distribution (mathematics); Discrete mathematics; Mathematical optimization; Applied mathematics; Statistics; Mathematical analysis; Physics; Computer network; Telecommunications","score_opus":0.04313021580250813,"score_gpt":0.2520830480932877,"score_spread":0.20895283229077954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993490452","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.9867595,0.0020652954,0.003824856,0.00010871704,0.0005063582,0.00023819479,0.0000010856949,0.00025665236,0.0062393383],"genre_scores_gemma":[0.9982319,0.0000063192997,0.00042744618,0.00010616036,0.00078078255,0.000016617045,0.0000059085105,0.000049798316,0.00037510163],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848884,0.000075453776,0.00045685173,0.00036963707,0.0002910336,0.00031820507],"domain_scores_gemma":[0.99872214,0.00018573536,0.00041376927,0.0003810009,0.00026321685,0.000034164925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016652768,0.00023785917,0.0004893322,0.0003252127,0.00017448342,0.00035794123,0.00024091262,0.00008937967,0.000014561804],"category_scores_gemma":[0.00063247135,0.00022175405,0.00009807206,0.0006377481,0.00009235177,0.001022896,0.00018733404,0.00015989592,0.00006016321],"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.0006606487,0.00022121183,0.64345574,0.004980024,0.0008821271,0.00009519073,0.004425636,0.10379237,0.010047744,0.21450175,0.002496359,0.0144411735],"study_design_scores_gemma":[0.009747614,0.00045740986,0.027643142,0.017426252,0.0033369162,0.0002058263,0.045645464,0.6722018,0.0019015439,0.03825905,0.17508604,0.008088906],"about_ca_topic_score_codex":0.0029950363,"about_ca_topic_score_gemma":0.000058259408,"teacher_disagreement_score":0.6158126,"about_ca_system_score_codex":0.000054136897,"about_ca_system_score_gemma":0.000027367229,"threshold_uncertainty_score":0.90428674},"labels":[],"label_agreement":null},{"id":"W1997773527","doi":"10.1007/s11134-006-9001-x","title":"Equilibria of a class of transport equations arising in congestion control","year":2006,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Mathematics; Class (philosophy); Applied mathematics; Flow (mathematics); Stochastic differential equation; Differential equation; Mathematical analysis; Computer science","score_opus":0.010797896014051036,"score_gpt":0.22096001357853837,"score_spread":0.21016211756448733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997773527","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.92281115,0.00022315953,0.06971041,0.000098078,0.0002117371,0.00030423346,0.000005429466,0.00007368041,0.006562098],"genre_scores_gemma":[0.9994957,5.6739754e-7,0.00006160974,0.000019838297,0.0002449511,0.000014866031,0.000023256087,0.000018702176,0.00012054985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987124,0.00003892608,0.00070161425,0.00017601869,0.00020248645,0.00016851322],"domain_scores_gemma":[0.9988939,0.00016876186,0.0005793922,0.00020189866,0.00015127215,0.000004754325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007775599,0.000116335315,0.00039299016,0.00039298652,0.000039052506,0.000026120828,0.00012307045,0.000068154615,0.000012387603],"category_scores_gemma":[0.00012368416,0.0001196348,0.00008968599,0.0005882075,0.000056815465,0.00057706155,0.000011545343,0.00007678709,0.0000073347446],"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.000074111296,0.00009668136,0.0720748,0.00058915693,0.000046821795,0.000007951303,0.00005954298,0.4250384,0.036976207,0.46475974,0.000018692504,0.00025788095],"study_design_scores_gemma":[0.0026788798,0.000022498796,0.025214855,0.0016512601,0.00039173165,0.000002162401,0.00073137594,0.94390327,0.00061412103,0.022645485,0.0016467461,0.0004976284],"about_ca_topic_score_codex":0.0065988973,"about_ca_topic_score_gemma":0.00056676165,"teacher_disagreement_score":0.51886487,"about_ca_system_score_codex":0.00003831847,"about_ca_system_score_gemma":0.000017085296,"threshold_uncertainty_score":0.99756026},"labels":[],"label_agreement":null},{"id":"W2000436315","doi":"10.1007/s11134-010-9187-9","title":"Pathwise comparison results for stochastic fluid networks","year":2010,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Monotonic function; Class (philosophy); Mathematics; Moment (physics); Stability (learning theory); Applied mathematics; Fluid queue; Mathematical optimization; Computer science; Queueing theory; Statistics; Mathematical analysis","score_opus":0.01659387192183311,"score_gpt":0.2519396716626834,"score_spread":0.23534579974085026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000436315","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.33835846,0.00033707314,0.6482197,0.00028354896,0.005672627,0.001484419,0.000020344036,0.0009420826,0.0046816943],"genre_scores_gemma":[0.99446815,4.4454464e-7,0.0002944801,0.00015347669,0.0042494503,0.0001062819,0.00010204608,0.00005519528,0.0005704899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983222,0.000020712238,0.0005998724,0.00043151993,0.00020267768,0.0004230411],"domain_scores_gemma":[0.9984481,0.00028124827,0.0004916176,0.0005321632,0.0002230003,0.000023905503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011679893,0.00023700613,0.0004122906,0.0002064397,0.00033799311,0.00038251563,0.00034594498,0.00013992478,0.000010407389],"category_scores_gemma":[0.00067540735,0.00022315363,0.00014291577,0.00037873592,0.00005636146,0.00060044444,0.00008662683,0.00026528444,0.000116480645],"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.00036345306,0.00010465354,0.0017425953,0.00023469717,0.00013924505,0.0000060083285,0.00009903536,0.83087045,0.003171488,0.15028667,0.010183249,0.0027984567],"study_design_scores_gemma":[0.00078088674,0.000011862891,0.00015159161,0.000118144715,0.00012870756,0.0000028978357,0.00017134452,0.9777456,0.000018071485,0.0015868847,0.01893468,0.00034935164],"about_ca_topic_score_codex":0.0004183138,"about_ca_topic_score_gemma":0.00015517144,"teacher_disagreement_score":0.65610963,"about_ca_system_score_codex":0.000026153793,"about_ca_system_score_gemma":0.000011498537,"threshold_uncertainty_score":0.9099941},"labels":[],"label_agreement":null},{"id":"W2000898864","doi":"10.1007/s11134-014-9431-9","title":"Perfect sampling of a single-server queue with periodic Poisson arrivals","year":2014,"lang":"en","type":"article","venue":"Queueing Systems","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queue; Poisson distribution; Combinatorics; Mathematics; Discrete mathematics; Sampling (signal processing); Integer (computer science); Computer science; Statistics; Telecommunications; Computer network","score_opus":0.019959537512878787,"score_gpt":0.22434933218879327,"score_spread":0.20438979467591448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000898864","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.96066153,0.00022123533,0.028928075,0.000110848676,0.0003347249,0.00029357238,0.0000014074478,0.00029600365,0.009152601],"genre_scores_gemma":[0.9979075,0.0000012032832,0.00040430744,0.0001605815,0.0009669143,0.00002442078,0.000012275683,0.00007271747,0.00045007802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981786,0.000085291766,0.00051546027,0.0004388351,0.00039762235,0.00038421238],"domain_scores_gemma":[0.9982982,0.00018527315,0.0006547579,0.0005902291,0.00024850338,0.00002302025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012466811,0.0002923334,0.00060552487,0.00034947923,0.0002285441,0.0002972756,0.00033310382,0.00009211902,0.00005541807],"category_scores_gemma":[0.00037940196,0.00024175951,0.00014609139,0.0006391588,0.00009734361,0.00084223,0.000091306836,0.00014879073,0.00010111193],"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.0006494831,0.0004986894,0.116970316,0.007183878,0.0009230327,0.000046249283,0.0014475393,0.25680503,0.12632866,0.48138887,0.00043901932,0.007319211],"study_design_scores_gemma":[0.011290495,0.0012591614,0.015759826,0.022713704,0.004201175,0.00020730896,0.013559568,0.52150893,0.013274624,0.028489633,0.35831067,0.009424884],"about_ca_topic_score_codex":0.001574518,"about_ca_topic_score_gemma":0.00014274799,"teacher_disagreement_score":0.45289925,"about_ca_system_score_codex":0.00006598082,"about_ca_system_score_gemma":0.000016926017,"threshold_uncertainty_score":0.98586667},"labels":[],"label_agreement":null},{"id":"W2002312196","doi":"10.1007/s11134-013-9348-8","title":"Tail asymptotics of the waiting time and the busy period for the $${{\\varvec{M/G/1/K}}}$$ queues with subexponential service times","year":2013,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China; University of Northern Iowa","keywords":"Queue; Mathematics; Combinatorics; Period (music); Service (business); Laplace transform; Discrete mathematics; Distribution (mathematics); Applied mathematics; Computer science; Mathematical analysis; Physics; Computer network; Economics","score_opus":0.0058658451832179015,"score_gpt":0.17958473665888694,"score_spread":0.17371889147566905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002312196","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.9826469,0.0009432885,0.0026639118,0.008150577,0.00047443534,0.0024624222,0.0000077971445,0.00018222912,0.0024684798],"genre_scores_gemma":[0.9968516,0.000004317197,0.000075843,0.00054003316,0.00079912075,0.00016453328,0.0000062682197,0.000052214637,0.0015060278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985205,0.00011063486,0.00043997407,0.00027988898,0.00032935644,0.0003196442],"domain_scores_gemma":[0.9975684,0.0007259976,0.00065891613,0.0005769226,0.00045827238,0.0000114790455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012024522,0.00024990275,0.0003982215,0.0000701349,0.0008247832,0.00062143203,0.00060249446,0.00006644645,0.00004500802],"category_scores_gemma":[0.00026208122,0.000111858455,0.00012617266,0.00048431012,0.00030831865,0.00066811364,0.00023098392,0.000157452,0.000048582126],"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.0010102955,0.00017921436,0.009766467,0.0037331146,0.0028352484,0.0000055721284,0.0059283455,0.19384442,0.009065246,0.76335883,0.004534468,0.0057387734],"study_design_scores_gemma":[0.0013358236,0.00001386899,0.000456914,0.0005119676,0.0006504304,0.00001327913,0.0060397643,0.9827073,0.00015083665,0.0027837392,0.0050046383,0.00033143826],"about_ca_topic_score_codex":0.0039837654,"about_ca_topic_score_gemma":0.00022067792,"teacher_disagreement_score":0.7888629,"about_ca_system_score_codex":0.000022203318,"about_ca_system_score_gemma":0.000023435612,"threshold_uncertainty_score":0.63436484},"labels":[],"label_agreement":null},{"id":"W2004959361","doi":"10.1007/s11134-014-9417-7","title":"A model for deceased-donor transplant queue waiting times","year":2014,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; Western University; University of Waterloo","funders":"","keywords":"Queue; Queueing theory; Bulk queue; Computer science; Priority queue; Operations research; Operations management; Mathematics; Computer network; Economics","score_opus":0.018435175382557824,"score_gpt":0.2257407653887213,"score_spread":0.20730559000616347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004959361","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.13607605,0.00019352791,0.8491479,0.00037532768,0.00056684203,0.00073235965,0.000014707661,0.00074964575,0.012143646],"genre_scores_gemma":[0.9946321,0.0000018422232,0.0009522913,0.00054394855,0.001843574,0.00014988013,0.000051207135,0.00007876183,0.0017463977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998336,0.000036160247,0.0004885443,0.00045085134,0.00022029609,0.000468159],"domain_scores_gemma":[0.99884164,0.00024470902,0.00034850644,0.00037585676,0.00016378956,0.000025484936],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001175385,0.00027471257,0.0004371015,0.0002552638,0.0003730675,0.00033242445,0.0003251523,0.00009653356,0.000018216953],"category_scores_gemma":[0.0002497278,0.00025708822,0.00020575857,0.00026817468,0.000038201117,0.0008179454,0.000041674983,0.00011431961,0.00012047939],"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.00008648923,0.00004313119,0.0010989007,0.0010257412,0.00010849474,0.0000041870826,0.00016075687,0.37037733,0.002136335,0.6219305,0.0012099737,0.0018181998],"study_design_scores_gemma":[0.00045016492,0.0000067738283,0.000007684526,0.00031521518,0.00016181942,0.0000025873728,0.00013085398,0.9768594,0.00006790373,0.011468613,0.010183345,0.00034564149],"about_ca_topic_score_codex":0.0003616482,"about_ca_topic_score_gemma":0.00011774059,"teacher_disagreement_score":0.85855603,"about_ca_system_score_codex":0.000047841622,"about_ca_system_score_gemma":0.000018113218,"threshold_uncertainty_score":0.99998814},"labels":[],"label_agreement":null},{"id":"W2008178632","doi":"10.1007/s11134-011-9221-6","title":"Geometric tail of queue length of low-priority customers in a nonpreemptive priority MAP/PH/1 queue","year":2011,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Queue; Priority queue; Mathematics; Bulk queue; Computer science; Applied mathematics; Mathematical optimization; Computer network","score_opus":0.018230931090563066,"score_gpt":0.22947057434902424,"score_spread":0.21123964325846117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008178632","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.9808553,0.0006597575,0.0029005255,0.00002361362,0.0008132457,0.00071308744,0.000014194664,0.00016170468,0.013858559],"genre_scores_gemma":[0.99891585,0.00001653238,0.00026416767,0.00003874146,0.0003136867,0.000038920705,0.0000114704235,0.00005742703,0.00034320905],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9968658,0.00016163061,0.0012483828,0.00060627615,0.0005611978,0.0005567038],"domain_scores_gemma":[0.99704343,0.00023130717,0.0014085639,0.0007794948,0.00050081837,0.000036356803],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022603977,0.0003945227,0.0010800483,0.0019751585,0.00010365546,0.000056267574,0.00067600777,0.00022953835,0.00008757392],"category_scores_gemma":[0.0006945712,0.00039436782,0.00026780547,0.0032729015,0.00021306422,0.0013532181,0.00027995912,0.00038439498,0.00011323827],"study_design_candidate":"observational","study_design_consensus":"observational","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.0011460377,0.0020170962,0.70822936,0.013981262,0.0011060908,0.00022715128,0.0058977893,0.01450174,0.009611359,0.23654254,0.00042131764,0.0063182497],"study_design_scores_gemma":[0.027255943,0.0011609058,0.46683243,0.028888496,0.004810196,0.00007788623,0.07900402,0.24074896,0.052204184,0.050337795,0.03295868,0.015720513],"about_ca_topic_score_codex":0.024832772,"about_ca_topic_score_gemma":0.0007078946,"teacher_disagreement_score":0.24139693,"about_ca_system_score_codex":0.00019559558,"about_ca_system_score_gemma":0.00007416707,"threshold_uncertainty_score":0.9998508},"labels":[],"label_agreement":null},{"id":"W2014867777","doi":"10.1023/a:1021856632000","title":"A Two Priority Queue with Crossover Feedback","year":2003,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Waterloo","funders":"","keywords":"Queue; Computer science; Class (philosophy); Service (business); Poisson distribution; Poisson process; Mathematics; Computer network; Statistics; Business","score_opus":0.010261217941404326,"score_gpt":0.23106139085442892,"score_spread":0.2208001729130246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014867777","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.7929136,0.00050702604,0.014767524,0.00013904685,0.001080762,0.000678826,0.0000027467588,0.0007658081,0.18914461],"genre_scores_gemma":[0.99495673,0.0000015958926,0.00039621437,0.00037234896,0.00074879546,0.000036506462,0.00000638536,0.00006286543,0.003418546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99829346,0.00006254567,0.00036063045,0.00046804766,0.00035545597,0.00045986718],"domain_scores_gemma":[0.9987749,0.00007098204,0.00036373807,0.00054716936,0.00021883029,0.000024413583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008263598,0.0002869886,0.0003963471,0.00020181504,0.0003421112,0.0006207436,0.00024808402,0.00007179817,0.00011563056],"category_scores_gemma":[0.00021209022,0.0002375892,0.00009845654,0.0007972484,0.00009060586,0.0013182133,0.000054880908,0.00020112813,0.00059020746],"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.00010747022,0.00008651713,0.023953447,0.00038453203,0.00016512792,0.00008029243,0.000108931854,0.027247982,0.00070677523,0.94617915,0.0006977887,0.00028197514],"study_design_scores_gemma":[0.008381721,0.000077850076,0.0023625654,0.0017406692,0.0008776578,0.00016515056,0.0036267089,0.0422332,0.00089136825,0.0357262,0.90027374,0.0036431479],"about_ca_topic_score_codex":0.0016740429,"about_ca_topic_score_gemma":0.0002580914,"teacher_disagreement_score":0.91045296,"about_ca_system_score_codex":0.0000930988,"about_ca_system_score_gemma":0.00003647666,"threshold_uncertainty_score":0.9688606},"labels":[],"label_agreement":null},{"id":"W2014880775","doi":"10.1007/s11134-005-0615-1","title":"Analytical Distribution of Waiting Time in the M/{iD}/1 Queue","year":2005,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Science Foundation","keywords":"Queue; Burke's theorem; Constant (computer programming); Distribution (mathematics); Integer (computer science); Mathematics; Computer science; Mathematical optimization; Applied mathematics; Fork–join queue; Queue management system; Mathematical analysis; Computer network","score_opus":0.011372635809280662,"score_gpt":0.23223638968305188,"score_spread":0.22086375387377122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014880775","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.9790226,0.0001884771,0.0028421371,0.0011497771,0.000121412224,0.00029359045,0.0000058676274,0.00012286603,0.016253237],"genre_scores_gemma":[0.9983815,9.787371e-7,0.000017460943,0.00018686471,0.000988242,0.000014624574,0.000057951358,0.000015760148,0.0003365939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986437,0.00007882019,0.00050734734,0.00021747894,0.00028803822,0.00026464486],"domain_scores_gemma":[0.9990978,0.00019327566,0.0003052322,0.0003069411,0.00008934491,0.0000074049717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001645772,0.00014191921,0.00028884743,0.00015741367,0.00011146016,0.00013622163,0.00031348618,0.00006396949,0.000043129978],"category_scores_gemma":[0.0003340954,0.00010742414,0.000090279325,0.0007449427,0.00005835977,0.00065277313,0.00005943289,0.00015712468,0.00025053555],"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.000047121506,0.0001624298,0.008207616,0.00034606562,0.000077611876,0.000024271503,0.00025395918,0.1030581,0.0009279976,0.88023067,0.0021271596,0.0045369836],"study_design_scores_gemma":[0.000262196,0.000005670052,0.00088653644,0.00023069639,0.00008498981,0.0000056805675,0.0007352319,0.96024245,0.000042882202,0.0011495237,0.036150385,0.00020377872],"about_ca_topic_score_codex":0.00073103694,"about_ca_topic_score_gemma":0.000048888596,"teacher_disagreement_score":0.8790812,"about_ca_system_score_codex":0.000073873016,"about_ca_system_score_gemma":0.000010185125,"threshold_uncertainty_score":0.4380629},"labels":[],"label_agreement":null},{"id":"W2024733170","doi":"10.1007/s11134-011-9227-0","title":"Tail asymptotics for a generalized two-demand queueing model—a kernel method","year":2011,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queueing theory; Kernel (algebra); Mathematics; Queueing system; Applied mathematics; Computer science; Mathematical optimization; Combinatorics; Statistics","score_opus":0.04635275459403758,"score_gpt":0.282787678364388,"score_spread":0.2364349237703504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024733170","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.05360745,0.00036173308,0.9288614,0.00007401353,0.00078468944,0.00081947533,0.000006955144,0.0006201706,0.014864124],"genre_scores_gemma":[0.93784785,0.0000061291835,0.05589198,0.00064594985,0.0017376035,0.00023595455,0.00003109007,0.00016480988,0.0034386541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974356,0.00009924507,0.00078349595,0.00068289,0.0003322779,0.00066648447],"domain_scores_gemma":[0.99806476,0.0001784814,0.00069304166,0.0006596693,0.00036345053,0.000040615465],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022128369,0.00043103748,0.0007219244,0.00043293627,0.00043652867,0.00035709774,0.0005263879,0.00015397879,0.000048273523],"category_scores_gemma":[0.00032507803,0.00041025522,0.00029628578,0.0005412172,0.00005608492,0.0013237175,0.00018218531,0.00018554233,0.00010923794],"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.00016127173,0.00008114017,0.0010292252,0.0007688865,0.00029976657,0.000017377477,0.00054611394,0.3307405,0.0030415969,0.66156286,0.00085001497,0.0009012583],"study_design_scores_gemma":[0.0010867935,0.000011753476,0.000012973107,0.00020314055,0.0004525441,0.000006223562,0.0003910212,0.9426727,0.00043136827,0.050619464,0.003547815,0.00056415313],"about_ca_topic_score_codex":0.0016446273,"about_ca_topic_score_gemma":0.00010196407,"teacher_disagreement_score":0.8842404,"about_ca_system_score_codex":0.00009959087,"about_ca_system_score_gemma":0.00003546257,"threshold_uncertainty_score":0.99983495},"labels":[],"label_agreement":null},{"id":"W2026226766","doi":"10.1007/s11134-008-9064-y","title":"Approximations for the M/GI/N+GI type call center","year":2008,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Queue; Poisson distribution; Laplace transform; Exponential function; Mathematics; Computer science; Server; Workload; Applied mathematics; Mathematical optimization; Mathematical analysis; Statistics; Computer network","score_opus":0.032543603438621865,"score_gpt":0.24316940184389127,"score_spread":0.2106257984052694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026226766","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.26901394,0.003304064,0.6153734,0.0062669027,0.010925952,0.005695692,0.00004585358,0.0023988935,0.086975366],"genre_scores_gemma":[0.9914179,0.000009429678,0.00024342997,0.000503517,0.0016582668,0.00010440423,0.000031477637,0.00003628031,0.0059953025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99906486,0.00001937866,0.0002732236,0.00021535411,0.00018712918,0.00024003665],"domain_scores_gemma":[0.9990028,0.00017790648,0.00020715123,0.0003596785,0.00024322755,0.000009204725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045270083,0.00013812551,0.00018754757,0.00011936153,0.0006579189,0.00014083316,0.00026849052,0.000054979693,0.00002986398],"category_scores_gemma":[0.00023944928,0.000098203505,0.000108849265,0.000413541,0.00005786755,0.00051798834,0.000060698145,0.000098815595,0.00026102838],"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.00016444885,0.00023268115,0.013897704,0.0011572046,0.0005568159,0.000027155342,0.00082656543,0.07993958,0.0010004007,0.82474303,0.07551667,0.0019377301],"study_design_scores_gemma":[0.0005235324,0.000008913588,0.00038476638,0.00012025841,0.0001267232,0.000017421255,0.00049498404,0.24721417,0.000021610362,0.0024376723,0.7483267,0.00032323055],"about_ca_topic_score_codex":0.0003711297,"about_ca_topic_score_gemma":0.00003558574,"teacher_disagreement_score":0.8223054,"about_ca_system_score_codex":0.00003676558,"about_ca_system_score_gemma":0.000014017783,"threshold_uncertainty_score":0.50602466},"labels":[],"label_agreement":null},{"id":"W2027306393","doi":"10.1007/s11134-009-9142-9","title":"Exact tail asymptotics in a priority queue—characterizations of the preemptive model","year":2009,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Mount Saint Vincent University","funders":"","keywords":"Mathematics; Queue; Poisson distribution; Queueing theory; Applied mathematics; Generating function; Exponential distribution; Exponential function; Computer science; Discrete mathematics; Mathematical analysis; Statistics","score_opus":0.012821262226837455,"score_gpt":0.23087476065904908,"score_spread":0.2180534984322116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027306393","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.966301,0.00008770175,0.023159027,0.00047513354,0.00032200312,0.00060141523,0.0000071161126,0.00013996987,0.008906599],"genre_scores_gemma":[0.9987896,0.0000032638457,0.00011990883,0.00022737784,0.00023090251,0.000012395581,0.000007670795,0.00001829445,0.0005905617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871606,0.00005731074,0.00048162023,0.00025046556,0.0002572013,0.00023736764],"domain_scores_gemma":[0.99881554,0.000056157583,0.00049882784,0.00045796495,0.00016205657,0.000009465499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005461684,0.00017060833,0.0003194861,0.00022053548,0.0001364638,0.00010848011,0.00036066526,0.00008096303,0.0000069758394],"category_scores_gemma":[0.00028423654,0.00013582582,0.0001099772,0.00086502224,0.000049424245,0.00083837303,0.00008542403,0.00017493802,0.000015320597],"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.000045988032,0.00021651854,0.029917344,0.00028082522,0.00005525478,0.00000552093,0.0006791026,0.58798265,0.010552171,0.36933827,0.000093112605,0.00083320343],"study_design_scores_gemma":[0.00039667156,0.000010184149,0.018715197,0.0006117249,0.00009819959,0.0000017023411,0.00038784777,0.96231264,0.00020943918,0.016240243,0.0006986643,0.00031748696],"about_ca_topic_score_codex":0.00037012494,"about_ca_topic_score_gemma":0.00009175715,"teacher_disagreement_score":0.37432995,"about_ca_system_score_codex":0.000082350496,"about_ca_system_score_gemma":0.000037070713,"threshold_uncertainty_score":0.55388165},"labels":[],"label_agreement":null},{"id":"W2028798402","doi":"10.1023/b:ques.0000032798.65858.19","title":"A MAP/G/1 Queue with Negative Customers","year":2004,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Mitacs","keywords":"Markov chain; Burke's theorem; Queue; Bulk queue; Mathematics; Laplace transform; Applied mathematics; Stationary distribution; Computer science; Boundary (topology); Mathematical optimization; Mathematical analysis; Queue management system; Fork–join queue; Statistics; Computer network","score_opus":0.008477706350612917,"score_gpt":0.21112605719643304,"score_spread":0.2026483508458201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028798402","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.7662004,0.00076185947,0.060199857,0.0028052304,0.002550484,0.0020037573,0.000008939257,0.0028045918,0.16266485],"genre_scores_gemma":[0.99681383,0.000001549714,0.00039177394,0.0004950807,0.0009538984,0.000057858484,0.000010248667,0.00006091918,0.0012148169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99855846,0.000023710707,0.0003025035,0.00040284696,0.00032499502,0.00038749352],"domain_scores_gemma":[0.9990204,0.0000563198,0.0003393587,0.0003788115,0.0001833942,0.000021714555],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003945309,0.00026294246,0.00034740084,0.00032948822,0.0002695903,0.0003154653,0.0002686417,0.00007059353,0.00004006372],"category_scores_gemma":[0.000079580896,0.00021347383,0.00008463802,0.0006988095,0.00010481634,0.001269285,0.00006945068,0.00017970106,0.0011613532],"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.0001463585,0.00008546024,0.0019996983,0.0005247716,0.00027922128,0.00018440906,0.0004793323,0.33268812,0.0006242833,0.6619358,0.0004875752,0.0005649464],"study_design_scores_gemma":[0.019265391,0.00038379867,0.0021933124,0.010013751,0.0025872963,0.00025606187,0.044424575,0.072986014,0.0028057913,0.17758016,0.65800804,0.009495818],"about_ca_topic_score_codex":0.0037852526,"about_ca_topic_score_gemma":0.00029450757,"teacher_disagreement_score":0.6575205,"about_ca_system_score_codex":0.000159423,"about_ca_system_score_gemma":0.000036937214,"threshold_uncertainty_score":0.9996164},"labels":[],"label_agreement":null},{"id":"W2032400268","doi":"10.1007/s11134-005-3749-2","title":"Proof of Monotone Loss Rate of Fluid Priority-Queue with Finite Buffer","year":2005,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Queueing theory; Fluid queue; Computer science; Monotone polygon; Queue; Mathematics; Computer network","score_opus":0.008889409263705112,"score_gpt":0.21831244655032703,"score_spread":0.20942303728662193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032400268","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.93756926,0.0004661703,0.05552711,0.00027626954,0.00032225583,0.000713642,0.0000069648677,0.00017101206,0.004947295],"genre_scores_gemma":[0.99722344,0.0000036096692,0.0006958592,0.00010636819,0.00094787544,0.0000339695,0.000011714097,0.000048822774,0.000928363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983802,0.00006240122,0.0006615484,0.00033373997,0.00027039196,0.00029174582],"domain_scores_gemma":[0.998148,0.00014038642,0.0007860075,0.0005307029,0.0003783241,0.000016574459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097351824,0.00024345073,0.0005998314,0.00032460582,0.000093201685,0.00007017336,0.00030357612,0.00008447193,0.000039248844],"category_scores_gemma":[0.00016912498,0.00020167089,0.00010963669,0.0006945098,0.00012490033,0.0009655462,0.000091862996,0.00013381027,0.000039866944],"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.00071096304,0.0004251494,0.01777024,0.004197247,0.00065329706,0.000048964597,0.0005944593,0.77845675,0.019557122,0.17386311,0.00042830076,0.003294426],"study_design_scores_gemma":[0.0044708704,0.00021189118,0.0015080746,0.004615644,0.0011694115,0.000023427641,0.0012655356,0.84299105,0.049884487,0.007890339,0.08389825,0.0020709932],"about_ca_topic_score_codex":0.000780846,"about_ca_topic_score_gemma":0.00008215861,"teacher_disagreement_score":0.16597277,"about_ca_system_score_codex":0.00004535906,"about_ca_system_score_gemma":0.000028630702,"threshold_uncertainty_score":0.82239},"labels":[],"label_agreement":null},{"id":"W2037342652","doi":"10.1007/s11134-011-9258-6","title":"Dynamic server allocation for unstable queueing networks with flexible servers","year":2011,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Throughput; Computer science; Server; Queueing theory; Layered queueing network; Mathematical optimization; Computer network; Real-time computing; Distributed computing; Mathematics; Wireless; Telecommunications","score_opus":0.018973961361943285,"score_gpt":0.2165737138524776,"score_spread":0.1975997524905343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037342652","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.2603448,0.00060491334,0.7152056,0.00014449513,0.0013678786,0.0017107176,0.0000036126307,0.0013976982,0.019220255],"genre_scores_gemma":[0.9946168,0.000005048823,0.001615463,0.00026180936,0.00041261205,0.00016765954,0.0000638419,0.00010050933,0.0027562447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982986,0.00003308835,0.00042377968,0.0004917035,0.0002301679,0.00052268617],"domain_scores_gemma":[0.9986101,0.00007018378,0.00048078143,0.00050541095,0.00030861926,0.00002494098],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008983808,0.00029885548,0.0003815477,0.0002763029,0.00038501265,0.00028737893,0.00034429878,0.00011760624,0.000049289654],"category_scores_gemma":[0.000052504627,0.000268159,0.00011500986,0.00075596076,0.0000521057,0.002004938,0.00007520164,0.00014216118,0.00006940111],"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.0004366771,0.00011514491,0.013351401,0.0013976782,0.00043675414,0.000018930266,0.0003596238,0.7071667,0.0003449885,0.27471438,0.00053905183,0.0011187048],"study_design_scores_gemma":[0.0009459064,0.000041456795,0.0007194254,0.00071976107,0.00034515146,0.0000067411684,0.001553566,0.9813622,0.00009142414,0.0035306953,0.009956657,0.000727005],"about_ca_topic_score_codex":0.003493912,"about_ca_topic_score_gemma":0.0006212979,"teacher_disagreement_score":0.734272,"about_ca_system_score_codex":0.00013105867,"about_ca_system_score_gemma":0.000027090957,"threshold_uncertainty_score":0.99997705},"labels":[],"label_agreement":null},{"id":"W2040707019","doi":"10.1007/s11134-005-6971-z","title":"Balancing Queues by Mean Field Interaction","year":2005,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Queueing theory; Queue; Limiting; Mathematics; Infinity; Field (mathematics); Mean field theory; Computer science; Discrete mathematics; Computer network; Physics; Statistics; Mathematical analysis; Pure mathematics; Engineering","score_opus":0.008403665087546397,"score_gpt":0.23629896009541687,"score_spread":0.22789529500787048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040707019","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.84177476,0.0014456308,0.033929374,0.0032169935,0.0031444037,0.0005632272,0.0000035253047,0.0017097552,0.11421232],"genre_scores_gemma":[0.99359715,0.000005402646,0.00007870829,0.0012823499,0.0026858894,0.00002081455,0.000018233017,0.000035381738,0.0022760888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988159,0.000029612309,0.00036551137,0.00030113824,0.00021157484,0.000276289],"domain_scores_gemma":[0.99919134,0.00011853713,0.0002962544,0.00028836587,0.00009131865,0.0000141788605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049365096,0.00018304454,0.000249609,0.00019898283,0.00020120696,0.0003578839,0.00020979226,0.00007596654,0.0001453797],"category_scores_gemma":[0.00016112461,0.00017647976,0.00009107177,0.00030094187,0.00001594385,0.0017710727,0.00006806108,0.00017331497,0.00063493644],"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.0003954691,0.00048771995,0.02342242,0.0021546076,0.00085463823,0.00007501247,0.001993611,0.16121092,0.063469455,0.33794406,0.30554983,0.10244224],"study_design_scores_gemma":[0.0005067924,0.000014732336,0.00003366929,0.0005017326,0.00011778757,0.00001001971,0.0018775279,0.22291377,0.002328789,0.0010972089,0.76998204,0.0006159376],"about_ca_topic_score_codex":0.0020301752,"about_ca_topic_score_gemma":0.00026697735,"teacher_disagreement_score":0.46443218,"about_ca_system_score_codex":0.000099382276,"about_ca_system_score_gemma":0.0000056674044,"threshold_uncertainty_score":0.81610346},"labels":[],"label_agreement":null},{"id":"W2045553848","doi":"10.1007/s11134-007-9056-3","title":"Existence and characterization of product-form invariant distributions for state-dependent stochastic networks in the heavy-traffic diffusion limit","year":2007,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Orthant; Mathematics; Martingale (probability theory); Ergodic theory; Jump; Mathematical analysis; Stationary distribution; Jump diffusion; Jump process; Central limit theorem; Local martingale; Bounded function; Statistical physics; Applied mathematics; Markov chain; Physics; Quantum mechanics","score_opus":0.013931429311915215,"score_gpt":0.22820696400411292,"score_spread":0.2142755346921977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045553848","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.6920143,0.00008001896,0.30684623,0.00011021005,0.00019636592,0.0006714452,0.0000073215256,0.00003817456,0.000035949586],"genre_scores_gemma":[0.9992568,0.0000069016805,0.000039116647,0.00005477306,0.000394714,0.00006106397,0.00011267215,0.000017397186,0.000056543708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987613,0.000031099727,0.00048553513,0.00026053097,0.0001877208,0.00027379606],"domain_scores_gemma":[0.99900144,0.00019560217,0.00040800803,0.00025064702,0.00013353524,0.000010765124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019350421,0.00014272238,0.00023756735,0.00017354995,0.00021361098,0.00014445465,0.00018136564,0.000043720906,0.0000014960403],"category_scores_gemma":[0.00020728343,0.0001091752,0.000042337462,0.00049081485,0.000054428005,0.0004995089,0.0000602257,0.00010956319,0.0000018884143],"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.0016145374,0.0010965163,0.01172081,0.0034787452,0.00024542262,0.000053366686,0.004461982,0.41641277,0.035330344,0.49216616,0.00007224526,0.03334709],"study_design_scores_gemma":[0.0010516298,0.000055756387,0.021116085,0.0010017855,0.00019177033,0.000017070533,0.0020631168,0.9698021,0.00015804358,0.0031493763,0.00085516606,0.0005381385],"about_ca_topic_score_codex":0.00020484038,"about_ca_topic_score_gemma":0.00022829123,"teacher_disagreement_score":0.5533893,"about_ca_system_score_codex":0.000050410883,"about_ca_system_score_gemma":0.000010040477,"threshold_uncertainty_score":0.44520354},"labels":[],"label_agreement":null},{"id":"W2047840281","doi":"10.1007/s11134-013-9382-6","title":"Waiting time distributions in the accumulating priority queue","year":2013,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":93,"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":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; University of Toronto; University of Auckland","keywords":"Priority queue; Computer science; Queue; Priority inheritance; Queueing theory; Multilevel queue; Bulk queue; Service (business); Class (philosophy); Operations research; Task (project management); Queue management system; Point (geometry); Priority ceiling protocol; Fork–join queue; Process (computing); Computer network; Real-time computing; Mathematical optimization; Quality of service; Mathematics; Business; Dynamic priority scheduling; Operating system; Engineering; Artificial intelligence","score_opus":0.06169002521522753,"score_gpt":0.4073437930204038,"score_spread":0.34565376780517626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047840281","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.97098404,0.00014933426,0.008287252,0.004972775,0.0006452932,0.0027231376,0.000020394074,0.00018078154,0.0120370025],"genre_scores_gemma":[0.9970108,0.0000036342224,0.0005909688,0.00027632047,0.00044751074,0.0005879305,0.00008628166,0.000018111152,0.000978439],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966106,0.0016624943,0.00079650956,0.00022408669,0.00021969478,0.00048663857],"domain_scores_gemma":[0.9981746,0.0009287178,0.00020839987,0.0003398536,0.00027279553,0.000075614545],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002250173,0.00012694122,0.00021999647,0.00007582099,0.0015277106,0.00011732413,0.0001926034,0.0001905995,0.000163674],"category_scores_gemma":[0.00075657916,0.0000909292,0.000036184476,0.00041721194,0.000021486523,0.0003066048,0.00003111117,0.00065345026,0.0008268217],"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.000022420843,0.00043484225,0.4359939,0.0025134885,0.000087833,0.000034588393,0.12491072,0.09927485,0.0069476785,0.29268903,0.026327912,0.010762734],"study_design_scores_gemma":[0.0003712907,0.000025987836,0.01949132,0.00084215275,0.0000075275225,0.0000056780164,0.014848842,0.95989025,0.0000049804717,0.00015197467,0.0041460507,0.00021394494],"about_ca_topic_score_codex":0.015990285,"about_ca_topic_score_gemma":0.00023284409,"teacher_disagreement_score":0.8606154,"about_ca_system_score_codex":0.00023905614,"about_ca_system_score_gemma":0.00025972206,"threshold_uncertainty_score":0.9999511},"labels":[],"label_agreement":null},{"id":"W2052677528","doi":"10.1007/s11134-011-9256-8","title":"Heavy traffic approximation for the stationary distribution of stochastic fluid networks","year":2011,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stationary distribution; Reflected Brownian motion; Queue; Limit (mathematics); Monotonic function; Mathematics; Brownian motion; Statistical physics; Heavy traffic approximation; Path (computing); Stationary state; Distribution (mathematics); Stationary process; Applied mathematics; Fluid queue; Mathematical optimization; Queueing theory; Computer science; Markov chain; Mathematical analysis; Geometric Brownian motion; Physics; Diffusion process; Statistics","score_opus":0.023501384448951026,"score_gpt":0.22341896406826395,"score_spread":0.19991757961931292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052677528","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.08024826,0.00032593103,0.9181503,0.000035352772,0.00037515006,0.0006272042,0.000009429561,0.00010203077,0.0001263157],"genre_scores_gemma":[0.998898,0.0000014971953,0.00012038011,0.000032249696,0.0005346753,0.00013000166,0.00020071032,0.0000202121,0.000062274026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913716,0.000024351288,0.00035235134,0.0001697051,0.00014447546,0.00017197347],"domain_scores_gemma":[0.9989864,0.00020272587,0.0003798556,0.0002232255,0.00020142361,0.0000063289494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007181467,0.000115809235,0.00018024082,0.000071634015,0.00022458601,0.000056411172,0.00017330957,0.000048894744,0.000010255679],"category_scores_gemma":[0.0001561022,0.00008873553,0.00008840755,0.0003187012,0.000052970718,0.0005042345,0.000027740196,0.00005820762,0.0000098779865],"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.0001108068,0.00004072602,0.00012707766,0.00017768564,0.00008124677,2.770601e-7,0.00011526312,0.84849226,0.000040868614,0.14804906,0.0003749032,0.002389831],"study_design_scores_gemma":[0.00019779337,0.000010762031,0.0005043257,0.00008859658,0.0001463908,0.0000011480706,0.00047570834,0.99633217,0.000010485677,0.0018575739,0.00026174082,0.000113316775],"about_ca_topic_score_codex":0.00020775433,"about_ca_topic_score_gemma":0.000009616007,"teacher_disagreement_score":0.91864973,"about_ca_system_score_codex":0.000034719807,"about_ca_system_score_gemma":0.000008943647,"threshold_uncertainty_score":0.36185297},"labels":[],"label_agreement":null},{"id":"W2053028813","doi":"10.1023/b:ques.0000018028.16682.ef","title":"Vacation models in discrete time","year":2003,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Discrete time and continuous time; Computer science; Mathematics; Statistics","score_opus":0.012633880782040982,"score_gpt":0.21998479401939708,"score_spread":0.2073509132373561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053028813","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.5649545,0.0008340568,0.087626465,0.0003297986,0.0010090341,0.00090985425,0.0000022291822,0.0007175365,0.3436165],"genre_scores_gemma":[0.9963384,0.0000018289743,0.00011853554,0.0001247678,0.0002452715,0.00003131869,0.000011304532,0.000028663248,0.0030998557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898773,0.000051266175,0.0003082361,0.00025389172,0.00016619943,0.00023269902],"domain_scores_gemma":[0.99942666,0.000045699424,0.00018742541,0.0002727919,0.00005926876,0.000008163518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079160015,0.0001351124,0.00021789473,0.00028460324,0.000091269074,0.00016884968,0.00014357985,0.000056501638,0.000055767938],"category_scores_gemma":[0.00013772219,0.00013063768,0.000054040087,0.0005743548,0.000017472492,0.0014046521,0.000028254868,0.00009292954,0.0005542071],"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.000008397586,0.000020676665,0.0015482459,0.00010722758,0.000018368943,0.000008258176,0.00005771363,0.25866732,0.00072631415,0.7384265,0.0002232155,0.00018776502],"study_design_scores_gemma":[0.00042437343,0.0000037125212,0.00014403975,0.00027272484,0.000049338272,0.0000033844453,0.00036088092,0.8826293,0.000058864305,0.09497189,0.020658735,0.00042278296],"about_ca_topic_score_codex":0.0005492769,"about_ca_topic_score_gemma":0.000026368261,"teacher_disagreement_score":0.6434546,"about_ca_system_score_codex":0.00006567127,"about_ca_system_score_gemma":0.000009390238,"threshold_uncertainty_score":0.7123396},"labels":[],"label_agreement":null},{"id":"W2058768269","doi":"10.1023/b:ques.0000027996.28824.89","title":"Mean Waiting Time Approximations in the G/G/1 Queue","year":2004,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of New Brunswick","funders":"National Science Foundation","keywords":"Queue; Renewal theory; Burke's theorem; Poisson distribution; Computer science; Dispersion (optics); Markovian arrival process; Markov chain; Mathematics; Applied mathematics; Algorithm; Statistics; Real-time computing; Queue management system; Fork–join queue; Physics; Computer network","score_opus":0.012977101201529636,"score_gpt":0.21979064358650896,"score_spread":0.20681354238497932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058768269","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.8594115,0.00042384717,0.018925302,0.0032096817,0.000572695,0.0011791241,0.0000030764784,0.00075809826,0.1155167],"genre_scores_gemma":[0.9979682,7.530515e-7,0.00013396617,0.0005726925,0.00088887877,0.000067307294,0.000018913883,0.000030132223,0.00031916396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986647,0.000060126647,0.0004072041,0.00027104476,0.00028398808,0.00031297488],"domain_scores_gemma":[0.99914575,0.0001182058,0.0002591236,0.0003947211,0.00007443642,0.00000777414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014763762,0.00017263497,0.00023700092,0.00029233992,0.00030165128,0.00041282704,0.0004176697,0.000058571484,0.000026236703],"category_scores_gemma":[0.00021858358,0.00013229267,0.00008699129,0.0009442322,0.000045785717,0.0009648224,0.000064440275,0.0001918606,0.0007543574],"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.0000058839073,0.000054733344,0.0003865913,0.0001419429,0.000025469824,0.000027995029,0.00079511444,0.13519484,0.0007060855,0.8621596,0.00013749095,0.0003642207],"study_design_scores_gemma":[0.0025486962,0.000024903044,0.0007732902,0.0020993573,0.00032883053,0.000073273026,0.020172944,0.7420988,0.00017466838,0.18130411,0.048682015,0.0017190909],"about_ca_topic_score_codex":0.0021415986,"about_ca_topic_score_gemma":0.00017613414,"teacher_disagreement_score":0.6808555,"about_ca_system_score_codex":0.00009301431,"about_ca_system_score_gemma":0.000016839163,"threshold_uncertainty_score":0.9695989},"labels":[],"label_agreement":null},{"id":"W2072709938","doi":"10.1023/a:1026097723093","title":"Analysis of Queueing Systems with Synchronous Single Vacation for Some Servers","year":2003,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Western Washington University","keywords":"Server; Idle; Computer science; Computer network; Queueing theory; Queue; Real-time computing; Operating system","score_opus":0.01369276134957893,"score_gpt":0.22043699748518172,"score_spread":0.2067442361356028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072709938","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.8369384,0.0016300465,0.15295044,0.00006653436,0.001085042,0.0015222076,0.000018062457,0.00046499347,0.0053243153],"genre_scores_gemma":[0.99846643,0.0000035042196,0.00025714256,0.00006493098,0.00039237362,0.0001379875,0.0000724828,0.00007078686,0.0005343548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776495,0.00009393733,0.0007672028,0.00053815526,0.00039419,0.0004415892],"domain_scores_gemma":[0.9975426,0.00024460634,0.0011356517,0.00061211217,0.00043862386,0.000026375665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013046174,0.00031976152,0.0008762332,0.0011040239,0.00027760604,0.00033198763,0.0002854766,0.00010302201,0.000015945614],"category_scores_gemma":[0.0002631142,0.00029000876,0.00027681477,0.0022091581,0.00006329858,0.0015127254,0.00003360945,0.000100837504,0.00001881369],"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.000069805435,0.00011860524,0.012704936,0.001599103,0.0022250256,0.000008028247,0.00013369153,0.70866793,0.0019195972,0.2722912,0.00007151395,0.00019054733],"study_design_scores_gemma":[0.0021150196,0.00015651048,0.0008011677,0.0016613147,0.011617582,0.000014883119,0.007473809,0.94860286,0.0009674068,0.0018923575,0.022969715,0.0017273928],"about_ca_topic_score_codex":0.0021979972,"about_ca_topic_score_gemma":0.00017380573,"teacher_disagreement_score":0.27039886,"about_ca_system_score_codex":0.00021263452,"about_ca_system_score_gemma":0.000040209045,"threshold_uncertainty_score":0.9999552},"labels":[],"label_agreement":null},{"id":"W2080176917","doi":"10.1007/s11134-006-7634-4","title":"Decay rate for a PH/M/2 queue with shortest queue discipline","year":2006,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Japan Society for the Promotion of Science","keywords":"Burke's theorem; Fork–join queue; Queue; Mathematics; Bulk queue; Multilevel queue; Combinatorics; Discrete mathematics; Applied mathematics; Computer science; Queue management system; Queueing theory; Statistics; Computer network","score_opus":0.009475817708492512,"score_gpt":0.22340212097842685,"score_spread":0.21392630326993434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080176917","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.5639663,0.0009450358,0.37946334,0.0016408056,0.0016832234,0.0030738476,0.00004321043,0.0019484246,0.047235858],"genre_scores_gemma":[0.99069387,0.0000015617039,0.00045168976,0.00021417039,0.0032931876,0.00029803583,0.00014700188,0.000121555684,0.004778931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783546,0.000044432072,0.00060927286,0.00063207897,0.0002808481,0.0005978885],"domain_scores_gemma":[0.9983195,0.00023738499,0.0005242598,0.0005666538,0.00032760916,0.000024581475],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010893248,0.00040369405,0.0005723679,0.0003469718,0.00046960489,0.00058496266,0.00037414167,0.00010698223,0.000026124804],"category_scores_gemma":[0.000093377486,0.0003236961,0.00016497892,0.0008028779,0.000094482886,0.001213416,0.00009751067,0.00015200599,0.00012137868],"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.00043528414,0.000257485,0.017202346,0.0010530609,0.00028621883,0.00008842708,0.000079512516,0.23783615,0.005419839,0.7317654,0.004706282,0.00087002374],"study_design_scores_gemma":[0.0057520033,0.00017660986,0.0032497065,0.0026648734,0.00162499,0.000051172214,0.0021483765,0.5693327,0.0020930816,0.03888298,0.37010148,0.0039219903],"about_ca_topic_score_codex":0.0030156183,"about_ca_topic_score_gemma":0.0019796405,"teacher_disagreement_score":0.6928824,"about_ca_system_score_codex":0.00010087451,"about_ca_system_score_gemma":0.000034058467,"threshold_uncertainty_score":0.9999215},"labels":[],"label_agreement":null},{"id":"W2083312487","doi":"10.1007/s11134-009-9113-1","title":"Transient solutions for multi-server queues with finite buffers","year":2009,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia; University of Saskatchewan","funders":"","keywords":"Eigenvalues and eigenvectors; Transient (computer programming); Queue; Staffing; Mathematics; Finite difference; Applied mathematics; Finite set; Computer science; Mathematical analysis; Physics; Computer network; Operating system","score_opus":0.038449892640538566,"score_gpt":0.2622355256748267,"score_spread":0.22378563303428817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083312487","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.005708474,0.00044099195,0.99145865,0.00048646773,0.00051482656,0.00053417607,0.000008181722,0.00032470535,0.00052352337],"genre_scores_gemma":[0.97708297,0.0000054834213,0.021251343,0.00016783086,0.00014548538,0.00006502806,0.000004065993,0.000011430917,0.001266342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986968,0.000096434254,0.00024124554,0.00034499605,0.00018762003,0.0004328925],"domain_scores_gemma":[0.99917686,0.00011802854,0.00008758364,0.00042684938,0.000090802285,0.00009987176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005630629,0.00016144721,0.0002088478,0.000087463915,0.00031141317,0.00021442445,0.00047228916,0.000060910323,0.0000020036543],"category_scores_gemma":[0.000021759135,0.00012669511,0.000085581014,0.00022993538,0.00002853509,0.0003889701,0.000022009033,0.00008770967,0.00001719326],"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.000056015528,0.00024179317,0.000048603077,0.0001851051,0.00007172566,0.00003225151,0.0033608177,0.03417527,0.0008246156,0.9501963,0.00085451774,0.009952953],"study_design_scores_gemma":[0.0013028356,0.00048073856,0.00028976548,0.0002812596,0.000020120342,0.000037355487,0.00020426785,0.9845188,0.00040726067,0.0012090149,0.010841262,0.00040727828],"about_ca_topic_score_codex":0.000082976134,"about_ca_topic_score_gemma":0.000017952807,"teacher_disagreement_score":0.9713745,"about_ca_system_score_codex":0.000041291703,"about_ca_system_score_gemma":0.00005412966,"threshold_uncertainty_score":0.5166477},"labels":[],"label_agreement":null},{"id":"W2084350731","doi":"10.1007/s11134-009-9130-0","title":"On the stationary distribution of queue lengths in a multi-class priority queueing system with customer transfers","year":2009,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Natural Science Foundation of China","keywords":"Bulk queue; Layered queueing network; Queueing theory; Mean value analysis; Mathematics; Stationary distribution; Queue; Computer science; Priority queue; Applied mathematics; Mathematical optimization; Computer network; Markov chain; Statistics","score_opus":0.012917563615962092,"score_gpt":0.22963710521200217,"score_spread":0.2167195415960401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084350731","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.95691097,0.000117893476,0.037074033,0.0005321639,0.0002365832,0.0009757019,0.000020473615,0.0002712614,0.003860902],"genre_scores_gemma":[0.999442,0.0000029280543,0.000035049943,0.00014196239,0.00015165575,0.00004807631,0.000046518082,0.000028670043,0.00010316512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803394,0.00015853801,0.0006183689,0.00038916845,0.00045048702,0.00034947993],"domain_scores_gemma":[0.99866724,0.00028648914,0.00040789112,0.0004115162,0.00020986353,0.000017013412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012859674,0.00027915923,0.0004555091,0.00028302532,0.00022735889,0.00012976068,0.0002949199,0.00009911923,0.0000067591777],"category_scores_gemma":[0.00016409693,0.00019829856,0.00010436538,0.0010475359,0.00007794467,0.00076315727,0.000020479882,0.00028304293,0.000038997772],"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.0002822358,0.00019091649,0.0025198273,0.0006964305,0.00008225551,0.00004526955,0.00038585396,0.16782765,0.00082496257,0.8261304,0.000098505785,0.00091572414],"study_design_scores_gemma":[0.003943341,0.00021690431,0.016906796,0.0073593296,0.00037678448,0.000024724737,0.016677983,0.9472335,0.0004898479,0.0019931635,0.003288531,0.0014891219],"about_ca_topic_score_codex":0.0021078247,"about_ca_topic_score_gemma":0.00027241893,"teacher_disagreement_score":0.8241372,"about_ca_system_score_codex":0.0002731571,"about_ca_system_score_gemma":0.00003978754,"threshold_uncertainty_score":0.80863804},"labels":[],"label_agreement":null},{"id":"W2089589086","doi":"10.1007/s11134-012-9322-x","title":"Congestion in large balanced multirate networks","year":2012,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Parameterized complexity; Computer science; Stationary distribution; Scaling; Erlang (programming language); Mathematical optimization; Large deviations theory; Erlang distribution; Limit (mathematics); Mathematics; Markov chain; Exponential distribution; Algorithm","score_opus":0.012772118542963297,"score_gpt":0.2345142388983309,"score_spread":0.2217421203553676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089589086","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.9638143,0.0012007073,0.026840314,0.00006983857,0.0017503347,0.00041757533,0.0000015758816,0.0003839931,0.0055213245],"genre_scores_gemma":[0.997264,0.0000052139058,0.00004320198,0.00025238935,0.0019711526,0.00004023125,0.000030289453,0.000032764878,0.00036070665],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987483,0.00005264264,0.00032853117,0.00020710999,0.00014343661,0.0005199949],"domain_scores_gemma":[0.99936867,0.0000632871,0.00024733084,0.00024306186,0.000060968272,0.00001667098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012612974,0.00016496716,0.00026808176,0.0002236439,0.000115760085,0.00013497563,0.00014752653,0.00009362308,0.0000349622],"category_scores_gemma":[0.00014316905,0.000159179,0.00005624525,0.00055031123,0.000019361945,0.0014498002,0.00007027777,0.00016496766,0.00027193627],"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.00003531698,0.00009763414,0.7453711,0.0001241631,0.00004200816,0.000008109026,0.00008629539,0.14378291,0.0003467407,0.10893079,0.00031713836,0.0008578133],"study_design_scores_gemma":[0.0013028694,0.000005170183,0.093887344,0.00045684038,0.00008781023,0.0000054540824,0.0005774911,0.8850251,0.000018636838,0.000533682,0.017430719,0.00066890544],"about_ca_topic_score_codex":0.0006000657,"about_ca_topic_score_gemma":0.00008824822,"teacher_disagreement_score":0.7412422,"about_ca_system_score_codex":0.000068922345,"about_ca_system_score_gemma":0.0000036474519,"threshold_uncertainty_score":0.6491132},"labels":[],"label_agreement":null},{"id":"W2089905954","doi":"10.1007/s11134-013-9345-y","title":"Optimal assignment of servers to tasks when collaboration is inefficient","year":2013,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Server; Computer science; Computer network; Throughput; Distributed computing; Markov process; Operating system; Mathematics; Wireless","score_opus":0.010348868682632257,"score_gpt":0.22503338013501947,"score_spread":0.2146845114523872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089905954","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.9614335,0.00008404505,0.030688476,0.0013219601,0.00060680805,0.000902846,0.0000054253437,0.00015324143,0.004803704],"genre_scores_gemma":[0.99692225,5.7684053e-7,0.000674494,0.0006096593,0.00035196805,0.00009284403,0.000012783,0.000026497968,0.001308901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986452,0.000030267302,0.00044137653,0.00028627398,0.00035889997,0.00023800806],"domain_scores_gemma":[0.9988349,0.000038183833,0.00036060944,0.0003474271,0.00039636577,0.000022518238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046624505,0.00016449281,0.00028639266,0.0002890285,0.00011392444,0.00029044537,0.00023176841,0.00005752943,0.000258764],"category_scores_gemma":[0.00010345449,0.00015375308,0.00006580095,0.0006700903,0.000024124136,0.00086223497,0.00011377391,0.00006202256,0.0006241428],"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.00004827097,0.0001420731,0.0045551537,0.0006445358,0.00018850957,0.0000056115,0.0017709084,0.89558965,0.022132264,0.039477438,0.034207746,0.0012378551],"study_design_scores_gemma":[0.001571653,0.00013939019,0.0016102586,0.0013599752,0.00040303564,0.000003251317,0.020373339,0.7909292,0.0065548504,0.0023467385,0.17310818,0.0016001173],"about_ca_topic_score_codex":0.0022321867,"about_ca_topic_score_gemma":0.000024637742,"teacher_disagreement_score":0.13890043,"about_ca_system_score_codex":0.00010621956,"about_ca_system_score_gemma":0.000017330924,"threshold_uncertainty_score":0.8022302},"labels":[],"label_agreement":null},{"id":"W2095784707","doi":"10.1007/s11134-006-7419-9","title":"Multi-layered round robin routing for parallel servers","year":2006,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Equal-cost multi-path routing; Distributed computing; Static routing; Scheduling (production processes); Computer network; Queue; Routing (electronic design automation); Mathematical optimization; Mathematics; Routing protocol","score_opus":0.023325071202118422,"score_gpt":0.24419215471556383,"score_spread":0.22086708351344542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095784707","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.30584094,0.00071868964,0.6791576,0.0005823648,0.0022521522,0.0019499231,0.000014106499,0.0015306792,0.007953521],"genre_scores_gemma":[0.9903556,7.9286997e-7,0.0032936628,0.00018149971,0.0019971472,0.00011936314,0.00007564366,0.00007644896,0.0038998057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821836,0.000033346296,0.0005613936,0.00046401922,0.00021348486,0.00050938997],"domain_scores_gemma":[0.99878114,0.00013231415,0.000510237,0.00037360922,0.0001888813,0.000013831556],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008773605,0.000278632,0.00040702504,0.0002310942,0.00044458482,0.0005555142,0.0003131278,0.00010860001,0.000011256438],"category_scores_gemma":[0.00016202881,0.00027687743,0.0002088424,0.00042915333,0.000035361078,0.0011731971,0.00008547274,0.00011424827,0.00014280522],"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.00007562778,0.00010998203,0.0090733245,0.00052900636,0.00013598426,0.000018684854,0.000047942238,0.56405157,0.0051192837,0.41878778,0.0017705171,0.00028031608],"study_design_scores_gemma":[0.0019804968,0.000010801506,0.00056276406,0.00033711977,0.00019096171,0.0000048451893,0.0010226034,0.9451445,0.00008221364,0.0060276696,0.043858044,0.0007779869],"about_ca_topic_score_codex":0.005490124,"about_ca_topic_score_gemma":0.0003734268,"teacher_disagreement_score":0.6845147,"about_ca_system_score_codex":0.00012092656,"about_ca_system_score_gemma":0.000014129353,"threshold_uncertainty_score":0.99996835},"labels":[],"label_agreement":null},{"id":"W2099372980","doi":"10.1023/a:1019166716446","title":"Correction to: On a decomposition for infinite stochastic matrices","year":2000,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Queueing theory; Discrete mathematics; Applied mathematics; Combinatorics; Pure mathematics; Statistics","score_opus":0.01107711568855805,"score_gpt":0.2592340744636843,"score_spread":0.24815695877512625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099372980","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.6875331,0.00014449695,0.27065054,0.00047022666,0.0056585176,0.0018560608,0.000008988664,0.0010579452,0.032620132],"genre_scores_gemma":[0.99399203,8.982619e-7,0.00012661547,0.00057788315,0.0015780153,0.00014906994,0.00002758565,0.00003376934,0.0035141485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990674,0.00001810387,0.00026582048,0.00027442857,0.00015313576,0.00022109984],"domain_scores_gemma":[0.99931747,0.00022851858,0.00015135435,0.00019600573,0.00009217739,0.0000144688875],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003488366,0.00015051778,0.00020194578,0.00033706124,0.00026398833,0.00027990786,0.00012925935,0.000041304218,0.00007704429],"category_scores_gemma":[0.00013922284,0.00014754696,0.00008494307,0.0005097681,0.000010162439,0.0005085479,0.000015152407,0.000072497336,0.0009166835],"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.00031376802,0.00005312749,0.000093160525,0.0001665533,0.000047020058,0.000002735108,0.00007847939,0.9595553,0.0004929995,0.014627305,0.007406696,0.017162826],"study_design_scores_gemma":[0.0006746837,0.00010036704,0.00025819585,0.0012183331,0.00019807353,0.00000786361,0.0003005978,0.90469116,0.00006369972,0.003410694,0.08848114,0.0005952069],"about_ca_topic_score_codex":0.00046962927,"about_ca_topic_score_gemma":0.000031159936,"teacher_disagreement_score":0.30645892,"about_ca_system_score_codex":0.00006849983,"about_ca_system_score_gemma":0.0000067277647,"threshold_uncertainty_score":0.99986124},"labels":[],"label_agreement":null},{"id":"W2111170904","doi":"10.1007/s11134-009-9140-y","title":"Exact asymptotics for the stationary distribution of a Markov chain: a production model","year":2009,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":40,"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 Ottawa","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Markov chain; Limit (mathematics); Rare events; Stationary distribution; Context (archaeology); Large deviations theory; Applied mathematics; Discrete phase-type distribution; Event (particle physics); Distribution (mathematics); Markov process; Statistical physics; Continuous-time Markov chain; Queueing theory; Variable-order Markov model; Mathematical analysis; Markov model; Physics; Statistics","score_opus":0.0433020382424933,"score_gpt":0.31355277586801894,"score_spread":0.27025073762552565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111170904","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.0040980782,0.00020737987,0.993752,0.0004907918,0.00032124252,0.0008499914,0.00014006543,0.000052259045,0.000088184424],"genre_scores_gemma":[0.9887297,0.000011285465,0.010592306,0.000018946455,0.00016178685,0.00008233647,0.00003134738,0.00001333105,0.00035892622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990087,0.000028186865,0.0003731136,0.0001698909,0.00024540143,0.00017470484],"domain_scores_gemma":[0.9985447,0.00071163126,0.00021662816,0.0002231555,0.00027022095,0.000033685243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053216855,0.00010985266,0.00020410761,0.000023650844,0.00012758694,0.000025912861,0.00011106241,0.000059084334,0.000001158146],"category_scores_gemma":[0.0018178638,0.000077677854,0.00005221726,0.00012041323,0.00002050362,0.00006248827,0.000010346832,0.00006994108,8.663804e-7],"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.0000609037,0.000080274986,0.0000018303152,0.00052585435,0.000028521868,4.6109508e-7,0.00032615685,0.0066483733,0.00042030957,0.9858716,0.0023403703,0.003695323],"study_design_scores_gemma":[0.00015658404,0.0001282586,0.000020246664,0.00016454245,0.000057332116,0.000008929627,0.000223047,0.76022375,0.00016929895,0.23867732,0.00008767048,0.00008301198],"about_ca_topic_score_codex":0.0000085868605,"about_ca_topic_score_gemma":0.0000013776049,"teacher_disagreement_score":0.98463166,"about_ca_system_score_codex":0.000060207014,"about_ca_system_score_gemma":0.000062651605,"threshold_uncertainty_score":0.3167611},"labels":[],"label_agreement":null},{"id":"W2118574840","doi":"10.1007/s11134-011-9242-1","title":"Tail behaviour of the area under a random process, with applications to queueing systems, insurance and percolations","year":2011,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Probability and Risk Models","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":"University of Ottawa","funders":"","keywords":"Queueing theory; Layered queueing network; Computer science; G-network; Queue; Percolation theory; Mean value analysis; Process (computing); Workload; Focus (optics); Probability theory; Mathematics; Computer network; Topology (electrical circuits); Statistics; Physics; Operating system; Combinatorics","score_opus":0.11646185658907485,"score_gpt":0.3276070974455677,"score_spread":0.21114524085649286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118574840","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.87732804,0.0009135947,0.11631633,0.00015752963,0.00020967072,0.002391497,0.000051671865,0.00006505473,0.002566625],"genre_scores_gemma":[0.9983996,0.000006469881,0.00033207305,0.000030200501,0.000039415092,0.0006025433,9.319855e-7,0.000016280204,0.00057249476],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.997263,0.00033562814,0.0007998093,0.00052042224,0.00084547396,0.00023566626],"domain_scores_gemma":[0.997503,0.000430575,0.0004279264,0.00089611404,0.00061749027,0.00012492768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020105473,0.00017597922,0.00043448547,0.00015228282,0.00043970556,0.0001899579,0.0006618132,0.00010151708,0.0000058518604],"category_scores_gemma":[0.0002486699,0.00009711445,0.00006075788,0.00093384285,0.00018693494,0.0003795798,0.00009032402,0.00015508762,0.0000120414115],"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.00014895319,0.00020331192,0.88555586,0.0002740001,0.00006130537,0.0000019199417,0.015248809,0.037267454,0.0004094427,0.060065005,0.0001804095,0.00058350014],"study_design_scores_gemma":[0.00508198,0.00049929647,0.8284383,0.0041413256,0.00031375457,0.00036050536,0.059916887,0.058743387,0.00094792,0.03623811,0.003469789,0.0018487469],"about_ca_topic_score_codex":0.0027202137,"about_ca_topic_score_gemma":0.0007648371,"teacher_disagreement_score":0.12107157,"about_ca_system_score_codex":0.000047860027,"about_ca_system_score_gemma":0.00019112586,"threshold_uncertainty_score":0.41121677},"labels":[],"label_agreement":null},{"id":"W2131297116","doi":"10.1007/s11134-010-9201-2","title":"Dynamic control of a single-server system with abandonments","year":2010,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Markov decision process; Computer science; Scheduling (production processes); Abandonment (legal); Mathematical optimization; Markov chain; Operations research; Uniformization (probability theory); Counterexample; Markov process; Mathematics; Markov model; Statistics; Variable-order Markov model","score_opus":0.005396278547896633,"score_gpt":0.19082039171519763,"score_spread":0.185424113167301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131297116","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.9627003,0.00008577137,0.02848393,0.000041743682,0.000778755,0.00044260698,0.0000043842324,0.00028856183,0.0071739545],"genre_scores_gemma":[0.99900395,2.35103e-7,0.000119845856,0.000055662727,0.00028861788,0.000037277077,0.000008406717,0.000050778868,0.00043520777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859184,0.000028015347,0.00043954828,0.00030710752,0.00035079653,0.00028266475],"domain_scores_gemma":[0.9985947,0.00007608509,0.00062839617,0.00050122174,0.00018269909,0.000016907528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060323323,0.00021841921,0.00046409713,0.00023759827,0.00012441979,0.00015484214,0.00028570672,0.000085929576,0.000023330662],"category_scores_gemma":[0.00006674533,0.0001736693,0.00009784539,0.00038779905,0.00007750621,0.0006971805,0.000046878256,0.00016511882,0.000093619376],"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.00088661443,0.00052499457,0.10231395,0.0069930516,0.0014091306,0.00020510297,0.00028700026,0.067923404,0.2738885,0.54394865,0.00015119421,0.001468418],"study_design_scores_gemma":[0.010315022,0.00016513761,0.00565334,0.0044161137,0.0016933692,0.00013471916,0.0037043092,0.9506347,0.001174125,0.0010787979,0.018722676,0.0023076457],"about_ca_topic_score_codex":0.0008034549,"about_ca_topic_score_gemma":0.00026758018,"teacher_disagreement_score":0.88271135,"about_ca_system_score_codex":0.000054444878,"about_ca_system_score_gemma":0.00001178014,"threshold_uncertainty_score":0.7082028},"labels":[],"label_agreement":null},{"id":"W2139290908","doi":"10.1007/s11134-007-9017-x","title":"Time dependent analysis of finite buffer fluid flows and risk models with a dividend barrier","year":2007,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Probability and Risk Models","field":"Decision Sciences","cited_by":74,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Markov chain; Markov process; Fluid queue; Computer science; Set (abstract data type); Flow (mathematics); Matrix (chemical analysis); Applied mathematics; Dividend; Mathematical optimization; Process (computing); Mathematics; Queue; Statistics; Economics","score_opus":0.0478357894454256,"score_gpt":0.30453844767704896,"score_spread":0.25670265823162336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139290908","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.7218581,0.0010348584,0.275388,0.0000150146925,0.00009205614,0.00024261985,0.000075129596,0.000032149685,0.001262103],"genre_scores_gemma":[0.9976362,0.000047827405,0.00071399927,0.00001542761,0.00004564,0.000009603632,0.0000034909972,0.000013757258,0.0015140473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958571,0.00044714686,0.0010725099,0.00067500403,0.0015896492,0.00035855672],"domain_scores_gemma":[0.9957218,0.0022956082,0.00045319612,0.00091885426,0.00039132542,0.000219177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009659465,0.00021053101,0.0008017772,0.0007816128,0.00019789384,0.00021168156,0.0004703356,0.00014848463,0.00006349389],"category_scores_gemma":[0.0007258627,0.00013103218,0.00018114648,0.0014293204,0.00016178946,0.00052287994,0.00013343994,0.0001638003,0.000036784353],"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.00018554769,0.00006198862,0.059505943,0.000031965355,0.0009417096,0.000022595304,0.004129821,0.9299724,0.00076448976,0.0016038485,0.00008019572,0.0026995093],"study_design_scores_gemma":[0.00032650173,0.00008956086,0.003650215,0.000069175185,0.00054673007,0.000008157737,0.00061150256,0.9902006,0.00021913249,0.0038565297,0.00020405851,0.00021783383],"about_ca_topic_score_codex":0.0021612628,"about_ca_topic_score_gemma":0.0017030507,"teacher_disagreement_score":0.27577814,"about_ca_system_score_codex":0.000049316553,"about_ca_system_score_gemma":0.00006501621,"threshold_uncertainty_score":0.5343337},"labels":[],"label_agreement":null},{"id":"W2464850106","doi":"10.1007/s11134-016-9488-8","title":"Choosing among heterogeneous server clouds","year":2016,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Server; Blocking (statistics); Computer science; Stationary distribution; Cloud computing; Poisson process; Load balancing (electrical power); Mathematics; Distributed computing; Poisson distribution; Computer network; Statistics; Operating system; Markov chain","score_opus":0.011809012230126042,"score_gpt":0.21415256460573365,"score_spread":0.2023435523756076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2464850106","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.980192,0.00023077634,0.010582859,0.00017311033,0.0011390833,0.00022439286,0.0000014895342,0.0005847955,0.0068715084],"genre_scores_gemma":[0.9948729,0.000003571217,0.00003394896,0.00024941642,0.002048868,0.000027288053,0.0000037828092,0.00006662074,0.002693598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984108,0.000043571745,0.00040864153,0.00041828584,0.00028885482,0.00042981323],"domain_scores_gemma":[0.99887276,0.00009095077,0.00035503102,0.00052638864,0.00013196314,0.00002292157],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006202382,0.0002434129,0.00032529217,0.00022059417,0.00024722496,0.00032411213,0.00033054265,0.00009483298,0.00013273979],"category_scores_gemma":[0.00016500773,0.00017395246,0.00015358724,0.00039002724,0.00007584338,0.0013960646,0.00014484796,0.0000846735,0.00089494075],"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.00021724161,0.00023065832,0.41932634,0.001683063,0.000994178,0.0005494465,0.0002955841,0.07251037,0.021309577,0.4605314,0.0043745018,0.017977625],"study_design_scores_gemma":[0.009312436,0.00012948024,0.030204514,0.014341366,0.0020207274,0.00023902465,0.0019549653,0.2906118,0.007923161,0.08015026,0.55313957,0.009972695],"about_ca_topic_score_codex":0.00073461945,"about_ca_topic_score_gemma":0.00007920777,"teacher_disagreement_score":0.54876506,"about_ca_system_score_codex":0.00010142537,"about_ca_system_score_gemma":0.000008398233,"threshold_uncertainty_score":0.999883},"labels":[],"label_agreement":null},{"id":"W2605431651","doi":"10.1007/s11134-017-9524-3","title":"Mutual service processes in Euclidean spaces: existence and ergodicity","year":2017,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Academy of Finland","keywords":"Ergodicity; Mathematics; Moment (physics); Point process; Euclidean geometry; Hierarchy; Poisson distribution; Set (abstract data type); Service (business); Property (philosophy); Pure mathematics; Discrete mathematics; Computer science; Statistics; Geometry; Business; Economics","score_opus":0.1230389899774974,"score_gpt":0.35037663164467503,"score_spread":0.22733764166717763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605431651","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.9854982,0.0011993542,0.0004296844,0.0003781831,0.0002540979,0.00027777697,0.000011996151,0.000093849296,0.011856848],"genre_scores_gemma":[0.9973198,0.000073966854,0.00056971,0.000060106395,0.00017081035,0.000035638524,0.0000013872005,0.000021808848,0.0017467821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986454,0.00006133158,0.0004027695,0.0002983976,0.00027279256,0.00031925555],"domain_scores_gemma":[0.9983418,0.00051063974,0.00037303963,0.00048509619,0.00021329951,0.00007612477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009085078,0.00018108224,0.00038982736,0.00015028965,0.00032015817,0.00055777805,0.0003834343,0.000101877486,0.0000066612433],"category_scores_gemma":[0.0029059988,0.0001548299,0.000021471184,0.00024733233,0.00006937296,0.000512137,0.00014673606,0.00014740803,0.000015275507],"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.00014587243,0.00038280888,0.121762045,0.06938586,0.00015268898,0.00028750123,0.049496226,0.000047547106,0.0002281915,0.7545182,0.0013535668,0.0022394778],"study_design_scores_gemma":[0.011939975,0.0013463482,0.043281253,0.045659,0.00043862744,0.0013370124,0.14988787,0.030408977,0.0048523936,0.6314042,0.07170599,0.0077383094],"about_ca_topic_score_codex":0.0052037057,"about_ca_topic_score_gemma":0.0023538093,"teacher_disagreement_score":0.12311397,"about_ca_system_score_codex":0.000039980587,"about_ca_system_score_gemma":0.00009464126,"threshold_uncertainty_score":0.7866481},"labels":[],"label_agreement":null},{"id":"W2801481979","doi":"10.1007/s11134-018-9582-1","title":"The state-dependent M / G / 1 queue with orbit","year":2018,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Queueing theory; Markov chain; Queue; Probabilistic logic; Service (business); Node (physics); Computer network; Bulk queue; State (computer science); Markov process; Retrial queue; Distributed computing; Real-time computing; Queueing system; Algorithm; Mathematics; Engineering; Statistics; Artificial intelligence","score_opus":0.008609727379317943,"score_gpt":0.2149337979784225,"score_spread":0.20632407059910454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801481979","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.85508347,0.001004304,0.03721721,0.0012681368,0.00331396,0.0011868748,0.0000048730635,0.0014831307,0.09943803],"genre_scores_gemma":[0.9891136,0.000005000243,0.000045257497,0.0003160709,0.0020379943,0.000046401852,0.0000037879715,0.000056169254,0.008375718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984434,0.000047112582,0.0003343772,0.00034916218,0.00039515278,0.0004307552],"domain_scores_gemma":[0.99856615,0.00013149266,0.0003541209,0.00059426733,0.0003368469,0.00001711268],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001039853,0.00021791921,0.00023573723,0.00013430697,0.0008207479,0.0008008558,0.0004479756,0.000044756074,0.000043449178],"category_scores_gemma":[0.0001258383,0.00013269825,0.000057549376,0.00053667993,0.00019938995,0.0007669145,0.00012357482,0.0001495118,0.0011009864],"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.0011124937,0.00020121633,0.024061112,0.0008117114,0.0012741627,0.000286388,0.0012189815,0.038158003,0.0033793293,0.8987345,0.013958067,0.016803995],"study_design_scores_gemma":[0.0016496279,0.00014891136,0.0007652019,0.00091381336,0.00038604482,0.00006341337,0.0049918164,0.102691196,0.00096180127,0.027366929,0.85834897,0.0017122993],"about_ca_topic_score_codex":0.0021685355,"about_ca_topic_score_gemma":0.0013557912,"teacher_disagreement_score":0.87136763,"about_ca_system_score_codex":0.00006666292,"about_ca_system_score_gemma":0.00002378397,"threshold_uncertainty_score":0.99967676},"labels":[],"label_agreement":null},{"id":"W3006659292","doi":"10.1007/s11134-021-09714-x","title":"The proportion of the population never hearing a rumour","year":2021,"lang":"en","type":"preprint","venue":"Queueing Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"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":"Limiting; Infinity; Constant (computer programming); Population; Mathematics; Statistics; Demography; Mathematical economics; Sociology; Computer science; Mathematical analysis; Engineering","score_opus":0.01630183490759951,"score_gpt":0.26383871107404366,"score_spread":0.24753687616644415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006659292","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.9758606,0.0007487996,0.019043662,0.00023912,0.0012121231,0.0010342124,0.0000076095853,0.000096006646,0.0017578747],"genre_scores_gemma":[0.99851376,0.0000036973224,0.00009997511,0.000004000325,0.0005602613,0.00010440229,0.00005233119,0.000022447228,0.00063913915],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99840564,0.0002572415,0.00055891054,0.00026202967,0.00034825844,0.00016791657],"domain_scores_gemma":[0.9982152,0.00004730488,0.00074835884,0.0008043664,0.00016414569,0.000020623227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005435648,0.0001667543,0.00032434106,0.000034640987,0.00024530434,0.00023840157,0.0003461938,0.00007567208,0.000010421828],"category_scores_gemma":[0.000010410354,0.000103390346,0.0003140896,0.00016906166,0.000027532102,0.000063930645,0.00050022756,0.00038092106,9.5299265e-7],"study_design_candidate":"observational","study_design_consensus":"observational","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.000008749746,0.00008851916,0.83195996,0.00046237913,0.00075110164,0.0000011898435,0.0005704946,0.047580987,0.0009898777,0.10266238,0.0011430987,0.013781238],"study_design_scores_gemma":[0.00053740665,0.000050410024,0.58565956,0.012614056,0.0011576108,0.0000105303225,0.0035452733,0.33663064,0.0069327233,0.03556034,0.015377717,0.0019237421],"about_ca_topic_score_codex":0.01408082,"about_ca_topic_score_gemma":0.0000964393,"teacher_disagreement_score":0.28904966,"about_ca_system_score_codex":0.0000779421,"about_ca_system_score_gemma":0.000082079285,"threshold_uncertainty_score":0.9924845},"labels":[],"label_agreement":null},{"id":"W3167453940","doi":"10.1007/s11134-021-09706-x","title":"The unobserved waiting customer approximation","year":2021,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Polling; Polling system; Queue; Context (archaeology); Computer science; Queueing theory; Exponential function; Fork–join queue; Applied mathematics; Mathematical optimization; Mathematics; Queue management system; Computer network; Mathematical analysis","score_opus":0.0196602565006794,"score_gpt":0.22655221798353806,"score_spread":0.20689196148285866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167453940","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.7587493,0.0038543427,0.02557986,0.0038005013,0.004974608,0.0008769607,0.0000029955354,0.0016166361,0.20054477],"genre_scores_gemma":[0.9944894,0.0000071531354,0.00008748577,0.0002755398,0.0013776963,0.000038030004,0.000022162623,0.00003335893,0.0036692163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874485,0.0000665155,0.00036638242,0.00026727864,0.00026384613,0.0002911211],"domain_scores_gemma":[0.99878246,0.00019424272,0.0003207391,0.00040748884,0.0002858324,0.000009220993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009909815,0.00014434446,0.00019415446,0.00007859665,0.00070095307,0.00079246797,0.00022403173,0.00005253904,0.000029441411],"category_scores_gemma":[0.00052450993,0.00011056021,0.0001023212,0.0006892409,0.00003900508,0.00079658045,0.000119079545,0.00013455401,0.000489747],"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.000013817812,0.00002634251,0.0018755816,0.000323024,0.00011423764,0.0000367582,0.00008010842,0.01793875,0.0041412953,0.9686534,0.0013478989,0.005448828],"study_design_scores_gemma":[0.00044007425,0.0000025097831,0.00032104907,0.0003922224,0.00017174569,0.000016223943,0.004671504,0.56717014,0.00067732146,0.011183622,0.41441843,0.00053512986],"about_ca_topic_score_codex":0.00022978503,"about_ca_topic_score_gemma":0.000057851197,"teacher_disagreement_score":0.95746976,"about_ca_system_score_codex":0.000051901017,"about_ca_system_score_gemma":0.000018448725,"threshold_uncertainty_score":0.76417863},"labels":[],"label_agreement":null},{"id":"W4210247895","doi":"10.1007/s11134-021-09727-6","title":"The kernel method tail asymptotics analytic approach for stationary probabilities of two-dimensional queueing systems","year":2022,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":false,"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":"Queueing theory; Mathematics; Random walk; Kernel (algebra); Applied mathematics; Statistical physics; Layered queueing network; Discrete mathematics; Statistics; Physics","score_opus":0.021272547729382696,"score_gpt":0.2648443889072882,"score_spread":0.24357184117790548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210247895","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.23609048,0.008963697,0.7256966,0.0009178731,0.005989207,0.008868503,0.00024028537,0.0011959168,0.012037437],"genre_scores_gemma":[0.99122393,0.0000014473377,0.004047418,0.00012028655,0.0007732295,0.0008244389,0.00014154536,0.00008400864,0.0027836903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99674207,0.00036952773,0.0010344646,0.00055511825,0.0008141763,0.00048463358],"domain_scores_gemma":[0.99626964,0.0014395851,0.001129993,0.0006162566,0.00052209373,0.000022402046],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.005053149,0.00030888806,0.0006215208,0.00035185344,0.0014278191,0.00032355063,0.00059521105,0.00005530068,0.000014857616],"category_scores_gemma":[0.00046856332,0.000254878,0.00027143004,0.00086379313,0.00012394678,0.00061690836,0.00034553488,0.000253816,0.000005893739],"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.00006457428,0.000053861004,0.00067142554,0.0007831167,0.00020360683,0.0000019623033,0.0001429049,0.67685795,0.00016574396,0.32044047,0.00041111832,0.00020328915],"study_design_scores_gemma":[0.0005147649,0.00002780723,0.000024171592,0.00009885394,0.0002632907,0.000013365009,0.010004954,0.96918845,0.000014494776,0.011833679,0.007695583,0.000320605],"about_ca_topic_score_codex":0.0018025836,"about_ca_topic_score_gemma":0.000026013815,"teacher_disagreement_score":0.75513345,"about_ca_system_score_codex":0.00021742402,"about_ca_system_score_gemma":0.00010178379,"threshold_uncertainty_score":0.99999034},"labels":[],"label_agreement":null},{"id":"W4220890986","doi":"10.1007/s11134-022-09773-8","title":"Statistical inference for mean-field queueing models","year":2022,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Queueing theory; Statistical inference; Field (mathematics); Inference; Computer science; Econometrics; Statistics; Mathematics; Artificial intelligence","score_opus":0.02795936803819536,"score_gpt":0.2711436432138503,"score_spread":0.24318427517565497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220890986","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.03152108,0.00025501163,0.95121944,0.00036971815,0.001268405,0.0007352181,0.00002944038,0.000502865,0.0140988],"genre_scores_gemma":[0.99604064,0.0000016025255,0.0008892468,0.00088439457,0.0007930909,0.00040747743,0.00005589914,0.000056010253,0.00087163184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981646,0.0000625398,0.00047623686,0.00045090087,0.00040897,0.0004367301],"domain_scores_gemma":[0.9984203,0.0007026352,0.00032407543,0.00038591263,0.000146151,0.0000209211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011499373,0.00021947702,0.00037307007,0.00028161562,0.0007770142,0.00031551413,0.00042683425,0.00005077436,0.00017783455],"category_scores_gemma":[0.00042971014,0.00023090796,0.00011371884,0.00046017327,0.000029686678,0.001032512,0.00031088904,0.0002491846,0.00004502349],"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.000060249324,0.00003089118,0.00032061775,0.00021699283,0.000046232773,0.000012341051,0.000115051866,0.2306389,0.00018842012,0.7657389,0.0014283125,0.0012030682],"study_design_scores_gemma":[0.00038454647,0.00003302504,0.000010281104,0.00007057347,0.00010349551,0.0000042303536,0.0015225848,0.84772927,0.000023195204,0.11145327,0.03826957,0.00039596148],"about_ca_topic_score_codex":0.0019902193,"about_ca_topic_score_gemma":0.00007931476,"teacher_disagreement_score":0.96451956,"about_ca_system_score_codex":0.00012126824,"about_ca_system_score_gemma":0.000034494347,"threshold_uncertainty_score":0.9416153},"labels":[],"label_agreement":null},{"id":"W4241586486","doi":"10.1023/a:1024028722553","title":"Vacation models in discrete time","year":2003,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain; Computer science; Queue; Discrete time and continuous time; Class (philosophy); Service (business); Product (mathematics); Representation (politics); Matrix (chemical analysis); Mathematical optimization; Operations research; Real-time computing; Mathematics; Computer network; Statistics; Artificial intelligence","score_opus":0.012633880782040982,"score_gpt":0.21998479401939708,"score_spread":0.2073509132373561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241586486","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.5649545,0.0008340568,0.087626465,0.0003297986,0.0010090341,0.00090985425,0.0000022291822,0.0007175365,0.3436165],"genre_scores_gemma":[0.9963384,0.0000018289743,0.00011853554,0.0001247678,0.0002452715,0.00003131869,0.000011304532,0.000028663248,0.0030998557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898773,0.000051266175,0.0003082361,0.00025389172,0.00016619943,0.00023269902],"domain_scores_gemma":[0.99942666,0.000045699424,0.00018742541,0.0002727919,0.00005926876,0.000008163518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079160015,0.0001351124,0.00021789473,0.00028460324,0.000091269074,0.00016884968,0.00014357985,0.000056501638,0.000055767938],"category_scores_gemma":[0.00013772219,0.00013063768,0.000054040087,0.0005743548,0.000017472492,0.0014046521,0.000028254868,0.00009292954,0.0005542071],"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.000008397586,0.000020676665,0.0015482459,0.00010722758,0.000018368943,0.000008258176,0.00005771363,0.25866732,0.00072631415,0.7384265,0.0002232155,0.00018776502],"study_design_scores_gemma":[0.00042437343,0.0000037125212,0.00014403975,0.00027272484,0.000049338272,0.0000033844453,0.00036088092,0.8826293,0.000058864305,0.09497189,0.020658735,0.00042278296],"about_ca_topic_score_codex":0.0005492769,"about_ca_topic_score_gemma":0.000026368261,"teacher_disagreement_score":0.6434546,"about_ca_system_score_codex":0.00006567127,"about_ca_system_score_gemma":0.000009390238,"threshold_uncertainty_score":0.7123396},"labels":[],"label_agreement":null},{"id":"W4254380685","doi":"10.1023/a:1011032718715","title":"Perturbation Theory for the Asymptotic Decay Rates in the Queues with Markovian Arrival Process and/or Markovian Service Process","year":2000,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Windsor","funders":"","keywords":"Markovian arrival process; Markov process; Generality; Statistical physics; Applied mathematics; Queue; Mathematics; Sensitivity (control systems); Exponential function; Process (computing); Queueing theory; Computer science; Physics; Mathematical analysis; Statistics; Engineering","score_opus":0.010983940516318168,"score_gpt":0.2500382330015101,"score_spread":0.23905429248519194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254380685","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.9762255,0.0010470061,0.0032497172,0.0041481913,0.00022383156,0.003237167,0.0000066971006,0.00031289586,0.011548979],"genre_scores_gemma":[0.9954437,0.000013043764,0.00002218552,0.001519085,0.0006575105,0.00056392216,0.000018426439,0.00005678991,0.0017053523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983189,0.00015280941,0.00038979066,0.00042662662,0.00032511284,0.000386721],"domain_scores_gemma":[0.9981417,0.00094149075,0.00028192508,0.00038827368,0.00023161434,0.0000150055785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021127542,0.00030282984,0.00031814832,0.00016438539,0.0005879584,0.0006848109,0.00056828605,0.00007927287,0.00007196237],"category_scores_gemma":[0.00018113699,0.00015140684,0.000052053052,0.0010149278,0.00009651595,0.0011639661,0.000025359524,0.00018444192,0.00002243099],"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.012053881,0.00070961687,0.03445306,0.019960886,0.0012601262,0.00012952572,0.029398533,0.43397355,0.00019026869,0.40493315,0.000670847,0.06226654],"study_design_scores_gemma":[0.0033494125,0.00013371417,0.003537256,0.003235812,0.0011243131,0.00011493557,0.07578182,0.82764447,0.00011727158,0.06857372,0.014648962,0.0017383073],"about_ca_topic_score_codex":0.0003214767,"about_ca_topic_score_gemma":0.0008028689,"teacher_disagreement_score":0.39367092,"about_ca_system_score_codex":0.00003631989,"about_ca_system_score_gemma":0.000043717697,"threshold_uncertainty_score":0.66036475},"labels":[],"label_agreement":null},{"id":"W4361219517","doi":"10.1007/s11134-023-09874-y","title":"Refined tail asymptotic properties for the $$M^X/G/1$$ retrial queue","year":2023,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Anhui Provincial Department of Education; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Retrial queue; Queue; Equivalence (formal languages); Mathematics; Queueing system; Discrete mathematics; Applied mathematics; Combinatorics; Computer science; Computer network","score_opus":0.04293434448452829,"score_gpt":0.2437705120846356,"score_spread":0.2008361676001073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361219517","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.78915906,0.0060354257,0.07969261,0.02880626,0.034858633,0.013378683,0.00005116261,0.01399227,0.03402592],"genre_scores_gemma":[0.9853569,0.000007856419,0.000029141436,0.00040193507,0.004618846,0.00037786757,0.00002642786,0.0000767295,0.00910425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982829,0.000048884736,0.0004787411,0.00038780278,0.0003311867,0.00047047815],"domain_scores_gemma":[0.9984206,0.00044542048,0.00033706412,0.0005570793,0.00022695072,0.000012859663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019885667,0.00023623131,0.00035829237,0.00031060172,0.0006995021,0.0005655197,0.0004943645,0.000094128896,0.00002124184],"category_scores_gemma":[0.0015395405,0.00015570651,0.00020087467,0.0012679771,0.00008290258,0.0006855508,0.0001529351,0.00014454924,0.0006979555],"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.0009225306,0.000089007335,0.0019672127,0.0030412225,0.00096216216,0.000046071193,0.00060095853,0.20755737,0.012953567,0.68946975,0.0725332,0.0098569365],"study_design_scores_gemma":[0.0012272941,0.000027174914,0.00022503805,0.0005285931,0.00038086844,0.000004278285,0.0023257209,0.5656057,0.00021780966,0.0066539426,0.4221788,0.00062475004],"about_ca_topic_score_codex":0.0007664122,"about_ca_topic_score_gemma":0.00007423301,"teacher_disagreement_score":0.68281585,"about_ca_system_score_codex":0.00006554628,"about_ca_system_score_gemma":0.000027203056,"threshold_uncertainty_score":0.89710385},"labels":[],"label_agreement":null},{"id":"W4397030266","doi":"10.1007/s11134-024-09909-y","title":"A diffusion model of dynamic participant inflow management","year":2024,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Inflow; Diffusion; Mathematics; Computer science; Mechanics; Physics","score_opus":0.023289687945908494,"score_gpt":0.25355943247937573,"score_spread":0.23026974453346724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4397030266","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.8590531,0.001816278,0.1171039,0.00025137374,0.001220018,0.00060129154,0.00000656676,0.0008342478,0.019113233],"genre_scores_gemma":[0.9966854,0.00001964986,0.00028833316,0.000075452575,0.00019384957,0.000056711095,0.0000111903755,0.000044785196,0.002624615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985992,0.000018881641,0.00046934764,0.0003380544,0.0002937869,0.00028076628],"domain_scores_gemma":[0.9993497,0.000044836026,0.00016008104,0.00037217527,0.000060622115,0.000012593984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005891871,0.00018301132,0.00030553926,0.00042564273,0.000095240255,0.00022901794,0.00022401534,0.000053408,0.000024033545],"category_scores_gemma":[0.00003187535,0.00015893656,0.00013400901,0.00059264514,0.000040433206,0.0006485658,0.00017631096,0.0001052375,0.00018832803],"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.000029872139,0.00006266411,0.00020453989,0.0041004964,0.0002885554,0.000059895523,0.00023654578,0.42208412,0.007911487,0.55894816,0.0003003657,0.005773322],"study_design_scores_gemma":[0.000117423224,0.000003588822,0.000036269306,0.0009278809,0.00025808366,0.0000011268338,0.00036452163,0.98436224,0.00002243226,0.010209132,0.0035147953,0.00018247344],"about_ca_topic_score_codex":0.00019675265,"about_ca_topic_score_gemma":0.00002456328,"teacher_disagreement_score":0.56227815,"about_ca_system_score_codex":0.000057635523,"about_ca_system_score_gemma":0.000009453753,"threshold_uncertainty_score":0.64812446},"labels":[],"label_agreement":null},{"id":"W4413135209","doi":"10.1007/s11134-025-09951-4","title":"Editorial: special issue on reflected Brownian motion","year":2025,"lang":"en","type":"editorial","venue":"Queueing Systems","topic":"Diffusion and Search Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Brownian motion; Mathematical economics; Mathematics; Computer science; Statistical physics; Physics; Statistics","score_opus":0.005783071123816248,"score_gpt":0.28051092454325044,"score_spread":0.2747278534194342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413135209","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011850126,0.00013532472,0.00012661114,0.000043976597,0.96257704,0.00045468804,0.0002619038,0.00006863385,0.036213316],"genre_scores_gemma":[0.00015727621,0.00024376095,0.000016393735,0.00003408281,0.9197986,0.00004870677,0.0032753148,0.00006787942,0.076357976],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969917,0.00032578467,0.00048258845,0.0008043175,0.0009601578,0.0004354692],"domain_scores_gemma":[0.9982458,0.00010587719,0.00023772694,0.0007640993,0.0005050294,0.0001414831],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0005108404,0.0004204579,0.0004735651,0.00019698647,0.00016430505,0.00023538902,0.0005091258,0.0021053872,0.000032587326],"category_scores_gemma":[0.0014058958,0.0004134578,0.00018755169,0.00017883627,0.00005065237,0.0000039776874,0.00016670009,0.00077374635,0.000119389355],"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.0001497559,0.000077519915,0.0000026746802,0.00023719927,0.00007927553,0.0000057249686,0.000024512205,0.000052418978,0.0032955008,0.00010247314,0.99488145,0.0010915094],"study_design_scores_gemma":[0.0005643124,0.00031663207,0.0000020595487,0.00042748122,0.000027392161,7.0943406e-7,0.000029307204,0.00010107237,0.00025365784,0.0000107930055,0.9978936,0.00037304027],"about_ca_topic_score_codex":0.00031670713,"about_ca_topic_score_gemma":0.00013197729,"teacher_disagreement_score":0.042778432,"about_ca_system_score_codex":0.0001641964,"about_ca_system_score_gemma":0.0005457821,"threshold_uncertainty_score":0.99983174},"labels":[],"label_agreement":null}]}