{"meta":{"query_hash":"b00d9081fc8c","filters":{"venue":"Journal of Systems Architecture"},"cohort_total":40,"direct_labels_cover":0,"predictions_cover":40,"exported":40,"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/b00d9081fc8c","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Systems+Architecture"},"results":[{"id":"W1210553197","doi":"10.1016/j.sysarc.2015.07.009","title":"Memory organizations for 3D-DRAMs and PCMs in processor memory hierarchy","year":2015,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Advanced Micro Devices","keywords":"Computer science; Dram; Universal memory; Interleaved memory; CAS latency; Registered memory; Parallel computing; Embedded system; Memory hierarchy; Phase-change memory; Memory controller; Computer hardware; Cache; Memory management; Semiconductor memory","score_opus":0.015710484784179742,"score_gpt":0.252119442067023,"score_spread":0.23640895728284328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1210553197","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.0123658925,0.0014063906,0.98398703,0.001095933,0.00037731597,0.00031605555,0.0000018563122,0.00007629714,0.0003732151],"genre_scores_gemma":[0.6046283,0.000026667996,0.3943705,0.0001800732,0.0003709167,0.000014229109,0.0000015601014,0.000021998529,0.00038570908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988037,0.00011539482,0.00048060223,0.0001730851,0.00024355763,0.00018370902],"domain_scores_gemma":[0.9985764,0.000116422285,0.00036534815,0.00019310263,0.0005922655,0.00015643606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089478027,0.00012569982,0.00028608087,0.00036697672,0.00007347343,0.00015732531,0.0004959795,0.00008100997,4.785678e-7],"category_scores_gemma":[0.00036107656,0.00009689753,0.000034905595,0.000565752,0.00003375073,0.00024231206,0.00009449749,0.00023448549,6.5683264e-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.00013137345,0.00030356113,0.0017675296,0.00070305774,0.000116630894,0.00008801503,0.035805177,0.86529607,0.0007717329,0.00402289,0.014774214,0.07621973],"study_design_scores_gemma":[0.0072800354,0.0021486226,0.0012388537,0.0018159265,0.000061397,0.0053462093,0.0015681409,0.9245469,0.0028495353,0.021163331,0.030714476,0.0012665947],"about_ca_topic_score_codex":0.000017066937,"about_ca_topic_score_gemma":0.000006043431,"teacher_disagreement_score":0.59226245,"about_ca_system_score_codex":0.00005675997,"about_ca_system_score_gemma":0.0002748109,"threshold_uncertainty_score":0.39513665},"labels":[],"label_agreement":null},{"id":"W1963583097","doi":"10.1016/j.sysarc.2013.08.009","title":"Optimizing the implementation of real-time Simulink models onto distributed automotive architectures","year":2013,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"FlexRay; Computer science; Scheduling (production processes); Schedule; Implementation; Distributed computing; Automotive industry; Embedded system; Models of communication; Operating system; Programming language","score_opus":0.012966135290705637,"score_gpt":0.2666403278785654,"score_spread":0.2536741925878598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963583097","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.101195134,0.00048956554,0.8953812,0.000997783,0.00030609337,0.0010847874,0.000025079342,0.0001341466,0.00038618088],"genre_scores_gemma":[0.9520342,0.000016348336,0.047531955,0.000053015163,0.00025706724,0.000036118512,0.0000025746624,0.000025553729,0.000043188924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99630666,0.00076128135,0.0013783192,0.00027317004,0.0008889126,0.00039163657],"domain_scores_gemma":[0.9958116,0.00052817934,0.001847958,0.00072084856,0.00093353074,0.00015792876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013624879,0.00029877241,0.0006610057,0.00034575246,0.00014316244,0.0002610535,0.0017104676,0.00013258781,0.000014491367],"category_scores_gemma":[0.0000688207,0.00017840655,0.000288668,0.00046200896,0.00008711679,0.00045738247,0.00021107527,0.0005218193,0.0000055704268],"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.000053469514,0.00013447723,0.000285681,0.0004108844,0.0006888708,0.000056069115,0.04482817,0.7989187,0.119699776,0.00742813,0.008094003,0.019401764],"study_design_scores_gemma":[0.0040519903,0.0039257007,0.006849261,0.0034663214,0.00029971934,0.00439373,0.009370642,0.7956232,0.075452805,0.09301147,0.001573317,0.0019818319],"about_ca_topic_score_codex":0.0010121888,"about_ca_topic_score_gemma":0.000017136112,"teacher_disagreement_score":0.850839,"about_ca_system_score_codex":0.00015817319,"about_ca_system_score_gemma":0.00019716626,"threshold_uncertainty_score":0.72752076},"labels":[],"label_agreement":null},{"id":"W1965042227","doi":"10.1016/j.sysarc.2010.07.002","title":"Modeling and evaluation of ring-based interconnects for Network-on-Chip","year":2010,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Ring (chemistry); Chip; Computer architecture; Embedded system; Parallel computing; Telecommunications","score_opus":0.02838903869049094,"score_gpt":0.2748514868725567,"score_spread":0.24646244818206578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965042227","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.4033378,0.00026943628,0.59297925,0.00018894619,0.0028035147,0.00027467113,0.0000012667815,0.0000099245835,0.0001351648],"genre_scores_gemma":[0.99363524,0.0000013482755,0.0050181886,0.000062011415,0.0012484393,0.0000136627505,4.1049393e-7,0.000011832754,0.000008840609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982324,0.00021256233,0.00067577045,0.00017940305,0.00050532323,0.0001945006],"domain_scores_gemma":[0.9979844,0.00031329595,0.00053660205,0.00027688604,0.00079401,0.000094802395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038240303,0.00013839333,0.00035589488,0.00023023401,0.000092009665,0.00011601434,0.0003711059,0.000111220186,0.0000020432815],"category_scores_gemma":[0.00019270995,0.00009978229,0.00015153704,0.00014747465,0.000021226531,0.00013355585,0.000033098702,0.00038281854,3.777586e-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.000052491836,0.000020406032,0.000073325224,0.00008888412,0.0000422883,0.0000014286111,0.0004572992,0.98343796,0.0016932782,0.0070215226,0.00015428646,0.006956843],"study_design_scores_gemma":[0.00094737654,0.00039989204,0.00004336032,0.00054596044,0.000026376305,0.00021581263,0.000049306047,0.99470097,0.00025117962,0.002309386,0.00041024742,0.000100109995],"about_ca_topic_score_codex":0.000017616077,"about_ca_topic_score_gemma":0.000052398318,"teacher_disagreement_score":0.59029746,"about_ca_system_score_codex":0.000029058267,"about_ca_system_score_gemma":0.0001167652,"threshold_uncertainty_score":0.40690038},"labels":[],"label_agreement":null},{"id":"W1969370902","doi":"10.1016/j.sysarc.2006.12.007","title":"Designing layout–timing independent quantum-dot cellular automata (QCA) circuits by global asynchrony","year":2007,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Quantum-Dot Cellular Automata","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Calgary; University of Missouri","keywords":"Computer science; Quantum dot cellular automaton; Asynchrony (computer programming); Asynchronous communication; Cellular automaton; Electronic circuit; Very-large-scale integration; Computer architecture; Electronic engineering; Algorithm; Embedded system; Telecommunications; Electrical engineering","score_opus":0.0158462246452294,"score_gpt":0.2450313002799892,"score_spread":0.22918507563475982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969370902","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.1986538,0.0045987563,0.7929732,0.00037845384,0.0024283263,0.00034156867,0.000015443109,0.00021803833,0.00039238663],"genre_scores_gemma":[0.9875408,0.000012004065,0.011528299,0.00013497807,0.0006453267,0.0000032880043,0.0000052908767,0.000052485157,0.00007752518],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936286,0.00047739383,0.0018312513,0.0006729041,0.0022515375,0.0011383144],"domain_scores_gemma":[0.99575883,0.00033226074,0.0017344888,0.0011599159,0.00035851708,0.0006559939],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0047259443,0.0005678825,0.0009210595,0.0004755987,0.00032353608,0.000673608,0.0031394605,0.00033799402,0.000012040927],"category_scores_gemma":[0.00017754863,0.0004831162,0.0003891837,0.00094108627,0.00009953806,0.00076953374,0.00048569674,0.0011344438,0.000056141937],"study_design_candidate":"bench_or_experimental","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.0001686254,0.001066746,0.008533145,0.0013827041,0.0013855489,0.014429233,0.0093861995,0.036459662,0.8143984,0.022709189,0.019181358,0.070899166],"study_design_scores_gemma":[0.02226894,0.007060196,0.024443978,0.011583825,0.0011178784,0.123663984,0.0057680216,0.466629,0.23137908,0.01632992,0.07933305,0.010422124],"about_ca_topic_score_codex":0.00010123023,"about_ca_topic_score_gemma":0.000012970534,"teacher_disagreement_score":0.788887,"about_ca_system_score_codex":0.00060747116,"about_ca_system_score_gemma":0.00041865936,"threshold_uncertainty_score":0.99976206},"labels":[],"label_agreement":null},{"id":"W1978517199","doi":"10.1016/j.sysarc.2007.11.004","title":"A quantitative analysis of the .NET common language runtime","year":2008,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Computer science; Net (polyhedron); Programming language; Parallel computing; Theoretical computer science","score_opus":0.01721380086410277,"score_gpt":0.2710949360554959,"score_spread":0.2538811351913931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978517199","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.60103923,0.0023176933,0.39466363,0.00027809796,0.0004208032,0.0002920942,0.000013436149,0.000052043288,0.0009229973],"genre_scores_gemma":[0.98585474,0.000010656785,0.013810006,0.0000505825,0.000072914896,0.0000034492707,3.8657365e-7,0.0000096477015,0.00018763814],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973871,0.00063291995,0.0008769763,0.00015929976,0.00075893034,0.00018478316],"domain_scores_gemma":[0.99715114,0.0003192795,0.0014387704,0.00074115145,0.00027447517,0.000075203236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010157205,0.00016090718,0.0007537012,0.00067288004,0.00010380602,0.000044383247,0.001602994,0.00008933656,0.000003873951],"category_scores_gemma":[0.000100835205,0.000091994276,0.00049604377,0.0017496394,0.00010274518,0.00017517674,0.00015421647,0.00040338325,0.0000015633966],"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.0003567677,0.000932257,0.0922696,0.0009358882,0.01627677,0.0020299973,0.30174398,0.13984323,0.3403743,0.06974538,0.029378986,0.006112853],"study_design_scores_gemma":[0.0067870202,0.009819505,0.341361,0.008935943,0.006486641,0.039345678,0.01401444,0.41259363,0.12774223,0.009531897,0.01873667,0.004645376],"about_ca_topic_score_codex":0.0002440107,"about_ca_topic_score_gemma":0.000044285935,"teacher_disagreement_score":0.3848155,"about_ca_system_score_codex":0.000059730584,"about_ca_system_score_gemma":0.00010893871,"threshold_uncertainty_score":0.37514177},"labels":[],"label_agreement":null},{"id":"W2004758929","doi":"10.1016/j.sysarc.2010.06.003","title":"Using complexity, coupling, and cohesion metrics as early indicators of vulnerabilities","year":2010,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Software Engineering Research","field":"Computer Science","cited_by":289,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Cohesion (chemistry); Software security assurance; Software quality; Secure coding; Software metric; Software bug; Vulnerability (computing); Software; Data mining; Software evolution; Vulnerability management; Software development; Software engineering; Computer security; Software construction; Vulnerability assessment; Information security","score_opus":0.029593890437432966,"score_gpt":0.29178655686711547,"score_spread":0.2621926664296825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004758929","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.869228,0.0005879598,0.12930341,0.000056115292,0.0006741027,0.00010631268,0.0000022075844,0.000023250464,0.000018620136],"genre_scores_gemma":[0.9727693,0.000007210619,0.027015934,0.0000051420675,0.0001762504,7.6298744e-7,1.05562634e-7,0.000012445077,0.000012808359],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9983122,0.000059686325,0.00047762712,0.00014958394,0.00079289795,0.00020802244],"domain_scores_gemma":[0.9979267,0.0009082273,0.0004038519,0.000315362,0.000263185,0.00018267253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013586201,0.00012516516,0.00034696836,0.001004656,0.00008095192,0.00014191729,0.0006819996,0.000106692925,0.0000032582586],"category_scores_gemma":[0.001191092,0.00009519275,0.00007425342,0.0007095176,0.00015088308,0.00018147891,0.0002079007,0.0008564899,7.255487e-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.00011255846,0.00028709252,0.71367484,0.0020773837,0.0004191903,0.00027025118,0.016752634,0.07049615,0.15256517,0.025940474,0.00020572706,0.01719851],"study_design_scores_gemma":[0.0053686984,0.0051039914,0.68507695,0.0031877346,0.00017539761,0.01553681,0.0012387611,0.19554898,0.057072856,0.02164743,0.007895169,0.0021472285],"about_ca_topic_score_codex":0.00016303132,"about_ca_topic_score_gemma":0.000004139103,"teacher_disagreement_score":0.12505282,"about_ca_system_score_codex":0.000035174653,"about_ca_system_score_gemma":0.00015227082,"threshold_uncertainty_score":0.3881848},"labels":[],"label_agreement":null},{"id":"W2009534449","doi":"10.1016/j.sysarc.2012.12.002","title":"NISHA: A fault-tolerant NoC router enabling deadlock-free Interconnection of Subnets in Hierarchical Architectures","year":2013,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Virtual channel; Router; Network on a chip; Redundancy (engineering); Fault tolerance; Deadlock; Interconnection; Distributed computing; Latency (audio); Computer network; Network topology; Embedded system; Channel (broadcasting)","score_opus":0.00909105520208276,"score_gpt":0.2156633856955971,"score_spread":0.20657233049351434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009534449","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.650614,0.000915606,0.34334454,0.001285247,0.0026670087,0.00049671653,0.000004795456,0.000043760665,0.0006283159],"genre_scores_gemma":[0.9946325,0.0000126883015,0.004073011,0.00015123791,0.0009569188,0.000026641968,8.964637e-7,0.000027427352,0.00011870474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958465,0.0006291314,0.0018391102,0.00039805874,0.00075659924,0.00053058134],"domain_scores_gemma":[0.99706554,0.00042616707,0.001064658,0.0007379522,0.00047887623,0.00022681567],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012792178,0.00034593075,0.0009179104,0.0010642898,0.000094961164,0.000315541,0.0016123422,0.00024546,0.000021346792],"category_scores_gemma":[0.00023405622,0.00024590662,0.00038256694,0.0006461089,0.00007676293,0.00039323352,0.00028593434,0.0011924137,0.000008975865],"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.00078755163,0.001276437,0.017521191,0.0019433136,0.0010599117,0.00079016,0.050604805,0.716323,0.04053848,0.020797264,0.011975675,0.13638216],"study_design_scores_gemma":[0.020359335,0.007325164,0.041198563,0.018241938,0.00013766876,0.051031616,0.00495426,0.75436974,0.0075568417,0.05574829,0.03524503,0.003831568],"about_ca_topic_score_codex":0.0007743247,"about_ca_topic_score_gemma":0.0002689902,"teacher_disagreement_score":0.34401846,"about_ca_system_score_codex":0.00014086533,"about_ca_system_score_gemma":0.00011481856,"threshold_uncertainty_score":0.99999934},"labels":[],"label_agreement":null},{"id":"W2014577314","doi":"10.1016/j.sysarc.2006.10.012","title":"Genetic algorithms for hardware–software partitioning and optimal resource allocation","year":2006,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Software; Scheduling (production processes); Genetic algorithm; Minification; Embedded system; Task (project management); High-level synthesis; Algorithm; Field-programmable gate array; Distributed computing; Computer hardware; Mathematical optimization; Operating system","score_opus":0.013506425898155839,"score_gpt":0.24142360746124059,"score_spread":0.22791718156308474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014577314","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.015967226,0.002570347,0.9802474,0.00033656703,0.00026432265,0.00042513417,0.000005745878,0.00011275761,0.00007051976],"genre_scores_gemma":[0.44443756,0.0000067711635,0.55444026,0.000043366348,0.0008402871,0.000038113925,0.0000018138811,0.000021929656,0.00016989082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99822795,0.00017167389,0.0007141053,0.00024027721,0.00039599597,0.00024996654],"domain_scores_gemma":[0.9984221,0.00021451413,0.0006574602,0.00030039693,0.00030717903,0.00009837055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008170224,0.00017143635,0.00033272675,0.0002568138,0.00015187608,0.0002981259,0.00048993935,0.000113411166,6.0050144e-7],"category_scores_gemma":[0.00008318166,0.00014066478,0.00011083614,0.00018255031,0.000038192873,0.00024427357,0.00006431823,0.00021972628,8.591012e-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.00028385295,0.00046385737,0.01173443,0.0034712174,0.0006037495,0.000621242,0.0112361,0.54984176,0.05205879,0.040954277,0.09613302,0.23259772],"study_design_scores_gemma":[0.00799313,0.0067340005,0.030695911,0.008287765,0.00038984738,0.043991163,0.0011429327,0.3520559,0.030478695,0.04787004,0.466656,0.003704626],"about_ca_topic_score_codex":0.000050006867,"about_ca_topic_score_gemma":0.0000050474746,"teacher_disagreement_score":0.42847034,"about_ca_system_score_codex":0.00007114326,"about_ca_system_score_gemma":0.00007374758,"threshold_uncertainty_score":0.5736143},"labels":[],"label_agreement":null},{"id":"W2017246830","doi":"10.1016/j.sysarc.2013.10.007","title":"Adaptive GTS allocation in IEEE 802.15.4 for real-time wireless sensor networks","year":2013,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; IEEE 802.15; Computer network; IEEE 802.11; Network allocation vector; Wireless sensor network; IEEE 802; Bandwidth (computing); Scheme (mathematics); Bandwidth allocation; Wireless; Inter-Access Point Protocol; Real-time computing; Wireless network; Quality of service; Wi-Fi; Telecommunications","score_opus":0.012894835689795362,"score_gpt":0.237554099500735,"score_spread":0.22465926381093965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017246830","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.049734987,0.00024191885,0.9424431,0.0008223511,0.000875393,0.005601898,0.000002676824,0.00004126574,0.00023645583],"genre_scores_gemma":[0.9753548,0.000031568692,0.02134762,0.00011170291,0.0018005366,0.0009865358,0.0000014282504,0.000032463788,0.00033334186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978849,0.00027460806,0.000799889,0.00025975838,0.00036399954,0.00041681796],"domain_scores_gemma":[0.9979319,0.0003829519,0.00076956,0.00034775646,0.00039444646,0.00017336571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086233194,0.00022236102,0.00052199466,0.00022719734,0.000089252506,0.00025159857,0.00074428256,0.0001881672,0.000005841051],"category_scores_gemma":[0.000019740552,0.0001652085,0.00016288875,0.00036454204,0.000031239255,0.00039545767,0.000053760858,0.00044614467,0.000011466213],"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.00014856514,0.00010027102,0.0003181271,0.00014148964,0.00009623601,0.000042914548,0.001443587,0.92185855,0.0048058564,0.0014791242,0.010097125,0.05946817],"study_design_scores_gemma":[0.0012317373,0.0006451963,0.0019578992,0.0010449805,0.000011405808,0.00035078265,0.00008330638,0.99122477,0.00019820577,0.0011535783,0.0017823598,0.000315758],"about_ca_topic_score_codex":0.00015146658,"about_ca_topic_score_gemma":0.000020876258,"teacher_disagreement_score":0.92561984,"about_ca_system_score_codex":0.00009651481,"about_ca_system_score_gemma":0.00011063358,"threshold_uncertainty_score":0.67370075},"labels":[],"label_agreement":null},{"id":"W2024928975","doi":"10.1016/j.sysarc.2003.08.009","title":"A novel FPGA local interconnect test scheme and automatic TC derivation/generation","year":2003,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada); University of Alberta","funders":"","keywords":"Field-programmable gate array; Computer science; Scheme (mathematics); Interconnection; Set (abstract data type); Test set; Gate array; Code (set theory); Embedded system; Parallel computing; Automatic test pattern generation; Algorithm; Computer engineering; Computer hardware; Electronic circuit; Electrical engineering; Mathematics; Artificial intelligence; Programming language; Telecommunications","score_opus":0.020964916460518346,"score_gpt":0.2254189133517613,"score_spread":0.20445399689124297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024928975","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.12736471,0.0007141733,0.870996,0.00028575215,0.0003524288,0.000080190366,8.420097e-7,0.000031002884,0.00017491555],"genre_scores_gemma":[0.9796406,0.0000038857456,0.019949852,0.00012128375,0.00024921377,0.0000021461724,3.6130362e-7,0.00000869128,0.000023957202],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880415,0.00008211456,0.0005005322,0.00016031286,0.00027732077,0.00017554725],"domain_scores_gemma":[0.9989162,0.00022683718,0.00039574818,0.00017697443,0.00017259491,0.0001116326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006410531,0.00013235152,0.00024246494,0.00019813573,0.00012225602,0.00024145131,0.00027036484,0.000060335995,0.0000025903612],"category_scores_gemma":[0.0006398544,0.000099905796,0.00005988204,0.00027792397,0.000034494795,0.00029422695,0.00003419492,0.0002649639,0.00000217053],"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.000001099576,0.00030486882,0.006635529,0.000562404,0.00018784124,0.00017384742,0.006182508,0.022388427,0.4889103,0.021946914,0.00088802754,0.45181826],"study_design_scores_gemma":[0.0024283053,0.0009693228,0.0046244785,0.0020250196,0.00005273931,0.032706067,0.0007027535,0.94003856,0.008900235,0.0019400115,0.004827524,0.00078496395],"about_ca_topic_score_codex":0.000010916298,"about_ca_topic_score_gemma":0.000007738153,"teacher_disagreement_score":0.91765016,"about_ca_system_score_codex":0.000048967566,"about_ca_system_score_gemma":0.00011557689,"threshold_uncertainty_score":0.407404},"labels":[],"label_agreement":null},{"id":"W2051443115","doi":"10.1016/j.sysarc.2013.09.001","title":"High performance NoC synthesis using analytical modeling and simulation with optimal power and minimal IC area","year":2013,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Tabu search; Deadlock; Network topology; Power (physics); Computer architecture; Process (computing); Computer engineering; Distributed computing; Parallel computing; Algorithm; Computer network","score_opus":0.016029207948177707,"score_gpt":0.22100770103324885,"score_spread":0.20497849308507116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051443115","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.573552,0.00015041383,0.42595685,0.000075533666,0.00015516528,0.000081823586,4.11638e-7,0.000007825423,0.00001998158],"genre_scores_gemma":[0.98855805,0.000005836348,0.011161078,0.0000199158,0.00022413388,0.0000025608028,6.9082496e-8,0.000010673108,0.000017658662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875015,0.00008825053,0.00046462944,0.0001890884,0.00030648411,0.00020142553],"domain_scores_gemma":[0.999031,0.00012922243,0.00029424916,0.00015360222,0.00026006377,0.000131854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037699947,0.0001554031,0.00034717174,0.00020462292,0.00013346312,0.00035654797,0.0001715278,0.00008061257,0.000004871067],"category_scores_gemma":[0.00002687531,0.000098321834,0.00004445257,0.00014528025,0.000034751185,0.0005351039,0.000053932265,0.00024715945,8.058905e-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.000032225995,0.000010503343,0.00067303836,0.00004543185,0.000051142753,0.000010635614,0.00054580375,0.9967527,0.0002534381,0.000106024905,0.0000087753115,0.001510301],"study_design_scores_gemma":[0.00022233112,0.00028420868,0.000770573,0.0004945648,0.000021964963,0.0018342376,0.00018832226,0.9959967,0.000019140205,0.000018015005,0.000022963462,0.00012695139],"about_ca_topic_score_codex":0.00006734598,"about_ca_topic_score_gemma":0.000001341504,"teacher_disagreement_score":0.4150061,"about_ca_system_score_codex":0.000038310154,"about_ca_system_score_gemma":0.000035420937,"threshold_uncertainty_score":0.4009448},"labels":[],"label_agreement":null},{"id":"W2081744702","doi":"10.1016/s1383-7621(01)00026-1","title":"A robust stack folding approach for Java processors: an operand extraction-based algorithm","year":2001,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"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":"Computer science; Operand; Folding (DSP implementation); Algorithm; Java; Stack (abstract data type); Parallel computing; Bytecode; Call stack; Code (set theory); Benchmarking; Java bytecode; Programming language; Operating system; Java applet","score_opus":0.03553081575273185,"score_gpt":0.28182379707432703,"score_spread":0.2462929813215952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081744702","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.002018235,0.0007251179,0.99602157,0.00021471253,0.00029346618,0.0003836277,0.0000031763493,0.00014030705,0.00019976478],"genre_scores_gemma":[0.15881285,0.000018027378,0.84041804,0.000080447055,0.0005243336,0.000019280787,0.0000033199333,0.00001842201,0.00010530391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837446,0.00014297398,0.0005623719,0.00026690765,0.00038880945,0.0002644539],"domain_scores_gemma":[0.99836236,0.00011991969,0.00057134277,0.00028862662,0.000498048,0.00015972459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001015297,0.00018237988,0.00033881943,0.00033269607,0.00021322671,0.00039791258,0.00077179977,0.00010679624,0.0000013611318],"category_scores_gemma":[0.0000461926,0.00013831208,0.00013470338,0.0003756078,0.000022905848,0.00045904767,0.00003062462,0.00030314087,3.3391902e-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.000037429865,0.00013360089,0.00006772523,0.000090838876,0.000029561821,0.000016057626,0.0005382327,0.9609384,0.00022723818,0.00011853534,0.0004998948,0.037302475],"study_design_scores_gemma":[0.00074856833,0.00039144888,0.000023725894,0.00015917292,0.00001256917,0.00084363244,0.00007871838,0.9931374,0.00035457255,0.0001690757,0.0038992576,0.00018181207],"about_ca_topic_score_codex":0.000013598554,"about_ca_topic_score_gemma":7.809874e-7,"teacher_disagreement_score":0.15679461,"about_ca_system_score_codex":0.00006322044,"about_ca_system_score_gemma":0.00017348,"threshold_uncertainty_score":0.56402034},"labels":[],"label_agreement":null},{"id":"W2083795695","doi":"10.1016/j.sysarc.2008.09.004","title":"An embedded implementation of the Common Language Infrastructure","year":2008,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Compiler; VHDL; Programming language; Virtual machine; Host (biology); Instruction set; Set (abstract data type); High-level programming language; Java; Computer architecture; Operating system; Programming paradigm; Field-programmable gate array","score_opus":0.008038182146830416,"score_gpt":0.2787490379404097,"score_spread":0.2707108557935793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083795695","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.5603545,0.00020060233,0.4388143,0.00013463291,0.00027101327,0.000101240075,0.000002342666,0.0000315522,0.00008985661],"genre_scores_gemma":[0.9681028,0.000007956226,0.03167367,0.000067821806,0.00012534652,8.0754904e-7,5.9174005e-7,0.0000054126726,0.000015573212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99883187,0.00021601583,0.00042643762,0.000084954365,0.00033652113,0.000104189705],"domain_scores_gemma":[0.99874747,0.000033398836,0.00067607535,0.00035118847,0.00014167276,0.000050200568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027709067,0.000087424414,0.00020067881,0.000121062854,0.00010573502,0.00003497043,0.00085575215,0.00004748385,0.000003031824],"category_scores_gemma":[0.000012372693,0.0000519296,0.00008934147,0.00025297108,0.000034859415,0.00015440432,0.0000679373,0.00022696832,2.0707029e-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.000041926487,0.0001348933,0.04312153,0.00017083975,0.0001551831,0.000097929034,0.083539374,0.77107465,0.037571263,0.0038981603,0.010035571,0.05015867],"study_design_scores_gemma":[0.0058606835,0.003534094,0.567444,0.0013457219,0.0001227644,0.023826936,0.0094676595,0.19949113,0.17213625,0.0072532967,0.007963111,0.00155435],"about_ca_topic_score_codex":0.000044705856,"about_ca_topic_score_gemma":0.0000059093127,"teacher_disagreement_score":0.5715835,"about_ca_system_score_codex":0.000024491968,"about_ca_system_score_gemma":0.000097366225,"threshold_uncertainty_score":0.21176276},"labels":[],"label_agreement":null},{"id":"W2087805842","doi":"10.1016/j.sysarc.2010.03.005","title":"Combining mapping and partitioning exploration for NoC-based embedded systems","year":2010,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"STMicroelectronics (Canada); Polytechnique Montréal","funders":"","keywords":"Computer science; Scalability; Partition (number theory); Network on a chip; Pipeline (software); Exploit; Computer architecture; Key (lock); Flexibility (engineering); Architecture; Distributed computing; Interconnectivity; Embedded system; Operating system; Artificial intelligence","score_opus":0.022696673123449286,"score_gpt":0.2420556659753158,"score_spread":0.21935899285186652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087805842","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.070432164,0.00036067184,0.92293537,0.0004407259,0.0052420665,0.00036448217,0.0000020196019,0.00004492651,0.00017755751],"genre_scores_gemma":[0.98938954,0.0000023739592,0.009153026,0.00006001892,0.0012686475,0.000039199676,0.0000015443228,0.000015139786,0.00007052683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982962,0.00019256081,0.0007660534,0.00020180643,0.0003063041,0.00023704708],"domain_scores_gemma":[0.99802035,0.00036608762,0.000805951,0.00024770063,0.0004250845,0.00013483086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001852761,0.00015821106,0.0003806644,0.00028718848,0.00026562405,0.0006537909,0.00032235318,0.00012481742,0.0000010587717],"category_scores_gemma":[0.00012862527,0.00012334711,0.00012029371,0.00019491752,0.000027757282,0.0004912522,0.00003234878,0.0004288794,0.0000012667681],"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.00017580004,0.00016966359,0.0028152724,0.0019233475,0.00038687763,0.0000938616,0.021115314,0.7220835,0.076917626,0.15174109,0.0075784754,0.0149991345],"study_design_scores_gemma":[0.0015373798,0.0004274995,0.00019258249,0.0013313397,0.0000204873,0.0015486053,0.001577836,0.9638855,0.00041583437,0.0011929165,0.027552605,0.00031741042],"about_ca_topic_score_codex":0.000020931893,"about_ca_topic_score_gemma":0.000016991646,"teacher_disagreement_score":0.91895735,"about_ca_system_score_codex":0.000029046498,"about_ca_system_score_gemma":0.00007778504,"threshold_uncertainty_score":0.63045204},"labels":[],"label_agreement":null},{"id":"W2118673979","doi":"10.1016/j.sysarc.2007.09.002","title":"Energy reduction through crosstalk avoidance coding in networks on chip","year":2007,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Network packet; Dissipation; Embedded system; Crosstalk; Network on a chip; Signal integrity; Chip; Efficient energy use; System on a chip; Coding (social sciences); Computer hardware; Electronic engineering; Computer network; Telecommunications; Electrical engineering; Interconnection; Engineering","score_opus":0.013082455736030863,"score_gpt":0.24374451552424825,"score_spread":0.23066205978821738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118673979","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.056846034,0.0013082292,0.93219936,0.00026908182,0.0068936916,0.00010154784,4.306711e-7,0.00003169342,0.0023499066],"genre_scores_gemma":[0.99557334,0.000047235448,0.001176854,0.00014006645,0.0027504163,0.0000026489608,3.41888e-7,0.000015069912,0.00029404825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772173,0.00021620098,0.000965985,0.0002499327,0.00044433543,0.0004018372],"domain_scores_gemma":[0.9985055,0.0001745271,0.000744479,0.0003135136,0.00016119686,0.00010083388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017843834,0.0001920229,0.0003967212,0.00031992505,0.00014167036,0.00022042941,0.00054353505,0.00016373281,0.0000022442732],"category_scores_gemma":[0.000030015402,0.00014567061,0.00016030202,0.000573044,0.000033570082,0.00035505425,0.000048856215,0.0006773981,0.0000018549698],"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.00023860097,0.000115217255,0.00040035695,0.00006582647,0.00007243725,0.00037955723,0.0051803133,0.8945826,0.0024946318,0.0659256,0.0027614231,0.027783405],"study_design_scores_gemma":[0.008439311,0.005096654,0.0091286795,0.014548695,0.00005132665,0.052028794,0.005049032,0.599008,0.008276741,0.014953164,0.28049108,0.0029285015],"about_ca_topic_score_codex":0.00014085839,"about_ca_topic_score_gemma":0.00007600105,"teacher_disagreement_score":0.93872726,"about_ca_system_score_codex":0.00019786823,"about_ca_system_score_gemma":0.000043935222,"threshold_uncertainty_score":0.5940275},"labels":[],"label_agreement":null},{"id":"W2133406570","doi":"10.1016/j.sysarc.2007.03.007","title":"Formal verification of ASMs using MDGs","year":2007,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Formal verification; Abstract state machines; Programming language; Software engineering; Finite-state machine","score_opus":0.02990984917345966,"score_gpt":0.3042110438137437,"score_spread":0.274301194640284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133406570","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.20345011,0.0003562503,0.7943972,0.00003049963,0.001353311,0.00009856019,8.686096e-7,0.000012593123,0.000300636],"genre_scores_gemma":[0.59133166,0.0000036274532,0.40839586,0.0000114884215,0.00024035164,3.3418496e-7,1.6364514e-7,0.0000054339107,0.000011100262],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981359,0.00012665051,0.00088534434,0.000112457055,0.0005165597,0.00022307245],"domain_scores_gemma":[0.99768746,0.00009068606,0.0012764207,0.00037087555,0.0004835213,0.00009103431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034510645,0.000103737024,0.00025298836,0.0003515596,0.00006697147,0.000048752336,0.0007078278,0.0000910743,0.0000013290112],"category_scores_gemma":[0.00021934652,0.000080773774,0.000110537556,0.00042091843,0.000042526895,0.0006069525,0.00006106047,0.00027815124,0.0000014067016],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032234448,0.0002321352,0.0023978078,0.0007018433,0.00018421371,0.000056312936,0.010485442,0.077568986,0.5000819,0.120573714,0.00019785613,0.28719744],"study_design_scores_gemma":[0.0041180835,0.0030741396,0.09110196,0.0026751836,0.00019277663,0.013966155,0.00224114,0.38453668,0.44674218,0.009137391,0.040650558,0.0015637592],"about_ca_topic_score_codex":0.000018136485,"about_ca_topic_score_gemma":0.0000010392637,"teacher_disagreement_score":0.38788155,"about_ca_system_score_codex":0.00009266053,"about_ca_system_score_gemma":0.00008757268,"threshold_uncertainty_score":0.3293859},"labels":[],"label_agreement":null},{"id":"W2169692300","doi":"10.1016/j.sysarc.2006.09.006","title":"Multi-mode operator for SHA-2 hash functions","year":2006,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Hash function; Pseudorandom number generator; Latency (audio); Parallel computing; Bitwise operation; Implementation; Flexibility (engineering); Double hashing; Operator (biology); Hash table; Algorithm; Operating system; Programming language; Telecommunications","score_opus":0.01719697418332224,"score_gpt":0.28286864331784795,"score_spread":0.2656716691345257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169692300","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.07327567,0.00048700618,0.92407006,0.000740907,0.0010405742,0.0002648435,0.00004100242,0.000025073763,0.000054888525],"genre_scores_gemma":[0.9049857,0.000003552626,0.09411946,0.00007679604,0.0006097648,0.000020078378,0.0000048538514,0.000009585107,0.00017019924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99883217,0.000057380683,0.00051337964,0.0001437706,0.00024979917,0.00020350836],"domain_scores_gemma":[0.99904054,0.00008499068,0.00028646566,0.0002216976,0.00028773895,0.00007854915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035786055,0.000113855625,0.00021441268,0.00026515895,0.00022333638,0.00024452817,0.00041938538,0.000048638307,0.00000532689],"category_scores_gemma":[0.000021475456,0.00008401767,0.00019400184,0.0002792993,0.000022818966,0.00020959156,0.0000406366,0.00017877264,0.0000021062654],"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.0002773383,0.002715851,0.020979656,0.001049296,0.0010871778,0.00021782305,0.014996676,0.30409613,0.1358441,0.22430056,0.23642445,0.058010947],"study_design_scores_gemma":[0.009525176,0.0015528438,0.019495577,0.0004262696,0.00015322548,0.0031963077,0.0014289869,0.17311253,0.001013429,0.008292889,0.7807191,0.0010836642],"about_ca_topic_score_codex":0.00013656527,"about_ca_topic_score_gemma":0.00018182311,"teacher_disagreement_score":0.83171004,"about_ca_system_score_codex":0.000033273263,"about_ca_system_score_gemma":0.00009331131,"threshold_uncertainty_score":0.34261414},"labels":[],"label_agreement":null},{"id":"W2577048775","doi":"10.1016/j.sysarc.2017.01.001","title":"Special Issue on: Design Automation for Embedded Ubiquitous Computing Systems (DAEUCS)","year":2017,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"IoT and Edge/Fog Computing","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":"St. Francis Xavier University","funders":"","keywords":"Computer science; Ubiquitous computing; Automation; Embedded system; Distributed computing; Computer architecture; Software engineering; Human–computer interaction","score_opus":0.030467918729249657,"score_gpt":0.2849301766664634,"score_spread":0.2544622579372138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577048775","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.005529294,0.00019607494,0.92339325,0.0010543914,0.06612578,0.00065039255,8.4690026e-7,0.00008597173,0.0029639807],"genre_scores_gemma":[0.59122103,0.0000070666038,0.10102408,0.00030213664,0.30655771,0.00001179477,0.0000015908779,0.00007206788,0.00080250157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974119,0.0003287254,0.00088500016,0.0003049526,0.0006316791,0.00043771567],"domain_scores_gemma":[0.9961961,0.0005672615,0.001968231,0.00069784134,0.0004016706,0.00016892508],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0025250083,0.0002709146,0.00060301676,0.00030003212,0.00085018144,0.0017596058,0.0017730237,0.00014748113,6.995677e-7],"category_scores_gemma":[0.00035239657,0.00020991782,0.00022901098,0.00010626717,0.000039499926,0.00043737638,0.00019128357,0.00046631222,0.000017106413],"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.00022254433,0.00016612261,0.00009788163,0.00082378864,0.0002967331,0.00029524212,0.01579169,0.42598087,0.0016145614,0.0041123056,0.32476792,0.22583035],"study_design_scores_gemma":[0.0022413654,0.001398925,0.0009410716,0.0026139345,0.00004864136,0.0024982477,0.00020547594,0.74968207,0.00070931175,0.0009982345,0.23801796,0.000644792],"about_ca_topic_score_codex":0.000018779225,"about_ca_topic_score_gemma":7.4583136e-7,"teacher_disagreement_score":0.8223692,"about_ca_system_score_codex":0.00013460685,"about_ca_system_score_gemma":0.00019701394,"threshold_uncertainty_score":0.99927664},"labels":[],"label_agreement":null},{"id":"W2943929564","doi":"10.1016/j.sysarc.2019.01.005","title":"P2TA: Privacy-preserving task allocation for edge computing enhanced mobile crowdsensing","year":2019,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Medical Science and Technology Development Foundation, Nanjing Municipality Health Bureau; Natural Science Research of Jiangsu Higher Education Institutions of China; Government of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Crowdsensing; Task (project management); Mobile edge computing; Edge computing; Enhanced Data Rates for GSM Evolution; Privacy protection; Distributed computing; Computer security; Artificial intelligence","score_opus":0.008377268300745906,"score_gpt":0.23927246356874438,"score_spread":0.23089519526799848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943929564","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.44627407,0.00058769033,0.55054504,0.00017381847,0.0016952135,0.00045239012,0.0000010748076,0.00005387866,0.00021681502],"genre_scores_gemma":[0.96164817,0.0000050671247,0.03711077,0.000088803055,0.00090673385,0.000004751482,0.0000014739794,0.00003264136,0.00020158167],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975424,0.00018909629,0.0008997116,0.00038739943,0.00051334937,0.00046803654],"domain_scores_gemma":[0.9969395,0.00050583313,0.0010509245,0.0007607924,0.00058268546,0.00016031139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014171842,0.00025870476,0.00057264644,0.00030862875,0.00024031656,0.0004923642,0.0010635906,0.00013846863,0.0000022115466],"category_scores_gemma":[0.0002215013,0.00021474507,0.00026536928,0.00035702327,0.000029927742,0.0003914812,0.00028207948,0.00047245447,0.00000975433],"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.0000616485,0.00007002827,0.00022131417,0.0007330554,0.0001409445,0.000021920983,0.011577981,0.3906019,0.5425711,0.00063294696,0.0012610096,0.052106112],"study_design_scores_gemma":[0.0048000105,0.0019059663,0.0013405685,0.0067453,0.00012347393,0.0037527073,0.0028763723,0.83291984,0.094083294,0.0017415844,0.04810709,0.0016038187],"about_ca_topic_score_codex":0.00001888079,"about_ca_topic_score_gemma":0.000002185778,"teacher_disagreement_score":0.5153741,"about_ca_system_score_codex":0.00012185897,"about_ca_system_score_gemma":0.00015609853,"threshold_uncertainty_score":0.875705},"labels":[],"label_agreement":null},{"id":"W2991477359","doi":"10.1016/j.sysarc.2019.101685","title":"Leveraging partial-refresh for performance and lifetime improvement of 3D NAND flash memory in cyber-physical systems","year":2019,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China; Fundamental Research Funds for the Central Universities; National Science Foundation","keywords":"Computer science; Flash (photography); Cyber-physical system; NAND gate; Embedded system; Flash memory; Computer hardware; Operating system; Logic gate; Algorithm","score_opus":0.008455566641710318,"score_gpt":0.22637100011009353,"score_spread":0.2179154334683832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991477359","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.89235216,0.0010699134,0.10505284,0.00012298854,0.0007194246,0.0005862272,0.000008886509,0.000032377266,0.00005517764],"genre_scores_gemma":[0.9910956,0.0000290127,0.008542115,0.000014904933,0.00016985208,0.000019293673,6.103849e-7,0.000014055715,0.000114567265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982968,0.000049750313,0.0006738985,0.0002718427,0.0004073119,0.00030038643],"domain_scores_gemma":[0.99836034,0.00020215451,0.000744578,0.0004883739,0.00013608196,0.00006847871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006588253,0.0001913754,0.00060662604,0.00030723927,0.00004587663,0.00007942888,0.00072828523,0.00008408,3.183432e-7],"category_scores_gemma":[0.000069466805,0.00014133788,0.000070709604,0.00022382408,0.00006222782,0.00044857978,0.0002676639,0.0003630968,0.0000017278562],"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.0004500527,0.00040477735,0.012613175,0.006173594,0.000392285,0.00011947704,0.011489084,0.4668753,0.28262156,0.0039913002,0.0013773611,0.213492],"study_design_scores_gemma":[0.01422225,0.009785167,0.008970157,0.010069202,0.00014528616,0.002747183,0.0037655346,0.83716536,0.0777867,0.0027014385,0.030403446,0.00223829],"about_ca_topic_score_codex":0.000021620044,"about_ca_topic_score_gemma":0.0000014979461,"teacher_disagreement_score":0.37029,"about_ca_system_score_codex":0.0000879,"about_ca_system_score_gemma":0.00007586858,"threshold_uncertainty_score":0.57635915},"labels":[],"label_agreement":null},{"id":"W2994954803","doi":"10.1016/j.sysarc.2019.101694","title":"Efficient drone hijacking detection using two-step GA-XGBoost","year":2019,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"China Scholarship Council; Northeastern University; Shenyang Institute of Automation; National Natural Science Foundation of China","keywords":"Drone; Computer science; Correctness; Global Positioning System; Spoofing attack; Inertial measurement unit; Real-time computing; Artificial intelligence; Upload; Computer security; Algorithm; Operating system","score_opus":0.010488287591226499,"score_gpt":0.23238408854580517,"score_spread":0.22189580095457867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994954803","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.46745768,0.00064968306,0.5276231,0.00005652759,0.0038316066,0.00013447774,0.0000021413873,0.000042921958,0.00020182414],"genre_scores_gemma":[0.9788155,0.0000056081744,0.020093305,0.00005706463,0.0009403561,8.053796e-7,5.6251554e-7,0.000021255531,0.00006554007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765694,0.00022607272,0.0007180257,0.00029755433,0.00073192903,0.00036945246],"domain_scores_gemma":[0.9980653,0.00017643362,0.000798806,0.00055837125,0.00023633661,0.00016475738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009137202,0.00021226978,0.0004152603,0.00036064495,0.00017070177,0.00029546535,0.00076556054,0.00011206344,0.000012167007],"category_scores_gemma":[0.000042963384,0.00016141597,0.00018260427,0.00045319684,0.000026992104,0.00015874907,0.00017276334,0.00068691606,0.00003199266],"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.000032795324,0.000039463608,0.00058494945,0.000067660316,0.00004156507,0.00006634949,0.0005371332,0.953412,0.029186444,0.0004286929,0.00009184482,0.015511085],"study_design_scores_gemma":[0.0011347581,0.0002508947,0.0007555812,0.00089192606,0.000028228113,0.0049282415,0.00016329992,0.9809129,0.0011561931,0.000099594174,0.00934801,0.0003303316],"about_ca_topic_score_codex":0.000066209264,"about_ca_topic_score_gemma":0.0000056913736,"teacher_disagreement_score":0.51135784,"about_ca_system_score_codex":0.00012463263,"about_ca_system_score_gemma":0.00007118524,"threshold_uncertainty_score":0.6582352},"labels":[],"label_agreement":null},{"id":"W3094414452","doi":"10.1016/j.sysarc.2020.101908","title":"Accelerating data filtering for database using FPGA","year":2020,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Research Grants Council, University Grants Committee","keywords":"Computer science; Speedup; Field-programmable gate array; Hardware acceleration; Control reconfiguration; Acceleration; Focus (optics); Filter (signal processing); Cloud computing; Embedded system; Parallel computing; Computer hardware; Operating system","score_opus":0.1390982729176827,"score_gpt":0.3031220357764073,"score_spread":0.16402376285872458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094414452","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.018011235,0.00055035064,0.9794897,0.00093040423,0.0007439303,0.00015771482,0.000065146516,0.00002594106,0.000025568173],"genre_scores_gemma":[0.58022135,0.0000045708634,0.41744462,0.00048595192,0.0018098387,0.0000016223074,0.0000071658433,0.000017603636,0.00000729011],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987167,0.000107102394,0.00046783104,0.00024279875,0.0002580219,0.00020756171],"domain_scores_gemma":[0.99857235,0.00016219096,0.0004406811,0.00050101767,0.00010198401,0.00022176522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008039143,0.00012846415,0.0002757496,0.000094141455,0.00015441263,0.00028688853,0.0018575717,0.000036370548,0.0000022002955],"category_scores_gemma":[0.00029857171,0.00009726332,0.000085014566,0.00023373707,0.000017455479,0.00074704713,0.00048610265,0.00029093033,8.6208706e-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.0002703981,0.00014768181,0.0002497714,0.002323599,0.0006061095,0.0007739505,0.014630029,0.23936146,0.5937768,0.016306221,0.006545077,0.12500888],"study_design_scores_gemma":[0.0007735325,0.00024676262,0.000012030302,0.0004939391,0.00003306981,0.0013417732,0.00027441065,0.98108476,0.0028088177,0.0009561905,0.011721634,0.00025310274],"about_ca_topic_score_codex":0.0000037355876,"about_ca_topic_score_gemma":3.6214138e-7,"teacher_disagreement_score":0.74172324,"about_ca_system_score_codex":0.000012134344,"about_ca_system_score_gemma":0.00009868563,"threshold_uncertainty_score":0.39662832},"labels":[],"label_agreement":null},{"id":"W3125061980","doi":"10.1016/j.sysarc.2021.102018","title":"Guest editorial: Special issue on design architecture and applications of smart embedded devices in internet of things","year":2021,"lang":"en","type":"editorial","venue":"Journal of Systems Architecture","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Internet of Things; Architecture; Embedded system; Computer architecture; Human–computer interaction; World Wide Web","score_opus":0.007910259658967066,"score_gpt":0.2430383843872461,"score_spread":0.23512812472827901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125061980","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014486826,0.0012443371,0.099321,0.00009657241,0.89840716,0.00043038532,0.0000043932846,0.000017048831,0.00033421395],"genre_scores_gemma":[0.00042285526,0.00004328376,0.0076424354,0.000015768599,0.99168867,0.000009903575,0.000008307154,0.000037850765,0.00013091737],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99529546,0.00057940814,0.0016841629,0.0005054413,0.0015755203,0.00035999453],"domain_scores_gemma":[0.99387515,0.002029632,0.0025135425,0.0005717752,0.00085033174,0.00015956478],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001950154,0.00045907035,0.0014435512,0.00093824265,0.00006268731,0.00022822157,0.0016586472,0.00079695566,0.0000021385865],"category_scores_gemma":[0.0005831966,0.00036761735,0.00026023234,0.00062707445,0.00010370128,0.00017763795,0.0003852241,0.0023973628,0.0000015613402],"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.00014186895,0.00010558304,0.000021452304,0.0010648847,0.0001412563,0.000046705376,0.0068941037,0.0011093535,0.00015789327,0.000030114907,0.97956914,0.010717667],"study_design_scores_gemma":[0.00068927754,0.0006258372,0.000015612783,0.0038638106,0.000051209794,0.000097384735,0.000081494196,0.00029448868,0.0003553444,0.000371391,0.9932485,0.00030563565],"about_ca_topic_score_codex":0.00014035335,"about_ca_topic_score_gemma":0.00001499647,"teacher_disagreement_score":0.0932815,"about_ca_system_score_codex":0.00011244526,"about_ca_system_score_gemma":0.0006631383,"threshold_uncertainty_score":0.99990416},"labels":[],"label_agreement":null},{"id":"W3131659626","doi":"10.1016/j.sysarc.2021.102055","title":"gRemote: Cloud rendering on GPU resource pool based on API-forwarding","year":2021,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Cloud computing; Client-side; Rendering (computer graphics); Shared resource; Operating system; Bandwidth (computing); Computer network; Remote direct memory access; Distributed computing","score_opus":0.011987663486584366,"score_gpt":0.22015288650147669,"score_spread":0.20816522301489232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131659626","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.1946346,0.0009991043,0.776507,0.009690947,0.0041346676,0.0002718389,0.0000026271582,0.00019825471,0.013560934],"genre_scores_gemma":[0.9913298,0.000002248579,0.0051832832,0.0009861527,0.0016885804,0.0000011401445,5.2382643e-7,0.000026854697,0.00078141864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711955,0.00040681026,0.0006337888,0.000391027,0.0010550539,0.0003937743],"domain_scores_gemma":[0.9979932,0.00033967858,0.0005488669,0.0007766685,0.00013881971,0.00020281125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011507991,0.00025626,0.00044644298,0.00038858564,0.00024440058,0.00034425204,0.0009408878,0.00009751287,0.000004058727],"category_scores_gemma":[0.00016465955,0.00019206738,0.00032726358,0.00054886506,0.000022926788,0.000019867064,0.00025290568,0.0008259402,0.000012228807],"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.00004224064,0.00007561137,0.00003880226,0.00012205347,0.000076683726,0.00086893584,0.0007386262,0.95282763,0.0004018075,0.0011478764,0.0033406299,0.040319078],"study_design_scores_gemma":[0.0021730047,0.0011306388,0.0007888039,0.004726244,0.000058789534,0.0023909258,0.0006809166,0.7115127,0.002119274,0.00051757594,0.2732021,0.000699064],"about_ca_topic_score_codex":0.0000075394796,"about_ca_topic_score_gemma":9.811426e-7,"teacher_disagreement_score":0.7966952,"about_ca_system_score_codex":0.0001566071,"about_ca_system_score_gemma":0.00009980183,"threshold_uncertainty_score":0.78322804},"labels":[],"label_agreement":null},{"id":"W3135014913","doi":"10.1016/j.sysarc.2021.102073","title":"Specification, detection, and treatment of STRIDE threats for software components: Modeling, formal methods, and tool support","year":2021,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Safety Systems Engineering in Autonomy","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; STRIDE; Software engineering; Software security assurance; Flexibility (engineering); Reuse; Formal specification; Formal methods; Context (archaeology); Specification language; Threat model; Component-based software engineering; Computer security; Software development; Software; Programming language; Information security; Security service","score_opus":0.02681172154353578,"score_gpt":0.26546381478343434,"score_spread":0.23865209323989856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135014913","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.16427381,0.007140925,0.82755226,0.000024421646,0.0006151449,0.0003036519,0.000028121638,0.000040530555,0.000021159007],"genre_scores_gemma":[0.9187515,0.0003460665,0.080425836,0.0000024966228,0.00034494585,0.000026776594,0.0000066295243,0.00004236448,0.000053399766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987447,0.00004680218,0.0007549421,0.00012912527,0.00014374683,0.00018068517],"domain_scores_gemma":[0.9991262,0.00016528847,0.0001953689,0.00018727679,0.00023779164,0.000088096764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034171695,0.00018720918,0.00050085236,0.00016234392,0.000049403014,0.00003624921,0.0000629195,0.00009530668,0.0000024894928],"category_scores_gemma":[0.00005459106,0.00015703433,0.00010796094,0.000094802876,0.000017402583,0.00012149893,0.000013657091,0.00011306841,2.028179e-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.00007085223,0.000042763866,0.0006821224,0.0009963029,0.0005947314,0.000016053102,0.0016205902,0.8468503,0.04568225,0.00011624919,0.00003491367,0.1032929],"study_design_scores_gemma":[0.008315736,0.0018136887,0.007972742,0.0015005352,0.0006429046,0.012042236,0.0017489325,0.82044035,0.057756957,0.0010638402,0.0855101,0.0011920031],"about_ca_topic_score_codex":0.000007539207,"about_ca_topic_score_gemma":0.0000048175098,"teacher_disagreement_score":0.7544777,"about_ca_system_score_codex":0.00011561342,"about_ca_system_score_gemma":0.000043312735,"threshold_uncertainty_score":0.6403674},"labels":[],"label_agreement":null},{"id":"W3169233553","doi":"10.1016/j.sysarc.2021.102178","title":"An Analyzable Inter-core Communication Framework for High-Performance Multicore Embedded Systems","year":2021,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Bundesministerium für Bildung und Forschung; Alexander von Humboldt-Stiftung; National Science Foundation","keywords":"Computer science; Multi-core processor; Benchmark (surveying); Bounding overwatch; Suite; Parallel computing; Core (optical fiber); Perspective (graphical); Interference (communication); Distributed computing; Computer network; Telecommunications; Artificial intelligence","score_opus":0.02187477213000893,"score_gpt":0.2857350683721201,"score_spread":0.26386029624211116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169233553","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.26302296,0.002431473,0.73171467,0.00025846754,0.0020070919,0.0004200091,0.000008224418,0.00006737236,0.00006969436],"genre_scores_gemma":[0.78952,0.000040270115,0.20951091,0.000043747772,0.00070316275,0.000033437034,0.000009064262,0.0000355639,0.00010380601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996329,0.00063781784,0.0014597503,0.00042268488,0.00068353507,0.00046720295],"domain_scores_gemma":[0.99432653,0.00068394316,0.0016036768,0.0018168672,0.0012836519,0.00028530508],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022434627,0.00032422968,0.00087657606,0.00034667083,0.00029604882,0.00090162404,0.0020957708,0.00028172127,0.0000038028688],"category_scores_gemma":[0.00037602865,0.00025930302,0.0002160349,0.0006644067,0.000050264985,0.0010388527,0.00018912657,0.0008423425,0.000008510524],"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.00020601567,0.0005055468,0.004319403,0.0032163733,0.00087645015,0.00022708939,0.013828377,0.8388704,0.04008971,0.074238636,0.0011581758,0.022463832],"study_design_scores_gemma":[0.002141132,0.0010723852,0.001817018,0.008863374,0.00014607403,0.005808287,0.0038728854,0.96129674,0.0060195248,0.004927028,0.003079594,0.0009559781],"about_ca_topic_score_codex":0.00009514126,"about_ca_topic_score_gemma":0.000011116458,"teacher_disagreement_score":0.52649707,"about_ca_system_score_codex":0.00017823275,"about_ca_system_score_gemma":0.00031040667,"threshold_uncertainty_score":0.99998593},"labels":[],"label_agreement":null},{"id":"W3202331112","doi":"10.1016/j.sysarc.2021.102292","title":"The price of schedulability in cyclic workloads: The history-vs.-response-time-vs.-accuracy trade-off","year":2021,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Autonomous Vehicle Technology and Safety","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Division of Computer and Network Systems; Office of Naval Research; General Motors of Canada; General Motors Corporation; National Science Foundation","keywords":"Computer science; Response time; Bounded function; Graph; Task (project management); Dilemma; Real-time computing; Algorithm; Parallel computing; Theoretical computer science; Operating system","score_opus":0.005533726568369445,"score_gpt":0.1984947860293631,"score_spread":0.19296105946099365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202331112","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.9558214,0.036220662,0.0014488634,0.004892703,0.0010168455,0.0002486692,0.000005681796,0.00006882432,0.00027635504],"genre_scores_gemma":[0.9990801,0.00032060922,0.00020663942,0.00004466652,0.00013736963,0.000008965308,3.7864876e-7,0.000026364523,0.00017485576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977291,0.0005767263,0.0009453656,0.00014145735,0.0003007937,0.0003065335],"domain_scores_gemma":[0.9973493,0.0015489701,0.00039425396,0.0005613274,0.000081329985,0.00006481188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002116131,0.00019818167,0.0005004018,0.00013339227,0.00010983155,0.000021497677,0.00060293806,0.00024245563,0.00002655894],"category_scores_gemma":[0.0007707657,0.000116748946,0.00021094373,0.00038123407,0.00021739771,0.00007934334,0.000056885037,0.0014094958,0.000005329449],"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.005203594,0.0005469152,0.014028912,0.0012596379,0.0016371271,0.0007814986,0.020227106,0.5209269,0.26870385,0.002144824,0.010612378,0.15392724],"study_design_scores_gemma":[0.0029492674,0.00057796703,0.19784376,0.0016788976,0.00017486575,0.004494502,0.003160714,0.02250052,0.012393185,0.0017654407,0.7515733,0.0008875467],"about_ca_topic_score_codex":0.000006626522,"about_ca_topic_score_gemma":0.000023551018,"teacher_disagreement_score":0.74096096,"about_ca_system_score_codex":0.00039799136,"about_ca_system_score_gemma":0.00026293655,"threshold_uncertainty_score":0.61236364},"labels":[],"label_agreement":null},{"id":"W4220740836","doi":"10.1016/j.sysarc.2022.102452","title":"CamoDroid: An Android application analysis environment resilient against sandbox evasion","year":2022,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Sandbox (software development); Computer science; Evasion (ethics); Android (operating system); Android malware; Android application; Computer security; Operating system","score_opus":0.0056013684319131075,"score_gpt":0.22351854678423233,"score_spread":0.21791717835231922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220740836","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.084970385,0.0005790441,0.9135707,0.00024386952,0.00020502709,0.00028083645,0.000008831887,0.00008661015,0.00005470195],"genre_scores_gemma":[0.97930545,0.00004591789,0.020287937,0.00010686747,0.000133588,0.000056019024,0.0000054612947,0.000013792677,0.000044989185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759674,0.00035520532,0.0006154474,0.00033317966,0.0008998419,0.00019957201],"domain_scores_gemma":[0.9981451,0.000049869515,0.0008519398,0.0007185208,0.00007783555,0.00015671646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009349827,0.00015958842,0.00035097214,0.0007630235,0.000314326,0.00007554494,0.00090782845,0.000048414695,0.000008926493],"category_scores_gemma":[0.000015526484,0.00013671309,0.00020785065,0.0008036034,0.000025154164,0.00027630068,0.00026221672,0.00050745485,0.0000018889212],"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.000047860252,0.00012910643,0.00030798337,0.000017621718,0.00013203807,0.00004564759,0.00083520147,0.91218996,0.03502208,0.0003824179,0.0001920534,0.050698016],"study_design_scores_gemma":[0.002621763,0.0060431384,0.009459747,0.00013112526,0.0006081992,0.0046923715,0.0018732584,0.5684345,0.029998513,0.01126249,0.36306435,0.0018105286],"about_ca_topic_score_codex":0.000020934871,"about_ca_topic_score_gemma":0.00000397886,"teacher_disagreement_score":0.89433503,"about_ca_system_score_codex":0.00037539867,"about_ca_system_score_gemma":0.00004844049,"threshold_uncertainty_score":0.55749977},"labels":[],"label_agreement":null},{"id":"W4292640861","doi":"10.1016/j.sysarc.2022.102708","title":"Energy efficient mixed task handling on real-time embedded systems using FreeRTOS","year":2022,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Aperiodic graph; Real-time operating system; Frequency scaling; Embedded system; Scheduling (production processes); ARM architecture; Energy (signal processing); Real-time computing; Voltage; Engineering","score_opus":0.011983507736846836,"score_gpt":0.2315466213301839,"score_spread":0.21956311359333705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292640861","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.051170096,0.0008055683,0.9449719,0.000110033034,0.0020400474,0.0001745504,0.000007328942,0.00018602649,0.0005344428],"genre_scores_gemma":[0.9745613,0.000011328876,0.024575464,0.00006429469,0.0004619348,0.00001027726,0.0000020729904,0.000028892426,0.00028445935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965763,0.0009116138,0.00083943683,0.00031323807,0.001017366,0.00034204122],"domain_scores_gemma":[0.99778605,0.00024312105,0.0010743559,0.0005059998,0.0002294696,0.00016099565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015930296,0.0002365642,0.00052246393,0.00063463877,0.0004977154,0.00028503302,0.0011735167,0.000074307965,0.0000041925114],"category_scores_gemma":[0.000049962615,0.00019402943,0.00019706675,0.0005870746,0.000024214223,0.00007530364,0.00031312965,0.00048401495,0.0000019195468],"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.000029016928,0.0000691228,0.0000073183073,0.000029218749,0.000048964517,0.000093487135,0.0007121616,0.9883041,0.006942412,0.0014373511,0.0015124574,0.00081442174],"study_design_scores_gemma":[0.0003961815,0.00037171098,0.0000075416065,0.0002856842,0.000014808653,0.0016609211,0.00010167788,0.9927917,0.0005326867,0.00008669982,0.0035287251,0.0002216301],"about_ca_topic_score_codex":0.00014158597,"about_ca_topic_score_gemma":4.5324845e-7,"teacher_disagreement_score":0.92339116,"about_ca_system_score_codex":0.00026544897,"about_ca_system_score_gemma":0.00019055407,"threshold_uncertainty_score":0.79122907},"labels":[],"label_agreement":null},{"id":"W4385336171","doi":"10.1016/j.sysarc.2023.102955","title":"CPU frequency scheduling of real-time applications on embedded devices with temporal encoding-based deep reinforcement learning","year":2023,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Reinforcement learning; Workload; Linux kernel; Embedded system; Benchmark (surveying); Scheduling (production processes); Performance improvement; Kernel (algebra); Real-time computing; Operating system; Artificial intelligence","score_opus":0.012456447333979794,"score_gpt":0.25527944892189336,"score_spread":0.24282300158791356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385336171","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.020626036,0.000099468205,0.9776224,0.00018426712,0.00006625215,0.0002582834,5.6337205e-7,0.00023878574,0.0009039478],"genre_scores_gemma":[0.8525961,0.000014860172,0.14717753,0.00002548595,0.00010349876,0.000014184904,0.000004596875,0.000013460523,0.000050270857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982567,0.00014984442,0.0006422354,0.00019818606,0.0005417911,0.00021126118],"domain_scores_gemma":[0.997993,0.00019833015,0.0010746688,0.00031501602,0.0003211006,0.00009789094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008212681,0.0001607453,0.00033532808,0.00054900337,0.00016566995,0.00009882454,0.0006414184,0.000070075504,0.0000027578078],"category_scores_gemma":[0.000044776083,0.00011661113,0.00009709059,0.0008303823,0.000034312907,0.00012149887,0.0000530158,0.00034360823,0.0000072993175],"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.000015595699,0.000019066358,0.0010808125,0.00009442256,0.00004067259,0.000013107883,0.00066418044,0.99506855,0.001602994,0.00083160016,0.000032049156,0.0005369546],"study_design_scores_gemma":[0.00051726546,0.00090024713,0.00027592113,0.0010287672,0.000018848747,0.00008542019,0.00016772223,0.994437,0.0017710793,0.00020891357,0.00036484137,0.0002239929],"about_ca_topic_score_codex":0.00002919185,"about_ca_topic_score_gemma":0.0000018207405,"teacher_disagreement_score":0.8319701,"about_ca_system_score_codex":0.00005201127,"about_ca_system_score_gemma":0.00016312007,"threshold_uncertainty_score":0.4755264},"labels":[],"label_agreement":null},{"id":"W4391897266","doi":"10.1016/j.sysarc.2024.103088","title":"Hybrid Privacy Preserving Federated Learning Against Irregular Users in Next-Generation Internet of Things","year":2024,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":99,"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 Calgary; Brandon University; University of Guelph","funders":"","keywords":"Computer science; Internet of Things; Internet privacy; The Internet; World Wide Web; Computer security","score_opus":0.03240004885923582,"score_gpt":0.2565090802461277,"score_spread":0.22410903138689187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391897266","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.57540965,0.004295682,0.41420263,0.0043254322,0.0012081267,0.00020731386,0.0000021651947,0.00020586413,0.00014311308],"genre_scores_gemma":[0.9588223,0.000102477585,0.040754743,0.00004169856,0.00017565966,0.0000045927727,0.0000054168877,0.000025058904,0.00006804721],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734867,0.00034464643,0.000987451,0.0003721335,0.0006299882,0.0003171276],"domain_scores_gemma":[0.9974561,0.00022640711,0.00057434104,0.0014912451,0.00017715206,0.00007476455],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0016391831,0.00022508285,0.0004479936,0.000836388,0.000065668464,0.0008331401,0.0093062315,0.00013536774,0.0000037159843],"category_scores_gemma":[0.0058554052,0.00018061437,0.00013109758,0.0006445575,0.00005436044,0.0016991567,0.009826247,0.0013132093,0.0000030063966],"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.00011240205,0.0002271695,0.0038850121,0.003499694,0.0007933254,0.0028036656,0.0131934,0.12466583,0.5089116,0.0025394994,0.12591934,0.21344906],"study_design_scores_gemma":[0.0002889725,0.00017109065,0.00014592013,0.0027978453,0.000011062502,0.0005878036,0.000122016776,0.9725261,0.013037094,0.004433755,0.005669853,0.0002084987],"about_ca_topic_score_codex":0.00009414767,"about_ca_topic_score_gemma":0.0000056815675,"teacher_disagreement_score":0.8478603,"about_ca_system_score_codex":0.00018749687,"about_ca_system_score_gemma":0.00017028826,"threshold_uncertainty_score":0.9981821},"labels":[],"label_agreement":null},{"id":"W4394575921","doi":"10.1016/j.sysarc.2024.103140","title":"A survey on Persistent Memory indexes: Recent advances, challenges and opportunities","year":2024,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":7,"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 New Brunswick","funders":"Gujarat Council on Science and Technology","keywords":"Computer science; Dram; Persistent data structure; Non-volatile random-access memory; Non-volatile memory; Computer data storage; Class (philosophy); Data science; Database; Operating system; Computer memory; Semiconductor memory; Memory refresh; Computer hardware; Artificial intelligence","score_opus":0.07325814639705903,"score_gpt":0.27406861233725205,"score_spread":0.20081046594019303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394575921","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069251265,0.8871402,0.094555676,0.0073402836,0.0026173783,0.00024544503,0.000054345208,0.00030436247,0.0008172001],"genre_scores_gemma":[0.7848848,0.20684439,0.00720393,0.00021070728,0.00044580185,0.000013918841,0.0000047525973,0.000043554104,0.00034814584],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99842066,0.00019210018,0.00040462852,0.00028674447,0.00047272939,0.0002231188],"domain_scores_gemma":[0.998706,0.00036380306,0.00024303456,0.00043338691,0.00014165205,0.00011214523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000948799,0.00019850567,0.00034946215,0.00047037803,0.00006625459,0.00017878521,0.0007247618,0.000095055904,0.0000015955607],"category_scores_gemma":[0.0001785362,0.00013592461,0.00008432341,0.00016453222,0.00010243708,0.00052073365,0.00022480759,0.00058195397,0.0000027104054],"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.000024748037,0.000024740251,0.000007769689,0.0003036976,0.00009513898,0.0005185243,0.0020059713,0.0023799066,0.000049165996,0.0076306574,0.0009781257,0.9859816],"study_design_scores_gemma":[0.00071990176,0.0026755363,0.0015246322,0.0041884356,0.000049718732,0.006260393,0.0051807635,0.0032658342,0.00020423348,0.008316228,0.966818,0.00079635985],"about_ca_topic_score_codex":0.0000046314854,"about_ca_topic_score_gemma":0.00001737799,"teacher_disagreement_score":0.9851852,"about_ca_system_score_codex":0.000103596656,"about_ca_system_score_gemma":0.00010940507,"threshold_uncertainty_score":0.5542845},"labels":[],"label_agreement":null},{"id":"W4401689504","doi":"10.1016/j.sysarc.2024.103260","title":"FPGA-assisted Design Space Exploration of Parameterized AI Accelerators: A Quickloop Approach","year":2024,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nexen (Canada)","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science, ICT and Future Planning","keywords":"Computer science; Parameterized complexity; Field-programmable gate array; Space (punctuation); Design space exploration; Computer architecture; Parallel computing; Embedded system; Computational science; Computer engineering; Operating system; Algorithm","score_opus":0.05946065307783621,"score_gpt":0.29337409190732944,"score_spread":0.23391343882949323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401689504","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.0029623497,0.0044642696,0.98963237,0.00061658246,0.0010781974,0.0007442446,0.0000037109226,0.00026495676,0.00023334532],"genre_scores_gemma":[0.77053064,0.000028098468,0.22882251,0.00003371227,0.0003658553,0.00004607992,9.715903e-7,0.00003670623,0.00013541954],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957351,0.0011612847,0.001419521,0.0003967023,0.0009598469,0.00032751128],"domain_scores_gemma":[0.9974057,0.00040008457,0.00095492083,0.0006944361,0.0003667675,0.00017810201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026075165,0.00032880937,0.0008429516,0.00091003673,0.000070874274,0.0006700522,0.0012406835,0.00023409087,0.0000020924003],"category_scores_gemma":[0.0001461067,0.00023616114,0.00032661046,0.0011723202,0.0000621634,0.0014685829,0.00011466633,0.0007127749,0.0000055052064],"study_design_candidate":"bench_or_experimental","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.0005415623,0.0007602227,0.000079675505,0.0067046094,0.0018441682,0.0011749808,0.043977164,0.043670975,0.7385301,0.05624465,0.03467406,0.071797825],"study_design_scores_gemma":[0.005259114,0.009590163,0.00028021823,0.021724092,0.0006590675,0.030518355,0.0034975882,0.53080434,0.30141768,0.04878588,0.043648265,0.0038152412],"about_ca_topic_score_codex":0.000028687547,"about_ca_topic_score_gemma":8.2288943e-7,"teacher_disagreement_score":0.7675683,"about_ca_system_score_codex":0.00015231485,"about_ca_system_score_gemma":0.00042057084,"threshold_uncertainty_score":0.9630372},"labels":[],"label_agreement":null},{"id":"W4405680317","doi":"10.1016/j.sysarc.2024.103327","title":"Input/mapping precision controllable digital CIM with adaptive adder tree architecture for flexible DNN inference","year":2024,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Advanced Computational Techniques and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Research Foundation of Korea; Ministry of Science and ICT, South Korea; Ministry of Trade, Industry and Energy; Information Technology Research Centre; Sungkyunkwan University","keywords":"Computer science; Adder; Inference; Computer architecture; Architecture; Tree (set theory); Computer hardware; Computer engineering; Distributed computing; Artificial intelligence; Telecommunications","score_opus":0.019621968198781235,"score_gpt":0.2769002583735818,"score_spread":0.25727829017480053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405680317","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.0013234543,0.0015357417,0.9934671,0.0017547169,0.00024102806,0.0006859083,0.00004018336,0.00021319622,0.0007386959],"genre_scores_gemma":[0.7374219,0.000012735209,0.26144123,0.00010324336,0.00046551088,0.00008761922,0.0000039164183,0.000027547965,0.00043636793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99823606,0.000041695275,0.00056198967,0.00036183355,0.0005093489,0.00028906297],"domain_scores_gemma":[0.9978568,0.0008719908,0.000365117,0.00031552688,0.00044684112,0.00014370194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029161366,0.0002462285,0.00039482623,0.00038281703,0.0001522718,0.0006523628,0.00072929123,0.00008880621,0.0000016967007],"category_scores_gemma":[0.00007640089,0.00015914458,0.00017904962,0.0006569592,0.000051295923,0.0005794125,0.0001080671,0.00047570694,0.0000036458212],"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.00022850321,0.00009307652,0.00002749463,0.00025008625,0.00029481528,0.00006818991,0.0018658857,0.4960269,0.0027159944,0.081393585,0.0030144511,0.41402102],"study_design_scores_gemma":[0.001840293,0.0026863944,0.00017680308,0.0038337328,0.00006617649,0.0026701835,0.00026761641,0.29118788,0.0011387067,0.27751184,0.41778374,0.000836622],"about_ca_topic_score_codex":0.0000030354704,"about_ca_topic_score_gemma":0.0000027419242,"teacher_disagreement_score":0.7360984,"about_ca_system_score_codex":0.00009223321,"about_ca_system_score_gemma":0.00030811422,"threshold_uncertainty_score":0.64897275},"labels":[],"label_agreement":null},{"id":"W4410299961","doi":"10.1016/j.sysarc.2025.103423","title":"GAROS: Genetic algorithm-aided row-skipping for shift and duplicate kernel mapping in processing-in-memory architectures","year":2025,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Information Technology Research Centre; Ministry of Science and ICT, South Korea; Ministry of Trade, Industry and Energy; National Research Foundation of Korea; Samsung; Ministry of Education; Sungkyunkwan University","keywords":"Computer science; Kernel (algebra); Algorithm; Parallel computing; Mathematics","score_opus":0.009903244853141379,"score_gpt":0.2517593208499379,"score_spread":0.24185607599679654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410299961","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.047422614,0.0056463373,0.9450015,0.0010403562,0.0002255533,0.00045168944,0.0000013776323,0.00007152063,0.00013905276],"genre_scores_gemma":[0.6913341,0.000035586694,0.30821875,0.00018523143,0.00012293547,0.000026776363,3.8356447e-7,0.000012493957,0.00006374124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980802,0.0001495225,0.0008596739,0.00034332555,0.0002282753,0.00033902138],"domain_scores_gemma":[0.99889946,0.00017336672,0.00047533077,0.00025182473,0.00012015554,0.00007988837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008822601,0.00021532305,0.0004887583,0.0010684794,0.00010912958,0.00025109464,0.00069646316,0.00011853992,2.3318168e-7],"category_scores_gemma":[0.00010850882,0.00017968337,0.00009328857,0.00063883583,0.000046859288,0.000098595054,0.0001547887,0.0004593862,1.6045729e-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.000041656265,0.0000972457,0.0041711032,0.0010542544,0.00004212889,0.0000872569,0.0065794867,0.5933279,0.00087592413,0.00042913776,0.00022594223,0.39306796],"study_design_scores_gemma":[0.0020489634,0.00018036732,0.0454508,0.0043405253,0.000015227453,0.0005202375,0.00018276731,0.9265828,0.00046819498,0.018300677,0.0014608576,0.000448592],"about_ca_topic_score_codex":0.000039099185,"about_ca_topic_score_gemma":0.00001035416,"teacher_disagreement_score":0.6439115,"about_ca_system_score_codex":0.000077221666,"about_ca_system_score_gemma":0.000183606,"threshold_uncertainty_score":0.7327275},"labels":[],"label_agreement":null},{"id":"W4410882914","doi":"10.1016/j.sysarc.2025.103460","title":"FedMQ+: Towards efficient heterogeneous federated learning with multi-grained quantization","year":2025,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Key Technology Research and Development Program of Shandong; Postdoctoral Innovation Project of Shandong Province; Natural Science Foundation of Shandong Province","keywords":"Computer science; Federated learning; Quantization (signal processing); Distributed computing; Theoretical computer science; Artificial intelligence; Computer architecture; Algorithm","score_opus":0.016022270682053356,"score_gpt":0.2619340151175543,"score_spread":0.24591174443550096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410882914","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.09797184,0.00089905306,0.8946254,0.0052524162,0.00065047597,0.00022435229,0.000002641495,0.00025922956,0.00011456459],"genre_scores_gemma":[0.89850265,0.000016048896,0.10126385,0.000055022047,0.00005116321,0.0000051820643,0.0000022191184,0.000013864077,0.00008999713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980022,0.0002607591,0.00058063195,0.00031904373,0.000519746,0.00031763775],"domain_scores_gemma":[0.9972904,0.00011919391,0.0005993913,0.0015259233,0.00038961903,0.00007552493],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00073492434,0.00022143056,0.0003980228,0.00054506684,0.00026187472,0.00045634006,0.0068626907,0.00014482613,0.0000013476024],"category_scores_gemma":[0.004264679,0.00015121842,0.0000903649,0.0009558914,0.00006542033,0.00014840727,0.0054628924,0.00073177606,0.000002549491],"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.00018899399,0.00025636435,0.0025261152,0.00039734007,0.0004954693,0.0005726237,0.0007744414,0.9257422,0.010208864,0.00090739346,0.006024124,0.05190605],"study_design_scores_gemma":[0.0015683708,0.00051645667,0.0008591177,0.0011840638,0.00003286178,0.0014859089,0.00018441315,0.9836771,0.0052574235,0.0009650205,0.003955627,0.0003136472],"about_ca_topic_score_codex":0.000033843808,"about_ca_topic_score_gemma":0.000012601877,"teacher_disagreement_score":0.8005308,"about_ca_system_score_codex":0.0001421534,"about_ca_system_score_gemma":0.00023704165,"threshold_uncertainty_score":0.99851066},"labels":[],"label_agreement":null},{"id":"W4415100143","doi":"10.1016/j.sysarc.2025.103595","title":"Eidos revisited: Expanding Efficient, imperceptible adversarial attacks on 3D point clouds","year":2025,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"H2020 Marie Skłodowska-Curie Actions; UK Research and Innovation; Horizon 2020 Framework Programme; Deutsche Forschungsgemeinschaft; Institute of Software, Chinese Academy of Sciences; European Commission; Canadian Anesthesiologists' Society","keywords":"Point cloud; Adversarial system; Generalizability theory; Set (abstract data type); Process (computing); Point (geometry); Segmentation; Cloud computing","score_opus":0.008511477248732158,"score_gpt":0.2799934282760977,"score_spread":0.27148195102736555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415100143","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.057169776,0.00052623014,0.9299109,0.0011626486,0.0053924974,0.0003352032,0.0000030709054,0.000102343685,0.005397307],"genre_scores_gemma":[0.9802096,0.0000135725095,0.017557174,0.00030640222,0.0014559996,0.0000039627635,0.0000010867736,0.000024078652,0.00042816089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968036,0.0005151982,0.0009593312,0.00043039367,0.000817832,0.0004736507],"domain_scores_gemma":[0.99757,0.00047571462,0.0008386474,0.0006982922,0.00024174013,0.00017564316],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017708492,0.00033323703,0.0006858975,0.0008388786,0.00033616304,0.00033886638,0.0015249947,0.00019477887,0.000020026644],"category_scores_gemma":[0.0005356379,0.00025458774,0.00031921762,0.0009498161,0.00005931876,0.0002342047,0.00040166886,0.0014403652,0.000021720765],"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.00020247289,0.000079078054,0.00096760906,0.00019272578,0.00015926959,0.00016394847,0.0022611243,0.9671227,0.0028046502,0.01096385,0.002520661,0.012561909],"study_design_scores_gemma":[0.015877204,0.0034454816,0.007190208,0.015995087,0.00048455715,0.0040381895,0.0026497608,0.8399329,0.0016139062,0.003992901,0.10205632,0.0027234738],"about_ca_topic_score_codex":0.000030790947,"about_ca_topic_score_gemma":0.0000011985779,"teacher_disagreement_score":0.9230398,"about_ca_system_score_codex":0.0003088502,"about_ca_system_score_gemma":0.0002431142,"threshold_uncertainty_score":0.99999064},"labels":[],"label_agreement":null},{"id":"W4416890273","doi":"10.1016/j.sysarc.2025.103659","title":"Reconfigurable acceleration for database systems: Taxonomy, techniques, and research challenges","year":2025,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Advanced Database Systems and Queries","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 New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Acceleration; Key (lock); Database application; Hardware acceleration","score_opus":0.08471486437881295,"score_gpt":0.33418972092458527,"score_spread":0.2494748565457723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416890273","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.00087066315,0.047652844,0.94356537,0.0019094604,0.0013605749,0.0016057248,0.00006600185,0.00006615983,0.0029032254],"genre_scores_gemma":[0.5288307,0.010925709,0.44631374,0.000176949,0.0051676477,0.0021830504,0.00004327669,0.0001085876,0.006250317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977753,0.00037210155,0.00075961987,0.00035214404,0.00040126778,0.0003395642],"domain_scores_gemma":[0.9974761,0.00056147977,0.00044720384,0.0006099611,0.0007836843,0.000121588506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033917017,0.00018414985,0.00047859948,0.0006856292,0.0003102038,0.0002736989,0.00055230624,0.000118496886,7.440805e-7],"category_scores_gemma":[0.00022744345,0.00013792435,0.000071549155,0.00034344348,0.00007188411,0.0008383559,0.00014857885,0.00048369722,9.66925e-7],"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.0002086407,0.00010934441,0.000041439285,0.005393436,0.0002340268,0.0001264157,0.0015338468,0.0011268106,0.011723701,0.804673,0.023472127,0.1513572],"study_design_scores_gemma":[0.00048804446,0.00029873097,0.000011355545,0.0021435367,0.00001071733,0.00086476683,0.0010795135,0.0014108425,0.0024758286,0.00087301957,0.9901845,0.00015915495],"about_ca_topic_score_codex":0.00007652715,"about_ca_topic_score_gemma":0.000021317808,"teacher_disagreement_score":0.96671236,"about_ca_system_score_codex":0.000101466096,"about_ca_system_score_gemma":0.00026448152,"threshold_uncertainty_score":0.56243914},"labels":[],"label_agreement":null},{"id":"W4416918133","doi":"10.1016/j.sysarc.2025.103662","title":"privXCA: An efficient and privacy-preserving auditing architecture for cross-chain transfers","year":2025,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"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 Key Research and Development Program of China; Key Technologies Research and Development Program; National Natural Science Foundation of China","keywords":"Audit; Database transaction; Information security audit; Audit trail; Distributed transaction; Asset (computer security); Proof-of-work system; Operational auditing","score_opus":0.008894077930865692,"score_gpt":0.268105961338145,"score_spread":0.2592118834072793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416918133","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.36420798,0.0008522208,0.6307677,0.0033605506,0.0002518238,0.0004096372,0.000008161717,0.000063731786,0.00007819324],"genre_scores_gemma":[0.9543652,0.000010432644,0.045232225,0.00014233204,0.00015649463,0.00003767438,9.0156624e-7,0.000012049168,0.000042670858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830085,0.000114181996,0.0006346274,0.00036446846,0.0002482195,0.00033765394],"domain_scores_gemma":[0.9983339,0.0002963499,0.0003406398,0.0006496656,0.00025274293,0.00012674066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011913463,0.00020725655,0.00040018867,0.00047472812,0.0003869151,0.000268924,0.0014831527,0.00021312469,7.809987e-7],"category_scores_gemma":[0.00020622012,0.00016167114,0.00013984171,0.00044839695,0.00013466546,0.000105947904,0.00025047042,0.0006467403,2.034564e-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.00026298623,0.0005340277,0.0031303072,0.0021660721,0.0005364148,0.000067991605,0.017505027,0.31426185,0.02182198,0.3747858,0.0011301195,0.2637974],"study_design_scores_gemma":[0.007378687,0.0021837289,0.01294111,0.002525214,0.0001945979,0.00325744,0.001385926,0.680792,0.008334576,0.19272667,0.086765915,0.001514149],"about_ca_topic_score_codex":0.000013117601,"about_ca_topic_score_gemma":0.000010929802,"teacher_disagreement_score":0.5901573,"about_ca_system_score_codex":0.000049175334,"about_ca_system_score_gemma":0.000123534,"threshold_uncertainty_score":0.65927577},"labels":[],"label_agreement":null},{"id":"W892034677","doi":"10.1016/j.sysarc.2015.05.003","title":"Compositional power-aware real-time scheduling with discrete frequency levels","year":2015,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Ministry of Science, ICT and Future Planning; National Research Foundation of Korea; Ministry of Education","keywords":"Computer science; Scheduling (production processes); Power (physics); Real-time computing; Distributed computing; Parallel computing; Mathematical optimization; Mathematics","score_opus":0.01793644010566905,"score_gpt":0.2475372817204978,"score_spread":0.22960084161482874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W892034677","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.26347128,0.00071517506,0.72921765,0.0011621305,0.0011021513,0.00038717818,0.000019203886,0.00013291549,0.0037923113],"genre_scores_gemma":[0.8601567,0.0000027712622,0.1389471,0.000039879586,0.0006813606,0.0000063211837,0.000002850209,0.000039792594,0.00012323019],"study_design_codex":"simulation_or_modeling","study_design_gemma":"case_report","domain_scores_codex":[0.9957379,0.00048390345,0.0011576975,0.000424008,0.0016675624,0.0005289318],"domain_scores_gemma":[0.99607986,0.00020952402,0.0013393067,0.0007020678,0.001018746,0.00065047335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017622048,0.00039506351,0.0008094469,0.00045054164,0.00017505334,0.0005819803,0.0014628076,0.00016919068,0.000010893806],"category_scores_gemma":[0.000086339605,0.00026873796,0.00021329538,0.00057853817,0.00008986417,0.0010860581,0.00016937591,0.00072094117,0.000061802595],"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.0005758738,0.000434132,0.009287066,0.000850696,0.0018480945,0.0051130936,0.020489518,0.6793612,0.24090247,0.035914697,0.0028250571,0.0023980897],"study_design_scores_gemma":[0.047569547,0.030966576,0.048712548,0.052001122,0.0011364638,0.3952039,0.014062507,0.3109018,0.021918386,0.04911904,0.0129974615,0.015410679],"about_ca_topic_score_codex":0.00013030357,"about_ca_topic_score_gemma":0.0000045928377,"teacher_disagreement_score":0.5966854,"about_ca_system_score_codex":0.0002671522,"about_ca_system_score_gemma":0.0008076424,"threshold_uncertainty_score":0.99997646},"labels":[],"label_agreement":null}]}