{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":13,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":13,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"2c1bc47393e7","filters":{"venue":"Digital Investigation"}},"results":[{"id":"W2125962012","doi":"10.1016/j.diin.2010.03.003","title":"Mining writeprints from anonymous e-mails for forensic investigation","year":2010,"lang":"en","type":"article","venue":"Digital Investigation","topic":"Authorship Attribution and Profiling","field":"Computer Science","cited_by":146,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Exploit; Cluster analysis; Stylometry; Anonymity; Identification (biology); Classifier (UML); Cybercrime; Focus (optics); Writing style; Information retrieval; World Wide Web; Data science; Data mining; Artificial intelligence; Computer security; The Internet","retraction":null,"screen_n_in":null,"score":{"opus":0.04413737110212299,"gpt":0.2634196282676218,"spread":0.2192822571654988,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003341767,0.0001614536,0.0001402622,0.0001026572,0.0001876683,0.0006696037,0.0004055627,0.0001531518,0.00001189089],"category_scores_gemma":[0.0007522777,0.000168913,0.0000697007,0.0003239246,0.0001402299,0.002037882,0.0001057196,0.0001846063,0.0001303682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002984679,"about_ca_system_score_gemma":0.0001217407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001931326,"about_ca_topic_score_gemma":0.00001778493,"domain_scores_codex":[0.9986975,0.00002920694,0.0003275427,0.0004459692,0.0002385128,0.0002612886],"domain_scores_gemma":[0.9987534,0.0002491746,0.0001839559,0.000396068,0.0001908895,0.0002264662],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000285302,0.00005564861,0.1132916,0.0000602072,0.0000579792,0.000006662077,0.005682026,0.00009695774,0.1805705,0.5242626,0.006318494,0.1695687],"study_design_scores_gemma":[0.0008776979,0.00008836336,0.0259203,0.0000635148,0.00001404073,0.000009856008,0.000117442,0.1159823,0.3197247,0.5314464,0.005185666,0.0005697375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7538234,0.00001039264,0.2428554,0.001226217,0.0008300653,0.0002652686,0.00003638771,0.0002606181,0.0006922781],"genre_scores_gemma":[0.9068083,3.703437e-7,0.09158251,0.0006663078,0.0002057282,0.00004538142,0.00043433,0.00001346206,0.0002436071],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.168999,"threshold_uncertainty_score":0.6888072,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123407642","doi":"10.1016/j.diin.2008.05.001","title":"A novel approach of mining write-prints for authorship attribution in e-mail forensics","year":2008,"lang":"en","type":"article","venue":"Digital Investigation","topic":"Authorship Attribution and Profiling","field":"Computer Science","cited_by":131,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Authorship attribution; Suspect; Computer science; Attribution; Decision tree; Support vector machine; Quality (philosophy); Information retrieval; Data mining; Data science; Computer security; Artificial intelligence; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.1382981898189501,"gpt":0.2774152743910965,"spread":0.1391170845721464,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005880459,0.0001257471,0.0001803054,0.0001582565,0.00009686949,0.00007408536,0.0002830893,0.0001295457,7.224609e-7],"category_scores_gemma":[0.0005785129,0.0001338602,0.00007016669,0.0006446182,0.0001327723,0.001096047,0.00008485364,0.0001150394,0.00000662319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000777742,"about_ca_system_score_gemma":0.0001436396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009026015,"about_ca_topic_score_gemma":0.000001829795,"domain_scores_codex":[0.9987491,0.00003488433,0.000414119,0.000314331,0.0002379934,0.0002495415],"domain_scores_gemma":[0.9991412,0.0001406906,0.000196482,0.0002310603,0.0001834964,0.0001070769],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005850515,0.0002287331,0.1257036,0.0002279938,0.00002654836,0.000004039815,0.01060731,0.001692689,0.009140586,0.8330095,0.0005534271,0.01874704],"study_design_scores_gemma":[0.002330024,0.0002683406,0.1286588,0.0002232274,0.00001214232,0.00009550866,0.0003589574,0.6942624,0.0834083,0.08865802,0.0009366552,0.0007875805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3699315,0.00001494146,0.6291485,0.0001587332,0.000096752,0.000205598,0.00002208031,0.00005546317,0.0003665125],"genre_scores_gemma":[0.8657624,9.330669e-7,0.1337858,0.00007093789,0.00003114073,0.00003234204,0.0001841592,0.000007344503,0.0001249667],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7443514,"threshold_uncertainty_score":0.545866,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2085509246","doi":"10.1016/j.diin.2009.01.004","title":"Towards an integrated e-mail forensic analysis framework","year":2009,"lang":"en","type":"article","venue":"Digital Investigation","topic":"Authorship Attribution and Profiling","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Phishing; Spamming; Law enforcement; Harassment; Computer security; Context (archaeology); Child pornography; Cybercrime; Digital forensics; The Internet; Internet privacy; World Wide Web; Data science","retraction":null,"screen_n_in":null,"score":{"opus":0.03798295588258519,"gpt":0.2880873846024712,"spread":0.250104428719886,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002311663,0.0001255887,0.0001494762,0.000206129,0.0001018549,0.000688683,0.0003761431,0.0001111314,0.00001422563],"category_scores_gemma":[0.0002872856,0.0001145014,0.00009015462,0.002139533,0.00005512112,0.002042421,0.00003375033,0.000168618,0.00008157668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005004487,"about_ca_system_score_gemma":0.00007761065,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001135336,"about_ca_topic_score_gemma":0.000002633054,"domain_scores_codex":[0.9989496,0.00005360303,0.000229686,0.0003187199,0.0002504198,0.0001979876],"domain_scores_gemma":[0.9991353,0.00003196781,0.00009501688,0.0003859373,0.0001505129,0.0002013287],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005758928,0.00004469769,0.006586044,0.000002972199,0.00006274341,0.000006022293,0.00128625,0.0007015635,0.0002011506,0.7246276,0.000350485,0.2661248],"study_design_scores_gemma":[0.0001119591,0.0001966119,0.04583871,0.00002657517,0.00004863188,0.00000406819,0.00009120795,0.2462537,0.008506199,0.6971607,0.001412983,0.0003486867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1341965,0.00002011327,0.8617458,0.0017729,0.0001305507,0.00006923142,0.000008893135,0.0003340959,0.001721968],"genre_scores_gemma":[0.9376775,9.21371e-7,0.06059181,0.001291037,0.00004440931,0.000002651659,0.0002595776,0.00000350133,0.0001285751],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.803481,"threshold_uncertainty_score":0.6640986,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2465152470","doi":"10.1016/j.diin.2016.07.001","title":"Detecting predatory conversations in social media by deep Convolutional Neural Networks","year":2016,"lang":"en","type":"article","venue":"Digital Investigation","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Convolutional neural network; Artificial intelligence; Support vector machine; Classifier (UML); Deep learning; Identification (biology); Machine learning; Domain (mathematical analysis)","retraction":null,"screen_n_in":null,"score":{"opus":0.01804575148769443,"gpt":0.2084786305199205,"spread":0.1904328790322261,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001785102,0.0001116951,0.00009766962,0.0001021525,0.0001857307,0.0001975131,0.0002391968,0.0001150115,0.00002166818],"category_scores_gemma":[0.0002309594,0.0000993684,0.00004167815,0.0004127873,0.0001593137,0.00247053,0.00009559187,0.0001367934,0.00003670363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001259737,"about_ca_system_score_gemma":0.00003665746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006836343,"about_ca_topic_score_gemma":0.00003251887,"domain_scores_codex":[0.9989011,0.00006936536,0.0002722423,0.0002871385,0.0002342123,0.0002358922],"domain_scores_gemma":[0.9993275,0.0002563579,0.0001208516,0.0001277485,0.00007585301,0.00009165375],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000068073,0.0001938756,0.03750525,0.00003163061,0.00005385636,0.00001449015,0.006671504,0.002977619,0.01038404,0.1688975,0.02477728,0.7484248],"study_design_scores_gemma":[0.0009259149,0.00005895448,0.01645142,0.00004127896,0.000003829816,0.00001295416,0.0000785946,0.9314091,0.002353148,0.04590544,0.00237221,0.0003871169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5697053,0.0001093173,0.426522,0.00152996,0.001041237,0.000178237,0.00001944878,0.0002767671,0.0006176833],"genre_scores_gemma":[0.9991639,0.000004368042,0.0002344427,0.0002376173,0.0002558735,0.00001880366,0.00003158357,0.000007213383,0.00004616215],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9284315,"threshold_uncertainty_score":0.4052126,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2129364433","doi":"10.1016/j.diin.2014.03.012","title":"OBA2: An Onion approach to Binary code Authorship Attribution","year":2014,"lang":"en","type":"article","venue":"Digital Investigation","topic":"Authorship Attribution and Profiling","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Authorship attribution; Code (set theory); Binary number; Attribution; Information retrieval; World Wide Web; Programming language; Natural language processing; Arithmetic; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.07222085393703048,"gpt":0.2798793971174146,"spread":0.2076585431803841,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009937354,0.0001779352,0.0001489577,0.0001602676,0.0002304155,0.000677212,0.0005473612,0.0001491552,0.000002743032],"category_scores_gemma":[0.0005108945,0.0001798672,0.00005104386,0.0007670402,0.00006560437,0.002513693,0.0001542032,0.0001862003,0.000384707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001041006,"about_ca_system_score_gemma":0.00008344285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008290155,"about_ca_topic_score_gemma":9.614563e-7,"domain_scores_codex":[0.9982418,0.0002218187,0.0002969232,0.0005435988,0.0003620927,0.0003337482],"domain_scores_gemma":[0.9985574,0.00005382679,0.0001131771,0.0005182567,0.0001495875,0.0006077177],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001204352,0.00009800873,0.004844332,0.00002440474,0.000006133404,8.050258e-7,0.001313953,0.001360012,0.003482696,0.9604365,0.001413136,0.02700797],"study_design_scores_gemma":[0.0005158249,0.0006384119,0.04800925,0.00008075844,0.00001118833,0.0000296922,0.00009013802,0.7429405,0.02823541,0.1463987,0.03209421,0.0009558902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2290798,0.000009047469,0.7648439,0.001625399,0.0002953795,0.0002117937,0.00001545037,0.0004465427,0.00347268],"genre_scores_gemma":[0.9715136,4.012456e-7,0.02625104,0.001151063,0.0001409001,0.00002817931,0.0005148539,0.00001288448,0.0003871366],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8140377,"threshold_uncertainty_score":0.7334773,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1779974843","doi":"10.1016/j.diin.2015.05.015","title":"BinComp: A stratified approach to compiler provenance Attribution","year":2015,"lang":"en","type":"article","venue":"Digital Investigation","topic":"Software Engineering Research","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Compiler; Computer science; Compiler correctness; Compiler construction; Optimizing compiler; Interprocedural optimization; Programming language; Loop optimization; Semantics (computer science)","retraction":null,"screen_n_in":null,"score":{"opus":0.07929534497281193,"gpt":0.2663574744014908,"spread":0.1870621294286789,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002514544,0.0001094794,0.00009904249,0.0001124099,0.00004005516,0.0005523876,0.0004639182,0.00004724035,3.986691e-7],"category_scores_gemma":[0.0005825272,0.0001074733,0.00002282981,0.0007620134,0.00004466505,0.001351172,0.0001567278,0.0001089653,0.000280825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000134322,"about_ca_system_score_gemma":0.0001556756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009293118,"about_ca_topic_score_gemma":2.561781e-7,"domain_scores_codex":[0.9987887,0.00002329236,0.0001692327,0.0003288747,0.0004498122,0.0002400741],"domain_scores_gemma":[0.9989844,0.00006297757,0.00003766168,0.0003755369,0.0002059103,0.0003335084],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003922245,0.0005447682,0.0742832,0.0001702311,0.00005930257,0.00001875398,0.00607966,0.04932915,0.005385425,0.7060018,0.08861727,0.0694712],"study_design_scores_gemma":[0.001782705,0.0008218642,0.2129774,0.0001767881,0.00000655286,0.00006826976,0.0001474578,0.6576114,0.02746834,0.07182689,0.02563133,0.001480977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2373178,0.00001877665,0.7582509,0.0004758235,0.0002015931,0.0003393233,0.000008510741,0.0004264109,0.002960875],"genre_scores_gemma":[0.9646153,1.244456e-7,0.03474785,0.0001238961,0.00004602082,0.00005939261,0.00006712442,0.000009309117,0.0003310208],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7272974,"threshold_uncertainty_score":0.5326686,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1982623151","doi":"10.1016/j.diin.2009.06.003","title":"Extraction of forensically sensitive information from windows physical memory","year":2009,"lang":"en","type":"article","venue":"Digital Investigation","topic":"Digital and Cyber Forensics","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; String searching algorithm; Focus (optics); String (physics); Matching (statistics); Protocol (science); Data mining; Pattern matching; Information retrieval; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.008646516644480599,"gpt":0.2095923998710739,"spread":0.2009458832265933,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004519497,0.0001205467,0.0001426288,0.00006942363,0.0000359456,0.0003422678,0.0001731806,0.00005012055,6.873466e-7],"category_scores_gemma":[0.00009641072,0.0001122417,0.00007379198,0.0002715561,0.0001105733,0.009061589,0.00004359775,0.00008364666,0.0001073632],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002960957,"about_ca_system_score_gemma":0.00005042417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001580385,"about_ca_topic_score_gemma":7.365643e-7,"domain_scores_codex":[0.9991057,0.00001310784,0.0002594735,0.0001625394,0.000326268,0.0001329125],"domain_scores_gemma":[0.9992175,0.00006022693,0.0001869487,0.0002295705,0.0002118048,0.00009401844],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002076846,0.0001102494,0.0001485237,0.000006885626,0.00002068846,0.000004574688,0.002785172,0.0002613194,0.008315785,0.1847371,0.001370657,0.8022183],"study_design_scores_gemma":[0.0004820503,0.0003545578,0.04047807,0.00006196179,0.00001321314,0.00001441415,0.0001738406,0.06384913,0.1791981,0.7142823,0.0007466025,0.0003458064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8624646,0.000003561852,0.1001731,0.0006020105,0.0001924112,0.0001449132,0.00003896959,0.0001577489,0.03622266],"genre_scores_gemma":[0.9960901,4.462682e-7,0.003038055,0.0005326332,0.00007843127,0.000001928683,0.0002064864,0.000002987195,0.00004895946],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8018725,"threshold_uncertainty_score":0.6569433,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2297444916","doi":"10.1016/j.diin.2016.01.010","title":"Tiered forensic methodology model for Digital Field Triage by non-digital evidence specialists","year":2016,"lang":"en","type":"article","venue":"Digital Investigation","topic":"Digital and Cyber Forensics","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Canadian Mounted Police","funders":"","keywords":"Triage; Digital forensics; Process (computing); Premise; Field (mathematics); Computer forensics","retraction":null,"screen_n_in":null,"score":{"opus":0.1057336178204691,"gpt":0.2896694294360085,"spread":0.1839358116155393,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002197018,0.0003271653,0.0003486563,0.0001068288,0.0001040041,0.00201903,0.0008365004,0.0001693783,0.000004129411],"category_scores_gemma":[0.002162212,0.0002486769,0.0002169504,0.0002983699,0.0002988866,0.0098797,0.000309835,0.00008913806,0.0001628215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008996832,"about_ca_system_score_gemma":0.000170597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000383875,"about_ca_topic_score_gemma":0.000002786665,"domain_scores_codex":[0.9977841,0.00001993666,0.0005441037,0.0007323112,0.0003967418,0.0005228497],"domain_scores_gemma":[0.9974805,0.001136851,0.0002403462,0.0006035803,0.0002382408,0.0003004451],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001217105,0.0000986481,0.001190249,0.00004759977,0.00006220147,0.00000869654,0.0005463709,0.00003698677,0.002442284,0.09285185,0.1518792,0.7507142],"study_design_scores_gemma":[0.001420069,0.0007139283,0.0001651959,0.0002890649,0.00001837842,0.0000345091,0.00003241135,0.05671555,0.03194677,0.8990506,0.008659861,0.0009536637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05307094,0.00005230211,0.9331951,0.002821242,0.0005477654,0.0004840895,0.0004457763,0.0002405875,0.009142212],"genre_scores_gemma":[0.9752172,0.000005947151,0.01144633,0.0008721065,0.0002053433,0.00006742564,0.0001605176,0.00003336814,0.01199181],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9221462,"threshold_uncertainty_score":0.9999965,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2884079571","doi":"10.1016/j.diin.2018.04.012","title":"Automated forensic analysis of mobile applications on Android devices","year":2018,"lang":"en","type":"article","venue":"Digital Investigation","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Android (operating system); Taint checking; Digital forensics; Static analysis; Scalability; Mobile device; Bytecode; Parsing; SQL injection; Database; Java; Operating system; World Wide Web; Programming language; Search engine","retraction":null,"screen_n_in":null,"score":{"opus":0.01451430542398359,"gpt":0.2762935327133167,"spread":0.2617792272893331,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006329959,0.00008219101,0.0001298292,0.0003629664,0.00006534978,0.00009565779,0.0002546988,0.00004050017,0.000003212216],"category_scores_gemma":[0.00003754996,0.00008022281,0.00005425603,0.001964228,0.0001592389,0.0008415218,0.0000557264,0.00003619062,0.00003703928],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003248351,"about_ca_system_score_gemma":0.00002319335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006248515,"about_ca_topic_score_gemma":0.000008015269,"domain_scores_codex":[0.999258,0.00001228596,0.0002213032,0.0002454115,0.0001673697,0.00009561078],"domain_scores_gemma":[0.9990953,0.00005027941,0.0001784173,0.0004004143,0.0002217243,0.00005384103],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003350794,0.0004600124,0.02150445,0.0001180118,0.001035741,0.000003780662,0.002461189,0.007390644,0.05503806,0.2856085,0.006066396,0.6202797],"study_design_scores_gemma":[0.0001204624,0.0005497327,0.01250373,0.00002579719,0.00007201906,0.00000274134,0.00003592321,0.3479387,0.5974036,0.03636255,0.004714708,0.000270047],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1896409,0.00001106812,0.8058625,0.00004480061,0.00004304644,0.0002959839,0.00002041424,0.001480772,0.002600472],"genre_scores_gemma":[0.9776198,8.66479e-7,0.02199327,0.0001465483,0.00002025407,0.0001159667,0.00004676095,0.000005337483,0.0000511822],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7879789,"threshold_uncertainty_score":0.3271391,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2516577067","doi":"10.1016/j.diin.2016.04.002","title":"BinGold: Towards robust binary analysis by extracting the semantics of binary code as semantic flow graphs (SFGs)","year":2016,"lang":"en","type":"article","venue":"Digital Investigation","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Code refactoring; Control flow graph; Data-flow analysis; Obfuscation; Theoretical computer science; Binary code; Compiler; Static program analysis; Programming language; Binary number; Malware; Semantics (computer science); Data flow diagram; Software; Database; Software development","retraction":null,"screen_n_in":null,"score":{"opus":0.02176898801439601,"gpt":0.2510651739241297,"spread":0.2292961859097337,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003088063,0.0002060027,0.000240544,0.0003420919,0.0001539585,0.0001920619,0.0006399225,0.00009650526,0.00001099081],"category_scores_gemma":[0.0004126677,0.0001392341,0.0001671754,0.002101963,0.0002718418,0.002302472,0.0002799424,0.0001269676,0.00002921126],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008069247,"about_ca_system_score_gemma":0.00007804343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004409445,"about_ca_topic_score_gemma":0.000005631949,"domain_scores_codex":[0.9983455,0.00007173862,0.0004472063,0.0004448903,0.0004393093,0.0002513857],"domain_scores_gemma":[0.9983989,0.0002203851,0.0004041751,0.0006909742,0.0001805521,0.0001050378],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005122505,0.0003982731,0.0258131,0.0001780619,0.0008598615,0.00006830918,0.002593334,0.01710659,0.6231569,0.01937174,0.01552047,0.2948821],"study_design_scores_gemma":[0.0004929418,0.0005968419,0.008608936,0.0002866241,0.0002537322,0.00006300167,0.000172128,0.2620619,0.6457543,0.07741416,0.003341633,0.000953842],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3427984,0.0000534015,0.6541989,0.001747244,0.0001208074,0.0001968962,0.00003216093,0.0004452703,0.0004069669],"genre_scores_gemma":[0.978165,0.00002808894,0.02098342,0.0001801697,0.00001870324,0.00002486217,0.00002196635,0.00001918498,0.0005585528],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6353667,"threshold_uncertainty_score":0.5677803,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118558829","doi":"10.1016/j.diin.2007.06.010","title":"Forensic memory analysis: From stack and code to execution history","year":2007,"lang":"en","type":"article","venue":"Digital Investigation","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Thread (computing); Call stack; Stack (abstract data type); Process (computing); Virtual memory; Operating system; Programming language; Parallel computing; Memory management; Overlay","retraction":null,"screen_n_in":null,"score":{"opus":0.03766217992191722,"gpt":0.2444065722086764,"spread":0.2067443922867592,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002747781,0.00008633764,0.0001030172,0.0002159909,0.00006663508,0.0001861515,0.000205846,0.00004838851,0.000004461532],"category_scores_gemma":[0.0001000733,0.00009663217,0.00003680096,0.0005285994,0.00006786324,0.0008779756,0.00008522354,0.00006406163,0.00004149069],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001549613,"about_ca_system_score_gemma":0.0000412131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006171383,"about_ca_topic_score_gemma":0.00004553064,"domain_scores_codex":[0.999074,0.00001779696,0.0002313906,0.000328233,0.0001995573,0.0001489644],"domain_scores_gemma":[0.9992698,0.00009997315,0.00009716879,0.0002858457,0.00008635133,0.0001608017],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00006513961,0.000202042,0.07852052,0.00006435303,0.0006309311,0.00003477987,0.05574708,0.003689198,0.0160071,0.3889525,0.0352506,0.4208357],"study_design_scores_gemma":[0.0007353522,0.0001927247,0.4298293,0.00009488832,0.0001663305,0.0000129011,0.001017477,0.4047064,0.03363398,0.0867823,0.04167089,0.001157415],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5131248,0.0001091867,0.4849351,0.0002524005,0.0002096822,0.0000647865,0.000006230458,0.0001070399,0.001190804],"genre_scores_gemma":[0.9811925,0.000001047016,0.01755788,0.0009668421,0.00007426245,0.000002851047,0.00006506113,0.000004204227,0.0001353905],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4680677,"threshold_uncertainty_score":0.3940546,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1419517020","doi":"10.1016/j.diin.2015.05.002","title":"Graph-theoretic characterization of cyber-threat infrastructures","year":2015,"lang":"en","type":"article","venue":"Digital Investigation","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computer security; Malware; PageRank; Cyber threats; Centrality; Key (lock); Critical infrastructure; Data science; Malware analysis; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.01633270437152233,"gpt":0.2333326084999213,"spread":0.216999904128399,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006271804,0.00009959543,0.0001339549,0.00009034148,0.00002322173,0.00007201167,0.00009327421,0.00002487023,0.00005836967],"category_scores_gemma":[0.00001236335,0.00009456428,0.00005915722,0.0002822104,0.0001455795,0.0004117293,0.00003448294,0.0000485696,0.00001282643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001357688,"about_ca_system_score_gemma":0.00003252226,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003335884,"about_ca_topic_score_gemma":4.513405e-7,"domain_scores_codex":[0.9993847,0.00002059734,0.0002225629,0.0001282703,0.000149197,0.00009465405],"domain_scores_gemma":[0.9994457,0.00001310237,0.0001654114,0.0001643264,0.0001279067,0.00008357618],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001600575,0.00005821914,0.5713784,0.00001528632,0.00008915612,3.561155e-7,0.0008091496,0.0001467497,0.03407928,0.3654426,0.001441641,0.02652317],"study_design_scores_gemma":[0.0001749442,0.00004766294,0.0383673,0.00002853979,0.00002697825,4.776831e-7,0.00007060519,0.00126952,0.07577839,0.8836417,0.0004315678,0.0001623254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9725102,0.000005413593,0.01736879,0.00003573148,0.0000398473,0.0001022527,0.00003974112,0.00005718815,0.009840853],"genre_scores_gemma":[0.9980557,3.494536e-7,0.0004512242,0.00001894574,0.0001062096,0.00001049812,0.001241503,0.0000109359,0.0001046327],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5330111,"threshold_uncertainty_score":0.3856219,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W285492148","doi":"","title":"Steve Anson and Steve Bunting, Mastering Windows network forensics and investigations , Sybex (an imprint of Wiley Publishing Inc.), US and Canada (2007) ISBN 978-0-4700-9762-5 530 pp.","year":2009,"lang":"en","type":"article","venue":"Digital Investigation","topic":"Digital and Cyber Forensics","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Bunting; Computer science; Network forensics; Operating system; Geology; Digital forensics; Paleontology","retraction":null,"screen_n_in":null,"score":{"opus":0.01252887328574015,"gpt":0.1884366597431249,"spread":0.1759077864573848,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002615469,0.0003007085,0.0003081948,0.00008224663,0.0002020582,0.002474833,0.0003177524,0.0001182656,9.006217e-7],"category_scores_gemma":[0.0002071036,0.0003048526,0.00002659558,0.0003683861,0.0003546723,0.007748125,0.0003505433,0.0002208474,7.609525e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007083351,"about_ca_system_score_gemma":0.000336645,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.01887102,"about_ca_topic_score_gemma":0.01819744,"domain_scores_codex":[0.9979872,0.00003891559,0.0005340468,0.0005706909,0.0004325878,0.0004366258],"domain_scores_gemma":[0.9984724,0.00009235993,0.0003325288,0.0003813432,0.0002265246,0.0004948741],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00002942618,0.0000918132,0.2821968,0.0002608436,0.0001114593,0.0000464169,0.004194499,0.002199295,0.001325609,0.2034476,0.01050529,0.495591],"study_design_scores_gemma":[0.001896892,0.001155813,0.4355908,0.001148144,0.0000826846,0.0002959084,0.001027912,0.1339822,0.004684796,0.4067637,0.01125776,0.002113377],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9917786,0.0003889728,0.003996511,0.0009138384,0.0002764564,0.0002966738,0.00005940246,0.0001025463,0.002187021],"genre_scores_gemma":[0.9893849,0.00003049152,0.009109742,0.001121395,0.0001289064,0.000006500089,0.0001260339,0.00001827795,0.00007371179],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4934776,"threshold_uncertainty_score":0.9999403,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}