{"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9038678,0.0027362136,0.064412616,0.00055271474,0.00014929954,0.00006591165,0.0009749452,0.0009780397,0.026262458],"genre_scores_gemma":[0.9773397,0.00027975047,0.018457107,0.0000659696,0.000019393472,0.000034824192,0.00027359187,0.000035686047,0.0034940075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999248,0.000011195051,0.0000048637967,0.000011964214,0.000018005792,0.000029202436],"domain_scores_gemma":[0.9997937,0.000039683866,0.00002989303,0.00004653819,0.000061377876,0.000028797127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000091863185,0.00011933156,0.00019131068,0.0003214065,0.00045585592,0.00068552105,0.00066896086,0.00020009454,0.0044944803],"category_scores_gemma":[0.00047610115,0.000121332305,0.00018131641,0.0006451753,0.0001725245,0.00067449064,0.00038318548,0.0002349189,0.00041724675],"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.002125187,0.00040572093,0.015925411,0.00056409865,0.00010830884,0.00072384084,0.0006954819,0.2538822,0.08804455,0.26471165,0.033093672,0.33971995],"study_design_scores_gemma":[0.00014150456,0.00045656716,0.009011862,0.000048272774,0.000092873735,0.00038956886,0.0007628577,0.8571497,0.028141452,0.079667486,0.024094256,0.00004360666],"about_ca_topic_score_codex":0.0020442477,"about_ca_topic_score_gemma":0.006554471,"teacher_disagreement_score":0.0044944803,"about_ca_system_score_codex":0.00051840575,"about_ca_system_score_gemma":0.0005871377,"threshold_uncertainty_score":0.01503557},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31419632,0.00013123074,0.6707306,0.00018356548,0.0000485929,0.00008805972,0.00009263569,0.0035248506,0.011004097],"genre_scores_gemma":[0.9499292,0.000044976605,0.047656137,0.000018118615,0.0000038362723,0.000032726573,0.00005894937,0.00015960043,0.0020963894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963415,0.0001350051,0.000018045903,0.000040301908,0.00011635392,0.00005624207],"domain_scores_gemma":[0.9991105,0.00041952802,0.00009108401,0.00016276985,0.00019126826,0.00002471472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005477721,0.00073347846,0.00032001504,0.00025959348,0.00028065615,0.0007500791,0.0007556555,0.00036059468,0.003651739],"category_scores_gemma":[0.002244215,0.00034279784,0.00037779548,0.00017198874,0.000244068,0.0006931604,0.00051005656,0.0006334568,0.000570435],"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.00015207031,0.00007353498,0.00076806586,0.0000626612,0.000016875683,0.00004995248,0.00007429743,0.95574826,0.012106678,0.0030142718,0.00029186904,0.02764152],"study_design_scores_gemma":[0.000016907687,0.000044884277,0.000110816545,0.00000467403,0.000010366408,0.000008009729,0.000017438222,0.990471,0.008029358,0.0007376403,0.0005462419,0.0000026779742],"about_ca_topic_score_codex":0.005519802,"about_ca_topic_score_gemma":0.007167578,"teacher_disagreement_score":0.005519802,"about_ca_system_score_codex":0.0006469995,"about_ca_system_score_gemma":0.0011294074,"threshold_uncertainty_score":0.01221627},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.613389,0.0024395108,0.34496954,0.00076384854,0.00015186038,0.00023254256,0.00060172915,0.001147969,0.03630403],"genre_scores_gemma":[0.9824867,0.0003616245,0.013819005,0.000025803034,0.000015891908,0.00005286326,0.00009356785,0.0000579283,0.0030866629],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996489,0.00013704333,0.000010592326,0.000042469957,0.0001024936,0.000058416248],"domain_scores_gemma":[0.99913776,0.000418084,0.000103107974,0.00006806616,0.00023117731,0.00004169929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005690085,0.00056215667,0.00065723323,0.00050858926,0.00043398896,0.00082509284,0.00147,0.0010623377,0.002111401],"category_scores_gemma":[0.002176434,0.00037208977,0.00042529978,0.0005228524,0.00045808248,0.00093794893,0.00033846326,0.00037267536,0.0002953674],"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.000015994738,0.000014394816,0.00019107726,0.000016293321,0.000005407259,0.000013582611,0.0000092729215,0.9961653,0.0009327437,0.0012612104,0.00012437203,0.0012504109],"study_design_scores_gemma":[0.0000014419373,0.000012341988,0.000048855607,0.0000010806525,0.0000029161401,0.0000025357886,0.000002679103,0.99937856,0.00027260152,0.00017191582,0.00010367312,0.0000013263976],"about_ca_topic_score_codex":0.011239144,"about_ca_topic_score_gemma":0.008071676,"teacher_disagreement_score":0.011239144,"about_ca_system_score_codex":0.0016009994,"about_ca_system_score_gemma":0.0011105409,"threshold_uncertainty_score":0.02234745},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28329185,0.00027627475,0.7050818,0.00049566774,0.00018655644,0.00013149464,0.000102232596,0.00086119224,0.009572993],"genre_scores_gemma":[0.9098351,0.00008889231,0.0883408,0.00010194907,0.000019731506,0.00007537144,0.000038680337,0.000049995106,0.0014495067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999759,0.00005409954,0.00001568389,0.00005932058,0.00006867154,0.00004313648],"domain_scores_gemma":[0.99927455,0.00032370744,0.00010275376,0.00011381985,0.00013663528,0.000048521608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038560145,0.00033312914,0.00037175755,0.00019067586,0.00040769047,0.0006498642,0.000846452,0.0005065531,0.0011462648],"category_scores_gemma":[0.0013542939,0.000261622,0.0002614694,0.00027227736,0.0005565038,0.00060608727,0.00047802654,0.00055140647,0.00024779877],"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.00044393464,0.0002677073,0.002362616,0.00029542853,0.00010420036,0.0003344719,0.00028081046,0.40206552,0.36412555,0.14622647,0.0026400732,0.08085314],"study_design_scores_gemma":[0.00007963256,0.00013630056,0.00023964829,0.000007897432,0.000034672037,0.000049479513,0.000023502598,0.93412083,0.049166083,0.01403893,0.002087245,0.000015671776],"about_ca_topic_score_codex":0.0008996136,"about_ca_topic_score_gemma":0.0029250653,"teacher_disagreement_score":0.0011462648,"about_ca_system_score_codex":0.00068223657,"about_ca_system_score_gemma":0.0007335973,"threshold_uncertainty_score":0.004949987},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37964347,0.0017387954,0.57664615,0.0014783645,0.0002022359,0.0001875152,0.0019859655,0.009568397,0.028549068],"genre_scores_gemma":[0.92320776,0.00022357663,0.07004971,0.0001307204,0.000107745174,0.000122097,0.00083973916,0.0012427798,0.0040758485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99323297,0.0012500494,0.00023795555,0.0010793903,0.0034231711,0.0007765387],"domain_scores_gemma":[0.96565294,0.02005637,0.0023663302,0.0060475073,0.0050247386,0.00085214374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047301156,0.0007832749,0.0007052994,0.0028993657,0.0010405792,0.0028755781,0.002561904,0.00084065984,0.0061155865],"category_scores_gemma":[0.03004002,0.00063064095,0.00074817985,0.0021468736,0.0023433564,0.006074608,0.0014241704,0.00225183,0.00079897244],"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.001683053,0.0006764561,0.02229684,0.0010296954,0.00018197429,0.00032352263,0.0010896983,0.18339977,0.100217275,0.49384725,0.01011239,0.18514217],"study_design_scores_gemma":[0.000050286995,0.00033787265,0.01032723,0.00006446482,0.00012734403,0.0002175339,0.00026919966,0.85762936,0.038507875,0.08548309,0.006897155,0.00008858631],"about_ca_topic_score_codex":0.0035756668,"about_ca_topic_score_gemma":0.0042215553,"teacher_disagreement_score":0.0061155865,"about_ca_system_score_codex":0.002498789,"about_ca_system_score_gemma":0.002829373,"threshold_uncertainty_score":0.025015593},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93767756,0.00039156017,0.056282196,0.0002562491,0.000059010796,0.00011295941,0.0006901937,0.0006088943,0.0039213514],"genre_scores_gemma":[0.9728212,0.00010296834,0.025647242,0.000015805304,0.000012672541,0.000057367433,0.00051059405,0.000046631212,0.0007855836],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99603003,0.0009431827,0.00035785456,0.0003128943,0.0020853495,0.00027062197],"domain_scores_gemma":[0.9644659,0.017670646,0.0074219885,0.0019247987,0.006774103,0.001742611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038984944,0.0012279833,0.0005206907,0.009127379,0.00053162494,0.0021250339,0.0005913723,0.00093681604,0.0010505259],"category_scores_gemma":[0.036328115,0.00035091382,0.0007630214,0.0037824106,0.000569847,0.0039420635,0.001363204,0.0011977666,0.000358731],"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.00065235497,0.00046223722,0.7759145,0.00024557146,0.0004998877,0.00027610344,0.0013766966,0.018179365,0.020157175,0.0050293063,0.0022430392,0.17496373],"study_design_scores_gemma":[0.00007200924,0.0021137835,0.6917934,0.00020557332,0.00061550346,0.0012050605,0.0015786368,0.24709748,0.03518658,0.0151247475,0.004734305,0.00027289186],"about_ca_topic_score_codex":0.002795093,"about_ca_topic_score_gemma":0.0068085473,"teacher_disagreement_score":0.009127379,"about_ca_system_score_codex":0.0007556871,"about_ca_system_score_gemma":0.0011666329,"threshold_uncertainty_score":0.020617485},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3045943,0.004185147,0.6167606,0.0007221599,0.0010523044,0.0003908633,0.00078019936,0.040629815,0.030884542],"genre_scores_gemma":[0.70050853,0.0005748243,0.2750384,0.0003474798,0.00008796094,0.00020535238,0.0013203828,0.00069227465,0.02122483],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972886,0.00003688439,0.000022137969,0.000050827457,0.000098261335,0.00006309721],"domain_scores_gemma":[0.9995437,0.000072081326,0.000045809244,0.00011629615,0.00014386057,0.000078277946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005001058,0.00061574264,0.00064711017,0.00063319877,0.00066181284,0.001013126,0.0022694676,0.00079094456,0.004884221],"category_scores_gemma":[0.00080905325,0.00046321936,0.00041788246,0.0002973146,0.0004236551,0.0012809095,0.000960611,0.0008132054,0.0016306349],"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.0026514682,0.00039896337,0.0029232258,0.0013248613,0.000341368,0.0010847659,0.0004052392,0.05511049,0.5592587,0.023916734,0.0388583,0.31372586],"study_design_scores_gemma":[0.00070037757,0.0026273741,0.0040732007,0.00013816291,0.00050684094,0.0014313725,0.00021880624,0.5660778,0.35601,0.009140655,0.058797147,0.000278176],"about_ca_topic_score_codex":0.0013712536,"about_ca_topic_score_gemma":0.003235316,"teacher_disagreement_score":0.004884221,"about_ca_system_score_codex":0.00045547128,"about_ca_system_score_gemma":0.00095553574,"threshold_uncertainty_score":0.016339302},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019888544,0.00059215847,0.9744251,0.00033461215,0.00007190531,0.00006404565,0.000042378848,0.00040400575,0.0041772905],"genre_scores_gemma":[0.39135525,0.00043673743,0.60198116,0.00019068076,0.00009700793,0.00029837634,0.00013964745,0.00021800831,0.005283148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999371,0.00028644592,0.000023527627,0.00009073447,0.00014725665,0.00008117996],"domain_scores_gemma":[0.9972996,0.002214139,0.00011095417,0.000109069304,0.00021700995,0.00004936284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017283594,0.0010401966,0.0013401359,0.001405403,0.00096977456,0.0010809421,0.0016210891,0.00212152,0.0034882014],"category_scores_gemma":[0.0061962423,0.0010261055,0.0009529587,0.0014270771,0.0014970632,0.0012867791,0.00097507396,0.0015629982,0.00039288448],"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.000040000665,0.000025385967,0.00011897977,0.000019034947,0.000023322928,0.000014137021,0.00003923589,0.95624745,0.00032426027,0.011499814,0.00071844266,0.030930009],"study_design_scores_gemma":[0.000018001703,0.0000067912933,0.00004244486,0.0000033631493,0.0000058721193,0.0000033617257,0.0000069526955,0.9903064,0.000109898894,0.009269652,0.00022423713,0.0000030574668],"about_ca_topic_score_codex":0.019726172,"about_ca_topic_score_gemma":0.013916678,"teacher_disagreement_score":0.019726172,"about_ca_system_score_codex":0.0022923432,"about_ca_system_score_gemma":0.0021346563,"threshold_uncertainty_score":0.039222658},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20765376,0.00307623,0.7788703,0.0010658819,0.00071264565,0.00016627579,0.00016674964,0.002952268,0.0053359554],"genre_scores_gemma":[0.963709,0.00022018109,0.03404617,0.00010438616,0.00008549949,0.000046438472,0.000049673803,0.000049682425,0.0016890445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907434,0.00030684652,0.000092604976,0.00013432682,0.00022147215,0.00017030192],"domain_scores_gemma":[0.99858284,0.0005063206,0.00011957466,0.00029580086,0.0004334337,0.000062062805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018131825,0.00053793815,0.00059207645,0.0006928331,0.0006908871,0.0009122756,0.001587609,0.00051057903,0.0019637304],"category_scores_gemma":[0.0034611828,0.0002840894,0.0002399338,0.00059581833,0.00073440943,0.001683231,0.00080452237,0.00078378594,0.00031381115],"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.002171279,0.00031286114,0.003888755,0.00019897877,0.00013463115,0.00024564343,0.00055387494,0.569661,0.039627314,0.02675674,0.009333934,0.34711495],"study_design_scores_gemma":[0.000062721425,0.00019966293,0.0008468676,0.000016108499,0.000039852875,0.0001294781,0.000095263975,0.9774948,0.008757401,0.009093279,0.00323029,0.00003421695],"about_ca_topic_score_codex":0.005054128,"about_ca_topic_score_gemma":0.009788131,"teacher_disagreement_score":0.005054128,"about_ca_system_score_codex":0.0011402892,"about_ca_system_score_gemma":0.0012285793,"threshold_uncertainty_score":0.010049403},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057605807,0.00026794767,0.92379576,0.00016718685,0.00011926699,0.00026364715,0.00020074558,0.009851451,0.00772818],"genre_scores_gemma":[0.64574105,0.000057751287,0.34813443,0.0001882969,0.00006989305,0.00012557555,0.00030960556,0.00026748682,0.0051059425],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993425,0.000119855904,0.000036884063,0.00015032252,0.00027088597,0.00007947962],"domain_scores_gemma":[0.9989774,0.00021100864,0.00011625309,0.00039482705,0.00023631915,0.00006432546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003139961,0.0006240809,0.0005396936,0.0009999388,0.0006134067,0.00080378255,0.0017606501,0.00052885705,0.00656397],"category_scores_gemma":[0.0008493767,0.00024873685,0.00024490483,0.000659372,0.00036591917,0.00087037944,0.0007635029,0.000573738,0.0012855142],"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.00096162973,0.00025087438,0.0028976044,0.000233747,0.00008989364,0.00047225849,0.00013401601,0.013774026,0.3650023,0.016748,0.0076455004,0.5917902],"study_design_scores_gemma":[0.00041372384,0.0022149435,0.0038977542,0.00007011636,0.0002740884,0.0036861126,0.0000811089,0.41604355,0.54050183,0.0069150017,0.02577605,0.00012568779],"about_ca_topic_score_codex":0.0014265201,"about_ca_topic_score_gemma":0.0042899633,"teacher_disagreement_score":0.00656397,"about_ca_system_score_codex":0.0005851681,"about_ca_system_score_gemma":0.0009000285,"threshold_uncertainty_score":0.02195865},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24488296,0.00056635577,0.71887153,0.00053520943,0.00009602092,0.000114314025,0.00021874039,0.001363327,0.033351567],"genre_scores_gemma":[0.927771,0.00014450772,0.069647074,0.00004170587,0.000016830201,0.00007982308,0.0000724999,0.000114436414,0.0021121693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998342,0.000042144493,0.0000058890737,0.000017517912,0.000073255804,0.000027020178],"domain_scores_gemma":[0.9996556,0.0001718148,0.000047868485,0.000038994967,0.000075629985,0.000009975292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028837347,0.00047490158,0.00040347787,0.000411802,0.0003204223,0.00047866465,0.0006297214,0.0004601267,0.0016308157],"category_scores_gemma":[0.0012512304,0.000388662,0.00041943195,0.00038441006,0.00027101117,0.0006398924,0.00026091828,0.0003217229,0.00022513582],"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.000016733717,0.000018472561,0.00016878759,0.00002787024,0.000008453556,0.00002331559,0.000016343509,0.9867215,0.004002692,0.0041023837,0.00023390788,0.004659519],"study_design_scores_gemma":[0.0000036973802,0.000010513076,0.000029375751,0.00000173658,0.0000033715855,0.000004732775,0.0000026798002,0.99804014,0.0009361364,0.0007716949,0.0001944692,0.0000014846038],"about_ca_topic_score_codex":0.0035275766,"about_ca_topic_score_gemma":0.006015496,"teacher_disagreement_score":0.0035275766,"about_ca_system_score_codex":0.00088510884,"about_ca_system_score_gemma":0.0012288059,"threshold_uncertainty_score":0.007014096},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013792575,0.00008502635,0.98063385,0.000093590024,0.00003168579,0.000051934843,0.0000452419,0.0040184967,0.0012475481],"genre_scores_gemma":[0.109928325,0.000062897154,0.88659817,0.00008094738,0.000018821143,0.00007775671,0.0001756144,0.0005012239,0.0025562625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964046,0.000054972115,0.000025891863,0.00008935833,0.00013155284,0.000057717134],"domain_scores_gemma":[0.9995092,0.0001320214,0.00003970036,0.00014151313,0.00015237814,0.00002514327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061786664,0.0010043369,0.001011844,0.0010442004,0.00080423185,0.0010569174,0.0016606578,0.0009781851,0.005802758],"category_scores_gemma":[0.001482791,0.0005956577,0.0009214472,0.00094794005,0.00053740677,0.001486413,0.0012257355,0.0011291332,0.0015894672],"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.0005216705,0.00016620765,0.000995434,0.00014227901,0.00008835383,0.0001478514,0.000115868635,0.103717715,0.0543461,0.013683061,0.0054709907,0.8206045],"study_design_scores_gemma":[0.0000664805,0.00010177818,0.00026751202,0.000012328621,0.000053938325,0.00006622858,0.00004079594,0.95961094,0.024402138,0.012303774,0.0030495028,0.000024628866],"about_ca_topic_score_codex":0.002674753,"about_ca_topic_score_gemma":0.0042806836,"teacher_disagreement_score":0.005802758,"about_ca_system_score_codex":0.00052813895,"about_ca_system_score_gemma":0.0013325391,"threshold_uncertainty_score":0.01941216},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07038566,0.00048757275,0.8347714,0.00040663197,0.0003158929,0.00034201244,0.0004400832,0.07697031,0.015880374],"genre_scores_gemma":[0.5451129,0.000334263,0.42553565,0.00053239183,0.000080530575,0.00032289952,0.0017363445,0.006169122,0.020175815],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987079,0.0001933066,0.000118194905,0.00026641402,0.00041420397,0.00029994207],"domain_scores_gemma":[0.9981589,0.00036885604,0.00011984862,0.00078873395,0.00038531213,0.00017844167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013383675,0.0008730952,0.0007248776,0.0007942863,0.00069703365,0.0021075294,0.0043985653,0.0011318141,0.011803801],"category_scores_gemma":[0.0038152044,0.0008278823,0.00086172676,0.00087529165,0.0011466111,0.0034023956,0.0035540303,0.0017760686,0.0030962096],"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.0042278897,0.0017184202,0.00694383,0.0009330378,0.00047144562,0.0013456357,0.0019515901,0.03953158,0.15847841,0.23617621,0.055008225,0.4932138],"study_design_scores_gemma":[0.0011197076,0.0013973212,0.0022271664,0.00020549803,0.000543739,0.0008366343,0.0003369722,0.58620477,0.19249953,0.067155585,0.1471568,0.00031613285],"about_ca_topic_score_codex":0.003840805,"about_ca_topic_score_gemma":0.005492196,"teacher_disagreement_score":0.011803801,"about_ca_system_score_codex":0.00096620223,"about_ca_system_score_gemma":0.0024318993,"threshold_uncertainty_score":0.03948766},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52346146,0.0017771041,0.4648923,0.0003334623,0.000050801846,0.00010060061,0.00011750831,0.0015771906,0.0076895645],"genre_scores_gemma":[0.85429716,0.00030793974,0.14375412,0.00005065782,0.000013534948,0.000065435415,0.00015286298,0.00011283487,0.0012453607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997912,0.00010009606,0.00001135246,0.00002193821,0.000047471076,0.00002801106],"domain_scores_gemma":[0.9991596,0.0005729632,0.000050136354,0.00007873765,0.00010887827,0.000029737288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005402237,0.00066028757,0.00066849875,0.00092448026,0.00039542757,0.0004754476,0.0005926814,0.00047669944,0.001302091],"category_scores_gemma":[0.0019021436,0.00049489987,0.00038045537,0.0007930838,0.00029944186,0.0010620038,0.0007832723,0.00028949103,0.00011404232],"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.00035092092,0.00013400312,0.0023393568,0.00020227653,0.00008341114,0.00012339765,0.00021586278,0.7053675,0.02211454,0.0022592517,0.00091172784,0.26589772],"study_design_scores_gemma":[0.000017426833,0.00007417449,0.00041801477,0.000008736354,0.000026495545,0.000030450585,0.00005053396,0.9930058,0.003202464,0.0027221409,0.00043789714,0.000005873303],"about_ca_topic_score_codex":0.0025944284,"about_ca_topic_score_gemma":0.0049967645,"teacher_disagreement_score":0.0025944284,"about_ca_system_score_codex":0.00026888732,"about_ca_system_score_gemma":0.00066489517,"threshold_uncertainty_score":0.005158603},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39733496,0.000854428,0.57896787,0.0007530987,0.00016792944,0.00003411541,0.00011027796,0.0007502721,0.021027064],"genre_scores_gemma":[0.9526516,0.0002281355,0.041590717,0.00014553573,0.000046057416,0.000021595304,0.00006443515,0.000057239904,0.0051945266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997762,0.000054425764,0.000007741552,0.000030056131,0.000075065655,0.00005649392],"domain_scores_gemma":[0.99940515,0.0003261409,0.000048304475,0.00008266377,0.000114802846,0.000023010285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021595787,0.00043162415,0.00024742223,0.00037666247,0.00040575012,0.0004259012,0.0005698742,0.000397714,0.0021228478],"category_scores_gemma":[0.0007992663,0.00014147704,0.00018815104,0.0005344735,0.00037412645,0.0006427728,0.00039221055,0.0003992751,0.00016708572],"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.0007180588,0.00034519882,0.0016751266,0.00022059817,0.00009490654,0.00027976054,0.00020207936,0.44504216,0.1977277,0.14361545,0.004157564,0.20592144],"study_design_scores_gemma":[0.000029373414,0.0001859494,0.0007193853,0.000021559617,0.000046887893,0.00014829873,0.0000455899,0.9163499,0.05050621,0.029760674,0.0021640058,0.000022131717],"about_ca_topic_score_codex":0.00096892496,"about_ca_topic_score_gemma":0.0031288604,"teacher_disagreement_score":0.0021228478,"about_ca_system_score_codex":0.00045374656,"about_ca_system_score_gemma":0.00048774527,"threshold_uncertainty_score":0.007101655},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026768941,0.00008809744,0.9689279,0.00015307326,0.00005206595,0.00012398424,0.00013732813,0.0017033607,0.0020452866],"genre_scores_gemma":[0.60553205,0.00017289296,0.39117438,0.0000846873,0.000027389679,0.00027383945,0.00032908563,0.00026679828,0.0021388815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958853,0.0015950794,0.0003427146,0.00040848384,0.0013503133,0.00041805295],"domain_scores_gemma":[0.98688823,0.0091434885,0.00082304067,0.0016056362,0.0013682657,0.0001713956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042809597,0.0008246809,0.0008751733,0.0011710648,0.0007660153,0.0017721311,0.0016478029,0.0012802199,0.003703713],"category_scores_gemma":[0.015920954,0.0008334348,0.0017062991,0.00044146585,0.0028229014,0.00195421,0.0025168243,0.0016036243,0.00049183064],"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.00036448563,0.00010718137,0.0015819372,0.00037502346,0.00009442193,0.0003467398,0.00029332848,0.65959907,0.01271552,0.2757965,0.00075109553,0.04797472],"study_design_scores_gemma":[0.00008230068,0.00005634245,0.00013363751,0.000054845823,0.00003641824,0.00004857398,0.000036687707,0.90394455,0.014885258,0.077743575,0.0029568376,0.00002100286],"about_ca_topic_score_codex":0.004937566,"about_ca_topic_score_gemma":0.004545691,"teacher_disagreement_score":0.004937566,"about_ca_system_score_codex":0.0012713912,"about_ca_system_score_gemma":0.0028949676,"threshold_uncertainty_score":0.022640109},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121888705,0.001522051,0.8492147,0.0007955459,0.00078125723,0.00022916593,0.00040005572,0.005071801,0.020096747],"genre_scores_gemma":[0.7872616,0.0003898195,0.18906993,0.000572554,0.00035640426,0.00023842191,0.00041897016,0.00044823004,0.021244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988366,0.00019756412,0.00011029593,0.00017855327,0.00048130326,0.00019582993],"domain_scores_gemma":[0.99840003,0.00034043728,0.00012603324,0.00073764374,0.00031232374,0.000083517734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015067827,0.0005547825,0.00044145362,0.0007967452,0.0009451137,0.0014419415,0.0007156777,0.00083716935,0.009274679],"category_scores_gemma":[0.0025081115,0.00038253432,0.00036405885,0.0006083101,0.0008299932,0.0032256166,0.0019387364,0.0012976798,0.0028788778],"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.003626674,0.00021873957,0.0031579698,0.00046992645,0.00007499158,0.0005952256,0.00081967877,0.0049182745,0.149913,0.42922226,0.020531794,0.38645148],"study_design_scores_gemma":[0.00041781043,0.0014510101,0.0033423223,0.00024924247,0.00014636986,0.0027157706,0.00047860006,0.13945056,0.30875164,0.45036948,0.09233748,0.0002897134],"about_ca_topic_score_codex":0.00017096699,"about_ca_topic_score_gemma":0.00036517548,"teacher_disagreement_score":0.009274679,"about_ca_system_score_codex":0.0004884746,"about_ca_system_score_gemma":0.00084173755,"threshold_uncertainty_score":0.03102696},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023397189,0.037222467,0.011179417,0.017499048,0.8289023,0.0003760586,0.00047645372,0.0008014474,0.10120309],"genre_scores_gemma":[0.013259141,0.050076436,0.006272344,0.0077656796,0.5207773,0.0002805258,0.0018855762,0.0011953893,0.39848757],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965486,0.0005348864,0.0003549555,0.00054544804,0.0016667866,0.00034935182],"domain_scores_gemma":[0.9928731,0.0013897235,0.00037666163,0.00064827775,0.0035268092,0.0011855214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032438182,0.0025037287,0.0022114085,0.0043343552,0.0017044182,0.0061847987,0.0019361547,0.0044932384,0.11557618],"category_scores_gemma":[0.0055917436,0.0006611075,0.0011039785,0.003056731,0.0012683197,0.0042788787,0.0032646041,0.0032280153,0.03931916],"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.00006435859,0.00007940498,0.00022588467,0.0005815027,0.000019047764,0.00015210285,0.000028223,0.00030603202,0.0010701634,0.0032524867,0.89795744,0.096263245],"study_design_scores_gemma":[0.000013474161,0.000127118,0.000772197,0.00030640067,0.000020537025,0.0004841963,0.00004297622,0.0009346159,0.0006448653,0.002980168,0.993652,0.000021392918],"about_ca_topic_score_codex":0.0008231374,"about_ca_topic_score_gemma":0.0022843187,"teacher_disagreement_score":0.11557618,"about_ca_system_score_codex":0.0016173596,"about_ca_system_score_gemma":0.0024124645,"threshold_uncertainty_score":0.38664085},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026033284,0.00037942574,0.9612454,0.00039265188,0.00032635973,0.00022398206,0.0002561659,0.005285417,0.0058572455],"genre_scores_gemma":[0.7745093,0.00019097848,0.21374044,0.00036627377,0.00016552575,0.000284156,0.0003901642,0.00040081135,0.009952376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856085,0.0003095464,0.00006111045,0.00033561647,0.00035211805,0.00038078017],"domain_scores_gemma":[0.9985661,0.00040492244,0.000068679794,0.0005151928,0.00025599464,0.00018913053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012646008,0.0010207604,0.0012005732,0.0005798565,0.0015041098,0.0019029458,0.0027165094,0.0012932005,0.005540498],"category_scores_gemma":[0.0037914608,0.00039795236,0.00064619555,0.00082820817,0.0008086236,0.0018559174,0.004382366,0.0016644654,0.0015725961],"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.0036677644,0.0008956527,0.0017912687,0.00040765584,0.00022402211,0.0006665143,0.0006122657,0.3005241,0.052814055,0.058153458,0.04682052,0.5334228],"study_design_scores_gemma":[0.000067246496,0.00011691112,0.00023044087,0.000009874668,0.000016850645,0.00011750982,0.00008466369,0.96413124,0.008935371,0.019755185,0.006507193,0.000027606646],"about_ca_topic_score_codex":0.003714537,"about_ca_topic_score_gemma":0.0042534904,"teacher_disagreement_score":0.005540498,"about_ca_system_score_codex":0.00075135933,"about_ca_system_score_gemma":0.0018845749,"threshold_uncertainty_score":0.01853478},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96380603,0.0024844508,0.027174145,0.00018740917,0.000073466676,0.000014984907,0.00010087584,0.0006460466,0.005512592],"genre_scores_gemma":[0.99765825,0.00018133745,0.0016856528,0.000022664704,0.0000055282408,0.0000034749994,0.000020541474,0.000007182569,0.0004154717],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99995613,0.000004818574,0.0000032814849,0.000008337151,0.000015985872,0.000011409628],"domain_scores_gemma":[0.9999014,0.00002283589,0.000011361034,0.000026473024,0.000030375591,0.000007551549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007362447,0.00015163851,0.00019438934,0.00014017503,0.00018871755,0.00035946665,0.0004004509,0.00020658669,0.0011059237],"category_scores_gemma":[0.00019842414,0.00007227694,0.00015958307,0.00015972022,0.00015145267,0.00050161994,0.0002957351,0.00013153555,0.00015656334],"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.00047250223,0.00012066164,0.0041988264,0.00038156897,0.00008165263,0.0006285713,0.00031275125,0.05774067,0.79713863,0.0045737415,0.0016753975,0.13267507],"study_design_scores_gemma":[0.000034955614,0.0008712334,0.007178134,0.000041002913,0.00013669593,0.0008039423,0.00027017467,0.51519954,0.4627788,0.005005671,0.007622655,0.000057151785],"about_ca_topic_score_codex":0.00045425963,"about_ca_topic_score_gemma":0.0014591286,"teacher_disagreement_score":0.0011059237,"about_ca_system_score_codex":0.00012316958,"about_ca_system_score_gemma":0.00018466849,"threshold_uncertainty_score":0.00369972},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07721574,0.00066184584,0.9147286,0.00022199565,0.00023521525,0.00015189101,0.00007430706,0.0030381938,0.0036723618],"genre_scores_gemma":[0.7262176,0.00016296474,0.2638533,0.00038047228,0.000057953243,0.00019970363,0.00028927735,0.00015284176,0.008685885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951994,0.000068363915,0.000018830851,0.00011647985,0.0001242412,0.00015206751],"domain_scores_gemma":[0.9996731,0.000100669226,0.00003361706,0.000034856075,0.00012878087,0.00002890646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058541907,0.0012321838,0.0016010572,0.0008153862,0.0006711797,0.0008184049,0.001954768,0.001613122,0.0021169542],"category_scores_gemma":[0.001022506,0.000516448,0.00076652574,0.0006046696,0.00048362333,0.0007451806,0.0010172112,0.0010320565,0.0007636194],"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.0007645031,0.00045033667,0.003507202,0.00010573938,0.00023829647,0.00015420155,0.000078036224,0.49245006,0.017733619,0.002098999,0.005320702,0.47709835],"study_design_scores_gemma":[0.000016131302,0.00006939698,0.0005262814,0.0000051471197,0.000015597809,0.00002949861,0.000010329588,0.9971595,0.0015071037,0.00034770835,0.00030612902,0.000007219541],"about_ca_topic_score_codex":0.014260684,"about_ca_topic_score_gemma":0.015452347,"teacher_disagreement_score":0.014260684,"about_ca_system_score_codex":0.0005744795,"about_ca_system_score_gemma":0.0017988981,"threshold_uncertainty_score":0.02835536},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22072889,0.005166359,0.72648644,0.00073625275,0.0007842824,0.00019704226,0.00088182435,0.021743104,0.023275835],"genre_scores_gemma":[0.6209747,0.0010695128,0.36295745,0.00034560412,0.0000892571,0.000080520105,0.0008899476,0.00021256752,0.013380507],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99971634,0.000030570445,0.00002264448,0.000069573194,0.0001020825,0.000058692087],"domain_scores_gemma":[0.99952376,0.00012948211,0.00002648499,0.00012555212,0.00016695839,0.000027774593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027995437,0.00059799163,0.00040983013,0.0011330994,0.0004408884,0.0011761362,0.0009901645,0.00036007803,0.009720615],"category_scores_gemma":[0.0009123225,0.00027797557,0.00034833964,0.0012223904,0.00018028963,0.0010597081,0.00035877235,0.00045821854,0.0018900271],"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.0012387974,0.00023669234,0.006039962,0.00040298374,0.0001738751,0.00027523018,0.00014731081,0.021152388,0.09615169,0.01290344,0.025282545,0.8359951],"study_design_scores_gemma":[0.0002641547,0.0009333757,0.0060794987,0.00014878596,0.0002818963,0.00094471034,0.00034047835,0.7023188,0.2065157,0.018531036,0.06355913,0.00008246187],"about_ca_topic_score_codex":0.007161114,"about_ca_topic_score_gemma":0.011732205,"teacher_disagreement_score":0.009720615,"about_ca_system_score_codex":0.00074969034,"about_ca_system_score_gemma":0.000993777,"threshold_uncertainty_score":0.032518744},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042046442,0.002005938,0.00017258139,0.012141849,0.9839078,0.000016502821,0.00003347261,0.00005103555,0.0016288088],"genre_scores_gemma":[0.0004687107,0.002254598,0.00014061111,0.006529055,0.9788327,0.000016522841,0.000036450594,0.000049143837,0.011672257],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9951687,0.00060368946,0.00041968262,0.00053167116,0.002907722,0.0003685059],"domain_scores_gemma":[0.9851596,0.0035143227,0.0009887554,0.00039338975,0.007387498,0.0025565862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005485668,0.0034831064,0.0037417712,0.0031495222,0.0023923046,0.00852209,0.0027991375,0.010723284,0.019942997],"category_scores_gemma":[0.013831273,0.0012094439,0.002347411,0.0013525976,0.001699959,0.0034351544,0.0013463444,0.014528996,0.012992021],"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.000043964294,0.000020825551,0.00002638893,0.00017331858,0.000020281972,0.00010283879,0.0000064756427,0.000051944084,0.00014746143,0.000297269,0.99449956,0.0046095657],"study_design_scores_gemma":[0.0000896634,0.000058873007,0.00033207293,0.00024596901,0.00006575091,0.00024066927,0.000029837436,0.0004974619,0.0002846075,0.0012580961,0.9968766,0.000020364583],"about_ca_topic_score_codex":0.0009378578,"about_ca_topic_score_gemma":0.003707984,"teacher_disagreement_score":0.019942997,"about_ca_system_score_codex":0.0022845392,"about_ca_system_score_gemma":0.002685213,"threshold_uncertainty_score":0.066715956},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08975689,0.0013781129,0.68568784,0.0007590812,0.0012985854,0.000524079,0.0014660578,0.1828491,0.036280207],"genre_scores_gemma":[0.6360154,0.00064956513,0.32755873,0.0006787965,0.00019113687,0.0002766558,0.003647817,0.009278796,0.021702997],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99966717,0.000036007958,0.000015276739,0.000055327127,0.00012087241,0.00010545747],"domain_scores_gemma":[0.99971443,0.00004000163,0.000010562969,0.00011118094,0.00005675627,0.0000670644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031190284,0.0011923438,0.0010520307,0.0007030743,0.0011085164,0.0017946698,0.0026286342,0.00074244133,0.013537732],"category_scores_gemma":[0.0009655341,0.0005181911,0.0009766779,0.0006879282,0.00043716808,0.0014590132,0.0020531584,0.0014967624,0.0020720155],"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.005307409,0.0011404916,0.0054795775,0.00067709415,0.00065844314,0.0016879454,0.000758698,0.0889186,0.1341368,0.039818916,0.23097545,0.4904406],"study_design_scores_gemma":[0.0005761592,0.0001746164,0.000996411,0.000031332205,0.00009637341,0.00030044414,0.000082157385,0.9133089,0.04081104,0.0071451846,0.036364697,0.000112700945],"about_ca_topic_score_codex":0.011198668,"about_ca_topic_score_gemma":0.0120621575,"teacher_disagreement_score":0.013537732,"about_ca_system_score_codex":0.0007610966,"about_ca_system_score_gemma":0.0016606877,"threshold_uncertainty_score":0.045288205},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013897862,0.00019361176,0.98383415,0.0003569225,0.000022068001,0.000102839076,0.000035343484,0.0006947698,0.00086237554],"genre_scores_gemma":[0.453109,0.0005229536,0.54403657,0.0001618617,0.000055518263,0.00028213247,0.00020706838,0.0002563745,0.0013684517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9903115,0.0038270494,0.001010925,0.00062650547,0.0037500814,0.00047388268],"domain_scores_gemma":[0.9706828,0.017878914,0.0029789922,0.005195556,0.0029666978,0.0002971093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0085886475,0.001031279,0.0009367164,0.0022137412,0.00068796263,0.00415868,0.002428345,0.00227628,0.00108575],"category_scores_gemma":[0.036145408,0.0011081821,0.001417273,0.0008473029,0.0031050916,0.0051881154,0.002208496,0.0029204087,0.00034654656],"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.0003554253,0.00052073563,0.0099691395,0.00073983584,0.00022592636,0.0004907021,0.0016254472,0.34569064,0.02180855,0.3714682,0.0026901725,0.24441528],"study_design_scores_gemma":[0.00005419683,0.00009831361,0.00047019197,0.00014429461,0.00005454122,0.00023743989,0.00015040152,0.8512248,0.013652111,0.13008039,0.003777375,0.000056042627],"about_ca_topic_score_codex":0.002711186,"about_ca_topic_score_gemma":0.0033229997,"teacher_disagreement_score":0.0085886475,"about_ca_system_score_codex":0.0011009942,"about_ca_system_score_gemma":0.004549343,"threshold_uncertainty_score":0.0454216},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013073491,0.00032551493,0.9804017,0.0001270063,0.000074874995,0.0000854215,0.0000849931,0.0033026652,0.0025244507],"genre_scores_gemma":[0.4085925,0.00034008254,0.58501613,0.00012721361,0.000065421154,0.00020353391,0.0002582482,0.0006144258,0.0047824495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993113,0.00019069522,0.000040307415,0.000099578545,0.00024593988,0.00011218298],"domain_scores_gemma":[0.999295,0.0002605294,0.00005700922,0.00016735597,0.00017192587,0.000048144906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011004327,0.0009758171,0.0004974851,0.000732376,0.0007165956,0.0012188287,0.0016550157,0.0006059094,0.0034253302],"category_scores_gemma":[0.001995365,0.00049831806,0.0009093982,0.00045237943,0.0005957536,0.001451162,0.0010988854,0.0015099209,0.0007304275],"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.00062486174,0.00026669158,0.0015173365,0.00046528832,0.00016901664,0.00044823645,0.00028861657,0.5410254,0.066060685,0.15470612,0.0069377855,0.22748993],"study_design_scores_gemma":[0.000020001851,0.00008594738,0.00014588554,0.000023756456,0.000035775858,0.000053853175,0.00001929906,0.96817017,0.0073859533,0.018675776,0.0053665736,0.000017028939],"about_ca_topic_score_codex":0.0033994964,"about_ca_topic_score_gemma":0.0061247516,"teacher_disagreement_score":0.0034253302,"about_ca_system_score_codex":0.0008490409,"about_ca_system_score_gemma":0.0022507526,"threshold_uncertainty_score":0.011458874},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71562624,0.012658625,0.20377478,0.029131794,0.001730091,0.00011887113,0.0008633898,0.0019668986,0.034129385],"genre_scores_gemma":[0.9906047,0.00041923497,0.0066561433,0.00042687627,0.0005497342,0.000016009852,0.00006427447,0.00021432756,0.0010486019],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953832,0.0014104977,0.00022075597,0.0005410392,0.0015837781,0.0008607412],"domain_scores_gemma":[0.9207842,0.06315651,0.003205474,0.006517097,0.0039637377,0.0023729582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008233804,0.000815312,0.0013748654,0.0014094441,0.0012154742,0.0029183184,0.0022616242,0.0027745848,0.0059415735],"category_scores_gemma":[0.077971175,0.0006103706,0.0004207681,0.0010641488,0.0014699888,0.0063943956,0.0015565478,0.0026341695,0.0009353426],"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.007246366,0.00062969915,0.02561541,0.0009322472,0.00032467023,0.001219604,0.0008156085,0.4146395,0.07126481,0.09451406,0.01758348,0.36521462],"study_design_scores_gemma":[0.00020103808,0.0014021883,0.009437515,0.00013363801,0.00014954021,0.0011228787,0.00057272956,0.84448755,0.01740388,0.12114639,0.00382102,0.00012156605],"about_ca_topic_score_codex":0.0018560463,"about_ca_topic_score_gemma":0.002276775,"teacher_disagreement_score":0.008233804,"about_ca_system_score_codex":0.001766484,"about_ca_system_score_gemma":0.002133253,"threshold_uncertainty_score":0.043545008},"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":"software","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14422631,0.0013278214,0.27897924,0.0005520591,0.0005886516,0.0007124689,0.0013716797,0.5560058,0.016236039],"genre_scores_gemma":[0.8350136,0.00036669848,0.12081323,0.0009086987,0.00015876644,0.0002926133,0.002262084,0.0216496,0.018534604],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986303,0.00015786591,0.00008687824,0.00033784108,0.0006125331,0.00017464069],"domain_scores_gemma":[0.99742496,0.0008318189,0.000249744,0.00091458816,0.0003755206,0.00020348086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089765026,0.0016991874,0.00073626573,0.0015972734,0.0006177777,0.0013847267,0.00256989,0.00089511095,0.0065370225],"category_scores_gemma":[0.0044902815,0.0010376188,0.00070698484,0.00034504753,0.0008206321,0.0028790694,0.003055428,0.0014526437,0.0025655376],"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.007085224,0.0012036515,0.024099234,0.0013341352,0.0008593689,0.00267765,0.0018749534,0.011950816,0.2258085,0.017615533,0.14507985,0.56041104],"study_design_scores_gemma":[0.0007921312,0.0014097483,0.01290044,0.00025366564,0.0005346223,0.0029317157,0.0003518656,0.55230135,0.30730364,0.012564095,0.10818575,0.00047100947],"about_ca_topic_score_codex":0.00134341,"about_ca_topic_score_gemma":0.0026181804,"teacher_disagreement_score":0.0065370225,"about_ca_system_score_codex":0.0004913873,"about_ca_system_score_gemma":0.0012876379,"threshold_uncertainty_score":0.021868527},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47151005,0.0010394977,0.4953405,0.00024805954,0.00023083761,0.00013173536,0.00024702953,0.012520615,0.018731738],"genre_scores_gemma":[0.92214304,0.000092006274,0.06990346,0.00007525076,0.000024424126,0.00006231787,0.00016610336,0.0005946315,0.0069387355],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996666,0.00007530623,0.000023108856,0.000049372993,0.00009842778,0.000087225046],"domain_scores_gemma":[0.9992787,0.0002959223,0.00007777106,0.00016205944,0.00013604984,0.000049502698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041173957,0.0007323142,0.0004743589,0.00044893654,0.0005472729,0.00076297554,0.001483466,0.00031237927,0.0101160575],"category_scores_gemma":[0.0011581111,0.0002624489,0.0004236044,0.00035949273,0.00029617953,0.000999675,0.0006959905,0.00043866676,0.00092815835],"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.005333016,0.0006448739,0.0045577744,0.0008083626,0.00028682555,0.0007733713,0.00055136165,0.38349432,0.16002418,0.017202543,0.012075426,0.41424796],"study_design_scores_gemma":[0.0001515314,0.00059577695,0.000992386,0.000032074044,0.00008890572,0.00013756205,0.000099062105,0.930536,0.055982064,0.004295634,0.0070476853,0.000041308263],"about_ca_topic_score_codex":0.0015851272,"about_ca_topic_score_gemma":0.0041723833,"teacher_disagreement_score":0.0101160575,"about_ca_system_score_codex":0.00037810512,"about_ca_system_score_gemma":0.00083712785,"threshold_uncertainty_score":0.03384161},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8000771,0.00061589497,0.19304086,0.00047290805,0.00017144263,0.000043115535,0.000087900095,0.00075495034,0.0047358577],"genre_scores_gemma":[0.9936366,0.000024331444,0.00591054,0.000019840836,0.000004580165,0.0000075156086,0.00001975578,0.000015585703,0.00036110322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997328,0.000052727744,0.000013445285,0.00005788177,0.00006325013,0.00007986008],"domain_scores_gemma":[0.9990393,0.00046133375,0.00008032498,0.00006833,0.000252525,0.000098299715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050608977,0.00032669544,0.0003379158,0.00028491943,0.00023327836,0.0003860005,0.000669148,0.0002675017,0.0015635593],"category_scores_gemma":[0.0022358566,0.00017129414,0.00013856833,0.000254241,0.00023896739,0.000543218,0.00031714543,0.00057939545,0.000121348035],"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.00076056254,0.0003519666,0.005054661,0.00006991742,0.000029976847,0.00009872545,0.00005881251,0.8879757,0.009882228,0.0029383607,0.0019644306,0.09081463],"study_design_scores_gemma":[0.0000043107493,0.000020117104,0.00020771779,0.0000010747663,0.0000020702619,0.0000028876543,0.000005391593,0.9986791,0.0007464079,0.0002796183,0.000049989,0.0000013343155],"about_ca_topic_score_codex":0.0070504337,"about_ca_topic_score_gemma":0.010177936,"teacher_disagreement_score":0.0070504337,"about_ca_system_score_codex":0.0007925074,"about_ca_system_score_gemma":0.0013517148,"threshold_uncertainty_score":0.014018774},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23939134,0.00035295836,0.75519407,0.00059719424,0.00010568262,0.0001154958,0.00014216079,0.0018158833,0.0022852442],"genre_scores_gemma":[0.98100203,0.00003463725,0.017950585,0.000068737136,0.000015952162,0.00001821266,0.00004481359,0.00002197145,0.0008431097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99518377,0.0012746151,0.000300267,0.00094766886,0.0012211544,0.001072516],"domain_scores_gemma":[0.9867177,0.0054476154,0.00088190084,0.0048691165,0.0016395088,0.000444151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051503186,0.00063227216,0.0019026806,0.0008887106,0.0020719653,0.0022268328,0.0025848916,0.0020424877,0.0012789761],"category_scores_gemma":[0.0127081135,0.00042898965,0.00092290185,0.0011173968,0.0020060723,0.0050578597,0.0040522283,0.0015794247,0.00031389252],"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.0028274942,0.000838224,0.011033104,0.00019509804,0.00033822464,0.00087619264,0.00070039084,0.6243564,0.012306605,0.065865785,0.004453539,0.27620888],"study_design_scores_gemma":[0.000014539675,0.00011712828,0.0003293432,0.000008768675,0.000025860318,0.00016915263,0.00008356814,0.9666159,0.004542356,0.027702017,0.00037729146,0.000014013132],"about_ca_topic_score_codex":0.0015315586,"about_ca_topic_score_gemma":0.0016261,"teacher_disagreement_score":0.0051503186,"about_ca_system_score_codex":0.0010870114,"about_ca_system_score_gemma":0.0019216146,"threshold_uncertainty_score":0.027237833},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012141183,0.9457864,0.020455634,0.0052135233,0.0015361123,0.00009227201,0.00079199,0.00088150246,0.013101391],"genre_scores_gemma":[0.035831913,0.92084026,0.030553304,0.0014670403,0.0033299832,0.00007464704,0.002637241,0.00023002161,0.0050355867],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99820065,0.00024276278,0.00031432562,0.0002474925,0.00079907425,0.00019559271],"domain_scores_gemma":[0.9917225,0.0040021185,0.00055452134,0.0007178397,0.0025631478,0.00043990355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033626214,0.00064215163,0.0017039056,0.0058076894,0.00083260174,0.005506299,0.0018343778,0.000995423,0.006677991],"category_scores_gemma":[0.010701927,0.00057992694,0.0005525176,0.014658151,0.00080786884,0.012098716,0.0018098906,0.0015318175,0.0026375805],"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.00026151256,0.00012544314,0.0028182254,0.0047316654,0.00004816798,0.00006664104,0.0001747057,0.0008134963,0.0025983169,0.016176501,0.032231867,0.93995345],"study_design_scores_gemma":[0.000045065746,0.000401754,0.0025670468,0.0026134432,0.00017806061,0.0010657889,0.0005306484,0.0059877615,0.0051946053,0.01821151,0.9631207,0.00008355886],"about_ca_topic_score_codex":0.0015901006,"about_ca_topic_score_gemma":0.0018997255,"teacher_disagreement_score":0.006677991,"about_ca_system_score_codex":0.00096968777,"about_ca_system_score_gemma":0.0038580876,"threshold_uncertainty_score":0.02234006},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08226011,0.00047350876,0.89387345,0.00020076659,0.000048860496,0.00011883801,0.00015521809,0.0046049003,0.018264357],"genre_scores_gemma":[0.646187,0.0002161333,0.34721977,0.0001415362,0.000018243752,0.0001226294,0.00021912756,0.00050995743,0.005365588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998111,0.000055245353,0.000006204093,0.000023345596,0.000068944166,0.000035267614],"domain_scores_gemma":[0.9994666,0.00030779332,0.000040530245,0.000072355026,0.00008767099,0.000025097828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004096817,0.0007566065,0.0005163675,0.00059301005,0.00037623223,0.00087047945,0.0009052292,0.0005781945,0.01068203],"category_scores_gemma":[0.0013186164,0.00041747713,0.0004933077,0.0004168341,0.00033947278,0.000835808,0.0009827628,0.0007591951,0.0008509147],"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.0006525401,0.00020337489,0.0017049414,0.00039008207,0.00009442435,0.00026431214,0.0002734698,0.5941248,0.050949242,0.020580407,0.0043700435,0.32639238],"study_design_scores_gemma":[0.000047472076,0.00016311191,0.00020095106,0.000015484278,0.000014665673,0.00004918022,0.000054950484,0.9848873,0.0060446803,0.0062081707,0.0023043745,0.000009709868],"about_ca_topic_score_codex":0.0013286796,"about_ca_topic_score_gemma":0.0029088268,"teacher_disagreement_score":0.01068203,"about_ca_system_score_codex":0.0003196162,"about_ca_system_score_gemma":0.0010763581,"threshold_uncertainty_score":0.035734892},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07221324,0.0010985282,0.9087526,0.0002560233,0.00026204748,0.000095435455,0.00032513615,0.003263558,0.013733497],"genre_scores_gemma":[0.8285684,0.00025882229,0.16678306,0.0001962438,0.000037699367,0.000051382838,0.00026932952,0.00005322357,0.0037817983],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999845,0.000018472036,0.000013083354,0.000060095164,0.000038772756,0.000024494027],"domain_scores_gemma":[0.99983096,0.000044382454,0.000014496217,0.00004793184,0.000052027885,0.0000100455945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027382685,0.00037254713,0.00028088607,0.00036836148,0.00038863087,0.0006723778,0.001215385,0.0003632239,0.004071313],"category_scores_gemma":[0.0005199666,0.00018243669,0.00028942866,0.00038792464,0.00026319866,0.00086705026,0.000527957,0.00057311193,0.00046081757],"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.0005015244,0.00019153484,0.0021126096,0.0003995006,0.00014113118,0.00041805222,0.00023492597,0.102541134,0.11318644,0.0499096,0.008094221,0.72226936],"study_design_scores_gemma":[0.000035218618,0.00018453255,0.00077716593,0.000053697782,0.00010912109,0.00021065376,0.00004836528,0.9204205,0.051018935,0.018512057,0.008601413,0.000028403781],"about_ca_topic_score_codex":0.0043149483,"about_ca_topic_score_gemma":0.014411246,"teacher_disagreement_score":0.0043149483,"about_ca_system_score_codex":0.00045380063,"about_ca_system_score_gemma":0.00084420753,"threshold_uncertainty_score":0.013619959},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14864664,0.0004600851,0.8262313,0.00025120226,0.00022065423,0.00013593204,0.00018564495,0.017693026,0.0061755576],"genre_scores_gemma":[0.48221678,0.00009135048,0.5119014,0.00016456077,0.000027179405,0.00011684394,0.00032795363,0.0006206171,0.0045333435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977785,0.00005736697,0.000009120819,0.000039261107,0.00006722253,0.00004913774],"domain_scores_gemma":[0.9996369,0.00013998496,0.00003223288,0.0000714524,0.00009439176,0.000025116859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040640065,0.000688198,0.00062047195,0.00056115264,0.00052212103,0.0004910483,0.001468875,0.0006624666,0.0037260638],"category_scores_gemma":[0.0010808778,0.0002760984,0.00046677777,0.00044628902,0.00038127846,0.0005913041,0.00070554373,0.0007931843,0.0006575653],"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.00062792364,0.0003591674,0.0016868527,0.00015435509,0.00012865182,0.00021196326,0.00016651813,0.44735578,0.027301071,0.011053526,0.010511324,0.50044286],"study_design_scores_gemma":[0.000040681247,0.00010061304,0.0001394611,0.0000050650965,0.000011678026,0.000026833766,0.000019386322,0.99015146,0.006403481,0.001991076,0.0011013864,0.000008830382],"about_ca_topic_score_codex":0.005360087,"about_ca_topic_score_gemma":0.009794364,"teacher_disagreement_score":0.005360087,"about_ca_system_score_codex":0.00048430474,"about_ca_system_score_gemma":0.0013841524,"threshold_uncertainty_score":0.012464941},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014764634,0.0002795191,0.9762622,0.00023822479,0.00010413446,0.00007651537,0.00027644893,0.0069675054,0.0010309401],"genre_scores_gemma":[0.31668255,0.00012044117,0.6772188,0.00042575062,0.00007110001,0.00015903935,0.0010366555,0.00039946433,0.00388622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815875,0.00047853802,0.00015185971,0.00042334342,0.0005804458,0.00020711834],"domain_scores_gemma":[0.9979678,0.00050684117,0.00008975795,0.00093720213,0.0003934692,0.000105003855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002360524,0.0008739,0.0019260846,0.0009997821,0.0010014991,0.0023681982,0.0036688817,0.0018597895,0.0047929008],"category_scores_gemma":[0.0067991097,0.0005210104,0.0008759029,0.0014261615,0.0010520268,0.0043907375,0.0047038654,0.0021705034,0.0015236724],"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.0013328064,0.00064545585,0.0020826738,0.00018457964,0.00022919773,0.00017274522,0.00019219785,0.21088518,0.01404848,0.04567742,0.022627687,0.7019216],"study_design_scores_gemma":[0.000055505498,0.000059235594,0.00012104429,0.000010381126,0.000011623661,0.00004161577,0.000027307673,0.9641774,0.0051355036,0.028529242,0.0018160647,0.000015008588],"about_ca_topic_score_codex":0.0061626015,"about_ca_topic_score_gemma":0.008697893,"teacher_disagreement_score":0.0061626015,"about_ca_system_score_codex":0.0013058728,"about_ca_system_score_gemma":0.002361726,"threshold_uncertainty_score":0.016033828},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022279182,0.0009499704,0.9691188,0.0012784646,0.00022721972,0.0000395034,0.00008665461,0.000555292,0.0054649385],"genre_scores_gemma":[0.8716454,0.0015689315,0.11800307,0.0007291698,0.00028766665,0.0000839092,0.00015947134,0.00024498336,0.007277443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982743,0.0005085501,0.00006588386,0.0002379276,0.00069880276,0.00021448403],"domain_scores_gemma":[0.9945779,0.003503427,0.0002744088,0.001194848,0.00030834845,0.00014108836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027837893,0.0011231487,0.0014173595,0.00064055534,0.000499303,0.0011997124,0.001987188,0.0022551666,0.0028111315],"category_scores_gemma":[0.0112711,0.00065036723,0.00096247613,0.0006924054,0.0024464733,0.0039847842,0.0064015095,0.0035604497,0.0006478766],"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.0003117806,0.000039050574,0.0005257799,0.00012133439,0.00008986554,0.00015137724,0.00009618206,0.8002205,0.008275416,0.12913714,0.0036513142,0.057380296],"study_design_scores_gemma":[0.000014294284,0.000045713103,0.00009643808,0.00001648793,0.000014523526,0.000088084984,0.000018272907,0.93440264,0.002409688,0.0606396,0.0022420494,0.000012192943],"about_ca_topic_score_codex":0.0008289088,"about_ca_topic_score_gemma":0.0006727624,"teacher_disagreement_score":0.0028111315,"about_ca_system_score_codex":0.00086022826,"about_ca_system_score_gemma":0.00066673313,"threshold_uncertainty_score":0.014722288},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025381878,0.68839407,0.2437717,0.0064484985,0.0010180539,0.0002988257,0.00038756352,0.00207052,0.032228865],"genre_scores_gemma":[0.14430161,0.59326106,0.25022787,0.0013621936,0.0019138675,0.00030038808,0.00084412104,0.00028851806,0.007500455],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986425,0.00021529796,0.0001454491,0.00024363206,0.0006129456,0.00014008717],"domain_scores_gemma":[0.99806315,0.00089247886,0.0001571273,0.0002905749,0.0005026017,0.00009402223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012951333,0.001012062,0.00096658384,0.003362115,0.0005276544,0.003762841,0.0021047846,0.0011497977,0.0021713017],"category_scores_gemma":[0.0027615186,0.0008465088,0.0007811167,0.0057731234,0.00092547707,0.004646938,0.0010149514,0.0021808208,0.0011977359],"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.00013679353,0.00019519716,0.002777219,0.004302528,0.000086456705,0.0001987889,0.00049303967,0.016749837,0.010360033,0.13685021,0.012068402,0.8157815],"study_design_scores_gemma":[0.000072888244,0.0011549772,0.004645647,0.0038726297,0.00018595262,0.00279784,0.0011238301,0.13857593,0.013858343,0.13660708,0.696891,0.00021389547],"about_ca_topic_score_codex":0.0017408743,"about_ca_topic_score_gemma":0.001438047,"teacher_disagreement_score":0.003762841,"about_ca_system_score_codex":0.0011232975,"about_ca_system_score_gemma":0.0014095039,"threshold_uncertainty_score":0.008150101},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04919321,0.000482393,0.91266966,0.0006232534,0.00023979,0.00053074566,0.00066776626,0.028229477,0.00736364],"genre_scores_gemma":[0.7462037,0.000356123,0.23386,0.0003007916,0.00009312195,0.00031283166,0.0011523864,0.00081588887,0.016905067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716043,0.0006832079,0.00019099546,0.0004078992,0.0011120674,0.00044541084],"domain_scores_gemma":[0.99463487,0.00078924367,0.00031316662,0.0033840179,0.0006070786,0.00027165734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028969035,0.0006983997,0.00089490286,0.0010425369,0.0015803771,0.0030593767,0.0022801147,0.0013010696,0.0080046635],"category_scores_gemma":[0.0046798787,0.0008394772,0.0005109259,0.001230809,0.001495446,0.005736803,0.005024036,0.0025439202,0.0020891023],"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.003867518,0.0010266914,0.00728059,0.0004829688,0.00027590446,0.0005289357,0.00073731545,0.096278384,0.05619332,0.15361264,0.04247675,0.63723904],"study_design_scores_gemma":[0.00023922375,0.00037599594,0.0013153619,0.00007959154,0.000086442116,0.00037957498,0.00015557639,0.80201805,0.07916245,0.0856524,0.030408973,0.00012640757],"about_ca_topic_score_codex":0.0026764977,"about_ca_topic_score_gemma":0.0034363968,"teacher_disagreement_score":0.0080046635,"about_ca_system_score_codex":0.0011676869,"about_ca_system_score_gemma":0.0044713737,"threshold_uncertainty_score":0.02677828},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04001666,0.000204543,0.95378244,0.000119118784,0.000078975536,0.00004391272,0.00004441383,0.0008633678,0.0048465454],"genre_scores_gemma":[0.7549873,0.00016195881,0.24169655,0.00009268168,0.00005193842,0.00007413474,0.00008359799,0.00026575825,0.002586148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929357,0.00015316982,0.000041256248,0.00011865272,0.00026085772,0.00013252065],"domain_scores_gemma":[0.99894935,0.00033366712,0.00008129063,0.0003349079,0.00020594664,0.00009486713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000793759,0.0005500973,0.0006612489,0.00060945767,0.00071305904,0.0014245551,0.0013947908,0.0004458842,0.0032043653],"category_scores_gemma":[0.00237066,0.0004671877,0.00070774957,0.00051899214,0.0008469797,0.0016557864,0.0012755971,0.0011828402,0.0005613137],"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.00076801114,0.00031857126,0.0012754826,0.0003139264,0.00010737173,0.00022068637,0.00045323462,0.57193,0.09499449,0.19020858,0.0019995668,0.13740996],"study_design_scores_gemma":[0.00004003567,0.00009612112,0.0001931028,0.00001834423,0.000048567363,0.000060013946,0.000056126977,0.9300454,0.014307896,0.051713835,0.0033989367,0.000021556982],"about_ca_topic_score_codex":0.0013405847,"about_ca_topic_score_gemma":0.0029589648,"teacher_disagreement_score":0.0032043653,"about_ca_system_score_codex":0.00077780423,"about_ca_system_score_gemma":0.0012260157,"threshold_uncertainty_score":0.010719717},"labels":[],"label_agreement":null}]}