{"meta":{"query_hash":"bdbfbbd1aee6","filters":{"venue":"Software Practice and Experience"},"cohort_total":140,"direct_labels_cover":0,"predictions_cover":140,"exported":140,"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/bdbfbbd1aee6","api":"https://metacan.xera.ac/api/v1/cohort?venue=Software+Practice+and+Experience"},"results":[{"id":"W1481266406","doi":"10.1002/spe.2327","title":"Stringlish: improved English string searching in binary files","year":2015,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Algorithms and Data Compression","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":"University of Calgary","funders":"","keywords":"String (physics); Binary number; Computer science; False positive paradox; Theoretical computer science; Mathematics; Artificial intelligence; Physics; Arithmetic; Theoretical physics","score_opus":0.02811363975311193,"score_gpt":0.2985223667986366,"score_spread":0.27040872704552465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481266406","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6895012,0.0025963094,0.30530858,0.00032950865,0.00095422193,0.0002771835,0.000009477606,0.00044101925,0.00058245065],"genre_scores_gemma":[0.826713,0.00012302416,0.17275687,0.00021058378,0.000112227164,0.000046076373,0.0000036814333,0.000008402951,0.000026122303],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99861455,0.00010342026,0.00019709238,0.00046668993,0.00029475614,0.00032348576],"domain_scores_gemma":[0.99866444,0.00042748975,0.00008896256,0.00043869013,0.000174014,0.00020639144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051783316,0.00013334445,0.00013159802,0.000100013305,0.00012058896,0.00039963776,0.0005327519,0.000057113968,0.00000452318],"category_scores_gemma":[0.003179528,0.00012147029,0.000017435292,0.00034944623,0.000055186683,0.0056720544,0.0009505694,0.0002877029,0.000004765456],"study_design_candidate":"design_other","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.00040330816,0.0006117244,0.02488426,0.00009253192,0.00002426157,0.0010382449,0.35390812,0.00046327387,0.0009125371,0.0056277234,0.0012688834,0.61076516],"study_design_scores_gemma":[0.00874689,0.0025173773,0.034422945,0.0014087098,0.000044215132,0.00057254796,0.23284948,0.31544232,0.007246715,0.007883257,0.3842905,0.0045750774],"about_ca_topic_score_codex":0.00038433707,"about_ca_topic_score_gemma":0.000009011683,"teacher_disagreement_score":0.6061901,"about_ca_system_score_codex":0.00004305783,"about_ca_system_score_gemma":0.00012131276,"threshold_uncertainty_score":0.49534148},"labels":[],"label_agreement":null},{"id":"W1481457981","doi":"10.1002/spe.2147","title":"Methods for selecting and improving software clustering algorithms","year":2012,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Engineering Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Cluster analysis; Computer science; Software; Data mining; Algorithm; Strengths and weaknesses; Process (computing); Machine learning; Programming language","score_opus":0.03515311790681467,"score_gpt":0.3848034187302256,"score_spread":0.3496503008234109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481457981","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.013758616,0.0039436254,0.98070073,0.00017944025,0.0005443953,0.0003059804,0.0000012621141,0.0005557178,0.000010216775],"genre_scores_gemma":[0.08289396,0.000079344565,0.91630924,0.00025918457,0.00017924818,0.00020102506,9.702245e-7,0.000029054463,0.00004794447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803305,0.0001314706,0.00024124254,0.00055493054,0.00024430364,0.0007949909],"domain_scores_gemma":[0.99105525,0.007893129,0.00011887838,0.00041897286,0.00019366156,0.00032008433],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0018592475,0.00022351541,0.00021331929,0.00012301942,0.00047350215,0.0004300238,0.00042859785,0.000103802806,0.000003085086],"category_scores_gemma":[0.022949154,0.00022237946,0.000037743728,0.00038281336,0.00008059035,0.004000981,0.0007167278,0.00028684843,0.000003241902],"study_design_candidate":"design_other","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.00001905884,0.000041483043,0.011671436,0.00015135406,0.000022019283,0.0000036596018,0.01908786,0.00001793715,0.0016438842,0.0002612328,0.00003342736,0.9670466],"study_design_scores_gemma":[0.0075422586,0.0030917567,0.06429813,0.00094075344,0.00037534337,0.010066903,0.036597863,0.41651654,0.09903242,0.0032025715,0.34842125,0.00991421],"about_ca_topic_score_codex":0.000075485405,"about_ca_topic_score_gemma":9.233037e-7,"teacher_disagreement_score":0.95713246,"about_ca_system_score_codex":0.00006088681,"about_ca_system_score_gemma":0.000060254617,"threshold_uncertainty_score":0.98528093},"labels":[],"label_agreement":null},{"id":"W1503262082","doi":"10.1002/spe.2116","title":"Playing MUSIC — building context‐aware and self‐adaptive mobile applications","year":2012,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Adaptation (eye); Computer science; Context (archaeology); Context awareness; Joint (building); Human–computer interaction; Mobile device; Mobile computing; Ubiquitous computing; Multimedia; World Wide Web; Telecommunications; Engineering; Architectural engineering; Psychology","score_opus":0.02921781814748071,"score_gpt":0.29604554579925413,"score_spread":0.2668277276517734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503262082","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.11909502,0.0030826414,0.8758462,0.00016765684,0.00032090434,0.0006840437,0.0000050641784,0.0004553297,0.00034310293],"genre_scores_gemma":[0.93900764,0.00011520481,0.059126485,0.00070662535,0.00013595162,0.00086606387,0.000001230316,0.00001367149,0.000027108264],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984263,0.00014550966,0.0002436607,0.0005093006,0.00027097957,0.0004042538],"domain_scores_gemma":[0.9974617,0.0014408573,0.00022463812,0.000420813,0.00019327563,0.00025875267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004438178,0.00020017847,0.00021172086,0.00008964398,0.00060293695,0.00031417672,0.00031157673,0.00008565633,0.000012472416],"category_scores_gemma":[0.0002931491,0.00020221598,0.0000343403,0.0003426975,0.00010409784,0.0056938496,0.00038842025,0.00021351948,0.000039461138],"study_design_candidate":"design_other","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.000035026816,0.0005379852,0.015418267,0.00008816177,0.00009225166,0.000017834835,0.12955849,0.0000023135576,0.0010765392,0.010458825,0.00029272606,0.8424216],"study_design_scores_gemma":[0.0025789037,0.0008015936,0.013642882,0.0004169025,0.00021192715,0.0046783034,0.14951496,0.008320642,0.0060707894,0.0013126592,0.80908453,0.0033659171],"about_ca_topic_score_codex":0.00015645147,"about_ca_topic_score_gemma":0.000008905814,"teacher_disagreement_score":0.83905566,"about_ca_system_score_codex":0.00005609487,"about_ca_system_score_gemma":0.000056052675,"threshold_uncertainty_score":0.8246128},"labels":[],"label_agreement":null},{"id":"W1532805649","doi":"10.1002/spe.2134","title":"Validating pragmatic reuse tasks by leveraging existing test suites","year":2012,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Engineering Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Reuse; Computer science; Correctness; Software engineering; Test suite; Test (biology); Code (set theory); Task (project management); Code reuse; Software; Test case; Programming language; Systems engineering; Machine learning; Engineering","score_opus":0.033974894645382156,"score_gpt":0.32588452441226484,"score_spread":0.2919096297668827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532805649","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.48090076,0.0043793926,0.5109619,0.0013465431,0.0005595698,0.00032021198,0.000006736104,0.0012011193,0.00032375014],"genre_scores_gemma":[0.7436135,0.000057934816,0.25564557,0.0003558517,0.00010357186,0.000072658215,0.000003572728,0.00002264739,0.00012468288],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99772877,0.00012514848,0.000297641,0.0004796001,0.0005683613,0.0008004572],"domain_scores_gemma":[0.978325,0.020053776,0.00017378977,0.00096394104,0.00015803814,0.00032546598],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0013027183,0.00022313323,0.00018375623,0.00009720374,0.00042168217,0.0005671369,0.0010313852,0.000071724964,0.000022696646],"category_scores_gemma":[0.12898177,0.0002214102,0.00003012968,0.0005575272,0.0000890768,0.005181106,0.00096067536,0.0003806257,0.000055166707],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013924184,0.0005348842,0.7109528,0.00032442814,0.00005341493,0.00009061713,0.16686012,0.00004124919,0.01723701,0.0017042505,0.008352646,0.09383466],"study_design_scores_gemma":[0.0045111342,0.0014315833,0.109497316,0.002481428,0.00021678832,0.0065628723,0.062703446,0.023477228,0.11541509,0.0022170888,0.6618746,0.009611441],"about_ca_topic_score_codex":0.0001189598,"about_ca_topic_score_gemma":3.4823873e-7,"teacher_disagreement_score":0.65352196,"about_ca_system_score_codex":0.00008132691,"about_ca_system_score_gemma":0.000057160552,"threshold_uncertainty_score":0.9028846},"labels":[],"label_agreement":null},{"id":"W1539563854","doi":"10.1002/spe.1093","title":"Web workload generation challenges – an empirical investigation","year":2011,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Workload; Computer science; Scalability; Generator (circuit theory); Java; Web application; Operating system; Web server; Throughput; The Internet","score_opus":0.10099493882472575,"score_gpt":0.3225370317972244,"score_spread":0.22154209297249866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539563854","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9051741,0.0029466792,0.08821972,0.0014348733,0.0007342784,0.00023334996,6.694647e-7,0.0005610973,0.00069526694],"genre_scores_gemma":[0.8790564,0.0012152811,0.11848962,0.000979588,0.00015121729,0.000078971774,0.0000017211075,0.000007973955,0.000019203246],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99840784,0.00021207453,0.00025732777,0.0005826807,0.0002899362,0.00025016934],"domain_scores_gemma":[0.9986935,0.0001569572,0.00014014664,0.00062827725,0.00018527832,0.00019581488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006018945,0.00015901146,0.00014222541,0.00006435618,0.00027915518,0.00013795793,0.0004042035,0.00012451416,0.000014480406],"category_scores_gemma":[0.00062491046,0.00013357094,0.000027646623,0.00024627632,0.00013936218,0.0051856763,0.00014610187,0.00015712797,0.000044001226],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007027127,0.00041485275,0.10732789,0.0000927159,0.000029709856,0.000047939946,0.37728828,0.000008936735,0.0013454127,0.0033011506,0.0004982242,0.50957465],"study_design_scores_gemma":[0.004997834,0.0067928266,0.5732948,0.0007927472,0.00021444257,0.002884565,0.08383163,0.09362569,0.05506803,0.024496133,0.14690141,0.007099885],"about_ca_topic_score_codex":0.000067015484,"about_ca_topic_score_gemma":0.000021022179,"teacher_disagreement_score":0.5024747,"about_ca_system_score_codex":0.000028648376,"about_ca_system_score_gemma":0.00011221293,"threshold_uncertainty_score":0.5446865},"labels":[],"label_agreement":null},{"id":"W1543881559","doi":"10.1002/spe.2228","title":"A recommendation system for repairing violations detected by static architecture conformance checking","year":2013,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Engineering Research","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Code refactoring; Conformance checking; Computer science; Software engineering; Architecture; Process (computing); Systems architecture; Process management; Engineering; Operations management; Programming language; Work in process; Business process; Software","score_opus":0.013843532244916478,"score_gpt":0.28333398793798403,"score_spread":0.26949045569306757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543881559","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.07584435,0.00010457522,0.9216338,0.0009425568,0.00018003776,0.0005526304,0.000004666606,0.00069945626,0.000037946396],"genre_scores_gemma":[0.7240636,0.00002192752,0.27502075,0.000169693,0.000028916656,0.00064048753,0.0000099812705,0.000014524701,0.000030125459],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871516,0.00005609367,0.00024986634,0.0004030613,0.000214077,0.0003617614],"domain_scores_gemma":[0.99650365,0.002605821,0.0001369884,0.00035267777,0.00027237533,0.00012847991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034097736,0.00014578912,0.00013056275,0.00009973597,0.0003192511,0.0004227364,0.0003480309,0.000059413105,0.000012371877],"category_scores_gemma":[0.0044472804,0.00014106606,0.000024227595,0.0003531972,0.000040564337,0.002448314,0.00015000743,0.00019376162,0.000018118217],"study_design_candidate":"design_other","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.00008873238,0.0001532701,0.0075460863,0.0010467187,0.00012342566,0.000012767301,0.059442215,0.00068337296,0.019829994,0.0017653677,0.004314537,0.90499353],"study_design_scores_gemma":[0.0049888752,0.001966341,0.016282396,0.00131836,0.000105675455,0.0013230637,0.028186297,0.6679106,0.06715619,0.0023675987,0.2042683,0.00412634],"about_ca_topic_score_codex":0.000114719645,"about_ca_topic_score_gemma":0.0000016555956,"teacher_disagreement_score":0.90086716,"about_ca_system_score_codex":0.00008564853,"about_ca_system_score_gemma":0.00005184742,"threshold_uncertainty_score":0.5752507},"labels":[],"label_agreement":null},{"id":"W1553924878","doi":"10.1002/spe.2282","title":"Improving J9 virtual machine with LTTng for efficient and effective tracing","year":2014,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software System Performance and Reliability","field":"Computer Science","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":"Atlantic Hydrogen (Canada); University of New Brunswick","funders":"Atlantic Canada Opportunities Agency; University of New Brunswick; International Business Machines Corporation","keywords":"Tracing; Computer science; Throughput; Kernel (algebra); Overhead (engineering); Virtual machine; Component (thermodynamics); Parallel computing; Operating system","score_opus":0.004570723289212413,"score_gpt":0.24223078633625061,"score_spread":0.2376600630470382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553924878","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.3611481,0.00025286968,0.63770634,0.00016638722,0.00016166673,0.00038787242,0.0000012855548,0.00014470071,0.000030790627],"genre_scores_gemma":[0.9082777,0.00001681598,0.09106713,0.00033484006,0.00006391684,0.00021117352,9.626609e-7,0.00001172685,0.000015737245],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984551,0.00010841177,0.00021067253,0.00064285705,0.00024580758,0.0003371678],"domain_scores_gemma":[0.99724835,0.001878371,0.00017426841,0.00039572731,0.00016387986,0.00013942676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008878296,0.00020299859,0.00022978547,0.000059992264,0.00049533154,0.00024710354,0.0002452801,0.00007270147,0.0000010215563],"category_scores_gemma":[0.0016932953,0.00014644703,0.000031147327,0.00020019923,0.00015330037,0.0012823376,0.00017253975,0.00016279165,0.0000029700816],"study_design_candidate":"design_other","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.00035775529,0.0001587709,0.015813144,0.00035692548,0.000035833502,0.000009687869,0.039365616,0.0005674445,0.0007178469,0.0027642245,0.000018429226,0.9398343],"study_design_scores_gemma":[0.010320316,0.012091455,0.03812031,0.0010925113,0.00026904413,0.0023157124,0.023842143,0.8601063,0.02467323,0.00095780066,0.022429185,0.0037820274],"about_ca_topic_score_codex":0.00012287684,"about_ca_topic_score_gemma":0.0000066630473,"teacher_disagreement_score":0.9360523,"about_ca_system_score_codex":0.00003266861,"about_ca_system_score_gemma":0.000041917956,"threshold_uncertainty_score":0.59719366},"labels":[],"label_agreement":null},{"id":"W1555588376","doi":"10.1002/spe.2108","title":"Linguistic security testing for text communication protocols","year":2012,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Web Application Security Vulnerabilities","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Sheridan College","funders":"","keywords":"Computer science; Syntax; Protocol (science); Programming language; Grammar; Test (biology); Formal grammar; Cryptographic protocol; Communications protocol; Natural language processing; Rule-based machine translation; Computer security; Computer network; Linguistics","score_opus":0.054563875608530175,"score_gpt":0.3688064179561888,"score_spread":0.31424254234765864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555588376","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.029410925,0.0014851238,0.9507836,0.002390164,0.00021038722,0.010916004,0.000008526086,0.00087153586,0.0039236965],"genre_scores_gemma":[0.618839,0.0000068159025,0.37018347,0.0005488215,0.00008527575,0.01030823,0.0000018960667,0.0000073531423,0.000019100606],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988496,0.00012208673,0.00023923298,0.0002849966,0.00019603258,0.0003080777],"domain_scores_gemma":[0.99507433,0.0034212123,0.00020147194,0.0007630237,0.0004086009,0.00013136279],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.00090311124,0.00012094575,0.00012224233,0.000035383164,0.00044842926,0.00026817023,0.00059096556,0.000056134453,0.000004650947],"category_scores_gemma":[0.013489721,0.00012104671,0.00002261584,0.0002514066,0.00012827717,0.0022477016,0.00030515558,0.00015804823,0.000016978876],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006604844,0.0007596861,0.024920577,0.00036539888,0.00002130187,0.0000012880399,0.4586945,0.0000052991095,0.00072746444,0.41954875,0.00092811126,0.09396159],"study_design_scores_gemma":[0.0008049064,0.0003134101,0.0033828227,0.00018127881,0.00002475539,0.00017517233,0.009558026,0.005408937,0.0053089047,0.050516166,0.92344475,0.0008808485],"about_ca_topic_score_codex":0.00006360347,"about_ca_topic_score_gemma":0.0000019804486,"teacher_disagreement_score":0.92251664,"about_ca_system_score_codex":0.00003413697,"about_ca_system_score_gemma":0.00006230359,"threshold_uncertainty_score":0.99482006},"labels":[],"label_agreement":null},{"id":"W1582789180","doi":"10.1002/spe.1155","title":"Model‐driven rapid prototyping with Umple","year":2011,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","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":"University of Lethbridge; University of Ottawa","funders":"","keywords":"Computer science; Focus (optics); Interface (matter); Rapid prototyping; Process (computing); User interface; Class (philosophy); Point (geometry); Human–computer interaction; Software engineering; Modeling language; Software; Engineering; Programming language; Operating system; Artificial intelligence","score_opus":0.041277872181076855,"score_gpt":0.2631958965107642,"score_spread":0.22191802432968732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582789180","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.0067414516,0.00023347084,0.99063385,0.00012746734,0.00005048865,0.00042303995,0.0000011118005,0.001259578,0.00052952766],"genre_scores_gemma":[0.1906262,0.00011852766,0.80850303,0.0003432497,0.000014556552,0.00034683978,6.505185e-7,0.00001870542,0.000028244154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853575,0.000045424356,0.00019386326,0.00056988635,0.00029198173,0.0003631164],"domain_scores_gemma":[0.99875075,0.00009493007,0.00012357734,0.0007153171,0.00016158621,0.00015384261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020801586,0.00021695402,0.00017499899,0.00008701961,0.00018904367,0.00012665888,0.0007038561,0.00007544566,0.000012745748],"category_scores_gemma":[0.00008547668,0.00018652267,0.00002816641,0.00028449058,0.0001153317,0.0030737005,0.000319955,0.0002246862,0.0000098249875],"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.00026491017,0.00043061166,0.0048130923,0.00014911557,0.00008593306,0.00029052628,0.16928618,0.00081273826,0.0006534391,0.24215792,0.00041749788,0.58063805],"study_design_scores_gemma":[0.0017448907,0.0027480652,0.0023279667,0.00065442023,0.000098219505,0.0019573995,0.0015016126,0.6390229,0.027341744,0.011311541,0.30748215,0.0038091175],"about_ca_topic_score_codex":0.00007535895,"about_ca_topic_score_gemma":0.0000027933877,"teacher_disagreement_score":0.6382101,"about_ca_system_score_codex":0.000030585437,"about_ca_system_score_gemma":0.00008257043,"threshold_uncertainty_score":0.7606173},"labels":[],"label_agreement":null},{"id":"W1582803778","doi":"10.1002/spe.1157","title":"MpAssign: a framework for solving the many‐core platform mapping problem","year":2011,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Interconnection Networks and Systems","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":"Polytechnique Montréal; STMicroelectronics (Canada)","funders":"","keywords":"Computer science; Metaheuristic; Sorting; Evolutionary algorithm; Context (archaeology); Pareto principle; Multi-objective optimization; Genetic algorithm; Evolutionary computation; Mathematical optimization; Distributed computing; Theoretical computer science; Artificial intelligence; Algorithm; Machine learning; Mathematics","score_opus":0.08788266090564611,"score_gpt":0.30195133746322184,"score_spread":0.21406867655757572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582803778","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.003657279,0.00041675978,0.99232453,0.00065622275,0.0007820116,0.0004015249,7.398776e-7,0.00017894966,0.001582],"genre_scores_gemma":[0.58690983,0.00004613433,0.4108602,0.0014899876,0.00018610626,0.00034648078,4.0961112e-7,0.000011079965,0.00014971933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987492,0.000029800754,0.00027134616,0.00040192774,0.00018842328,0.00035929124],"domain_scores_gemma":[0.9980379,0.0010346611,0.00022899185,0.0004584708,0.00015792406,0.00008209083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060687214,0.00015150686,0.00014577845,0.000042477146,0.0006748557,0.00033668047,0.0006256614,0.00010059029,0.000023702436],"category_scores_gemma":[0.0006898565,0.00010446299,0.000060129572,0.00024164478,0.000077830846,0.001912707,0.00021791042,0.00023895797,0.000013060681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059195754,0.00006716879,0.0007170635,0.00006138693,0.00004316772,0.000019487194,0.2311214,0.000012093039,0.000055512213,0.70835,0.0015935316,0.05789999],"study_design_scores_gemma":[0.0010275973,0.0010793423,0.0010967151,0.001131033,0.00006160466,0.0016118784,0.1462359,0.074209765,0.0013770369,0.34564975,0.42476735,0.0017520206],"about_ca_topic_score_codex":0.00009344689,"about_ca_topic_score_gemma":0.0000058405913,"teacher_disagreement_score":0.5832526,"about_ca_system_score_codex":0.000024991843,"about_ca_system_score_gemma":0.000040168663,"threshold_uncertainty_score":0.5190513},"labels":[],"label_agreement":null},{"id":"W1771373694","doi":"10.1002/spe.390","title":"Schrödinger's token","year":2001,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Engineering Research","field":"Computer Science","cited_by":33,"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 Victoria","funders":"","keywords":"Security token; Computer science; Compiler; Programming language; Parsing; Programmer; Grammar; Context (archaeology); Syntax; Simple (philosophy); Natural language processing; Artificial intelligence; Linguistics; Operating system","score_opus":0.021275170917820926,"score_gpt":0.309870892575293,"score_spread":0.28859572165747205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1771373694","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.19375987,0.001693203,0.79950696,0.002450714,0.00045584817,0.00015639623,5.466818e-7,0.0009820262,0.0009944452],"genre_scores_gemma":[0.82215667,0.0006077801,0.17580196,0.0009024965,0.00010083326,0.000063679065,6.590897e-7,0.000015175659,0.00035076175],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99853796,0.00004982388,0.00014720154,0.00044964137,0.00040731407,0.00040805398],"domain_scores_gemma":[0.99748373,0.0015664268,0.000049734746,0.00056915276,0.00013571292,0.00019524439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034602446,0.00013553275,0.00011455944,0.00009992103,0.00020384819,0.00036000984,0.00069437147,0.00005897865,0.000033505654],"category_scores_gemma":[0.0061379373,0.00013092013,0.00002588577,0.00056101906,0.00007902292,0.0028306204,0.00042306972,0.00022867789,0.00011897112],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012454732,0.00039197455,0.18765752,0.00008149214,0.00008508351,0.0019058962,0.05282478,0.00016460191,0.0019352088,0.022800855,0.0059467214,0.7260813],"study_design_scores_gemma":[0.0008350337,0.0003666572,0.031430036,0.00009708911,0.000014363297,0.0027974583,0.002839642,0.0035590434,0.0029352983,0.0014735202,0.95253116,0.0011206729],"about_ca_topic_score_codex":0.00007203493,"about_ca_topic_score_gemma":0.0000012174756,"teacher_disagreement_score":0.94658446,"about_ca_system_score_codex":0.000035764988,"about_ca_system_score_gemma":0.000057612695,"threshold_uncertainty_score":0.7348128},"labels":[],"label_agreement":null},{"id":"W1791987072","doi":"10.1002/spe.2203","title":"Decoding billions of integers per second through vectorization","year":2013,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":227,"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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Vectorization (mathematics); Scheme (mathematics); Encoding (memory); Data compression; Compression (physics)","score_opus":0.015749185143385063,"score_gpt":0.2803758415423402,"score_spread":0.2646266563989551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1791987072","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.053788044,0.0003898899,0.9442469,0.00043698464,0.00030139342,0.00011541973,0.0000023723462,0.000077722114,0.0006412659],"genre_scores_gemma":[0.60886395,0.00017734371,0.39035746,0.00045423655,0.000034571116,0.000034103363,0.0000033968856,0.0000056041895,0.00006930596],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991642,0.000043103453,0.00017834082,0.00028049282,0.00017738786,0.00015647084],"domain_scores_gemma":[0.99894214,0.00034574172,0.00013950896,0.00034004266,0.00017093681,0.00006164024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009419401,0.00009239838,0.00010415527,0.000039064384,0.00016612449,0.00016380867,0.00032517157,0.000044505363,0.0001926101],"category_scores_gemma":[0.00049573736,0.00007490659,0.000020752577,0.00021809888,0.00007142655,0.005740998,0.0002712323,0.00009664096,0.00003106697],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053538093,0.0006503753,0.011268327,0.00021364489,0.00009310754,0.000032269745,0.23439342,0.0001342087,0.05028265,0.08455782,0.013349631,0.604971],"study_design_scores_gemma":[0.0025558546,0.0014288692,0.025490006,0.00074361323,0.000089279034,0.0007347002,0.06568194,0.08565506,0.10918626,0.038452175,0.6668377,0.003144526],"about_ca_topic_score_codex":0.00024188537,"about_ca_topic_score_gemma":0.0000022058139,"teacher_disagreement_score":0.6534881,"about_ca_system_score_codex":0.000012990312,"about_ca_system_score_gemma":0.00003482341,"threshold_uncertainty_score":0.41620848},"labels":[],"label_agreement":null},{"id":"W1794179200","doi":"10.1002/spe.2286","title":"An evaluation framework for cross‐platform mobile application development tools","year":2014,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Mobile and Web Applications","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Benchmarking; Computer science; Cross-platform; Software engineering; Quality (philosophy); Development (topology); Systems engineering; Data science; Engineering; Operating system","score_opus":0.0360122442682971,"score_gpt":0.3744550579367658,"score_spread":0.33844281366846873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1794179200","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.046916623,0.00017436777,0.95137984,0.00015690847,0.00012634123,0.0009052046,0.0000012460825,0.0001639961,0.00017550185],"genre_scores_gemma":[0.5500699,0.000021715252,0.4445808,0.00054517295,0.000047306567,0.0047002514,0.00001617014,0.0000061921382,0.000012460488],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986763,0.000044372442,0.00023460512,0.0005210565,0.00030829487,0.00021539927],"domain_scores_gemma":[0.9978043,0.0008871934,0.00017067378,0.00067498576,0.0003667061,0.00009618382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096793065,0.00011852113,0.00009989778,0.00003661314,0.00046882711,0.0004789894,0.0004768215,0.00008986295,0.0000076166066],"category_scores_gemma":[0.0010160576,0.00011481228,0.00002078796,0.00019705035,0.000051092793,0.0029232022,0.00008408923,0.00008909223,0.00003058827],"study_design_candidate":"design_other","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.000010153194,0.00008761166,0.00049920124,0.000010782211,0.000003893178,6.8704104e-8,0.006963408,0.0000676799,0.00038180698,0.064390086,0.00001746968,0.92756784],"study_design_scores_gemma":[0.00055818877,0.0003012228,0.007004538,0.000031071402,0.00002622017,0.000026271886,0.0016716976,0.061008517,0.015815565,0.047782555,0.86517125,0.0006028753],"about_ca_topic_score_codex":0.000010958978,"about_ca_topic_score_gemma":0.0000026227885,"teacher_disagreement_score":0.92696494,"about_ca_system_score_codex":0.00004335423,"about_ca_system_score_gemma":0.00010645525,"threshold_uncertainty_score":0.4681909},"labels":[],"label_agreement":null},{"id":"W1838450684","doi":"10.1002/spe.2396","title":"Cold object identification in the Java virtual machine","year":2016,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; IBM (Canada)","funders":"Atlantic Canada Opportunities Agency; International Business Machines Corporation","keywords":"Heap (data structure); Computer science; Java; Correctness; Marshalling; Programming language; Operating system; Stack (abstract data type)","score_opus":0.014006271210751988,"score_gpt":0.28875143193738834,"score_spread":0.27474516072663635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1838450684","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.011225525,0.00026846546,0.9839279,0.0038700376,0.00010371809,0.000120135875,8.1725346e-7,0.00020631416,0.00027707894],"genre_scores_gemma":[0.94569993,0.00028298213,0.052510794,0.0012737716,0.000021335733,0.00004769602,4.9655205e-7,0.0000037925806,0.0001591755],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99898916,0.00017706421,0.00018188181,0.00028772102,0.00021163888,0.00015251475],"domain_scores_gemma":[0.99860406,0.00078551803,0.00011364936,0.00039687028,0.00006831582,0.00003160607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006594785,0.000083263905,0.00007072678,0.000058580466,0.00015765861,0.00020099123,0.0005850238,0.00003638495,0.000003743036],"category_scores_gemma":[0.001163965,0.000049215832,0.000015935175,0.00029950833,0.000073638985,0.0014078611,0.0001284692,0.00008183556,0.0000178192],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010317836,0.00058453094,0.012390419,0.000022839038,0.000023223727,0.000121177436,0.10690702,0.0002394401,0.008332423,0.20849052,0.0063135205,0.6564717],"study_design_scores_gemma":[0.006510344,0.002803617,0.06673885,0.00091482495,0.00008198697,0.0020049028,0.020830872,0.087343186,0.11002294,0.030586129,0.66727936,0.0048830095],"about_ca_topic_score_codex":0.00005457811,"about_ca_topic_score_gemma":0.0000047706662,"teacher_disagreement_score":0.9344744,"about_ca_system_score_codex":0.000018760784,"about_ca_system_score_gemma":0.000030280968,"threshold_uncertainty_score":0.20069633},"labels":[],"label_agreement":null},{"id":"W1880500695","doi":"10.1002/spe.2122","title":"Fast and effective soft links","year":2012,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Engineering Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Hypertext; Markup language; Source code; Java; Code (set theory); Traceability; Information retrieval; Signature (topology); Programming language; Database; World Wide Web; XML; Software engineering","score_opus":0.012176318863095538,"score_gpt":0.29793788636462176,"score_spread":0.2857615675015262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1880500695","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.22093645,0.0037043311,0.77339184,0.0006298157,0.00044355256,0.00026519032,0.0000011147694,0.0004689854,0.0001587181],"genre_scores_gemma":[0.9083883,0.00015188022,0.09066753,0.00048072814,0.000120282195,0.00011164743,5.171411e-7,0.0000132119285,0.000065903485],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9986107,0.00008835928,0.0001230926,0.00037236643,0.00031350742,0.0004920094],"domain_scores_gemma":[0.9956686,0.003489704,0.000052771557,0.00038774672,0.00010070614,0.0003004786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005223502,0.00015676986,0.00013620999,0.000080297425,0.00020669517,0.00023931485,0.00032918982,0.00012034977,0.000007492527],"category_scores_gemma":[0.0065291026,0.00014478156,0.000020136657,0.00030229992,0.00013031864,0.003436026,0.00049814006,0.000427702,0.000044919256],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000400114,0.00017630492,0.17843583,0.000089394394,0.000041714073,0.00004954082,0.07347755,0.00001826576,0.00063450495,0.00418542,0.00045218543,0.7423993],"study_design_scores_gemma":[0.0025086564,0.0013231955,0.690466,0.00031673026,0.000082023165,0.003809799,0.012193737,0.005874028,0.014460437,0.0014781032,0.26434338,0.003143927],"about_ca_topic_score_codex":0.000039121845,"about_ca_topic_score_gemma":4.359171e-7,"teacher_disagreement_score":0.73925537,"about_ca_system_score_codex":0.000031397467,"about_ca_system_score_gemma":0.00002870683,"threshold_uncertainty_score":0.7816417},"labels":[],"label_agreement":null},{"id":"W1907666016","doi":"10.1002/spe.1145","title":"Understanding design patterns — what is the problem?","year":2011,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Software design pattern; Representation (politics); Eclipse; Relevance (law); Context (archaeology); Object-oriented design; Simple (philosophy); Theoretical computer science; Transformation (genetics); Structural pattern; Design pattern; Key (lock); Specification pattern; Software design; Programming language; Software; Software development","score_opus":0.26059409250666976,"score_gpt":0.33105064535873946,"score_spread":0.0704565528520697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1907666016","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.00040441263,0.0011134916,0.9964766,0.00095073093,0.00032460157,0.0002072384,4.1993763e-7,0.0004399737,0.000082535356],"genre_scores_gemma":[0.07702,0.0015018806,0.91973746,0.0015910567,0.000023148663,0.00007966421,1.5424737e-7,0.000013400915,0.00003322512],"study_design_codex":"qualitative","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985689,0.00022794245,0.00017777758,0.00044047338,0.00024254172,0.00034234617],"domain_scores_gemma":[0.9964083,0.002734987,0.00012606478,0.00058201136,0.00006725371,0.00008141617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076729915,0.00017551717,0.00013097734,0.00004679932,0.00032917212,0.00038911778,0.0007724131,0.000060735994,0.000014739031],"category_scores_gemma":[0.0010400788,0.00012641754,0.00003119884,0.00026383655,0.00013789322,0.0059261825,0.00036501166,0.00022530579,0.000011820113],"study_design_candidate":"qualitative","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.000105793224,0.00014917186,0.0021792033,0.00009675718,0.000101723504,0.00021566353,0.68851733,0.0011062266,0.00028765586,0.06355087,0.0005908662,0.24309874],"study_design_scores_gemma":[0.0012356201,0.0012811162,0.0024620285,0.0007658723,0.00011697563,0.0016949478,0.26036048,0.003775039,0.03445355,0.6671754,0.023618136,0.0030608047],"about_ca_topic_score_codex":0.000028893062,"about_ca_topic_score_gemma":7.473127e-7,"teacher_disagreement_score":0.6036246,"about_ca_system_score_codex":0.00005264477,"about_ca_system_score_gemma":0.000036551806,"threshold_uncertainty_score":0.51551574},"labels":[],"label_agreement":null},{"id":"W1965370068","doi":"10.1002/spe.621","title":"Making XML document markup international","year":2004,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Mathematics, Computing, and Information Processing","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; University of Toronto","funders":"","keywords":"Computer science; SGML; World Wide Web; XML validation; Markup language; Efficient XML Interchange; XML; Document Structure Description; XML Schema Editor; RuleML; XML Schema (W3C); Streaming XML; Document type definition; Information retrieval; Programming language","score_opus":0.02285094262741164,"score_gpt":0.3258010483175628,"score_spread":0.30295010569015113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965370068","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.0076339506,0.00022945514,0.9823733,0.0021454012,0.00054324034,0.00007205916,2.5707664e-7,0.00019603973,0.006806285],"genre_scores_gemma":[0.49693808,0.000086491484,0.5001059,0.0027056772,0.000061610306,0.0000134346155,7.7664987e-7,0.0000044149624,0.00008359441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989649,0.000017906847,0.00026448417,0.00023225775,0.00033187133,0.00018858766],"domain_scores_gemma":[0.9991784,0.00014340745,0.00023256462,0.00024128884,0.00014349716,0.00006081541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003158861,0.0001064559,0.00008810794,0.00006749609,0.00024863426,0.0006729283,0.0005251082,0.000033630688,0.000031830266],"category_scores_gemma":[0.00086841907,0.000098801785,0.000023222072,0.00015161712,0.000049699403,0.0048211687,0.0003407116,0.00010982353,0.000046534675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002362591,0.00016171197,0.00047131782,0.00012857156,0.000038561746,0.00005410412,0.21929233,0.0005421273,0.00009104861,0.48161548,0.00050846156,0.29707265],"study_design_scores_gemma":[0.0035537817,0.00037120652,0.0014574262,0.001322131,0.00004403029,0.0030284154,0.04724202,0.041879103,0.006364143,0.29556036,0.5967253,0.0024521162],"about_ca_topic_score_codex":0.000012539356,"about_ca_topic_score_gemma":5.589968e-7,"teacher_disagreement_score":0.5962168,"about_ca_system_score_codex":0.000052141982,"about_ca_system_score_gemma":0.00006778422,"threshold_uncertainty_score":0.6489063},"labels":[],"label_agreement":null},{"id":"W1968600331","doi":"10.1002/1097-024x(20001110)30:13<1465::aid-spe345>3.0.co;2-d","title":"Improvements to Burrows-Wheeler compression algorithm","year":2000,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":41,"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":"Silesian University of Technology","keywords":"Lossless compression; Computer science; Compression ratio; Algorithm; Data compression; Compression (physics); Class (philosophy); Data compression ratio; Image compression; Artificial intelligence; Engineering","score_opus":0.01028238630179139,"score_gpt":0.2851556309118273,"score_spread":0.27487324461003587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968600331","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.027874341,0.00053414423,0.9682585,0.0011092175,0.00036739281,0.00030283435,0.000010974235,0.0003321292,0.0012104381],"genre_scores_gemma":[0.04457775,0.000380965,0.94722813,0.0062953904,0.00015770968,0.00011799327,0.000010044899,0.00001937316,0.0012126698],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982154,0.000067572815,0.00023482404,0.0006660324,0.00043483305,0.000381363],"domain_scores_gemma":[0.99864775,0.00017551471,0.00007770425,0.0007023753,0.00010126481,0.00029536735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018895292,0.00019396671,0.00016161083,0.0000587654,0.00038843526,0.00036103182,0.0007514493,0.00006663323,0.0002239274],"category_scores_gemma":[0.00015883124,0.00016402497,0.000029184785,0.00031958145,0.0000502838,0.0032749998,0.00054014777,0.00017083023,0.00024096321],"study_design_candidate":"design_other","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.000020251395,0.00008946554,0.000069668014,0.0000041964636,0.0000050169665,0.00002949442,0.0038322618,0.000011146795,0.0006028863,0.00014384503,0.0019606994,0.99323106],"study_design_scores_gemma":[0.00066566817,0.00036621754,0.0013010739,0.00010447935,0.000010616096,0.00013761537,0.0009044345,0.018726349,0.0044831997,0.0006206019,0.9720453,0.0006344693],"about_ca_topic_score_codex":0.00021824068,"about_ca_topic_score_gemma":8.5735724e-7,"teacher_disagreement_score":0.9925966,"about_ca_system_score_codex":0.000023486737,"about_ca_system_score_gemma":0.00003596673,"threshold_uncertainty_score":0.6688744},"labels":[],"label_agreement":null},{"id":"W1971444540","doi":"10.1002/spe.1070","title":"PPM compression without escapes","year":2011,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"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":"Compression (physics); Gas compressor; Data compression; Coding (social sciences); Binary number; Computer science; Compression ratio; Character (mathematics); Arithmetic; Statistics; Algorithm; Mathematics; Engineering; Mechanical engineering; Physics","score_opus":0.03167187098252218,"score_gpt":0.2839718654866127,"score_spread":0.2522999945040905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971444540","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.05481348,0.0011820667,0.93950576,0.00023491228,0.00050337706,0.00015071443,0.0000024865355,0.00041194103,0.003195288],"genre_scores_gemma":[0.49955082,0.00023380977,0.49931985,0.00073825434,0.00004545762,0.0000270949,0.0000018696687,0.0000080100135,0.000074842515],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987667,0.000074177115,0.00017290936,0.00046606798,0.00026769575,0.0002524224],"domain_scores_gemma":[0.99886256,0.00017457573,0.00012983449,0.00058177556,0.00009665135,0.00015460802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017138798,0.00014700256,0.00013516934,0.00004572657,0.00030417703,0.00016922492,0.0006497341,0.00006027653,0.000050130573],"category_scores_gemma":[0.0003124904,0.000115889816,0.00002405853,0.00016670974,0.00009716869,0.0038610448,0.0006702886,0.00015368838,0.000051886476],"study_design_candidate":"design_other","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.00019288156,0.0005922225,0.014132027,0.000047473302,0.000033153483,0.00021328004,0.1008982,0.0000050972394,0.0024780412,0.018423928,0.0032186646,0.85976505],"study_design_scores_gemma":[0.0040135556,0.0018993085,0.056629907,0.000939251,0.000121796584,0.002640169,0.02722101,0.048967574,0.04874219,0.03564085,0.7687597,0.0044246814],"about_ca_topic_score_codex":0.00019371259,"about_ca_topic_score_gemma":0.0000018027217,"teacher_disagreement_score":0.85534036,"about_ca_system_score_codex":0.000009027314,"about_ca_system_score_gemma":0.000033765602,"threshold_uncertainty_score":0.47258496},"labels":[],"label_agreement":null},{"id":"W1978380500","doi":"10.1002/spe.575","title":"Understanding Web server configuration issues","year":2004,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Bottleneck; Web server; Computer science; Visualization; Application server; Operating system; Web API; Web application; Set (abstract data type); Database; World Wide Web; Distributed computing; Data mining; The Internet; Embedded system","score_opus":0.04786340885300471,"score_gpt":0.2900633936392327,"score_spread":0.242199984786228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978380500","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.013657891,0.000891314,0.97370315,0.010009767,0.00033583087,0.00011498046,3.8186343e-7,0.00031871104,0.00096798496],"genre_scores_gemma":[0.9720062,0.00030933367,0.025699576,0.0017548664,0.00008018306,0.000021965692,9.095118e-7,0.0000050864037,0.00012187057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99908394,0.00004564806,0.00014016982,0.00030809382,0.00022231872,0.00019983028],"domain_scores_gemma":[0.99930745,0.00019715737,0.00008360844,0.00024432255,0.00007696671,0.00009049635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018079914,0.000106784064,0.00009609164,0.000035218123,0.0002650417,0.00032128947,0.00023883833,0.000051181218,0.000017524319],"category_scores_gemma":[0.00027077744,0.000100067846,0.000021428115,0.00020406336,0.00007173111,0.0024585137,0.00006418859,0.00011185419,0.00004338647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051205145,0.00010274377,0.00040274236,0.0000148722675,0.000028969871,0.00009407412,0.023044774,0.00095430284,0.00036747908,0.89610404,0.0007313394,0.078103475],"study_design_scores_gemma":[0.013273654,0.0020015396,0.0021398994,0.0007764245,0.00020214198,0.0020452815,0.08182985,0.06756182,0.0070089772,0.20185655,0.6166016,0.004702249],"about_ca_topic_score_codex":0.000033794007,"about_ca_topic_score_gemma":0.000012150506,"teacher_disagreement_score":0.95834833,"about_ca_system_score_codex":0.000059351452,"about_ca_system_score_gemma":0.000090787005,"threshold_uncertainty_score":0.40806484},"labels":[],"label_agreement":null},{"id":"W1986995668","doi":"10.1002/spe.1068","title":"A business process‐driven approach for generating software modules","year":2011,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","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":"Queen's University","funders":"","keywords":"Business requirements; Computer science; Business process modeling; Business software; Modular design; Artifact-centric business process model; Software engineering; Business rule; Business domain; Business process; Modularity (biology); Software development; Business Process Model and Notation; Software; Process management; Programming language; Engineering; Operations management; Work in process","score_opus":0.07290072065577854,"score_gpt":0.31942029421027757,"score_spread":0.24651957355449902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986995668","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.00787717,0.00071492133,0.98954904,0.00005852108,0.00028477967,0.0003778979,0.000004204078,0.0010743861,0.00005906373],"genre_scores_gemma":[0.039898355,0.00008134776,0.9589908,0.00031333978,0.00008811539,0.00055629015,0.0000049754635,0.000031636067,0.0000351496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805397,0.000093610885,0.0002951084,0.0008047172,0.00025969718,0.00049288303],"domain_scores_gemma":[0.9973438,0.0012052222,0.00021569044,0.0006044693,0.00049839343,0.00013246333],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043419274,0.0002895527,0.00028337148,0.00009537893,0.00038252908,0.0001659812,0.00082695193,0.00011942087,0.0000027989656],"category_scores_gemma":[0.01265295,0.00026885085,0.000047585287,0.0005068158,0.00014705614,0.0033608929,0.0003157929,0.00019440838,0.0000025443528],"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.000358228,0.0008263398,0.0044001737,0.0014075782,0.00017880571,0.000122009464,0.24129084,0.0986009,0.0019881057,0.01370377,0.00031501093,0.6368082],"study_design_scores_gemma":[0.009964839,0.0038237285,0.01813771,0.0012332692,0.00059812504,0.005274064,0.09856718,0.5716485,0.07157158,0.1778293,0.024157906,0.01719382],"about_ca_topic_score_codex":0.000022474564,"about_ca_topic_score_gemma":7.268595e-7,"teacher_disagreement_score":0.6196144,"about_ca_system_score_codex":0.00003052974,"about_ca_system_score_gemma":0.000081630074,"threshold_uncertainty_score":0.9999764},"labels":[],"label_agreement":null},{"id":"W1996010464","doi":"10.1002/spe.440","title":"Taming access control security: extending capabilities using the views relationship","year":2002,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Pontifícia Universidade Católica do Rio de Janeiro; University of Waterloo","keywords":"Abstraction; Computer science; Access control; Object (grammar); Domain (mathematical analysis); Computer security model; Control (management); Role-based access control; Security policy; Order (exchange); Computer security; Interface (matter); Distributed computing; Operating system; Artificial intelligence; Business","score_opus":0.1084530335172283,"score_gpt":0.3575995005652543,"score_spread":0.249146467048026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996010464","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.120439716,0.003721017,0.8709184,0.003250343,0.00052495394,0.00025631854,0.0000012877764,0.00023229785,0.000655664],"genre_scores_gemma":[0.9732473,0.00012613727,0.024713693,0.0017276168,0.00011315128,0.000036680245,2.986404e-7,0.0000073068663,0.000027802871],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841684,0.00029661652,0.00029460032,0.00041508104,0.00029632653,0.0002805637],"domain_scores_gemma":[0.9958352,0.0031601638,0.00024481723,0.00054942694,0.00013370888,0.00007671379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073007017,0.00013961937,0.000135231,0.00006196715,0.0012215512,0.00095914234,0.0008051833,0.000059756378,0.000028789986],"category_scores_gemma":[0.002850933,0.000113896334,0.000040864146,0.0004439798,0.00018181703,0.004170184,0.00026112844,0.0002881309,0.000011279353],"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.00002564505,0.00022814663,0.03297707,0.00012964732,0.00004976149,0.000035305275,0.7284672,0.00076116313,0.00017209601,0.15366204,0.00074657804,0.08274529],"study_design_scores_gemma":[0.0009658591,0.00010198963,0.0035831747,0.00023539853,0.00007498456,0.0008358561,0.056787953,0.80494124,0.0005491527,0.018433327,0.11238225,0.001108821],"about_ca_topic_score_codex":0.00009829896,"about_ca_topic_score_gemma":0.0000025144184,"teacher_disagreement_score":0.8528076,"about_ca_system_score_codex":0.000047362082,"about_ca_system_score_gemma":0.000025573352,"threshold_uncertainty_score":0.9395308},"labels":[],"label_agreement":null},{"id":"W2008830761","doi":"10.1002/spe.774","title":"<i>Ablego</i>: a function outlining and partial inlining framework","year":2006,"lang":"en","type":"article","venue":"Software Practice and Experience","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; IBM (Canada)","funders":"","keywords":"Computer science; Compiler; Partial evaluation; Host (biology); Programming language; Function (biology); Code (set theory); Optimizing compiler; Program transformation; Heuristics; Transformation (genetics); Set (abstract data type); Syntax; Operating system; Artificial intelligence","score_opus":0.013066999549225349,"score_gpt":0.28133394778908777,"score_spread":0.2682669482398624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008830761","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.013195967,0.00080300524,0.9836921,0.00066714006,0.00025048686,0.00007030295,3.3279005e-7,0.00060697197,0.00071370194],"genre_scores_gemma":[0.52263886,0.00008033382,0.47624964,0.0008450188,0.00011761351,0.000018224604,0.0000010102741,0.000005885495,0.00004340844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99892825,0.00007229527,0.00020560467,0.00040127544,0.00017626824,0.00021633085],"domain_scores_gemma":[0.998914,0.0005346158,0.00014670678,0.00024036915,0.00009759149,0.0000667316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031106736,0.00012294453,0.00011647939,0.00005795922,0.00039392975,0.0004837382,0.00018826064,0.00007518332,0.0000033428812],"category_scores_gemma":[0.0007712397,0.00012150023,0.000017209959,0.00019852392,0.0000793112,0.0015989036,0.0002015188,0.00019192856,0.0000046762784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019425504,0.0003696008,0.023261582,0.000073175506,0.000046619432,0.00009723774,0.064288065,0.0034899223,0.00020950989,0.59057283,0.0026777622,0.31471944],"study_design_scores_gemma":[0.001605018,0.001430775,0.004607493,0.00058123766,0.000110961395,0.00066392304,0.00868809,0.34505346,0.0027115121,0.074994415,0.5568926,0.0026605378],"about_ca_topic_score_codex":0.00010628932,"about_ca_topic_score_gemma":0.0000010700048,"teacher_disagreement_score":0.55421484,"about_ca_system_score_codex":0.000009145432,"about_ca_system_score_gemma":0.000031069645,"threshold_uncertainty_score":0.49546352},"labels":[],"label_agreement":null},{"id":"W2014113335","doi":"10.1002/spe.582","title":"GLU<sup>♮</sup> embedded in C++: a marriage between multidimensional and object‐oriented programming","year":2004,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Programming language; Computer science; First-generation programming language; Embedding; Programming domain; Syntax; Semantics (computer science); Programming paradigm; Object-oriented programming; Functional logic programming; Programming language specification; Functional programming; Very high-level programming language; Theoretical computer science; Inductive programming; Artificial intelligence","score_opus":0.017772649189498273,"score_gpt":0.28368663290685936,"score_spread":0.2659139837173611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014113335","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58021104,0.0014007223,0.4161817,0.00063469715,0.00023702755,0.0007259955,0.0000015785057,0.00039290503,0.0002143018],"genre_scores_gemma":[0.8760167,0.000051264098,0.123450994,0.00024097995,0.00007855701,0.00010751287,0.000004933931,0.000012591992,0.000036482284],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99778885,0.00014106819,0.0003730177,0.0007577209,0.0004089171,0.0005304045],"domain_scores_gemma":[0.99860793,0.00045687813,0.00017875407,0.00040484706,0.00012434926,0.00022724127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060017454,0.00025081888,0.0002897473,0.0001269987,0.00029362022,0.00028548075,0.00031080307,0.00013408724,0.000003932502],"category_scores_gemma":[0.0011203844,0.00022124792,0.00004016457,0.0005397825,0.00017851974,0.001986557,0.00038570038,0.0002882835,0.000018313112],"study_design_candidate":"qualitative","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.00018784247,0.0008436285,0.11357004,0.0002385146,0.000111835674,0.001125397,0.36268565,0.00023496663,0.0004013783,0.107590325,0.00006283523,0.41294757],"study_design_scores_gemma":[0.030943286,0.006405672,0.07930428,0.0009246578,0.0003330374,0.0060432926,0.22724271,0.012918307,0.009869864,0.052880522,0.56372005,0.009414312],"about_ca_topic_score_codex":0.0007327633,"about_ca_topic_score_gemma":0.000029329945,"teacher_disagreement_score":0.5636572,"about_ca_system_score_codex":0.0000630726,"about_ca_system_score_gemma":0.00012270978,"threshold_uncertainty_score":0.9022228},"labels":[],"label_agreement":null},{"id":"W2018646099","doi":"10.1002/spe.396","title":"Object‐oriented design of the subsumption architecture","year":2001,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Architecture; Layer (electronics); Object (grammar); Set (abstract data type); Object-oriented programming; Robot; Software architecture; Software engineering; Computer architecture; Artificial intelligence; Software; Programming language","score_opus":0.01759626783191229,"score_gpt":0.25259390703948503,"score_spread":0.23499763920757274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018646099","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.17454821,0.0009055209,0.8237187,0.00008846295,0.00023904371,0.00014241038,0.0000010230335,0.000092883245,0.0002637411],"genre_scores_gemma":[0.9811671,0.0009280099,0.017627189,0.00012504788,0.000032798907,0.000023070677,6.737652e-7,0.000012965418,0.00008319018],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993779,0.00004762329,0.0001371946,0.0001309827,0.00015699991,0.00014931256],"domain_scores_gemma":[0.9994672,0.00017186953,0.000043495475,0.00022647023,0.000051325373,0.000039652685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011573119,0.00009608934,0.000085877284,0.000024740773,0.000085963984,0.000020526439,0.00013085661,0.000047179386,0.00004007695],"category_scores_gemma":[0.00039908386,0.000068313595,0.0000243288,0.00019583879,0.0000791367,0.00024464584,0.000032401895,0.00014396945,0.0000071210957],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004148287,0.00024601162,0.021667605,0.0002549298,0.00014348293,0.00008259952,0.11542888,0.32899383,0.052080326,0.0016885219,0.001134642,0.47786435],"study_design_scores_gemma":[0.0017114996,0.0008065357,0.033670474,0.0008307702,0.00030341736,0.0030138209,0.029190721,0.051994078,0.3631404,0.004507043,0.5078799,0.0029513296],"about_ca_topic_score_codex":0.000028616783,"about_ca_topic_score_gemma":0.0000041716476,"teacher_disagreement_score":0.80661887,"about_ca_system_score_codex":0.000012485777,"about_ca_system_score_gemma":0.000011196463,"threshold_uncertainty_score":0.27857473},"labels":[],"label_agreement":null},{"id":"W2051221173","doi":"10.1002/(sici)1097-024x(200006)30:7<825::aid-spe322>3.0.co;2-1","title":"Software product lines: a case study","year":2000,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Software product line; Software engineering; Exploit; Time to market; Abstraction; Product (mathematics); Domain (mathematical analysis); Java; Documentation; Domain analysis; Domain engineering; Software; New product development; Process (computing); Software development; Programming language; Software construction; Computer security","score_opus":0.03995879755292413,"score_gpt":0.3447755813809009,"score_spread":0.3048167838279768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051221173","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.28795475,0.0010814097,0.7087692,0.00022258631,0.00028392766,0.00035988915,0.0000012830077,0.0012944639,0.000032490454],"genre_scores_gemma":[0.25334266,0.00016321398,0.74559,0.00035587748,0.000098229735,0.00016851567,6.0507034e-7,0.00002281467,0.00025811727],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99753827,0.00028808013,0.0003449015,0.000981503,0.00036495551,0.000482296],"domain_scores_gemma":[0.9961885,0.002194394,0.00011360565,0.0011437864,0.00017997329,0.00017971262],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000688741,0.0003124498,0.00029253424,0.00009379554,0.00041026957,0.00028067344,0.000692817,0.00006496627,0.000038623817],"category_scores_gemma":[0.008606893,0.00028643466,0.000044077788,0.0006561801,0.00013034567,0.0035519684,0.00031912266,0.00034520062,0.000049639577],"study_design_candidate":"design_other","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.00005331626,0.00043497537,0.002716991,0.000037494727,0.000040098235,0.0093840035,0.07271874,0.0025964824,0.00004801445,0.00009432639,0.00014174054,0.9117338],"study_design_scores_gemma":[0.00895642,0.008175595,0.008786083,0.00053006335,0.00049584924,0.30231398,0.2941254,0.0044187913,0.0067083067,0.015728125,0.3378424,0.011918946],"about_ca_topic_score_codex":0.0002207897,"about_ca_topic_score_gemma":0.00000990331,"teacher_disagreement_score":0.89981484,"about_ca_system_score_codex":0.000038347556,"about_ca_system_score_gemma":0.000074238116,"threshold_uncertainty_score":0.99995875},"labels":[],"label_agreement":null},{"id":"W2051230890","doi":"10.1002/spe.398","title":"G<scp>EN</scp>E<scp>X</scp>: a tool for testing in ILP","year":2001,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Logic, Reasoning, and Knowledge","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":"University of Ottawa","funders":"","keywords":"Inductive logic programming; Programming language; Variety (cybernetics); Logic program; Computer science; Generator (circuit theory); Field (mathematics); Logic programming; Software engineering; Artificial intelligence; Mathematics","score_opus":0.027810246710578333,"score_gpt":0.29305896350348737,"score_spread":0.265248716792909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051230890","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5572308,0.002661865,0.4256069,0.00031028633,0.0007081982,0.0006489851,0.0000035839005,0.00054919824,0.012280209],"genre_scores_gemma":[0.6800311,0.0005748015,0.3128268,0.0020223374,0.00044407358,0.0005514077,0.0000049061905,0.00004555903,0.003498963],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974359,0.00015086847,0.0003939593,0.0008654524,0.00033602436,0.00081775256],"domain_scores_gemma":[0.9864972,0.012158517,0.00026564754,0.00057005644,0.0003059328,0.00020260617],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009097359,0.00030421384,0.00030673016,0.00014134374,0.00041071846,0.00051836314,0.00086286134,0.00016612705,0.0000029858215],"category_scores_gemma":[0.05188209,0.00028264138,0.000070849776,0.0009415489,0.00012550286,0.0031247565,0.00043172904,0.00032978415,0.00005997013],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052631975,0.001566626,0.20439665,0.0003681467,0.00008620549,0.0011718118,0.43488058,0.00017467017,0.0024576776,0.033499043,0.017190052,0.3041559],"study_design_scores_gemma":[0.0020529688,0.00089395535,0.016257398,0.00027575396,0.00004400988,0.001444027,0.030917695,0.012797203,0.0021005534,0.006617273,0.92618257,0.0004165716],"about_ca_topic_score_codex":0.00011064218,"about_ca_topic_score_gemma":0.00002534,"teacher_disagreement_score":0.9089925,"about_ca_system_score_codex":0.00007012867,"about_ca_system_score_gemma":0.0001897552,"threshold_uncertainty_score":0.99996257},"labels":[],"label_agreement":null},{"id":"W2054300598","doi":"10.1002/spe.982","title":"Post BWT stages of the Burrows–Wheeler compression algorithm","year":2010,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":12,"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":"Lossless compression; Algorithm; Computer science; Data compression; Entropy encoding; Context (archaeology); Compression (physics); Permutation (music); Entropy (arrow of time); Image compression; Speech recognition; Artificial intelligence; Image (mathematics); History; Image processing","score_opus":0.008361186106803337,"score_gpt":0.2719656815834479,"score_spread":0.26360449547664455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054300598","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.21613123,0.00091091904,0.7769271,0.002337173,0.0023196284,0.00038428776,0.00004779973,0.00024515728,0.0006966719],"genre_scores_gemma":[0.5001808,0.0001477727,0.49812582,0.0011447434,0.00011962001,0.000027920452,0.0000042817924,0.000013138055,0.00023590687],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986623,0.00008520546,0.00021884106,0.00038716168,0.00042023964,0.00022628043],"domain_scores_gemma":[0.9980761,0.00043942258,0.00023133989,0.0009076656,0.00024132385,0.00010414057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024272763,0.00014489204,0.00014382415,0.000037150447,0.00035655563,0.00016434565,0.0010524252,0.00008349655,0.00003807311],"category_scores_gemma":[0.0007586297,0.00009212826,0.00004311958,0.00022909864,0.00021712274,0.002245588,0.0010823403,0.00036650876,0.000008535264],"study_design_candidate":"design_other","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.000030187117,0.00028656036,0.00419657,0.000032461663,0.000016596556,0.000024443405,0.013723419,0.000006675757,0.06107365,0.0047750976,0.0011138639,0.9147205],"study_design_scores_gemma":[0.0019240251,0.00062929303,0.051391963,0.0004414375,0.00006868825,0.00096395926,0.008142491,0.027400615,0.17219573,0.0036550318,0.7314673,0.001719481],"about_ca_topic_score_codex":0.00022927213,"about_ca_topic_score_gemma":0.0000062099034,"teacher_disagreement_score":0.913001,"about_ca_system_score_codex":0.0000058874534,"about_ca_system_score_gemma":0.00006845867,"threshold_uncertainty_score":0.37568814},"labels":[],"label_agreement":null},{"id":"W2063760213","doi":"10.1002/spe.578","title":"Agents in object‐oriented software engineering","year":2004,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Software engineering; Software development; Object-oriented programming; Component-based software engineering; Adaptation (eye); Reuse; Separation of concerns; Software system; Social software engineering; Agent-oriented software engineering; Aspect-oriented programming; Software design pattern; Software; Software construction; Programming language; Engineering","score_opus":0.011011028446275288,"score_gpt":0.2641600578188855,"score_spread":0.25314902937261025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063760213","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5085925,0.00094805926,0.48766235,0.0011930531,0.00062315713,0.00025149624,0.0000023439163,0.0005498711,0.00017719666],"genre_scores_gemma":[0.747569,0.00014669947,0.24853323,0.003571104,0.00006780684,0.000073243034,0.0000046131227,0.000019819208,0.000014484044],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.99815005,0.00004465089,0.0002888209,0.0006430739,0.0003778073,0.00049561996],"domain_scores_gemma":[0.9987122,0.00034381135,0.00011453565,0.00054537796,0.00010102676,0.00018308572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020045535,0.00024671655,0.00020022242,0.00019468696,0.00016716965,0.000187571,0.00067472295,0.000092876195,0.000008604892],"category_scores_gemma":[0.0005380839,0.0002377384,0.000041319698,0.0009541218,0.000040191768,0.0023548545,0.00042695276,0.00030797615,0.000033583598],"study_design_candidate":"qualitative","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.00036967595,0.001865647,0.08787157,0.0006916128,0.00018640648,0.0029015609,0.67163754,0.019576265,0.003055466,0.07087294,0.00014107596,0.14083028],"study_design_scores_gemma":[0.018103927,0.0025651485,0.26956442,0.0032946453,0.00018150816,0.0043907976,0.05935776,0.013475893,0.04698242,0.015620365,0.55728346,0.00917968],"about_ca_topic_score_codex":0.0007099405,"about_ca_topic_score_gemma":0.000098637654,"teacher_disagreement_score":0.6122798,"about_ca_system_score_codex":0.00006646072,"about_ca_system_score_gemma":0.00009108049,"threshold_uncertainty_score":0.969469},"labels":[],"label_agreement":null},{"id":"W2080670657","doi":"10.1002/spe.686","title":"Fast dynamic casting","year":2005,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Testing and Debugging Techniques","field":"Computer Science","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":"Lockheed Martin (Canada)","funders":"","keywords":"Pointer (user interface); C dynamic memory allocation; Computer science; Modulo; Integer (computer science); Class (philosophy); Arithmetic; Predictability; Base (topology); Theoretical computer science; Algorithm; Programming language; Discrete mathematics; Mathematics; Artificial intelligence; Memory management","score_opus":0.014209689347191417,"score_gpt":0.3035970456289335,"score_spread":0.2893873562817421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080670657","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.023003666,0.00090257335,0.96448547,0.002380903,0.0001585829,0.00009926632,7.912826e-7,0.008092841,0.00087591546],"genre_scores_gemma":[0.42559633,0.000047304227,0.5729795,0.0012319234,0.000030235105,0.000023325296,4.776761e-7,0.0000076066644,0.00008327434],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987239,0.000054413027,0.00019613086,0.00046036002,0.00024396842,0.00032118565],"domain_scores_gemma":[0.99825287,0.0008951948,0.00012608174,0.00048798288,0.00011646864,0.00012139888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031490394,0.00015455525,0.00012591743,0.00007335934,0.00030580134,0.00029114893,0.00050692406,0.00005918745,0.000007156672],"category_scores_gemma":[0.0031519441,0.00014785375,0.000027330523,0.0002923659,0.00008780063,0.0022586915,0.00033679538,0.00019306428,0.000044759636],"study_design_candidate":"design_other","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.0000085995725,0.00007497487,0.0022991307,0.00001375225,0.000007234756,0.00005889454,0.016151395,0.000036514553,0.00013999447,0.0013038552,0.0016754,0.97823024],"study_design_scores_gemma":[0.0021490778,0.0014218672,0.011166472,0.00090816064,0.00010588053,0.013144076,0.0058412207,0.4373109,0.0060328543,0.038634446,0.47810918,0.005175861],"about_ca_topic_score_codex":0.000079259924,"about_ca_topic_score_gemma":0.000005359047,"teacher_disagreement_score":0.9730544,"about_ca_system_score_codex":0.000041973057,"about_ca_system_score_gemma":0.000048691934,"threshold_uncertainty_score":0.60293007},"labels":[],"label_agreement":null},{"id":"W2087413773","doi":"10.1002/spe.724","title":"Declarative generation of synthetic XML data","year":2006,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Advanced Database Systems and Queries","field":"Computer Science","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 Toronto; University of Calgary","funders":"","keywords":"Computer science; XML; Benchmarking; XML Schema (W3C); Programming language; Schema (genetic algorithms); Synthetic data; Generator (circuit theory); Software engineering; XML validation; Information retrieval; Artificial intelligence; World Wide Web; Document type definition","score_opus":0.05494910959855257,"score_gpt":0.31884425796099464,"score_spread":0.26389514836244204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087413773","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.019212404,0.0011601588,0.9786659,0.00032029414,0.0001557229,0.0000934223,0.000023004628,0.000059695474,0.00030939945],"genre_scores_gemma":[0.48218393,0.00010383473,0.5173645,0.0001422177,0.00008088006,0.000018825369,0.000032837797,0.000004928969,0.0000680161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989845,0.00007050714,0.00021309262,0.00039763426,0.0001989698,0.00013526139],"domain_scores_gemma":[0.99855113,0.00026224824,0.000180247,0.00085703033,0.00011337039,0.000035954406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021935054,0.00009324721,0.00012008078,0.000031904547,0.00014291749,0.00005549479,0.00035924595,0.00003028663,0.0000050070566],"category_scores_gemma":[0.00067620917,0.00008070316,0.000011057859,0.0001720179,0.0001084024,0.004270916,0.00039146942,0.000060282964,0.000006086743],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006629788,0.0004229653,0.0030371598,0.0001243269,0.0000427469,0.00011468829,0.022568826,0.00028865685,0.029145516,0.78956985,0.004977237,0.14964171],"study_design_scores_gemma":[0.0008422127,0.0003745796,0.0016281524,0.00019164484,0.00005181525,0.0006817123,0.009731404,0.03753174,0.07831656,0.003563446,0.8659395,0.0011472176],"about_ca_topic_score_codex":0.00032295272,"about_ca_topic_score_gemma":0.000036979625,"teacher_disagreement_score":0.8609623,"about_ca_system_score_codex":0.000008933038,"about_ca_system_score_gemma":0.000048650127,"threshold_uncertainty_score":0.32909796},"labels":[],"label_agreement":null},{"id":"W2093127601","doi":"10.1002/spe.1013","title":"Spotting the difference","year":2010,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Engineering Research","field":"Computer Science","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 Ottawa","funders":"","keywords":"Computer science; Readability; Usability; Interface (matter); Space (punctuation); Human–computer interaction; Software; User interface; Granularity; World Wide Web; Multimedia; Information retrieval; Programming language; Operating system","score_opus":0.014185157614998764,"score_gpt":0.2935626608430459,"score_spread":0.2793775032280471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093127601","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5759374,0.00021254092,0.41961455,0.0027983927,0.0006700869,0.00013047236,4.6401e-7,0.0004414098,0.00019467663],"genre_scores_gemma":[0.87866217,0.00004273636,0.12040912,0.000606122,0.00008959721,0.000053559506,2.2039936e-7,0.000008497647,0.00012800039],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99871933,0.000051069153,0.00013088879,0.00037522425,0.00038021227,0.00034324892],"domain_scores_gemma":[0.9946048,0.0043226243,0.000059653095,0.00076431973,0.00012402034,0.00012456572],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.00053197274,0.0001223229,0.00008615362,0.000046200606,0.00036559138,0.00045160216,0.0010885607,0.00005621399,0.000015244448],"category_scores_gemma":[0.013975053,0.00008492986,0.000023059869,0.00038096355,0.00017197708,0.001107801,0.00052190013,0.00059750595,0.000040542804],"study_design_candidate":"design_other","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.000023537936,0.00013120347,0.10538415,0.000039854658,0.000026983278,0.00014894373,0.04935722,0.000009761107,0.021132937,0.03364197,0.0004869755,0.78961647],"study_design_scores_gemma":[0.0010069773,0.0003682407,0.6475608,0.00011195369,0.00003071727,0.0030849555,0.006599348,0.009290422,0.033158965,0.006715514,0.2901325,0.0019396839],"about_ca_topic_score_codex":0.00009314783,"about_ca_topic_score_gemma":0.000007250301,"teacher_disagreement_score":0.78767675,"about_ca_system_score_codex":0.000009394718,"about_ca_system_score_gemma":0.0000610918,"threshold_uncertainty_score":0.99433064},"labels":[],"label_agreement":null},{"id":"W2098046929","doi":"10.1002/spe.1053","title":"Prioritizing the creation of unit tests in legacy software systems","year":2011,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Engineering Research","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":"Blackberry (Canada); Queen's University","funders":"","keywords":"Unit testing; Test-driven development; Computer science; Software engineering; Legacy system; Adaptation (eye); Software development; Development testing; Heuristics; Software; Software development process; Systems engineering; Engineering; Operating system","score_opus":0.045011511546345535,"score_gpt":0.3163417384664236,"score_spread":0.2713302269200781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098046929","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6067298,0.0028656772,0.38847136,0.00022298787,0.0004699341,0.0005020903,0.0000017670501,0.0003775651,0.00035883446],"genre_scores_gemma":[0.9376411,0.00012300709,0.06200838,0.000060235285,0.000027618458,0.00008631566,6.358612e-7,0.000011957746,0.000040737767],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9984648,0.00014854738,0.0002949671,0.00035510512,0.00041514882,0.00032138632],"domain_scores_gemma":[0.9958289,0.003075975,0.00014041262,0.00063262234,0.000237853,0.00008418263],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.00075230707,0.00013982753,0.00016510143,0.00014518226,0.00013502144,0.00020511358,0.0007680616,0.00006958683,0.0000041825147],"category_scores_gemma":[0.009994969,0.00011202776,0.000024386785,0.0007638425,0.00014628643,0.002845612,0.00031305908,0.00027191482,0.000009766785],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116433854,0.00043761867,0.63434786,0.00039854713,0.000052291067,0.000315939,0.22963437,0.00020841171,0.001051629,0.020361295,0.0001291598,0.11294645],"study_design_scores_gemma":[0.0015487167,0.0008040013,0.92695284,0.001042893,0.000040174884,0.0010873236,0.039020777,0.0055189966,0.004451477,0.001609457,0.016582442,0.001340895],"about_ca_topic_score_codex":0.0011970461,"about_ca_topic_score_gemma":0.000013199989,"teacher_disagreement_score":0.3309113,"about_ca_system_score_codex":0.000036798585,"about_ca_system_score_gemma":0.00011354993,"threshold_uncertainty_score":0.99834424},"labels":[],"label_agreement":null},{"id":"W2098214931","doi":"10.1002/spe.565","title":"The design and implementation of a modular and extensible Java Virtual Machine","year":2004,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Operating system; Java; Modular design; Scalability; Virtual machine; Real time Java","score_opus":0.013676508410170783,"score_gpt":0.30438655216779303,"score_spread":0.29071004375762227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098214931","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.041024014,0.0016600654,0.95630145,0.00075398176,0.00003114839,0.00013271712,4.138712e-7,0.000083249724,0.000012949744],"genre_scores_gemma":[0.55249476,0.0012979396,0.44596848,0.00021176584,0.000005103079,0.000012055801,3.0331427e-7,0.0000027837757,0.0000068038516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932325,0.00007203121,0.0001440094,0.00021335547,0.00012835156,0.00011898623],"domain_scores_gemma":[0.99922186,0.0003531963,0.00011313676,0.00017760407,0.000087749235,0.000046463585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038283237,0.00007670658,0.00007748171,0.000030766187,0.00029052453,0.00014999982,0.00014847323,0.000023975756,6.090468e-7],"category_scores_gemma":[0.00022765154,0.000057865007,0.000008259951,0.00012634444,0.00011206102,0.000768776,0.00016479308,0.000059545666,3.2386492e-7],"study_design_candidate":"design_other","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.00013161574,0.00013191058,0.0022225552,0.000043642733,0.00005298624,0.000032719254,0.07894207,0.009813962,0.002683263,0.10113701,0.0002255436,0.8045827],"study_design_scores_gemma":[0.008741699,0.007234491,0.01806539,0.0004614262,0.00016715105,0.0027471725,0.053488318,0.5876663,0.18679123,0.10386534,0.027856061,0.0029154723],"about_ca_topic_score_codex":0.00016940458,"about_ca_topic_score_gemma":0.0000037607297,"teacher_disagreement_score":0.8016673,"about_ca_system_score_codex":0.00000798093,"about_ca_system_score_gemma":0.00004025056,"threshold_uncertainty_score":0.23596665},"labels":[],"label_agreement":null},{"id":"W2100568614","doi":"10.1002/spe.1001","title":"The use of search‐based optimization techniques to schedule and staff software projects: an approach and an empirical study","year":2011,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Engineering Research","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Staffing; Computer science; Schedule; Software project management; Software; Queueing theory; Task (project management); Scheduling (production processes); Fragmentation (computing); Operations research; Project management; Project planning; Operations management; Software development; Systems engineering; Software construction; Engineering","score_opus":0.12405668412549276,"score_gpt":0.3731303624344601,"score_spread":0.24907367830896737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100568614","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.43563923,0.00006722577,0.5634378,0.00007431602,0.000019480069,0.0005251389,0.0000017196563,0.00023302689,0.000002030681],"genre_scores_gemma":[0.41755,0.000020546953,0.582166,0.00008821149,0.000010420116,0.00014548666,0.0000010674527,0.000013909135,0.0000043507016],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978253,0.00042775625,0.000234528,0.0006701147,0.00049447664,0.00034778504],"domain_scores_gemma":[0.9968345,0.0016576576,0.00007710168,0.0007770365,0.0003638118,0.00028989068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001137843,0.00018646341,0.00017696062,0.00015686444,0.0004306575,0.00064157037,0.0005397257,0.000075820055,0.0000016854486],"category_scores_gemma":[0.0057898792,0.00014377006,0.00001335099,0.00055533525,0.0002856641,0.0034619553,0.0004967504,0.00023865109,4.07504e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014755252,0.004108374,0.379833,0.0001929034,0.00007805305,0.000082484024,0.42263025,0.003388974,0.00039962187,0.00027928327,0.00010509424,0.18742642],"study_design_scores_gemma":[0.003664139,0.03687387,0.23480521,0.00034995782,0.00014795324,0.0005591194,0.18542185,0.50570416,0.021679355,0.00020805474,0.0068066167,0.0037797377],"about_ca_topic_score_codex":0.0002460229,"about_ca_topic_score_gemma":0.000006656994,"teacher_disagreement_score":0.50231516,"about_ca_system_score_codex":0.000027452204,"about_ca_system_score_gemma":0.00016177713,"threshold_uncertainty_score":0.69314444},"labels":[],"label_agreement":null},{"id":"W2104541214","doi":"10.1002/spe.500","title":"DrawCAD: using deductive object‐relational databases in CAD","year":2003,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Advanced Database Systems and Queries","field":"Computer Science","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":"Carleton University","funders":"","keywords":"Computer science; Relational database; Database; Reuse; Database design; Object (grammar); CAD; Data model (GIS); View; Relational database management system; Object-relational mapping; Database model; Engineering drawing; Artificial intelligence; Engineering","score_opus":0.04430888468270976,"score_gpt":0.33100777486243793,"score_spread":0.28669889017972816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104541214","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.087453306,0.0013375209,0.91023695,0.000095848525,0.00026598756,0.000128956,0.000014589203,0.00006602815,0.0004008155],"genre_scores_gemma":[0.28841072,0.000089071706,0.7110668,0.00031244743,0.000031668333,0.000031512664,0.0000062339327,0.000007680013,0.000043865526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986609,0.00014835228,0.00022403782,0.00046332335,0.00023974654,0.0002636304],"domain_scores_gemma":[0.99879354,0.00052402756,0.00013053042,0.0003722712,0.000094324656,0.00008528906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030290222,0.00013985213,0.00014130234,0.000083437575,0.00024040013,0.000057164372,0.00013691492,0.000027893591,0.000014555008],"category_scores_gemma":[0.0023625188,0.0001337693,0.000017762404,0.0003989386,0.00011956813,0.0059241583,0.00014570638,0.00016184081,0.0000088069355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036159123,0.00015723282,0.021382919,0.00003212208,0.000015712574,0.00017923322,0.026731612,0.00047096523,0.0010911253,0.94314766,0.000050008704,0.0067052487],"study_design_scores_gemma":[0.0018386785,0.00017986324,0.009591526,0.00043623624,0.000033618704,0.003481943,0.05342005,0.0050753714,0.013375456,0.005245658,0.9052886,0.0020330278],"about_ca_topic_score_codex":0.0008637133,"about_ca_topic_score_gemma":0.00007807819,"teacher_disagreement_score":0.93790203,"about_ca_system_score_codex":0.000049206308,"about_ca_system_score_gemma":0.00016035888,"threshold_uncertainty_score":0.5454954},"labels":[],"label_agreement":null},{"id":"W2104838677","doi":"10.1002/spe.1017","title":"Grammar‐based test generation with YouGen","year":2010,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":23,"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 Victoria","funders":"","keywords":"Computer science; Parsing; Grammar; Natural language processing; Compiler; Rule-based machine translation; Programming language; Artificial intelligence; Generator (circuit theory); Context (archaeology); Linguistics; Power (physics)","score_opus":0.01713707136432013,"score_gpt":0.2785418352168769,"score_spread":0.2614047638525568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104838677","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.05146594,0.00007893929,0.9411528,0.0013705645,0.00023341166,0.0001495097,0.0000013433036,0.0052315528,0.00031590855],"genre_scores_gemma":[0.48035485,0.0000055285423,0.5184958,0.0009974217,0.00006236153,0.00005180592,0.0000021046362,0.0000076112656,0.000022486256],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988508,0.00003585339,0.00013912185,0.00045458635,0.0002737198,0.00024592038],"domain_scores_gemma":[0.99788755,0.001047677,0.00012111077,0.00061286177,0.00020675392,0.0001240582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030227183,0.0001537939,0.00010706984,0.00006415628,0.00030846204,0.00038623827,0.00041534854,0.00007454477,0.000007271437],"category_scores_gemma":[0.004186609,0.00012480577,0.000017808377,0.00031100292,0.00013047949,0.001423741,0.000108879,0.0002622458,0.00001147222],"study_design_candidate":"design_other","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.00009877362,0.0010448297,0.18227617,0.00007810337,0.00003573206,0.00055587786,0.022429746,0.000059142632,0.024981663,0.011534682,0.0146725895,0.7422327],"study_design_scores_gemma":[0.0054072873,0.0074340575,0.032042176,0.0005166905,0.00024744438,0.010802861,0.0014905316,0.31216452,0.19216786,0.03222683,0.39737046,0.008129275],"about_ca_topic_score_codex":0.00016517712,"about_ca_topic_score_gemma":0.000020095376,"teacher_disagreement_score":0.73410344,"about_ca_system_score_codex":0.000010480696,"about_ca_system_score_gemma":0.00011053318,"threshold_uncertainty_score":0.50894314},"labels":[],"label_agreement":null},{"id":"W2108165346","doi":"10.1002/spe.432","title":"A taxonomy and survey of grid resource management systems for distributed computing","year":2001,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":851,"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 Manitoba","funders":"","keywords":"Computer science; Taxonomy (biology); Grid computing; Grid; Resource management (computing); Variety (cybernetics); Resource (disambiguation); Component (thermodynamics); Data science; Distributed computing; Knowledge management; Artificial intelligence; Computer network; Ecology","score_opus":0.042601096864532416,"score_gpt":0.28793733573637653,"score_spread":0.2453362388718441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108165346","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.03630837,0.0017857401,0.96047074,0.00011924858,0.00031871765,0.0005452981,0.000047259797,0.00012641476,0.0002782414],"genre_scores_gemma":[0.96775013,0.00014856404,0.031763814,0.00010036468,0.000058936614,0.00007260939,0.000049411796,0.000008366022,0.000047812664],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983841,0.00020478631,0.00038554225,0.00048921723,0.000218931,0.00031740183],"domain_scores_gemma":[0.9975717,0.0013603889,0.00033569115,0.00039507897,0.00022039085,0.000116757314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001091814,0.00016606247,0.00026928194,0.000058340196,0.00025537837,0.00029833938,0.00044311804,0.00005574408,5.333173e-7],"category_scores_gemma":[0.0005584831,0.00015825708,0.000028223083,0.00040738168,0.00008641987,0.00054946437,0.00034354784,0.00008555465,0.0000014052786],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016278219,0.0016271269,0.38567427,0.0040380605,0.0010354216,0.0005602264,0.046710048,0.01685952,0.0000893473,0.07469377,0.04260045,0.42448393],"study_design_scores_gemma":[0.0016217672,0.00038580652,0.036741387,0.0004359821,0.000045854853,0.00063871895,0.0071114553,0.08777245,0.000025265688,0.00008937957,0.8643864,0.0007455653],"about_ca_topic_score_codex":0.00053677504,"about_ca_topic_score_gemma":0.0000041413077,"teacher_disagreement_score":0.9314417,"about_ca_system_score_codex":0.000020489722,"about_ca_system_score_gemma":0.000025384737,"threshold_uncertainty_score":0.6453537},"labels":[],"label_agreement":null},{"id":"W2113595474","doi":"10.1002/spe.460","title":"Enterprise frameworks: issues and research directions","year":2002,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Enterprise architecture; Domain (mathematical analysis); Function (biology); Focus (optics); Enterprise architecture framework; Software engineering; Knowledge management; Architecture; Process management; Software architecture; Engineering; Software","score_opus":0.02715606036322757,"score_gpt":0.34181649077641374,"score_spread":0.31466043041318614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113595474","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46767282,0.13012215,0.28813103,0.09228248,0.0022961614,0.0011748329,0.000009662686,0.0021437632,0.016167087],"genre_scores_gemma":[0.8252106,0.014515518,0.1524516,0.006727876,0.00028150462,0.00014160771,0.0000013044685,0.000022521675,0.00064748694],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982146,0.0002086112,0.0001686908,0.00058167544,0.00043054367,0.00039588407],"domain_scores_gemma":[0.99780023,0.0011841473,0.00006329229,0.00054506824,0.00021421233,0.00019307357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037242158,0.00014749404,0.00013330302,0.00015666943,0.00067418,0.0005628242,0.000524274,0.00013040358,0.000052529824],"category_scores_gemma":[0.00051348587,0.00012986851,0.000022851438,0.00073782273,0.00017444426,0.0021513407,0.0005725268,0.0006320035,0.000059579947],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046395824,0.0004184761,0.006712315,0.000089880945,0.000050930114,0.00014454918,0.40841508,0.000005732468,0.0004032166,0.016163355,0.0023090437,0.56524104],"study_design_scores_gemma":[0.00030981717,0.00029618788,0.0018841542,0.00014192626,0.000014561631,0.0003865654,0.01667868,0.0029774786,0.0009720249,0.005853809,0.9700404,0.0004443941],"about_ca_topic_score_codex":0.00054144644,"about_ca_topic_score_gemma":0.00003482408,"teacher_disagreement_score":0.96773136,"about_ca_system_score_codex":0.000013738485,"about_ca_system_score_gemma":0.000012497863,"threshold_uncertainty_score":0.5427327},"labels":[],"label_agreement":null},{"id":"W2114732850","doi":"10.1002/spe.1091","title":"Autonomous role discovery for collaborating agents","year":2011,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nipissing University","funders":"","keywords":"Dynamism; Computer science; Java; Class (philosophy); Multi-agent system; Object (grammar); Distributed computing; Knowledge management; Artificial intelligence; Programming language","score_opus":0.04114290412059249,"score_gpt":0.2971613008906793,"score_spread":0.25601839677008686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114732850","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.113433674,0.00037083926,0.8842153,0.00015677924,0.00052200793,0.00036520924,0.00000497042,0.00015414336,0.0007770909],"genre_scores_gemma":[0.8191765,0.000031499017,0.17985825,0.00048457924,0.00005551222,0.00013849222,0.0000019734152,0.000007737039,0.00024546543],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990275,0.000054316035,0.00019942013,0.00035634206,0.00014967378,0.00021273647],"domain_scores_gemma":[0.99909484,0.0002256538,0.00019302173,0.00028921897,0.00012211881,0.00007514506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026810175,0.000108321736,0.00011022647,0.000036065485,0.00026955793,0.00026740643,0.00028300102,0.000047051413,0.000007535335],"category_scores_gemma":[0.00066358165,0.00009903388,0.000026739914,0.00016423399,0.000028820785,0.004098159,0.000121267716,0.00005309996,0.000012149785],"study_design_candidate":"qualitative","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.0002564188,0.0008275926,0.034862656,0.0002320531,0.00012006717,0.000075671414,0.68344283,0.000036917987,0.0074090217,0.08164398,0.0024931119,0.18859969],"study_design_scores_gemma":[0.0068777334,0.0028785332,0.083716296,0.0005613573,0.0002051479,0.0006094664,0.14276789,0.10355105,0.101573244,0.010807627,0.5415505,0.0049011386],"about_ca_topic_score_codex":0.00020730359,"about_ca_topic_score_gemma":0.000009229618,"teacher_disagreement_score":0.70574284,"about_ca_system_score_codex":0.000024680407,"about_ca_system_score_gemma":0.000063913794,"threshold_uncertainty_score":0.40384844},"labels":[],"label_agreement":null},{"id":"W2118462286","doi":"10.1002/spe.1066","title":"Towards a goal‐driven approach to action selection in self‐adaptive software","year":2011,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Adaptation (eye); Flexibility (engineering); Action (physics); Scalability; Context (archaeology); Action selection; Tracing; Process (computing); Software; Set (abstract data type); Machine learning; Data mining; Software engineering; Industrial engineering; Artificial intelligence; Engineering; Programming language; Perception","score_opus":0.08119668894281527,"score_gpt":0.3262686356536028,"score_spread":0.24507194671078752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118462286","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.015675165,0.00015328734,0.9818262,0.00006689806,0.00029480233,0.0003487502,0.0000011439871,0.001229775,0.00040396836],"genre_scores_gemma":[0.11675984,0.00008659875,0.88247937,0.00031960313,0.00004018509,0.0002598661,7.200062e-7,0.00002058734,0.000033249904],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9978532,0.00024001476,0.00028392795,0.0008172302,0.0003195892,0.0004860013],"domain_scores_gemma":[0.9984813,0.000642197,0.00013989893,0.00037617254,0.00018057955,0.00017985646],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005184977,0.00027362254,0.00026521255,0.00024147097,0.00017068993,0.00010270753,0.00059825135,0.00014371361,0.000004011038],"category_scores_gemma":[0.0043362947,0.000276033,0.000041241226,0.0010501281,0.000060895,0.0034537283,0.00039012046,0.0003902648,0.00002297038],"study_design_candidate":"qualitative","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.0006104483,0.00129603,0.0067202696,0.00018349517,0.00011476664,0.00013062198,0.4317305,0.016543053,0.0012707222,0.0146360565,0.00029999408,0.52646405],"study_design_scores_gemma":[0.010412354,0.013217205,0.41502827,0.0014190499,0.00043488524,0.0075592548,0.15747307,0.10816239,0.089473344,0.11061533,0.06753488,0.01866995],"about_ca_topic_score_codex":0.00020640096,"about_ca_topic_score_gemma":0.000012213192,"teacher_disagreement_score":0.5077941,"about_ca_system_score_codex":0.00018420984,"about_ca_system_score_gemma":0.00010602151,"threshold_uncertainty_score":0.9999692},"labels":[],"label_agreement":null},{"id":"W2119582290","doi":"10.1002/spe.520","title":"Investigating the use of analysis contracts to improve the testability of object‐oriented code","year":2003,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":75,"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; Testability; Precondition; Software engineering; Reuse; Isolation (microbiology); Design by contract; Programming language; Coding (social sciences); Software; Reliability engineering; Software system; Software construction; Engineering","score_opus":0.04497579318473231,"score_gpt":0.31088651099809034,"score_spread":0.265910717813358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119582290","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.38584957,0.00017936122,0.6119543,0.00092799985,0.00009747671,0.0003316111,0.0000072609046,0.00061153056,0.00004093022],"genre_scores_gemma":[0.68562335,0.000009358632,0.31342295,0.0008831591,0.0000053329454,0.00004369885,3.5992943e-7,0.000004399456,0.0000073840965],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982135,0.00037723026,0.00040192145,0.00039827143,0.00037014607,0.00023889302],"domain_scores_gemma":[0.98874474,0.009087971,0.00043857482,0.0011170631,0.00050996605,0.00010169091],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.001320757,0.00014382224,0.00024476027,0.00007800086,0.00026242412,0.00013327095,0.00055144494,0.000048578808,0.0000022446015],"category_scores_gemma":[0.06437049,0.00008743376,0.00007063071,0.001605084,0.00036146384,0.00087138824,0.000225275,0.00018847862,6.7394194e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000929297,0.00077417033,0.650276,0.00013737155,0.0005704074,0.000018897596,0.21118319,0.0015405904,0.0102670025,0.026839217,0.002285633,0.096014574],"study_design_scores_gemma":[0.002641165,0.004268839,0.30367717,0.00095666206,0.0028712275,0.00055837014,0.025340823,0.083305694,0.3901797,0.060834233,0.12103974,0.0043264045],"about_ca_topic_score_codex":0.0009989283,"about_ca_topic_score_gemma":0.000030459854,"teacher_disagreement_score":0.37991267,"about_ca_system_score_codex":0.00001883998,"about_ca_system_score_gemma":0.00011995842,"threshold_uncertainty_score":0.9435107},"labels":[],"label_agreement":null},{"id":"W2131009004","doi":"10.1002/spe.452","title":"A framework for table driven testing of Java classes","year":2002,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Unit testing; Java; Software portability; Tuple; Class (philosophy); Table (database); Programming language; Integration testing; Interface (matter); Standardization; Software engineering; Class hierarchy; Reuse; Object-oriented programming; Data mining; Operating system; Artificial intelligence; Software; Engineering","score_opus":0.06962558702449549,"score_gpt":0.33178758210427484,"score_spread":0.26216199507977933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131009004","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.007245558,0.0008334445,0.98798347,0.0005525167,0.00014055321,0.00018563356,0.000002656996,0.0027324269,0.0003237183],"genre_scores_gemma":[0.27404347,0.00004992056,0.72529787,0.00045237585,0.00003640014,0.00007775104,3.1417872e-7,0.000009280457,0.000032627315],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987998,0.00004348678,0.0002447688,0.0004050991,0.00021320299,0.00029361894],"domain_scores_gemma":[0.99247444,0.006387981,0.000250362,0.0004887015,0.00031146567,0.00008704801],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.00025185745,0.0001414069,0.00018775223,0.00006757676,0.00023123667,0.00015459933,0.0005055972,0.000088206376,0.0000072690214],"category_scores_gemma":[0.026222989,0.00013460565,0.000032059852,0.00050832203,0.00011270258,0.0012185579,0.0002111712,0.0001494579,0.0000042928746],"study_design_candidate":"design_other","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.00006028726,0.00081220694,0.07285553,0.00042689312,0.00007039513,0.00007327043,0.056018233,0.00008679315,0.0011866641,0.06400716,0.027638536,0.77676404],"study_design_scores_gemma":[0.0017680902,0.0041352673,0.0030875865,0.0026829063,0.0001691025,0.0015087746,0.003711498,0.23297597,0.025981456,0.5739478,0.14679442,0.0032371518],"about_ca_topic_score_codex":0.000079792146,"about_ca_topic_score_gemma":5.3379966e-7,"teacher_disagreement_score":0.77352685,"about_ca_system_score_codex":0.000015646723,"about_ca_system_score_gemma":0.00003395508,"threshold_uncertainty_score":0.98197955},"labels":[],"label_agreement":null},{"id":"W2134092469","doi":"10.1002/spe.386","title":"Shimba—an environment for reverse engineering Java software systems","year":2001,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Engineering Research","field":"Computer Science","cited_by":138,"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 Victoria","funders":"Academy of Finland; Association of Canadian Universities for Research in Astronomy; Nokia","keywords":"Computer science; Reverse engineering; Java; Sequence diagram; Software; Programming language; Abstraction; TRACE (psycholinguistics); Sequence (biology); Software system; Software engineering; Unified Modeling Language","score_opus":0.02269407837112575,"score_gpt":0.2825363977862558,"score_spread":0.25984231941513003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134092469","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.039859604,0.0013400574,0.9565952,0.00034561433,0.00057707983,0.0005019114,0.0000054963966,0.00076374266,0.000011325888],"genre_scores_gemma":[0.28496003,0.00077205466,0.7121184,0.00043868506,0.0003181225,0.0008506278,0.000011686031,0.00007732261,0.00045311227],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976249,0.00006230558,0.0003033334,0.0007976277,0.00054291345,0.0006689281],"domain_scores_gemma":[0.9961308,0.002341372,0.00010382679,0.0009350247,0.00012513445,0.0003638391],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006293252,0.00027866024,0.00024009007,0.00014061955,0.00026372727,0.00046683988,0.0008611142,0.0001247308,0.000014797877],"category_scores_gemma":[0.0054082065,0.0002863611,0.00005520805,0.00030607256,0.000065556866,0.0031262136,0.00033334692,0.000262344,0.000046533816],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010736007,0.0029231422,0.095984966,0.002455202,0.0006993835,0.0031050164,0.14420757,0.122261524,0.008933681,0.029602235,0.012219866,0.5765338],"study_design_scores_gemma":[0.0012353715,0.00084627676,0.004115984,0.00018934441,0.0000401076,0.0013439215,0.0027947517,0.044957906,0.00079557986,0.00014386333,0.94204295,0.0014939301],"about_ca_topic_score_codex":0.00011671936,"about_ca_topic_score_gemma":0.0000010420888,"teacher_disagreement_score":0.9298231,"about_ca_system_score_codex":0.00012431001,"about_ca_system_score_gemma":0.000064883214,"threshold_uncertainty_score":0.9999589},"labels":[],"label_agreement":null},{"id":"W2135023474","doi":"10.1002/spe.378","title":"The Relationlog system prototype","year":2001,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Advanced Database Systems and Queries","field":"Computer Science","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 Regina","funders":"","keywords":"Datalog; Computer science; Tuple; Programming language; SQL; Relational database; Data definition language; Data model (GIS); Object (grammar); Relational database management system; Relational model; Extension (predicate logic); Database model; Database design; Query language; Data manipulation language; Database; Artificial intelligence; Mathematics","score_opus":0.013209794887491856,"score_gpt":0.2793283712477387,"score_spread":0.26611857636024683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135023474","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.003331557,0.0015502895,0.99057114,0.0013360485,0.0003798118,0.00032853414,0.0000011703594,0.00029860967,0.0022028629],"genre_scores_gemma":[0.6053008,0.0011081817,0.3907328,0.00076421065,0.00022087155,0.00069655856,0.000003298071,0.000019268518,0.0011540517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99902004,0.00008573309,0.00018212189,0.00028346296,0.00021457032,0.00021405215],"domain_scores_gemma":[0.9985753,0.00056715054,0.0001321054,0.0005307568,0.00012374186,0.00007093465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033763133,0.000096328884,0.000082135455,0.00001860776,0.0007863444,0.00017183786,0.0002767923,0.000033067507,0.0000019218594],"category_scores_gemma":[0.0008939308,0.0000631152,0.000017331078,0.00024628924,0.00009935358,0.0026954922,0.0001831335,0.00011054689,0.000044062144],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008572926,0.00002639833,0.00254974,0.00003185436,0.0000132835885,0.00011527192,0.009346614,0.0000144954865,0.000063238236,0.88329077,0.0003796912,0.10408292],"study_design_scores_gemma":[0.00010565668,0.000070062575,0.00042537597,0.00003827582,0.0000030560961,0.0006491887,0.0059407316,0.0007769297,0.000074062635,0.00026733795,0.9915127,0.00013658918],"about_ca_topic_score_codex":0.00006617908,"about_ca_topic_score_gemma":0.000008142934,"teacher_disagreement_score":0.99113303,"about_ca_system_score_codex":0.000025008763,"about_ca_system_score_gemma":0.000042144766,"threshold_uncertainty_score":0.6048005},"labels":[],"label_agreement":null},{"id":"W2145195191","doi":"10.1002/spe.2325","title":"Better bitmap performance with Roaring bitmaps","year":2015,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":159,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint John Regional Hospital; Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bitmap; Computer science; Encoding (memory); Compression (physics); Oracle; Data compression; Compression ratio; Parallel computing; Algorithm; Computer graphics (images); Artificial intelligence; Engineering; Programming language","score_opus":0.0231628126247053,"score_gpt":0.26177811216115016,"score_spread":0.23861529953644486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145195191","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.28121588,0.00047806115,0.71500194,0.0016043106,0.00029292604,0.00011782898,0.0000012706796,0.00027496536,0.0010128282],"genre_scores_gemma":[0.533895,0.00009398048,0.46415064,0.0016042005,0.000093267285,0.00003737684,0.0000027949914,0.00001062834,0.00011210258],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99873215,0.00003951997,0.00013898169,0.00043536795,0.00037640578,0.0002775684],"domain_scores_gemma":[0.99888164,0.00012893541,0.000102386584,0.00053337286,0.00015143647,0.00020222433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023832542,0.00014666382,0.000120568315,0.000053392858,0.00021492923,0.00031791633,0.00049989007,0.000044505585,0.000004760724],"category_scores_gemma":[0.00020882208,0.00010736615,0.000010147395,0.0002735302,0.00008790059,0.0053246003,0.00048348808,0.00017129233,0.000044635555],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024150034,0.00028081067,0.047600836,0.00006622591,0.0000407927,0.00033186152,0.052659724,0.00021182786,0.00037301797,0.0032721967,0.0052387733,0.8896824],"study_design_scores_gemma":[0.002866982,0.0023513106,0.014527878,0.00042642414,0.000051660045,0.0025239848,0.008756831,0.059024908,0.007319412,0.0016489243,0.89836013,0.0021415695],"about_ca_topic_score_codex":0.00008264626,"about_ca_topic_score_gemma":0.0000017967974,"teacher_disagreement_score":0.89312136,"about_ca_system_score_codex":0.000021733913,"about_ca_system_score_gemma":0.00008305573,"threshold_uncertainty_score":0.43782642},"labels":[],"label_agreement":null},{"id":"W2145399249","doi":"10.1002/spe.2155","title":"A rule-based approach for availability of service by automated service substitution","year":2012,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":7,"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 Ontario Institute of Technology","funders":"","keywords":"Computer science; Web service; Unavailability; Software system; Component-based software engineering; Software engineering; Database; Service (business); Distributed computing; Software; World Wide Web; Operating system; Reliability engineering; Engineering","score_opus":0.017513001416637714,"score_gpt":0.27988527792985163,"score_spread":0.26237227651321393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145399249","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.2661526,0.0012801694,0.7285639,0.0020872871,0.00028186708,0.0006188233,0.000035126548,0.00067542825,0.00030481597],"genre_scores_gemma":[0.69074786,0.0000131353145,0.2997012,0.009175112,0.00005595697,0.00020586704,0.000082343104,0.00001420815,0.0000043400914],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798846,0.00015220579,0.00038683278,0.0005650941,0.00038250163,0.0005249026],"domain_scores_gemma":[0.9973318,0.00078390504,0.00033488212,0.00072915724,0.0005859768,0.00023430835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006362575,0.00026127265,0.00027317964,0.00008136529,0.0002854409,0.000111795445,0.00078626716,0.00013865989,0.000010932942],"category_scores_gemma":[0.00022847301,0.00023487871,0.000054512115,0.0010121473,0.00007355208,0.0027561001,0.00022425638,0.0001577081,0.000008994889],"study_design_candidate":"qualitative","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.0044276156,0.016029455,0.09525374,0.01688364,0.00074645993,0.000016389064,0.5950169,0.0058571124,0.13786665,0.046829935,0.004900333,0.07617179],"study_design_scores_gemma":[0.0071251835,0.0009417987,0.0129050305,0.00040438763,0.000443047,0.0003081556,0.024046067,0.5825651,0.17190637,0.001181219,0.19462122,0.0035524075],"about_ca_topic_score_codex":0.000845894,"about_ca_topic_score_gemma":0.00002440496,"teacher_disagreement_score":0.576708,"about_ca_system_score_codex":0.000033468456,"about_ca_system_score_gemma":0.00012198624,"threshold_uncertainty_score":0.95780754},"labels":[],"label_agreement":null},{"id":"W2146909240","doi":"10.1002/spe.482","title":"CD++: a toolkit to develop DEVS models","year":2002,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":256,"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; Formalism (music); Computer science; Variety (cybernetics); Software engineering; Software; Formal methods; Modeling and simulation; Programming language; Simulation; Artificial intelligence","score_opus":0.20332006786259638,"score_gpt":0.4336497242096695,"score_spread":0.23032965634707314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146909240","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.10634377,0.00039805038,0.87115145,0.007838501,0.00010231603,0.00041212345,0.000008379206,0.00030107758,0.013444341],"genre_scores_gemma":[0.8342833,0.0000974804,0.15853214,0.004361526,0.00003574693,0.00015783761,8.0382574e-7,0.00000885694,0.0025223324],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99818844,0.00005968179,0.000375117,0.00048292015,0.0006520406,0.00024180634],"domain_scores_gemma":[0.99683005,0.0016747436,0.00012851367,0.0005136544,0.00067378243,0.00017923542],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0006959238,0.00011344347,0.00013720423,0.00011384758,0.00031458418,0.00034734295,0.0004420859,0.00005914068,0.00044928634],"category_scores_gemma":[0.011256301,0.0000925228,0.00002408418,0.0013416858,0.000065563196,0.0016982908,0.00019923251,0.00010667257,0.00058478187],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041589017,0.00016804141,0.002354268,0.0000030957867,0.000009223596,0.000012233737,0.04845598,0.00069371454,0.00022892865,0.03465862,0.036326148,0.87704813],"study_design_scores_gemma":[0.00014897212,0.00007071902,0.0007754376,0.000011457721,0.0000075243693,0.000058615904,0.010890268,0.0062576397,0.0004974542,0.036018927,0.94493496,0.00032803364],"about_ca_topic_score_codex":0.000054087315,"about_ca_topic_score_gemma":0.000007866632,"teacher_disagreement_score":0.9086088,"about_ca_system_score_codex":0.000023756342,"about_ca_system_score_gemma":0.000031773085,"threshold_uncertainty_score":0.9970723},"labels":[],"label_agreement":null},{"id":"W2150310088","doi":"10.1002/spe.609","title":"Performance evaluation for VBR Continuous Media File Server admission control","year":2004,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Multimedia Communication and Technology","field":"Social Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Saskatchewan","funders":"","keywords":"Computer science; Control (management); Variable bitrate; Operating system; World Wide Web; Computer network; Database; Bit rate","score_opus":0.035375187398940855,"score_gpt":0.36600419869729195,"score_spread":0.3306290112983511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150310088","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9582918,0.0018811501,0.0074019427,0.022599768,0.00081935845,0.002211459,0.000058608082,0.0006091396,0.00612673],"genre_scores_gemma":[0.9826569,0.0005947827,0.0152688585,0.0008218333,0.0000747663,0.00045470896,0.000027145392,0.000007056066,0.000093945244],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998977,0.00013142977,0.00015769253,0.00019828376,0.00031630532,0.00021929512],"domain_scores_gemma":[0.9978458,0.0012862848,0.0001450114,0.00023887829,0.00037458757,0.00010942524],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0008935947,0.00008032124,0.00011250392,0.00004102104,0.00063230307,0.00005418964,0.00023587138,0.000124847,0.00070181175],"category_scores_gemma":[0.015648311,0.00007626781,0.000024696445,0.00014297647,0.0002592062,0.00081499125,0.00003855548,0.00011856677,0.000028101902],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037555388,0.00034252807,0.006278588,0.00002783912,0.00003195214,0.000003078734,0.23162867,0.000042298558,0.0003714532,0.010461761,0.0029269196,0.74750936],"study_design_scores_gemma":[0.0038422944,0.00021957463,0.0061214897,0.000098651086,0.00007813382,0.000012778477,0.07220232,0.0012060018,0.0007631068,0.002434192,0.91261107,0.0004103844],"about_ca_topic_score_codex":0.00045811562,"about_ca_topic_score_gemma":0.00022549267,"teacher_disagreement_score":0.9096842,"about_ca_system_score_codex":0.000070958,"about_ca_system_score_gemma":0.00027722048,"threshold_uncertainty_score":0.9926433},"labels":[],"label_agreement":null},{"id":"W2164687814","doi":"10.1002/spe.1029","title":"The CoreASM modeling framework","year":2011,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","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":"Simon Fraser University; Defence Research and Development Canada","funders":"","keywords":"Computer science; Key (lock); Software engineering; Systems engineering; Set (abstract data type); Data science; Management science; Engineering; Programming language; Computer security","score_opus":0.042284565170632164,"score_gpt":0.2829391912181352,"score_spread":0.24065462604750304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164687814","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.012223964,0.0012252963,0.98331064,0.0004058572,0.0005831151,0.000081249214,5.519363e-7,0.00022858685,0.0019407229],"genre_scores_gemma":[0.8748379,0.00013995424,0.124439776,0.00045412357,0.000056172303,0.000020862133,3.7958907e-7,0.0000051884354,0.00004563991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988963,0.00009198457,0.00018817687,0.0003166812,0.00021926922,0.0002876041],"domain_scores_gemma":[0.99843305,0.00069364434,0.000104891136,0.00054378173,0.00012258189,0.00010203068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004218356,0.00011401457,0.00009275953,0.00001720977,0.00060960255,0.00035105436,0.0007948023,0.000058939342,0.000003390345],"category_scores_gemma":[0.0012495934,0.00007950766,0.000029145549,0.0002173127,0.000078483725,0.0009445192,0.00027141126,0.00019507094,0.000035923877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010687134,0.0001869264,0.003920753,0.000029889141,0.000067295034,0.0001337044,0.20359151,0.00057075074,0.000019117913,0.62213546,0.0010279301,0.1682098],"study_design_scores_gemma":[0.0006783777,0.00053464127,0.0014712453,0.00040939596,0.00004736361,0.0014753782,0.029336322,0.55304724,0.00025976563,0.17001241,0.24096389,0.0017639925],"about_ca_topic_score_codex":0.00015792914,"about_ca_topic_score_gemma":0.0000015709912,"teacher_disagreement_score":0.8626139,"about_ca_system_score_codex":0.000010390143,"about_ca_system_score_gemma":0.000043075594,"threshold_uncertainty_score":0.46886316},"labels":[],"label_agreement":null},{"id":"W2269410433","doi":"10.1002/spe.2393","title":"Register allocation and spilling using the expected distance heuristic","year":2016,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Allocator; Register allocation; Computer science; Profiling (computer programming); Compiler; Parallel computing; Operating system","score_opus":0.026264379434039448,"score_gpt":0.30093789960287226,"score_spread":0.27467352016883284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269410433","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.021487456,0.000818141,0.97511965,0.0021028144,0.0000858807,0.0000880998,3.4865616e-7,0.00022522477,0.000072359064],"genre_scores_gemma":[0.7144528,0.00036898357,0.28456378,0.0004944003,0.000029525447,0.000013360353,1.9277023e-7,0.0000050895424,0.00007182727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912274,0.00009073837,0.0001524291,0.0003228651,0.00015216316,0.00015906643],"domain_scores_gemma":[0.9987818,0.00055690226,0.00014440094,0.00035303304,0.00012075798,0.00004312501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023279841,0.00009795761,0.00008078944,0.000029617942,0.00033762475,0.00021815657,0.0002729981,0.000033314544,0.0000016868951],"category_scores_gemma":[0.0010459184,0.000058609137,0.000012296014,0.00017203798,0.00014364973,0.0011657808,0.00016672304,0.0000628698,0.0000015269616],"study_design_candidate":"design_other","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.00026190048,0.00032038495,0.01965269,0.00014461037,0.00009522288,0.00013265411,0.13740927,0.0009948249,0.013156222,0.17655742,0.0022158208,0.649059],"study_design_scores_gemma":[0.0041053556,0.0010867518,0.010506336,0.0025957355,0.0001922409,0.0035041536,0.015494268,0.5913226,0.033395007,0.049224783,0.28335735,0.0052154395],"about_ca_topic_score_codex":0.000027292475,"about_ca_topic_score_gemma":0.0000011909801,"teacher_disagreement_score":0.6929654,"about_ca_system_score_codex":0.00002115677,"about_ca_system_score_gemma":0.000026115127,"threshold_uncertainty_score":0.25967708},"labels":[],"label_agreement":null},{"id":"W2269942371","doi":"10.1002/spe.2388","title":"SafeType: detecting type violations for type‐basedalias analysis of C","year":2015,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; IBM (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Alias; Computer science; Compiler; Programming language; Memory safety; Type inference; Static analysis; Benchmark (surveying); Type safety; Spec#; Context (archaeology); Java; Compile time; Database; Inference; Artificial intelligence","score_opus":0.1252414425623855,"score_gpt":0.39617073386537743,"score_spread":0.2709292913029919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269942371","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.07719953,0.00041942846,0.9212834,0.00034424927,0.00036786305,0.00009934978,0.0000018850268,0.00008872466,0.00019555523],"genre_scores_gemma":[0.7863934,0.000020422947,0.21328545,0.00024011052,0.000027888547,0.000007953855,0.0000034375605,0.0000032993323,0.000018039962],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992012,0.00005512047,0.0002042743,0.0002504371,0.00016025576,0.0001287059],"domain_scores_gemma":[0.9977893,0.0009929269,0.00019141562,0.00031505054,0.00063199934,0.00007926498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048816472,0.000069603884,0.00013220271,0.000117998075,0.00015994736,0.00007620046,0.00026096104,0.000042473515,0.0000046931978],"category_scores_gemma":[0.0046205474,0.00007006331,0.000035322068,0.0013617929,0.000041134725,0.00077593315,0.000093272865,0.0000664884,0.0000039933007],"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.00096062775,0.000801758,0.07235657,0.0001992276,0.0015457598,0.000019012694,0.39640182,0.012868491,0.004088079,0.18055196,0.0019330004,0.3282737],"study_design_scores_gemma":[0.0013830895,0.001178843,0.009324323,0.00008941935,0.0009662339,0.00007311393,0.030390603,0.780576,0.010063635,0.0055627786,0.15924361,0.0011483512],"about_ca_topic_score_codex":0.00007667886,"about_ca_topic_score_gemma":0.000006193757,"teacher_disagreement_score":0.7677075,"about_ca_system_score_codex":0.000020588059,"about_ca_system_score_gemma":0.00010861811,"threshold_uncertainty_score":0.553156},"labels":[],"label_agreement":null},{"id":"W2281407436","doi":"10.1002/spe.2382","title":"DataMill: a distributed heterogeneous infrastructure forrobust experimentation","year":2015,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"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":"Benchmarking; Dilemma; Computer science; Competition (biology); Empirical research; Compiler; Process (computing); Data science; Operating system","score_opus":0.026376792835969862,"score_gpt":0.31034585328382025,"score_spread":0.28396906044785036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2281407436","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.014117271,0.0005376952,0.98393345,0.00035106894,0.00019572738,0.00012278146,0.0000052181226,0.0005756538,0.00016114351],"genre_scores_gemma":[0.49566627,0.00007696456,0.50323683,0.000905043,0.000031105286,0.000033112003,0.000026584554,0.0000072064645,0.0000168847],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988625,0.00008620079,0.00018967867,0.00038851096,0.00025868448,0.00021442065],"domain_scores_gemma":[0.9989417,0.00012666792,0.0001415208,0.00041639328,0.00019952605,0.00017416925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018457406,0.00014161924,0.00011763575,0.00005211848,0.0001738906,0.00031071508,0.0004512429,0.00006336094,0.0000040235586],"category_scores_gemma":[0.0008035271,0.00013272365,0.000019611405,0.00027885503,0.00006692219,0.0018870087,0.00033325364,0.00010898409,0.000007606518],"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.00066927256,0.0010908761,0.015463089,0.00012901683,0.00023411766,0.0007668967,0.33140257,0.11066251,0.00188024,0.031277835,0.095045045,0.41137853],"study_design_scores_gemma":[0.004024892,0.0017584541,0.0017325627,0.00016516085,0.00007309836,0.0037585797,0.024341175,0.48196316,0.04252469,0.012747451,0.423743,0.003167782],"about_ca_topic_score_codex":0.00004657913,"about_ca_topic_score_gemma":8.3988726e-7,"teacher_disagreement_score":0.481549,"about_ca_system_score_codex":0.000048054815,"about_ca_system_score_gemma":0.00007319416,"threshold_uncertainty_score":0.54123133},"labels":[],"label_agreement":null},{"id":"W2297699084","doi":"10.1002/spe.2389","title":"Runtime latency detection and analysis","year":2016,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Latency (audio); Tracing; Stateful firewall; Scalability; Linux kernel; Real-time computing; Distributed computing; Operating system; Embedded system; Computer network; Network packet","score_opus":0.008521217669435751,"score_gpt":0.2468136966010594,"score_spread":0.23829247893162364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2297699084","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.4027,0.00032635184,0.5948842,0.0014874885,0.00008964104,0.000050036215,2.6961015e-7,0.00016867233,0.00029333855],"genre_scores_gemma":[0.9791368,0.00009989791,0.020025248,0.0003479897,0.000028989234,0.000010489663,7.67851e-8,0.000003599699,0.00034689534],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99904543,0.0000595837,0.00012832128,0.0004067684,0.0001744399,0.00018543565],"domain_scores_gemma":[0.99910605,0.00034661277,0.00008871158,0.0003211814,0.000054032185,0.00008343952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002450616,0.0000969379,0.00011097651,0.00011332159,0.00023325604,0.00016107279,0.0002156848,0.00003418047,0.0000068527074],"category_scores_gemma":[0.00037350928,0.00006451651,0.000032991687,0.00049403094,0.00007153648,0.00026615857,0.00034558328,0.000053355427,0.000014890647],"study_design_candidate":"design_other","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.000014993627,0.000045315745,0.009446742,0.000008913006,0.00012357571,0.000027991515,0.007509245,0.00002478039,0.0008033577,0.0013557592,0.000030956788,0.98060834],"study_design_scores_gemma":[0.0044339984,0.0018768839,0.40572703,0.00036932027,0.0018173195,0.0010078616,0.011902156,0.14154914,0.012160094,0.0114594,0.40334836,0.0043484406],"about_ca_topic_score_codex":0.00007348652,"about_ca_topic_score_gemma":0.000004805837,"teacher_disagreement_score":0.97625995,"about_ca_system_score_codex":0.000014454611,"about_ca_system_score_gemma":0.0000074881577,"threshold_uncertainty_score":0.2630907},"labels":[],"label_agreement":null},{"id":"W2476849799","doi":"10.1002/spe.2426","title":"Resource requests prediction in the cloud computing environment with a deep belief network","year":2016,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Cloud computing; Computer science; Deep belief network; Variance (accounting); Artificial intelligence; Set (abstract data type); Data mining; Resource (disambiguation); Machine learning; Scheduling (production processes); Deep learning; Mean squared error; Mathematical optimization; Statistics; Mathematics","score_opus":0.008643884133305817,"score_gpt":0.22546533838124636,"score_spread":0.21682145424794053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2476849799","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.19501002,0.0007026714,0.7936958,0.008818955,0.00016623124,0.0003086126,4.0162317e-7,0.00021208973,0.0010852225],"genre_scores_gemma":[0.95485723,0.000058270423,0.042589735,0.0020311933,0.00029366187,0.000033358472,5.3551145e-7,0.000010655927,0.00012537705],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99811924,0.00029381612,0.00023224631,0.0005268178,0.00043096163,0.0003969086],"domain_scores_gemma":[0.9981288,0.0010178149,0.00016358244,0.0005988806,0.00002198248,0.000068946836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009940319,0.00016071055,0.00012316515,0.000040929084,0.00038109047,0.00018126759,0.00063625723,0.000046030164,0.000004222734],"category_scores_gemma":[0.00020618027,0.000086884094,0.000022678598,0.0002958166,0.00013752902,0.00019693666,0.00042630752,0.00017464519,0.000016422324],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017437308,0.00039494684,0.027334457,0.00003643621,0.00005381416,0.00038483494,0.10839796,0.020864334,0.000038064663,0.01345002,0.0021002786,0.8267705],"study_design_scores_gemma":[0.0026925553,0.0016871974,0.039343648,0.0010027367,0.00006375756,0.0012882994,0.01893326,0.050143227,0.0000783523,0.0029465756,0.8806143,0.0012060838],"about_ca_topic_score_codex":0.00003983551,"about_ca_topic_score_gemma":0.0000063894486,"teacher_disagreement_score":0.87851405,"about_ca_system_score_codex":0.000052798412,"about_ca_system_score_gemma":0.000015495854,"threshold_uncertainty_score":0.35430306},"labels":[],"label_agreement":null},{"id":"W2527845150","doi":"10.1002/spe.2461","title":"Regular and almost universal hashing: an efficient implementation","year":2016,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Cryptographic Implementations and Security","field":"Computer Science","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":"Université TÉLUQ","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hash function; Double hashing; SHA-2; Linear hashing; Merkle tree; Byte; Hash table; Hash chain","score_opus":0.015278382765730496,"score_gpt":0.3191347859469394,"score_spread":0.3038564031812089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527845150","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.581349,0.000105634084,0.4164446,0.0017922996,0.00008567363,0.000106685955,0.0000043825244,0.000079891084,0.000031839343],"genre_scores_gemma":[0.9418002,0.00014504639,0.05762238,0.00037859217,0.000020541487,0.00001619072,0.0000026926236,0.0000046981904,0.000009708802],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998956,0.000085290376,0.00014963374,0.00038495418,0.00020951834,0.00021457247],"domain_scores_gemma":[0.9991502,0.00024038047,0.00009617097,0.00028850843,0.00009408233,0.00013066063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002920854,0.00010090885,0.00007666938,0.00007375127,0.0003521109,0.00023406981,0.00020811183,0.000028490711,0.00003063912],"category_scores_gemma":[0.00013635901,0.00007744069,0.000015175837,0.00020970652,0.00011988283,0.0023768903,0.00017710972,0.000047341564,0.000002763307],"study_design_candidate":"design_other","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.000056002773,0.00020125703,0.016282441,0.000015852054,0.000029014787,0.00005526622,0.109242395,0.000003637282,0.004707665,0.21158412,0.00032206567,0.65750027],"study_design_scores_gemma":[0.010640525,0.003361355,0.10689713,0.00020210563,0.00017670274,0.001589969,0.39890537,0.0072858385,0.018917177,0.020664614,0.42801708,0.0033421593],"about_ca_topic_score_codex":0.00019737755,"about_ca_topic_score_gemma":0.000038449307,"teacher_disagreement_score":0.6541581,"about_ca_system_score_codex":0.000021757722,"about_ca_system_score_gemma":0.000040926963,"threshold_uncertainty_score":0.31579393},"labels":[],"label_agreement":null},{"id":"W2528870978","doi":"10.1002/spe.2441","title":"Toward cost‐effective replica placements in cloud storage systems with QoS‐awareness","year":2016,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Crandall University; University of New Brunswick","funders":"Science and Technology Planning Project of Guangdong Province; Korea Institute for Advancement of Technology; National Key Research and Development Program of China; National University of Singapore","keywords":"Replica; Computer science; Quality of service; Distributed computing; Cloud computing; Greedy algorithm; Cloud storage; Workflow; Set (abstract data type); Replication (statistics); Computer network; Database; Algorithm; Operating system; Mathematics","score_opus":0.021881245941772896,"score_gpt":0.28936705119004014,"score_spread":0.26748580524826726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528870978","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.09976356,0.0004883287,0.8970548,0.00044735245,0.0009161665,0.00083514483,0.000008623308,0.00023315285,0.00025289552],"genre_scores_gemma":[0.9955392,0.00005014536,0.0034793993,0.00017656208,0.00012067742,0.0005022295,0.000002357136,0.000012984287,0.00011643536],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977164,0.00031856858,0.0003047688,0.00079706835,0.00041208378,0.00045111196],"domain_scores_gemma":[0.99760884,0.0011148853,0.00026106217,0.0006797096,0.00017347652,0.00016202523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066207023,0.00023570695,0.00028859885,0.000082150174,0.00017939296,0.00032434345,0.00061698613,0.000084942185,0.0000030648325],"category_scores_gemma":[0.00066158234,0.00015631493,0.000025399057,0.000445212,0.00010099553,0.0017021401,0.00026857876,0.00014585916,0.000031774616],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032129847,0.0021914104,0.38939276,0.0012062056,0.0005146327,0.004457572,0.2097074,0.010984164,0.0016949403,0.031188449,0.007693151,0.33775634],"study_design_scores_gemma":[0.018064396,0.005050754,0.034528393,0.008089293,0.0001230916,0.005540923,0.027549395,0.030013844,0.002844475,0.0009199913,0.8610505,0.0062249824],"about_ca_topic_score_codex":0.00039981547,"about_ca_topic_score_gemma":0.000008664884,"teacher_disagreement_score":0.8957757,"about_ca_system_score_codex":0.00012658136,"about_ca_system_score_gemma":0.00012110233,"threshold_uncertainty_score":0.63743377},"labels":[],"label_agreement":null},{"id":"W2553786604","doi":"10.1002/spe.2463","title":"Modelling a family of systems for crisis management with concern‐oriented reuse","year":2016,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","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":"McGill University; Trent University","funders":"","keywords":"Reuse; Rotation formalisms in three dimensions; Abstraction; Computer science; Software engineering; Domain (mathematical analysis); Core (optical fiber); Risk analysis (engineering); Systems engineering; Engineering; Business","score_opus":0.0580529944815453,"score_gpt":0.3168435371305206,"score_spread":0.2587905426489753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2553786604","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.009148489,0.0013042665,0.9883364,0.00028562188,0.00025995335,0.00033310207,0.000005120142,0.0003008383,0.00002619943],"genre_scores_gemma":[0.12801409,0.00075628044,0.8708208,0.00008932076,0.00001814936,0.00022235344,3.348586e-7,0.0000138454525,0.00006481385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986741,0.00007039554,0.00024794476,0.00046873328,0.00025958449,0.00027925457],"domain_scores_gemma":[0.9966168,0.0020623466,0.00020561933,0.00078495167,0.00025603047,0.00007425457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040815276,0.00016084302,0.00022188305,0.00007487426,0.00009585752,0.00005204308,0.0005747342,0.000046998073,3.8950722e-7],"category_scores_gemma":[0.0012737082,0.00010729778,0.000027802243,0.00024461595,0.00009790479,0.0015748228,0.00027447028,0.00005604364,0.0000011959406],"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.0020453478,0.00044315524,0.0010334478,0.0016871365,0.00064445415,0.00026993203,0.086925805,0.5247127,0.0035495767,0.21865222,0.0021491547,0.15788712],"study_design_scores_gemma":[0.018736623,0.007892119,0.00052691315,0.006381572,0.00070631015,0.0010202947,0.18825409,0.18270169,0.035356816,0.05341266,0.497201,0.0078099184],"about_ca_topic_score_codex":0.000037067246,"about_ca_topic_score_gemma":1.3467832e-7,"teacher_disagreement_score":0.49505183,"about_ca_system_score_codex":0.000036964997,"about_ca_system_score_gemma":0.000026650327,"threshold_uncertainty_score":0.43754765},"labels":[],"label_agreement":null},{"id":"W2590572719","doi":"10.1002/spe.2486","title":"Naplus: a software distributed shared memory for virtual clusters in the cloud","year":2017,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Science Foundation of Hubei Province; Atlantic Canada Opportunities Agency; National Natural Science Foundation of China; Science and Technology Planning Project of Guangdong Province; New Brunswick Innovation Foundation; Natural Sciences and Engineering Research Council of Canada; Fulbright Canada","keywords":"Computer science; Data diffusion machine; Shared memory; Distributed shared memory; Virtual machine; Cloud computing; Distributed computing; Distributed memory; Virtual memory; Host (biology); Synchronization (alternating current); Cluster (spacecraft); Operating system; Memory management; Uniform memory access; Computer network; Overlay; Channel (broadcasting)","score_opus":0.022316413634216554,"score_gpt":0.29381939373783467,"score_spread":0.2715029801036181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2590572719","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.19315998,0.00037650822,0.7931479,0.011183044,0.0009829997,0.0006774303,0.0000151872555,0.00024310329,0.00021382271],"genre_scores_gemma":[0.95170313,0.000026722102,0.044370636,0.0032295566,0.00023318568,0.00022142209,0.000007459076,0.000014634286,0.00019325418],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99824077,0.00013944009,0.00025492237,0.00058329356,0.00035848553,0.00042311553],"domain_scores_gemma":[0.9969056,0.0013897304,0.00028790155,0.0012340377,0.000096113436,0.00008657785],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00096379314,0.00019479265,0.00018447547,0.00005212067,0.0013005262,0.0012538908,0.002170632,0.00007075211,0.000002610107],"category_scores_gemma":[0.004491315,0.00014514284,0.000068964575,0.00015174954,0.00019175226,0.0005023856,0.00096460705,0.00022076094,0.00000818189],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004737791,0.0007436047,0.004681611,0.00019992878,0.0001213301,0.000449017,0.2510269,0.0029330056,0.000032510397,0.008875793,0.017428026,0.7130345],"study_design_scores_gemma":[0.0076219453,0.0017973012,0.026542397,0.0006966527,0.00014585616,0.00063152116,0.1179105,0.13509779,0.00021881393,0.0047652223,0.7018485,0.0027234927],"about_ca_topic_score_codex":0.00016355222,"about_ca_topic_score_gemma":0.00002324904,"teacher_disagreement_score":0.75854313,"about_ca_system_score_codex":0.000041015937,"about_ca_system_score_gemma":0.000049043476,"threshold_uncertainty_score":0.99999964},"labels":[],"label_agreement":null},{"id":"W2599234488","doi":"10.1002/spe.1097","title":"Editorial","year":2011,"lang":"en","type":"editorial","venue":"Software Practice and Experience","topic":"Advanced Software Engineering Methodologies","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":"University of Calgary","funders":"","keywords":"Political science","score_opus":0.02280397231607757,"score_gpt":0.31885556526118386,"score_spread":0.2960515929451063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599234488","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.4132095e-7,0.00093116326,0.48578015,0.000025990686,0.51239324,0.000082426915,0.000006260624,0.00067639013,0.00010366622],"genre_scores_gemma":[0.0000018887141,0.0009813608,0.44693008,0.000047717724,0.5517665,0.00007659076,0.000007031961,0.000028892666,0.00015991756],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966144,0.00024103523,0.0003860153,0.0011254455,0.0010554307,0.00057769037],"domain_scores_gemma":[0.98669845,0.010832622,0.0003896441,0.0012578615,0.00061310374,0.0002083436],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009082406,0.0004955712,0.00049440895,0.00013458639,0.00023418246,0.00034721268,0.0017994381,0.0009842641,0.000008660946],"category_scores_gemma":[0.06734886,0.0004813155,0.00008173958,0.00032017566,0.00020132895,0.0032937485,0.0011478424,0.0014672623,0.000059539456],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031043393,0.000027744829,0.0000014145334,0.00004490304,0.00002171329,0.00003389891,0.004738403,0.000013384356,0.0000065562485,0.0003986374,0.98102325,0.013659022],"study_design_scores_gemma":[0.00017542529,0.0001374066,0.0000011370774,0.000059343463,0.000021354634,0.000016223612,0.00019215027,0.000005537785,0.00007128319,0.00411425,0.99463886,0.00056703994],"about_ca_topic_score_codex":0.000097919125,"about_ca_topic_score_gemma":0.0000016183266,"teacher_disagreement_score":0.06644062,"about_ca_system_score_codex":0.000084116546,"about_ca_system_score_gemma":0.00035312353,"threshold_uncertainty_score":0.99976385},"labels":[],"label_agreement":null},{"id":"W2605244930","doi":"10.1002/spe.2487","title":"Deep learning and SVM‐based emotion recognition from Chinese speech for smart affective services","year":2017,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Emotion and Mood Recognition","field":"Psychology","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Science Foundation of Shandong Province; Ministry of Science and Technology of the People's Republic of China; National Natural Science Foundation of China","keywords":"Support vector machine; Deep belief network; Computer science; Artificial intelligence; Mel-frequency cepstrum; Sadness; Surprise; Anger; Feature (linguistics); Speech recognition; Emotion recognition; Emotion classification; Cepstrum; Machine learning; Formant; Pattern recognition (psychology); Deep learning; Feature extraction; Psychology","score_opus":0.026445955772793624,"score_gpt":0.3585577752525215,"score_spread":0.3321118194797279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605244930","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9695933,0.00036660756,0.026399974,0.0005092669,0.00066511263,0.00037823294,0.000018309607,0.000113450165,0.0019557383],"genre_scores_gemma":[0.9865341,0.00014745297,0.012104953,0.0005762172,0.00019053691,0.00015297809,0.00013023977,0.00001900563,0.00014450547],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9989971,0.00014660814,0.0001405293,0.0004254169,0.00010563445,0.0001847171],"domain_scores_gemma":[0.9984974,0.0007452587,0.00030198746,0.00018956048,0.00017725764,0.00008851325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025681674,0.00014831913,0.00014512126,0.00005119782,0.00080051104,0.0002323262,0.00008243517,0.00013553369,0.0002158362],"category_scores_gemma":[0.0014331498,0.00013910304,0.000036206788,0.000039543334,0.00010438753,0.0010969858,0.000041361192,0.00017845951,0.000056159875],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083057047,0.00022447044,0.075518586,0.0000855327,0.00006329311,0.000021398306,0.032126665,8.2965164e-7,0.00084174186,0.000026320704,0.00003500026,0.8902256],"study_design_scores_gemma":[0.010230379,0.0019919516,0.8181374,0.0006303966,0.000466555,0.00029311448,0.12166396,0.0032557552,0.0039389683,0.011142076,0.026650537,0.0015988939],"about_ca_topic_score_codex":0.00079397165,"about_ca_topic_score_gemma":0.00019330448,"teacher_disagreement_score":0.8886267,"about_ca_system_score_codex":0.000013606335,"about_ca_system_score_gemma":0.0000093145145,"threshold_uncertainty_score":0.6156965},"labels":[],"label_agreement":null},{"id":"W2759878005","doi":"10.1002/spe.2560","title":"Roaring bitmaps: Implementation of an optimized software library","year":2018,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":48,"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 New Brunswick; Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bitmap; Oracle; Microsoft Visual Studio; Software; Benchmark (surveying); Visual Basic for Applications; Index (typography)","score_opus":0.015491083339612195,"score_gpt":0.32155551221457046,"score_spread":0.30606442887495827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759878005","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.09328406,0.00027780788,0.90545547,0.00017555483,0.0002443525,0.00015750957,0.000015376627,0.00026765795,0.00012220342],"genre_scores_gemma":[0.12494633,0.00008911192,0.8743178,0.00044222947,0.00009975698,0.00004023308,0.000014326246,0.000012293528,0.00003787088],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99872357,0.00009054251,0.00029605482,0.00042596055,0.00022939929,0.000234502],"domain_scores_gemma":[0.9987917,0.00022754945,0.0002560478,0.0004813867,0.00012837372,0.000114960414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018882728,0.00013809052,0.00017113032,0.00007242764,0.00024615807,0.00011705993,0.00030805758,0.00004134154,0.00005768963],"category_scores_gemma":[0.00033821317,0.00012612948,0.000024921143,0.00030005552,0.00017072096,0.011813206,0.00039560715,0.00007974805,0.000009232166],"study_design_candidate":"design_other","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.0002667886,0.00022434758,0.008681482,0.00015374881,0.00005925663,0.0000819302,0.09242887,0.00003364138,0.0027655237,0.038653273,0.00069220585,0.85595894],"study_design_scores_gemma":[0.005235993,0.0039029184,0.010625994,0.00051605335,0.00009365109,0.0009847357,0.14682409,0.005612799,0.28673518,0.004024811,0.53267115,0.002772595],"about_ca_topic_score_codex":0.00023868923,"about_ca_topic_score_gemma":0.000012588331,"teacher_disagreement_score":0.85318637,"about_ca_system_score_codex":0.000009381906,"about_ca_system_score_gemma":0.000092057315,"threshold_uncertainty_score":0.8564289},"labels":[],"label_agreement":null},{"id":"W2790464890","doi":"10.1002/spe.2566","title":"Recovering disk storage metrics from low‐level trace events","year":2018,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Tracing; TRACE (psycholinguistics); Computer data storage; Block (permutation group theory); Stateful firewall; Page fault; Key (lock); Object storage; Distributed computing; Virtual memory; Operating system; Memory management","score_opus":0.03428704090859698,"score_gpt":0.30703009444557244,"score_spread":0.2727430535369755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790464890","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.15733333,0.00092857506,0.83993393,0.0003890356,0.00057161547,0.000110858135,0.00003230674,0.0006085219,0.000091814705],"genre_scores_gemma":[0.5357002,0.00024864287,0.46354023,0.00035253822,0.000067274115,0.000026268557,0.0000032935768,0.000011318798,0.00005025269],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99817884,0.000060734725,0.00023767003,0.0007507029,0.00039182673,0.00038020665],"domain_scores_gemma":[0.99756086,0.000881197,0.00022682257,0.0010607514,0.0001557568,0.000114603914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023456189,0.00021011937,0.00018882354,0.0001249611,0.00034357046,0.00019940897,0.0012168337,0.000111116606,0.000020702159],"category_scores_gemma":[0.0062636193,0.0002026832,0.000030496216,0.00081724266,0.00022039808,0.0062264362,0.0010558153,0.00026260794,0.00009508338],"study_design_candidate":"design_other","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.000094773335,0.00024757808,0.0032558043,0.000025793837,0.00004247115,0.00021760634,0.024950918,0.000025083593,0.0024808873,0.0032176725,0.001029821,0.9644116],"study_design_scores_gemma":[0.0037859264,0.0025464608,0.027695099,0.0005581444,0.0001645969,0.00076261087,0.040574845,0.020628458,0.1153119,0.09140834,0.6905555,0.0060080765],"about_ca_topic_score_codex":0.00019015894,"about_ca_topic_score_gemma":0.000015536689,"teacher_disagreement_score":0.9584035,"about_ca_system_score_codex":0.00008212168,"about_ca_system_score_gemma":0.000050464834,"threshold_uncertainty_score":0.8265181},"labels":[],"label_agreement":null},{"id":"W2792146644","doi":"10.1002/spe.2567","title":"Hardware trace reconstruction of runtime compiled code","year":2018,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; TRACE (psycholinguistics); Executable; Tracing; Code (set theory); Kernel (algebra); Software; Linux kernel; Operating system; Granularity; Overhead (engineering); Source code; Just-in-time compilation; Parallel computing; Embedded system; Programming language; Virtual machine","score_opus":0.015052674962690808,"score_gpt":0.28359402150777546,"score_spread":0.26854134654508466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792146644","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6441304,0.0007403997,0.35107937,0.0007235867,0.0014255623,0.00030452418,0.0000072844446,0.00039467783,0.0011941826],"genre_scores_gemma":[0.8852958,0.00012720762,0.11409984,0.00023627539,0.00012101638,0.000026715996,9.341642e-7,0.000007951479,0.000084277446],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984433,0.0001110152,0.00038413348,0.000488278,0.00031111942,0.00026213244],"domain_scores_gemma":[0.99807453,0.00039387838,0.00029281614,0.0006478159,0.0004845939,0.00010636428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049285905,0.00015782511,0.00024460425,0.00007340501,0.0002941343,0.00010095542,0.00048532157,0.000102253565,0.00004244195],"category_scores_gemma":[0.0009734778,0.00013576318,0.00005064919,0.0004117541,0.0004595131,0.002581418,0.00019741684,0.00014660979,0.00006024471],"study_design_candidate":"design_other","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.00040676777,0.00050347345,0.14150062,0.00038852805,0.000115990675,0.000030641764,0.099603005,0.000016351947,0.004074644,0.004165399,0.0019992052,0.74719536],"study_design_scores_gemma":[0.0071863565,0.006212506,0.13790405,0.002005507,0.00027333325,0.00765987,0.049458113,0.028146278,0.19607072,0.007899394,0.55236626,0.004817606],"about_ca_topic_score_codex":0.00009465669,"about_ca_topic_score_gemma":0.000009209189,"teacher_disagreement_score":0.74237776,"about_ca_system_score_codex":0.000028326158,"about_ca_system_score_gemma":0.00009510026,"threshold_uncertainty_score":0.5536262},"labels":[],"label_agreement":null},{"id":"W2803024722","doi":"10.1002/spe.2581","title":"Ontology‐based model‐driven development of a destination management portal: Experience and lessons learned","year":2018,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":7,"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é du Québec à Montréal","funders":"","keywords":"Computer science; Model-driven architecture; Unified Modeling Language; Code generation; Software engineering; Ontology; Context (archaeology); Process (computing); Domain (mathematical analysis); Flexibility (engineering); Process management; Metamodeling; Code (set theory); Knowledge management; Key (lock); Programming language; Engineering; Software; Computer security","score_opus":0.07106454758414069,"score_gpt":0.3608715101640578,"score_spread":0.2898069625799171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803024722","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.29900777,0.00014335135,0.6989419,0.0009043827,0.00008251183,0.00012255399,3.7210455e-7,0.00011277987,0.0006844012],"genre_scores_gemma":[0.5837131,0.000044776287,0.41588363,0.00028095648,0.0000056362164,0.00004096122,5.3265546e-7,0.00000334424,0.000027011125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865156,0.00004992668,0.00026633817,0.0005033311,0.00027047753,0.0002583875],"domain_scores_gemma":[0.9989803,0.0002050759,0.00020124178,0.0003588605,0.00017180186,0.00008273942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024973243,0.00014584394,0.0001670035,0.000092582515,0.00029610013,0.00009274933,0.00040237667,0.000060273247,0.0000053881204],"category_scores_gemma":[0.0005120698,0.00013327878,0.0000167961,0.00021953961,0.00039035518,0.0011078895,0.0003219294,0.000072358634,0.0000037842678],"study_design_candidate":"design_other","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.00017535397,0.0004314571,0.013614923,0.0001747787,0.00006380303,0.00013928315,0.25597012,0.00017593714,0.00259098,0.060084704,0.00013386745,0.6664448],"study_design_scores_gemma":[0.005265622,0.0018825103,0.12725455,0.00093309575,0.00020876336,0.00080796547,0.1194066,0.58094305,0.106789045,0.018588439,0.034250684,0.0036696831],"about_ca_topic_score_codex":0.00003108595,"about_ca_topic_score_gemma":0.000041541196,"teacher_disagreement_score":0.6627751,"about_ca_system_score_codex":0.000018501516,"about_ca_system_score_gemma":0.00010089831,"threshold_uncertainty_score":0.54349506},"labels":[],"label_agreement":null},{"id":"W2888095436","doi":"10.1002/spe.2624","title":"C: Adding modern programming language features to C","year":2018,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Programming language; Garbage collection; Software engineering; Third-generation programming language; Programming paradigm; Second-generation programming language; Garbage; Fifth-generation programming language","score_opus":0.018081320056256157,"score_gpt":0.30714334969980167,"score_spread":0.2890620296435455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888095436","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.01830694,0.0012221001,0.9756595,0.0006815428,0.00060840027,0.0003463989,4.509351e-7,0.0005666502,0.0026080143],"genre_scores_gemma":[0.834487,0.000010791651,0.16361195,0.0012027445,0.00024163589,0.000078746176,8.584172e-7,0.000009825829,0.00035644908],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985631,0.000066145134,0.00015811858,0.0005186376,0.00028874635,0.00040525183],"domain_scores_gemma":[0.998904,0.00018545665,0.00009834059,0.0004654962,0.00015415199,0.00019254252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003227621,0.00015406574,0.00013879567,0.00006766428,0.00035894217,0.0005937094,0.00053409283,0.00006703076,0.000007357642],"category_scores_gemma":[0.0009840732,0.0001291659,0.000030220212,0.00036545398,0.000096150114,0.0014325904,0.00035600647,0.00012968344,0.000090448964],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002182024,0.000052536852,0.00061147765,0.000018485478,0.000012991833,0.00006571337,0.1611012,0.0000010120617,0.00076483906,0.022094319,0.0004993571,0.8147562],"study_design_scores_gemma":[0.0005554704,0.0011835678,0.0010832271,0.0000481429,0.000027757573,0.000937617,0.032729443,0.0008065274,0.008208126,0.0035264548,0.94975,0.001143679],"about_ca_topic_score_codex":0.00027235397,"about_ca_topic_score_gemma":0.000037545367,"teacher_disagreement_score":0.94925064,"about_ca_system_score_codex":0.000023290177,"about_ca_system_score_gemma":0.000037972753,"threshold_uncertainty_score":0.5725153},"labels":[],"label_agreement":null},{"id":"W2895482093","doi":"10.1002/spe.2639","title":"A systematic literature review on the detection of smells and their evolution in object‐oriented and service‐oriented systems","year":2018,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Engineering Research","field":"Computer Science","cited_by":38,"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é du Québec à Montréal; Concordia University","funders":"","keywords":"Code smell; Computer science; Software engineering; Source code; Identification (biology); Suite; Service (business); Data science; Information retrieval; Software; Software development; Programming language; Software quality","score_opus":0.010999122528343468,"score_gpt":0.2692355839895828,"score_spread":0.25823646146123935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895482093","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48666853,0.20297435,0.30557328,0.0014496128,0.0006917134,0.002337675,0.0000070223036,0.00026550758,0.00003231134],"genre_scores_gemma":[0.99269754,0.0057012658,0.0009734229,0.00038188626,0.00003299978,0.00019174973,6.638989e-7,0.000009603601,0.0000108679005],"study_design_codex":"qualitative","study_design_gemma":"systematic_review","domain_scores_codex":[0.9983814,0.0003644587,0.000322703,0.00039950773,0.00030478695,0.00022715806],"domain_scores_gemma":[0.9962209,0.0025718505,0.00018727157,0.00052402995,0.00041795737,0.00007800327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011501621,0.0001712486,0.0002756343,0.00013770121,0.00015723222,0.00014881867,0.0002521709,0.00007404208,7.480516e-7],"category_scores_gemma":[0.006758199,0.00010923892,0.000018073206,0.0012842661,0.00011220162,0.00092326215,0.0001966245,0.00024802107,0.0000032246205],"study_design_candidate":"systematic_review","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.0007323656,0.0009083542,0.014738202,0.33771265,0.000431485,0.00023495943,0.5653021,0.000064076805,0.021415671,0.035884295,0.0002492755,0.0223266],"study_design_scores_gemma":[0.0042026234,0.0061127865,0.043359686,0.70683163,0.00026043205,0.0078054206,0.07429756,0.12733522,0.018594055,0.001124859,0.006609067,0.0034666266],"about_ca_topic_score_codex":0.00009395086,"about_ca_topic_score_gemma":0.000014026604,"teacher_disagreement_score":0.506029,"about_ca_system_score_codex":0.000051355328,"about_ca_system_score_gemma":0.000036072743,"threshold_uncertainty_score":0.8090684},"labels":[],"label_agreement":null},{"id":"W2901051931","doi":"10.1002/spe.2668","title":"Cloud‐aided online EEG classification system for brain healthcare: A case study of depression evaluation with a lightweight CNN","year":2018,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","cited_by":85,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"National Natural Science Foundation of China","keywords":"Computer science; Convolutional neural network; Cloud computing; Electroencephalography; Artificial intelligence; Classifier (UML); Deep learning; Brain–computer interface; Machine learning; Pattern recognition (psychology); Medicine; Operating system","score_opus":0.08535133327897979,"score_gpt":0.39370193943768994,"score_spread":0.3083506061587101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901051931","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98692393,0.00011698015,0.01012594,0.00097589096,0.00033916693,0.0013712207,0.000013110966,0.00010452591,0.000029212586],"genre_scores_gemma":[0.99444497,0.000007636388,0.004568196,0.000500678,0.00014895,0.00028684837,0.0000030726146,0.000016787048,0.000022882328],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99779564,0.000496039,0.00036984903,0.0006476652,0.00046854292,0.00022226913],"domain_scores_gemma":[0.9972337,0.0012859245,0.00044276798,0.00040267082,0.00053504045,0.00009989843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006531543,0.00016588026,0.00020582165,0.00008195367,0.00043125098,0.00008974035,0.00018661363,0.00006649042,0.0000041697986],"category_scores_gemma":[0.0022310754,0.00012281717,0.0000220353,0.0003043642,0.00015293916,0.00083060714,0.000072489085,0.00011857678,0.0000022866566],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006663848,0.0063652345,0.011933615,0.0012001889,0.00010039533,0.00067727116,0.53535163,0.00005737902,0.25683823,0.0013034227,0.0013847138,0.1781241],"study_design_scores_gemma":[0.007831083,0.0175452,0.002267409,0.0010269005,0.00030514755,0.010210474,0.5756461,0.031085124,0.346561,0.0001240171,0.006366915,0.0010306457],"about_ca_topic_score_codex":0.0003532946,"about_ca_topic_score_gemma":0.00021901287,"teacher_disagreement_score":0.17709345,"about_ca_system_score_codex":0.00005517726,"about_ca_system_score_gemma":0.00010566413,"threshold_uncertainty_score":0.5008339},"labels":[],"label_agreement":null},{"id":"W2905833213","doi":"10.1002/spe.2674","title":"Generic input template for cloud simulators: A case study of CloudSim","year":2018,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cloud computing; Software portability; Computer science; Interoperability; CloudSim; Cloud testing; Provisioning; Distributed computing; Orchestration; Service provider; Cloud computing security; Cloud management; Software deployment; Service (business); Software engineering; Operating system","score_opus":0.03160463196324759,"score_gpt":0.31930235934950624,"score_spread":0.28769772738625865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905833213","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8048131,0.00014302778,0.19388187,0.00014756792,0.0004330822,0.00038509272,7.042382e-7,0.00013303781,0.000062541774],"genre_scores_gemma":[0.9508233,0.0000042626684,0.04838442,0.00041116876,0.0002514445,0.000048077025,1.8125525e-7,0.000011180042,0.0000659329],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847245,0.00010473563,0.0003228627,0.00054565666,0.000257974,0.00029633738],"domain_scores_gemma":[0.9979651,0.0007731589,0.00025055165,0.00065678573,0.00024776548,0.00010663153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004692229,0.00016717335,0.00020562227,0.00008087954,0.00044086037,0.00014285263,0.00048907776,0.00004724011,0.0000027344984],"category_scores_gemma":[0.00062823755,0.0001462056,0.000041933075,0.0004286355,0.00012623922,0.00017330749,0.0006104461,0.00009183166,0.0000050141057],"study_design_candidate":"qualitative","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.00037655947,0.003121407,0.008095681,0.0002335975,0.00033924312,0.0025364575,0.64893526,0.0037008878,0.0002329898,0.002363157,0.0026812002,0.32738355],"study_design_scores_gemma":[0.008362923,0.016955677,0.00082826155,0.00024165455,0.00035358247,0.008493591,0.3503011,0.35891432,0.002717371,0.001900006,0.24838272,0.0025487992],"about_ca_topic_score_codex":0.00046516693,"about_ca_topic_score_gemma":0.000020076728,"teacher_disagreement_score":0.35521343,"about_ca_system_score_codex":0.000018074357,"about_ca_system_score_gemma":0.000032851487,"threshold_uncertainty_score":0.5962091},"labels":[],"label_agreement":null},{"id":"W2912170833","doi":"10.1002/spe.404","title":"Exploiting exceptions","year":2001,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Testing and Debugging Techniques","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":"University of Victoria","funders":"Purdue University","keywords":"Bytecode; Java bytecode; Programming language; Computer science; Java; Compiler; Program optimization; Interpretation (philosophy); Optimizing compiler; Abstract interpretation; Code (set theory); Parallel computing; Operating system; Real time Java; Java annotation","score_opus":0.0296799226284058,"score_gpt":0.3130142890524758,"score_spread":0.28333436642407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912170833","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.03965839,0.00041815458,0.94804335,0.0015041701,0.0001645771,0.00008398152,3.612181e-7,0.008549576,0.0015774434],"genre_scores_gemma":[0.50022733,0.00021789937,0.49787244,0.0014528646,0.000059524544,0.00005902252,6.225186e-7,0.000008099753,0.00010217152],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988419,0.00006157955,0.00017399428,0.00040795506,0.00022406454,0.0002905379],"domain_scores_gemma":[0.998227,0.00093529146,0.00010187521,0.00048863504,0.00012633893,0.00012087117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002925327,0.00013036616,0.00010832066,0.0000761412,0.00038114426,0.00029287656,0.00044303734,0.000051700044,0.000014653188],"category_scores_gemma":[0.0036713248,0.00012613609,0.00002805906,0.00040141947,0.00008657051,0.0022892854,0.00028057833,0.00015699,0.000040530416],"study_design_candidate":"design_other","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.000025748905,0.00023628867,0.059762217,0.000022433005,0.000018454683,0.00039611038,0.037939817,0.000010509576,0.00037951284,0.016181054,0.009686286,0.8753416],"study_design_scores_gemma":[0.0014945337,0.0010919143,0.025198162,0.00062903576,0.000074179996,0.013762647,0.00969374,0.01321818,0.00276754,0.22400874,0.7044832,0.0035781001],"about_ca_topic_score_codex":0.000117321026,"about_ca_topic_score_gemma":0.0000012380984,"teacher_disagreement_score":0.87176347,"about_ca_system_score_codex":0.000020869233,"about_ca_system_score_gemma":0.000035294728,"threshold_uncertainty_score":0.51436806},"labels":[],"label_agreement":null},{"id":"W2912431218","doi":"10.1002/spe.2689","title":"Faster remainder by direct computation: Applications to compilers and software libraries","year":2019,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":20,"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 New Brunswick; Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Remainder; Divisibility rule; Divisor (algebraic geometry); Multiplication (music); Mathematics; Integer (computer science); Arithmetic; Inverse; Greatest common divisor; Quotient; Multiple; Division (mathematics); Compiler; Subtraction; Discrete mathematics; Computer science; Combinatorics","score_opus":0.016278115832119504,"score_gpt":0.3049469259117814,"score_spread":0.2886688100796619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912431218","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.0047321743,0.00087184797,0.9906708,0.0024422428,0.0001680074,0.0003671313,0.0000065908052,0.00021612053,0.00052509806],"genre_scores_gemma":[0.03261565,0.00006919668,0.96197915,0.00482786,0.0000422518,0.0001282301,0.000003900023,0.000012998357,0.0003207442],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985994,0.000109067994,0.00019175826,0.0005990875,0.00024217839,0.00025849117],"domain_scores_gemma":[0.9980633,0.0011816918,0.000100085286,0.00033669945,0.00009274816,0.0002254341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019231885,0.0001617491,0.00020022568,0.000048791655,0.00024252535,0.000496841,0.00032348756,0.000053472046,0.000015898358],"category_scores_gemma":[0.00031797646,0.00014467789,0.00002283233,0.00040133175,0.00010644725,0.001981673,0.0003770775,0.00013587988,0.000055923512],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003795625,0.00013432781,0.006694104,0.000060335093,0.000031038497,0.000009692013,0.016421473,0.000048212685,0.00045382656,0.004610007,0.0031538308,0.9683452],"study_design_scores_gemma":[0.0007597438,0.0005484813,0.0034718954,0.00008937857,0.00002553693,0.00016328893,0.007222766,0.0038639999,0.0012615991,0.006716427,0.97473174,0.0011451581],"about_ca_topic_score_codex":0.000025139147,"about_ca_topic_score_gemma":3.585391e-7,"teacher_disagreement_score":0.9715779,"about_ca_system_score_codex":0.000013217361,"about_ca_system_score_gemma":0.000034310662,"threshold_uncertainty_score":0.5899793},"labels":[],"label_agreement":null},{"id":"W2916588339","doi":"10.1002/spe.2683","title":"Micro‐ and macro‐optimizations of S<scp>aa</scp>T search","year":2019,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Information Retrieval and Search Behavior","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Macro; Computer science; Search engine; Parallel computing; Baseline (sea); Programming language; Information retrieval","score_opus":0.014912944305161342,"score_gpt":0.28949614186202943,"score_spread":0.2745831975568681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916588339","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8470588,0.00033660617,0.150667,0.00041134426,0.00013696255,0.00025174324,0.000006362622,0.00007847453,0.0010527372],"genre_scores_gemma":[0.81945956,0.00050948845,0.17820832,0.00071174325,0.000016515878,0.000019644218,0.000004594225,0.0000080394575,0.0010620843],"study_design_codex":"qualitative","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99896187,0.00005517266,0.00020120395,0.00023676526,0.00031374433,0.00023127162],"domain_scores_gemma":[0.99862325,0.0005884414,0.000097174714,0.00029672752,0.00027965076,0.00011474313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029750296,0.00009440748,0.000120788245,0.000089535264,0.00015365951,0.00019673463,0.00030539662,0.000053653257,0.000019418632],"category_scores_gemma":[0.0006358149,0.00008411767,0.000021530741,0.00036609525,0.000121905796,0.002526377,0.00031452623,0.00014579155,0.00004827175],"study_design_candidate":"qualitative","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.000109041786,0.0007714608,0.1716637,0.0007259941,0.00010138084,0.00008472487,0.5281843,0.00065177155,0.044037055,0.068474956,0.0020645629,0.18313105],"study_design_scores_gemma":[0.007429643,0.0036513235,0.13736582,0.0005317332,0.00014186809,0.0023308834,0.16621043,0.07570778,0.3457441,0.0020896415,0.25689662,0.0019001582],"about_ca_topic_score_codex":0.000050403578,"about_ca_topic_score_gemma":5.729264e-7,"teacher_disagreement_score":0.36197388,"about_ca_system_score_codex":0.000011267555,"about_ca_system_score_gemma":0.00008162304,"threshold_uncertainty_score":0.3430219},"labels":[],"label_agreement":null},{"id":"W2940449632","doi":"10.1002/spe.2695","title":"Developing applications in large scale, dynamic fog computing: A case study","year":2019,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Horizon 2020 Framework Programme; National Natural Science Foundation of China","keywords":"Computer science; Scalability; Distributed computing; Edge computing; Context (archaeology); Key (lock); Enhanced Data Rates for GSM Evolution; Scale (ratio); Class (philosophy); Cloud computing; Edge device; Node (physics); Computer security; Operating system; Telecommunications; Engineering; Artificial intelligence","score_opus":0.016475729029714635,"score_gpt":0.3292993104882954,"score_spread":0.3128235814585808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940449632","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5852612,0.00013378452,0.4132833,0.00014481595,0.00057484297,0.00038825345,9.576981e-8,0.0001250132,0.00008869611],"genre_scores_gemma":[0.89834565,0.000009030143,0.10112565,0.00036703981,0.00007266294,0.00004135787,0.000001077408,0.000009752542,0.000027809563],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.99829966,0.00011206386,0.00030377426,0.0006379504,0.00021854967,0.00042799648],"domain_scores_gemma":[0.99849945,0.0006521109,0.00014676423,0.00050845393,0.00010680562,0.000086436885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056354766,0.00017321263,0.00019909389,0.000130614,0.00037171316,0.00027217815,0.00047862402,0.000054317334,0.0000013151632],"category_scores_gemma":[0.00018468255,0.00017054213,0.000025333278,0.00076131977,0.000031581258,0.0013111793,0.00068435655,0.0002465197,0.000039268536],"study_design_candidate":"qualitative","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.000020663321,0.0009977228,0.48640093,0.00010112461,0.000029660272,0.0016131916,0.40918344,0.00006782839,0.000056848367,0.0016311741,0.00005953643,0.099837884],"study_design_scores_gemma":[0.0055279587,0.0009701898,0.10990745,0.00042583758,0.00006294106,0.014407804,0.55676067,0.23885328,0.00021210054,0.0020091878,0.06735883,0.0035037484],"about_ca_topic_score_codex":0.00021509113,"about_ca_topic_score_gemma":0.00004668848,"teacher_disagreement_score":0.37649345,"about_ca_system_score_codex":0.00007456008,"about_ca_system_score_gemma":0.00010604753,"threshold_uncertainty_score":0.6954506},"labels":[],"label_agreement":null},{"id":"W2949366051","doi":"10.1002/spe.2402","title":"Consistently faster and smaller compressed bitmaps with Roaring","year":2016,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint John Regional Hospital; Université TÉLUQ","funders":"","keywords":"Bitmap; Uncompressed video; Computer science; SPARK (programming language); Computer graphics (images); Data compression; Compression (physics); Algorithm; Artificial intelligence; Materials science","score_opus":0.014158067012897405,"score_gpt":0.2441551405037744,"score_spread":0.229997073490877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949366051","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.08740807,0.00067125267,0.9092236,0.0018107641,0.00013550061,0.00012972698,0.0000037981235,0.00015944317,0.00045783276],"genre_scores_gemma":[0.77522993,0.0002921013,0.22301601,0.001117028,0.000041607036,0.0000355177,0.0000010380799,0.000011268092,0.0002555307],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99885947,0.00005156523,0.00013905446,0.00048755578,0.00022357621,0.00023878874],"domain_scores_gemma":[0.9987291,0.00048977137,0.00010447436,0.00043599313,0.000098500175,0.00014212416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012479252,0.00014519814,0.00013551065,0.000040603805,0.0002285928,0.00028198483,0.00029865687,0.000042965326,0.000015743717],"category_scores_gemma":[0.00017178936,0.00008377754,0.000012291835,0.00009216792,0.00017967762,0.0030277215,0.0005230812,0.00008301019,0.000015284],"study_design_candidate":"design_other","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.00034248197,0.00024649664,0.025091697,0.000070514136,0.00008047413,0.00034311847,0.021541502,0.0000069320254,0.007326062,0.0110433195,0.0013442679,0.9325631],"study_design_scores_gemma":[0.009968213,0.0021864923,0.05568221,0.0018018471,0.0001282525,0.004508471,0.011992935,0.010420825,0.017470222,0.0030520728,0.87908345,0.0037050343],"about_ca_topic_score_codex":0.000054813514,"about_ca_topic_score_gemma":0.0000042903607,"teacher_disagreement_score":0.9288581,"about_ca_system_score_codex":0.000009439547,"about_ca_system_score_gemma":0.00003179856,"threshold_uncertainty_score":0.34163487},"labels":[],"label_agreement":null},{"id":"W2951870329","doi":"10.1002/spe.2326","title":"SIMD compression and the intersection of sorted integers","year":2015,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":66,"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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"SIMD; Intersection (aeronautics); Integer (computer science); Data compression; Compression (physics); Scheme (mathematics); Speedup; Compression ratio","score_opus":0.021093375553375936,"score_gpt":0.28754013740270334,"score_spread":0.2664467618493274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951870329","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.06854603,0.0011314678,0.92811316,0.0007395137,0.00042101374,0.00015269195,0.0000014010667,0.00008352719,0.00081120356],"genre_scores_gemma":[0.9523371,0.000117910815,0.047103085,0.00036730798,0.000026247619,0.000014871735,0.0000014076792,0.0000036049707,0.000028501076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914193,0.00012838347,0.00016216865,0.00023711103,0.00022025063,0.0001101486],"domain_scores_gemma":[0.99881405,0.00048244404,0.00015561153,0.0003170364,0.00014279854,0.00008807012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041512042,0.00008624544,0.00012284207,0.000026814505,0.0001279525,0.00011492101,0.00030029187,0.000037264464,0.000001959233],"category_scores_gemma":[0.0010037044,0.000052564723,0.000016499589,0.00015171549,0.00026459503,0.001794039,0.0004993422,0.00012619405,0.0000020982907],"study_design_candidate":"design_other","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.0015193453,0.00028239258,0.0025148485,0.00006377354,0.000061217004,0.000027821057,0.19634849,0.00009675163,0.0016397627,0.04918894,0.005674932,0.7425817],"study_design_scores_gemma":[0.015149408,0.0020993,0.005561611,0.0009158105,0.00015068367,0.0016583685,0.15493432,0.5090496,0.015624195,0.03787835,0.25523832,0.0017400576],"about_ca_topic_score_codex":0.00038337626,"about_ca_topic_score_gemma":0.0000032063192,"teacher_disagreement_score":0.883791,"about_ca_system_score_codex":0.000012015096,"about_ca_system_score_gemma":0.00003707149,"threshold_uncertainty_score":0.21435273},"labels":[],"label_agreement":null},{"id":"W2952658091","doi":"10.1002/spe.2289","title":"Compressed bitmap indexes: beyond unions and intersections","year":2014,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bitmap; Computer science; Computer graphics (images)","score_opus":0.009517417444694493,"score_gpt":0.2661045583367833,"score_spread":0.25658714089208884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952658091","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.02804389,0.00048796038,0.96853966,0.0014923051,0.0003808852,0.000096456584,0.0000042910647,0.0002072547,0.00074732717],"genre_scores_gemma":[0.83897746,0.00027921316,0.1585213,0.0019566081,0.00010912492,0.00004126662,0.000005732312,0.000009871101,0.00009941827],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989236,0.000099259196,0.0001559954,0.0004306794,0.00018293019,0.00020752825],"domain_scores_gemma":[0.998584,0.0006115767,0.000096220945,0.00046433453,0.000087887805,0.00015603648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020177831,0.00013131324,0.00012621155,0.000073080046,0.00046070677,0.00033408974,0.0003627697,0.000057852827,0.000010266611],"category_scores_gemma":[0.00047004272,0.000114381146,0.000015106639,0.00022019015,0.00015117931,0.00260086,0.0005972032,0.00018117989,0.0000118109],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007663436,0.00048539275,0.005971269,0.00008320459,0.00006326827,0.000049091883,0.06840532,0.000085591346,0.0029552272,0.091569915,0.007651642,0.82260346],"study_design_scores_gemma":[0.0011934311,0.0006397948,0.0074144397,0.00016175234,0.000038461025,0.0006565494,0.007634459,0.06170084,0.0014708826,0.010886326,0.90723497,0.00096812565],"about_ca_topic_score_codex":0.00021057419,"about_ca_topic_score_gemma":0.000008349101,"teacher_disagreement_score":0.8995833,"about_ca_system_score_codex":0.000009805948,"about_ca_system_score_gemma":0.000023408098,"threshold_uncertainty_score":0.46643278},"labels":[],"label_agreement":null},{"id":"W2971398112","doi":"10.1002/spe.2746","title":"Fast and flexible tracepoints in x86","year":2019,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","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":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Google","keywords":"Thread (computing); Computer science; Jump; Tracing; x86; Parallel computing; Offset (computer science); Operating system; Embedded system; Software","score_opus":0.01072286284567254,"score_gpt":0.28202385039854405,"score_spread":0.2713009875528715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971398112","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.16509615,0.00073355617,0.8302179,0.0008866205,0.00013348028,0.00016799303,3.355096e-7,0.00037924064,0.002384708],"genre_scores_gemma":[0.5968839,0.00029475093,0.40169153,0.00079742906,0.000011102775,0.000014810908,4.4849367e-7,0.0000052090763,0.000300819],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913365,0.000055532153,0.00014404324,0.00035531478,0.00013260043,0.00017884687],"domain_scores_gemma":[0.9993209,0.00023943672,0.00007379994,0.00025807507,0.000046346184,0.00006144401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024760384,0.00009309215,0.000111556044,0.000076869,0.00007311889,0.00017987989,0.00023303625,0.000047505393,0.000008810482],"category_scores_gemma":[0.0002886168,0.00008950191,0.000010853755,0.00024781827,0.00004293107,0.0015364945,0.00020446957,0.00012393162,0.000019523777],"study_design_candidate":"design_other","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.00014789414,0.000489077,0.11246689,0.00016184652,0.000025424848,0.00014262879,0.1829677,0.0033350785,0.0012737057,0.035127684,0.0013452468,0.66251683],"study_design_scores_gemma":[0.006355665,0.0022902132,0.079586655,0.0010595054,0.000034025772,0.0024607647,0.035616234,0.6432184,0.026104128,0.023480328,0.17503297,0.0047611073],"about_ca_topic_score_codex":0.000052814692,"about_ca_topic_score_gemma":0.0000016741874,"teacher_disagreement_score":0.65775573,"about_ca_system_score_codex":0.000012369739,"about_ca_system_score_gemma":0.000028050887,"threshold_uncertainty_score":0.3649782},"labels":[],"label_agreement":null},{"id":"W2974083459","doi":"10.1002/spe.960","title":"A survey of practical algorithms for suffix tree construction in external memory","year":2010,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Suffix; Suffix tree; Computer science; Auxiliary memory; Scalability; Generalized suffix tree; Trie; Algorithm; Tree (set theory); Theoretical computer science; Data structure; Mathematics; Programming language; Database; Operating system","score_opus":0.03567803922419386,"score_gpt":0.34467880862528155,"score_spread":0.30900076940108767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974083459","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.111697555,0.00017534333,0.8868242,0.0002812772,0.0006891752,0.00020285272,0.000015119716,0.000046550835,0.000067926456],"genre_scores_gemma":[0.19625491,0.00004901866,0.80347025,0.00010319691,0.00005044994,0.000047244583,0.000005472527,0.000006283576,0.000013186556],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9986665,0.00011563532,0.00030031224,0.00042500647,0.00026154637,0.00023095512],"domain_scores_gemma":[0.9971451,0.0018306919,0.00023168135,0.00042567035,0.00026331565,0.00010355214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089397206,0.00012377699,0.000185296,0.00008049595,0.00010902864,0.000121342186,0.00034599126,0.00009730403,0.000010431975],"category_scores_gemma":[0.004481739,0.00011074139,0.000025916415,0.00026096465,0.00018370194,0.002734543,0.00024434252,0.0002801152,0.0000022879713],"study_design_candidate":"design_other","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.0003400828,0.00053451787,0.021203835,0.000050960298,0.000015068236,0.000059777525,0.008160448,0.0000081355565,0.005809449,0.011915168,0.0003295981,0.95157295],"study_design_scores_gemma":[0.010196981,0.0026221238,0.5381816,0.00048241534,0.000091395326,0.0047926903,0.013262011,0.3279763,0.045154296,0.016050326,0.038074646,0.0031152265],"about_ca_topic_score_codex":0.00096908014,"about_ca_topic_score_gemma":0.00018955728,"teacher_disagreement_score":0.9484577,"about_ca_system_score_codex":0.000010280616,"about_ca_system_score_gemma":0.0001517033,"threshold_uncertainty_score":0.53653836},"labels":[],"label_agreement":null},{"id":"W2990393348","doi":"10.1002/spe.2777","title":"Base64 encoding and decoding at almost the speed of a memory copy","year":2019,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; SIMD; JSON; Encoding (memory); Executable; ENCODE; Porting; Decoding methods; XML; Parallel computing; Operating system; Programming language; Artificial intelligence; Software","score_opus":0.01497585577914075,"score_gpt":0.2824211651749347,"score_spread":0.267445309395794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990393348","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52702415,0.0013548014,0.4664929,0.0011785951,0.00022698625,0.00027044158,9.917391e-7,0.00025420674,0.0031969424],"genre_scores_gemma":[0.84239364,0.00034560668,0.15631709,0.0007273645,0.000014714658,0.000005104642,4.4759958e-7,0.000005076129,0.0001909956],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991006,0.000086345935,0.00017278185,0.00029530676,0.00018421857,0.00016070451],"domain_scores_gemma":[0.9983941,0.0009369908,0.00017646351,0.00034895685,0.000089557354,0.000053949272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044248425,0.00009874138,0.00012676438,0.00004181104,0.0002296476,0.000113719165,0.000346304,0.000038590937,0.000014923076],"category_scores_gemma":[0.00060232816,0.000074771604,0.000020320034,0.00019594983,0.0000978365,0.0008468899,0.0004532215,0.00009768621,0.0000073146934],"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.0005836294,0.0004940043,0.19161265,0.00058606704,0.0001928364,0.00014661954,0.42551687,0.0044643693,0.037373174,0.043340806,0.007891519,0.28779745],"study_design_scores_gemma":[0.0036243694,0.0015936724,0.009087757,0.0010312706,0.00011782234,0.0025400564,0.035236094,0.60549027,0.25354457,0.0035324378,0.081277445,0.0029242213],"about_ca_topic_score_codex":0.000048741036,"about_ca_topic_score_gemma":0.0000011431681,"teacher_disagreement_score":0.60102594,"about_ca_system_score_codex":0.00001670209,"about_ca_system_score_gemma":0.000029921268,"threshold_uncertainty_score":0.30490977},"labels":[],"label_agreement":null},{"id":"W3018182837","doi":"10.1002/spe.2831","title":"Designing real‐time systems using imprecise discrete‐event system specifications","year":2020,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; DEVS; Scalability; Set (abstract data type); Event (particle physics); Transient (computer programming); Formal methods; Distributed computing; Software; Formal verification; Theoretical computer science; Programming language; Modeling and simulation; Simulation","score_opus":0.053565307091369786,"score_gpt":0.2985414029193482,"score_spread":0.24497609582797844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3018182837","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.024955587,0.00084469985,0.9712015,0.00054742175,0.00041684927,0.00051927596,0.0000037101554,0.00068364776,0.0008273527],"genre_scores_gemma":[0.72398466,0.00006201431,0.27550375,0.000089863825,0.0002198459,0.000074900876,0.000002074614,0.000024549381,0.000038326474],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715036,0.00038418168,0.0006097546,0.0008647105,0.0005433745,0.000447629],"domain_scores_gemma":[0.99738586,0.00073321443,0.00049990625,0.0007387009,0.00023670065,0.0004056027],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065388676,0.00026663896,0.00035589474,0.00007321194,0.000525784,0.0010363526,0.0008197215,0.000100844096,0.0000054593643],"category_scores_gemma":[0.0010093384,0.00025400217,0.000066635585,0.00062659377,0.00007703972,0.003928614,0.00037381685,0.00021061447,0.00014494275],"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.0003316812,0.00036973957,0.004035615,0.0022430762,0.00042616823,0.0013945706,0.3911473,0.033617456,0.48338467,0.057267275,0.0014012211,0.024381237],"study_design_scores_gemma":[0.0007888415,0.0003185003,0.00024525865,0.0010074622,0.00011983013,0.0018362295,0.083426714,0.89500767,0.008031091,0.00004539395,0.007632558,0.0015404756],"about_ca_topic_score_codex":0.0004788423,"about_ca_topic_score_gemma":3.939628e-7,"teacher_disagreement_score":0.8613902,"about_ca_system_score_codex":0.00014869422,"about_ca_system_score_gemma":0.00015698645,"threshold_uncertainty_score":0.99999124},"labels":[],"label_agreement":null},{"id":"W3019290077","doi":"10.1002/spe.2830","title":"Vocabulary and time based bug‐assignment: A recommender system for open‐source projects","year":2020,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Engineering Research","field":"Computer Science","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":"University of Alberta","funders":"","keywords":"Computer science; Vocabulary; Relevance (law); Key (lock); Intuition; Ranking (information retrieval); Task (project management); Information retrieval; World Wide Web; Software engineering; Data science; Artificial intelligence; Computer security","score_opus":0.04127924435912676,"score_gpt":0.30250029074955476,"score_spread":0.261221046390428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3019290077","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.005607028,0.00069526915,0.98584694,0.006091512,0.00011216641,0.00095980463,0.000005486361,0.00059488387,0.000086895176],"genre_scores_gemma":[0.6911525,0.00002803571,0.30436918,0.0035523558,0.000091507514,0.00064970093,0.0000050945905,0.000040966326,0.00011066242],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981882,0.00012056751,0.0002120602,0.0007500784,0.00032896682,0.00040010372],"domain_scores_gemma":[0.99623334,0.0028011943,0.000103372106,0.00041817417,0.00012857991,0.00031532542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055950537,0.00019894677,0.00022971962,0.000058768637,0.00028787076,0.00077425357,0.0009036683,0.00007637758,0.000007771581],"category_scores_gemma":[0.0043749996,0.00019001137,0.000028674605,0.00037237536,0.00006582585,0.0019408002,0.0008386298,0.00019411667,0.000021273001],"study_design_candidate":"design_other","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.003232702,0.0013217309,0.033807818,0.0069915554,0.0006141723,0.001130995,0.30570078,0.0016401189,0.011116546,0.008586024,0.06020015,0.56565744],"study_design_scores_gemma":[0.0069488855,0.0034512368,0.0013418962,0.00079739926,0.000105960804,0.00075624057,0.015362866,0.5002657,0.01648173,0.0001604693,0.45165196,0.0026756623],"about_ca_topic_score_codex":0.000037378555,"about_ca_topic_score_gemma":2.036917e-7,"teacher_disagreement_score":0.68554544,"about_ca_system_score_codex":0.000056261288,"about_ca_system_score_gemma":0.00014864166,"threshold_uncertainty_score":0.7748439},"labels":[],"label_agreement":null},{"id":"W3030953462","doi":"10.1002/spe.2853","title":"<scp>Senti‐eSystem</scp>: A sentiment‐based <scp>eSystem</scp>‐using hybridized fuzzy and deep neural network for measuring customer satisfaction","year":2020,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":81,"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 Northern British Columbia","funders":"","keywords":"Customer satisfaction; Computer science; Artificial neural network; Fuzzy logic; Lexicon; Artificial intelligence; Polarity (international relations); Sentiment analysis; Data mining; Business; Marketing; Chemistry","score_opus":0.04259811995502385,"score_gpt":0.28623527109359637,"score_spread":0.2436371511385725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030953462","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.39657953,0.003713073,0.5971497,0.0004211036,0.0009169,0.00071285065,0.00000514141,0.00034250919,0.00015913462],"genre_scores_gemma":[0.87462765,0.00010178615,0.12326428,0.0013624005,0.00042605112,0.00011428055,0.000010368378,0.00003957011,0.000053631822],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648005,0.00033360484,0.0006671797,0.0011021813,0.00068617443,0.00073084165],"domain_scores_gemma":[0.9961145,0.002051567,0.00070576393,0.00044520202,0.00027634003,0.00040662652],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00076758873,0.0004061544,0.00055596506,0.00014608142,0.0008819731,0.0010939768,0.0003995331,0.00011469494,0.0000036435933],"category_scores_gemma":[0.001884946,0.00040293537,0.00017354771,0.00080823526,0.000091586255,0.0027081654,0.00031590907,0.00024212303,0.000017704173],"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.00046809737,0.000818388,0.46553436,0.004469183,0.0030073496,0.000742414,0.2574701,0.050400425,0.058881763,0.005444749,0.018529579,0.1342336],"study_design_scores_gemma":[0.0033532341,0.0003320529,0.0033368922,0.00041898098,0.00052344747,0.00027395145,0.025438504,0.9189835,0.0061422638,0.00011967955,0.04056256,0.00051488844],"about_ca_topic_score_codex":0.00010622963,"about_ca_topic_score_gemma":0.000010474217,"teacher_disagreement_score":0.86858314,"about_ca_system_score_codex":0.00006287486,"about_ca_system_score_gemma":0.00007407186,"threshold_uncertainty_score":0.99994296},"labels":[],"label_agreement":null},{"id":"W3036156748","doi":"10.1002/spe.2847","title":"Service offloading oriented edge server placement in smart farming","year":2020,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Service (business); Automation; Enhanced Data Rates for GSM Evolution; Server; Agriculture; Edge computing; Distributed computing; Computer network; Telecommunications; Engineering; Business","score_opus":0.027791462395549887,"score_gpt":0.2791383117747547,"score_spread":0.2513468493792048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036156748","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6790616,0.00065843604,0.30536908,0.009517651,0.003668265,0.000309541,2.9247144e-7,0.0004593348,0.00095581624],"genre_scores_gemma":[0.83860654,0.00009286311,0.13274957,0.02736249,0.0009866456,0.00006310358,0.0000049867617,0.00003425635,0.0000995412],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.99823195,0.00009777837,0.00030670874,0.0006137535,0.00030785947,0.0004419528],"domain_scores_gemma":[0.9988867,0.00034050606,0.00013877648,0.00030005918,0.00013027793,0.0002036986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003456113,0.00019153103,0.0001900594,0.00006692795,0.00024704615,0.00024196124,0.0005234769,0.00006301128,0.000008556292],"category_scores_gemma":[0.00087079057,0.00019606049,0.000027899358,0.0009481658,0.000030533196,0.0022973435,0.00073219126,0.00027797744,0.000088043584],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040352167,0.0005020217,0.07271594,0.0005542,0.0000832049,0.00088301103,0.76351917,0.00041865552,0.004117493,0.0029194804,0.010780613,0.14310268],"study_design_scores_gemma":[0.002807964,0.00052446045,0.005527584,0.0004836283,0.000037924423,0.0002820362,0.0339329,0.12894332,0.0068109445,0.00026060504,0.8184946,0.0018939967],"about_ca_topic_score_codex":0.0002171976,"about_ca_topic_score_gemma":0.0000073459637,"teacher_disagreement_score":0.80771405,"about_ca_system_score_codex":0.000051612344,"about_ca_system_score_gemma":0.00008419598,"threshold_uncertainty_score":0.79951143},"labels":[],"label_agreement":null},{"id":"W3083808844","doi":"10.1002/spe.2890","title":"<scp>HEART</scp>: Unrelated parallel machines problem with precedence constraints for task scheduling in cloud computing using heuristic and <scp>meta‐heuristic</scp> algorithms","year":2020,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Job shop scheduling; Cloud computing; Scheduling (production processes); Mathematical optimization; Integer programming; Distributed computing; Minification; Algorithm; Heuristic; Mathematics; Schedule; Artificial intelligence","score_opus":0.03263300013686179,"score_gpt":0.2857722644351643,"score_spread":0.2531392642983025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083808844","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.3041791,0.0016881733,0.6924144,0.0005576597,0.00014174903,0.0006374326,0.000004947714,0.0002709726,0.00010558034],"genre_scores_gemma":[0.5598952,0.00003999545,0.43904465,0.0008221604,0.00010564962,0.000036151574,0.0000023890136,0.000025911895,0.000027871136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967093,0.0002537288,0.00057897315,0.0012324303,0.0004605021,0.00076505356],"domain_scores_gemma":[0.9945148,0.0041071614,0.00045033274,0.0003693492,0.00021155148,0.00034679667],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000819316,0.00045083594,0.00057641184,0.00012249657,0.00063626654,0.00066294335,0.0006009263,0.00012727406,8.44835e-7],"category_scores_gemma":[0.0042905933,0.00038867226,0.00007560784,0.00076856423,0.0003887056,0.00039439418,0.0007353754,0.00052520254,0.0000037777004],"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.00013940095,0.0009766559,0.032305315,0.002319379,0.0013980157,0.0010140844,0.26913568,0.5959236,0.0011393074,0.0071949335,0.0007920616,0.08766154],"study_design_scores_gemma":[0.0012550034,0.00045521246,0.00060666935,0.00033378156,0.00023241922,0.00042877696,0.0076614036,0.984535,0.000087240565,0.0005244161,0.0036590751,0.00022100992],"about_ca_topic_score_codex":0.0001458141,"about_ca_topic_score_gemma":0.0000039840615,"teacher_disagreement_score":0.38861138,"about_ca_system_score_codex":0.000038302787,"about_ca_system_score_gemma":0.00011577865,"threshold_uncertainty_score":0.99985653},"labels":[],"label_agreement":null},{"id":"W3083878797","doi":"10.1002/spe.2889","title":"Performance analysis of distributed storage clusters based on kernel and userspace traces","year":2020,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Advanced Data Storage Technologies","field":"Computer Science","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":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Tracing; Distributed computing; Scalability; Debugging; Replication (statistics); Queue; Parallel computing; Operating system; Computer network","score_opus":0.018964038167925034,"score_gpt":0.2719575905685418,"score_spread":0.2529935524006168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083878797","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.36010262,0.00019312584,0.6364654,0.0028477467,0.000027885862,0.000082308594,0.000035402856,0.00022791709,0.000017613247],"genre_scores_gemma":[0.9014912,0.00015731674,0.09736506,0.0009473647,0.0000053025847,0.000015055069,0.000010697724,0.0000052798937,0.000002674398],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876004,0.00005054501,0.00018597046,0.0005196882,0.0002818809,0.00020187342],"domain_scores_gemma":[0.9984627,0.0006157667,0.00023243205,0.00049982534,0.00008025216,0.000109019405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014503958,0.000158372,0.00025510174,0.00012712841,0.00020154609,0.000075791475,0.00052172615,0.000061996674,0.0000037240734],"category_scores_gemma":[0.001965017,0.00014436168,0.000033910444,0.0012827327,0.00023511892,0.002130505,0.00041797798,0.00017091833,0.0000014276022],"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.0027399547,0.0012542177,0.1726817,0.0010098832,0.0014739537,0.0007147251,0.25891122,0.1716925,0.005846048,0.007996458,0.0019544745,0.37372488],"study_design_scores_gemma":[0.00056696456,0.0007461,0.010394838,0.000044531007,0.00021496539,0.000012680806,0.00949694,0.96811324,0.0034373892,0.000029272911,0.0064482177,0.0004948699],"about_ca_topic_score_codex":0.000023286613,"about_ca_topic_score_gemma":0.0000027199255,"teacher_disagreement_score":0.79642075,"about_ca_system_score_codex":0.000022844133,"about_ca_system_score_gemma":0.00003092694,"threshold_uncertainty_score":0.58868986},"labels":[],"label_agreement":null},{"id":"W3091953753","doi":"10.1002/spe.2920","title":"Validating UTF‐8 in less than one instruction per byte","year":2020,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"National Research Council Canada","keywords":"Byte; Open source; Work (physics); Lazy evaluation","score_opus":0.072257944177949,"score_gpt":0.3111429900828187,"score_spread":0.2388850459048697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091953753","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.45760453,0.00007973061,0.53810394,0.002921761,0.00014311685,0.0001441341,0.0000015527615,0.00013855663,0.0008626601],"genre_scores_gemma":[0.9047755,0.00003865043,0.09310538,0.0019896384,0.000043838198,0.000022939454,0.0000034298967,0.0000056364192,0.000015010852],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99898475,0.00006681809,0.00019771828,0.00034651262,0.00022007184,0.00018414584],"domain_scores_gemma":[0.9994462,0.00014057603,0.00010096767,0.00015385711,0.000064012,0.00009439177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014215316,0.00009396849,0.00009616843,0.00004142273,0.0000944352,0.00039765894,0.00025360446,0.000027832968,0.000010264075],"category_scores_gemma":[0.0005946918,0.00009808482,0.00001420691,0.00036653818,0.000033625696,0.0052957702,0.00018556687,0.00010839851,0.00002166849],"study_design_candidate":"design_other","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.00009312512,0.0001358596,0.019749757,0.00006807372,0.000016111611,0.000041528165,0.16007227,0.000023533788,0.009227283,0.014543162,0.00018300404,0.7958463],"study_design_scores_gemma":[0.014076405,0.0049286727,0.11165316,0.00082280836,0.00012233299,0.0012427301,0.39789638,0.05077393,0.20974252,0.019670924,0.18263626,0.0064338916],"about_ca_topic_score_codex":0.0000995803,"about_ca_topic_score_gemma":0.0000054990874,"teacher_disagreement_score":0.7894124,"about_ca_system_score_codex":0.000021666254,"about_ca_system_score_gemma":0.000037867587,"threshold_uncertainty_score":0.39997828},"labels":[],"label_agreement":null},{"id":"W3092300773","doi":"10.1002/spe.2907","title":"Practical dynamic reconstruction of control flow graphs","year":2020,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Executable; Computer science; Debugging; Spec#; Programming language; Control flow graph; Dataflow; Control flow; Symbolic execution; Static analysis; Machine code; Scripting language; Binary number; Data-flow analysis; Control flow analysis; Code (set theory); Theoretical computer science; Compiler; Data flow diagram; Software; Arithmetic; Programming paradigm; Declarative programming","score_opus":0.01764990418475308,"score_gpt":0.2980036989792894,"score_spread":0.2803537947945363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092300773","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.0034969558,0.00018274094,0.9901022,0.00546424,0.00010911939,0.00010661547,0.0000014101022,0.0003377437,0.0001990043],"genre_scores_gemma":[0.44840202,0.00013858502,0.5503592,0.0010758738,0.000009199887,0.000008195095,4.739911e-7,0.0000033521355,0.0000031246761],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989905,0.00011654067,0.00023122865,0.00032713456,0.00018773877,0.00014690773],"domain_scores_gemma":[0.9988298,0.00045911947,0.00020961805,0.00021531647,0.0001721,0.00011408315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001871524,0.00010087114,0.00015466218,0.00004257677,0.00011051288,0.00008690783,0.00023545901,0.0000579102,0.000007480581],"category_scores_gemma":[0.0020945577,0.00009697256,0.00003436543,0.00031144393,0.00011067259,0.0014936657,0.000101718106,0.00015208792,0.000005067795],"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.0006542108,0.00050286803,0.007968256,0.00022160198,0.00017838743,0.00016658194,0.059275974,0.004458285,0.0032106682,0.05412954,0.00398919,0.86524445],"study_design_scores_gemma":[0.0009101283,0.00060386414,0.00045073385,0.000060867293,0.000034969114,0.0006489,0.0017690781,0.9833658,0.0025382163,0.0030724278,0.0060694655,0.0004755562],"about_ca_topic_score_codex":0.000010705848,"about_ca_topic_score_gemma":3.214763e-7,"teacher_disagreement_score":0.9789075,"about_ca_system_score_codex":0.000009145886,"about_ca_system_score_gemma":0.000063739004,"threshold_uncertainty_score":0.3954426},"labels":[],"label_agreement":null},{"id":"W3093207174","doi":"10.1002/spe.2914","title":"Evaluating system architectures for driving range estimation and charge planning for electric vehicles","year":2020,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Electric Vehicles and Infrastructure","field":"Engineering","cited_by":11,"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":"Canadian Institute of Steel Construction","keywords":"Software deployment; Computer science; Range (aeronautics); Software; Latency (audio); Real-time computing; Cloud computing; Process (computing); Simulation; Embedded system; Engineering; Telecommunications","score_opus":0.024306582828284063,"score_gpt":0.3061994892382636,"score_spread":0.28189290640997955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093207174","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77811927,0.0029710946,0.21792288,0.00021356468,0.00005022345,0.0004347253,0.000005186638,0.00026390213,0.000019162379],"genre_scores_gemma":[0.9350686,0.000026661899,0.06433113,0.00021665395,0.00014196933,0.00018352651,0.0000039949837,0.00002531932,0.000002116497],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992306,0.000019807761,0.00017027628,0.00022359758,0.00011136332,0.00024430972],"domain_scores_gemma":[0.9990219,0.0007026865,0.00006782548,0.0000652102,0.000055342258,0.000087077264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016870664,0.00013652412,0.00015407296,0.000038036163,0.00023560917,0.00009628303,0.000066856795,0.000062623156,0.0000013599591],"category_scores_gemma":[0.0012803173,0.00012911139,0.00002482602,0.00013239104,0.000014555715,0.00023191162,0.000017785036,0.0001289848,5.0927224e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040604628,0.000015132139,0.005522228,0.0029794595,0.00011772518,0.00000819203,0.06651678,0.042834304,0.07940721,0.000646228,0.0006220498,0.80092466],"study_design_scores_gemma":[0.0004668784,0.00026625628,0.00062291906,0.000086672735,0.00004502692,0.00004996063,0.0016786834,0.9889106,0.006660327,0.00010925393,0.00089631375,0.0002070792],"about_ca_topic_score_codex":0.0000034831141,"about_ca_topic_score_gemma":1.8830667e-7,"teacher_disagreement_score":0.94607633,"about_ca_system_score_codex":0.000023969482,"about_ca_system_score_gemma":0.000014611482,"threshold_uncertainty_score":0.526501},"labels":[],"label_agreement":null},{"id":"W3095846505","doi":"10.1002/spe.3039","title":"Quantum computing: A taxonomy, systematic review and future directions","year":2021,"lang":"en","type":"preprint","venue":"Software Practice and Experience","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Seneca Polytechnic","funders":"","keywords":"Quantum computer; Computer science; Quantum technology; Theoretical computer science; Quantum algorithm; Quantum information science; Quantum network; Qubit; Quantum information; Quantum entanglement; Quantum; Computational science; Computer engineering; Open quantum system; Physics; Quantum mechanics","score_opus":0.018336070322545223,"score_gpt":0.2798761817055284,"score_spread":0.26154011138298316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3095846505","genre_codex":"review","genre_gemma":"methods","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.005237558,0.5518037,0.427513,0.010514884,0.0021374214,0.0019078514,0.000009630432,0.0007781817,0.0000977472],"genre_scores_gemma":[0.045436986,0.20072588,0.7375122,0.013876458,0.0011864983,0.0010179082,0.000035089233,0.000091626425,0.00011737593],"study_design_codex":"systematic_review","study_design_gemma":"systematic_review","domain_scores_codex":[0.9968448,0.0004883463,0.000619859,0.0012624634,0.00037609725,0.00040837884],"domain_scores_gemma":[0.99667436,0.000869276,0.0006711912,0.0012315678,0.00031339115,0.00024020564],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006678338,0.00047836467,0.0010202319,0.00010392101,0.00055384415,0.0011394595,0.00084995443,0.00021646112,0.0000054717893],"category_scores_gemma":[0.0014117892,0.00041250527,0.00013423534,0.00043024938,0.00012965254,0.00065981684,0.002823636,0.0010688906,0.000004083519],"study_design_candidate":"systematic_review","study_design_consensus":"systematic_review","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018481536,0.0007185829,0.00021794555,0.74021417,0.00090795703,0.0010375982,0.11635882,0.00025129024,0.00001587205,0.008423553,0.0015942153,0.13024154],"study_design_scores_gemma":[0.0013043978,0.0007294372,0.00086532417,0.39152136,0.004348894,0.019859158,0.031048136,0.3151889,0.00007652742,0.0029003196,0.2240395,0.0081180455],"about_ca_topic_score_codex":0.00010599112,"about_ca_topic_score_gemma":0.000003740365,"teacher_disagreement_score":0.35107782,"about_ca_system_score_codex":0.000038356666,"about_ca_system_score_gemma":0.00021290708,"threshold_uncertainty_score":0.9998975},"labels":[],"label_agreement":null},{"id":"W3096465442","doi":"10.1002/spe.2929","title":"Root causing, detecting, and fixing flaky tests: State of the art and future roadmap","year":2020,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University; University of Guelph; University of Guelph-Humber","funders":"","keywords":"Pace; Root cause; Software deployment; Test (biology); Field (mathematics); Computer science; Root (linguistics); Engineering; Data science; Software; Engineering management; Software engineering; Operations management","score_opus":0.016750706809614355,"score_gpt":0.2725751747409247,"score_spread":0.2558244679313103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096465442","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7290197,0.004796202,0.24890308,0.012844456,0.00036894315,0.0003966815,0.00000455329,0.0034457152,0.00022067675],"genre_scores_gemma":[0.8479337,0.00019615536,0.1498688,0.0018584101,0.00009132215,0.000017033704,2.5735395e-7,0.000012845154,0.000021487967],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987867,0.0000920899,0.000212847,0.00045092378,0.00023709121,0.00022038943],"domain_scores_gemma":[0.9984086,0.00075774593,0.00023420282,0.0003521668,0.00011215088,0.00013513016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028091526,0.00016422024,0.00017200861,0.0000330297,0.0003235217,0.0002284659,0.0002804992,0.000051298422,0.000001721511],"category_scores_gemma":[0.0034405908,0.00012503068,0.000022985865,0.00033994243,0.0001869742,0.0009898989,0.0005747635,0.00024920015,9.980786e-7],"study_design_candidate":"design_other","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.00009147711,0.00009781788,0.15304798,0.00032077704,0.000050507766,0.00013111834,0.16631764,0.000018285502,0.0027416018,0.0006072491,0.0058572832,0.67071825],"study_design_scores_gemma":[0.0042874287,0.0045609665,0.2358156,0.0025493165,0.00037364973,0.00879459,0.015262559,0.04469772,0.0950712,0.05660688,0.5258419,0.006138196],"about_ca_topic_score_codex":0.000085637774,"about_ca_topic_score_gemma":0.000011083939,"teacher_disagreement_score":0.66458005,"about_ca_system_score_codex":0.000010360991,"about_ca_system_score_gemma":0.000052184114,"threshold_uncertainty_score":0.50986034},"labels":[],"label_agreement":null},{"id":"W3096794928","doi":"10.1002/spe.2915","title":"A graph‐based convolutional neural network stock price prediction with leading indicators","year":2020,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Computer science; Stock market; Convolutional neural network; Stock (firearms); Artificial neural network; Futures contract; Trading strategy; Machine learning; Artificial intelligence; Finance; Economics; Engineering","score_opus":0.09107486337675993,"score_gpt":0.3796336706920618,"score_spread":0.2885588073153018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096794928","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.42492163,0.00056563213,0.5688404,0.0032288367,0.0004729793,0.0004164385,0.000014617915,0.00031524937,0.0012242331],"genre_scores_gemma":[0.8627651,0.00000746182,0.13366584,0.0031725853,0.00023573988,0.00007218265,0.0000036220108,0.000018474691,0.000059036778],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963185,0.0005936966,0.00046870796,0.0008032617,0.0013988339,0.0004169738],"domain_scores_gemma":[0.99120116,0.007294611,0.0005140873,0.00033149062,0.00029823987,0.00036042096],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0018719512,0.00021380218,0.00027686474,0.00015645368,0.00057026086,0.00034031906,0.0004525761,0.00009151799,0.00014376284],"category_scores_gemma":[0.030079952,0.00016304846,0.00005787144,0.002300198,0.00036212234,0.0016945719,0.0001525276,0.00037535047,0.00002268507],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029707442,0.00013187855,0.75844926,0.00003425706,0.000070584094,0.00010938611,0.02553181,0.0112609565,0.00019504437,0.00066637987,0.012603625,0.18797609],"study_design_scores_gemma":[0.0050316425,0.0049983948,0.37920555,0.00032790218,0.00032606395,0.0011144344,0.04184399,0.17646708,0.00070272776,0.0047292137,0.38272402,0.0025290023],"about_ca_topic_score_codex":0.000017205817,"about_ca_topic_score_gemma":0.0000023447644,"teacher_disagreement_score":0.4378434,"about_ca_system_score_codex":0.0000335616,"about_ca_system_score_gemma":0.0001558564,"threshold_uncertainty_score":0.9780901},"labels":[],"label_agreement":null},{"id":"W3107081217","doi":"10.1002/spe.2925","title":"Advanced control‐flow and concurrency in C∀","year":2020,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Concurrency; POSIX Threads; Mutual exclusion; Programming language; Control flow; Concurrency control; Compiler; Synchronization (alternating current); Programmer; Concurrent object-oriented programming; Concurrent computing; Deadlock; Exception handling; Non-lock concurrency control; Distributed computing; Reactive programming; Distributed concurrency control; Programming paradigm; Thread (computing); Inductive programming","score_opus":0.01409728627202044,"score_gpt":0.2831058411201934,"score_spread":0.26900855484817293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107081217","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.00937776,0.0015545023,0.98429734,0.0040260553,0.000057768,0.00011663045,8.5554854e-7,0.00029413414,0.00027497526],"genre_scores_gemma":[0.65579236,0.0004114449,0.34034032,0.0034154402,0.000014025051,0.000017318987,4.203798e-7,0.0000033285394,0.000005355046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914896,0.00007075859,0.00015652213,0.000349928,0.00011393789,0.00015990449],"domain_scores_gemma":[0.99928135,0.00032757307,0.000079946025,0.00014194139,0.00005811136,0.00011109336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013365917,0.000096394484,0.00012969613,0.000031282438,0.00008575197,0.0001235271,0.00022820542,0.000036449397,0.0000029550151],"category_scores_gemma":[0.0012457926,0.0000940172,0.000011017536,0.00023346065,0.000059017133,0.0012569409,0.00014299346,0.00013085558,0.000003583463],"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.00019681307,0.00015155537,0.017136073,0.0000802723,0.000017573639,0.00017037967,0.09512536,0.0034392437,0.00052592246,0.013571464,0.0009988644,0.8685865],"study_design_scores_gemma":[0.003675742,0.0008481583,0.004247752,0.00014036593,0.000014413513,0.00017280212,0.003055922,0.90887016,0.0013719362,0.0023934979,0.07412001,0.0010892652],"about_ca_topic_score_codex":0.000012984547,"about_ca_topic_score_gemma":6.344366e-7,"teacher_disagreement_score":0.9054309,"about_ca_system_score_codex":0.0000071811724,"about_ca_system_score_gemma":0.000030046289,"threshold_uncertainty_score":0.38339102},"labels":[],"label_agreement":null},{"id":"W3113266938","doi":"10.1002/spe.2936","title":"ThingsMigrate: Platform‐independent migration of stateful JavaScript Internet of Things applications","year":2020,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; University of British Columbia","funders":"Institute for Computing, Information and Cognitive Systems; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Intel Corporation","keywords":"Computer science; JavaScript; JSON; Operating system; Cloud computing; Overhead (engineering); Embedded system; Distributed computing; World Wide Web","score_opus":0.021830159478925956,"score_gpt":0.2654130381755257,"score_spread":0.24358287869659973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3113266938","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.121086895,0.0004678288,0.87639356,0.0011022678,0.0003727482,0.0001822704,4.172253e-7,0.0001088015,0.0002852425],"genre_scores_gemma":[0.86484784,0.000107778826,0.13314758,0.0016794339,0.00013779155,0.000029239047,0.0000041238727,0.000009005803,0.000037181235],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875104,0.00003736463,0.0003714702,0.00034640165,0.0003128718,0.00018087609],"domain_scores_gemma":[0.998781,0.00026004761,0.00037527722,0.0002584206,0.00022050092,0.000104708815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002473778,0.00012401365,0.00017991099,0.00005045028,0.000090641006,0.00010612279,0.0005396218,0.00005600122,0.0000030896908],"category_scores_gemma":[0.00041586367,0.000115694704,0.00004170968,0.00034809133,0.00008224803,0.002637396,0.00032495984,0.00016954927,0.000008967713],"study_design_candidate":"qualitative","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.00015227676,0.0002706149,0.0074155456,0.0003648701,0.000079382684,0.000019652696,0.76569504,0.000042544343,0.011969464,0.009494245,0.0056506437,0.19884574],"study_design_scores_gemma":[0.0019377032,0.0018038524,0.0034204426,0.00041363007,0.00013651983,0.00026919815,0.041311104,0.14031851,0.21974301,0.006341844,0.58256584,0.0017383222],"about_ca_topic_score_codex":0.00041290093,"about_ca_topic_score_gemma":0.0000018618044,"teacher_disagreement_score":0.743761,"about_ca_system_score_codex":0.000014578731,"about_ca_system_score_gemma":0.0000696853,"threshold_uncertainty_score":0.4717893},"labels":[],"label_agreement":null},{"id":"W3125503078","doi":"10.1002/spe.2984","title":"Number parsing at a gigabyte per second","year":2021,"lang":"en","type":"preprint","venue":"Software Practice and Experience","topic":"Numerical Methods and Algorithms","field":"Computer Science","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":"Université TÉLUQ; Université du Québec à Montréal","funders":"","keywords":"Decimal; Computer science; Parsing; Arithmetic; IEEE floating point; Bottleneck; Floating point; Binary number; Software; Algorithm; Mathematics; Operating system; Programming language; Embedded system","score_opus":0.027065916225519984,"score_gpt":0.33769450273096907,"score_spread":0.3106285865054491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125503078","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.081821926,0.0033458287,0.90923184,0.0017355718,0.0019306572,0.00020798834,0.0000068504237,0.00028133456,0.0014379952],"genre_scores_gemma":[0.03397092,0.0005362203,0.96172285,0.0026554193,0.00018987754,0.000104092556,0.000006322322,0.000026224487,0.0007881031],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969973,0.00035690918,0.00036749718,0.0013093788,0.00047417113,0.00049475266],"domain_scores_gemma":[0.99706346,0.0009981372,0.00033209161,0.001077013,0.00024236448,0.00028695166],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004725374,0.00036761313,0.00044506785,0.000041231095,0.0003837274,0.0011140598,0.0008245425,0.00025271816,0.00043105707],"category_scores_gemma":[0.0013077515,0.00034760532,0.00013176935,0.0002361694,0.00016674654,0.0016778096,0.004166326,0.00079696387,0.00007082751],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006744628,0.00043895046,0.0032364102,0.0004572364,0.00019267503,0.0012575326,0.11605034,0.000039865106,0.0016209888,0.0017435105,0.001394605,0.87350047],"study_design_scores_gemma":[0.0011563844,0.00026970197,0.0040590903,0.0011254176,0.00019388083,0.0047094617,0.017491415,0.010341036,0.011130452,0.015358781,0.92946607,0.0046982868],"about_ca_topic_score_codex":0.00012490882,"about_ca_topic_score_gemma":0.000005747528,"teacher_disagreement_score":0.9280715,"about_ca_system_score_codex":0.00009625652,"about_ca_system_score_gemma":0.0001899072,"threshold_uncertainty_score":0.9999229},"labels":[],"label_agreement":null},{"id":"W3174187495","doi":"10.1002/spe.3005","title":"Benchmarking and learning garbage collection delays for resource‐restricted graphical user interfaces","year":2021,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","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 New Brunswick; IBM (Canada)","funders":"","keywords":"Computer science; Garbage collection; Benchmarking; Graphical user interface; Benchmark (surveying); Operating system; Resource (disambiguation); Cloud computing; Java; Interface (matter); Database; Garbage; Embedded system; Programming language","score_opus":0.01363180698335234,"score_gpt":0.2815275982120186,"score_spread":0.26789579122866625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174187495","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.0848806,0.00079960533,0.91299164,0.00060631364,0.000086326865,0.00010517651,3.894299e-7,0.00032786166,0.00020209604],"genre_scores_gemma":[0.36885077,0.00047211943,0.6299133,0.00048478856,0.0000376009,0.00004357661,0.000004149477,0.000008210872,0.00018549485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988616,0.00018322973,0.00017469998,0.00044102478,0.00014263747,0.00019682522],"domain_scores_gemma":[0.9983469,0.0010887203,0.000121046265,0.00017260094,0.00019382396,0.00007687091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027427697,0.00011233057,0.00012241809,0.00008039922,0.00060828216,0.00040161097,0.00015971264,0.00007788839,0.0000033633687],"category_scores_gemma":[0.0021894758,0.00011456437,0.000023626526,0.00046867295,0.00006338667,0.00080400414,0.0002450296,0.00022737963,4.3610427e-7],"study_design_candidate":"design_other","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.0006522772,0.0007044906,0.04077167,0.00033385484,0.00024071745,0.00034484055,0.1553613,0.008347325,0.0054416955,0.025941158,0.013222325,0.74863833],"study_design_scores_gemma":[0.0017932191,0.0014321988,0.006691705,0.00035401084,0.000078663965,0.0013546463,0.008760226,0.599092,0.014136491,0.002411562,0.36242235,0.001472928],"about_ca_topic_score_codex":0.000024831283,"about_ca_topic_score_gemma":0.0000027336828,"teacher_disagreement_score":0.74716544,"about_ca_system_score_codex":0.00001539357,"about_ca_system_score_gemma":0.000047062873,"threshold_uncertainty_score":0.46784762},"labels":[],"label_agreement":null},{"id":"W3201160209","doi":"10.1002/spe.3036","title":"Transcoding billions of Unicode characters per second with SIMD instructions","year":2021,"lang":"en","type":"preprint","venue":"Software Practice and Experience","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transcoding; Computer science; SIMD; Unicode; Software; Operating system; Artificial intelligence","score_opus":0.017942660879024883,"score_gpt":0.2716954210409309,"score_spread":0.253752760161906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201160209","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.28571123,0.0011429198,0.7108637,0.0008317097,0.0007568922,0.0002453447,0.000053504984,0.00015075844,0.0002439231],"genre_scores_gemma":[0.5980129,0.0010932133,0.40024847,0.00035584185,0.00006620223,0.00008092162,0.00004780596,0.00001995001,0.00007464164],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.99809676,0.0001105234,0.00033749308,0.00081513746,0.00037676224,0.0002633443],"domain_scores_gemma":[0.9977928,0.0003457964,0.00037722714,0.0010374098,0.0002976056,0.00014915415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017275252,0.00027024338,0.00034547565,0.00012799192,0.0002849407,0.00042552146,0.0007504619,0.00016881316,0.000048864375],"category_scores_gemma":[0.00019741514,0.00022567538,0.0000709479,0.00029366894,0.00019504174,0.002795517,0.0010391498,0.00062092143,0.000001921798],"study_design_candidate":"qualitative","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.00047366007,0.0021280127,0.006203844,0.0025982566,0.0010274366,0.0006673059,0.5188044,0.0023290068,0.022981152,0.01648241,0.0009669632,0.42533758],"study_design_scores_gemma":[0.008504389,0.003355236,0.041001722,0.01444895,0.0014878842,0.009945011,0.24728575,0.056296352,0.07641231,0.006385112,0.5209576,0.013919712],"about_ca_topic_score_codex":0.00019197726,"about_ca_topic_score_gemma":0.00003201201,"teacher_disagreement_score":0.5199906,"about_ca_system_score_codex":0.000029582832,"about_ca_system_score_gemma":0.00033137348,"threshold_uncertainty_score":0.9202775},"labels":[],"label_agreement":null},{"id":"W4205562962","doi":"10.1002/spe.2989","title":"Issue Information","year":2022,"lang":"en","type":"paratext","venue":"Software Practice and Experience","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Citation; Computer science; Information retrieval; World Wide Web","score_opus":0.010732839598805057,"score_gpt":0.2886052044643847,"score_spread":0.27787236486557965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205562962","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.00002806489,0.005811795,0.9550071,0.0022766665,0.0069537414,0.0003810042,0.00003727937,0.0009653011,0.028539056],"genre_scores_gemma":[0.0010788352,0.019095976,0.9259545,0.0124362875,0.0007386062,0.0012497586,0.00028715123,0.00007986882,0.039079],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980963,0.0001375744,0.00036937522,0.00047858933,0.00056271575,0.00035543254],"domain_scores_gemma":[0.9971897,0.0011711061,0.00047807177,0.00087165384,0.00015416715,0.00013529419],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00044826933,0.00032910862,0.00028222968,0.00021253199,0.0004111805,0.00085656065,0.0012372086,0.00021242659,0.0025785642],"category_scores_gemma":[0.0018827707,0.00034011537,0.000060311966,0.00049248687,0.000055205008,0.009224837,0.001115384,0.00084063236,0.002851213],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027765393,0.000049206268,0.000008297297,0.00016262435,0.000039670027,0.000029898472,0.013941736,0.00010683499,0.0000031887917,0.0016153499,0.80776495,0.1762505],"study_design_scores_gemma":[0.00008342737,0.00013065684,0.0000056459544,0.000031527787,0.000014224484,0.00019590251,0.00066094496,0.0002030579,0.00006048669,0.00008707816,0.9980985,0.00042857483],"about_ca_topic_score_codex":0.00023663494,"about_ca_topic_score_gemma":3.9404634e-7,"teacher_disagreement_score":0.19033355,"about_ca_system_score_codex":0.0000843127,"about_ca_system_score_gemma":0.00016904862,"threshold_uncertainty_score":0.9999051},"labels":[],"label_agreement":null},{"id":"W4220683907","doi":"10.1002/spe.2991","title":"Issue Information","year":2022,"lang":"en","type":"paratext","venue":"Software Practice and Experience","topic":"Smart Cities and Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Citation; Computer science; World Wide Web; Software; Information retrieval; Programming language","score_opus":0.009063548545613724,"score_gpt":0.25087173156979325,"score_spread":0.24180818302417953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220683907","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01096234,0.0786455,0.027945103,0.0023530163,0.04635695,0.0014602571,0.0006858717,0.006150657,0.8254403],"genre_scores_gemma":[0.12388638,0.4669174,0.09236904,0.01817713,0.004874997,0.0087793935,0.004812221,0.00081029325,0.27937317],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99928856,0.000012847024,0.00018376282,0.00012797787,0.00018280844,0.00020403205],"domain_scores_gemma":[0.9994319,0.00017453052,0.00007266169,0.00024806286,0.000037699134,0.000035143137],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00005849061,0.00018186615,0.00016558908,0.000100757716,0.00017125341,0.00013915703,0.0001976759,0.0001686971,0.005367805],"category_scores_gemma":[0.0003564777,0.00018916755,0.000026512334,0.0001533305,0.00006361183,0.001475944,0.00016856263,0.0004566356,0.002542723],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010258463,0.0000062858376,0.000008445916,0.0002022901,0.000031170533,0.000006129033,0.008101591,0.000583231,0.0000039499137,0.00007542769,0.9189114,0.07205985],"study_design_scores_gemma":[0.000056268567,0.00003291109,0.000004276035,0.000017847427,0.0000106452835,0.000035297213,0.017617045,0.0000634004,0.00011186925,0.000016438342,0.98180544,0.0002285722],"about_ca_topic_score_codex":0.00007400388,"about_ca_topic_score_gemma":9.265038e-7,"teacher_disagreement_score":0.5460672,"about_ca_system_score_codex":0.00005641958,"about_ca_system_score_gemma":0.000023190829,"threshold_uncertainty_score":0.9982339},"labels":[],"label_agreement":null},{"id":"W4229542741","doi":"10.1002/spe.915","title":"Scopira: an open source C++ framework for biomedical data analysis applications","year":2008,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; National Research Council Institute for Biodiagnostics","funders":"","keywords":"Porting; Computer science; Visualization; Extensibility; Programming language; Interface (matter); Software engineering; Object-oriented programming; Graphical user interface; Software framework; Open source; Software; Generic programming; Data visualization; User interface; Software development; Data mining; Operating system; Component-based software engineering","score_opus":0.32599287043697356,"score_gpt":0.5155856000035914,"score_spread":0.18959272956661788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229542741","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.007996041,0.00018508435,0.98925143,0.0015172126,0.00020060458,0.00045918347,0.00010699981,0.000084817286,0.00019863772],"genre_scores_gemma":[0.18849118,0.000065459186,0.8079503,0.0018885963,0.00018750632,0.00022493556,0.00030006902,0.000011785163,0.000880157],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965641,0.00015389001,0.00047564614,0.0015343485,0.0009946034,0.0002774226],"domain_scores_gemma":[0.9906586,0.004847459,0.0003046565,0.0036432897,0.00027689035,0.00026915094],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004264577,0.00012262151,0.00025811605,0.00024678776,0.0011472631,0.0012933962,0.0044109523,0.00006432558,0.00014260996],"category_scores_gemma":[0.022750812,0.000096554235,0.000037461854,0.002463357,0.00039655447,0.003103211,0.003059107,0.00012141473,0.00007263353],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017942108,0.0010842169,0.014977681,0.000014173001,0.00025602579,0.000023323724,0.022791417,0.00019072533,0.000019267707,0.011045446,0.065240666,0.8841776],"study_design_scores_gemma":[0.00016145871,0.000080944454,0.0012809461,0.0000071434615,0.00011812443,0.000022236769,0.011748212,0.008375668,0.0000060305306,0.006979611,0.9710341,0.00018551263],"about_ca_topic_score_codex":0.00024991864,"about_ca_topic_score_gemma":0.00002609604,"teacher_disagreement_score":0.9057934,"about_ca_system_score_codex":0.000012573987,"about_ca_system_score_gemma":0.00010159839,"threshold_uncertainty_score":0.99974334},"labels":[],"label_agreement":null},{"id":"W4231080752","doi":"10.1002/spe.989","title":"WSB: a broker‐centric framework for quality‐driven web service discovery","year":2010,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Web service; Computer science; World Wide Web; Web crawler; Web modeling; WS-Policy; Web standards; Data Web; Service (business); Web development; Web application security; Business","score_opus":0.015344414172173406,"score_gpt":0.3178846629302645,"score_spread":0.3025402487580911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231080752","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.35229456,0.00047157868,0.63284487,0.01162473,0.0015492917,0.0004888128,0.000021652037,0.00043044222,0.00027406905],"genre_scores_gemma":[0.5388949,0.00009498009,0.44300398,0.017366884,0.00035436687,0.00018733833,0.000009819298,0.000025811445,0.000061951185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975512,0.00011403299,0.00038492473,0.0008927537,0.00045822465,0.00059887307],"domain_scores_gemma":[0.9951762,0.0028320586,0.00031450434,0.0010666599,0.00035071926,0.00025987442],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003864357,0.00030728712,0.00028784462,0.00012336494,0.0005052947,0.00079740066,0.0013745499,0.00020837534,0.000016868224],"category_scores_gemma":[0.0010276705,0.0002711972,0.00009009541,0.00092442683,0.000082888495,0.004063499,0.0006088061,0.0005815447,0.000037792855],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007031567,0.0010806037,0.01607562,0.0009141669,0.0002168036,0.00009490523,0.20699032,0.00008743975,0.030508036,0.64029896,0.00063528825,0.10239469],"study_design_scores_gemma":[0.0031982695,0.0007282268,0.008844494,0.00040578464,0.00018352791,0.00066985306,0.030463075,0.012020775,0.010260764,0.077260934,0.85274565,0.003218678],"about_ca_topic_score_codex":0.00038723208,"about_ca_topic_score_gemma":0.00038703988,"teacher_disagreement_score":0.8521103,"about_ca_system_score_codex":0.000016515352,"about_ca_system_score_gemma":0.00017899524,"threshold_uncertainty_score":0.999974},"labels":[],"label_agreement":null},{"id":"W4234559128","doi":"10.1002/spe.885","title":"Kwyjibo: automatic domain name generation","year":2008,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Domain (mathematical analysis); Natural language processing; Word (group theory); Artificial intelligence; Syllable; Quality (philosophy); Categorization; Information retrieval; Speech recognition; Linguistics; Mathematics","score_opus":0.030043723686563013,"score_gpt":0.2833711744353633,"score_spread":0.2533274507488003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234559128","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5809003,0.00064658263,0.41524786,0.0019589316,0.00039052308,0.00016959678,7.3189767e-7,0.00034674705,0.00033870162],"genre_scores_gemma":[0.9223225,0.00012790268,0.07596489,0.0012718798,0.000069058224,0.000053938464,0.0000022680138,0.000006121116,0.00018143744],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987739,0.00014132421,0.00022739962,0.0003472118,0.00031517705,0.00019502308],"domain_scores_gemma":[0.99902356,0.00017863384,0.00012429667,0.00045032488,0.000106784304,0.00011640393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002667311,0.0001116423,0.000118397074,0.000053470467,0.00040154418,0.00019119037,0.0003547536,0.00005157295,0.0000251069],"category_scores_gemma":[0.00047928476,0.0001038746,0.00002712487,0.0002244402,0.00009118525,0.0021330577,0.00011457154,0.000094266274,0.00013454855],"study_design_candidate":"qualitative","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.000006635592,0.00022693643,0.002863927,0.00003803738,0.00002496683,0.00013088803,0.94039565,0.0000019158347,0.0018588571,0.021911334,0.002739357,0.029801516],"study_design_scores_gemma":[0.002407737,0.0006103271,0.014645865,0.00014556632,0.00004591347,0.008809861,0.022191659,0.31759453,0.0056631994,0.007129965,0.6183728,0.0023825855],"about_ca_topic_score_codex":0.000048281192,"about_ca_topic_score_gemma":0.0000031368272,"teacher_disagreement_score":0.91820395,"about_ca_system_score_codex":0.000023509492,"about_ca_system_score_gemma":0.00006524606,"threshold_uncertainty_score":0.4235883},"labels":[],"label_agreement":null},{"id":"W4237670884","doi":"10.1002/spe.809","title":"Developing a software toolkit for urban traffic modeling","year":2007,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Traffic control and management","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Parsing; Truck; Graphics; Software; Focus (optics); DEVS; Set (abstract data type); Traffic flow (computer networking); Section (typography); Software engineering; Simulation; Programming language; Computer graphics (images); Modeling and simulation; Operating system; Engineering","score_opus":0.02093312014426578,"score_gpt":0.2699426571657598,"score_spread":0.24900953702149403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237670884","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.13517484,0.0017368831,0.86140835,0.00016115874,0.00034458848,0.0002932541,0.0000027352035,0.0007454882,0.00013269736],"genre_scores_gemma":[0.83670074,0.00019823763,0.16236076,0.00040594916,0.000131603,0.0001087472,0.0000051924894,0.000030996438,0.000057766665],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989077,0.0000077934255,0.00025024943,0.00026478246,0.00015058457,0.00041890432],"domain_scores_gemma":[0.9992203,0.0004016166,0.00003513782,0.00016609931,0.0000774898,0.00009933062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032507887,0.00017540781,0.00015746149,0.00007155575,0.00017826502,0.00009184227,0.00013368497,0.00006783152,0.0000060093794],"category_scores_gemma":[0.000577533,0.0001791479,0.000043823416,0.00013893508,0.000026339652,0.00067128,0.000041034444,0.000115942246,0.000007072916],"study_design_candidate":"design_other","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.000208737,0.0000565573,0.00013204063,0.0003267462,0.00011032123,0.000046435267,0.024160272,0.14170204,0.00013225178,0.0023325852,0.0010153909,0.82977664],"study_design_scores_gemma":[0.0026176653,0.00022579831,0.0004970064,0.00025815677,0.00018985548,0.00012212203,0.032311942,0.23698746,0.00034885303,0.00049187074,0.7241237,0.0018255711],"about_ca_topic_score_codex":0.000010234823,"about_ca_topic_score_gemma":0.000024496756,"teacher_disagreement_score":0.8279511,"about_ca_system_score_codex":0.00006519523,"about_ca_system_score_gemma":0.000024133002,"threshold_uncertainty_score":0.730544},"labels":[],"label_agreement":null},{"id":"W4238014149","doi":"10.1002/(issn)1097-024x","title":"Software: Practice and Experience","year":2006,"lang":"en","type":"paratext","venue":"Software Practice and Experience","topic":"Software Engineering Research","field":"Computer Science","cited_by":1222,"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 Sherbrooke","funders":"","keywords":"Software engineering; Computer science; Coding (social sciences); Software; Software development; World Wide Web; Data science; Operating system","score_opus":0.01775938229433564,"score_gpt":0.3186743183254481,"score_spread":0.30091493603111247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238014149","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.005632037,0.04749209,0.92866015,0.003130559,0.0056977137,0.0014398557,0.00007471096,0.0016947199,0.0061781686],"genre_scores_gemma":[0.025000118,0.018372882,0.9008733,0.0057386803,0.0016956648,0.001806066,0.00013800399,0.00039124687,0.045984033],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.992669,0.00044490318,0.0008778806,0.0026462728,0.0018466074,0.0015153491],"domain_scores_gemma":[0.9831273,0.012421383,0.0007025293,0.0021822618,0.0008924191,0.00067410845],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010653909,0.0010596022,0.0008890435,0.0004596104,0.0008260795,0.0021736408,0.0023805932,0.0007572164,0.00017182081],"category_scores_gemma":[0.029749699,0.0010821684,0.00012903177,0.0013044577,0.00074266765,0.007866909,0.0023638224,0.0018672296,0.0010990117],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005091348,0.0013553371,0.0033060317,0.0017634208,0.0004748566,0.0030221525,0.09837023,0.00046802868,0.00040685767,0.002362908,0.63743705,0.250524],"study_design_scores_gemma":[0.0005340006,0.00029790433,0.00048200542,0.00029572018,0.00005433372,0.0017455948,0.0019291517,0.00022533021,0.00042999221,0.000100870886,0.9923744,0.0015306905],"about_ca_topic_score_codex":0.0011998088,"about_ca_topic_score_gemma":0.000008252614,"teacher_disagreement_score":0.35493737,"about_ca_system_score_codex":0.00024030573,"about_ca_system_score_gemma":0.00061798736,"threshold_uncertainty_score":0.99967873},"labels":[],"label_agreement":null},{"id":"W4241301293","doi":"10.1002/spe.2780","title":"Introduction to the special issue on software engineering in practice","year":2019,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kelowna General Hospital","funders":"","keywords":"Theme (computing); Software engineering; Software; Software development; Computer science; Engineering management; Engineering ethics; Engineering; World Wide Web","score_opus":0.007081510641552685,"score_gpt":0.26375310148477377,"score_spread":0.2566715908432211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241301293","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.04759257,0.00080603006,0.8479769,0.088895395,0.008177066,0.002090866,0.0000045808456,0.0023786724,0.0020778733],"genre_scores_gemma":[0.058979046,0.00052597775,0.9193081,0.010381732,0.009757568,0.00032703608,0.0000039544025,0.00006557349,0.00065097545],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99801093,0.00012389437,0.00028051835,0.00071587,0.00046198323,0.0004067988],"domain_scores_gemma":[0.9961335,0.0025212874,0.00014798433,0.00093327643,0.0001393444,0.00012459095],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0009447259,0.000246187,0.00019610031,0.00017949106,0.00013415463,0.00042261317,0.00077841495,0.00009973113,0.00007828045],"category_scores_gemma":[0.014049652,0.0002046013,0.000036060617,0.0008525917,0.00002356092,0.0037385565,0.00034976428,0.0005563747,0.000465842],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012154189,0.00094453985,0.006761371,0.00021863925,0.00014943114,0.00045084726,0.10832801,0.034155115,0.00033270151,0.06266351,0.1449311,0.6398493],"study_design_scores_gemma":[0.00018018208,0.0003448651,0.0009135503,0.000044908065,0.000008730216,0.00018626897,0.0008632904,0.000896318,0.0004360849,0.00003928317,0.99578464,0.00030189435],"about_ca_topic_score_codex":0.00011162214,"about_ca_topic_score_gemma":0.000004980725,"teacher_disagreement_score":0.8508535,"about_ca_system_score_codex":0.000090314104,"about_ca_system_score_gemma":0.000047985734,"threshold_uncertainty_score":0.9942554},"labels":[],"label_agreement":null},{"id":"W4241491475","doi":"10.1002/spe.764","title":"Marking musical dictations using the edit distance algorithm","year":2006,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Music and Audio Processing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Edit distance; Computer science; String searching algorithm; Parsing; Musical; Natural language processing; Musical notation; Domain (mathematical analysis); String (physics); Heuristics; Key (lock); Representation (politics); Context (archaeology); Approximate string matching; XML; Information retrieval; Artificial intelligence; Pattern matching; World Wide Web","score_opus":0.015043399693532265,"score_gpt":0.2822741897144808,"score_spread":0.26723079002094857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241491475","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.009283792,0.0008269119,0.98637944,0.0023079582,0.0004001087,0.00007426433,0.0000012919247,0.00012168287,0.0006045254],"genre_scores_gemma":[0.45995525,0.000034432265,0.5369714,0.0024343624,0.00045961034,0.000024237357,0.0000013327108,0.000008851387,0.00011050353],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99883336,0.000062788095,0.00018010892,0.0003569593,0.0003025756,0.00026421528],"domain_scores_gemma":[0.99888366,0.00050219556,0.0001487066,0.00031119757,0.000101079655,0.00005314284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023111232,0.00011919696,0.00009429266,0.000027820804,0.0008469156,0.0005430821,0.00040239084,0.00003815644,0.000008809003],"category_scores_gemma":[0.00033631828,0.00008807694,0.000026930687,0.00036899856,0.00018934246,0.0021618102,0.00020231435,0.00016715446,0.0000044331473],"study_design_candidate":"design_other","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.000016558892,0.00021292495,0.0022025441,0.000038913633,0.000020441346,0.00015507013,0.03679278,0.00027104229,0.0010804819,0.029912194,0.004227357,0.9250697],"study_design_scores_gemma":[0.00069900777,0.00008871001,0.004450499,0.00023773524,0.00007318041,0.001013422,0.011277244,0.23821224,0.0015036801,0.01600149,0.725251,0.0011917871],"about_ca_topic_score_codex":0.00014386694,"about_ca_topic_score_gemma":0.0000059568665,"teacher_disagreement_score":0.9238779,"about_ca_system_score_codex":0.000025746007,"about_ca_system_score_gemma":0.00007111431,"threshold_uncertainty_score":0.6513876},"labels":[],"label_agreement":null},{"id":"W4242553329","doi":"10.1002/spe.771","title":"Reliable user‐level rollback recovery implementation for multithreaded processes on windows","year":2006,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Distributed systems and fault tolerance","field":"Computer Science","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 Regina","funders":"","keywords":"Thread (computing); Computer science; Rollback; Parallel computing; Operating system; Multithreading; Distributed computing; Programming language","score_opus":0.026561367234756005,"score_gpt":0.31544919085542117,"score_spread":0.2888878236206652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242553329","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.051535554,0.0005996533,0.94472706,0.0010973956,0.00045294547,0.00081724714,0.00008979648,0.00023663211,0.00044372777],"genre_scores_gemma":[0.7877115,0.00014776441,0.208467,0.0015879329,0.00022124224,0.00078041956,0.00006908798,0.00002446732,0.0009905567],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99854267,0.00003194224,0.00030508978,0.00052603066,0.0002652996,0.000328948],"domain_scores_gemma":[0.9985427,0.0004926337,0.00024088756,0.00034258416,0.00031337678,0.000067786576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002506527,0.00017136984,0.00016884712,0.00004726653,0.00031217243,0.0003900283,0.00032643924,0.00006465409,0.000006421805],"category_scores_gemma":[0.00054618786,0.00015630372,0.000034008022,0.00032256366,0.00003714734,0.0027803613,0.00006592455,0.00008443093,0.000019397485],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028373955,0.0036048633,0.0412841,0.0021288905,0.00024611937,0.0002175087,0.051302593,0.006284082,0.0064402884,0.08887632,0.1715174,0.6252604],"study_design_scores_gemma":[0.0045661903,0.0013570037,0.0063539306,0.00032109354,0.00004422183,0.00015333534,0.009488473,0.0026571439,0.026040243,0.004400928,0.9432486,0.0013688292],"about_ca_topic_score_codex":0.00058965717,"about_ca_topic_score_gemma":0.00008989489,"teacher_disagreement_score":0.7717312,"about_ca_system_score_codex":0.000041239546,"about_ca_system_score_gemma":0.00012279977,"threshold_uncertainty_score":0.63738805},"labels":[],"label_agreement":null},{"id":"W4244983080","doi":"10.1002/spe.992","title":"A survey on statistical disclosure control and micro‐aggregation techniques for secure statistical databases","year":2010,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Privacy-Preserving Technologies in Data","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":"Carleton University","funders":"","keywords":"Computer science; Field (mathematics); Perspective (graphical); Data aggregator; Data science; Control (management); Domain (mathematical analysis); Focus (optics); Database; Artificial intelligence; Wireless sensor network; Mathematics","score_opus":0.02898615087461885,"score_gpt":0.3419858605408235,"score_spread":0.31299970966620466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244983080","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.016914457,0.00014587393,0.9749001,0.005359731,0.00018064093,0.0004222708,0.0016145783,0.000448064,0.000014242349],"genre_scores_gemma":[0.2982066,0.00008909031,0.70088357,0.00054615154,0.00002960637,0.00012422208,0.000106695894,0.000010557291,0.0000035124094],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983247,0.00014766003,0.00023032562,0.0007118609,0.00026045996,0.0003250133],"domain_scores_gemma":[0.9901717,0.0072857747,0.00013597182,0.0021093874,0.0001738802,0.0001232899],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0008337904,0.00019188628,0.00020095537,0.00006564583,0.00027282155,0.00032831848,0.0025174394,0.00011735656,0.000007664088],"category_scores_gemma":[0.16022255,0.00016738843,0.0000122451565,0.00015429083,0.00042704798,0.0016377891,0.0045977575,0.00041593926,0.000003366986],"study_design_candidate":"design_other","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.0009262199,0.0006422408,0.052660864,0.00024848658,0.00008489497,0.00016044795,0.0022494234,2.5705697e-7,0.008310126,0.14190486,0.17223985,0.6205723],"study_design_scores_gemma":[0.006540461,0.0050077857,0.24798661,0.00063875556,0.00023750846,0.0011732874,0.0027356045,0.049059972,0.044682465,0.36481386,0.27224422,0.004879464],"about_ca_topic_score_codex":0.00023200909,"about_ca_topic_score_gemma":0.0001126367,"teacher_disagreement_score":0.61569285,"about_ca_system_score_codex":0.0000151658805,"about_ca_system_score_gemma":0.00006924254,"threshold_uncertainty_score":0.8468513},"labels":[],"label_agreement":null},{"id":"W4245712643","doi":"10.1002/spe.751","title":"Compiler optimizations for processors with SIMD instructions","year":2006,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Christian Doppler Forschungsgesellschaft","keywords":"SIMD; Computer science; Compiler; Pointer (user interface); Parallel computing; Programming language; Vectorization (mathematics); Computer hardware","score_opus":0.010510307612428589,"score_gpt":0.27195807063305705,"score_spread":0.26144776302062844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245712643","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.0020671864,0.00013237706,0.9948692,0.0008202845,0.00007428284,0.00024179814,0.0000024903857,0.00060808595,0.0011843048],"genre_scores_gemma":[0.16289762,0.000033621443,0.83630013,0.00038098154,0.00003794639,0.00014503938,0.0000071113736,0.000008680347,0.0001888384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912643,0.000027930446,0.00016499936,0.00034006455,0.00014652719,0.00019404649],"domain_scores_gemma":[0.9989771,0.00027348855,0.0001337044,0.00025017394,0.00031237362,0.000053140804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010349589,0.000117503914,0.00010414366,0.00007225715,0.00048381303,0.0002607772,0.00027711943,0.00004427171,0.00000232151],"category_scores_gemma":[0.00023784446,0.00010186116,0.000018873392,0.00039520283,0.00009847329,0.0015066505,0.000076873046,0.00007754311,0.0000017245584],"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.0003538376,0.0015477526,0.01454343,0.00025205952,0.000121446275,0.000033186592,0.029883377,0.43956757,0.00020004,0.39171907,0.032208417,0.08956983],"study_design_scores_gemma":[0.002824114,0.0013990209,0.0022375716,0.00021374777,0.00009556937,0.0009827651,0.003338626,0.6045228,0.0049161185,0.018276663,0.35903764,0.002155309],"about_ca_topic_score_codex":0.00005616956,"about_ca_topic_score_gemma":0.000006539563,"teacher_disagreement_score":0.3734424,"about_ca_system_score_codex":0.000015498666,"about_ca_system_score_gemma":0.000068740774,"threshold_uncertainty_score":0.41537774},"labels":[],"label_agreement":null},{"id":"W4246053451","doi":"10.1002/spe.938","title":"Bridging concrete and abstract syntaxes in model‐driven engineering: a case of rule languages","year":2009,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University","funders":"Athabasca University","keywords":"Computer science; Bridging (networking); Leverage (statistics); Programming language; Syntax; Context (archaeology); Software engineering; Natural language processing; Artificial intelligence","score_opus":0.010353935927396942,"score_gpt":0.27911964523147503,"score_spread":0.2687657093040781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246053451","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.3543689,0.00050515967,0.64462227,0.00015062101,0.00001633288,0.00008382916,0.0000023821235,0.00022695979,0.000023557492],"genre_scores_gemma":[0.5923616,0.00010266879,0.40742004,0.00008652412,0.000007696321,0.0000120119075,3.932891e-7,0.000005733122,0.0000033091242],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896586,0.000019277866,0.00024505053,0.00036871174,0.00015191,0.00024918796],"domain_scores_gemma":[0.9991749,0.00021842864,0.00010740744,0.00034131028,0.000059439306,0.00009854659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022786469,0.00016991943,0.00021509835,0.00013776588,0.000050216793,0.000089603505,0.0002515959,0.00007377286,0.0000012657115],"category_scores_gemma":[0.00025586155,0.00017700129,0.000023766239,0.0002019668,0.00005063414,0.0015259739,0.00013769929,0.00019875089,5.132692e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104668754,0.00017220549,0.004391522,0.0004407526,0.00005924131,0.009519236,0.113925405,0.038030885,0.04044045,0.09973153,0.00014291191,0.6930412],"study_design_scores_gemma":[0.0004925893,0.00023818774,0.0025092277,0.000356873,0.000018277282,0.0047082133,0.0006338741,0.97599906,0.012909918,0.0005494368,0.00083063915,0.00075372466],"about_ca_topic_score_codex":0.00019284141,"about_ca_topic_score_gemma":0.0000028275824,"teacher_disagreement_score":0.93796813,"about_ca_system_score_codex":0.000024677642,"about_ca_system_score_gemma":0.000031223666,"threshold_uncertainty_score":0.7217903},"labels":[],"label_agreement":null},{"id":"W4247213193","doi":"10.1002/spe.763","title":"Incremental frequency count—a post BWT‐stage for the Burrows–Wheeler compression algorithm","year":2006,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":16,"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":"Stage (stratigraphy); Algorithm; Context (archaeology); Entropy (arrow of time); Data compression; Entropy encoding; Compression (physics); Computer science; Coding (social sciences); Mathematics; Statistics; Physics; Biology","score_opus":0.012877545573040378,"score_gpt":0.2808044728283498,"score_spread":0.2679269272553094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247213193","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.0049317265,0.002588065,0.98977387,0.0011000218,0.0005370849,0.00045069703,0.00007761215,0.00018985951,0.0003510461],"genre_scores_gemma":[0.1584154,0.00039060944,0.8367726,0.0030248247,0.00047067043,0.00033549799,0.000073811425,0.000031322423,0.00048526388],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981819,0.00007666371,0.00029739836,0.0005770898,0.00047237077,0.0003945722],"domain_scores_gemma":[0.9976665,0.0010695024,0.00022472243,0.00068334537,0.0002605519,0.00009537898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003878408,0.00022356908,0.00016670402,0.000046390127,0.00097263354,0.00052470225,0.0008982792,0.0000822946,0.000041223575],"category_scores_gemma":[0.00030762894,0.00015268142,0.000055015196,0.0002092243,0.00015814972,0.0032889172,0.00055149413,0.00020343706,0.000017043218],"study_design_candidate":"design_other","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.00018961426,0.00086643564,0.0019240731,0.000101986516,0.00007330885,0.00014977362,0.011610769,0.00013493162,0.015485319,0.03301811,0.018202022,0.91824365],"study_design_scores_gemma":[0.0020768761,0.0006249922,0.006135755,0.00017631172,0.00006790239,0.00035857968,0.0073909275,0.109193444,0.0073665,0.0035355082,0.8617945,0.0012787431],"about_ca_topic_score_codex":0.0019236716,"about_ca_topic_score_gemma":0.000019720635,"teacher_disagreement_score":0.9169649,"about_ca_system_score_codex":0.00004052251,"about_ca_system_score_gemma":0.000075572105,"threshold_uncertainty_score":0.7480809},"labels":[],"label_agreement":null},{"id":"W4248501463","doi":"10.1002/spe.839","title":"Oto, a generic and extensible tool for marking programming assignments","year":2007,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Université du Québec à Montréal","keywords":"Computer science; Extensibility; Workload; Task (project management); Programming language; Automation; Process (computing); Software engineering; Source code; Code (set theory); Operating system; Engineering; Systems engineering","score_opus":0.028268078525108157,"score_gpt":0.32067617705254514,"score_spread":0.292408098527437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248501463","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.032496933,0.00078141206,0.9633939,0.00020731262,0.00015963898,0.00035420872,7.7170426e-7,0.0025513554,0.000054435426],"genre_scores_gemma":[0.26146787,0.000054097865,0.73738706,0.0008843614,0.000049595805,0.000117913776,0.0000010340757,0.000011893619,0.00002619547],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99851936,0.000035086563,0.00023372463,0.00053737545,0.00023776611,0.00043670952],"domain_scores_gemma":[0.99721,0.0020067755,0.00015904076,0.0003566458,0.00014782738,0.000119666074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010711784,0.00016744676,0.00015067821,0.00008916103,0.0003888928,0.0003799297,0.0002868794,0.000072988136,0.0000014594135],"category_scores_gemma":[0.0045168395,0.00015887378,0.00002800332,0.00027729778,0.00007500733,0.0013171566,0.00028039058,0.000117727875,0.0000018152926],"study_design_candidate":"design_other","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.000045711568,0.000069682115,0.013570044,0.000047368576,0.000012081983,0.000053337717,0.0052417414,7.350993e-7,0.0005017083,0.0010762203,0.0008455975,0.9785358],"study_design_scores_gemma":[0.0043331548,0.004361338,0.042313278,0.0015408483,0.00026045795,0.006914927,0.0062930193,0.02420013,0.030315932,0.086012825,0.7872845,0.0061695785],"about_ca_topic_score_codex":0.000052338426,"about_ca_topic_score_gemma":0.0000011321305,"teacher_disagreement_score":0.9723662,"about_ca_system_score_codex":0.000030068964,"about_ca_system_score_gemma":0.00004063363,"threshold_uncertainty_score":0.64786845},"labels":[],"label_agreement":null},{"id":"W4254434605","doi":"10.1002/spe.991","title":"Synchronization for fast and reentrant operating system kernel tracing","year":2010,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Tracing; Interrupt; Kernel (algebra); Debugging; Linux kernel; Thread (computing); Synchronization (alternating current); Semaphore; Operating system; TRACE (psycholinguistics); Parallel computing; Real-time computing; Distributed computing; Embedded system; Computer network; Microcontroller","score_opus":0.010428097089244892,"score_gpt":0.275977691069655,"score_spread":0.26554959398041006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254434605","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.023740869,0.00019522039,0.97474676,0.00031013627,0.00019356226,0.0002045287,0.0000010515214,0.00044566387,0.00016220576],"genre_scores_gemma":[0.5495762,0.000028625524,0.4501786,0.00012709491,0.000036809997,0.000031453204,0.000001101622,0.0000049927216,0.000015107838],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911714,0.000039138966,0.00018410219,0.00035654253,0.000120784476,0.00018226965],"domain_scores_gemma":[0.99906886,0.00035022895,0.00011844196,0.00022119167,0.00016349685,0.0000778097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036873063,0.00010690844,0.00010934363,0.000041613966,0.00045243822,0.0004230396,0.00020978888,0.0000631297,8.952452e-7],"category_scores_gemma":[0.00079735275,0.00010014495,0.000015219488,0.00013250024,0.000051106883,0.0013581318,0.00010588238,0.00013118828,9.030791e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070343616,0.00020693871,0.006583073,0.0006710571,0.000050614963,0.00004726879,0.1032668,0.0037966492,0.009117796,0.10138518,0.0005028333,0.77430147],"study_design_scores_gemma":[0.0003936542,0.00013388686,0.00031726525,0.00012668778,0.000013451104,0.00041166894,0.0031607088,0.98896325,0.0040467097,0.0001691571,0.001916441,0.0003471375],"about_ca_topic_score_codex":0.000032596225,"about_ca_topic_score_gemma":0.0000026741654,"teacher_disagreement_score":0.9851666,"about_ca_system_score_codex":0.000012983846,"about_ca_system_score_gemma":0.000038381302,"threshold_uncertainty_score":0.40837926},"labels":[],"label_agreement":null},{"id":"W4254604099","doi":"10.1002/spe.895","title":"Using XBDDs and ZBDDs in points‐to analysis","year":2008,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Formal Methods in Verification","field":"Computer Science","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":"University of Alberta; University of Waterloo","funders":"National Science Council","keywords":"Binary decision diagram; Computer science; Context (archaeology); Overhead (engineering); Model checking; Compiler; Metric (unit); Domain (mathematical analysis); Algorithm; Programming language; Theoretical computer science; Mathematics","score_opus":0.07586281004245486,"score_gpt":0.3804970797183182,"score_spread":0.3046342696758633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254604099","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.43882185,0.00015496083,0.56060225,0.00020571308,0.00005276359,0.0000556997,2.4417568e-7,0.000037593214,0.00006893615],"genre_scores_gemma":[0.42373765,0.000090211026,0.5756185,0.00052149146,0.000008611693,0.000010940025,1.6659553e-7,0.00000269158,0.000009715061],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.9988515,0.00013649142,0.00019511656,0.000405371,0.00020574448,0.00020581963],"domain_scores_gemma":[0.9990861,0.00025598836,0.00008994046,0.0003789569,0.00007515131,0.00011389602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050866813,0.00009989575,0.00015185597,0.00024244456,0.00028646225,0.000076114586,0.00027093236,0.00004699953,0.0000041843496],"category_scores_gemma":[0.0018505473,0.00009987432,0.000020687616,0.0014541281,0.00009505638,0.0022821885,0.00032888626,0.000113047994,0.0000045343827],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017674039,0.0003411472,0.37944916,0.000053770837,0.00013975019,0.0003413853,0.46625754,0.0012548852,0.003181664,0.0270985,0.000064049644,0.121641405],"study_design_scores_gemma":[0.0015032938,0.0006921658,0.5912107,0.00013625583,0.00026907685,0.0026798467,0.018730046,0.33746225,0.012881286,0.0030740239,0.028928664,0.0024323396],"about_ca_topic_score_codex":0.00027573833,"about_ca_topic_score_gemma":0.0000094234465,"teacher_disagreement_score":0.4475275,"about_ca_system_score_codex":0.000034230947,"about_ca_system_score_gemma":0.000037861195,"threshold_uncertainty_score":0.40727568},"labels":[],"label_agreement":null},{"id":"W4288067616","doi":"10.1002/spe.3120","title":"Collaborative experience between scientific software projects using Agile Scrum development","year":2022,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"British Columbia Institute of Technology; University of Sudbury; TRIUMF; Laurentian University","funders":"Office of Advanced Cyberinfrastructure; Division of Physics; Science and Technology Facilities Council; National Science Foundation","keywords":"Scrum; Agile software development; Software engineering; Software development; Computer science; Engineering management; Software; Engineering; Systems engineering; Process management; Operating system","score_opus":0.15709575075115986,"score_gpt":0.4174369574121704,"score_spread":0.26034120666101057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288067616","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9346377,0.0005562501,0.060930256,0.00041164536,0.0022303138,0.00062937586,0.00007767937,0.00022364997,0.00030310178],"genre_scores_gemma":[0.8783864,0.0000046844175,0.11887048,0.00057464576,0.000086149084,0.00022356668,0.000038254522,0.00002212514,0.0017936863],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9922639,0.0006200126,0.00088855263,0.0020503844,0.003469087,0.00070804235],"domain_scores_gemma":[0.99436474,0.0024165073,0.00068216404,0.0014453493,0.0007984661,0.00029278462],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0062555145,0.00030061323,0.00036562645,0.00053746265,0.0066369977,0.0035103646,0.0017506554,0.000048277427,0.00045904855],"category_scores_gemma":[0.015700033,0.00027026274,0.00005846293,0.0042784987,0.00079043006,0.0027299556,0.003541262,0.00033542037,0.00010169142],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020243105,0.00051477563,0.10338969,0.000032385065,0.000072701485,0.00020959455,0.49379942,0.001393608,0.00071271625,0.00045675176,0.022065513,0.37715042],"study_design_scores_gemma":[0.00030723622,0.000094090734,0.0031490382,0.000026646163,0.000020468691,0.000056198005,0.21000881,0.00059073715,0.0010866711,0.00050287874,0.78363955,0.0005176461],"about_ca_topic_score_codex":0.00011653858,"about_ca_topic_score_gemma":0.000014155646,"teacher_disagreement_score":0.7615741,"about_ca_system_score_codex":0.00022194369,"about_ca_system_score_gemma":0.00090696185,"threshold_uncertainty_score":0.99997497},"labels":[],"label_agreement":null},{"id":"W4307920660","doi":"10.1002/spe.3160","title":"NFVLearn: A multi‐resource, long short‐term memory‐based virtual network function resource usage prediction architecture","year":2022,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); École de Technologie Supérieure; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Resource (disambiguation); Distributed computing; Data mining; Computer network","score_opus":0.014930874909745586,"score_gpt":0.2476033009739559,"score_spread":0.2326724260642103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307920660","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.054539204,0.0015476759,0.9406145,0.0007135862,0.00085123855,0.00046081597,0.000013997345,0.0009783555,0.00028062877],"genre_scores_gemma":[0.9423906,0.000049605896,0.04849427,0.0071691647,0.0007040866,0.00053107593,0.00007540007,0.00006814014,0.0005176322],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99617845,0.0006469714,0.0004308237,0.0011140862,0.00089231844,0.000737356],"domain_scores_gemma":[0.9971358,0.0013121689,0.0002546118,0.00092468766,0.00008795517,0.0002847395],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0009899894,0.00037082605,0.0002963669,0.00015668786,0.0018183495,0.00042880618,0.00086476456,0.00014647038,0.00009941822],"category_scores_gemma":[0.00061220536,0.0003742339,0.0001187551,0.0010747411,0.00016553333,0.0012127033,0.00093419966,0.0010662972,0.000010798641],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014312497,0.00071140425,0.035781212,0.000055290213,0.00011704553,0.0004822074,0.028231075,0.31216857,0.0001665581,0.00065655453,0.011021035,0.6091778],"study_design_scores_gemma":[0.003133825,0.0036231442,0.036387865,0.00017674098,0.00021349698,0.0014238881,0.009967217,0.14212795,0.00017133632,0.0003565873,0.8003468,0.0020711415],"about_ca_topic_score_codex":0.00004424646,"about_ca_topic_score_gemma":0.0000120691675,"teacher_disagreement_score":0.89212024,"about_ca_system_score_codex":0.000107736785,"about_ca_system_score_gemma":0.00011934335,"threshold_uncertainty_score":0.99987096},"labels":[],"label_agreement":null},{"id":"W4308862143","doi":"10.1002/spe.3163","title":"A large‐scale empirical study of low‐level function use in Ethereum smart contracts and automated replacement","year":2022,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Solidity; Smart contract; Computer science; Documentation; Compiler; Exploit; Function (biology); Computer security; Blockchain; Programming language","score_opus":0.029377424434281808,"score_gpt":0.3131432746414825,"score_spread":0.2837658502072007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308862143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96835077,0.00016124605,0.030124713,0.00068225496,0.00006799125,0.00036646758,0.000004850494,0.0002305081,0.000011172403],"genre_scores_gemma":[0.9929956,0.000021810538,0.0060717077,0.0005689526,0.0000031579568,0.00031732352,0.0000015234161,0.000004636275,0.000015249573],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99869406,0.00019888581,0.00025127668,0.00044055766,0.00022691392,0.00018832608],"domain_scores_gemma":[0.99886215,0.000416372,0.0001581634,0.00044443953,0.00007001557,0.000048854323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006124962,0.00009719524,0.00015240714,0.00009787777,0.00029395174,0.00005416869,0.00023787576,0.000055960867,0.00000993784],"category_scores_gemma":[0.0003857682,0.0000980394,0.000011450996,0.00047208642,0.00006489222,0.0006045022,0.0005564573,0.00027681526,8.64973e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086861703,0.010252539,0.56936437,0.00004969823,0.0000828694,0.0001057319,0.3970965,0.00013619204,0.0008325339,0.0038208142,0.0010593691,0.016330734],"study_design_scores_gemma":[0.0076286853,0.005731471,0.49351072,0.000050745803,0.00007183906,0.0004709342,0.33827823,0.10284535,0.0007354552,0.0029638277,0.046656586,0.0010561212],"about_ca_topic_score_codex":0.00025199982,"about_ca_topic_score_gemma":0.00017164729,"teacher_disagreement_score":0.10270916,"about_ca_system_score_codex":0.00003127393,"about_ca_system_score_gemma":0.000040909337,"threshold_uncertainty_score":0.3997931},"labels":[],"label_agreement":null},{"id":"W4308932920","doi":"10.1002/spe.3167","title":"Training industrial end‐user programmers with interactive tutorials","year":2022,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Teaching and Learning Programming","field":"Computer Science","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 British Columbia","funders":"National Science Foundation of Sri Lanka; Natural Sciences and Engineering Research Council of Canada; ABB Corporate Research","keywords":"Computer science; Block (permutation group theory); Multimedia; End user; Software; Robot; Robotics; Human–computer interaction; Training (meteorology); Software engineering; Programming by demonstration; Artificial intelligence; World Wide Web; Programming language","score_opus":0.04558590685991021,"score_gpt":0.30725975175717263,"score_spread":0.2616738448972624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308932920","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.23841774,0.0006890498,0.74742705,0.005191973,0.00414434,0.0010622405,0.0000057218967,0.0020394619,0.0010224279],"genre_scores_gemma":[0.850406,0.0000051276097,0.14838567,0.000551597,0.00017367324,0.0002953549,0.000003279111,0.000016103337,0.00016319046],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978483,0.00046621184,0.00019703421,0.00056589267,0.00051245507,0.00041013444],"domain_scores_gemma":[0.99827874,0.0009365704,0.0002532858,0.00033028962,0.000065063534,0.0001360352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009785972,0.0001733345,0.00018210482,0.00008848776,0.0009510625,0.00050833146,0.00054998905,0.000044061795,0.000035488756],"category_scores_gemma":[0.0016197409,0.00015551233,0.000034127697,0.00046469946,0.00010787889,0.001961544,0.0004392584,0.0008739629,0.0000042231113],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014164537,0.00009331472,0.001011255,0.000003115014,0.000030367411,0.00008931751,0.17698336,0.00011836514,0.000023126273,0.001415147,0.00009809116,0.8199929],"study_design_scores_gemma":[0.00056576025,0.0007520634,0.000085998305,0.000021788112,0.000016614931,0.00044740198,0.07047362,0.00010786202,0.0000613805,0.000033440545,0.92713875,0.00029531578],"about_ca_topic_score_codex":0.00030773273,"about_ca_topic_score_gemma":0.0000034428338,"teacher_disagreement_score":0.92704064,"about_ca_system_score_codex":0.000076299526,"about_ca_system_score_gemma":0.0002081231,"threshold_uncertainty_score":0.73148996},"labels":[],"label_agreement":null},{"id":"W4310081629","doi":"10.1002/spe.3168","title":"xDEVS: A toolkit for interoperable modeling and simulation of formal discrete event systems","year":2022,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Simulation Techniques and Applications","field":"Decision Sciences","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":"Carleton University","funders":"","keywords":"Computer science; DEVS; Interoperability; Executable; Rotation formalisms in three dimensions; Programming language; Python (programming language); Maintainability; Implementation; Software engineering; Discrete event simulation; Generic programming; Interfacing; Systems modeling; Distributed computing; Modeling and simulation; Operating system; Simulation","score_opus":0.09789883491073663,"score_gpt":0.4390665999825627,"score_spread":0.34116776507182606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310081629","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.26860473,0.00035040974,0.7303063,0.00021057567,0.000059527836,0.00035426283,0.000021501326,0.000029865685,0.00006279414],"genre_scores_gemma":[0.9903483,0.000024573957,0.008931989,0.00012976267,0.000017700395,0.0003667918,0.0000046415007,0.0000061005885,0.00017014943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986969,0.00007218301,0.00041945875,0.00027076647,0.00041512304,0.00012552092],"domain_scores_gemma":[0.99776673,0.0014639888,0.00022562682,0.00023129446,0.0002662297,0.000046101413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011973769,0.00007084549,0.0001375071,0.00007513484,0.00047952912,0.00014161195,0.0001813006,0.000022841656,0.00003068944],"category_scores_gemma":[0.0021539466,0.000058563077,0.00003150276,0.00021860695,0.00004007297,0.0012324739,0.0002241824,0.00007254434,7.90821e-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.00019294946,0.000051996747,0.00078326964,0.000018551716,0.000008336437,5.017515e-7,0.014987787,0.93705136,0.00017600473,0.0037165254,0.0000947551,0.042917937],"study_design_scores_gemma":[0.00016315763,0.000112132126,0.000025774409,0.000008634359,0.000008503259,0.000010358896,0.03052713,0.9249071,0.00005777418,0.0022247822,0.04187253,0.00008211156],"about_ca_topic_score_codex":0.00009515079,"about_ca_topic_score_gemma":0.0000012370904,"teacher_disagreement_score":0.7217435,"about_ca_system_score_codex":0.000020240499,"about_ca_system_score_gemma":0.000026674657,"threshold_uncertainty_score":0.3688199},"labels":[],"label_agreement":null},{"id":"W4312106113","doi":"10.1002/spe.3182","title":"Implementing scripted conversations by means of smart assistants","year":2022,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"AI in Service Interactions","field":"Computer Science","cited_by":5,"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":"Ministerio de Asuntos Económicos y Transformación Digital, Gobierno de España; Universidade de Vigo; Ministerio de Economía y Competitividad; Ministerio de Ciencia, Innovación y Universidades","keywords":"Computer science; Phone; Portfolio; Interface (matter); Smart phone; Home automation; Work (physics); Automation; Human–computer interaction; World Wide Web; Telecommunications; Engineering; Business","score_opus":0.01735422263379653,"score_gpt":0.2971705479812456,"score_spread":0.27981632534744905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312106113","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.17028329,0.0007401564,0.81549835,0.008019082,0.0014966567,0.00039491768,0.00011175152,0.00040954215,0.0030462393],"genre_scores_gemma":[0.9481689,0.000028105047,0.049795255,0.0016787667,0.000011001678,0.00011032914,0.0000082054285,0.000008319421,0.00019115285],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.99859273,0.00014342427,0.0002755345,0.00032500588,0.00039146692,0.00027184706],"domain_scores_gemma":[0.9985258,0.00056082336,0.0002826945,0.00039348792,0.00016702987,0.000070155795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003895117,0.00009723351,0.00011233832,0.000068451576,0.00076644466,0.000107930864,0.0005470716,0.000018621935,0.0002785507],"category_scores_gemma":[0.0005245311,0.00010981382,0.000031085292,0.00047195487,0.000061580926,0.002104337,0.0008056149,0.00019605711,0.000006984407],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035415037,0.002472654,0.09608773,0.00019036401,0.00049681053,0.00016789878,0.5790265,0.00023445523,0.0469594,0.06759338,0.07862709,0.12778956],"study_design_scores_gemma":[0.00055417244,0.00033058555,0.0014043113,0.000020707846,0.000041469237,0.0002271363,0.1145613,0.0057533816,0.006192003,0.00071988633,0.8697614,0.00043366742],"about_ca_topic_score_codex":0.0004962988,"about_ca_topic_score_gemma":0.000030372104,"teacher_disagreement_score":0.7911343,"about_ca_system_score_codex":0.00006155818,"about_ca_system_score_gemma":0.00008081435,"threshold_uncertainty_score":0.589495},"labels":[],"label_agreement":null},{"id":"W4323074617","doi":"10.1002/spe.3198","title":"Fast number parsing without fallback","year":2023,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Correctness; Computer science; String (physics); Parsing; Rust (programming language); Point (geometry); Algorithm; Function (biology); Binary number; Floating point; Arithmetic; Theoretical computer science; Programming language; Mathematics","score_opus":0.02836546243983597,"score_gpt":0.3547149455127382,"score_spread":0.32634948307290224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323074617","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.030620143,0.00017044056,0.96303946,0.0027497176,0.00062924944,0.00011436311,0.0000012680847,0.00073611375,0.0019392576],"genre_scores_gemma":[0.08532005,0.00029822477,0.91210556,0.0016048839,0.0001069589,0.000039896877,0.0000010256651,0.000014087382,0.00050929305],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985845,0.000121286954,0.00016882917,0.00046511804,0.0002907377,0.00036954298],"domain_scores_gemma":[0.9986487,0.00064592087,0.00008948014,0.0003729258,0.00007921078,0.00016374564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037939282,0.00013590736,0.00015347886,0.000037560763,0.00026737718,0.0003070011,0.00040109621,0.00004889568,0.000017857621],"category_scores_gemma":[0.0011286605,0.00011745515,0.000033160548,0.0007352378,0.000100574915,0.0018555329,0.00035713267,0.00016678602,0.0003529316],"study_design_candidate":"design_other","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.000014419614,0.00005981247,0.004647052,0.000016745435,0.000014061517,0.00013819258,0.015150635,0.000012350734,0.00040718773,0.00984396,0.0007814475,0.96891415],"study_design_scores_gemma":[0.0009494627,0.0002924282,0.007577952,0.00016183205,0.000033151024,0.0010365125,0.015757527,0.02574945,0.0028841142,0.020063093,0.9239425,0.0015519593],"about_ca_topic_score_codex":0.000065533306,"about_ca_topic_score_gemma":7.861564e-7,"teacher_disagreement_score":0.96736217,"about_ca_system_score_codex":0.000015738677,"about_ca_system_score_gemma":0.00003206203,"threshold_uncertainty_score":0.4789682},"labels":[],"label_agreement":null},{"id":"W4353085171","doi":"10.1002/spe.3202","title":"Reproducibility as a service","year":2023,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reproducibility; Computer science; Mathematics; Statistics","score_opus":0.17424086479071627,"score_gpt":0.4582500712121293,"score_spread":0.28400920642141303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4353085171","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97053343,0.00015265997,0.004278107,0.017165923,0.0014018494,0.0002143685,0.000008013334,0.0005499018,0.005695734],"genre_scores_gemma":[0.97992414,0.00005494897,0.0074460157,0.0058824876,0.00012128642,0.000038464055,0.000009740643,0.000010186481,0.0065127453],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957737,0.00020497525,0.00039290483,0.0021245226,0.0012098046,0.00029412855],"domain_scores_gemma":[0.99221337,0.0034294105,0.00018476105,0.0035729855,0.00044857903,0.00015090736],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.013445251,0.00010681914,0.00014542528,0.0001640216,0.0004278577,0.00077225425,0.00078527286,0.00003363455,0.00023267507],"category_scores_gemma":[0.12496172,0.00008269217,0.000032924865,0.002837844,0.00011156329,0.0014160082,0.0011177033,0.00010963519,0.004030419],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016301419,0.00017491008,0.02156528,0.000026532198,0.000021921389,0.000183032,0.07210537,0.00018398729,0.00025814978,0.002703176,0.16440672,0.7382079],"study_design_scores_gemma":[0.0001611428,0.000048089194,0.018475378,0.000014496035,0.0000099667095,0.000057761587,0.052416876,0.0013955357,0.00018562104,0.015744379,0.91127586,0.00021487738],"about_ca_topic_score_codex":0.00040397045,"about_ca_topic_score_gemma":0.000021976193,"teacher_disagreement_score":0.74686915,"about_ca_system_score_codex":0.000013681567,"about_ca_system_score_gemma":0.000054823053,"threshold_uncertainty_score":0.99674505},"labels":[],"label_agreement":null},{"id":"W4362721046","doi":"10.1002/spe.3206","title":"EdgeAuth: An intelligent token‐based collaborative authentication scheme","year":2023,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"User Authentication and Security Systems","field":"Computer Science","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":"National Key Research and Development Program of China; College of Engineering and Applied Science, University of Wyoming; University of Colorado Boulder; National Natural Science Foundation of China","keywords":"Server; Computer science; Cloud computing; Security token; Computer network; Edge computing; Authentication (law); Enhanced Data Rates for GSM Evolution; Authentication server; The Internet; Computer security; Operating system; Telecommunications","score_opus":0.03183611125330991,"score_gpt":0.3350754871527458,"score_spread":0.3032393758994359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362721046","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.41508782,0.000572092,0.57039535,0.009429612,0.0013100216,0.00080004835,0.000012045722,0.0019613162,0.0004317096],"genre_scores_gemma":[0.97074467,0.000084536514,0.027703019,0.0010298174,0.000048488502,0.0001445956,0.000019316556,0.000011257968,0.00021432377],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983536,0.00022125442,0.00026508083,0.0005108867,0.0003802512,0.00026892856],"domain_scores_gemma":[0.9982433,0.00040852829,0.00015606264,0.0006480111,0.00035022257,0.00019390551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005867456,0.00014346877,0.00013291575,0.00014490164,0.0003060067,0.000463494,0.00055597036,0.00006753726,0.000021680244],"category_scores_gemma":[0.0011389999,0.00013839817,0.000027269796,0.0011710977,0.00010146794,0.0023697508,0.00015266829,0.00011908479,0.00031879774],"study_design_candidate":"qualitative","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.000049940772,0.0004201514,0.0023839227,0.00006896642,0.000033828488,0.000039032246,0.90094966,0.000010919895,0.0030373198,0.057244524,0.0014406934,0.034321025],"study_design_scores_gemma":[0.0010604005,0.0006225891,0.00674108,0.00014933366,0.000042004423,0.00007360171,0.08045538,0.5270947,0.01718716,0.005410951,0.359786,0.0013767725],"about_ca_topic_score_codex":0.000035811576,"about_ca_topic_score_gemma":0.0000065336153,"teacher_disagreement_score":0.8204943,"about_ca_system_score_codex":0.000031857147,"about_ca_system_score_gemma":0.00013691255,"threshold_uncertainty_score":0.5643714},"labels":[],"label_agreement":null},{"id":"W4362722749","doi":"10.1002/spe.3208","title":"Detection of microservice‐based software anomalies based on OpenTracing in cloud","year":2023,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Microservices; DevOps; Computer science; Anomaly detection; Cloud computing; Scalability; Flexibility (engineering); Software; Distributed computing; Software architecture; Architecture; Software deployment; Data mining; Software engineering; Real-time computing; Database; Operating system","score_opus":0.015413194559834285,"score_gpt":0.28289239610846423,"score_spread":0.2674792015486299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362722749","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71903723,0.00019315982,0.27864668,0.00053478265,0.00068527774,0.0003541367,0.0000050534795,0.00048968947,0.00005396198],"genre_scores_gemma":[0.97471386,0.000041385247,0.024278777,0.00079318177,0.00003959963,0.000099291334,0.0000041798507,0.00001384805,0.000015874904],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997943,0.00018152282,0.00043881295,0.00060895877,0.00042828821,0.00039940755],"domain_scores_gemma":[0.9973718,0.0014089762,0.00024378113,0.0007100751,0.00017048107,0.00009488828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090994424,0.00021078665,0.0002739178,0.00028387172,0.00022796857,0.00013523233,0.0005328663,0.0001283406,0.0000067534565],"category_scores_gemma":[0.0016478755,0.00019149837,0.00006224302,0.0014148046,0.00011134783,0.0014705249,0.00017460264,0.0002258482,0.000038966522],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001479764,0.0014480152,0.5720095,0.0026085179,0.000054330852,0.0004068014,0.060300935,0.031104967,0.017886573,0.0004038867,0.00030819039,0.3119885],"study_design_scores_gemma":[0.00767582,0.0030899362,0.29512146,0.002877384,0.000075016214,0.0001781264,0.01877493,0.35283583,0.29152614,0.0012842686,0.023285462,0.0032756228],"about_ca_topic_score_codex":0.00033342105,"about_ca_topic_score_gemma":0.00003922107,"teacher_disagreement_score":0.32173085,"about_ca_system_score_codex":0.00006806417,"about_ca_system_score_gemma":0.00014625628,"threshold_uncertainty_score":0.7809077},"labels":[],"label_agreement":null},{"id":"W4365998865","doi":"10.1002/spe.3209","title":"A blockchain‐based privacy‐preserving advertising attribution architecture: Requirements, design, and a prototype implementation","year":2023,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Key Research and Development Program of China; Peng Cheng Laboratory; Tencent","keywords":"Attribution; Computer science; Architecture; Blockchain; Computer security; Intersection (aeronautics); Set (abstract data type); Internet privacy; Advertising; Business; Engineering","score_opus":0.03236558568730539,"score_gpt":0.3337952147060385,"score_spread":0.3014296290187331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365998865","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.18223803,0.0002365079,0.8116337,0.0045795096,0.000035947578,0.0007439257,0.0000015976957,0.0005250586,0.0000057501475],"genre_scores_gemma":[0.7589242,0.00006424381,0.23981772,0.00049846614,0.000014986482,0.0006600437,0.0000053357194,0.000008273305,0.00000674078],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859834,0.00013217684,0.00021490028,0.0005090077,0.00022887341,0.000316705],"domain_scores_gemma":[0.99885744,0.00036115583,0.000141523,0.00045124974,0.000108276035,0.000080370584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006418632,0.00013869826,0.00011498185,0.00014410084,0.0005285289,0.00015001529,0.00037041688,0.00008389699,0.000006486444],"category_scores_gemma":[0.00043580338,0.00013720185,0.000018066881,0.0007946494,0.000105404266,0.00039392523,0.00042597874,0.00017318901,0.000006494795],"study_design_candidate":"design_other","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.0002070317,0.00023155804,0.009020752,0.00019133746,0.000066095774,0.000080865015,0.050752938,0.00066238147,0.015157405,0.024309937,0.00061755726,0.89870214],"study_design_scores_gemma":[0.0060682194,0.002692406,0.028809397,0.00049849023,0.00016743591,0.0006760008,0.015363981,0.5409457,0.13474813,0.094159864,0.17276312,0.003107234],"about_ca_topic_score_codex":0.0000758815,"about_ca_topic_score_gemma":0.000005560388,"teacher_disagreement_score":0.8955949,"about_ca_system_score_codex":0.000031663443,"about_ca_system_score_gemma":0.00006640366,"threshold_uncertainty_score":0.5594929},"labels":[],"label_agreement":null},{"id":"W4368376429","doi":"10.1002/spe.3210","title":"Distributed computation of the critical path from execution traces","year":2023,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software System Performance and Reliability","field":"Computer Science","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":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Telefonaktiebolaget LM Ericsson; Advanced Micro Devices","keywords":"Tracing; Computer science; Scalability; Distributed computing; TRACE (psycholinguistics); Computation; Path tracing; Path (computing); Parallel computing; Algorithm; Computer network; Artificial intelligence","score_opus":0.01588971179918067,"score_gpt":0.3036955461113921,"score_spread":0.2878058343122114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4368376429","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61048573,0.0002841861,0.38613695,0.002022833,0.00065170886,0.00012926526,0.000017860657,0.000249314,0.000022149019],"genre_scores_gemma":[0.9905231,0.000073445815,0.009169656,0.00015523499,0.000035158297,0.000026937754,0.000007313766,0.000003820081,0.0000053173057],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9987727,0.00014283245,0.00024780058,0.00030996755,0.00034369988,0.00018300876],"domain_scores_gemma":[0.9981068,0.0011742668,0.00012705404,0.00035808055,0.00017823407,0.000055583194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033937115,0.00009656053,0.00012895504,0.000029339371,0.00026412559,0.00009322741,0.00036467102,0.0000672069,0.000002824591],"category_scores_gemma":[0.002635941,0.000066222114,0.000043096,0.00063511415,0.00020227482,0.0013622051,0.00022857629,0.000118655815,0.000017798031],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003296281,0.0011015725,0.33144954,0.0008601899,0.00014813102,0.00011262802,0.27091187,0.0019958075,0.0066619264,0.019074574,0.008536858,0.35881728],"study_design_scores_gemma":[0.001475897,0.00051124766,0.7960406,0.00083444634,0.00010831468,0.00017015715,0.03332964,0.10447505,0.015257655,0.027656743,0.018930444,0.0012098021],"about_ca_topic_score_codex":0.000196949,"about_ca_topic_score_gemma":0.0000024199853,"teacher_disagreement_score":0.46459106,"about_ca_system_score_codex":0.00001974155,"about_ca_system_score_gemma":0.000057568293,"threshold_uncertainty_score":0.3155658},"labels":[],"label_agreement":null},{"id":"W4376562663","doi":"10.1002/spe.3214","title":"Fast matrix multiplication via compiler‐only layered data reorganization and intrinsic lowering","year":2023,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); University of Alberta","funders":"","keywords":"Computer science; Compiler; Parallel computing; Kernel (algebra); Matrix multiplication; Supercomputer; Code (set theory); Performance improvement; Matrix (chemical analysis); Code generation; Computational science; Programming language; Operating system","score_opus":0.026453969927901524,"score_gpt":0.3220810229898587,"score_spread":0.2956270530619572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376562663","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.021553926,0.00023812607,0.97567195,0.0009794682,0.00011908601,0.00015390005,0.0000033338988,0.00121993,0.000060305694],"genre_scores_gemma":[0.70065355,0.0007284222,0.29816014,0.00028497013,0.00004303411,0.000012550944,0.000044979442,0.0000121535095,0.000060195012],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877787,0.00006324304,0.00020997011,0.00056315574,0.00019046602,0.00019528184],"domain_scores_gemma":[0.998541,0.00034745003,0.0001543356,0.0007268653,0.0001473191,0.00008301503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037167154,0.00012291736,0.0001169513,0.00010849601,0.0003200151,0.0003158866,0.00060623465,0.000059939135,0.0000026313007],"category_scores_gemma":[0.0010094082,0.00012737433,0.000008293462,0.0007482428,0.000062327475,0.002271301,0.0010841934,0.00011709202,0.000026922653],"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.00007818823,0.00020775526,0.02179214,0.00014407173,0.000047731937,0.000071726616,0.037914135,0.0032922728,0.0038162966,0.0053497404,0.0048830346,0.9224029],"study_design_scores_gemma":[0.000714741,0.00016862039,0.014129322,0.00011292811,0.000021544176,0.0004532394,0.0016657934,0.95207053,0.003031453,0.0012668163,0.025532177,0.0008328153],"about_ca_topic_score_codex":0.000049735107,"about_ca_topic_score_gemma":0.0000024497763,"teacher_disagreement_score":0.9487783,"about_ca_system_score_codex":0.000016376,"about_ca_system_score_gemma":0.000040432646,"threshold_uncertainty_score":0.5194174},"labels":[],"label_agreement":null},{"id":"W4386629830","doi":"10.1002/spe.3261","title":"Transcoding unicode characters with AVX‐512 instructions","year":2023,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Transcoding; JavaScript; Unicode; Parallel computing; Set (abstract data type); Programming language; Operating system; Artificial intelligence","score_opus":0.019453521533190816,"score_gpt":0.28394922999200695,"score_spread":0.26449570845881615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386629830","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.058667418,0.00007019651,0.9359766,0.002657917,0.00017698544,0.00011166338,0.0000010215205,0.0018023812,0.0005357762],"genre_scores_gemma":[0.6242959,0.0004932426,0.37406605,0.0008155137,0.000035791614,0.00005076347,0.000003914703,0.000012302421,0.00022651316],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989764,0.000057767214,0.00014542618,0.00036455158,0.00020631257,0.00024954477],"domain_scores_gemma":[0.9991428,0.00025184834,0.00009292717,0.00032607836,0.00009345122,0.00009289259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020665998,0.00012029878,0.00010838485,0.00012987971,0.0003907193,0.00024027882,0.00036683568,0.000044921613,0.000003202571],"category_scores_gemma":[0.00022795364,0.00010538075,0.000021002656,0.0008452446,0.000090148416,0.0019126784,0.000112433474,0.00015146735,0.000019419593],"study_design_candidate":"design_other","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.00028419765,0.00043490648,0.01485918,0.00019321096,0.00020853957,0.00062407064,0.27079782,0.010564471,0.0028793358,0.12784311,0.0051907916,0.5661204],"study_design_scores_gemma":[0.005067345,0.0023918166,0.03201038,0.0011758239,0.00018597266,0.005083809,0.040922057,0.3206822,0.028175293,0.010450688,0.5476583,0.006196291],"about_ca_topic_score_codex":0.00002990839,"about_ca_topic_score_gemma":0.0000019426773,"teacher_disagreement_score":0.56562847,"about_ca_system_score_codex":0.000016597667,"about_ca_system_score_gemma":0.00005418792,"threshold_uncertainty_score":0.42973024},"labels":[],"label_agreement":null},{"id":"W4386803560","doi":"10.1002/spe.3262","title":"High‐performance extended actors","year":2023,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scalability; Concurrency; Debugging; Robustness (evolution); Distributed computing; Shared memory; TRACE (psycholinguistics); Decoupling (probability); Ask price; Parallel computing; Operating system","score_opus":0.01786703427267446,"score_gpt":0.29321950444199985,"score_spread":0.2753524701693254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386803560","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.21738227,0.00014004245,0.7773836,0.0011977374,0.00039651137,0.000113327114,6.7682697e-7,0.0028411131,0.0005447158],"genre_scores_gemma":[0.74431014,0.00066808966,0.2540167,0.0006812856,0.00003521255,0.000031732896,0.0000022492884,0.0000075852827,0.00024702016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989057,0.000054576885,0.00016219531,0.00036967284,0.00023427434,0.0002735586],"domain_scores_gemma":[0.99900275,0.00031855007,0.00009840166,0.00039402995,0.00009826577,0.00008801329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029369805,0.00011958748,0.00011069533,0.00010853661,0.0002889395,0.00020125754,0.00048804306,0.00005377312,0.0000064212245],"category_scores_gemma":[0.00063173595,0.00011073487,0.000018591914,0.0007362447,0.00006329856,0.0018570689,0.00033236836,0.00012620547,0.00008498678],"study_design_candidate":"design_other","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.000086868175,0.00025004355,0.0069522215,0.00010364372,0.00005281223,0.0001954074,0.045792095,0.0044878125,0.0009552384,0.0357518,0.015495898,0.8898761],"study_design_scores_gemma":[0.0024778794,0.0018431487,0.08804789,0.00043805898,0.000056348592,0.0009044888,0.0065579927,0.50264955,0.074270666,0.01673071,0.30170372,0.0043195584],"about_ca_topic_score_codex":0.000026706071,"about_ca_topic_score_gemma":2.5968737e-7,"teacher_disagreement_score":0.8855566,"about_ca_system_score_codex":0.000014977067,"about_ca_system_score_gemma":0.000038992202,"threshold_uncertainty_score":0.4515637},"labels":[],"label_agreement":null},{"id":"W4389509223","doi":"10.1002/spe.3296","title":"Parsing millions of URLs per second","year":2023,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parsing; Node (physics); Programming language; Parser combinator; Operating system; Artificial intelligence; Physics","score_opus":0.021643628339891214,"score_gpt":0.29291798777982925,"score_spread":0.27127435943993805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389509223","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8205583,0.0006016957,0.17460977,0.0017236352,0.00089676055,0.000116880015,0.0000031919667,0.00046286345,0.0010268625],"genre_scores_gemma":[0.9700563,0.00013437947,0.029125897,0.00040936065,0.00004296142,0.000016057515,0.0000010465874,0.0000056976405,0.00020829115],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992208,0.000049307153,0.00013367346,0.0002480373,0.00017822594,0.00016997701],"domain_scores_gemma":[0.9990088,0.00048706774,0.000086972985,0.00027525364,0.000078764904,0.00006315773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025950372,0.000072105555,0.00008828599,0.00008524952,0.00019044992,0.000117762465,0.00023193967,0.000042960794,0.000030496949],"category_scores_gemma":[0.00068897865,0.000069138725,0.00002561357,0.0005017802,0.0000634986,0.0017132879,0.00013802701,0.00009770692,0.00005140538],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013355711,0.00032430535,0.015483083,0.0002755716,0.0001054619,0.0001792559,0.44761956,0.00027592093,0.06028623,0.014982186,0.015507736,0.44482714],"study_design_scores_gemma":[0.0014190922,0.0010075255,0.05476591,0.0003084028,0.00007491271,0.0009576633,0.037195742,0.013934962,0.099478096,0.013191877,0.7759471,0.0017187088],"about_ca_topic_score_codex":0.00006083547,"about_ca_topic_score_gemma":0.000005415073,"teacher_disagreement_score":0.7604394,"about_ca_system_score_codex":0.000009165952,"about_ca_system_score_gemma":0.000032256587,"threshold_uncertainty_score":0.28193954},"labels":[],"label_agreement":null},{"id":"W4391033034","doi":"10.1002/spe.3313","title":"On‐demand JSON: A better way to parse documents?","year":2024,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"JSON; Computer science; Serialization; Parsing; JavaScript; Programming language; Bottleneck; Data structure; Operating system; Ajax; Database; Web application; Embedded system","score_opus":0.013481323830376661,"score_gpt":0.3095773286200742,"score_spread":0.29609600478969755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391033034","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.015533847,0.0007063181,0.97500557,0.005657801,0.0003707505,0.00014827945,9.165962e-7,0.0009577365,0.0016187796],"genre_scores_gemma":[0.5171241,0.00017447761,0.47127157,0.010675662,0.000079382306,0.000086456625,0.0000011201303,0.0000127825615,0.0005744375],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99871683,0.000072549534,0.0001664191,0.00053878373,0.000258879,0.00024655045],"domain_scores_gemma":[0.9988462,0.000528417,0.000038475286,0.0003857558,0.00006128964,0.00013988293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002906958,0.0001451532,0.00011273209,0.00010946831,0.00018204164,0.00077075226,0.00040880125,0.00004975869,0.000025544441],"category_scores_gemma":[0.00050758716,0.00012365388,0.0000309206,0.0003984213,0.00003731652,0.0014213311,0.00026661492,0.0001600906,0.00016781817],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103850514,0.00025648883,0.0003402006,0.00009955695,0.00007566508,0.0006851596,0.08265567,0.0014091694,0.00029386242,0.07567348,0.10624495,0.73216194],"study_design_scores_gemma":[0.0004628418,0.0010415373,0.00037366964,0.000584151,0.00003029695,0.00045917556,0.0009311659,0.044023566,0.005852887,0.021494083,0.9234513,0.0012952975],"about_ca_topic_score_codex":0.000019724801,"about_ca_topic_score_gemma":4.4978165e-7,"teacher_disagreement_score":0.8172064,"about_ca_system_score_codex":0.000025198426,"about_ca_system_score_gemma":0.000026895766,"threshold_uncertainty_score":0.74323815},"labels":[],"label_agreement":null},{"id":"W4396557969","doi":"10.1002/spe.3338","title":"Dynamic hierarchical intrusion detection task offloading in IoT edge networks","year":2024,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Inference; Edge device; Exploit; Cloud computing; Enhanced Data Rates for GSM Evolution; Intrusion detection system; Edge computing; Task (project management); Inference engine; Distributed computing; Range (aeronautics); Data mining; Artificial intelligence; Computer security","score_opus":0.007705413725137718,"score_gpt":0.2663588571658311,"score_spread":0.25865344344069335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396557969","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.19340952,0.0034326334,0.800004,0.0007943557,0.0016713843,0.0001460552,4.159231e-7,0.00040634925,0.00013526145],"genre_scores_gemma":[0.98474467,0.0011829284,0.013343056,0.0004968847,0.00012552617,0.000047042744,0.0000012026976,0.000012236871,0.00004642637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983528,0.00016391209,0.00027281322,0.0006205741,0.00024631346,0.0003435399],"domain_scores_gemma":[0.9988619,0.00062966207,0.000060769482,0.0002890036,0.000045943976,0.000112693364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051029806,0.00016445265,0.00014224356,0.00021062695,0.00028247279,0.00050370244,0.00029698815,0.00015234796,0.00001586831],"category_scores_gemma":[0.0004938399,0.00015726905,0.000041291725,0.0010098459,0.00009036758,0.0020222291,0.00032191782,0.00066159555,0.000028581988],"study_design_candidate":"design_other","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.000063056024,0.000051969597,0.00007675171,0.00003319834,0.000008016932,0.00013376813,0.009299562,0.0005926862,0.0019322946,0.0025550616,0.00007158523,0.98518205],"study_design_scores_gemma":[0.0001723105,0.00020316048,0.0005077273,0.00020514695,0.000008335611,0.00043960696,0.00050614064,0.94983166,0.00066285755,0.0025524,0.044594225,0.00031640325],"about_ca_topic_score_codex":0.00010325366,"about_ca_topic_score_gemma":0.000083491825,"teacher_disagreement_score":0.98486567,"about_ca_system_score_codex":0.00010328426,"about_ca_system_score_gemma":0.000044602035,"threshold_uncertainty_score":0.6413246},"labels":[],"label_agreement":null},{"id":"W4400738953","doi":"10.1002/spe.3364","title":"A Framework and Taxonomy for Characterizing the Applicability of Software Architecture Recovery Approaches: A Tertiary‐Mapping Study","year":2024,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"European Regional Development Fund; Science Foundation Ireland; Irish Research eLibrary","keywords":"Taxonomy (biology); Computer science; Software engineering; Architecture; Geography; Biology; Ecology; Archaeology","score_opus":0.04772466582929957,"score_gpt":0.28686317050891363,"score_spread":0.23913850467961406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400738953","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.23286186,0.0019533902,0.76179636,0.0011040455,0.0003145209,0.0017019195,0.0000085263155,0.00024946695,0.000009919014],"genre_scores_gemma":[0.7869879,0.00008819688,0.2105143,0.0004002346,0.00012546126,0.001855213,0.000002167103,0.000016503618,0.000010015837],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977562,0.00018761186,0.00048399158,0.0009230659,0.00029493036,0.0003542062],"domain_scores_gemma":[0.9946565,0.0040401975,0.00019753203,0.0008946506,0.000109354274,0.00010174583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014547256,0.0002688246,0.00033857021,0.000091098314,0.00041476556,0.0004538926,0.0005983403,0.00013352784,0.0000022329866],"category_scores_gemma":[0.0022144471,0.00017804246,0.00010006905,0.00049280265,0.00026495263,0.0015860195,0.00046875104,0.0004214593,0.0000026929506],"study_design_candidate":"design_other","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.00017234129,0.00045118455,0.038094003,0.0019768586,0.00020622206,0.000015587766,0.18553406,0.000043487766,0.00017608468,0.0008361363,0.00008366605,0.7724104],"study_design_scores_gemma":[0.0043477183,0.006845357,0.13905345,0.006731936,0.00091210194,0.0026601425,0.35684457,0.018808939,0.0039813877,0.07798174,0.37503472,0.006797922],"about_ca_topic_score_codex":0.000047735106,"about_ca_topic_score_gemma":0.0000029955693,"teacher_disagreement_score":0.7656124,"about_ca_system_score_codex":0.00003723715,"about_ca_system_score_gemma":0.00012340011,"threshold_uncertainty_score":0.7260361},"labels":[],"label_agreement":null},{"id":"W4401890088","doi":"10.1002/spe.3369","title":"Batched ranged random integer generation","year":2024,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Shuffling; Pseudorandom number generator; Random seed; Random number generation; Binary number; Integer (computer science); Word (group theory); Division (mathematics); Computer science; Algorithm; Value (mathematics); Bounded function; Mathematics; Arithmetic; Discrete mathematics; Statistics","score_opus":0.020145443921326382,"score_gpt":0.2966167090827762,"score_spread":0.2764712651614498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401890088","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.02153489,0.002675843,0.97088265,0.0031017514,0.0008614522,0.00016733643,0.0000012137308,0.0005011271,0.00027371178],"genre_scores_gemma":[0.89072436,0.00033963504,0.10647457,0.0017853057,0.00029382124,0.00010688077,0.0000069802504,0.000015728197,0.00025271226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862605,0.00013791742,0.00020245156,0.00051542855,0.00030395904,0.0002142005],"domain_scores_gemma":[0.9987063,0.0006925094,0.00005686231,0.00032641052,0.00012024652,0.000097679025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005229055,0.00014710496,0.00012508611,0.00009330767,0.00016937919,0.0007640611,0.00027635312,0.000060889342,0.000051365703],"category_scores_gemma":[0.0012429797,0.00012935468,0.000045292647,0.0004070729,0.00007317054,0.0043029785,0.0001314767,0.0002124775,0.00013108534],"study_design_candidate":"design_other","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.0003384433,0.00021979422,0.0001647839,0.0001980067,0.000075984564,0.0006137746,0.118530445,0.00023908708,0.1745306,0.021193108,0.011429613,0.67246634],"study_design_scores_gemma":[0.0044043353,0.0006928997,0.00032662286,0.00044084457,0.0001526072,0.0015279509,0.006525106,0.5061256,0.113073975,0.0059935586,0.35863033,0.0021061248],"about_ca_topic_score_codex":0.000075682095,"about_ca_topic_score_gemma":0.000005036375,"teacher_disagreement_score":0.8691895,"about_ca_system_score_codex":0.000051965642,"about_ca_system_score_gemma":0.0001006731,"threshold_uncertainty_score":0.7367859},"labels":[],"label_agreement":null},{"id":"W4405244595","doi":"10.1002/spe.3396","title":"Parsing Millions of DNS Records Per Second","year":2024,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parsing; Daemon; SIMD; Parallel computing; Operating system; Programming language","score_opus":0.010207565588996693,"score_gpt":0.2646817869432221,"score_spread":0.25447422135422537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405244595","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9392159,0.02723743,0.026119784,0.00022280564,0.0026443757,0.00025884257,0.000034877667,0.00066246086,0.003603506],"genre_scores_gemma":[0.99245036,0.00096969085,0.0061112107,0.00010895293,0.00015587104,0.000040517414,0.000004480611,0.00002988416,0.00012902665],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989767,0.000043311473,0.00024138644,0.00027715228,0.00016593523,0.00029548947],"domain_scores_gemma":[0.9989482,0.0005990721,0.000032043128,0.000263093,0.000067793044,0.000089779875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026421403,0.00015531044,0.00017365273,0.000062535815,0.000110714005,0.00011169535,0.00011196888,0.000098911994,0.0003403854],"category_scores_gemma":[0.0003400545,0.00015668501,0.000051347353,0.00024292587,0.000114929644,0.0011751439,0.00006673346,0.00030233507,0.000026619677],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040124514,0.0005915802,0.011817717,0.0057384134,0.0006882652,0.00047209076,0.5706046,0.0040753335,0.016915068,0.0035178328,0.030839961,0.35433787],"study_design_scores_gemma":[0.0004908507,0.0002246043,0.0016251521,0.0005664935,0.00019472523,0.00042015454,0.02674539,0.020315267,0.009261275,0.0015979934,0.93750185,0.0010562437],"about_ca_topic_score_codex":0.00007305043,"about_ca_topic_score_gemma":0.00007841066,"teacher_disagreement_score":0.90666187,"about_ca_system_score_codex":0.000051923893,"about_ca_system_score_gemma":0.000035316647,"threshold_uncertainty_score":0.6389429},"labels":[],"label_agreement":null},{"id":"W4405868299","doi":"10.1002/spe.3401","title":"Android Source Code Smells: A Systematic Literature Review","year":2024,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Engineering Research","field":"Computer Science","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":"University of New Brunswick","funders":"","keywords":"Code smell; Code refactoring; Android (operating system); Computer science; Software engineering; Software quality; Code review; Software; Data science; World Wide Web; Software development; Programming language; Operating system","score_opus":0.014181815966298993,"score_gpt":0.3108355000391105,"score_spread":0.2966536840728115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405868299","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062088715,0.5422435,0.45337322,0.0018246664,0.00040146845,0.00043871364,0.0000029594405,0.0010257683,0.000068835856],"genre_scores_gemma":[0.22982769,0.46765488,0.28277954,0.01177738,0.00057417864,0.0019597793,0.000018054323,0.00019809864,0.0052103903],"study_design_codex":"systematic_review","study_design_gemma":"systematic_review","domain_scores_codex":[0.99786776,0.00017739329,0.00031889084,0.0006658804,0.00058335724,0.00038669878],"domain_scores_gemma":[0.9950405,0.0037173305,0.00006520133,0.00080123416,0.00018197829,0.00019377214],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000969177,0.00022119642,0.00030783188,0.0001389746,0.00014316298,0.0012021636,0.0007674814,0.00008116304,0.000012419011],"category_scores_gemma":[0.010504975,0.00017808369,0.0000679323,0.0012582233,0.0000656948,0.0027053996,0.00036149938,0.00044800414,0.00014505636],"study_design_candidate":"systematic_review","study_design_consensus":"systematic_review","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003548942,0.0002529156,0.00073691533,0.7294972,0.00032104316,0.0056391936,0.12473001,0.000063476386,0.00052291,0.011893515,0.029377604,0.09692972],"study_design_scores_gemma":[0.00046612506,0.00047820728,0.0001763681,0.49882975,0.00021944553,0.015409415,0.0020856413,0.019413808,0.00084270805,0.0006601708,0.4594023,0.0020160722],"about_ca_topic_score_codex":0.000006398485,"about_ca_topic_score_gemma":4.4879656e-7,"teacher_disagreement_score":0.43002468,"about_ca_system_score_codex":0.000050809464,"about_ca_system_score_gemma":0.00009521837,"threshold_uncertainty_score":0.99983466},"labels":[],"label_agreement":null},{"id":"W4408500266","doi":"10.1002/spe.3420","title":"Scanning HTML at Tens of Gigabytes Per Second on ARM Processors","year":2025,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Operating system","score_opus":0.012210890309218783,"score_gpt":0.2917902655946673,"score_spread":0.2795793752854485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408500266","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91855264,0.0016872255,0.06817478,0.002995685,0.00028123334,0.00013378868,0.000013183592,0.00022555089,0.007935922],"genre_scores_gemma":[0.9628224,0.00007963843,0.03364682,0.0014107827,0.000019730387,0.000024394076,0.0000029683795,0.0000054794596,0.001987836],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988119,0.00005048711,0.00021453621,0.00047047672,0.00023372522,0.00021888847],"domain_scores_gemma":[0.99849904,0.0006343805,0.00016470517,0.00048489036,0.00014900611,0.00006796495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025757207,0.00013245892,0.0001872357,0.00013326733,0.00026687147,0.00014333196,0.00050633337,0.00005047146,0.000052887583],"category_scores_gemma":[0.0014622895,0.000114385235,0.000041533538,0.00048420118,0.00012739685,0.0012142182,0.0003617927,0.00013103854,0.000018882933],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058975734,0.0021017364,0.10927945,0.0011303469,0.0007320694,0.0002430913,0.3140287,0.00047720937,0.020903267,0.040375117,0.026504437,0.4836348],"study_design_scores_gemma":[0.002458934,0.0017261334,0.022631973,0.0019078909,0.0003940293,0.00027851193,0.07101793,0.01339745,0.22856118,0.0034118,0.6516431,0.0025710785],"about_ca_topic_score_codex":0.000051073384,"about_ca_topic_score_gemma":0.000009393302,"teacher_disagreement_score":0.62513864,"about_ca_system_score_codex":0.000025155561,"about_ca_system_score_gemma":0.00008648675,"threshold_uncertainty_score":0.46644947},"labels":[],"label_agreement":null},{"id":"W4412636227","doi":"10.1002/spe.70010","title":"Leveraging the Power of Images: Image Recommendation to Enhance Issue Reports","year":2025,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Image (mathematics); Data science; Power (physics); Computer vision; Information retrieval; Artificial intelligence","score_opus":0.012337132147721657,"score_gpt":0.3599018589456765,"score_spread":0.34756472679795486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412636227","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.0031228038,0.00010664787,0.9809515,0.013143787,0.00030461463,0.00011096895,0.0000015375305,0.00006289386,0.0021952502],"genre_scores_gemma":[0.7855543,0.00023758154,0.1945313,0.017969893,0.000032309697,0.0000402486,0.000008459595,0.000008586322,0.0016173235],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990769,0.00007189292,0.00025761614,0.00031131477,0.00015130022,0.00013097629],"domain_scores_gemma":[0.9987488,0.0003311336,0.00017337217,0.00048363602,0.00021905634,0.00004400834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047656198,0.000082330494,0.00009971423,0.00006666297,0.00017619172,0.00023833239,0.00031727858,0.00002140135,0.00004675409],"category_scores_gemma":[0.002617861,0.00006513277,0.000018845867,0.0005627035,0.000060275084,0.0016206455,0.0003268835,0.000077728495,0.000011725694],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007630426,0.00054569554,0.0031072267,0.00017877234,0.00010694362,0.00012292656,0.23747654,0.000063768006,0.013375201,0.016630644,0.16257651,0.56573945],"study_design_scores_gemma":[0.00010522931,0.000077989826,0.0007442517,0.00012629303,0.00002048894,0.00007028791,0.019688029,0.0012401695,0.059849944,0.0012024235,0.91659486,0.0002800449],"about_ca_topic_score_codex":0.000056489935,"about_ca_topic_score_gemma":0.0000011496426,"teacher_disagreement_score":0.78642017,"about_ca_system_score_codex":0.000014857962,"about_ca_system_score_gemma":0.000059259954,"threshold_uncertainty_score":0.3134013},"labels":[],"label_agreement":null},{"id":"W4414586197","doi":"10.1002/spe.70024","title":"Project Templating and Onboarding With Cookiecutter: Foundations, Uses, and Guidelines","year":2025,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Telus (Canada); Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Onboarding; Context (archaeology); Python (programming language); Web application; Software; Quality (philosophy); Metadata","score_opus":0.060368696277296664,"score_gpt":0.3940579685862917,"score_spread":0.33368927230899503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414586197","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.032737944,0.0024818957,0.96283776,0.0011923044,0.00012658705,0.00017457969,8.5702726e-7,0.00036843712,0.00007962061],"genre_scores_gemma":[0.046368908,0.00071368355,0.95197093,0.0007919693,0.000021395243,0.00005910948,6.2359743e-7,0.000008080058,0.000065292974],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99887323,0.000086072105,0.00020993127,0.00047355267,0.00014322963,0.00021399022],"domain_scores_gemma":[0.9969526,0.0024322798,0.00010467147,0.00028891666,0.00017567418,0.000045878965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004477874,0.0001641946,0.00017524802,0.00011201952,0.00034707066,0.00034108182,0.00018946815,0.000048170135,4.1874137e-7],"category_scores_gemma":[0.00786191,0.00013783746,0.0000097803695,0.00035512034,0.00015059013,0.0022197997,0.00034719508,0.00014968918,3.9231205e-7],"study_design_candidate":"design_other","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.000119703334,0.000052159885,0.027165048,0.0003240943,0.000112327594,0.00010058965,0.027081406,0.0012354563,0.0013043871,0.026837474,0.00066964095,0.9149977],"study_design_scores_gemma":[0.009419349,0.0030794495,0.057055835,0.0076651443,0.0006400818,0.00823332,0.13061015,0.045199133,0.017548528,0.06563354,0.6459726,0.008942842],"about_ca_topic_score_codex":0.00008613035,"about_ca_topic_score_gemma":0.000005100001,"teacher_disagreement_score":0.90605485,"about_ca_system_score_codex":0.000020422342,"about_ca_system_score_gemma":0.000078901976,"threshold_uncertainty_score":0.9412009},"labels":[],"label_agreement":null},{"id":"W4416127924","doi":"10.1002/spe.70030","title":"Exploring the Impacts of Antipatterns on Object‐Oriented, Service‐Oriented, and Mobile‐Oriented Systems","year":2025,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Engineering Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi; Concordia University","funders":"","keywords":"Coding (social sciences); Software quality; Program comprehension; Comprehension; Source code; Software; Quality (philosophy); Software maintenance","score_opus":0.031122302989594865,"score_gpt":0.3096959911286585,"score_spread":0.27857368813906364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416127924","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81479985,0.0014537937,0.18102787,0.00060847023,0.0012528076,0.0005169744,0.000007278722,0.00026968375,0.00006329061],"genre_scores_gemma":[0.9940887,0.0007608256,0.004098085,0.0005001341,0.000053996653,0.00042490844,0.0000022262,0.000018873248,0.000052229825],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975091,0.00018670484,0.0004026352,0.0006958376,0.00066541246,0.00054026657],"domain_scores_gemma":[0.994476,0.0036681578,0.00017669893,0.001051823,0.0004419088,0.00018538881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071621436,0.00028552304,0.00030053314,0.00027123603,0.00036663195,0.00026247784,0.0007154998,0.00007199516,0.0000024568822],"category_scores_gemma":[0.003931288,0.00022098202,0.00004353343,0.0015842341,0.00019721268,0.0021144885,0.00073172676,0.000443147,0.000008553008],"study_design_candidate":"qualitative","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.0013342451,0.0018055519,0.33830732,0.0038390316,0.0008261674,0.00064237294,0.40960264,0.003261671,0.006436716,0.09375303,0.001450975,0.13874027],"study_design_scores_gemma":[0.009746744,0.005669919,0.27171707,0.009360794,0.00037675575,0.0021666312,0.20697117,0.036509566,0.059661984,0.00045911077,0.3923652,0.004995076],"about_ca_topic_score_codex":0.0007365952,"about_ca_topic_score_gemma":0.000007730888,"teacher_disagreement_score":0.39091423,"about_ca_system_score_codex":0.00007124942,"about_ca_system_score_gemma":0.00012891988,"threshold_uncertainty_score":0.90113854},"labels":[],"label_agreement":null},{"id":"W99937609","doi":"","title":"Automating the analysis of design component contracts: Research Articles","year":2006,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Advanced Software Engineering Methodologies","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":"University of Waterloo","funders":"","keywords":"Computer science; Component (thermodynamics); Software engineering; Structural pattern; Component-based software engineering; Software design pattern; Reuse; Software system; Context (archaeology); Software; Object-oriented design; Key (lock); Software design; Distributed computing; Software development; Systems engineering; Programming language; Operating system; Engineering","score_opus":0.10941659591340971,"score_gpt":0.3914585033118165,"score_spread":0.28204190739840673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W99937609","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.088873625,0.0011610312,0.90896255,0.00053543993,0.00006943977,0.0001394866,8.511343e-7,0.00023034288,0.000027212282],"genre_scores_gemma":[0.4880065,0.000037625192,0.51184595,0.00005482554,0.000012370918,0.000030097104,3.9400658e-7,0.000003876798,0.000008386425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779016,0.0007357017,0.00031203582,0.00033089396,0.00049460196,0.00033663836],"domain_scores_gemma":[0.9812486,0.017653449,0.00017695934,0.0005732934,0.0003014741,0.000046229135],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0029935546,0.0001126337,0.00022270573,0.00020668787,0.00031581277,0.00015800237,0.0006329346,0.00004533778,0.0000031911627],"category_scores_gemma":[0.010374576,0.00008195536,0.00004741804,0.0017277456,0.00030177462,0.0011411615,0.00028985683,0.00023487589,0.000002651912],"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.00015267711,0.0005298262,0.008867709,0.00007694149,0.0006615272,0.00014134342,0.07045564,0.48425612,0.036888234,0.056022972,0.00041177144,0.34153524],"study_design_scores_gemma":[0.0015683378,0.00084908423,0.29631028,0.00027873763,0.00091694464,0.00029378958,0.034734692,0.43056244,0.14050037,0.08298417,0.008919957,0.002081182],"about_ca_topic_score_codex":0.00027357813,"about_ca_topic_score_gemma":0.000005361056,"teacher_disagreement_score":0.39913288,"about_ca_system_score_codex":0.00003271833,"about_ca_system_score_gemma":0.000040955005,"threshold_uncertainty_score":0.99796146},"labels":[],"label_agreement":null}]}