{"meta":{"query_hash":"e1b794f1aaa0","filters":{"venue":"ACM Transactions on Modeling and Computer Simulation"},"cohort_total":41,"direct_labels_cover":1,"predictions_cover":41,"exported":41,"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/e1b794f1aaa0","api":"https://metacan.xera.ac/api/v1/cohort?venue=ACM+Transactions+on+Modeling+and+Computer+Simulation"},"results":[{"id":"W1984785310","doi":"10.1145/369534.369537","title":"Parallel shared-memory simulator performance for large ATM networks","year":2000,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parallel computing; Speedup; Kernel (algebra); Benchmark (surveying); Multiprocessing; Shared memory; Performance improvement","score_opus":0.023250719919683076,"score_gpt":0.2653314796262749,"score_spread":0.24208075970659182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984785310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015892552,0.00006980406,0.9826216,0.00015871864,0.00017345155,0.0003355475,0.00000470844,0.0006953829,0.000048245813],"genre_scores_gemma":[0.695967,0.00007500836,0.30332288,0.00037896194,0.000089986155,0.000026602584,0.000012315275,0.000014842528,0.00011238074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986074,0.000047239213,0.0003310062,0.00052048446,0.00016888726,0.0003249888],"domain_scores_gemma":[0.99893147,0.00019793908,0.00005599704,0.0005989175,0.00011983415,0.000095838266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024059141,0.00021675427,0.00019776342,0.00012519163,0.00059829536,0.00021110148,0.00046987474,0.00013164067,0.000016436574],"category_scores_gemma":[0.000004316874,0.00022205284,0.000098873614,0.00021579042,0.000011998482,0.00054547744,0.00001803871,0.00017968603,0.000008384476],"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.000028478635,0.00005575894,0.000008535137,0.000009083667,0.000011828018,2.4742363e-7,0.0001589693,0.7924119,2.1181914e-7,0.00012585464,0.000018406905,0.20717071],"study_design_scores_gemma":[0.0008185729,0.00018890385,0.000050655533,0.000049338014,0.000011714583,0.0000028902725,0.0000021647704,0.9973732,0.000007653937,0.0009132245,0.00032181022,0.00025986505],"about_ca_topic_score_codex":0.000004278703,"about_ca_topic_score_gemma":8.9768207e-7,"teacher_disagreement_score":0.68007445,"about_ca_system_score_codex":0.00002897638,"about_ca_system_score_gemma":0.000021653346,"threshold_uncertainty_score":0.90550524},"labels":[],"label_agreement":null},{"id":"W1990674830","doi":"10.1145/1225275.1225280","title":"Rare events, splitting, and quasi-Monte Carlo","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Probability and Risk Models","field":"Decision Sciences","cited_by":89,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Estimator; Monte Carlo method; Variance reduction; Importance sampling; Computer science; Rare events; Context (archaeology); Markov chain Monte Carlo; Disjoint sets; Markov chain; Algorithm; Sequence (biology); Measure (data warehouse); Sampling (signal processing); Mathematical optimization; Statistical physics; Mathematics; Statistics; Discrete mathematics; Physics; Machine learning","score_opus":0.10067338486188931,"score_gpt":0.36408016069703664,"score_spread":0.2634067758351473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990674830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43457016,0.000084298146,0.5648786,0.00017985221,0.00013666392,0.00009079745,0.0000031741813,0.000040609044,0.000015887845],"genre_scores_gemma":[0.9763387,0.000031526422,0.023291135,0.00016716971,0.00007311419,0.000002362265,0.0000011761871,0.000008843588,0.00008600571],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982204,0.00009390204,0.00049837236,0.00050779013,0.0004773017,0.00020227332],"domain_scores_gemma":[0.9982236,0.00089973555,0.00007774546,0.0004955929,0.00018384858,0.00011948976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016937861,0.00014416088,0.00019266485,0.00022058102,0.0004236538,0.00012914017,0.00022061355,0.00011458133,0.000008458917],"category_scores_gemma":[0.000076767625,0.000117258576,0.00007503696,0.0002270433,0.00003539495,0.00037457398,0.000018362407,0.00019016022,0.000008431993],"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.000040378654,0.00004438087,0.00039735416,0.0000031589316,0.0000063155085,5.9884337e-7,0.0005897429,0.7268309,0.0000023419166,0.00007896713,0.000001492633,0.27200437],"study_design_scores_gemma":[0.00035781262,0.0001006498,0.001031035,0.000025755258,0.000014647075,0.0000045896736,0.000089870475,0.95921326,0.000011055396,0.038914848,0.000106673564,0.00012979511],"about_ca_topic_score_codex":0.000065188346,"about_ca_topic_score_gemma":0.000065916356,"teacher_disagreement_score":0.5417685,"about_ca_system_score_codex":0.000023928975,"about_ca_system_score_gemma":0.000017239328,"threshold_uncertainty_score":0.47816658},"labels":[],"label_agreement":null},{"id":"W1990749876","doi":"10.1145/1596519.1596521","title":"FISTE","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Quality of service; Network traffic simulation; Distributed computing; Computer network; Traffic engineering; Traffic generation model; Network traffic control; Queue; Sampling (signal processing); Traffic classification","score_opus":0.021844129165387045,"score_gpt":0.2501052288329259,"score_spread":0.22826109966753885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990749876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008662073,0.000054362095,0.9889016,0.0016668483,0.0002329562,0.000089831236,4.85369e-7,0.00030479179,0.00008706405],"genre_scores_gemma":[0.9325631,0.000016539056,0.06619189,0.0010855723,0.0000905751,0.0000031518498,0.000001172234,0.0000039344013,0.000044011213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992032,0.000034834524,0.00016896022,0.0003019773,0.00014145301,0.00014954069],"domain_scores_gemma":[0.99933773,0.00009672801,0.000027913093,0.0004082715,0.000058887425,0.00007045074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000093871284,0.00011566211,0.00010581022,0.00008971486,0.00022178105,0.0001367006,0.00026782256,0.000056479843,0.0000029174657],"category_scores_gemma":[0.0000024466403,0.00011314401,0.000050246465,0.0001491921,0.0000077373,0.00030282186,0.0000049097926,0.00012702732,0.0000114867335],"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.000004985536,0.000019379544,5.7593786e-7,5.4194584e-7,0.0000033206056,5.338161e-7,0.00006301022,0.52700883,0.0000012702751,0.0013607405,0.0000031257955,0.47153372],"study_design_scores_gemma":[0.0003792455,0.0001464116,0.000048698563,0.000016365693,0.000007644623,0.000004003324,0.0000021402786,0.98924303,0.000004326852,0.009894171,0.00012939757,0.00012458167],"about_ca_topic_score_codex":0.000002204621,"about_ca_topic_score_gemma":8.292796e-7,"teacher_disagreement_score":0.9239011,"about_ca_system_score_codex":0.000013852774,"about_ca_system_score_gemma":0.000013387776,"threshold_uncertainty_score":0.46138787},"labels":[],"label_agreement":null},{"id":"W2000167291","doi":"10.1145/1870085.1870090","title":"Joint congestion control and distributed scheduling for throughput guarantees in wireless networks","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Air Force Office of Scientific Research; Division of Computer and Network Systems","keywords":"Computer science; Scheduling (production processes); Wireless network; Round-robin scheduling; Distributed computing; Computer network; Maximum throughput scheduling; Network congestion; Dynamic priority scheduling; Fair-share scheduling; Wireless; Mathematical optimization; Network packet; Quality of service; Telecommunications; Mathematics","score_opus":0.025908901390723743,"score_gpt":0.2718026307721484,"score_spread":0.24589372938142465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000167291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12160633,0.000028927883,0.8762387,0.00042907777,0.00027769853,0.0013114671,0.0000058126666,0.00010091135,0.0000010952741],"genre_scores_gemma":[0.9264075,0.000019569761,0.07298568,0.00014008387,0.00013007062,0.00029546858,0.000009274845,0.000011118712,0.0000012050252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988848,0.000051399908,0.00030972497,0.0004177388,0.00010744695,0.00022888496],"domain_scores_gemma":[0.9990892,0.00035051594,0.00006754824,0.00032602256,0.00010227283,0.00006445618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033133684,0.0001687854,0.0002200543,0.000100792844,0.00026558238,0.00022700553,0.00018407509,0.00015875496,6.392004e-7],"category_scores_gemma":[0.000008923628,0.00016465718,0.000049775328,0.0001556168,0.000028369104,0.00039412788,0.000013383393,0.0003260373,3.1839065e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043831544,0.000037397727,0.000071450966,0.000012885367,0.000009925781,5.2690905e-7,0.000098792385,0.86689574,0.000044622146,0.001644403,6.3666965e-7,0.1311398],"study_design_scores_gemma":[0.0015991549,0.00011966935,0.00051871396,0.000092049326,0.000010744015,0.0000043229643,0.0000052746295,0.9918202,0.000016195432,0.005615949,0.000014234951,0.00018345591],"about_ca_topic_score_codex":0.000026850743,"about_ca_topic_score_gemma":0.000040150015,"teacher_disagreement_score":0.8048012,"about_ca_system_score_codex":0.000014331149,"about_ca_system_score_gemma":0.000018115681,"threshold_uncertainty_score":0.67145246},"labels":[],"label_agreement":null},{"id":"W2010523529","doi":"10.1145/1113316.1113319","title":"On the xorshift random number generators","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Random number generation; Modulo; Pseudorandom number generator; Mathematics; Simple (philosophy); Arithmetic; Class (philosophy); Computer science; Generator (circuit theory); Discrete mathematics; Algorithm; Artificial intelligence; Power (physics)","score_opus":0.026033544115530327,"score_gpt":0.2600723811718375,"score_spread":0.23403883705630718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010523529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10973844,0.000015103244,0.8874356,0.0021317047,0.00023762159,0.0001722117,0.0000015519191,0.00019699932,0.00007077819],"genre_scores_gemma":[0.9314368,0.000010976223,0.06674849,0.0015814286,0.00016620304,0.00001623494,0.0000025204113,0.000013039489,0.000024296665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873745,0.00013191186,0.00024951057,0.00039614915,0.00029257618,0.00019237908],"domain_scores_gemma":[0.99862653,0.00054705027,0.000051521063,0.0006192554,0.00008401142,0.00007163012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031205945,0.00018169421,0.00012962053,0.00010408683,0.0004365022,0.00023347422,0.00038536143,0.000071819,0.000023743476],"category_scores_gemma":[0.00001339788,0.00014081899,0.00008898107,0.00023029922,0.00002234863,0.00047720366,0.0000148158315,0.0002457616,0.00009049296],"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.000031505675,0.000053795393,0.0000020592704,0.0000019706831,0.000011724102,4.8791185e-7,0.0002937624,0.88234705,0.000024789537,0.0024644497,0.000025988582,0.114742436],"study_design_scores_gemma":[0.0008091682,0.00006344573,0.00001302841,0.00002469397,0.000011335311,0.0000039357965,0.0000042660035,0.9868473,0.00028746232,0.0116657885,0.000107454915,0.00016216264],"about_ca_topic_score_codex":0.000016171172,"about_ca_topic_score_gemma":0.0000055231276,"teacher_disagreement_score":0.82169837,"about_ca_system_score_codex":0.00005223223,"about_ca_system_score_gemma":0.000023840117,"threshold_uncertainty_score":0.5742431},"labels":[],"label_agreement":null},{"id":"W2021233452","doi":"10.1145/1734222.1734223","title":"Setwise and filtered gibbs samplers for teletraffic analysis","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Gibbs sampling; Estimator; Markov chain; Computer science; Occupancy; Markov process; Applied mathematics; Markov chain Monte Carlo; Mathematical optimization; Algorithm; Mathematics; Statistics; Artificial intelligence; Bayesian probability; Machine learning; Engineering","score_opus":0.02660623500649122,"score_gpt":0.2626521806922541,"score_spread":0.23604594568576287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021233452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38682896,0.0000049108125,0.6127774,0.00013542216,0.000077030636,0.0000855966,0.0000037083587,0.00008056569,0.0000064004394],"genre_scores_gemma":[0.9681012,0.0000033132362,0.03125562,0.00032451423,0.00023407735,0.000012793544,0.00003650993,0.00001625581,0.000015731297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992297,0.000007977073,0.00019744952,0.0003275154,0.000093836454,0.00014348893],"domain_scores_gemma":[0.9993528,0.00020894753,0.000071689225,0.00024436638,0.00010486247,0.000017307108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019351579,0.0001417795,0.00018550004,0.00045543883,0.0003584273,0.00017389323,0.000101799116,0.00006838718,0.000019884887],"category_scores_gemma":[0.000023250821,0.00014203024,0.00011496943,0.00038233856,0.000026321566,0.00048229803,0.000009299407,0.00013723824,0.0000028152745],"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.000044420533,0.000025979814,0.00006626838,0.000018392302,0.00013245623,1.734634e-7,0.000043382446,0.9292415,0.000051690273,0.0004780032,0.0000016390384,0.06989614],"study_design_scores_gemma":[0.0003836651,0.000011531995,0.00015368199,0.0000072919242,0.000578705,3.295599e-7,0.000021750522,0.98772794,0.000005364517,0.010682538,0.0002648671,0.00016236326],"about_ca_topic_score_codex":0.000048524093,"about_ca_topic_score_gemma":0.00009788728,"teacher_disagreement_score":0.58152175,"about_ca_system_score_codex":0.000006657259,"about_ca_system_score_gemma":0.0000038004694,"threshold_uncertainty_score":0.5791825},"labels":[],"label_agreement":null},{"id":"W2022664864","doi":"10.1145/1122012.1122016","title":"Perfect sampling for queues and network models","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Western University","funders":"","keywords":"Computer science; Queue; Reservation; Queueing theory; Protocol (science); Poisson distribution; Construct (python library); Sampling (signal processing); Service (business); Fork–join queue; Computer network; Mathematics; Queue management system; Statistics; Telecommunications","score_opus":0.03553395263247132,"score_gpt":0.26086271129599664,"score_spread":0.2253287586635253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022664864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13008222,0.00007460273,0.86933315,0.000110332716,0.00009509495,0.00013130247,0.0000011928615,0.0001321816,0.000039917588],"genre_scores_gemma":[0.9567247,0.000008116875,0.042233143,0.00026362555,0.0007002612,0.000013699643,0.00001805327,0.000020537982,0.000017874481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992964,0.00000889669,0.00018701896,0.00027354315,0.00007702548,0.00015711391],"domain_scores_gemma":[0.99949455,0.00018723922,0.000058495145,0.00016769965,0.000084059175,0.000007940572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019296851,0.00013269822,0.00014739313,0.00012925566,0.00047017197,0.00017261086,0.00006580157,0.000052414594,0.0000025117547],"category_scores_gemma":[0.00000529408,0.0001343202,0.000060045793,0.00012789835,0.000015639844,0.0006680667,0.000008955904,0.00007594356,0.0000014092257],"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.000046175912,0.000017973527,0.00001977249,0.000026113288,0.000016122756,9.750919e-8,0.000016405096,0.9615179,0.0000049566765,0.006293945,0.0000028141208,0.032037724],"study_design_scores_gemma":[0.00024027067,0.00000910833,0.000011472138,0.000029410172,0.00006729155,2.865189e-7,0.000007954611,0.73967236,0.0000012448725,0.2597489,0.00009767049,0.00011399661],"about_ca_topic_score_codex":0.00009881351,"about_ca_topic_score_gemma":0.000029249826,"teacher_disagreement_score":0.82710004,"about_ca_system_score_codex":0.0000114558625,"about_ca_system_score_gemma":0.0000027609863,"threshold_uncertainty_score":0.5477419},"labels":[],"label_agreement":null},{"id":"W2025952763","doi":"10.1145/1596519.1596523","title":"Random variate generation for exponentially and polynomially tilted stable distributions","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Random variate; Mathematics; Exponential growth; Convolution random number generator; Representation (politics); Random variable; Applied mathematics; Distribution (mathematics); Exponential distribution; Variable (mathematics); Stability (learning theory); Key (lock); Combinatorics; Discrete mathematics; Mathematical analysis; Computer science; Statistics","score_opus":0.037730407018985355,"score_gpt":0.2846753339540069,"score_spread":0.24694492693502154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025952763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008773706,0.00007267336,0.98949367,0.00089698576,0.00026060452,0.0003418298,0.000013983463,0.0001351736,0.000011348078],"genre_scores_gemma":[0.5366978,0.000021425429,0.46298674,0.00016712431,0.000082754224,0.000010168935,0.000014268914,0.0000045824227,0.0000151347485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890155,0.00008318352,0.0002676621,0.0004350138,0.00011708933,0.00019549814],"domain_scores_gemma":[0.99922264,0.00014594807,0.00005438563,0.00036733865,0.00012011989,0.000089576926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031800463,0.00016020532,0.00017996416,0.000115781004,0.00047961975,0.00027937602,0.00017504298,0.00009557566,0.0000012528893],"category_scores_gemma":[0.0000109172715,0.00015729528,0.0000644909,0.00013002678,0.00001158463,0.00047363405,0.000009300996,0.00010478216,5.7209195e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004310612,0.00004764998,3.8255942e-7,0.0000036734898,0.00001344937,2.4918762e-7,0.00018088771,0.69782495,0.00066220784,0.005641019,0.000006686453,0.29557574],"study_design_scores_gemma":[0.001395675,0.00018013432,0.000027838483,0.000015013735,0.00003134909,0.0000037910506,0.0000011434803,0.9587752,0.00026007518,0.03909825,0.00004421819,0.00016727278],"about_ca_topic_score_codex":0.00001202239,"about_ca_topic_score_gemma":0.0000034421078,"teacher_disagreement_score":0.52792406,"about_ca_system_score_codex":0.000021996853,"about_ca_system_score_gemma":0.000032334454,"threshold_uncertainty_score":0.6414315},"labels":[],"label_agreement":null},{"id":"W2027801241","doi":"10.1145/502109.502112","title":"Fast simulation of broadband telecommunications networks carrying long-range dependent bursty traffic","year":2001,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Burstiness; Computer science; Broadband; Range (aeronautics); Sampling (signal processing); Noise (video); Broadband networks; Importance sampling; Algorithm; Telecommunications; Monte Carlo method; Mathematics; Computer network; Statistics; Engineering; Artificial intelligence","score_opus":0.027121675956178388,"score_gpt":0.26101102967122547,"score_spread":0.23388935371504707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027801241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33964467,0.00007267985,0.65986663,0.00006930758,0.000083850144,0.000121517915,0.0000010106044,0.00010408008,0.00003625905],"genre_scores_gemma":[0.99624,0.00005409228,0.0032381348,0.00014476688,0.00023023944,0.000009510182,0.000033449254,0.000027254868,0.000022513732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888694,0.00003674829,0.00039871872,0.00030223263,0.00018819206,0.00018718532],"domain_scores_gemma":[0.99883103,0.0002538218,0.00017597842,0.00052388,0.0001966721,0.000018603629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024597795,0.00018613599,0.00022207474,0.0003359039,0.00045951488,0.00011471916,0.00022241205,0.000096299285,0.00002390219],"category_scores_gemma":[0.000017152312,0.00019768908,0.00010655818,0.0004279771,0.000032743617,0.00077005423,0.00002077525,0.00020494571,0.0000055537075],"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.000071113594,0.000087602355,0.0004401591,0.00001979665,0.00004231756,6.836321e-7,0.00009209349,0.8939211,0.000002320715,0.000056308087,2.7723863e-7,0.10526626],"study_design_scores_gemma":[0.00050732703,0.000016962034,0.00028146958,0.00006889062,0.00015361232,0.0000015962524,0.000047272897,0.9976282,0.000001172893,0.0010711597,0.000031981075,0.00019036618],"about_ca_topic_score_codex":0.00007037364,"about_ca_topic_score_gemma":0.00010014009,"teacher_disagreement_score":0.6566285,"about_ca_system_score_codex":0.000033732842,"about_ca_system_score_gemma":0.00000622863,"threshold_uncertainty_score":0.80615264},"labels":[],"label_agreement":null},{"id":"W2033803521","doi":"10.1145/945511.945515","title":"Empirical evidence concerning AES","year":2003,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Centre de Recherches Mathématiques","keywords":"Randomness; Computer science; Cryptography; Advanced Encryption Standard; Randomness tests; Statistical hypothesis testing; Theoretical computer science; Algorithm; Mathematics; Statistics","score_opus":0.1426649064882288,"score_gpt":0.3318136072770856,"score_spread":0.1891487007888568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033803521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04465601,0.000119829034,0.9541359,0.00040526557,0.00028635736,0.00012129771,6.0998076e-7,0.00024669824,0.000028060287],"genre_scores_gemma":[0.81286323,0.000025261941,0.18663464,0.00040181912,0.000040305426,0.000007459655,9.1406775e-7,0.00000929819,0.000017084962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985873,0.00019192594,0.0002608782,0.000480739,0.00027404816,0.00020510383],"domain_scores_gemma":[0.99861866,0.00060632493,0.000054512857,0.0005016328,0.00012327165,0.00009561798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038968984,0.0001668596,0.00014328546,0.00015276646,0.00031539716,0.00021084106,0.00029411272,0.00007626669,0.000009383401],"category_scores_gemma":[0.000054915294,0.0001682535,0.00006791215,0.0002789363,0.000025404634,0.0008959073,0.000013216395,0.00021917533,0.000018782395],"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.000009369111,0.000032318334,0.00003252822,0.000006876618,0.000007616846,0.0000015975519,0.0004126341,0.93118477,0.000086022206,0.00038552858,0.000004483953,0.06783624],"study_design_scores_gemma":[0.00031017367,0.00012586269,0.00005527746,0.00008809377,0.000011775601,0.000010456788,0.000010001718,0.9938133,0.00028639231,0.0050094514,0.00009318087,0.00018607026],"about_ca_topic_score_codex":0.00001587387,"about_ca_topic_score_gemma":0.0000019188826,"teacher_disagreement_score":0.7682072,"about_ca_system_score_codex":0.00005863688,"about_ca_system_score_gemma":0.000051938463,"threshold_uncertainty_score":0.6861178},"labels":[],"label_agreement":null},{"id":"W2034644962","doi":"10.1145/1899396.1899399","title":"Modeling and simulation of SIP tandem server with finite buffer","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Server; Retransmission; Computer network; Distributed computing; Queueing theory; Upstream (networking); Real-time computing","score_opus":0.03960654247552595,"score_gpt":0.2371031194816948,"score_spread":0.19749657700616885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034644962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19061764,0.000058442485,0.8089131,0.00005685198,0.00008367329,0.00013750132,9.4904243e-7,0.00011300689,0.000018833616],"genre_scores_gemma":[0.9387805,0.00002264095,0.06101132,0.00011382374,0.00003954616,0.000007111443,0.000001917097,0.0000123590235,0.000010794602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988899,0.0000577984,0.0002934324,0.00038795095,0.00020430142,0.00016656687],"domain_scores_gemma":[0.9990728,0.00020329464,0.00006354677,0.00039727258,0.00018370188,0.00007940808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016390877,0.00017651245,0.00019516972,0.00013950122,0.0001928784,0.00006501702,0.00019473238,0.00009195506,0.0000043953905],"category_scores_gemma":[0.0000045047004,0.00015717429,0.000043761964,0.0001858659,0.000026946776,0.00050976546,0.000015591993,0.00014805586,0.0000014571164],"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.000053098047,0.00004512345,0.000047055273,0.000008728266,0.000027234639,7.261043e-7,0.0007438153,0.83964616,0.0000013647361,0.00040499485,9.0433495e-8,0.1590216],"study_design_scores_gemma":[0.00080641196,0.00021967317,0.00007408521,0.00006986971,0.000037839425,0.0000025224815,0.000016228048,0.99566936,0.000007944001,0.002912719,0.0000027463147,0.00018062379],"about_ca_topic_score_codex":0.000031520653,"about_ca_topic_score_gemma":0.000012261397,"teacher_disagreement_score":0.74816287,"about_ca_system_score_codex":0.000012588203,"about_ca_system_score_gemma":0.000023264489,"threshold_uncertainty_score":0.64093816},"labels":[],"label_agreement":null},{"id":"W2051169247","doi":"10.1145/2611561","title":"Discrete Event Execution with One-Sided and Two-Sided GVT Algorithms on 216,000 Processor Cores","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Asynchronous communication; Computer science; Parallel computing; Computation; Synchronization (alternating current); Massively parallel; Distributed computing; Exploit; Event (particle physics); Supercomputer; Algorithm; Implementation; Parallel algorithm; Multi-core processor","score_opus":0.08701757572331453,"score_gpt":0.3748221742226232,"score_spread":0.2878045984993087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051169247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2076907,0.000011341151,0.7910686,0.00060045294,0.00005142048,0.00034641632,0.000010373665,0.00015194464,0.00006874015],"genre_scores_gemma":[0.9579372,0.000014606865,0.041464668,0.00030768846,0.000094364485,0.00005698664,0.000017177308,0.000020431837,0.00008689102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781436,0.00011627842,0.00051271037,0.0006781202,0.00066827674,0.00021028647],"domain_scores_gemma":[0.99765295,0.0011360592,0.00016020922,0.0006250664,0.00030167677,0.0001240156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006461602,0.00022100256,0.00025648,0.0002993634,0.00057951297,0.00029459776,0.00023591326,0.000094334435,0.000018173821],"category_scores_gemma":[0.000083338055,0.00017186458,0.00006083292,0.0003813418,0.000060259325,0.00033553873,0.000016792972,0.00019181467,0.000010216353],"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.00007455807,0.00006010614,0.000045053832,0.0000032296034,0.000010509118,1.3037817e-7,0.0002003149,0.79545474,0.00002281327,0.00075294625,0.00000477043,0.20337082],"study_design_scores_gemma":[0.0008457885,0.00035842592,0.00066107797,0.000100035984,0.00003230675,0.0000030039646,0.000050091665,0.9565082,0.00026765018,0.040834285,0.00012263271,0.0002164999],"about_ca_topic_score_codex":0.00005893895,"about_ca_topic_score_gemma":0.000019962254,"teacher_disagreement_score":0.75024647,"about_ca_system_score_codex":0.000029975246,"about_ca_system_score_gemma":0.000018962648,"threshold_uncertainty_score":0.70084345},"labels":[],"label_agreement":null},{"id":"W2061086504","doi":"10.1145/1060576.1060578","title":"Simulating markov-reward processes with rare events","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":8,"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 Saskatchewan","funders":"","keywords":"Markov chain; Markov process; Computer science; Rare events; Mathematical optimization; Boundary (topology); Markov decision process; Mathematical economics; Markov renewal process; Markov model; Statistical physics; Applied mathematics; Mathematics; Variable-order Markov model; Statistics; Machine learning; Physics; Mathematical analysis","score_opus":0.019117381041608227,"score_gpt":0.24610024124230387,"score_spread":0.22698286020069564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061086504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23937777,0.000020045845,0.7599651,0.0002501415,0.000040084455,0.000101308164,8.3187837e-7,0.00017827972,0.00006639326],"genre_scores_gemma":[0.9732088,0.000005540118,0.025683789,0.0005962518,0.00041083316,0.000009245806,0.000013524676,0.0000284243,0.000043596418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990662,0.000012480605,0.00022283511,0.0003301802,0.00019179475,0.00017653387],"domain_scores_gemma":[0.9992721,0.0001654882,0.00009836289,0.00026384776,0.00018515442,0.000015022155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001290379,0.0001824923,0.00015859197,0.00022324597,0.00040153504,0.00012442897,0.00013603795,0.000051439973,0.000024266657],"category_scores_gemma":[0.000026847345,0.00016323765,0.00004464138,0.0003463199,0.000014805274,0.0012056828,0.000012415342,0.000130442,0.000020096784],"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.00008719981,0.000049070524,0.00016156785,0.000064408756,0.000031514202,6.166713e-7,0.00006994237,0.9069774,0.0000020832624,0.000057257188,7.9317925e-7,0.09249812],"study_design_scores_gemma":[0.00050649524,0.000018715016,0.000033870372,0.00013556232,0.00009249632,0.0000010180617,0.000037356083,0.9949415,0.0000070828382,0.0038306536,0.00018602639,0.00020923762],"about_ca_topic_score_codex":0.000020892352,"about_ca_topic_score_gemma":0.00004838274,"teacher_disagreement_score":0.73428136,"about_ca_system_score_codex":0.000024251423,"about_ca_system_score_gemma":0.00001219893,"threshold_uncertainty_score":0.6656638},"labels":[],"label_agreement":null},{"id":"W2081195274","doi":"10.1145/1870085.1870088","title":"Optimal scheduling in high-speed downlink packet access networks","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Telecommunications link; Computer science; Markov decision process; Scheduling (production processes); Heuristic; Network packet; Mathematical optimization; Dynamic programming; Dynamic priority scheduling; Markov process; Distributed computing; Computer network; Algorithm; Mathematics; Quality of service","score_opus":0.015504737510225365,"score_gpt":0.2523002044070183,"score_spread":0.23679546689679293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081195274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40872595,0.000019619014,0.59053963,0.000023755592,0.00039528805,0.00009421766,0.0000013282662,0.00019514156,0.000005060128],"genre_scores_gemma":[0.84969795,0.00008061921,0.14993493,0.00003244187,0.00018685027,0.0000074421814,0.000024571224,0.000033358592,0.0000018360324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913865,0.00001861057,0.00027152954,0.00025191708,0.000103222286,0.00021604873],"domain_scores_gemma":[0.99946606,0.000118444215,0.000026610847,0.0002766129,0.00005053018,0.00006172532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009379873,0.00017654127,0.0001604379,0.00018042851,0.00011958225,0.00010556243,0.00015449531,0.0001689749,0.000009103325],"category_scores_gemma":[0.0000041267863,0.00019950607,0.00003397168,0.0002605422,0.000014643631,0.0004832161,0.000008731556,0.00051582995,0.000002049081],"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.000018986564,0.000020238662,0.00005488911,0.000008315401,0.000010550342,7.892515e-7,0.000073440846,0.9385657,0.000026183827,0.000026441478,4.3975075e-7,0.06119408],"study_design_scores_gemma":[0.0005398919,0.000018863859,0.00014175312,0.000041056686,0.000010711353,0.0000015124119,0.0000049212076,0.99859,0.000034512792,0.0004078551,0.0000043037994,0.00020461062],"about_ca_topic_score_codex":0.000011164019,"about_ca_topic_score_gemma":0.000027597205,"teacher_disagreement_score":0.440972,"about_ca_system_score_codex":0.000028832643,"about_ca_system_score_gemma":0.0000062512236,"threshold_uncertainty_score":0.81356215},"labels":[],"label_agreement":null},{"id":"W2100184918","doi":"10.1145/2133390.2133393","title":"Evolutionary optimization of low-discrepancy sequences","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Curse of dimensionality; Sequence (biology); Latin hypercube sampling; Hypercube; Computer science; Algorithm; Pseudorandom number generator; Generator (circuit theory); Evolutionary algorithm; Mathematics; Theoretical computer science; Mathematical optimization; Combinatorics; Artificial intelligence; Power (physics); Monte Carlo method; Statistics","score_opus":0.06769827072555362,"score_gpt":0.3173805783833438,"score_spread":0.2496823076577902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100184918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061983027,0.000029166102,0.93736386,0.00008928573,0.000103566876,0.00016793085,0.0000041602957,0.00008075832,0.00017825184],"genre_scores_gemma":[0.62656385,0.000008870088,0.37331763,0.000023746676,0.000041469157,0.0000084263565,0.00000713135,0.000007440134,0.00002143046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991468,0.000054047225,0.0003515274,0.0001331998,0.00019341773,0.00012098836],"domain_scores_gemma":[0.9992489,0.00026189143,0.000091871756,0.00021583043,0.00012538863,0.00005611001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001908633,0.00011178343,0.00014833362,0.00010984374,0.000122022866,0.00001809046,0.00007047926,0.000075568736,0.000074337506],"category_scores_gemma":[0.0000482127,0.00009671077,0.0000571456,0.00012475552,0.000024086376,0.0003811663,0.0000046706373,0.0000875112,0.0000039526903],"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.000015571964,0.00018897743,0.00001136823,0.00008015379,0.000014353598,2.6639253e-8,0.0006033031,0.96767795,0.000008198359,0.024718253,0.0000041698822,0.0066776695],"study_design_scores_gemma":[0.0001751886,0.000045836852,0.000012185314,0.00008877282,0.00002346863,0.0000019539007,0.00005557533,0.90677476,0.000109461005,0.092618905,0.000003513123,0.000090407426],"about_ca_topic_score_codex":0.000005413474,"about_ca_topic_score_gemma":5.4322334e-7,"teacher_disagreement_score":0.5645808,"about_ca_system_score_codex":0.000023639928,"about_ca_system_score_gemma":0.000011437169,"threshold_uncertainty_score":0.3943751},"labels":[],"label_agreement":null},{"id":"W2103255584","doi":"10.1145/1596519.1596520","title":"Generalized Halton sequences in 2008","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":74,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sobol sequence; Computer science; Sequence (biology); Algorithm; Theoretical computer science; Mathematics; Statistics; Monte Carlo method","score_opus":0.08529437444045551,"score_gpt":0.3364752737771421,"score_spread":0.2511808993366866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103255584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19505934,0.000010629625,0.8040047,0.0005082356,0.0000553851,0.00014720774,9.2362853e-7,0.000078308905,0.00013521632],"genre_scores_gemma":[0.80221915,0.000013307222,0.19744684,0.00021859504,0.000029042414,0.0000067787337,0.000003746233,0.00000559517,0.00005693309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918026,0.000051289007,0.00031393612,0.0001907315,0.0001506194,0.00011315107],"domain_scores_gemma":[0.99951035,0.00015595903,0.000043427393,0.00019653296,0.000053732743,0.000040005187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017711056,0.000115171526,0.0001536183,0.00013946496,0.00009572275,0.000051317023,0.00007669494,0.000073993004,0.000031704792],"category_scores_gemma":[0.000027082393,0.00009914488,0.000042427368,0.00013394066,0.000009999421,0.00018557394,0.0000016433875,0.00012567073,0.000005524724],"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.00002133718,0.00012861955,0.0000016945021,0.000014884777,0.000004362042,4.4427992e-7,0.00054649706,0.90977025,0.000021016125,0.028689003,0.0000086052505,0.060793303],"study_design_scores_gemma":[0.00025652975,0.000056779194,0.000008520872,0.00004044477,0.000005665589,0.0000013083385,0.000013616794,0.6390109,0.000059264297,0.3604687,0.000008679493,0.00006957883],"about_ca_topic_score_codex":0.000011574817,"about_ca_topic_score_gemma":0.000010419115,"teacher_disagreement_score":0.60715985,"about_ca_system_score_codex":0.000026862679,"about_ca_system_score_gemma":0.000009702368,"threshold_uncertainty_score":0.4043011},"labels":[],"label_agreement":null},{"id":"W2117513650","doi":"10.1145/502109.502110","title":"Packet delay in models of data networks","year":2001,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Brock University","funders":"","keywords":"Routing table; Computer science; Network packet; Table (database); Routing (electronic design automation); Processing delay; Network delay; End-to-end delay; Computer network; Scalability; Source routing; Routing protocol; Transmission delay; Data mining","score_opus":0.08770757930442849,"score_gpt":0.2956826076131928,"score_spread":0.20797502830876433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117513650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022640483,0.00008766895,0.97658294,0.000120911194,0.0003252487,0.00011711781,0.000002112785,0.000067753186,0.00005576445],"genre_scores_gemma":[0.9615778,0.00009025811,0.038123164,0.00010347698,0.000074112395,0.0000042221245,0.000007834964,0.0000078675175,0.000011281634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998827,0.000081289305,0.0003757308,0.0004019403,0.00014846661,0.0001655888],"domain_scores_gemma":[0.9987324,0.00016149825,0.00006277305,0.00091968273,0.000078507524,0.000045162455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033672218,0.00011921872,0.00017570585,0.00017712874,0.00009670149,0.00007538584,0.0005816004,0.000090280984,0.0000022124068],"category_scores_gemma":[0.000002341831,0.000116359246,0.000036881484,0.0003097732,0.000011413927,0.00093842286,0.000040040188,0.00016111507,0.0000010840479],"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.00001556407,0.00004398131,0.000023136337,0.000003702336,0.00000975181,0.0000017131997,0.00021696037,0.8806864,5.6712275e-7,0.000763538,0.000004497411,0.1182302],"study_design_scores_gemma":[0.00034928223,0.0000643489,0.00001752692,0.000066485685,0.000005226501,0.000011944642,0.000011769643,0.99399006,9.921054e-7,0.005333126,0.00003453599,0.000114691225],"about_ca_topic_score_codex":0.00011199419,"about_ca_topic_score_gemma":0.00007214472,"teacher_disagreement_score":0.9389373,"about_ca_system_score_codex":0.000018817902,"about_ca_system_score_gemma":0.0000135934115,"threshold_uncertainty_score":0.47449926},"labels":[],"label_agreement":null},{"id":"W2118479715","doi":"10.1145/1667072.1667078","title":"Asymptotic robustness of estimators in rare-event simulation","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Probability and Risk Models","field":"Decision Sciences","cited_by":101,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; United States - Israel Binational Science Foundation","keywords":"Estimator; Mathematics; Robustness (evolution); Bounded function; Logarithm; Applied mathematics; Second moment of area; Delta method; Moment (physics); Statistics; Mathematical analysis","score_opus":0.08354774896116872,"score_gpt":0.3690416328269024,"score_spread":0.28549388386573366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118479715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47810712,0.000005757727,0.5214361,0.000074457945,0.00024359205,0.000105770814,0.000002204144,0.000020175361,0.0000048480765],"genre_scores_gemma":[0.9686914,0.0000025471247,0.031214269,0.0000243222,0.00004038287,0.0000052000564,0.0000024386256,0.000008619381,0.00001081181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998147,0.000112458,0.00067262293,0.00041466355,0.000504163,0.00014906378],"domain_scores_gemma":[0.9977515,0.0012436539,0.000118442105,0.00058581936,0.00023350156,0.000067087625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010339902,0.00013553143,0.00024104101,0.0003922942,0.00014779747,0.00007777984,0.00028868215,0.0001434834,0.000022361497],"category_scores_gemma":[0.0001654842,0.00011401821,0.00008706648,0.0004152464,0.00004867712,0.00041921213,0.000014241763,0.00027686974,0.000004841973],"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.000040522515,0.00010679584,0.00032968994,0.0000058807336,0.0000043498835,2.4181384e-7,0.00032357598,0.87759066,0.00001267969,0.00009794555,2.516782e-7,0.1214874],"study_design_scores_gemma":[0.00042772602,0.000056606794,0.0009858699,0.000028899512,0.000010073051,9.102675e-7,0.000022022807,0.9707587,0.000030157504,0.027557408,0.000006001295,0.00011566683],"about_ca_topic_score_codex":0.000034419838,"about_ca_topic_score_gemma":0.00007341931,"teacher_disagreement_score":0.4905843,"about_ca_system_score_codex":0.000018692837,"about_ca_system_score_gemma":0.000037594393,"threshold_uncertainty_score":0.46495274},"labels":[],"label_agreement":null},{"id":"W2131579983","doi":"10.1145/2043635.2043636","title":"The Effect of Robust Decisions on the Cost of Uncertainty in Military Airlift Operations","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Defence Research and Development Canada","funders":"Air Force Office of Scientific Research","keywords":"Randomness; Airlift; Operations research; Computer science; Mathematical optimization; Dynamic programming; Robust optimization; Stochastic programming; Mathematics; Statistics","score_opus":0.058818627507876614,"score_gpt":0.24686031346182818,"score_spread":0.18804168595395157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131579983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38585746,0.00002724373,0.6130365,0.0002816113,0.00017259338,0.00037835847,0.0000017615894,0.000017754264,0.00022667232],"genre_scores_gemma":[0.99927133,0.000025885285,0.00037851662,0.00021860359,0.00004990803,0.00003079588,0.000005592581,0.000008120962,0.000011258263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992708,0.00004686171,0.00027450058,0.00015341342,0.00015188863,0.000102562895],"domain_scores_gemma":[0.99906653,0.00048000662,0.0000400769,0.00033836567,0.00006810676,0.0000069300863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004668158,0.00010483501,0.000117023985,0.00015598025,0.00029061362,0.000027009502,0.00019979016,0.000034131066,0.00002083335],"category_scores_gemma":[0.000041266918,0.000063263375,0.00006382729,0.00021612008,0.000042917087,0.00018630235,0.00001698429,0.000107962136,0.000004390358],"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.000103681545,0.000052790783,0.00013817943,0.0000124136795,0.000017428738,1.6852134e-7,0.00015503143,0.9652594,0.0000018137644,0.0013239682,0.000015580665,0.03291958],"study_design_scores_gemma":[0.00039957973,0.00007879231,0.00054847175,0.000079926926,0.000028118136,6.936814e-8,0.00012800287,0.9974778,0.00001575661,0.0010763468,0.00010483946,0.000062274936],"about_ca_topic_score_codex":0.00063942256,"about_ca_topic_score_gemma":0.00031597252,"teacher_disagreement_score":0.6134139,"about_ca_system_score_codex":0.0000140279635,"about_ca_system_score_gemma":0.0000049745922,"threshold_uncertainty_score":0.25798056},"labels":[],"label_agreement":null},{"id":"W2143988898","doi":"10.1145/511442.511445","title":"Estimation of blocking probabilities in cellular networks with dynamic channel assignment","year":2002,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Blocking (statistics); Computer science; Estimator; Channel (broadcasting); Importance sampling; Mathematical optimization; Call blocking; Algorithm; Mathematics; Statistics; Monte Carlo method; Telecommunications","score_opus":0.018287219481313913,"score_gpt":0.21423291536648023,"score_spread":0.1959456958851663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143988898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2647268,0.0000261503,0.7349901,0.000060854247,0.000034574077,0.000104038074,2.3827117e-7,0.000042894262,0.00001435989],"genre_scores_gemma":[0.9930681,0.000005902113,0.0067894123,0.00005586671,0.00004080513,0.000010602528,0.000006412215,0.0000132878085,0.0000096327985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932396,0.000014639364,0.00022313566,0.0002030744,0.00012143502,0.00011374956],"domain_scores_gemma":[0.99959487,0.00007199879,0.000090492955,0.00018850718,0.00004790176,0.0000062212007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013972358,0.000113778005,0.00014047459,0.00024009241,0.00011542672,0.000048342205,0.00007125355,0.000042743413,0.000009364464],"category_scores_gemma":[0.000005235532,0.000107171305,0.000032171793,0.00024082602,0.000020532694,0.0004511751,0.0000065553754,0.00009846463,0.0000014403173],"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.00002656252,0.00006515672,0.00002165871,0.00003680793,0.000014576638,5.04034e-7,0.00012951336,0.9537821,0.0000036271274,0.0001434823,8.6721386e-8,0.04577597],"study_design_scores_gemma":[0.00033173565,0.000023323462,0.000015390127,0.00012486317,0.000045515226,2.689154e-7,0.000047414233,0.9916089,0.0000071601194,0.007679944,0.0000013921078,0.00011408544],"about_ca_topic_score_codex":0.000031946864,"about_ca_topic_score_gemma":0.000019103038,"teacher_disagreement_score":0.7283413,"about_ca_system_score_codex":0.000029118353,"about_ca_system_score_gemma":0.0000015798121,"threshold_uncertainty_score":0.4370319},"labels":[],"label_agreement":null},{"id":"W2152980722","doi":"10.1145/2414416.2414790","title":"Self-Avoiding Random Dynamics on Integer Complex Systems","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; D-Wave Systems (Canada)","funders":"","keywords":"Ising model; Computer science; Gibbs sampling; Monte Carlo algorithm; Monte Carlo method; Statistical physics; Algorithm; State space; Sampling (signal processing); Theoretical computer science; Mathematics; Bayesian probability; Artificial intelligence; Physics","score_opus":0.0834318275074199,"score_gpt":0.3251388237474979,"score_spread":0.24170699624007802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152980722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08978488,0.000016488713,0.9086564,0.00013845232,0.00045321212,0.0004683652,0.00000488859,0.00022930377,0.000247998],"genre_scores_gemma":[0.88069695,0.000017288305,0.11889057,0.00010297017,0.00013544604,0.000038529626,0.00000813176,0.000029335111,0.00008076169],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987278,0.00022621197,0.00035796908,0.00030309634,0.00019408822,0.00019085429],"domain_scores_gemma":[0.99809057,0.0011850446,0.00007526118,0.00041565666,0.00014886897,0.000084576364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004190869,0.00020636004,0.000280683,0.0001579952,0.00031890676,0.0001521555,0.00012903192,0.000116055475,0.0000075773605],"category_scores_gemma":[0.00003253476,0.00018167385,0.00009716894,0.00009947049,0.00001198899,0.00014990696,0.000008715184,0.0002772579,0.0000011135338],"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.00003588944,0.00009202503,0.0000040277846,0.00007407966,0.00004826267,3.3690483e-7,0.00047189175,0.96645516,0.00000916191,0.0026051681,0.000019771876,0.030184219],"study_design_scores_gemma":[0.00097207015,0.00010503876,0.0000028481927,0.00010240531,0.000044008815,0.0000037615637,0.00016237376,0.99266946,0.0000055197497,0.00567304,0.00006787187,0.00019157311],"about_ca_topic_score_codex":0.000054267344,"about_ca_topic_score_gemma":0.000006641483,"teacher_disagreement_score":0.7909121,"about_ca_system_score_codex":0.0000856834,"about_ca_system_score_gemma":0.000009793857,"threshold_uncertainty_score":0.7408445},"labels":[],"label_agreement":null},{"id":"W2164907674","doi":"10.1145/1899396.1899398","title":"The double CFTP method","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Hungkuang University; Hong Kong University of Science and Technology; Research Grants Council, University Grants Committee","keywords":"Mathematics; Dirichlet distribution; Markov chain; Poisson distribution; Coalescence (physics); Combinatorics; Limit (mathematics); Poisson point process; Applied mathematics; Distribution (mathematics); Identity (music); Bessel function; Discrete mathematics; Mathematical analysis; Boundary value problem; Statistics; Physics","score_opus":0.07555412885911102,"score_gpt":0.31413135928981406,"score_spread":0.23857723043070306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164907674","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005111603,0.00007044694,0.998111,0.00028841142,0.00039138983,0.00013443007,4.7247087e-7,0.0001602322,0.00033246388],"genre_scores_gemma":[0.39117995,0.000023397271,0.6085445,0.00015461218,0.00003372748,0.00000837873,2.680804e-7,0.000006399046,0.00004871053],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897385,0.00011848826,0.00021161216,0.00035104825,0.00014980277,0.00019521808],"domain_scores_gemma":[0.99886245,0.00023988928,0.000042689568,0.0007004813,0.00008077588,0.0000737408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048847054,0.00013669694,0.00011418265,0.00007518135,0.0005555211,0.0001563457,0.0004969394,0.00007294344,0.000002737243],"category_scores_gemma":[0.0000030414765,0.000099449586,0.00006973812,0.00017029612,0.000017913137,0.0003252686,0.000023096614,0.00018233144,0.000005870225],"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.000018011366,0.00002060259,6.589339e-7,0.0000017548239,0.000011713973,4.5737406e-7,0.0006390781,0.43168104,0.0000036189927,0.016954191,0.0000018855935,0.550667],"study_design_scores_gemma":[0.00029630394,0.000064753076,0.000014789617,0.000009271189,0.000010808616,0.0000051639204,0.000004698082,0.8806073,0.00011721308,0.11860687,0.00015093738,0.00011185962],"about_ca_topic_score_codex":0.000041587013,"about_ca_topic_score_gemma":0.000004916181,"teacher_disagreement_score":0.55055517,"about_ca_system_score_codex":0.00001288905,"about_ca_system_score_gemma":0.000018532777,"threshold_uncertainty_score":0.42726752},"labels":[],"label_agreement":null},{"id":"W2237934651","doi":"10.1145/2775106","title":"Static Network Reliability Estimation under the Marshall-Olkin Copula","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Australian Research Council; Canada Research Chairs","keywords":"Monte Carlo method; Estimator; Copula (linguistics); Computer science; Mathematical optimization; Bounded function; Mathematics; Algorithm; Econometrics; Statistics","score_opus":0.08701479158394684,"score_gpt":0.32700985599127497,"score_spread":0.23999506440732812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2237934651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032477155,0.000019482404,0.96470076,0.0021500727,0.00036331482,0.00018506976,0.0000041636313,0.00008884187,0.000011151922],"genre_scores_gemma":[0.9325313,0.000009604872,0.067063086,0.00021383094,0.00007363723,0.0000109132025,0.0000014102515,0.000009948296,0.00008628305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983734,0.00018458006,0.00042991166,0.00037708806,0.00045621928,0.00017880926],"domain_scores_gemma":[0.995913,0.0031049894,0.000071414106,0.00068583246,0.00016432315,0.0000603934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001338347,0.0001339747,0.00015163876,0.00007684841,0.0003453297,0.00013203551,0.0002994064,0.000073465104,0.000029672592],"category_scores_gemma":[0.00018329368,0.00006964586,0.000063224776,0.00025446457,0.00005162104,0.0002407395,0.000012827679,0.00011317117,0.000032975444],"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.000021299527,0.000018313227,0.000015025242,0.000002252858,0.0000071312875,1.4953733e-7,0.000071959264,0.85169,0.0000016318696,0.0006541281,0.000037949896,0.14748019],"study_design_scores_gemma":[0.0002140075,0.000044941902,0.00032826647,0.00003551874,0.000015021655,0.0000014544777,0.0000131602255,0.8141479,0.0000016884982,0.18505746,0.000053377844,0.000087195804],"about_ca_topic_score_codex":0.000011137683,"about_ca_topic_score_gemma":0.0000036002084,"teacher_disagreement_score":0.90005416,"about_ca_system_score_codex":0.000046940913,"about_ca_system_score_gemma":0.000025777772,"threshold_uncertainty_score":0.28400758},"labels":[],"label_agreement":null},{"id":"W2252287572","doi":"10.1145/2827696","title":"PAM","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Protein Structure and Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Agriculture and Agri-Food Canada","funders":"","keywords":"Computer science; Cellular automaton; Bridging (networking); Theoretical computer science; Scope (computer science); Automaton; Graph; Biological system; Particle system; Algorithm; Biology","score_opus":0.013099916203501287,"score_gpt":0.24817351557142087,"score_spread":0.23507359936791958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2252287572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24627335,0.000027909198,0.75343716,0.00010918345,0.000072471856,0.000043591226,0.000003646283,0.000015453048,0.000017246002],"genre_scores_gemma":[0.9868215,0.00004604363,0.012783054,0.00015815487,0.0001050136,0.0000040695495,0.000006274843,0.00000808282,0.0000678566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995924,0.000014590396,0.000082999686,0.00018085023,0.000050088252,0.000079050056],"domain_scores_gemma":[0.9996865,0.000014553627,0.000014570597,0.00022022151,0.000033138727,0.000031011237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000034729357,0.00007166509,0.000048309605,0.000027020173,0.00007700681,0.000012574662,0.0000604485,0.00007041568,0.000003182113],"category_scores_gemma":[0.0000040491786,0.000052169693,0.000031359352,0.000022913757,0.0000123840255,0.000004942244,0.000005604238,0.000030630443,0.0000025328225],"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.00003072963,0.000008934205,0.000020245729,0.0000018112828,0.000010829549,1.3594112e-7,0.000011379088,0.75575745,0.0035998516,0.00003204631,0.0000020767268,0.24052449],"study_design_scores_gemma":[0.00037385483,0.00013170285,0.00006070323,0.000013209317,0.000007949315,0.0000028471184,0.0000018576318,0.99437404,0.001723305,0.0028869177,0.00032494098,0.00009868037],"about_ca_topic_score_codex":0.0000028491384,"about_ca_topic_score_gemma":0.0000029803873,"teacher_disagreement_score":0.7406541,"about_ca_system_score_codex":0.000004584312,"about_ca_system_score_gemma":0.000007921132,"threshold_uncertainty_score":0.21274184},"labels":[],"label_agreement":null},{"id":"W2295070894","doi":"10.1145/945511.945512","title":"Guest introduction","year":2003,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science","score_opus":0.11340201678110604,"score_gpt":0.37828863456396594,"score_spread":0.26488661778285993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295070894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036551856,0.000016431137,0.96169597,0.0007768713,0.0004283696,0.00016549997,0.0000029129385,0.0001521178,0.00020996554],"genre_scores_gemma":[0.95762295,0.000010227634,0.04163676,0.00017801014,0.0002879779,0.000016735577,0.000004309062,0.000010915504,0.00023212744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846965,0.00011059788,0.0004176785,0.00046756884,0.00040475876,0.00012972615],"domain_scores_gemma":[0.9984697,0.00044610968,0.000072831695,0.000687065,0.00025267692,0.00007160783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006626808,0.00012293749,0.00013761548,0.00025684448,0.00038135957,0.00018794111,0.00019109774,0.00008058893,0.000094803494],"category_scores_gemma":[0.00011962043,0.00010799675,0.000068667294,0.00044695928,0.000024867495,0.0002808521,0.000005380047,0.00013797986,0.000062050865],"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.0000065642616,0.00004030555,0.00002654747,7.1189004e-7,0.000004112925,7.907893e-8,0.00007924967,0.90558404,0.000014161433,0.0026478993,0.00006991453,0.09152641],"study_design_scores_gemma":[0.00019117599,0.000049171704,0.000048066664,0.0000036972122,0.000008831031,0.0000033028698,0.000033663706,0.9287566,0.00017333381,0.061164256,0.009456037,0.0001118633],"about_ca_topic_score_codex":0.000007018271,"about_ca_topic_score_gemma":0.0000021879557,"teacher_disagreement_score":0.92107105,"about_ca_system_score_codex":0.000023567158,"about_ca_system_score_gemma":0.000015071456,"threshold_uncertainty_score":0.44039795},"labels":[],"label_agreement":null},{"id":"W2549616710","doi":"10.1145/2987373","title":"Multithreaded Stochastic PDES for Reactions and Diffusions in Neurons","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Institutes of Health; National Institute of Mental Health; China Scholarship Council; U.S. National Library of Medicine; National Natural Science Foundation of China","keywords":"Computer science; Mathematical optimization; Parallel computing; Applied mathematics; Theoretical computer science; Mathematics","score_opus":0.023603215357950888,"score_gpt":0.26144662696955806,"score_spread":0.23784341161160716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549616710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42710844,0.000034422497,0.5725932,0.00012460243,0.000034841065,0.000089623536,0.000004991381,0.000009205329,6.600149e-7],"genre_scores_gemma":[0.9910728,0.0000645621,0.008645422,0.0000433848,0.000067052344,0.000027320417,0.000009863427,0.000013384268,0.0000562548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999363,0.0000289864,0.00015520754,0.0002856489,0.00004857071,0.000118585755],"domain_scores_gemma":[0.99956435,0.00009300276,0.000027214579,0.00022372184,0.000042867614,0.000048853162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000065043154,0.000100888145,0.00009359685,0.000097090924,0.00014420715,0.000015621512,0.000050076884,0.000075911594,0.0000014642364],"category_scores_gemma":[0.000015500715,0.000083822546,0.000047309077,0.000059251233,0.000024706957,0.0000082142415,0.000008136972,0.000039920982,4.945879e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040383067,0.00003724001,0.000061264924,0.000004041697,0.000019208384,7.197835e-8,0.000028979004,0.93981713,0.006437908,0.0000098924265,0.0000014121316,0.053542465],"study_design_scores_gemma":[0.000719593,0.00010579163,0.0005171648,0.000029032602,0.000032080457,0.0000020958516,0.000010239883,0.997668,0.00021727718,0.000535096,0.000057390374,0.00010623676],"about_ca_topic_score_codex":0.000011016983,"about_ca_topic_score_gemma":0.000056379045,"teacher_disagreement_score":0.5639643,"about_ca_system_score_codex":0.0000091978845,"about_ca_system_score_gemma":0.000010855015,"threshold_uncertainty_score":0.34181842},"labels":[],"label_agreement":null},{"id":"W2600394393","doi":"10.1145/3129130","title":"Green Simulation","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Estimator; Stochastic simulation; Computer science; Weighting; Convergence (economics); Simulation modeling; Kriging; Mathematical optimization; Mean squared error; Applied mathematics; Mathematics; Statistics; Machine learning","score_opus":0.06756534662439492,"score_gpt":0.27382441710832073,"score_spread":0.2062590704839258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600394393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016158665,0.000066878965,0.9826439,0.00046779387,0.000180241,0.00012983142,0.000024395098,0.000054423344,0.0002738554],"genre_scores_gemma":[0.9857433,0.000013431512,0.013895842,0.00011874439,0.00013853355,0.000017303777,0.000005609807,0.000013192798,0.00005407313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926835,0.0000019631234,0.00026951454,0.00030698473,0.000032344644,0.000120833596],"domain_scores_gemma":[0.9991623,0.000063045336,0.0001451291,0.00053630833,0.000046807545,0.000046369536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010399661,0.000102958955,0.00015029743,0.00009763144,0.0007837115,0.00014907606,0.00020961624,0.00007675207,0.0000106294065],"category_scores_gemma":[0.000022138416,0.000122537,0.000051380077,0.00004744183,0.000025097064,0.00028273065,0.000011741403,0.000099115714,0.00006081096],"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.000010210271,0.000030046778,0.000063851374,0.0000065267686,0.0000091273605,1.3051572e-7,0.000117804746,0.90765375,4.4403288e-7,0.028329713,3.0752392e-7,0.06377809],"study_design_scores_gemma":[0.0002305602,0.00003177001,0.00088724,0.000009677227,0.0000050343388,3.4251235e-7,0.000002781209,0.7491174,0.0000010757511,0.24944364,0.0001665598,0.00010394568],"about_ca_topic_score_codex":0.00022567349,"about_ca_topic_score_gemma":0.000010349201,"teacher_disagreement_score":0.9695846,"about_ca_system_score_codex":0.00002052976,"about_ca_system_score_gemma":0.0000059753015,"threshold_uncertainty_score":0.60277545},"labels":[],"label_agreement":null},{"id":"W2803763401","doi":"10.1145/3230636","title":"Fast Random Integer Generation in an Interval","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Integer (computer science); Interval (graph theory); Integer programming; Computer science; Mathematics; Combinatorics; Algorithm; Discrete mathematics","score_opus":0.03575391139524498,"score_gpt":0.2759761731571362,"score_spread":0.2402222617618912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803763401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3490778,0.000009932857,0.6502474,0.00012592031,0.00027604582,0.000162841,8.3104936e-7,0.00008943368,0.000009784929],"genre_scores_gemma":[0.94156444,0.000005628503,0.05802838,0.00025763377,0.00008784337,0.000010972032,0.000015388308,0.000011839411,0.000017855107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987171,0.00012696386,0.00030392065,0.0004802815,0.00020350114,0.00016818708],"domain_scores_gemma":[0.9991764,0.00010022098,0.000048569316,0.0005130596,0.00009829699,0.000063498446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002746985,0.00015953924,0.00016748534,0.00029449124,0.00009735073,0.00022096933,0.00029683116,0.000081820646,0.000013314098],"category_scores_gemma":[0.000004753949,0.00016174659,0.000056825964,0.00023322961,0.000010752592,0.0012986385,0.000016932454,0.0002187237,0.000028827826],"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.000043009153,0.000069779875,0.000032025106,0.00000559297,0.0000047143326,7.745181e-7,0.00062418653,0.8660485,0.00052624266,0.00015997273,7.91606e-7,0.13248436],"study_design_scores_gemma":[0.0014547204,0.000224172,0.00008631092,0.00003713609,0.0000053518406,0.0000032882372,0.000015640942,0.99649304,0.00022425692,0.0012717717,0.000007532841,0.00017677784],"about_ca_topic_score_codex":0.000044042736,"about_ca_topic_score_gemma":0.00003291109,"teacher_disagreement_score":0.5924867,"about_ca_system_score_codex":0.00006731395,"about_ca_system_score_gemma":0.000024017943,"threshold_uncertainty_score":0.65958345},"labels":[],"label_agreement":null},{"id":"W2899063537","doi":"10.1145/3317605","title":"Infinite Swapping using IID Samples","year":2019,"lang":"en","type":"preprint","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Probability and Risk Models","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; U.S. Department of Energy; Wind Energy Technologies Office; National Science Foundation","keywords":"Rare events; Event (particle physics); Estimator; Scaling; Construct (python library); Variance (accounting); Variance reduction; Sampling (signal processing); Importance sampling; Mathematics; Statistical physics; Statistics; Variance components; Computer science; Algorithm; Applied mathematics; Monte Carlo method; Physics","score_opus":0.32085989360389405,"score_gpt":0.40377503774998336,"score_spread":0.0829151441460893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899063537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26708448,0.00009171731,0.73125845,0.00019255423,0.0009154819,0.0003040885,0.000033074557,0.000091784575,0.00002834021],"genre_scores_gemma":[0.9115031,0.000057533965,0.08800881,0.0001807158,0.00015904938,0.000007196319,0.000015386746,0.0000225702,0.000045670662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966076,0.00026725372,0.000914687,0.0011004861,0.00084388605,0.00026608756],"domain_scores_gemma":[0.9962096,0.0014780761,0.00025923908,0.001533918,0.0004146908,0.00010447042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013388582,0.0003410507,0.0005196895,0.0005685479,0.00045721282,0.000616928,0.00071264687,0.0004194904,0.00003185397],"category_scores_gemma":[0.000117064585,0.00029716775,0.00026043772,0.00027465326,0.000041143277,0.0003718195,0.00014429205,0.0007459076,0.000032360764],"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.000034853947,0.000045790697,0.000050595587,0.000027299402,0.00003302057,3.485075e-7,0.00071117,0.9402608,0.0000068733116,0.000051577746,0.0000023119396,0.05877535],"study_design_scores_gemma":[0.0002416897,0.000037727186,0.000049573875,0.00017571868,0.000044012202,0.0000020505095,0.000037225025,0.86040145,0.000006582536,0.13863824,0.00008199699,0.00028370647],"about_ca_topic_score_codex":0.00015161648,"about_ca_topic_score_gemma":0.000016483269,"teacher_disagreement_score":0.6444186,"about_ca_system_score_codex":0.000079056765,"about_ca_system_score_gemma":0.00013646008,"threshold_uncertainty_score":0.999948},"labels":[],"label_agreement":null},{"id":"W3004559630","doi":"10.1145/3338530","title":"Extending Explicitly Modelled Simulation Debugging Environments with Dynamic Structure","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Autodesk (Canada)","funders":"Vlaamse regering; Flanders Make","keywords":"Rotation formalisms in three dimensions; Debugging; Computer science; Workflow; Modular design; DEVS; Programming language; Semantics (computer science); NetLogo; Distributed computing; Software engineering; Modeling and simulation; Simulation","score_opus":0.09033757020319406,"score_gpt":0.35236828015438587,"score_spread":0.2620307099511918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004559630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1699136,0.00001961712,0.8289737,0.0005485935,0.000035010416,0.00030743203,0.000014516362,0.00017111932,0.000016408967],"genre_scores_gemma":[0.9519235,0.000008737669,0.047423713,0.0004963336,0.000053519925,0.000015187292,0.00001773812,0.000027751288,0.00003355937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786127,0.00007744012,0.0005141358,0.00069371355,0.0006607542,0.00019268497],"domain_scores_gemma":[0.9984818,0.0005894018,0.00014483965,0.00053879083,0.00009738568,0.00014777173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019144977,0.0002277991,0.00023742247,0.0002086587,0.00048953673,0.00022672531,0.00031917225,0.000107980435,0.00007292097],"category_scores_gemma":[0.00003289781,0.00018807389,0.00007417235,0.00045267207,0.00002906068,0.0004724962,0.00002082133,0.00021977468,0.000016374455],"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.00005697079,0.000021712543,0.000034818015,0.000002340004,0.000013106105,3.96563e-7,0.00047261154,0.8468595,0.000118866374,0.000050268533,9.0497474e-7,0.15236849],"study_design_scores_gemma":[0.000520453,0.000117523254,0.000105025356,0.000018829689,0.000030615793,0.0000013847354,0.000049817663,0.98884785,0.000069295886,0.009859982,0.0001625342,0.00021671096],"about_ca_topic_score_codex":0.000006218529,"about_ca_topic_score_gemma":0.000002880254,"teacher_disagreement_score":0.78200984,"about_ca_system_score_codex":0.000048631882,"about_ca_system_score_gemma":0.000016860793,"threshold_uncertainty_score":0.76694304},"labels":[],"label_agreement":null},{"id":"W3113794249","doi":"10.1145/3434490","title":"Discrete-Event Modeling and Simulation of Diffusion Processes in Multiplex Networks","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Banco Santander","keywords":"DEVS; Computer science; Process (computing); Diffusion; Distributed computing; Discrete event simulation; Usability; Set (abstract data type); Multiplex; Diffusion process; Modeling and simulation; Simulation; Programming language; Innovation diffusion","score_opus":0.026758952734707655,"score_gpt":0.28523316173679725,"score_spread":0.2584742090020896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3113794249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4301106,0.000019826559,0.56967,0.000068197856,0.0000232042,0.00008945623,0.0000044254443,0.00001149643,0.000002733277],"genre_scores_gemma":[0.99721307,0.000024207779,0.0026076932,0.000044927412,0.000076269665,0.0000054966213,0.00001698981,0.000010252681,0.0000011071535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999294,0.000026211672,0.00026769997,0.00021931005,0.00009229679,0.00010051789],"domain_scores_gemma":[0.99961835,0.00010701977,0.00005531456,0.00009175942,0.00007496706,0.000052613614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000053687432,0.00011003497,0.00015035734,0.000048715356,0.00011920949,0.00003593169,0.000056961748,0.00004752073,0.0000030857204],"category_scores_gemma":[0.0000043113732,0.00011166297,0.000034264314,0.00013779112,0.000013557294,0.00016636177,0.00001110824,0.00012681144,2.0138788e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032835535,0.000040845218,0.00095573603,0.00002443724,0.000009056529,5.776139e-8,0.0011750329,0.9685052,0.000008024401,0.000060634866,2.4986079e-8,0.02918811],"study_design_scores_gemma":[0.00046845316,0.00005176442,0.00011352436,0.000071470495,0.000011006836,2.8542724e-8,0.00010647,0.9975196,0.0000035453236,0.00154333,0.0000014705328,0.00010933824],"about_ca_topic_score_codex":0.00012424776,"about_ca_topic_score_gemma":0.0000068952345,"teacher_disagreement_score":0.56710243,"about_ca_system_score_codex":0.000007665212,"about_ca_system_score_gemma":0.00001371523,"threshold_uncertainty_score":0.4553484},"labels":[],"label_agreement":null},{"id":"W3117918501","doi":"10.1145/3427753","title":"Application of Simulation in Healthcare Service Operations","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Health care; Popularity; Computer science; Healthcare service; Service delivery framework; Management science; Domain (mathematical analysis); Service (business); Healthcare delivery; Process management; Knowledge management; Risk analysis (engineering); Operations research; Data science; Medicine; Engineering; Business; Psychology","score_opus":0.1061933032634809,"score_gpt":0.405444636926345,"score_spread":0.2992513336628641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117918501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13283952,0.000026484462,0.8571788,0.009023029,0.00009478753,0.0007266663,0.000016767906,0.00008333378,0.000010603686],"genre_scores_gemma":[0.9567672,0.00003074537,0.039772812,0.0031383818,0.00011349449,0.00007438474,0.00007683064,0.000021687189,0.000004448128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823165,0.00028926428,0.000745652,0.0003518836,0.00018376774,0.00019776831],"domain_scores_gemma":[0.99867076,0.00033758229,0.000089043395,0.00028667448,0.0004912575,0.00012468034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027810762,0.0001435103,0.0002336574,0.00016733122,0.0005224946,0.0000158812,0.0001104314,0.00020003523,0.000013845167],"category_scores_gemma":[0.000049381575,0.00015133679,0.000033598153,0.00056940544,0.000010925945,0.00026190456,0.000010687407,0.00041042166,0.000016262095],"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.0000628827,0.000045476656,0.0006791516,0.00013444413,0.0000060171446,1.2292035e-7,0.0034354809,0.9719999,0.000026666337,0.0003647146,4.6921878e-7,0.023244679],"study_design_scores_gemma":[0.00068173226,0.00010897285,0.000511556,0.00009154536,0.000011127054,1.2837079e-7,0.00022402844,0.99789906,0.000005163862,0.00030927977,0.000035839075,0.000121599245],"about_ca_topic_score_codex":0.0009737701,"about_ca_topic_score_gemma":0.0004733661,"teacher_disagreement_score":0.8239277,"about_ca_system_score_codex":0.00006857455,"about_ca_system_score_gemma":0.00013100097,"threshold_uncertainty_score":0.6171335},"labels":[],"label_agreement":null},{"id":"W3123679449","doi":"10.1145/3429336","title":"Green Simulation with Database Monte Carlo","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Control variates; Variance reduction; Computer science; Monte Carlo method; Variance (accounting); Convergence (economics); Reduction (mathematics); Idle; Database; Mathematical optimization; Simulation; Statistics; Mathematics; Monte Carlo molecular modeling","score_opus":0.11204015738904748,"score_gpt":0.32694047555853806,"score_spread":0.21490031816949057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123679449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06112189,0.00005886414,0.9382434,0.00019974331,0.0001561638,0.00010005423,0.000012551629,0.00008754482,0.000019806499],"genre_scores_gemma":[0.9306323,0.000006469511,0.068981096,0.00010889309,0.000071366114,0.0000047133212,0.0000070886385,0.00001301832,0.0001750913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845076,0.00008794298,0.0003248649,0.00047665832,0.00051240943,0.00014737113],"domain_scores_gemma":[0.9978881,0.00094049866,0.000051002025,0.00066076376,0.0003722172,0.000087439956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003695704,0.00014504929,0.00017685423,0.00015283968,0.00024138363,0.0001603735,0.00018035609,0.000067343644,0.000021813215],"category_scores_gemma":[0.00008927509,0.00011302862,0.000050604034,0.00038112438,0.0000214646,0.00034451147,0.000013049928,0.0001521712,0.000012549],"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.0000376177,0.000037326437,0.000023355175,0.0000052695623,0.000015530772,0.0000053887793,0.00020076877,0.93233573,0.0000073059323,0.000050977633,0.0000027877538,0.06727797],"study_design_scores_gemma":[0.00041002562,0.00006893366,0.00007950935,0.000039522638,0.000028740287,0.000006294854,0.00004075753,0.99635327,0.000015004481,0.0027055878,0.00010302685,0.0001493165],"about_ca_topic_score_codex":0.000035566994,"about_ca_topic_score_gemma":0.000019762649,"teacher_disagreement_score":0.86951035,"about_ca_system_score_codex":0.000023977263,"about_ca_system_score_gemma":0.000044886765,"threshold_uncertainty_score":0.46091732},"labels":[],"label_agreement":null},{"id":"W3184040039","doi":"10.1145/3462202","title":"Explicit Modeling of Personal Space for Improved Local Dynamics in Simulated Crowds","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Evacuation and Crowd Dynamics","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crowds; Computer science; Crowd simulation; Entertainment; Space (punctuation); Focus (optics); Frame (networking); Human–computer interaction; Distributed computing; Simulation; Computer security; Computer network","score_opus":0.019784935368795865,"score_gpt":0.2495241054533798,"score_spread":0.22973917008458394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184040039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2351068,0.00004539857,0.7644627,0.00006679691,0.000102926984,0.000110338064,0.000016851083,0.00007723513,0.000010980912],"genre_scores_gemma":[0.97503734,0.00003256581,0.024771908,0.000035864767,0.000022816514,0.0000066751377,0.000054017815,0.000027187287,0.000011605766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992491,0.000016552714,0.00029643998,0.00020419825,0.000086032385,0.00014769126],"domain_scores_gemma":[0.9995036,0.00011680094,0.000020297657,0.00017064161,0.00014636465,0.000042300606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008541719,0.00013605902,0.00017620361,0.00013032893,0.000067041896,0.000029149845,0.00006006145,0.0001187627,0.0000037742848],"category_scores_gemma":[0.000006586957,0.00016252058,0.0000715159,0.00017366071,0.000008232593,0.00012696935,0.000004238249,0.0001494499,4.1398238e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034143315,0.00003970519,0.0000073754595,0.000051025014,0.000023864997,3.3556907e-7,0.00034325078,0.9744526,0.00009443967,0.00017188462,1.74097e-7,0.024781175],"study_design_scores_gemma":[0.0008564146,0.000039248036,0.000004517655,0.000055891378,0.00002137193,0.0000013272806,0.00020998181,0.99731034,0.00008043968,0.0012638726,0.0000017854247,0.00015481561],"about_ca_topic_score_codex":0.000018908679,"about_ca_topic_score_gemma":0.00009767802,"teacher_disagreement_score":0.73993057,"about_ca_system_score_codex":0.00010667583,"about_ca_system_score_gemma":0.000023919685,"threshold_uncertainty_score":0.6627397},"labels":[],"label_agreement":null},{"id":"W3185643228","doi":"10.1145/3459605","title":"Falsification of Hybrid Systems Using Adaptive Probabilistic Search","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Japan Science and Technology Agency; Japan Society for the Promotion of Science","keywords":"Probabilistic logic; Computer science; Robustness (evolution); Discriminative model; Exploit; Baseline (sea); Discretization; Algorithm; Key (lock); Tree traversal; Tree (set theory); Mathematical optimization; Machine learning; Artificial intelligence; Mathematics","score_opus":0.0666532214771873,"score_gpt":0.29892923341253497,"score_spread":0.23227601193534766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185643228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13117884,0.00008031986,0.8682694,0.00006867898,0.00021337644,0.000101148915,0.0000030381784,0.000074966054,0.000010248753],"genre_scores_gemma":[0.84461874,0.000007744777,0.15528452,0.000016149359,0.00004383307,0.000003268337,0.0000040103578,0.000006993,0.000014723665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888283,0.00015657135,0.00025402367,0.00035273706,0.00022507811,0.00012875978],"domain_scores_gemma":[0.99897766,0.00017951003,0.00005729059,0.00045036056,0.0002855348,0.000049642946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020985547,0.000106560896,0.00015090706,0.00011639501,0.0001921454,0.00010779869,0.00019111313,0.000033817207,0.0000012942411],"category_scores_gemma":[0.000011829454,0.0001087199,0.00004766035,0.00023705029,0.000016735305,0.00021919573,0.000018214841,0.0001615716,0.0000017390926],"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.00000556017,0.000077122306,0.0000053070326,0.00002575959,0.0000148750705,0.000001824,0.00024449342,0.9309022,0.000070323564,0.00096192234,1.5931846e-7,0.06769049],"study_design_scores_gemma":[0.0002492976,0.00009743077,0.000017628985,0.00007709061,0.000013488163,0.000019504185,0.000027762078,0.9977935,0.00021602433,0.0013777814,0.0000035146513,0.00010699428],"about_ca_topic_score_codex":0.00007582865,"about_ca_topic_score_gemma":7.204037e-7,"teacher_disagreement_score":0.7134399,"about_ca_system_score_codex":0.00002958483,"about_ca_system_score_gemma":0.000059457056,"threshold_uncertainty_score":0.44334686},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W3186212639","doi":"10.1145/3449356","title":"Transfer Reinforcement Learning for Autonomous Driving","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Autonomous Vehicle Technology and Safety","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Reinforcement learning; Fidelity; Computer science; Domain (mathematical analysis); Perception; Transfer of learning; Reinforcement; Artificial intelligence; Mathematics; Engineering","score_opus":0.016745849241885002,"score_gpt":0.23099925646590616,"score_spread":0.21425340722402117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186212639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1257003,0.00005138317,0.8734002,0.00009929042,0.00013723571,0.00009621085,7.5827694e-7,0.00047746772,0.000037165693],"genre_scores_gemma":[0.98469096,0.000048829435,0.015058984,0.00005643415,0.000037318456,0.000020370635,0.0000132736395,0.000020921036,0.000052912015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941593,0.000012132508,0.00018844163,0.00017888322,0.000053894473,0.00015069632],"domain_scores_gemma":[0.9996494,0.00009672463,0.0000070414508,0.00016962684,0.000044898305,0.00003232232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006802341,0.000113102564,0.00011839714,0.00006913355,0.00023715915,0.000027127186,0.000058236143,0.00011432499,0.000010269553],"category_scores_gemma":[0.0000034247448,0.00013090706,0.00005913738,0.00007157875,0.000009518678,0.00013187397,0.0000029546343,0.00020105943,0.0000027036176],"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.000006257529,0.000009367008,0.0000056154977,0.000016549353,0.00003061629,6.0361447e-7,0.00017956102,0.8534689,0.00011185028,0.00019359085,4.658226e-7,0.1459766],"study_design_scores_gemma":[0.0003986074,0.000055875917,0.00001723192,0.000025066882,0.00002556404,0.0000034866075,0.00002656191,0.9971554,0.0010226861,0.0008473362,0.0002818439,0.00014033995],"about_ca_topic_score_codex":0.0000014600097,"about_ca_topic_score_gemma":0.000003133395,"teacher_disagreement_score":0.85899067,"about_ca_system_score_codex":0.000036013116,"about_ca_system_score_gemma":0.000012691361,"threshold_uncertainty_score":0.53382355},"labels":[],"label_agreement":null},{"id":"W3203605282","doi":"10.1145/3466169","title":"Uncertainty on Discrete-Event System Simulation","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"DEVS; Rotation formalisms in three dimensions; Discrete event simulation; Computer science; Bounding overwatch; Formalism (music); Algorithm; Discrete event dynamic system; Theoretical computer science; Modeling and simulation; Discrete system; Mathematics; Simulation; Artificial intelligence","score_opus":0.10808459565139562,"score_gpt":0.39605454710687205,"score_spread":0.28796995145547644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203605282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07372292,0.000018275592,0.92477125,0.0005583773,0.00022014255,0.00024331489,0.000021054406,0.00024508333,0.00019957093],"genre_scores_gemma":[0.98673093,0.000006569779,0.012560042,0.0003015661,0.00012181709,0.000027582419,0.000027056063,0.000018970695,0.00020545571],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974893,0.00018444638,0.0006704873,0.0007007654,0.0007668673,0.00018816891],"domain_scores_gemma":[0.996695,0.0015594895,0.00013495068,0.0009855547,0.0005108656,0.00011416145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005613568,0.00020172088,0.00024760596,0.00025195393,0.0005572252,0.00030283013,0.0002674545,0.00013057078,0.00005018929],"category_scores_gemma":[0.00009647765,0.0001751838,0.00015706736,0.00057763397,0.00002413205,0.00023951099,0.000019850982,0.00020089812,0.000059687354],"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.000029065912,0.00006298571,0.000016780348,0.000004438247,0.000010806092,0.0000010844456,0.00012954051,0.86570746,0.000011430055,0.001575954,0.000007280192,0.1324432],"study_design_scores_gemma":[0.000376379,0.00008533811,0.000110294306,0.000059383972,0.000021373993,0.0000027122062,0.00014870764,0.98590404,0.00011097933,0.012287043,0.0007070966,0.00018664922],"about_ca_topic_score_codex":0.000017598328,"about_ca_topic_score_gemma":0.0000067145847,"teacher_disagreement_score":0.91300803,"about_ca_system_score_codex":0.00009402207,"about_ca_system_score_gemma":0.000040278752,"threshold_uncertainty_score":0.7143788},"labels":[],"label_agreement":null},{"id":"W4287831525","doi":"10.1145/3543849","title":"The DEVStone Metric: Performance Analysis of DEVS Simulation Engines","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Ministerio de Ciencia e Innovación","keywords":"DEVS; Benchmark (surveying); Discrete event simulation; Metric (unit); Computer science; Formalism (music); Performance metric; Modeling and simulation; Simulation; Engineering","score_opus":0.10120503686315428,"score_gpt":0.3780876981216702,"score_spread":0.2768826612585159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287831525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2988578,0.000047792022,0.70065695,0.00014015117,0.000073818854,0.00014194813,0.000012705011,0.00005132884,0.000017477005],"genre_scores_gemma":[0.99256116,0.000027393813,0.007170401,0.00007421655,0.000022384702,0.000040410654,0.000013654385,0.000008743461,0.00008163417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979667,0.00012964067,0.0006436739,0.00033298787,0.0007965383,0.00013047435],"domain_scores_gemma":[0.99595594,0.0027557767,0.00019792934,0.00069777324,0.00034951093,0.00004304168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001152176,0.000116282186,0.0002136754,0.0008648887,0.0012598501,0.00010898329,0.00044070234,0.000039868213,0.00005123612],"category_scores_gemma":[0.00007994505,0.000089546855,0.00015390008,0.0030870242,0.00003281605,0.00019815235,0.00003411084,0.00015969672,0.0000025568345],"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.000023460452,0.000030791733,0.000209177,7.90683e-7,0.00005216618,2.9724855e-8,0.00016700798,0.7392313,0.0000033866845,0.0001575069,0.0000018774188,0.2601225],"study_design_scores_gemma":[0.00015942636,0.00008174157,0.0016153482,0.0000020499865,0.00013398443,3.6348914e-7,0.00009288856,0.99418056,0.00002849006,0.0027435306,0.00086352194,0.00009810421],"about_ca_topic_score_codex":0.000024234343,"about_ca_topic_score_gemma":0.0000059589943,"teacher_disagreement_score":0.69370335,"about_ca_system_score_codex":0.0000415392,"about_ca_system_score_gemma":0.00002184922,"threshold_uncertainty_score":0.9689876},"labels":[],"label_agreement":null},{"id":"W4317036118","doi":"10.1145/3580491","title":"SEH: Size Estimate Hedging Scheduling of Queues","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scheduling (production processes); Computer science; Queue; Variance (accounting); Mathematical optimization; Mathematics; Computer network; Accounting; Economics","score_opus":0.16515148452082612,"score_gpt":0.44962101077759437,"score_spread":0.28446952625676825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317036118","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27970895,0.000019513453,0.71974504,0.0001757288,0.00014981056,0.00008020788,0.0000042225793,0.00010863748,0.000007892149],"genre_scores_gemma":[0.9083734,0.000021429114,0.09141525,0.00002290142,0.000054310334,0.0000052016426,0.0000024046876,0.0000130725975,0.00009199326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981187,0.00008791891,0.00044599178,0.0003962788,0.00073876226,0.0002123646],"domain_scores_gemma":[0.99648833,0.0025941927,0.00007611391,0.00046600882,0.00030364658,0.000071690025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092347054,0.00011787504,0.00020747272,0.00042023955,0.00029553327,0.00012559444,0.0003017403,0.000064504435,0.000019082483],"category_scores_gemma":[0.0003732045,0.00010248623,0.00007480126,0.00087454444,0.000042247208,0.00035060282,0.00002677085,0.00017637634,0.000040939525],"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.000020325124,0.000015043317,0.000030938078,0.0000054213524,0.000008246017,0.0000011463908,0.00034132326,0.81574804,0.000046555764,0.000009724523,0.0000012784677,0.18377194],"study_design_scores_gemma":[0.0002975793,0.00005090602,0.00020051138,0.000041898165,0.000006271062,0.0000013453289,0.00013299008,0.97172105,0.000176364,0.027262364,0.000011667856,0.00009702582],"about_ca_topic_score_codex":0.00001876755,"about_ca_topic_score_gemma":0.0000028531736,"teacher_disagreement_score":0.6286645,"about_ca_system_score_codex":0.000020473217,"about_ca_system_score_gemma":0.000027443071,"threshold_uncertainty_score":0.4179267},"labels":[],"label_agreement":null},{"id":"W4399320957","doi":"10.1145/3670401","title":"ENHANCE: Multilevel Heterogeneous Performance-Aware Re-Partitioning Algorithm For Microscopic Vehicle Traffic Simulation","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Algorithm; Traffic simulation; Parallel computing; Distributed computing; Microsimulation; Engineering","score_opus":0.1039789151833709,"score_gpt":0.40096509404697434,"score_spread":0.29698617886360346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399320957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23778172,0.00007241475,0.7609146,0.00015041252,0.0002695792,0.00044297325,0.000041671858,0.00032183732,0.000004747281],"genre_scores_gemma":[0.9339255,0.000023968942,0.06542194,0.00012825211,0.00017965036,0.00011415601,0.000037393795,0.000031217955,0.00013790226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790573,0.000056008776,0.0006552617,0.0007133418,0.00043226196,0.00023739706],"domain_scores_gemma":[0.99766266,0.0013300395,0.00008067451,0.00050750934,0.00033091413,0.00008818091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048492406,0.00021429292,0.00021721325,0.0003545781,0.00068655174,0.00052970427,0.0002510525,0.00014863742,0.00004587153],"category_scores_gemma":[0.000027400532,0.00019910817,0.00015080177,0.0004024402,0.000033768134,0.0005041542,0.000013082514,0.00018273738,0.00003501468],"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.000008909032,0.00002451255,0.0000024226,0.000008800865,0.000008335662,1.6347155e-7,0.00020242528,0.5390576,0.000020882968,0.000006855871,0.000005370828,0.4606537],"study_design_scores_gemma":[0.0002980974,0.00015328864,0.000027421222,0.00009751274,0.000030393801,0.0000017580865,0.00003156947,0.9946566,0.00065899774,0.003155773,0.00067214057,0.00021642118],"about_ca_topic_score_codex":0.0000064668325,"about_ca_topic_score_gemma":0.0000033621889,"teacher_disagreement_score":0.6961438,"about_ca_system_score_codex":0.00006461209,"about_ca_system_score_gemma":0.000037757844,"threshold_uncertainty_score":0.81193954},"labels":[],"label_agreement":null},{"id":"W4399809040","doi":"10.1145/3673226","title":"Context, Composition, Automation, and Communication: The C <sup>2</sup> AC Roadmap for Modeling and Simulation","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Context (archaeology); Automation; Composition (language); Computer science; Engineering","score_opus":0.1132068962270859,"score_gpt":0.36895202251498604,"score_spread":0.25574512628790014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399809040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13270834,0.00054606627,0.8634631,0.0024962607,0.00017823771,0.00040997434,0.000019922578,0.00016528011,0.00001280722],"genre_scores_gemma":[0.9786864,0.000043080036,0.020687317,0.00034416866,0.00008837686,0.000024234672,0.000043152326,0.00001454043,0.000068750014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790335,0.00018344888,0.00059788546,0.00068204186,0.00046599543,0.00016729413],"domain_scores_gemma":[0.9959265,0.0027317647,0.00007346382,0.0008586689,0.00033524775,0.000074367665],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020913954,0.00017916513,0.00018822475,0.00031047553,0.0012685402,0.0015862432,0.0003545881,0.0000747041,0.000008290516],"category_scores_gemma":[0.00009217369,0.00013584095,0.00006842606,0.00037791533,0.00007374124,0.00068058254,0.000060408656,0.00016351075,0.000007414117],"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.00001881401,0.000016713399,0.0000071021072,0.000013358178,0.000020745822,1.1975222e-7,0.0016660132,0.7577988,8.9919894e-7,0.0007432137,0.00006277434,0.23965144],"study_design_scores_gemma":[0.00035555218,0.000048292946,0.00003248061,0.00010064074,0.000053024105,0.0000037964032,0.0004548923,0.964981,0.0000012876684,0.032818444,0.0010024057,0.00014815142],"about_ca_topic_score_codex":0.000035474288,"about_ca_topic_score_gemma":0.000009345571,"teacher_disagreement_score":0.845978,"about_ca_system_score_codex":0.000029377528,"about_ca_system_score_gemma":0.000022741688,"threshold_uncertainty_score":0.9994502},"labels":[],"label_agreement":null}]}