{"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022191104,0.0022180676,0.95031166,0.003153752,0.0014499236,0.00008383334,0.00014159938,0.00052758714,0.019922484],"genre_scores_gemma":[0.7578749,0.0061225556,0.15671025,0.0022384562,0.0029063132,0.00047781496,0.0004942122,0.001165743,0.07200973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875534,0.0006220855,0.000047461523,0.00013254088,0.0003136502,0.00012894478],"domain_scores_gemma":[0.9910749,0.005118487,0.00064735493,0.0007360124,0.0019323057,0.0004909623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003605658,0.001473703,0.0012187423,0.0023536158,0.0010579953,0.002082282,0.0023350583,0.0020179353,0.0062534674],"category_scores_gemma":[0.024422966,0.0006716986,0.001598754,0.0016455498,0.0025498183,0.004073545,0.0023594352,0.004271655,0.0012147947],"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.00006492195,0.000043805856,0.0003398188,0.00015504655,0.000050226823,0.00012274507,0.0001553842,0.07557001,0.0025738997,0.90710485,0.0050420496,0.0087772785],"study_design_scores_gemma":[0.000012390823,0.000013441173,0.00026885653,0.00003282391,0.00001848514,0.00009702152,0.0000288854,0.6678184,0.0005963609,0.3292358,0.0018397802,0.00003779018],"about_ca_topic_score_codex":0.0043201777,"about_ca_topic_score_gemma":0.0016202457,"teacher_disagreement_score":0.0062534674,"about_ca_system_score_codex":0.002542493,"about_ca_system_score_gemma":0.0018866288,"threshold_uncertainty_score":0.020919979},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68180215,0.0008879447,0.2586184,0.010452762,0.002123818,0.00063688087,0.0013292828,0.0015898603,0.04255879],"genre_scores_gemma":[0.92394555,0.00020937638,0.04328777,0.00079558464,0.00043058247,0.00015570366,0.00024770052,0.00008024636,0.03084749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785644,0.0005291406,0.00012798244,0.00035565937,0.00042471322,0.00070610404],"domain_scores_gemma":[0.99599385,0.0014139619,0.000417734,0.0005708489,0.0007200272,0.0008836365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022529445,0.0009701276,0.0012669975,0.001330607,0.0030437706,0.0062111677,0.0030531147,0.0045662913,0.011453837],"category_scores_gemma":[0.007957142,0.0009798188,0.0009359095,0.0014626461,0.0018191767,0.0039975755,0.003592027,0.0023651877,0.0016138171],"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.01248049,0.003324584,0.014411335,0.00051511364,0.00026626058,0.00796106,0.0019285675,0.195696,0.049406156,0.63228065,0.024604032,0.05712582],"study_design_scores_gemma":[0.0007195998,0.0007136819,0.0030445622,0.000050189734,0.00011657239,0.00084229454,0.00036843948,0.8528197,0.017990377,0.116317004,0.0068108123,0.00020676934],"about_ca_topic_score_codex":0.0036964493,"about_ca_topic_score_gemma":0.0027665182,"teacher_disagreement_score":0.011453837,"about_ca_system_score_codex":0.0038500163,"about_ca_system_score_gemma":0.0023363703,"threshold_uncertainty_score":0.038316905},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8967793,0.00025624793,0.1001496,0.00067033735,0.000106994994,0.000054403037,0.000120321565,0.00024324731,0.0016194896],"genre_scores_gemma":[0.9951617,0.00006018916,0.0033029148,0.000056349552,0.00005134097,0.000016144235,0.00004188418,0.000019635232,0.0012897251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906915,0.0002415531,0.00006429818,0.00014293012,0.00024734883,0.00023468686],"domain_scores_gemma":[0.98904604,0.0073497933,0.0012043633,0.00030957142,0.00092970894,0.0011605468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030288526,0.00060287473,0.001098953,0.0013339758,0.0012282055,0.0021337953,0.0018442288,0.0020325514,0.0015150503],"category_scores_gemma":[0.016095147,0.00074422464,0.00057298003,0.0008393036,0.001847171,0.0026205485,0.0016349419,0.0011033313,0.00011162318],"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.0028049108,0.0006865488,0.016371476,0.0001983285,0.00016221995,0.0023111878,0.0011413038,0.8058389,0.020682806,0.13062122,0.0027496296,0.016431555],"study_design_scores_gemma":[0.00003633478,0.000056392826,0.000868509,0.000005148779,0.000025678451,0.00005730143,0.000034918226,0.98953164,0.0007770993,0.00854073,0.000048639347,0.000017612592],"about_ca_topic_score_codex":0.005445978,"about_ca_topic_score_gemma":0.0036940812,"teacher_disagreement_score":0.005445978,"about_ca_system_score_codex":0.0026834093,"about_ca_system_score_gemma":0.001228947,"threshold_uncertainty_score":0.019469619},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3818784,0.001514937,0.5737665,0.0020530315,0.00026584827,0.0002490542,0.00081713765,0.00070681,0.038748197],"genre_scores_gemma":[0.9875799,0.00024219124,0.007087096,0.00010966742,0.00007561839,0.000070856324,0.00014640622,0.000078157,0.004610278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992601,0.00015026599,0.000026776122,0.00014060357,0.00018777231,0.0002343964],"domain_scores_gemma":[0.9964941,0.0013174491,0.00042017605,0.0001523292,0.0013751216,0.0002408547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001551661,0.00060300436,0.0006999009,0.0012267482,0.0012737712,0.0026289707,0.001436473,0.0008862655,0.0052520684],"category_scores_gemma":[0.0075311395,0.00039349025,0.000403717,0.0007051324,0.0014109476,0.0012741454,0.0014429992,0.0012959137,0.0008379386],"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.001006101,0.000128936,0.0029079283,0.000197444,0.00008076754,0.0006637842,0.0010356639,0.46092108,0.030002115,0.46988264,0.009746626,0.023426862],"study_design_scores_gemma":[0.000023744591,0.000029484974,0.00042635438,0.000010402815,0.000009444388,0.000037531172,0.000081871156,0.961802,0.0013327483,0.035843514,0.0003833283,0.000019652281],"about_ca_topic_score_codex":0.02004899,"about_ca_topic_score_gemma":0.006436416,"teacher_disagreement_score":0.02004899,"about_ca_system_score_codex":0.0024272061,"about_ca_system_score_gemma":0.00252994,"threshold_uncertainty_score":0.03986454},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4456198,0.0013504274,0.54014945,0.0026494886,0.00027146522,0.00015600893,0.0004899339,0.0005694042,0.008743985],"genre_scores_gemma":[0.98820156,0.00035539764,0.0076141404,0.0001158091,0.00010050363,0.000051256648,0.00009488098,0.00003793548,0.0034285383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848676,0.0004188243,0.00006224579,0.00024968936,0.00032007805,0.0004623485],"domain_scores_gemma":[0.9886191,0.0086015,0.0011435531,0.00035244325,0.0007449904,0.0005384378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041516083,0.0010864498,0.002113883,0.0015882561,0.0013324795,0.0032696861,0.002507305,0.0034891148,0.0031145094],"category_scores_gemma":[0.02143735,0.0011790853,0.0009295935,0.0013976876,0.0028014318,0.00457778,0.0019454364,0.0021753386,0.0002823012],"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.0003221143,0.00010168811,0.0015290006,0.00008338742,0.000042627675,0.00027277315,0.00022019875,0.8072574,0.002101485,0.18195888,0.0014555311,0.004654924],"study_design_scores_gemma":[0.000012999547,0.000009827398,0.00014565031,0.000004844922,0.000009974496,0.000016649283,0.000009458525,0.985308,0.00013180487,0.014270737,0.00006702083,0.000013058879],"about_ca_topic_score_codex":0.010249371,"about_ca_topic_score_gemma":0.0041080914,"teacher_disagreement_score":0.010249371,"about_ca_system_score_codex":0.0035487742,"about_ca_system_score_gemma":0.002271103,"threshold_uncertainty_score":0.025748253},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05762303,0.0016854651,0.92141354,0.004354892,0.000543161,0.00020620825,0.00072212535,0.00054271414,0.012908873],"genre_scores_gemma":[0.8752149,0.0030865152,0.11020188,0.0011982572,0.0012070161,0.0005553185,0.00085569563,0.00039569117,0.007284829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99485445,0.0013444142,0.00038445243,0.001129009,0.0014706113,0.00081705104],"domain_scores_gemma":[0.9159773,0.06467992,0.004819574,0.0028833414,0.008515756,0.0031241744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008630675,0.0015705625,0.0031942634,0.0024084672,0.002534082,0.004699844,0.004523776,0.0045811865,0.008698201],"category_scores_gemma":[0.08450648,0.0018579954,0.0026697067,0.0019632222,0.004788361,0.011683321,0.005376889,0.010435809,0.0010752974],"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.00047267,0.00021343814,0.0019239545,0.0005379324,0.00012773556,0.0006466884,0.00089112535,0.09758511,0.0110521875,0.8703353,0.004995851,0.01121809],"study_design_scores_gemma":[0.00014223036,0.00006955468,0.0006587877,0.00013019482,0.000064653956,0.0002450504,0.00018014651,0.6625351,0.003416532,0.32973284,0.0027402304,0.00008473781],"about_ca_topic_score_codex":0.006232316,"about_ca_topic_score_gemma":0.0031069932,"teacher_disagreement_score":0.008698201,"about_ca_system_score_codex":0.0050286213,"about_ca_system_score_gemma":0.005916325,"threshold_uncertainty_score":0.045643926},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06503688,0.020077838,0.86206555,0.009367122,0.002137555,0.00019669255,0.00093650987,0.0012072154,0.03897463],"genre_scores_gemma":[0.87258035,0.015410043,0.072710045,0.0033667316,0.0042649875,0.00070378167,0.0011108879,0.0009821284,0.028871099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9893305,0.0028272988,0.0004271798,0.0012900291,0.0034639866,0.0026610673],"domain_scores_gemma":[0.8778398,0.09495259,0.004242608,0.0061288644,0.011382549,0.005453646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023870783,0.006111391,0.005760282,0.009303924,0.0046927943,0.015504863,0.013323719,0.0052773124,0.01425638],"category_scores_gemma":[0.09675454,0.0036873345,0.0024647545,0.009008217,0.0090797115,0.025158174,0.012894604,0.012076008,0.0020005961],"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.00047782567,0.00013787493,0.0007043317,0.00042006373,0.0001209944,0.0001755477,0.0007075454,0.12062261,0.0015831896,0.8527037,0.008539193,0.013807138],"study_design_scores_gemma":[0.000063897445,0.00007341727,0.0004078315,0.00021055293,0.00013150426,0.00008999004,0.00014793716,0.45346352,0.00059333764,0.5414649,0.0032611948,0.0000918956],"about_ca_topic_score_codex":0.011519438,"about_ca_topic_score_gemma":0.00978382,"teacher_disagreement_score":0.023870783,"about_ca_system_score_codex":0.01866523,"about_ca_system_score_gemma":0.007338302,"threshold_uncertainty_score":0.13542634},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4557852,0.0009788113,0.5280692,0.00341219,0.0009642945,0.000250094,0.00095605187,0.0015020173,0.008082197],"genre_scores_gemma":[0.98407483,0.00009950898,0.012052922,0.0002158498,0.00020666243,0.00003600747,0.00011574429,0.000029769337,0.003168635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977685,0.0004420417,0.00007873427,0.0004862542,0.000343136,0.0008812613],"domain_scores_gemma":[0.9957581,0.0017201734,0.0005484572,0.00057357684,0.00072872435,0.000671002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030889004,0.00079217856,0.0018284798,0.0010738238,0.0018576547,0.0033223191,0.0035131474,0.0023138137,0.0039447774],"category_scores_gemma":[0.007529172,0.0007136212,0.0006301164,0.0018136055,0.0019343382,0.0020626797,0.0020363445,0.002017581,0.0006475143],"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.0021693336,0.00038294095,0.009401761,0.00020788446,0.00016527226,0.0014451264,0.00043417758,0.7711257,0.011491934,0.15246403,0.01109757,0.03961437],"study_design_scores_gemma":[0.00007944716,0.00007825529,0.00071106036,0.0000038705552,0.000031169537,0.00009441558,0.000040123945,0.9868934,0.0006972012,0.010857265,0.0004885166,0.00002514597],"about_ca_topic_score_codex":0.013499483,"about_ca_topic_score_gemma":0.014950176,"teacher_disagreement_score":0.013499483,"about_ca_system_score_codex":0.003446158,"about_ca_system_score_gemma":0.0023546338,"threshold_uncertainty_score":0.02684176},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07590324,0.0033644645,0.8975968,0.0020512233,0.00026544026,0.000105210536,0.00037524762,0.0008245285,0.019513842],"genre_scores_gemma":[0.933382,0.002471815,0.048689257,0.00055664364,0.00046476212,0.00027456885,0.0005621673,0.00047022605,0.013128612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783367,0.0008282162,0.00010773174,0.00030782048,0.0005247195,0.00039788414],"domain_scores_gemma":[0.9756968,0.018316913,0.0017223548,0.0018169949,0.0016813689,0.000765534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068622697,0.0013983772,0.0023163678,0.002878169,0.0014220963,0.00359378,0.004990034,0.003255368,0.008099406],"category_scores_gemma":[0.04598431,0.0015562818,0.0015266037,0.002345577,0.0043906854,0.008380351,0.0041565006,0.0043705394,0.0010559855],"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.00012877521,0.00012565115,0.0013896913,0.00025347108,0.00006406833,0.00018542286,0.00030762903,0.38692832,0.0010451989,0.5964632,0.0031587959,0.00994985],"study_design_scores_gemma":[0.0000133766725,0.000007710839,0.00024056861,0.0000366996,0.000013684621,0.00004575683,0.000036981193,0.8440221,0.00018734233,0.15498342,0.00038872263,0.000023623335],"about_ca_topic_score_codex":0.008338578,"about_ca_topic_score_gemma":0.0064143697,"teacher_disagreement_score":0.008338578,"about_ca_system_score_codex":0.00480307,"about_ca_system_score_gemma":0.002666451,"threshold_uncertainty_score":0.0362916},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020769237,0.0012201159,0.959433,0.0012328657,0.0004671055,0.00009816354,0.00014767636,0.00034663442,0.016285164],"genre_scores_gemma":[0.67567426,0.0028568758,0.25708327,0.0009489204,0.00090357393,0.00036192194,0.00031831124,0.0004553586,0.061397597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993356,0.00009347738,0.000021928381,0.0001073828,0.00026094157,0.00018073687],"domain_scores_gemma":[0.9988513,0.00052897254,0.00009557992,0.00004326459,0.0003229119,0.0001579584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016666515,0.0011934009,0.0014989903,0.0012637813,0.0014482656,0.0024804554,0.0027010504,0.0034062606,0.0068931784],"category_scores_gemma":[0.0056569255,0.0010726766,0.001148664,0.0019333693,0.0014039028,0.0022204935,0.00214192,0.002338925,0.001235765],"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.00007262158,0.0000927666,0.00045672397,0.00015620935,0.000035554134,0.00029909404,0.0002104008,0.7453011,0.0037735575,0.22890277,0.0058222455,0.014876936],"study_design_scores_gemma":[0.000011564875,0.000011603055,0.00004498349,0.000011511079,0.000009891028,0.00004724622,0.000023831342,0.9828599,0.0001733472,0.015966827,0.0008288598,0.000010467611],"about_ca_topic_score_codex":0.0118977325,"about_ca_topic_score_gemma":0.00792138,"teacher_disagreement_score":0.0118977325,"about_ca_system_score_codex":0.0033542614,"about_ca_system_score_gemma":0.0050250557,"threshold_uncertainty_score":0.024336994},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22532468,0.00076013675,0.7644388,0.0012962063,0.00025635603,0.0001497742,0.00004191639,0.0014648396,0.0062673],"genre_scores_gemma":[0.9827944,0.000096244876,0.01626343,0.00012523678,0.000036450154,0.000039896902,0.000008718121,0.000035888297,0.00059989525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906987,0.00037871528,0.000053739634,0.00011231942,0.00019920061,0.00018616955],"domain_scores_gemma":[0.9941069,0.004316432,0.00046387676,0.00026907361,0.0005045501,0.00033916772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018811857,0.00050400366,0.000741673,0.00048704838,0.00047085108,0.0013955162,0.0014122361,0.00089537667,0.0017942608],"category_scores_gemma":[0.013832502,0.00025484723,0.00017026467,0.00047450315,0.00066673884,0.0010471141,0.00083563355,0.0013623312,0.0002071909],"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.001703035,0.0013193323,0.0031728041,0.00022046058,0.00010174996,0.00018448784,0.0004956578,0.6563323,0.027447272,0.10436064,0.004644953,0.20001733],"study_design_scores_gemma":[0.00013971282,0.00021748322,0.0005753177,0.000012706612,0.000031300428,0.0000275967,0.00005095176,0.96297264,0.003659836,0.0318208,0.00047408973,0.000017523655],"about_ca_topic_score_codex":0.001452295,"about_ca_topic_score_gemma":0.0014418619,"teacher_disagreement_score":0.0018811857,"about_ca_system_score_codex":0.00096929196,"about_ca_system_score_gemma":0.0019095878,"threshold_uncertainty_score":0.00994879},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6527015,0.0013308411,0.31960946,0.002157132,0.00026368615,0.0001424147,0.0008974794,0.00085434195,0.02204309],"genre_scores_gemma":[0.98716545,0.00034169425,0.0058008824,0.0001506218,0.00015812389,0.00006421249,0.00023237012,0.00013046995,0.0059560603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735814,0.0006462106,0.00013311955,0.00040714,0.00059584423,0.0008593635],"domain_scores_gemma":[0.98674405,0.0057246964,0.0019094,0.0012119813,0.0022503466,0.0021595561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004375154,0.0011017722,0.0014828595,0.0025510727,0.0024245013,0.0042301994,0.0032406885,0.0013107256,0.0048073637],"category_scores_gemma":[0.018234547,0.0009999322,0.0011405527,0.0014346384,0.003700336,0.0037888722,0.0034915842,0.0026701041,0.0009192707],"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.00058422785,0.0001591933,0.003684863,0.00012479292,0.00009326701,0.00069581,0.0005935982,0.10305569,0.008285706,0.8705257,0.0041064713,0.008090608],"study_design_scores_gemma":[0.00004741982,0.000073822004,0.001551243,0.000029140347,0.000041751257,0.00019947837,0.0001357103,0.8084352,0.001963851,0.18666048,0.0007793024,0.00008259389],"about_ca_topic_score_codex":0.011188535,"about_ca_topic_score_gemma":0.0057251006,"teacher_disagreement_score":0.011188535,"about_ca_system_score_codex":0.00447785,"about_ca_system_score_gemma":0.0041634794,"threshold_uncertainty_score":0.03248918},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063815996,0.0009398701,0.9273625,0.00055525545,0.00024935647,0.00004340805,0.000048051905,0.00025189048,0.0067335116],"genre_scores_gemma":[0.7741107,0.001891039,0.20892781,0.00036126302,0.0004502745,0.00013563097,0.0002238067,0.00027261712,0.013626854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980261,0.0010615311,0.000068400215,0.00017063084,0.0004330429,0.00024029256],"domain_scores_gemma":[0.97719896,0.018556932,0.0006975318,0.0010807763,0.0015524784,0.0009132879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058285547,0.0018646732,0.0017717658,0.0025620172,0.0011468012,0.0028388184,0.0021316349,0.002126541,0.002809242],"category_scores_gemma":[0.031876445,0.0009005518,0.0011158958,0.0021127537,0.0034948925,0.0057846243,0.0041595,0.0032863612,0.00038286744],"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.00021474923,0.00010373657,0.0014256823,0.00011358452,0.000042531527,0.00012889852,0.00040470486,0.30670342,0.0012872108,0.6685613,0.0014369218,0.019577293],"study_design_scores_gemma":[0.0000086163855,0.00003141447,0.0001039567,0.00001041004,0.000008253928,0.00002198937,0.00003500249,0.81821764,0.00027994593,0.18065217,0.0006188679,0.000011588081],"about_ca_topic_score_codex":0.0070962273,"about_ca_topic_score_gemma":0.0032143765,"teacher_disagreement_score":0.0070962273,"about_ca_system_score_codex":0.002366097,"about_ca_system_score_gemma":0.0015978501,"threshold_uncertainty_score":0.03082472},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1305262,0.002161209,0.84525484,0.0040018647,0.00034570735,0.00008704026,0.00015055695,0.00028766698,0.017185016],"genre_scores_gemma":[0.9334146,0.0015932892,0.051963564,0.0004887508,0.00031108738,0.00014583474,0.00019558161,0.00014369693,0.011743614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982394,0.00064850174,0.00007674669,0.00026481028,0.0004665422,0.0003039678],"domain_scores_gemma":[0.9704213,0.023187691,0.0015635462,0.00072151585,0.002784841,0.001321023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061301994,0.00081533566,0.0014733683,0.0018717679,0.0014760315,0.0031061117,0.0022356447,0.0021697825,0.004028236],"category_scores_gemma":[0.04864143,0.0011460651,0.00095605565,0.0010774913,0.0032566201,0.0055511487,0.0032264641,0.005225705,0.00038673455],"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.00019580961,0.000069493624,0.0010652245,0.00014516157,0.000041843665,0.00015663587,0.00054427335,0.114343606,0.0032867535,0.8685653,0.0022157137,0.009370172],"study_design_scores_gemma":[0.000022174494,0.000017361923,0.00022860777,0.000032093994,0.000014030993,0.000048856356,0.000073630676,0.84511447,0.0005381419,0.15303585,0.0008558448,0.000018938328],"about_ca_topic_score_codex":0.004573712,"about_ca_topic_score_gemma":0.0025293988,"teacher_disagreement_score":0.0061301994,"about_ca_system_score_codex":0.0044572745,"about_ca_system_score_gemma":0.002398089,"threshold_uncertainty_score":0.03241998},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01198566,0.00013508102,0.98597425,0.0001263278,0.000040688345,0.00003245647,0.000031795636,0.00026486476,0.0014087462],"genre_scores_gemma":[0.2574133,0.00035959532,0.73743206,0.00014033358,0.000056119592,0.00036087123,0.00017094782,0.00027042974,0.0037963148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999645,0.00013278704,0.000018402165,0.00003221581,0.00014138894,0.000030368643],"domain_scores_gemma":[0.9982211,0.0012290013,0.000080859514,0.00008565917,0.00031455694,0.00006883931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015491496,0.00046693863,0.0009948347,0.00095374975,0.0007642064,0.00091175456,0.0012957656,0.0014977433,0.0032828269],"category_scores_gemma":[0.004307356,0.0006340438,0.0005557972,0.0010792413,0.0009912141,0.0011484179,0.0008967897,0.0015513203,0.00065400597],"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.000081521124,0.000064895954,0.00056756043,0.000083256564,0.000023451701,0.000040957282,0.00009779904,0.9380172,0.0023501012,0.020259911,0.0006357097,0.037777644],"study_design_scores_gemma":[0.000004469084,0.0000049961523,0.000019732126,0.0000037082002,0.0000014076701,0.0000037072564,0.0000063209527,0.99768436,0.00025639625,0.0017799209,0.00023226737,0.0000027290766],"about_ca_topic_score_codex":0.0065379953,"about_ca_topic_score_gemma":0.0065481802,"teacher_disagreement_score":0.0065379953,"about_ca_system_score_codex":0.00083081063,"about_ca_system_score_gemma":0.0018366581,"threshold_uncertainty_score":0.012999892},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23440419,0.001140409,0.74130815,0.0026320894,0.00054796407,0.00023590554,0.0010253144,0.0012624627,0.017443595],"genre_scores_gemma":[0.965952,0.0004807517,0.024196377,0.00029415102,0.00028414736,0.000096396776,0.0002904104,0.000059455655,0.008346369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804723,0.0005366551,0.00006484983,0.00046508404,0.00044408033,0.00044208756],"domain_scores_gemma":[0.99564135,0.001974463,0.0006043847,0.00068221136,0.0007944301,0.00030321197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022513866,0.0010442615,0.0016614825,0.0013521365,0.001687541,0.0029983702,0.0031440165,0.0027196489,0.0037493762],"category_scores_gemma":[0.011353507,0.0007762845,0.0007497822,0.0019607898,0.0018596143,0.0028040719,0.00191361,0.0026673109,0.00086543616],"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.0005268862,0.00023627873,0.0039618197,0.0001680168,0.000083679886,0.00067616923,0.0004502418,0.32823536,0.0072640846,0.61610967,0.010232288,0.03205558],"study_design_scores_gemma":[0.000029572766,0.000042342013,0.00061832473,0.000009031165,0.00002380553,0.000074430776,0.000029192019,0.9267268,0.0009151502,0.0705094,0.0009884551,0.000033438508],"about_ca_topic_score_codex":0.007197024,"about_ca_topic_score_gemma":0.005697735,"teacher_disagreement_score":0.007197024,"about_ca_system_score_codex":0.0036998542,"about_ca_system_score_gemma":0.002061201,"threshold_uncertainty_score":0.026844442},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08180218,0.0014811902,0.90640426,0.0011953095,0.00017711952,0.000083337334,0.00013957388,0.00018852102,0.008528442],"genre_scores_gemma":[0.96284765,0.0009458118,0.02687072,0.00017172094,0.00037873394,0.00007984174,0.00014619886,0.000081688064,0.0084776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99703014,0.0011317548,0.00009697898,0.0003493425,0.00085062033,0.00054111844],"domain_scores_gemma":[0.99028695,0.0071290685,0.00052582275,0.00036595945,0.0012365412,0.00045561834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005378281,0.0013000359,0.0015876202,0.0017234981,0.0011357102,0.0033108157,0.0024451027,0.0015294921,0.0032433805],"category_scores_gemma":[0.015496475,0.0008801294,0.0012028454,0.0015152387,0.0023062923,0.0030912021,0.0019115774,0.0023326767,0.0003404167],"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.000053715623,0.00007535316,0.00088057574,0.000053685562,0.00005701978,0.00012013893,0.0001181084,0.68450505,0.0011781731,0.30670744,0.001045577,0.005205125],"study_design_scores_gemma":[0.000004433623,0.000008152395,0.00013335086,0.0000038209214,0.000008234087,0.000010526616,0.0000138226005,0.9649728,0.00010698727,0.034534533,0.00019658892,0.0000066969146],"about_ca_topic_score_codex":0.010828424,"about_ca_topic_score_gemma":0.004034288,"teacher_disagreement_score":0.010828424,"about_ca_system_score_codex":0.0042392616,"about_ca_system_score_gemma":0.0038076579,"threshold_uncertainty_score":0.030758142},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45467848,0.00068933103,0.5345583,0.0012444549,0.00015926393,0.00011500038,0.0005971506,0.0006598172,0.0072982535],"genre_scores_gemma":[0.9774122,0.00021525398,0.018922968,0.00020259306,0.000113874186,0.00006824828,0.00024122276,0.00007737727,0.00274624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938705,0.0024716503,0.00026924576,0.0010011662,0.0011582895,0.0012291735],"domain_scores_gemma":[0.94944966,0.031585578,0.0034802759,0.00819601,0.003564669,0.0037237895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010683865,0.000991019,0.0027148265,0.0015111832,0.0017041805,0.004244321,0.0045510517,0.0022451475,0.0024099203],"category_scores_gemma":[0.06860367,0.0016815253,0.0012258616,0.0015273461,0.005592627,0.0059019807,0.0044744955,0.0024788256,0.00035735543],"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.0012717822,0.00018815549,0.0059125726,0.00012846457,0.00013291322,0.0002785226,0.0005117163,0.37881732,0.003199365,0.5958585,0.0025627248,0.01113792],"study_design_scores_gemma":[0.000058026413,0.000048748356,0.0009991963,0.000018495573,0.000022417904,0.00007927247,0.000073696254,0.80066764,0.0007299246,0.19702508,0.00024352755,0.000034024048],"about_ca_topic_score_codex":0.005419289,"about_ca_topic_score_gemma":0.0032353525,"teacher_disagreement_score":0.010683865,"about_ca_system_score_codex":0.002645022,"about_ca_system_score_gemma":0.0036256057,"threshold_uncertainty_score":0.056502342},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40121976,0.0012645106,0.53913707,0.003253813,0.00028843188,0.00023912356,0.00054515124,0.0003183126,0.05373385],"genre_scores_gemma":[0.9666503,0.00068471965,0.015557322,0.00022157417,0.00016450627,0.00013017429,0.00020580746,0.00006665171,0.016318774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993668,0.00021766683,0.000029012752,0.00009331543,0.00014155668,0.00015162675],"domain_scores_gemma":[0.99752647,0.0015407533,0.00031905714,0.00007102763,0.00031307526,0.00022962487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014067902,0.0009660425,0.0011445251,0.0014917786,0.001874437,0.0038260806,0.0017948603,0.002742428,0.006593575],"category_scores_gemma":[0.00806299,0.0007090184,0.0010684925,0.0010536857,0.0020524452,0.0029108606,0.0019159128,0.0022320705,0.0004993796],"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.000057655197,0.000088278306,0.0006860192,0.00004879922,0.000025866375,0.0001953997,0.00021712165,0.045524694,0.0011396096,0.9472417,0.0020666705,0.0027081852],"study_design_scores_gemma":[0.00007088013,0.000038077254,0.00029916308,0.000024278068,0.000023048726,0.00008542221,0.00014988148,0.5480292,0.00046367862,0.44954008,0.0012500889,0.000026227905],"about_ca_topic_score_codex":0.0074911066,"about_ca_topic_score_gemma":0.0044696466,"teacher_disagreement_score":0.0074911066,"about_ca_system_score_codex":0.0025895908,"about_ca_system_score_gemma":0.0014494343,"threshold_uncertainty_score":0.022057712},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027846482,0.0024179672,0.9506171,0.0017689585,0.0005232638,0.00014990373,0.00035460983,0.000314885,0.016007025],"genre_scores_gemma":[0.53731656,0.006174259,0.40022263,0.0018716665,0.0019342249,0.0011781459,0.0018942774,0.0013021077,0.048106167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9903486,0.0052030603,0.00031828898,0.0011629534,0.0021689606,0.00079809787],"domain_scores_gemma":[0.8874378,0.09470772,0.003034967,0.0032794636,0.008586194,0.002953887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.025782846,0.0027237365,0.0034023682,0.0067097396,0.0024718165,0.0035724891,0.007645954,0.0034972643,0.021848278],"category_scores_gemma":[0.07970169,0.0015371756,0.0027084616,0.0060569304,0.0050164755,0.02138921,0.008191849,0.008516455,0.0012067409],"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.0006361944,0.0002152538,0.001181164,0.0003919486,0.00017745921,0.00013474967,0.00026351376,0.11044802,0.001547911,0.84665227,0.005440217,0.03291126],"study_design_scores_gemma":[0.000042923555,0.00019380817,0.0004968255,0.00007499842,0.0000837574,0.000079948615,0.00005551077,0.4012964,0.0010818678,0.59327286,0.0032700233,0.00005109704],"about_ca_topic_score_codex":0.0027501318,"about_ca_topic_score_gemma":0.0022329448,"teacher_disagreement_score":0.025782846,"about_ca_system_score_codex":0.005308601,"about_ca_system_score_gemma":0.0045744483,"threshold_uncertainty_score":0.13635433},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04873324,0.00016102512,0.949658,0.00008699014,0.000024731002,0.000059330887,0.00005223066,0.000617646,0.00060687045],"genre_scores_gemma":[0.7114355,0.00014694752,0.28667936,0.00012272142,0.000055904075,0.00012420972,0.00027949852,0.00009210258,0.0010637781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770206,0.0007181844,0.00015150286,0.0003884038,0.0006810913,0.00035866865],"domain_scores_gemma":[0.99199283,0.0044083917,0.00065671315,0.0016140919,0.00080001325,0.00052799546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004416491,0.00076788524,0.0014507262,0.0009717779,0.00087238755,0.0013897046,0.0026821308,0.00085734087,0.0011561612],"category_scores_gemma":[0.017165925,0.0007554769,0.0007569058,0.0009589439,0.0011115978,0.0021331406,0.0021594728,0.0009872378,0.00032775485],"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.0014576161,0.00015382309,0.008286046,0.0002216354,0.00013662156,0.00039040227,0.00050131755,0.7449631,0.009154453,0.08972086,0.002158472,0.14285557],"study_design_scores_gemma":[0.000018526365,0.000035365825,0.00016934104,0.0000045517168,0.000007205644,0.000048006554,0.000012811794,0.98667985,0.0015133207,0.011326232,0.0001782077,0.000006557824],"about_ca_topic_score_codex":0.0034499182,"about_ca_topic_score_gemma":0.0025511226,"teacher_disagreement_score":0.004416491,"about_ca_system_score_codex":0.0014633572,"about_ca_system_score_gemma":0.0020018981,"threshold_uncertainty_score":0.023356915},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30665514,0.0053862473,0.6498428,0.006624518,0.0006622917,0.00019237207,0.001048189,0.00260763,0.026980845],"genre_scores_gemma":[0.94714326,0.0024805022,0.025833208,0.0007800886,0.0008655776,0.00029164378,0.0007115506,0.00092933356,0.020964902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980798,0.00057378464,0.000079713594,0.0003270795,0.00042780378,0.00051180826],"domain_scores_gemma":[0.96144164,0.027768677,0.0029946354,0.0022147133,0.0036972433,0.0018831263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0095494585,0.0021694365,0.0019436819,0.0041293106,0.0015299771,0.003732607,0.0048116245,0.0027085699,0.010856541],"category_scores_gemma":[0.0672413,0.001670255,0.0013598521,0.0021393714,0.0054858425,0.007822751,0.0031486885,0.0064505436,0.0019802556],"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.000554091,0.00019626695,0.0027547423,0.00028857627,0.000096074145,0.00036073787,0.001278727,0.116916545,0.007582994,0.85021424,0.007006335,0.012750761],"study_design_scores_gemma":[0.000061018327,0.00004821785,0.0018970193,0.00010613204,0.00006856557,0.00021984069,0.0002043452,0.825102,0.001379311,0.16980866,0.0009819103,0.00012306274],"about_ca_topic_score_codex":0.010853628,"about_ca_topic_score_gemma":0.0075041465,"teacher_disagreement_score":0.010856541,"about_ca_system_score_codex":0.0065603885,"about_ca_system_score_gemma":0.0040555377,"threshold_uncertainty_score":0.050502956},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16352731,0.0019731878,0.7764827,0.010989071,0.00092849165,0.0002891946,0.0031139576,0.0008360375,0.0418601],"genre_scores_gemma":[0.92341554,0.0011489104,0.018391747,0.0006979987,0.00029903112,0.00024037612,0.0008534794,0.00014526836,0.054807663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998931,0.00028508253,0.000046469482,0.00025167735,0.00017154655,0.0003141925],"domain_scores_gemma":[0.99724627,0.0015808275,0.0002715132,0.0000888614,0.00043821766,0.00037429802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023279719,0.0012011318,0.0019007218,0.0011023753,0.0014259218,0.004706241,0.004483244,0.0049112258,0.011691351],"category_scores_gemma":[0.007555711,0.0009534723,0.0013358778,0.0015351365,0.0013534835,0.0033790974,0.0016322713,0.003460193,0.0015990951],"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.00014591402,0.00014624043,0.0015428659,0.00010916476,0.00005786158,0.0005458337,0.000256908,0.83125365,0.0012626331,0.15397865,0.0050500003,0.0056502493],"study_design_scores_gemma":[0.000041453677,0.00003502768,0.00026981175,0.00001312555,0.000030003108,0.00007886717,0.000045265206,0.98077786,0.00009963224,0.017561896,0.0010241941,0.000022911392],"about_ca_topic_score_codex":0.036664557,"about_ca_topic_score_gemma":0.018860778,"teacher_disagreement_score":0.036664557,"about_ca_system_score_codex":0.006376225,"about_ca_system_score_gemma":0.0048214435,"threshold_uncertainty_score":0.07290226},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6210025,0.0006842887,0.36509,0.0011444449,0.00019406185,0.00011477189,0.0006456938,0.0012573046,0.009866884],"genre_scores_gemma":[0.9875267,0.00018831652,0.008284517,0.0001030599,0.00010336583,0.000031963456,0.00032122128,0.00010425506,0.0033365611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993562,0.00011072966,0.000019300522,0.00015396679,0.00017384357,0.00018600015],"domain_scores_gemma":[0.99511623,0.002421527,0.0007366465,0.00027819246,0.00094428926,0.0005031234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020714565,0.00067433284,0.0007181324,0.0018297344,0.0007444481,0.0019761398,0.0021907736,0.0010216254,0.0043154457],"category_scores_gemma":[0.010903557,0.0005595584,0.00053982326,0.0011330643,0.0014230033,0.0026004012,0.0015412273,0.0014136361,0.0005638591],"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.0012183428,0.0002695931,0.024756577,0.00030621147,0.00009849025,0.0013883553,0.00070123724,0.6589618,0.017971193,0.26288998,0.0064633666,0.024974868],"study_design_scores_gemma":[0.000018781448,0.00006965734,0.0032441625,0.000012866524,0.000019749954,0.00015072482,0.000071681694,0.9650016,0.0016146129,0.029421031,0.00033809655,0.000037097754],"about_ca_topic_score_codex":0.00517062,"about_ca_topic_score_gemma":0.0036566814,"teacher_disagreement_score":0.00517062,"about_ca_system_score_codex":0.003022291,"about_ca_system_score_gemma":0.0019595865,"threshold_uncertainty_score":0.02192843},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2847844,0.0007806309,0.70143586,0.0016905004,0.0009361337,0.00032508132,0.0005036783,0.0019323786,0.007611356],"genre_scores_gemma":[0.9187676,0.00021578633,0.07163327,0.00027554494,0.00022650756,0.000081460246,0.00017923999,0.00006884978,0.008551779],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836403,0.00038457278,0.00007947166,0.0003648032,0.00038050945,0.00042655048],"domain_scores_gemma":[0.9936045,0.00301841,0.00023786051,0.0007417237,0.0011311608,0.001266425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029294242,0.00065281434,0.0018147168,0.0011810052,0.0021254222,0.0037775266,0.0030717477,0.0021898202,0.007568394],"category_scores_gemma":[0.0066806637,0.00062143133,0.0007789603,0.0018222817,0.0012349613,0.0026128825,0.0019309057,0.0022956238,0.00074240175],"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.0068309973,0.002037624,0.0060463296,0.0004967318,0.00021588354,0.002657943,0.0011632651,0.43488845,0.04633007,0.35200515,0.012375213,0.13495237],"study_design_scores_gemma":[0.0005254807,0.00032221185,0.000422321,0.000012744224,0.00006082916,0.000176844,0.00003941658,0.96388054,0.0029062843,0.03015062,0.0014353752,0.00006732378],"about_ca_topic_score_codex":0.009254109,"about_ca_topic_score_gemma":0.0052169547,"teacher_disagreement_score":0.009254109,"about_ca_system_score_codex":0.0035090349,"about_ca_system_score_gemma":0.0036399171,"threshold_uncertainty_score":0.025459886},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64922714,0.0029459773,0.32038572,0.0030621781,0.00036932074,0.000117805495,0.00066829,0.0010147099,0.022208858],"genre_scores_gemma":[0.98696184,0.000444965,0.0078116814,0.00011930967,0.00014906358,0.000031089374,0.00013982088,0.00008669928,0.004255548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939287,0.00013249856,0.000021429974,0.00010561632,0.00014583296,0.00020170562],"domain_scores_gemma":[0.9962308,0.0021761814,0.00043266692,0.00018207177,0.0006438417,0.00033456457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00256,0.00066126056,0.0006932893,0.001742918,0.00089671335,0.0019234538,0.0018898814,0.0010740908,0.0039390256],"category_scores_gemma":[0.010720714,0.0006139152,0.00037734138,0.0012753711,0.0015221845,0.0019451643,0.0009192839,0.0016016306,0.0005679947],"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.0006481366,0.00021559086,0.007096789,0.0002532473,0.000054168275,0.0005835931,0.00094024034,0.32790992,0.01799611,0.6185528,0.008808753,0.016940666],"study_design_scores_gemma":[0.000023320832,0.000033147924,0.0010658652,0.000020891506,0.000015093262,0.00009326607,0.00008492053,0.97268254,0.0011039497,0.024202509,0.0006410646,0.000033436565],"about_ca_topic_score_codex":0.008827465,"about_ca_topic_score_gemma":0.0046528634,"teacher_disagreement_score":0.008827465,"about_ca_system_score_codex":0.004556797,"about_ca_system_score_gemma":0.0024216934,"threshold_uncertainty_score":0.03306198},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03511399,0.00059199927,0.95953035,0.00050029106,0.000092495706,0.00003712338,0.000052969775,0.00037083417,0.0037098574],"genre_scores_gemma":[0.88708395,0.001430335,0.09110498,0.0003736112,0.00047755352,0.00017596768,0.0002441625,0.00054447673,0.018564882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892265,0.0004817516,0.00003940029,0.00015210686,0.00022938337,0.00017470148],"domain_scores_gemma":[0.98961884,0.0065221842,0.0006800924,0.0009381042,0.001699439,0.0005413473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004655793,0.0010694121,0.00192992,0.0020972386,0.0008741345,0.0021473772,0.0035883598,0.0019676378,0.0035788792],"category_scores_gemma":[0.021504197,0.00078823324,0.0015274915,0.0016233681,0.0027367664,0.005955132,0.003203188,0.003644591,0.0006666035],"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.0001266998,0.00019870594,0.0013853039,0.0002179072,0.00009209032,0.00021389312,0.00038830732,0.25863922,0.0036332002,0.7158022,0.0031318902,0.016170533],"study_design_scores_gemma":[0.0000062665163,0.0000071727663,0.00015534415,0.000007579282,0.000010340393,0.000020987129,0.00001757984,0.9585861,0.00012670118,0.040802795,0.0002458829,0.000013270645],"about_ca_topic_score_codex":0.006765216,"about_ca_topic_score_gemma":0.0030886037,"teacher_disagreement_score":0.006765216,"about_ca_system_score_codex":0.0021067716,"about_ca_system_score_gemma":0.0020683599,"threshold_uncertainty_score":0.0246225},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055691026,0.0019399377,0.8869693,0.0022693626,0.0005487062,0.00010723979,0.00046770775,0.00094058114,0.05106618],"genre_scores_gemma":[0.79792,0.001424557,0.15759414,0.00077681063,0.0006366154,0.00022847435,0.00048583967,0.00074206217,0.040191445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845207,0.00053099415,0.000036049514,0.00016632574,0.00040835884,0.00040617952],"domain_scores_gemma":[0.9938737,0.0035537526,0.00039005108,0.0007363493,0.00093666953,0.00050951564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046391655,0.00096841174,0.0012568987,0.0016926297,0.0016665697,0.0033093307,0.005265503,0.0024043988,0.010139473],"category_scores_gemma":[0.01860957,0.0007724841,0.0012669571,0.0023057624,0.0021880204,0.003665843,0.0020463793,0.0032320376,0.0022025849],"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.00018440571,0.000085749016,0.001279352,0.00008581185,0.000027446633,0.00013063148,0.0002455042,0.561188,0.0007202082,0.4118702,0.01097739,0.0132053625],"study_design_scores_gemma":[0.0000070236288,0.000005863136,0.00014467728,0.00001262511,0.000008185542,0.00002069224,0.000029649818,0.97532845,0.000116092255,0.02348329,0.0008336404,0.00000972648],"about_ca_topic_score_codex":0.02848431,"about_ca_topic_score_gemma":0.022981498,"teacher_disagreement_score":0.02848431,"about_ca_system_score_codex":0.007631084,"about_ca_system_score_gemma":0.0038527036,"threshold_uncertainty_score":0.05663705},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17110874,0.0024932437,0.80061936,0.0017759372,0.00024878414,0.00007557474,0.00023507688,0.0009080943,0.022535097],"genre_scores_gemma":[0.97201467,0.001022217,0.016861169,0.0003383084,0.00042575598,0.00007031174,0.00017584399,0.0002532465,0.008838422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980736,0.0004954517,0.000071208306,0.00022465369,0.0007538945,0.0003812766],"domain_scores_gemma":[0.9854102,0.008982239,0.0013039848,0.0014157086,0.0020627207,0.0008250375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004988486,0.00108528,0.0013635247,0.0024501744,0.0010808891,0.0031126905,0.0033948452,0.0016472404,0.0043793065],"category_scores_gemma":[0.039311934,0.0008206497,0.00079707697,0.0016945412,0.0028239004,0.0061431173,0.00260627,0.003996602,0.0007698511],"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.00018262735,0.00015968342,0.0022987125,0.00014196931,0.00003715519,0.00033917683,0.00053550897,0.15206246,0.0045419573,0.8213798,0.003659423,0.014661497],"study_design_scores_gemma":[0.00001767165,0.000023989913,0.0005200314,0.000023806331,0.000014082809,0.0001239588,0.000058630318,0.7684501,0.0005266443,0.22951591,0.000699707,0.000025409008],"about_ca_topic_score_codex":0.004187057,"about_ca_topic_score_gemma":0.0023108611,"teacher_disagreement_score":0.004988486,"about_ca_system_score_codex":0.0030987496,"about_ca_system_score_gemma":0.0022541496,"threshold_uncertainty_score":0.02638197},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61394686,0.0006811087,0.33200786,0.0071350206,0.0010999368,0.00030041163,0.001260628,0.0022678412,0.041300394],"genre_scores_gemma":[0.9630212,0.0001742627,0.022885801,0.00044444873,0.00022763306,0.00003447226,0.00018716764,0.00008600516,0.012939057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995067,0.00007964855,0.000015761925,0.00009529275,0.00013062119,0.00017199216],"domain_scores_gemma":[0.9984732,0.0004979332,0.00008994132,0.00012136609,0.0004139898,0.0004034748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010209272,0.0005939719,0.0009295723,0.0010703524,0.0020101622,0.0032627224,0.0016106126,0.0023275176,0.00707323],"category_scores_gemma":[0.0037721847,0.00040474013,0.0005690568,0.0011025292,0.0011859129,0.0016538391,0.0017747257,0.0016311776,0.0008986224],"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.0032449728,0.00077300856,0.008959918,0.00037628273,0.00012656716,0.006180811,0.00072524004,0.27537984,0.045932774,0.5828349,0.033523433,0.041942235],"study_design_scores_gemma":[0.0001691779,0.0001919318,0.0009391985,0.00001647449,0.00004788983,0.00045323907,0.00014148722,0.9001509,0.0050736726,0.09020687,0.0025487738,0.000060480594],"about_ca_topic_score_codex":0.0095529,"about_ca_topic_score_gemma":0.0051715104,"teacher_disagreement_score":0.0095529,"about_ca_system_score_codex":0.002392903,"about_ca_system_score_gemma":0.0020769928,"threshold_uncertainty_score":0.02366227},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031370584,0.004470509,0.9245486,0.00468752,0.0010956106,0.00025258653,0.00050726027,0.00068345445,0.032384012],"genre_scores_gemma":[0.8082627,0.0065932674,0.16349101,0.0041470393,0.002475663,0.00081209606,0.0004739978,0.00066113606,0.013083051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995808,0.0010997393,0.00014749642,0.00073316763,0.0014521059,0.0007596191],"domain_scores_gemma":[0.96852934,0.022367923,0.0016269098,0.0012231225,0.004608736,0.0016440228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007568905,0.0027348774,0.002680133,0.0031059815,0.0018881813,0.0034924836,0.0052751377,0.002226123,0.008817407],"category_scores_gemma":[0.044246487,0.0012156392,0.0025758434,0.0021219936,0.0044856435,0.008798591,0.0067562084,0.008743525,0.00083896855],"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.00035490753,0.00018449027,0.0013284223,0.0011095573,0.00015000197,0.0006397844,0.0009699992,0.044152364,0.009765875,0.90603036,0.01160788,0.023706371],"study_design_scores_gemma":[0.00012306025,0.00016164662,0.00081440713,0.00016813174,0.00013044046,0.0006141997,0.000162909,0.34808862,0.0028210145,0.6414829,0.0053267865,0.0001058907],"about_ca_topic_score_codex":0.0046753343,"about_ca_topic_score_gemma":0.0016880544,"teacher_disagreement_score":0.008817407,"about_ca_system_score_codex":0.004478405,"about_ca_system_score_gemma":0.0047605713,"threshold_uncertainty_score":0.04002869},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08368762,0.00032838667,0.9129394,0.00035187294,0.00008351962,0.000058650636,0.000065822926,0.00020992187,0.0022747891],"genre_scores_gemma":[0.96289665,0.00018514828,0.034287676,0.00007362112,0.00006976619,0.000087748005,0.000060347666,0.000078772406,0.002260305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998293,0.00063242577,0.00008134893,0.00028182226,0.00029610386,0.00041525654],"domain_scores_gemma":[0.99392694,0.004252294,0.0004174898,0.00042475841,0.00052040647,0.0004580866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004068667,0.00087186234,0.001727869,0.0010412396,0.0016170255,0.002845958,0.002804396,0.001178978,0.002507881],"category_scores_gemma":[0.013918476,0.0008966304,0.0005643903,0.0013507535,0.0016512563,0.0033584149,0.0022176618,0.0016396092,0.0003175097],"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.00026805312,0.00005673923,0.0005071496,0.000036630845,0.00003433947,0.00010020388,0.00012135591,0.9080873,0.0017382228,0.07592151,0.00090540946,0.01222318],"study_design_scores_gemma":[0.0000077729555,0.000009335939,0.000048313184,0.0000020057003,0.0000049653304,0.000008588539,0.000010731876,0.984092,0.00013511896,0.01557488,0.00010118542,0.0000051193033],"about_ca_topic_score_codex":0.0040439386,"about_ca_topic_score_gemma":0.0035157523,"teacher_disagreement_score":0.004068667,"about_ca_system_score_codex":0.0032972314,"about_ca_system_score_gemma":0.0021148971,"threshold_uncertainty_score":0.023923159},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098056436,0.00063870585,0.8822291,0.001902231,0.0005741789,0.00007361344,0.000045132223,0.0007442682,0.015736358],"genre_scores_gemma":[0.95578027,0.00021639167,0.035286553,0.00044919393,0.00046052126,0.00009218862,0.00003494543,0.00012347546,0.0075565004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823964,0.0007661651,0.00003791174,0.00019937931,0.00048721043,0.00026971748],"domain_scores_gemma":[0.9948,0.003441968,0.00028188157,0.00039088866,0.00064091303,0.00044447216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027851043,0.0006150376,0.0016741323,0.001272052,0.0017421725,0.002708459,0.0024462196,0.0023655635,0.005563777],"category_scores_gemma":[0.011590117,0.0007148505,0.0006705192,0.00094193366,0.0015220874,0.0035527623,0.0022518847,0.0017090638,0.0005848536],"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.0006575558,0.0002710119,0.0008977305,0.000074791584,0.000093452574,0.0001107885,0.00019843111,0.4391849,0.0077247676,0.51102567,0.0055825757,0.034178328],"study_design_scores_gemma":[0.000032392934,0.000031549385,0.00010762156,0.0000033532824,0.000011269789,0.000014055647,0.000012545612,0.88310564,0.00034025082,0.115747906,0.0005803088,0.00001309833],"about_ca_topic_score_codex":0.0018484171,"about_ca_topic_score_gemma":0.00148461,"teacher_disagreement_score":0.005563777,"about_ca_system_score_codex":0.0022796178,"about_ca_system_score_gemma":0.001525198,"threshold_uncertainty_score":0.018612623},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37715036,0.00065564696,0.61040574,0.0010454967,0.00006198632,0.00008264839,0.00026655395,0.00021292597,0.010118593],"genre_scores_gemma":[0.97775465,0.00050879957,0.017097382,0.0001287549,0.00010963172,0.00007565248,0.0002164872,0.00006407466,0.004044415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986878,0.00037946363,0.00006310621,0.0003501807,0.0003077128,0.00021166768],"domain_scores_gemma":[0.9784802,0.013718315,0.0028558206,0.0010105402,0.0023575702,0.0015774919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034045372,0.0008570849,0.001147465,0.0021838425,0.0010942641,0.003745641,0.0022680785,0.0015728252,0.0026611872],"category_scores_gemma":[0.020066611,0.001006519,0.00093959016,0.0011559526,0.00404376,0.0060757077,0.0021438233,0.0029399237,0.0003148015],"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.00010283347,0.00014020794,0.0019471012,0.00007060937,0.00003584723,0.00020665124,0.00038644334,0.038736224,0.003958499,0.94863206,0.001009293,0.004774299],"study_design_scores_gemma":[0.000025489582,0.000050248695,0.0009907052,0.00001874082,0.000019930258,0.00017445468,0.000108603344,0.615011,0.0012124352,0.38159192,0.00075213064,0.00004435049],"about_ca_topic_score_codex":0.001659571,"about_ca_topic_score_gemma":0.0009827618,"teacher_disagreement_score":0.003745641,"about_ca_system_score_codex":0.0026999984,"about_ca_system_score_gemma":0.0015971921,"threshold_uncertainty_score":0.01958996},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12130514,0.0010938758,0.8646734,0.0009299642,0.00012495951,0.00010254039,0.00028821972,0.0002456192,0.0112362625],"genre_scores_gemma":[0.9097756,0.0019504295,0.075408705,0.00026322738,0.00035492328,0.00019162368,0.00034261006,0.000113924485,0.011598945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819106,0.00036021715,0.00012444383,0.00028150418,0.00072529854,0.0003175213],"domain_scores_gemma":[0.9915697,0.004792517,0.0011958416,0.00031871427,0.0016832576,0.00044000798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038515213,0.0008686019,0.00087125105,0.0013955183,0.00077551184,0.001820002,0.0029922698,0.00095016306,0.0029732396],"category_scores_gemma":[0.015416256,0.0004449365,0.0008403507,0.0016235001,0.001579194,0.003921564,0.0010231225,0.0021058966,0.00044348193],"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.00011183096,0.000075479635,0.0030574198,0.00013418794,0.000027930742,0.00045036981,0.0005916831,0.2242002,0.0045800214,0.75325763,0.0016543873,0.011858679],"study_design_scores_gemma":[0.000024890718,0.000113270486,0.0011262974,0.00002748281,0.000024116493,0.00016772683,0.00013296735,0.846624,0.0010376683,0.14867704,0.00199865,0.000045855235],"about_ca_topic_score_codex":0.0075278576,"about_ca_topic_score_gemma":0.0026566782,"teacher_disagreement_score":0.0075278576,"about_ca_system_score_codex":0.0023494274,"about_ca_system_score_gemma":0.0020475578,"threshold_uncertainty_score":0.020368993},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026106052,0.0009870958,0.9659055,0.0011608746,0.00024785014,0.000029912193,0.000102681915,0.0002744362,0.0051855324],"genre_scores_gemma":[0.8917693,0.0023608098,0.08089573,0.00060808205,0.000982466,0.00017479033,0.0004134682,0.0003737323,0.022421636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988416,0.0004715707,0.000029982191,0.00014182487,0.00031005478,0.000204929],"domain_scores_gemma":[0.9948068,0.0033012866,0.00028064268,0.0003739337,0.00085386174,0.00038348313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038646997,0.000995854,0.0015464857,0.0021255335,0.0011186572,0.002421955,0.002836724,0.0020434891,0.0026368005],"category_scores_gemma":[0.019838296,0.0008752158,0.0010469875,0.0013216088,0.003470994,0.0041476656,0.0020367797,0.003933499,0.00069986883],"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.00006623562,0.000042773412,0.0005654122,0.000048386883,0.000027118984,0.000089581845,0.00012525253,0.4621442,0.0007259659,0.5276919,0.0028188045,0.0056543406],"study_design_scores_gemma":[0.0000040297145,0.0000025603388,0.00003235357,0.0000038729927,0.0000024687997,0.0000071366067,0.000006911352,0.9569233,0.00004369888,0.042711053,0.00025875465,0.0000038135402],"about_ca_topic_score_codex":0.015048593,"about_ca_topic_score_gemma":0.0067907455,"teacher_disagreement_score":0.015048593,"about_ca_system_score_codex":0.0035810445,"about_ca_system_score_gemma":0.0025194904,"threshold_uncertainty_score":0.029922009},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10716817,0.0056657176,0.83579516,0.007949425,0.0011193221,0.00019834773,0.0015716304,0.00066052703,0.03987169],"genre_scores_gemma":[0.9180622,0.0031841197,0.02121705,0.0007116914,0.0007626649,0.0002952747,0.0007712289,0.00025341133,0.05474229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702245,0.0012534607,0.00012047277,0.0004303022,0.00041007833,0.000763223],"domain_scores_gemma":[0.99002844,0.006861929,0.0008707776,0.00039187793,0.00097306696,0.00087389693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048382804,0.0017258542,0.0031849835,0.0019990765,0.0019517655,0.0069631427,0.0065995306,0.0049858,0.013317195],"category_scores_gemma":[0.015904004,0.0021627964,0.0017002102,0.0034254605,0.0036978177,0.008364978,0.0026034256,0.0042412993,0.0017360754],"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.00008768263,0.000095832,0.0007670967,0.00009798435,0.00004868786,0.0001502499,0.00028040583,0.37662867,0.00028491262,0.61291796,0.0050202897,0.0036201994],"study_design_scores_gemma":[0.000026646314,0.00001723922,0.00013352057,0.000015371854,0.000021174876,0.000026923772,0.000070562935,0.8961123,0.000042696214,0.10216555,0.001348258,0.000019695037],"about_ca_topic_score_codex":0.028122338,"about_ca_topic_score_gemma":0.015548933,"teacher_disagreement_score":0.028122338,"about_ca_system_score_codex":0.006625258,"about_ca_system_score_gemma":0.0033068655,"threshold_uncertainty_score":0.055917263},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16236235,0.005369955,0.7914943,0.007402769,0.0011258915,0.000100989295,0.0004204201,0.0010751685,0.030648181],"genre_scores_gemma":[0.90677273,0.0019537716,0.07136369,0.0010551051,0.0010234341,0.00013403568,0.00026584967,0.00051443203,0.016917024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983171,0.00058048667,0.000044282893,0.00018271478,0.00044484017,0.00043052193],"domain_scores_gemma":[0.98841804,0.008386371,0.0006690611,0.0008129631,0.0012056625,0.0005080146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064202375,0.0010865419,0.0017749759,0.0018508654,0.0012966865,0.0030492204,0.0046650385,0.0025929937,0.0033393058],"category_scores_gemma":[0.029688595,0.00091111753,0.0011287712,0.0021029257,0.0027845865,0.004920862,0.002164223,0.0047706948,0.0007794957],"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.00021979395,0.00007236336,0.0011575585,0.00011326178,0.0000355203,0.00018087708,0.0004038712,0.40480927,0.001086528,0.5773978,0.006324255,0.008198857],"study_design_scores_gemma":[0.000013980879,0.00000790653,0.00015339645,0.000011860723,0.000009046279,0.000016675462,0.000025483727,0.94414663,0.00010114097,0.055097006,0.0004059827,0.000010879725],"about_ca_topic_score_codex":0.02808917,"about_ca_topic_score_gemma":0.012593976,"teacher_disagreement_score":0.02808917,"about_ca_system_score_codex":0.0058887596,"about_ca_system_score_gemma":0.0036909305,"threshold_uncertainty_score":0.05585134},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.273968,0.0014239557,0.71236134,0.0016954289,0.00020389092,0.00012384869,0.00028496512,0.0003350449,0.009603477],"genre_scores_gemma":[0.98332226,0.000355523,0.012050442,0.000093121256,0.0001874822,0.00005481317,0.0001022891,0.00007015981,0.0037640147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983272,0.0004932396,0.00007220083,0.00023538554,0.00039954603,0.00047245814],"domain_scores_gemma":[0.99092966,0.006432215,0.000654871,0.0003278159,0.00096735585,0.0006880704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040020226,0.0011418805,0.0015941989,0.0013803822,0.0013266349,0.0026274608,0.0025267883,0.001238775,0.003665237],"category_scores_gemma":[0.012556112,0.0008727147,0.0010877588,0.0011677386,0.002120637,0.0029667304,0.0014675446,0.0015854373,0.0003023363],"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.00019898033,0.000112229565,0.0018754556,0.00011266258,0.000093175826,0.00031762762,0.00028988902,0.71489066,0.0042151525,0.26939535,0.0019694131,0.0065292995],"study_design_scores_gemma":[0.000008326078,0.000015469064,0.00025205902,0.0000034304028,0.000013653889,0.000023764163,0.000025314126,0.98103756,0.00017456454,0.018274548,0.00016347294,0.000007768371],"about_ca_topic_score_codex":0.009725398,"about_ca_topic_score_gemma":0.0045519783,"teacher_disagreement_score":0.009725398,"about_ca_system_score_codex":0.0038413794,"about_ca_system_score_gemma":0.0030980147,"threshold_uncertainty_score":0.02787131},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3029046,0.0015041133,0.678625,0.0036519067,0.00035730953,0.0002359173,0.0005917093,0.0013663407,0.010763093],"genre_scores_gemma":[0.95847756,0.0007878263,0.02885818,0.000412099,0.00017811592,0.00017684429,0.00027023765,0.0002976339,0.010541593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836546,0.0003594048,0.00007353569,0.0002391699,0.0004700285,0.0004924846],"domain_scores_gemma":[0.9798922,0.011884464,0.0017494188,0.0010709562,0.0038066332,0.0015963732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007212178,0.0011078849,0.0015460212,0.0026594526,0.0017731882,0.0031978164,0.003449007,0.0021610106,0.004716802],"category_scores_gemma":[0.039060406,0.0008763123,0.0008625712,0.0015004785,0.0025952442,0.0042683943,0.0026035765,0.003243197,0.0008455269],"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.0012216046,0.00027111286,0.0059722587,0.00046005042,0.00009423023,0.00049652124,0.0015163781,0.20699938,0.02379135,0.7284647,0.008261473,0.022450855],"study_design_scores_gemma":[0.00006290722,0.00007572401,0.0006326553,0.00004006012,0.00004900252,0.00017444689,0.0001395808,0.9485366,0.0018123112,0.047821127,0.0005900123,0.00006554073],"about_ca_topic_score_codex":0.010034021,"about_ca_topic_score_gemma":0.0035200112,"teacher_disagreement_score":0.010034021,"about_ca_system_score_codex":0.004843545,"about_ca_system_score_gemma":0.004423684,"threshold_uncertainty_score":0.038142085},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062365927,0.00095182034,0.92565984,0.0012402699,0.000211924,0.000052017782,0.00009347775,0.00033516236,0.009089573],"genre_scores_gemma":[0.94717413,0.0008145861,0.037833218,0.00025412798,0.00013148929,0.00016483112,0.00011786241,0.00011597737,0.013393681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995908,0.00013291021,0.000021499896,0.00006156396,0.00009358958,0.00009970799],"domain_scores_gemma":[0.99538594,0.0033743596,0.00036771962,0.00013215838,0.00046366017,0.0002762504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015035135,0.00075011275,0.0008726286,0.0011645567,0.00090337277,0.0023862217,0.001609574,0.0019487786,0.004101902],"category_scores_gemma":[0.012840493,0.0006729577,0.0006845966,0.001078901,0.0016871202,0.0021330086,0.0014495178,0.0015044764,0.00035402083],"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.00023657747,0.00011823336,0.0005611453,0.00015427156,0.00004945895,0.00022087888,0.00035796902,0.54202783,0.0031564382,0.43560967,0.0032940672,0.014213476],"study_design_scores_gemma":[0.000020982538,0.000012527416,0.00006173736,0.00001328164,0.000007689486,0.00001722032,0.000053442487,0.93005675,0.00026290515,0.06923033,0.00025402542,0.000009124856],"about_ca_topic_score_codex":0.004781853,"about_ca_topic_score_gemma":0.0030912447,"teacher_disagreement_score":0.004781853,"about_ca_system_score_codex":0.0025104734,"about_ca_system_score_gemma":0.0018974681,"threshold_uncertainty_score":0.018214822},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34701002,0.0031672164,0.63752294,0.0027580622,0.00030965355,0.00010488594,0.00034280916,0.00040365718,0.008380711],"genre_scores_gemma":[0.98085004,0.0018478355,0.012708815,0.00018116727,0.00044609985,0.00007155235,0.00024545006,0.00013765048,0.0035114146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981962,0.0006602623,0.000057268462,0.0003011828,0.00044526818,0.00033984735],"domain_scores_gemma":[0.96853316,0.024972595,0.0017057597,0.00079582824,0.0030969079,0.0008956616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009251853,0.0013186805,0.0018922575,0.0029397449,0.0014102148,0.0032888611,0.004114622,0.0016687964,0.0032993867],"category_scores_gemma":[0.036025908,0.0014073572,0.00088552845,0.002874832,0.0045867544,0.005562595,0.0014718313,0.0033148339,0.00046796797],"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.00056022365,0.00021541493,0.004423751,0.00021648107,0.00011244892,0.0004024839,0.0008343034,0.5541002,0.005109492,0.41665384,0.0038405925,0.013530821],"study_design_scores_gemma":[0.000017798146,0.000029056573,0.0006530145,0.000017638078,0.000021316182,0.000041492694,0.00008666487,0.96960896,0.0003250337,0.028973576,0.00020032769,0.000025172856],"about_ca_topic_score_codex":0.011114678,"about_ca_topic_score_gemma":0.0057373336,"teacher_disagreement_score":0.011114678,"about_ca_system_score_codex":0.0058104983,"about_ca_system_score_gemma":0.0032148242,"threshold_uncertainty_score":0.048929036},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46272966,0.0021989096,0.5265311,0.0018565494,0.0002372717,0.000067811896,0.00012183744,0.00034267825,0.0059141717],"genre_scores_gemma":[0.99245054,0.0003454715,0.005147687,0.00006760395,0.00008767218,0.000024222249,0.000033423737,0.000028217824,0.0018150634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833447,0.0007028263,0.000054515673,0.0001860632,0.00035970996,0.00036254418],"domain_scores_gemma":[0.9902705,0.0070482343,0.00078633346,0.00028175223,0.0010923762,0.0005207307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036728717,0.00053317857,0.0012813848,0.0010273688,0.0013342733,0.0031401808,0.0013311881,0.0010476629,0.0020567842],"category_scores_gemma":[0.023448579,0.000853863,0.00031293786,0.001159015,0.0017486247,0.0036758077,0.0014555681,0.0010452052,0.00014885835],"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.00036953297,0.00007905387,0.0027471706,0.00007344419,0.000037945112,0.00022082683,0.00026415425,0.81546915,0.0023650064,0.16666605,0.0016159758,0.010091805],"study_design_scores_gemma":[0.000009518368,0.0000124857825,0.0002491811,0.00000459127,0.000008616007,0.000020341611,0.000033543474,0.9777385,0.00012423989,0.021625062,0.00016678077,0.0000071444124],"about_ca_topic_score_codex":0.009425082,"about_ca_topic_score_gemma":0.0060242754,"teacher_disagreement_score":0.009425082,"about_ca_system_score_codex":0.0033344026,"about_ca_system_score_gemma":0.001363341,"threshold_uncertainty_score":0.02419293},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4559038,0.00027200294,0.5194913,0.0034542996,0.00018402393,0.00038820642,0.00031841968,0.00060126005,0.01938663],"genre_scores_gemma":[0.9597138,0.00009191512,0.037637427,0.00013860343,0.000075120166,0.000108396096,0.0000824999,0.00005230153,0.0020998248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946114,0.0024735362,0.00033570034,0.00067364064,0.00045491196,0.0014507899],"domain_scores_gemma":[0.97623026,0.014769792,0.0019179729,0.0028337666,0.0017725786,0.0024756056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071469024,0.0007967049,0.0027687107,0.0015843222,0.0017167953,0.0038144707,0.002247799,0.0027686593,0.005584208],"category_scores_gemma":[0.03506816,0.0010639831,0.00062683545,0.0023150877,0.001571903,0.0047395104,0.0028907107,0.0017714839,0.00071747333],"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.0041372553,0.0015202967,0.01090123,0.0004593644,0.00026836107,0.0008193193,0.0008265658,0.6711073,0.006803841,0.14871614,0.014685123,0.13975528],"study_design_scores_gemma":[0.00032522186,0.00020736155,0.0018163836,0.00004760214,0.00009599092,0.00019030744,0.00065493246,0.7473423,0.0021802122,0.24552672,0.0015764483,0.000036571655],"about_ca_topic_score_codex":0.0032684836,"about_ca_topic_score_gemma":0.002676667,"teacher_disagreement_score":0.0071469024,"about_ca_system_score_codex":0.0017058321,"about_ca_system_score_gemma":0.00596396,"threshold_uncertainty_score":0.037796915},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028652798,0.00025948547,0.96720046,0.00021945807,0.000100916295,0.00008326447,0.00009091431,0.001160309,0.002232278],"genre_scores_gemma":[0.59061646,0.00033971292,0.4020702,0.00014805616,0.0001133853,0.00014115134,0.00022453579,0.00036749998,0.0059790355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765164,0.0009249935,0.00016018472,0.00026607487,0.00053279643,0.00046435892],"domain_scores_gemma":[0.9959518,0.0016200654,0.00030668484,0.0010577516,0.00072785607,0.0003357681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039715003,0.00083285646,0.0013011793,0.0009365558,0.0017575852,0.0027545122,0.0027437783,0.0009559318,0.0038492428],"category_scores_gemma":[0.010462859,0.00094461633,0.00097165845,0.0010393333,0.0009416456,0.0027396164,0.0017260597,0.0015762066,0.0011018793],"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.0010007714,0.0002311605,0.0010148879,0.000165885,0.000113349866,0.00028114516,0.0003046222,0.76748395,0.018243317,0.10057117,0.0059862803,0.10460342],"study_design_scores_gemma":[0.000014038451,0.000029325129,0.00007856663,0.000005641491,0.000017277374,0.0000311015,0.00001718625,0.98194355,0.0019584256,0.015194488,0.0006924897,0.000017842807],"about_ca_topic_score_codex":0.0058965,"about_ca_topic_score_gemma":0.0074155685,"teacher_disagreement_score":0.0058965,"about_ca_system_score_codex":0.0024251633,"about_ca_system_score_gemma":0.0026116811,"threshold_uncertainty_score":0.021003544},"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":"editorial","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025283126,0.001340013,0.005514512,0.037582953,0.94766,0.000034968813,0.001695924,0.0005988578,0.005319993],"genre_scores_gemma":[0.040353756,0.0091448035,0.025688777,0.05645005,0.51684755,0.00032101784,0.0054678028,0.0035692295,0.3421571],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99555343,0.0008352089,0.0007720936,0.000677062,0.001677789,0.00048441094],"domain_scores_gemma":[0.9601711,0.0066997274,0.0009705603,0.003658236,0.027093768,0.0014066198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033791955,0.003342257,0.0020466207,0.005334953,0.0041168756,0.0049474644,0.003965753,0.0065272506,0.086747065],"category_scores_gemma":[0.062927,0.0013008844,0.0021216434,0.005692308,0.0029996233,0.0054879705,0.002729719,0.010895074,0.048088007],"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.000034040768,0.000005816773,0.000050927807,0.000112631744,0.000012566255,0.00008081918,0.000030483845,0.0001521636,0.000057719386,0.0067204004,0.988015,0.004727436],"study_design_scores_gemma":[0.000048803384,0.000020871048,0.00077954534,0.00017994808,0.00003477415,0.00038123084,0.000077391385,0.0019235519,0.0006355944,0.019715892,0.9761363,0.00006613042],"about_ca_topic_score_codex":0.019324204,"about_ca_topic_score_gemma":0.018436952,"teacher_disagreement_score":0.086747065,"about_ca_system_score_codex":0.0046737455,"about_ca_system_score_gemma":0.0045765634,"threshold_uncertainty_score":0.29019785},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034103565,0.0005450501,0.9564447,0.00048332807,0.000055500655,0.00003876965,0.00008605771,0.00023107615,0.008011967],"genre_scores_gemma":[0.86815983,0.0014081588,0.120642014,0.00029213505,0.00029445323,0.0002515896,0.0003032609,0.00030239768,0.0083461525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839944,0.0005175319,0.00006825016,0.00022577793,0.0005673188,0.00022175015],"domain_scores_gemma":[0.9925592,0.004769875,0.0006965018,0.0007743549,0.00089283043,0.0003072332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040366375,0.00092224916,0.0011296506,0.0019714723,0.0009034701,0.002165046,0.001694179,0.0014956127,0.004726875],"category_scores_gemma":[0.022238152,0.00065147405,0.0012690199,0.0011126625,0.003091987,0.004545667,0.0023304515,0.0030603295,0.0010779353],"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.000035873138,0.000053772,0.0007862319,0.00008634817,0.000027956978,0.000355603,0.00027714996,0.25828522,0.0021972582,0.72816,0.0012167422,0.0085178595],"study_design_scores_gemma":[0.0000087771805,0.000015785656,0.00023342072,0.000030668754,0.000009463598,0.00008911572,0.00003643526,0.73496616,0.00046881952,0.26329172,0.0008286872,0.000020983256],"about_ca_topic_score_codex":0.004257517,"about_ca_topic_score_gemma":0.0023973933,"teacher_disagreement_score":0.004726875,"about_ca_system_score_codex":0.0025915587,"about_ca_system_score_gemma":0.001669906,"threshold_uncertainty_score":0.021348},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40380397,0.009609015,0.55518234,0.00463445,0.0003100544,0.0001010222,0.00034040055,0.0007940171,0.025224807],"genre_scores_gemma":[0.97558856,0.003187477,0.015005259,0.00022407983,0.0005725119,0.000074581556,0.00015410862,0.00016736994,0.005025971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999091,0.00039958718,0.00004335846,0.00018261837,0.00017054922,0.0001128858],"domain_scores_gemma":[0.98405266,0.010648017,0.001779339,0.00071528624,0.0015684278,0.0012362828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004033587,0.000892622,0.0010291513,0.003095128,0.0010367271,0.0026021642,0.0012955151,0.0014697991,0.00402471],"category_scores_gemma":[0.0300665,0.0004480761,0.00075678073,0.001982017,0.0038953056,0.0051036086,0.0017948664,0.0021213687,0.00039536538],"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.0001444479,0.000091831214,0.004536996,0.00022617647,0.000053443837,0.0006128965,0.00093817123,0.07750646,0.007189776,0.88904923,0.0023731072,0.017277613],"study_design_scores_gemma":[0.000021274303,0.00007151751,0.0031283568,0.000073236406,0.000035776542,0.00049290265,0.00026978433,0.46862498,0.001002508,0.5247,0.001516674,0.00006303608],"about_ca_topic_score_codex":0.0024329813,"about_ca_topic_score_gemma":0.0011517358,"teacher_disagreement_score":0.004033587,"about_ca_system_score_codex":0.0017236393,"about_ca_system_score_gemma":0.0006909578,"threshold_uncertainty_score":0.021331847},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5536567,0.0009929205,0.43309534,0.0017584191,0.00049349724,0.000105847495,0.0002078686,0.000865688,0.008823764],"genre_scores_gemma":[0.99598557,0.00009376121,0.0018834833,0.00003351318,0.00003600511,0.000014956922,0.00001885958,0.00001607885,0.0019178834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856204,0.00030735493,0.00007274641,0.00034660962,0.00028290384,0.0004283257],"domain_scores_gemma":[0.9961281,0.0021054156,0.00051025505,0.00019077772,0.00060114975,0.00046431352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023440365,0.0011963756,0.0019713636,0.00091378833,0.0012051263,0.0036545382,0.0027341037,0.0016518428,0.002013836],"category_scores_gemma":[0.0066815563,0.0007048458,0.000661011,0.0009851543,0.0023711415,0.0013611406,0.001669262,0.0017854687,0.0002606614],"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.0004877851,0.00010960923,0.00084793736,0.00006470345,0.000050430128,0.00031885467,0.00014993813,0.9665468,0.006686832,0.018021466,0.0005469299,0.0061688134],"study_design_scores_gemma":[0.00001740598,0.000028210236,0.00016456291,0.0000022026345,0.000010800788,0.000012822278,0.000008702513,0.9977592,0.0002476959,0.0016701856,0.00006989983,0.000008234103],"about_ca_topic_score_codex":0.02062512,"about_ca_topic_score_gemma":0.007533738,"teacher_disagreement_score":0.02062512,"about_ca_system_score_codex":0.0025878267,"about_ca_system_score_gemma":0.0020267852,"threshold_uncertainty_score":0.04101014},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13274665,0.0048120487,0.8432738,0.0056071724,0.00051003805,0.0001207466,0.00032903347,0.00026619984,0.012334268],"genre_scores_gemma":[0.9418441,0.0028879812,0.025225805,0.00041574414,0.0004775635,0.00016179624,0.0002781624,0.00016506593,0.028543815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973066,0.0012622743,0.00008384813,0.00038870182,0.00044885528,0.00050980947],"domain_scores_gemma":[0.9819571,0.013721976,0.0017091963,0.00036536105,0.0011810224,0.0010653888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073975287,0.0025874858,0.003437875,0.0029494325,0.0012887801,0.0058411844,0.0042595593,0.0049234824,0.0043758918],"category_scores_gemma":[0.026321236,0.0021218532,0.0019197207,0.0017501261,0.005134613,0.0063959467,0.002793962,0.004365359,0.00030000138],"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.00008849284,0.000078750105,0.0005794424,0.000075396194,0.00006504371,0.0001721815,0.00011528519,0.7369589,0.00094292226,0.2581989,0.00087209046,0.0018525693],"study_design_scores_gemma":[0.000009789976,0.0000112135085,0.00008669141,0.000007991945,0.00001246394,0.000015597976,0.0000146368375,0.97208947,0.000093728086,0.027481673,0.0001634346,0.000013369829],"about_ca_topic_score_codex":0.017899808,"about_ca_topic_score_gemma":0.0055644577,"teacher_disagreement_score":0.017899808,"about_ca_system_score_codex":0.0062632305,"about_ca_system_score_gemma":0.0047036195,"threshold_uncertainty_score":0.045443118},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8231988,0.0005585179,0.16083728,0.002039456,0.00015502732,0.00021932754,0.00013072586,0.0003616572,0.012499225],"genre_scores_gemma":[0.9738056,0.00007275,0.025005952,0.000115617324,0.00003424892,0.000021231348,0.000042411884,0.0000385784,0.0008635451],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963862,0.0016092468,0.00014998278,0.0004692038,0.0004010307,0.0009843642],"domain_scores_gemma":[0.990577,0.0051761586,0.00039489244,0.0013903469,0.0008660609,0.0015955783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005265129,0.00070706196,0.0013817976,0.0011578106,0.0020062164,0.004017915,0.002065144,0.0014259795,0.008007216],"category_scores_gemma":[0.013858942,0.0007089856,0.00087212655,0.0016202534,0.00086477667,0.0053374986,0.0021609468,0.0016445443,0.0007279508],"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.009169085,0.0020218415,0.05495564,0.00022864004,0.0007977346,0.0018691381,0.00071895396,0.45966503,0.020516686,0.13979827,0.011924579,0.2983344],"study_design_scores_gemma":[0.00025919787,0.00051240146,0.0053586205,0.000032883025,0.00020686508,0.00028737605,0.0009252303,0.91430557,0.0047227805,0.07092792,0.0023973794,0.00006378426],"about_ca_topic_score_codex":0.0018086745,"about_ca_topic_score_gemma":0.0043428047,"teacher_disagreement_score":0.008007216,"about_ca_system_score_codex":0.0014953684,"about_ca_system_score_gemma":0.0019068515,"threshold_uncertainty_score":0.027845025},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2562302,0.0023413124,0.72753173,0.0012820074,0.000104583654,0.000042416512,0.00017884333,0.00014233636,0.012146556],"genre_scores_gemma":[0.9564231,0.0022007977,0.03300183,0.00017353648,0.00038416593,0.00011176471,0.00017307154,0.00007726823,0.0074544605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744475,0.0010355914,0.00014202204,0.00046361666,0.0005114471,0.0004026151],"domain_scores_gemma":[0.9806548,0.013047182,0.0027508084,0.000950092,0.0014934983,0.001103538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005305263,0.001373155,0.0017880006,0.0036296954,0.0016662206,0.004069297,0.0023311079,0.0021404966,0.0032707462],"category_scores_gemma":[0.020573514,0.0008842301,0.0016900798,0.0026052215,0.006753742,0.008448894,0.004432989,0.0036538246,0.0003781545],"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.000032782427,0.000017961558,0.00039384695,0.00003446395,0.00002376295,0.000048728376,0.00016615979,0.008106845,0.0003242095,0.9889832,0.00017994264,0.0016880985],"study_design_scores_gemma":[0.00002107371,0.000042804026,0.00056215224,0.000026853522,0.00004142142,0.00012981918,0.00014968125,0.13429765,0.00051986636,0.8631946,0.0009774868,0.000036598154],"about_ca_topic_score_codex":0.0021123015,"about_ca_topic_score_gemma":0.0013534835,"teacher_disagreement_score":0.005305263,"about_ca_system_score_codex":0.0024585393,"about_ca_system_score_gemma":0.0015434413,"threshold_uncertainty_score":0.028057218},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6208116,0.0011793561,0.34795284,0.0043873196,0.0006992933,0.00014704594,0.0007134635,0.00070529303,0.023403715],"genre_scores_gemma":[0.981501,0.00025895378,0.01039259,0.0002047372,0.00020956981,0.000028002556,0.00012461146,0.000042452422,0.007238072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994336,0.0000942284,0.000018850282,0.000112023066,0.00016229073,0.0001790588],"domain_scores_gemma":[0.9982103,0.00068920816,0.0003068719,0.0002037312,0.00030927898,0.00028063607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013227491,0.0005721056,0.00088769034,0.0009589636,0.0015149949,0.0022680839,0.0017201868,0.0016750236,0.0033091325],"category_scores_gemma":[0.006665865,0.0004031186,0.00062452536,0.00095528446,0.0016266032,0.002368916,0.0016079037,0.0018269201,0.00038083797],"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.00055718166,0.00014922385,0.0043527866,0.00012607283,0.0000480852,0.00081942003,0.00034662097,0.20719361,0.008239553,0.75831187,0.00673048,0.013125057],"study_design_scores_gemma":[0.000043522927,0.00005628789,0.0009802034,0.000011833053,0.000025487028,0.00012658411,0.00005381118,0.90615857,0.0012526567,0.09057152,0.00067865994,0.00004090535],"about_ca_topic_score_codex":0.01061103,"about_ca_topic_score_gemma":0.0061999112,"teacher_disagreement_score":0.01061103,"about_ca_system_score_codex":0.002655488,"about_ca_system_score_gemma":0.0026589863,"threshold_uncertainty_score":0.021098554},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88900006,0.0013696734,0.100821376,0.0012011152,0.000106337066,0.00005036736,0.0002570577,0.00007489472,0.0071192733],"genre_scores_gemma":[0.9962954,0.00018916407,0.0015466701,0.000059548493,0.00005011087,0.0000101854275,0.000056234072,0.0000070329907,0.0017857096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985442,0.0007277748,0.00005189328,0.00027897808,0.00021206477,0.00018508281],"domain_scores_gemma":[0.98351073,0.012231259,0.0017262482,0.0010322954,0.0011347948,0.00036466582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029602705,0.00036374037,0.000566191,0.0012298211,0.0005055339,0.0013924749,0.0010209812,0.0012626811,0.00250627],"category_scores_gemma":[0.030531634,0.0002632328,0.00030059688,0.00064553693,0.001965824,0.0021423164,0.00089831586,0.0009095017,0.0003934184],"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.0020493015,0.0003403316,0.16896634,0.0008729772,0.000728421,0.0018700574,0.0046331314,0.21810035,0.056258105,0.36923546,0.009324891,0.16762066],"study_design_scores_gemma":[0.00007378859,0.00022537552,0.046402343,0.00010436848,0.00014234142,0.002325011,0.0011711774,0.7009924,0.019473946,0.22255294,0.006328914,0.000207334],"about_ca_topic_score_codex":0.003425664,"about_ca_topic_score_gemma":0.0009575078,"teacher_disagreement_score":0.003425664,"about_ca_system_score_codex":0.0008437391,"about_ca_system_score_gemma":0.0002450403,"threshold_uncertainty_score":0.015655577},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020519527,0.0022162695,0.94774675,0.0033759496,0.00069319416,0.00003088371,0.00023653804,0.00035380424,0.0248271],"genre_scores_gemma":[0.8099488,0.0041906526,0.10564705,0.0013939121,0.0021695772,0.00014399181,0.0006757181,0.00038212354,0.075448215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974957,0.0010684062,0.00006123827,0.0004151343,0.00058428646,0.00037518854],"domain_scores_gemma":[0.9862069,0.009488509,0.0004939086,0.0019120642,0.0013256466,0.0005729834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006180767,0.000982614,0.0016766256,0.0015019473,0.0011375302,0.0029525526,0.0039980994,0.002078186,0.009326502],"category_scores_gemma":[0.03455837,0.0009528298,0.0013507201,0.0022634023,0.0029850476,0.005678625,0.002253145,0.006254031,0.0016494627],"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.000037506365,0.000033583572,0.0005543491,0.0000439876,0.000024793007,0.000083508356,0.00009358059,0.041875932,0.00020219367,0.94456977,0.0049251164,0.00755567],"study_design_scores_gemma":[0.000014752176,0.00000878226,0.00026196183,0.000017601822,0.000015974516,0.00005807613,0.000029071245,0.55505925,0.00015685969,0.44132978,0.003034041,0.000013784374],"about_ca_topic_score_codex":0.007419486,"about_ca_topic_score_gemma":0.0035166896,"teacher_disagreement_score":0.009326502,"about_ca_system_score_codex":0.0033028084,"about_ca_system_score_gemma":0.0031370672,"threshold_uncertainty_score":0.032687366},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013141804,0.0007737937,0.9806231,0.0003435749,0.00010575523,0.000031185195,0.000044598408,0.0002481597,0.0046879863],"genre_scores_gemma":[0.82563883,0.0026214493,0.14733298,0.0004138166,0.00086750515,0.00023457938,0.00032080448,0.00057097216,0.021999056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881196,0.00047990173,0.000050229828,0.00011796251,0.00039501284,0.00014493843],"domain_scores_gemma":[0.99172676,0.0053054676,0.00036357203,0.00062500604,0.001663422,0.0003158335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037409468,0.00084313186,0.0010342884,0.0026149387,0.0006468882,0.0021794008,0.002168376,0.0012103636,0.003753311],"category_scores_gemma":[0.021301946,0.00052321685,0.0010353985,0.0015441873,0.0019458031,0.0045005926,0.002091993,0.003186481,0.00097231223],"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.00005923882,0.00012857323,0.0008981522,0.0001476891,0.0000631528,0.00012629121,0.00028865208,0.11539538,0.0032181586,0.8529091,0.0028453895,0.0239202],"study_design_scores_gemma":[0.000004201329,0.000009403431,0.00022564143,0.000012836894,0.000008176967,0.00004165783,0.000022322469,0.9106044,0.00027517253,0.08794775,0.0008357111,0.000012625252],"about_ca_topic_score_codex":0.003773608,"about_ca_topic_score_gemma":0.0016079725,"teacher_disagreement_score":0.003773608,"about_ca_system_score_codex":0.0021279377,"about_ca_system_score_gemma":0.0020389762,"threshold_uncertainty_score":0.019784272},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01297972,0.00037388614,0.9848608,0.000504287,0.00008980231,0.000030030278,0.0001347807,0.0003017553,0.0007249441],"genre_scores_gemma":[0.7794098,0.0019868957,0.20763667,0.00073220546,0.0011947552,0.0003636119,0.0013394591,0.00031814305,0.007018368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927146,0.004161903,0.00025716706,0.0012189554,0.0011777824,0.0004696875],"domain_scores_gemma":[0.89991903,0.09096097,0.0022174325,0.0036591862,0.0023733831,0.00086994056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01716257,0.0009983549,0.0024171926,0.0035511793,0.0013004453,0.0027836938,0.0043100626,0.0025471468,0.003962069],"category_scores_gemma":[0.087659135,0.0015831068,0.0020470717,0.0024622914,0.0031302185,0.0059064813,0.0021145882,0.0044469205,0.0005059825],"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.00015554855,0.0002514012,0.0029714326,0.0001778507,0.00027244692,0.00010278191,0.00015935091,0.53805393,0.00080706656,0.40961584,0.0033964645,0.044035982],"study_design_scores_gemma":[0.000014224814,0.00001368445,0.00023420132,0.000012834489,0.000014594428,0.000014013712,0.000009541076,0.80351174,0.0001336724,0.19579063,0.000239334,0.000011474673],"about_ca_topic_score_codex":0.010326384,"about_ca_topic_score_gemma":0.006812437,"teacher_disagreement_score":0.01716257,"about_ca_system_score_codex":0.0031200766,"about_ca_system_score_gemma":0.004079552,"threshold_uncertainty_score":0.090765476},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10716817,0.0056657176,0.83579516,0.007949425,0.0011193221,0.00019834773,0.0015716304,0.00066052703,0.03987169],"genre_scores_gemma":[0.9180622,0.0031841197,0.02121705,0.0007116914,0.0007626649,0.0002952747,0.0007712289,0.00025341133,0.05474229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702245,0.0012534607,0.00012047277,0.0004303022,0.00041007833,0.000763223],"domain_scores_gemma":[0.99002844,0.006861929,0.0008707776,0.00039187793,0.00097306696,0.00087389693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048382804,0.0017258542,0.0031849835,0.0019990765,0.0019517655,0.0069631427,0.0065995306,0.0049858,0.013317195],"category_scores_gemma":[0.015904004,0.0021627964,0.0017002102,0.0034254605,0.0036978177,0.008364978,0.0026034256,0.0042412993,0.0017360754],"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.00008768263,0.000095832,0.0007670967,0.00009798435,0.00004868786,0.0001502499,0.00028040583,0.37662867,0.00028491262,0.61291796,0.0050202897,0.0036201994],"study_design_scores_gemma":[0.000026646314,0.00001723922,0.00013352057,0.000015371854,0.000021174876,0.000026923772,0.000070562935,0.8961123,0.000042696214,0.10216555,0.001348258,0.000019695037],"about_ca_topic_score_codex":0.028122338,"about_ca_topic_score_gemma":0.015548933,"teacher_disagreement_score":0.028122338,"about_ca_system_score_codex":0.006625258,"about_ca_system_score_gemma":0.0033068655,"threshold_uncertainty_score":0.055917263},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040206943,0.0024261943,0.93117195,0.0032609303,0.00057756214,0.00010787616,0.00019169792,0.0003654199,0.021691443],"genre_scores_gemma":[0.8244443,0.0063926717,0.12193665,0.001845243,0.001814387,0.000712135,0.00057646306,0.00080357253,0.04147452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984524,0.0008845953,0.00004937948,0.00013272681,0.00032952367,0.00015121911],"domain_scores_gemma":[0.9892697,0.007402104,0.0007550822,0.00043364693,0.0014886108,0.0006508309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004964207,0.0016921794,0.0013558303,0.0031176675,0.0011267569,0.0026530253,0.0022706524,0.0021631997,0.0051216413],"category_scores_gemma":[0.024789292,0.0007479182,0.0016017685,0.0017842208,0.00346203,0.0043904707,0.0026691395,0.004573465,0.0009403461],"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.00006595246,0.00006292952,0.000297447,0.0001251682,0.00004995646,0.00010081997,0.00017782711,0.067380525,0.0021712433,0.9217416,0.0028844995,0.0049419412],"study_design_scores_gemma":[0.000013835407,0.00001702706,0.00023041392,0.000030560797,0.000020691885,0.00006633051,0.00004438397,0.66489875,0.00032416038,0.33342698,0.00089570065,0.000031096133],"about_ca_topic_score_codex":0.0035716593,"about_ca_topic_score_gemma":0.0012237063,"teacher_disagreement_score":0.0051216413,"about_ca_system_score_codex":0.0032754831,"about_ca_system_score_gemma":0.0019665912,"threshold_uncertainty_score":0.026253521},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16389532,0.0029659898,0.7980457,0.0035442994,0.00045580606,0.00018142545,0.0008162366,0.0015009675,0.028594255],"genre_scores_gemma":[0.9344577,0.001654382,0.042267032,0.0009796366,0.0007647698,0.00023185794,0.0006532714,0.00057761994,0.018413754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808854,0.0005491691,0.00006715363,0.00030095797,0.0005193407,0.00047488065],"domain_scores_gemma":[0.9827071,0.01050814,0.0012508573,0.0017250655,0.0027277418,0.001080975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006834761,0.0016582119,0.0016779972,0.0034097102,0.0013415375,0.003599804,0.004296449,0.0017262313,0.00924564],"category_scores_gemma":[0.037322175,0.00083790155,0.0010959848,0.0019194175,0.0031158733,0.005947719,0.0036883522,0.0049955966,0.0016419135],"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.00043185113,0.00018850336,0.003139472,0.00020412068,0.00006636492,0.00040535713,0.0006913201,0.08275546,0.009191876,0.8731796,0.010354474,0.01939153],"study_design_scores_gemma":[0.00003802551,0.00006836327,0.0013286476,0.00005289086,0.00004029642,0.00015243897,0.0001002766,0.7518241,0.0016717924,0.24293269,0.0017304083,0.00006013817],"about_ca_topic_score_codex":0.00938984,"about_ca_topic_score_gemma":0.005496607,"teacher_disagreement_score":0.00938984,"about_ca_system_score_codex":0.0047883885,"about_ca_system_score_gemma":0.0032697902,"threshold_uncertainty_score":0.036146104},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09572584,0.0007329692,0.87240094,0.0046380293,0.00038299742,0.00014958839,0.00050235714,0.0004031021,0.025064295],"genre_scores_gemma":[0.91881084,0.0009092175,0.037216373,0.00038246866,0.00028854847,0.00017600202,0.00022386361,0.000113775335,0.041878887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861586,0.0004856166,0.000059984774,0.00031382122,0.00026403271,0.00026061392],"domain_scores_gemma":[0.99574214,0.0025562528,0.00031879122,0.00024527052,0.00071570114,0.0004218113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033386853,0.0008666827,0.0015460594,0.001324616,0.0013509908,0.0038587695,0.0035366206,0.0033941758,0.009402303],"category_scores_gemma":[0.010988891,0.0009313182,0.0010487085,0.00159673,0.0024601782,0.006123292,0.0018935881,0.0026153552,0.0010652564],"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.0000766812,0.00009249801,0.00090060476,0.00005100456,0.000030819927,0.00019656614,0.00030248382,0.2289123,0.001363858,0.75876087,0.0030572445,0.0062549966],"study_design_scores_gemma":[0.00002879749,0.000018669247,0.00014140221,0.000008941404,0.000013872788,0.000035376786,0.000043986878,0.8972777,0.00012407264,0.10125274,0.0010313792,0.000023078257],"about_ca_topic_score_codex":0.01784991,"about_ca_topic_score_gemma":0.007151739,"teacher_disagreement_score":0.01784991,"about_ca_system_score_codex":0.004222046,"about_ca_system_score_gemma":0.003410459,"threshold_uncertainty_score":0.035492063},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002512862,0.0020021878,0.00012563197,0.015309815,0.9812431,0.000018150145,0.00003757306,0.000034243956,0.0012041882],"genre_scores_gemma":[0.0003923242,0.0017388931,0.000106864834,0.009683993,0.9784163,0.000024889734,0.000033753102,0.000038055747,0.009564824],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99371666,0.001117227,0.00072982395,0.00087023305,0.0030717184,0.0004943466],"domain_scores_gemma":[0.97922486,0.007319503,0.0017163727,0.0006762678,0.0075598727,0.0035032185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008363044,0.0055041476,0.0048830025,0.005277658,0.0040383576,0.011439199,0.00440875,0.020569362,0.030701058],"category_scores_gemma":[0.027344435,0.0018222574,0.0039725793,0.0020833623,0.00250245,0.004456748,0.0021874604,0.015236039,0.01668882],"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.000046794434,0.000018898187,0.000022065666,0.00013410122,0.00002739569,0.00009833321,0.0000057370794,0.000046119287,0.00006113275,0.00026552373,0.99587375,0.0034002077],"study_design_scores_gemma":[0.0002086709,0.000049497598,0.0004360034,0.0003707777,0.00011543051,0.00022438054,0.000029291137,0.00065203005,0.00017319234,0.0022913578,0.9954151,0.000034287063],"about_ca_topic_score_codex":0.0018869272,"about_ca_topic_score_gemma":0.005179536,"teacher_disagreement_score":0.030701058,"about_ca_system_score_codex":0.004646678,"about_ca_system_score_gemma":0.0032693536,"threshold_uncertainty_score":0.1027053},"labels":[],"label_agreement":null}]}