{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":15,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":15,"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","author_layer_release":"2026-06-26"},"query_hash":"5e5570f43176","filters":{"venue":"ACM Transactions on Information and System Security"}},"results":[{"id":"W2148952798","doi":"10.1145/354876.354878","title":"Configuring role-based access control to enforce mandatory and discretionary access control policies","year":2000,"lang":"en","type":"article","venue":"ACM Transactions on Information and System Security","topic":"Access Control and Trust","field":"Social Sciences","cited_by":574,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Role-based access control; Access control; Discretionary access control; Computer science; Mandatory access control; Computer access control; Control (management); Physical access; Computer security; Artificial intelligence","authors":[{"name":"Sylvia L. Osborn","is_ca":true},{"name":"Ravi Sandhu","is_ca":false},{"name":"Qamar Munawer","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01114039646682602,"gpt":0.2849402230639566,"spread":0.2737998265971306,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01020613,0.0005897195,0.0006515628,0.0008395512,0.00131244,0.003858758,0.00289704,0.001389834,0.002325896],"category_scores_gemma":[0.02081891,0.0006319865,0.0008615567,0.0005604364,0.002932275,0.005424895,0.00312444,0.003021439,0.0008877208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001417242,"about_ca_system_score_gemma":0.002320963,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001794499,"about_ca_topic_score_gemma":0.001801923,"domain_scores_codex":[0.9891671,0.005110454,0.0009647194,0.001259468,0.002455072,0.001043268],"domain_scores_gemma":[0.9807547,0.006053353,0.001579029,0.008677395,0.001915994,0.001019425],"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.0003904524,0.0004856003,0.004937262,0.0001594357,0.0001119489,0.0004599027,0.002312558,0.07125163,0.02364253,0.8091792,0.002770574,0.08429896],"study_design_scores_gemma":[0.0001708795,0.0002452386,0.0008301917,0.000110191,0.0000813347,0.0005129072,0.0004465266,0.6258885,0.02829804,0.318765,0.02449699,0.0001542002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05000896,0.0001995705,0.9338478,0.0004343907,0.0001024042,0.0004155632,0.00005575855,0.00209334,0.01284216],"genre_scores_gemma":[0.8155558,0.0001366924,0.1802799,0.0001813883,0.00005140417,0.0003060006,0.00009024856,0.0001865578,0.003212063],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01020613,"threshold_uncertainty_score":0.05397582,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1995397007","doi":"10.1145/1330332.1330333","title":"On the Construction of Practical Key Predistribution Schemes for Distributed Sensor Networks Using Combinatorial Designs","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Information and System Security","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":203,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Key (lock); Set (abstract data type); Computer science; Combinatorial design; Transversal (combinatorics); Class (philosophy); Quadratic equation; Wireless sensor network; Field (mathematics); Ring (chemistry); Theoretical computer science; Mathematics; Discrete mathematics; Computer network; Pure mathematics; Artificial intelligence","authors":[{"name":"Jooyoung Lee","is_ca":false},{"name":"Douglas R. Stinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0352407569787436,"gpt":0.258810254101161,"spread":0.2235694971224174,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002728583,0.0006619548,0.0005182094,0.0008215424,0.0005514793,0.001370762,0.000780286,0.0007854323,0.002256549],"category_scores_gemma":[0.006588558,0.0005055587,0.00067254,0.0008975271,0.001931186,0.002479822,0.001362227,0.001163475,0.0004339096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009651952,"about_ca_system_score_gemma":0.0006438111,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000161442,"about_ca_topic_score_gemma":0.0002004585,"domain_scores_codex":[0.9979765,0.001091628,0.0001119181,0.0002150563,0.0004595702,0.0001453737],"domain_scores_gemma":[0.995262,0.003141313,0.0004476821,0.0007406975,0.0003195903,0.0000886282],"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.0001509547,0.00008318228,0.000568186,0.0003405624,0.00005517343,0.0001198469,0.0001698949,0.2302611,0.01572109,0.6818951,0.0008753209,0.06975964],"study_design_scores_gemma":[0.00007268182,0.0005171364,0.0002759495,0.00009693881,0.00004346711,0.0003253725,0.00009051145,0.6773923,0.01509178,0.2968512,0.009178385,0.00006434924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03279827,0.0005086791,0.9592837,0.0002313242,0.00004399499,0.0001210575,0.00003703895,0.0001151175,0.006860812],"genre_scores_gemma":[0.5480566,0.001266254,0.4471417,0.0001846402,0.0001021628,0.0003436465,0.00009269828,0.00005427444,0.002757995],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002728583,"threshold_uncertainty_score":0.01443028,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169267327","doi":"10.1145/1266977.1266980","title":"On interdomain routing security and pretty secure BGP (psBGP)","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Information and System Security","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Border Gateway Protocol; Computer science; Computer network; Computer security; Default-free zone; Public key infrastructure; Simple (philosophy); Routing (electronic design automation); Certificate; Routing protocol; Public-key cryptography; Routing table; Link-state routing protocol; Encryption","authors":[{"name":"Paul C. van Oorschot","is_ca":true},{"name":"Tao Wan","is_ca":true},{"name":"Evangelos Kranakis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007396536651520265,"gpt":0.2503016591918466,"spread":0.2429051225403263,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004984795,0.001753678,0.001039271,0.003055822,0.00189614,0.003880764,0.00237488,0.003201856,0.003356135],"category_scores_gemma":[0.01031738,0.00113425,0.0009791086,0.006591923,0.007696569,0.01537337,0.006304804,0.006794818,0.001758735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003848857,"about_ca_system_score_gemma":0.002347894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003067844,"about_ca_topic_score_gemma":0.001997204,"domain_scores_codex":[0.9931764,0.00182094,0.0003558324,0.001135107,0.002937977,0.0005738201],"domain_scores_gemma":[0.9913856,0.003989932,0.0006942685,0.002438988,0.001215303,0.0002758722],"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.0001213179,0.00004876948,0.0006455446,0.000199275,0.00003035214,0.0002726282,0.0002358213,0.01870618,0.001665401,0.8941367,0.007544248,0.07639366],"study_design_scores_gemma":[0.00004805592,0.0002104762,0.0008043636,0.0003273439,0.00005558304,0.001106444,0.0001504,0.08268493,0.004276317,0.7943913,0.115854,0.0000906367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01101193,0.01685242,0.9000997,0.01100261,0.001114567,0.000266233,0.0001473909,0.0005957601,0.05890934],"genre_scores_gemma":[0.4593828,0.07313766,0.4231878,0.007391586,0.006631294,0.001060391,0.0006988446,0.0005407318,0.02796891],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004984795,"threshold_uncertainty_score":0.02792549,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2117436924","doi":"10.1145/1284680.1284685","title":"On predictive models and user-drawn graphical passwords","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Information and System Security","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Password; Cognitive password; Computer science; S/KEY; Set (abstract data type); Password policy; Password strength; Password cracking; One-time password; Computer security; Theoretical computer science; Human–computer interaction; Programming language","authors":[{"name":"Paul C. van Oorschot","is_ca":true},{"name":"Julie Thorpe","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01549079063818891,"gpt":0.2213604928802214,"spread":0.2058697022420325,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007059285,0.001491335,0.0014967,0.001864568,0.001018993,0.002831351,0.002153873,0.001732587,0.004982458],"category_scores_gemma":[0.04872139,0.0007627873,0.001328306,0.001418262,0.003086285,0.00606439,0.002003117,0.004116131,0.0006750874],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002299128,"about_ca_system_score_gemma":0.001036717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01942134,"about_ca_topic_score_gemma":0.01398656,"domain_scores_codex":[0.9973845,0.001289063,0.0001175284,0.0005733226,0.000334317,0.0003012848],"domain_scores_gemma":[0.9345751,0.05514967,0.003686594,0.003492431,0.002332384,0.0007638749],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005814557,0.0002193047,0.0124711,0.0001015172,0.00009589175,0.0001465704,0.0004525944,0.8677586,0.0006119781,0.08271337,0.002016176,0.03283146],"study_design_scores_gemma":[0.0000109295,0.00002012158,0.000503937,0.00001155896,0.000008681886,0.00001290943,0.00002098576,0.9745836,0.0000900228,0.02461539,0.0001131606,0.000008817571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3234968,0.0008113303,0.6633077,0.0031641,0.0001105379,0.0002331796,0.0009873206,0.0009895967,0.006899558],"genre_scores_gemma":[0.960511,0.0004412521,0.03490306,0.0003134352,0.0001071354,0.0002328417,0.0008272259,0.00007038059,0.002593699],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01942134,"threshold_uncertainty_score":0.0386166,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1526870393","doi":"10.1145/2739044","title":"A Large-Scale Evaluation of High-Impact Password Strength Meters","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Information and System Security","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":100,"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":"Password; Computer science; Password strength; Cognitive password; Computer security; Password cracking; Password policy; One-time password; Internet privacy","authors":[{"name":"Xavier de Carné de Carnavalet","is_ca":true},{"name":"Mohammad Mannan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02923811842032839,"gpt":0.2797029985161457,"spread":0.2504648800958172,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006880329,0.001114416,0.0007408921,0.001462622,0.0009332075,0.001191541,0.001763322,0.001360215,0.002169579],"category_scores_gemma":[0.04076192,0.0004259365,0.000553334,0.001459484,0.001094317,0.003970582,0.001917616,0.002129779,0.002848143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001004152,"about_ca_system_score_gemma":0.0007293274,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001898455,"about_ca_topic_score_gemma":0.002269983,"domain_scores_codex":[0.9920295,0.003425651,0.0005862222,0.001121066,0.002471361,0.0003661606],"domain_scores_gemma":[0.9577593,0.02305366,0.003223213,0.00805332,0.005307646,0.002602902],"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.01343882,0.01841922,0.3912421,0.005374066,0.001334188,0.00143088,0.004582566,0.02808629,0.02825967,0.008335781,0.08655436,0.4129421],"study_design_scores_gemma":[0.002063768,0.02636139,0.5848376,0.0008344638,0.0007485948,0.003717368,0.004975565,0.2514822,0.03229921,0.005251021,0.0870175,0.0004112525],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9828056,0.0008369315,0.005499939,0.0004919318,0.0001295562,0.0005706286,0.002431556,0.002112004,0.005121884],"genre_scores_gemma":[0.9822947,0.0003678465,0.007971761,0.0003909879,0.00004717498,0.0002152082,0.0064596,0.0001548669,0.002097879],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006880329,"threshold_uncertainty_score":0.03638709,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2134909295","doi":"10.1145/1178618.1178619","title":"On countering online dictionary attacks with login histories and humans-in-the-loop","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Information and System Security","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Login; Computer science; Protocol (science); Password; Computer security; Flexibility (engineering); Medicine","authors":[{"name":"Paul C. van Oorschot","is_ca":true},{"name":"Stuart G. Stubblebine","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01011686908075476,"gpt":0.2185514599950471,"spread":0.2084345909142923,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00832493,0.001675748,0.002074375,0.003048897,0.002034366,0.003062911,0.002819583,0.002771133,0.00297055],"category_scores_gemma":[0.05504598,0.000710646,0.001014601,0.002145918,0.006215107,0.01395942,0.006289949,0.003890318,0.0007643182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001567001,"about_ca_system_score_gemma":0.002344193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008548977,"about_ca_topic_score_gemma":0.0008675921,"domain_scores_codex":[0.9828757,0.009548049,0.0007556147,0.001489364,0.003837046,0.001494278],"domain_scores_gemma":[0.8883772,0.06899256,0.01196466,0.02419173,0.004547541,0.00192633],"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.003620229,0.0008854638,0.01354997,0.0008248811,0.0005003295,0.0009764404,0.001941808,0.1626171,0.0246796,0.4467323,0.007651669,0.3360201],"study_design_scores_gemma":[0.0002752702,0.001108835,0.001497124,0.0001432884,0.0001981498,0.001324771,0.0002783133,0.7699502,0.02149428,0.1960736,0.007483725,0.000172346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1891222,0.001619949,0.779572,0.002670678,0.0002250147,0.0006680038,0.0001617106,0.00308045,0.02288008],"genre_scores_gemma":[0.9264441,0.0003761872,0.06957149,0.0003417536,0.0001956589,0.0002782994,0.00007418064,0.0001278605,0.002590369],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00832493,"threshold_uncertainty_score":0.04402697,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2121216923","doi":"10.1145/2584680","title":"An Anti-Phishing System Employing Diffused Information","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Information and System Security","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Phishing; Gestalt psychology; Computer science; Heuristics; Heuristic; Computer security; Similarity (geometry); Perception; Mutual information; Artificial intelligence; Data mining; World Wide Web; The Internet","authors":[{"name":"Teh-Chung Chen","is_ca":true},{"name":"Torin Stepan","is_ca":true},{"name":"Scott Dick","is_ca":true},{"name":"James Miller","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008118801109391142,"gpt":0.2114931089923365,"spread":0.2033743078829454,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008122168,0.0005077437,0.000599683,0.0009367625,0.0005284628,0.0009879406,0.0006622649,0.0009965997,0.00235208],"category_scores_gemma":[0.00372725,0.0002620321,0.0002281799,0.0003748012,0.0003531409,0.001275353,0.001027968,0.0007389386,0.001044749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003339394,"about_ca_system_score_gemma":0.0003462223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00105155,"about_ca_topic_score_gemma":0.001072014,"domain_scores_codex":[0.9995643,0.00008729185,0.0000357574,0.0001462714,0.0001325518,0.00003386695],"domain_scores_gemma":[0.9981213,0.0006672156,0.0001881215,0.0003815327,0.0004715283,0.0001702268],"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.002613671,0.001272759,0.0222289,0.0005877865,0.0002115874,0.00156574,0.001860655,0.009988451,0.2307855,0.005149009,0.0179515,0.7057844],"study_design_scores_gemma":[0.0002449184,0.001739084,0.02884045,0.00009437241,0.0002633215,0.001909927,0.0004129919,0.802841,0.1360683,0.006300038,0.02110538,0.0001801609],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5613648,0.0006006649,0.3678787,0.0007724984,0.0002470997,0.0005776498,0.0006422993,0.05819768,0.009718661],"genre_scores_gemma":[0.8900428,0.00008825429,0.1045204,0.0003052038,0.00004619453,0.00006730585,0.0003605157,0.0001517484,0.004417649],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00235208,"threshold_uncertainty_score":0.007868528,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150494876","doi":"10.1145/1880022.1880023","title":"Pairing-Based Onion Routing with Improved Forward Secrecy","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Information and System Security","topic":"Internet Traffic Analysis and Secure E-voting","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":"University of Waterloo","funders":"","keywords":"Computer science; Anonymity; Routing (electronic design automation); Secrecy; Computer network; Directory; Identity (music); Node (physics); Static routing; Computer security; Key (lock); Routing protocol","authors":[{"name":"Aniket Kate","is_ca":true},{"name":"Greg Zaverucha","is_ca":true},{"name":"Ian Goldberg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005705924926676644,"gpt":0.2039462909852197,"spread":0.1982403660585431,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002328475,0.000718601,0.0008865467,0.0008491384,0.001729121,0.002416197,0.001693339,0.001060639,0.00415609],"category_scores_gemma":[0.003582566,0.000343311,0.001070138,0.001128163,0.002184693,0.006825047,0.006248631,0.002747803,0.001227848],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00118969,"about_ca_system_score_gemma":0.001038634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003274663,"about_ca_topic_score_gemma":0.0003064163,"domain_scores_codex":[0.9962636,0.001325879,0.000235148,0.0004295509,0.001250936,0.0004949514],"domain_scores_gemma":[0.9972275,0.000799635,0.0002581204,0.001265437,0.000311667,0.0001376877],"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.0002925596,0.00007949376,0.0002966367,0.0001325915,0.00004061763,0.000244329,0.0004711227,0.02626885,0.009789172,0.9105406,0.002546118,0.04929798],"study_design_scores_gemma":[0.000180843,0.0003967606,0.0002864141,0.00009380912,0.0001119758,0.0007602805,0.0002266487,0.2058274,0.04044259,0.6615548,0.0899849,0.0001336989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02749701,0.0003443696,0.9408545,0.0006412038,0.0003401132,0.000178781,0.00009953573,0.0005643775,0.02948015],"genre_scores_gemma":[0.739361,0.0008198388,0.2374811,0.0005010298,0.0003528802,0.0003732326,0.0002937527,0.0002529569,0.02056405],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00415609,"threshold_uncertainty_score":0.0139035,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2106964285","doi":"10.1145/1108906.1108910","title":"Access control to people location information","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Information and System Security","topic":"Access Control and Trust","field":"Social Sciences","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Access control; Variety (cybernetics); Control (management); Computer security; Signature (topology); Database; Distributed computing","authors":[{"name":"Urs Hengartner","is_ca":true},{"name":"Peter Steenkiste","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01012953432973272,"gpt":0.2770003379755333,"spread":0.2668708036458006,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005934525,0.0005343969,0.001084502,0.001413334,0.001906131,0.004838367,0.001942649,0.001402609,0.00866898],"category_scores_gemma":[0.02407083,0.0004284622,0.0007274051,0.001942426,0.00220473,0.006144388,0.004220088,0.001742239,0.002362302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00193777,"about_ca_system_score_gemma":0.002123963,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004031938,"about_ca_topic_score_gemma":0.002079086,"domain_scores_codex":[0.9884971,0.003257992,0.0009666936,0.001813252,0.004268358,0.001196572],"domain_scores_gemma":[0.9761866,0.007185016,0.002169766,0.01083316,0.002909829,0.0007155568],"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.0007046965,0.0002430263,0.01045584,0.0005819513,0.0001358015,0.0006014264,0.003245656,0.03301087,0.03272415,0.5417546,0.01553119,0.3610108],"study_design_scores_gemma":[0.0003578045,0.0005884921,0.006023976,0.0002995625,0.0002165788,0.002114853,0.001565977,0.2330772,0.07976221,0.337644,0.3380949,0.00025437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06307198,0.001365609,0.855419,0.002455152,0.0002228211,0.0006121065,0.0007435733,0.005328682,0.07078106],"genre_scores_gemma":[0.9256119,0.0008225897,0.05389978,0.0004053435,0.0002112455,0.0003310345,0.0005125317,0.000219874,0.01798588],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00866898,"threshold_uncertainty_score":0.03138512,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975584929","doi":"10.1145/2445566.2445570","title":"Mohawk","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Information and System Security","topic":"Access Control and Trust","field":"Social Sciences","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Reachability; Role-based access control; Abstraction; Access control; Model checking; Bounded function; Theoretical computer science; Graph; Distributed computing; Computer security; Mathematics","authors":[{"name":"Karthick Jayaraman","is_ca":false},{"name":"Mahesh Tripunitara","is_ca":true},{"name":"Vijay Ganesh","is_ca":false},{"name":"Martin Rinard","is_ca":false},{"name":"Steve J. Chapin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0101769107616035,"gpt":0.2479897556880252,"spread":0.2378128449264217,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002367323,0.0009668906,0.0007408328,0.002361752,0.001939542,0.004032989,0.001849923,0.001599655,0.1398816],"category_scores_gemma":[0.01213377,0.0006623965,0.0007704334,0.001592598,0.001141998,0.006295308,0.004258686,0.002513957,0.06677171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002242204,"about_ca_system_score_gemma":0.003382823,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004847049,"about_ca_topic_score_gemma":0.004323588,"domain_scores_codex":[0.9960311,0.0005123235,0.0003385796,0.000821514,0.001952357,0.0003440375],"domain_scores_gemma":[0.9941657,0.001352316,0.0003669843,0.001691118,0.001986843,0.0004369246],"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.0004404782,0.000159269,0.002678301,0.0006283623,0.00004833388,0.0005297999,0.000637141,0.004736774,0.006344552,0.1657688,0.2127698,0.6052583],"study_design_scores_gemma":[0.00004825938,0.00006502152,0.0008540437,0.0002281747,0.00003350353,0.0007264942,0.0001794017,0.01646581,0.007727748,0.05774765,0.9158495,0.00007440755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.01664773,0.004039063,0.3646617,0.01439931,0.003898836,0.0006987595,0.006435485,0.04112689,0.5480922],"genre_scores_gemma":[0.1967114,0.005221953,0.1900261,0.004864377,0.0007944138,0.0007093063,0.01182809,0.00721613,0.5826283],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.1398816,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066783897","doi":"10.1145/2699910","title":"A Visualizable Evidence-Driven Approach for Authorship Attribution","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Information and System Security","topic":"Authorship Attribution and Profiling","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stylometry; Computer science; Authorship attribution; Context (archaeology); Identification (biology); Attribution; The Internet; Data science; Information retrieval; World Wide Web; Natural language processing","authors":[{"name":"Steven H. H. Ding","is_ca":true},{"name":"Benjamin C. M. Fung","is_ca":true},{"name":"Mourad Debbabi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1074829618696274,"gpt":0.3201323593290201,"spread":0.2126493974593927,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0105476,0.001434388,0.001250962,0.008343361,0.00113735,0.006107213,0.004058761,0.003105052,0.003831064],"category_scores_gemma":[0.06413136,0.0008806087,0.001598055,0.003547027,0.002559663,0.007638124,0.006807819,0.003815936,0.001230122],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001500216,"about_ca_system_score_gemma":0.001651887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001343078,"about_ca_topic_score_gemma":0.001681501,"domain_scores_codex":[0.9886108,0.006581163,0.0006597639,0.001822295,0.001978412,0.0003476354],"domain_scores_gemma":[0.9511378,0.03028277,0.004613786,0.007494764,0.005365197,0.001105494],"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.0009290891,0.0006148062,0.01483372,0.001082066,0.0003073118,0.001189895,0.003944532,0.1328925,0.01619728,0.1511982,0.007015775,0.6697949],"study_design_scores_gemma":[0.00007600648,0.000176107,0.002198214,0.0002174851,0.00007906627,0.0005183289,0.0007262999,0.7566369,0.01118518,0.2163486,0.0117354,0.0001024155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008464939,0.0004254099,0.9869468,0.0006039563,0.0000554706,0.0002426904,0.0003596918,0.001023764,0.001877267],"genre_scores_gemma":[0.3344666,0.0003800414,0.661497,0.0002220532,0.0001177579,0.0003749224,0.0008663606,0.0001632658,0.001912044],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0105476,"threshold_uncertainty_score":0.05578172,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2060674139","doi":"10.1145/2240276.2240281","title":"Corrective Enforcement","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Information and System Security","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Enforcement; Flexibility (engineering); Set (abstract data type); Computer security; Property (philosophy); Programming language","authors":[{"name":"Raphaël Khoury","is_ca":true},{"name":"Nadia Tawbi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01654451183667243,"gpt":0.2421122058852992,"spread":0.2255676940486267,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006735812,0.001486651,0.0008369424,0.002154798,0.001671437,0.002763533,0.003489295,0.002005757,0.01901607],"category_scores_gemma":[0.03725879,0.0006143692,0.0009998921,0.0008928444,0.001758953,0.003390415,0.003237739,0.002783813,0.004532715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001395645,"about_ca_system_score_gemma":0.003411761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002810914,"about_ca_topic_score_gemma":0.003690157,"domain_scores_codex":[0.9895629,0.001726996,0.0007261068,0.001871784,0.005308657,0.0008035584],"domain_scores_gemma":[0.9625353,0.008617616,0.002973276,0.01785782,0.007276664,0.0007393154],"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.0006954972,0.0007000435,0.01154996,0.001314851,0.0002058539,0.001434137,0.001861045,0.02610379,0.03952822,0.2188359,0.06627054,0.6315001],"study_design_scores_gemma":[0.0002344719,0.0007438274,0.007636503,0.0009472257,0.0003329125,0.00259929,0.001028127,0.1646557,0.07455687,0.1462927,0.600728,0.0002443079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05260496,0.001820955,0.742144,0.003625551,0.002471833,0.001296606,0.001155736,0.0312811,0.1635992],"genre_scores_gemma":[0.6325862,0.001203405,0.2542195,0.002955451,0.0006514573,0.0006156715,0.002045667,0.005168003,0.1005546],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01901607,"threshold_uncertainty_score":0.06361502,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003748004","doi":"10.1145/1952982.1952985","title":"Authorization recycling in hierarchical RBAC systems","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Information and System Security","topic":"Access Control and Trust","field":"Social Sciences","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Bottleneck; Authorization; Access control; Reuse; Role-based access control; Single point of failure; Distributed computing; Computer security; Computer network; Embedded system","authors":[{"name":"Qiang Wei","is_ca":false},{"name":"Jason Crampton","is_ca":false},{"name":"Konstantin Beznosov","is_ca":true},{"name":"Matei Ripeanu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02967124889391913,"gpt":0.2710190726943146,"spread":0.2413478238003955,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01183417,0.0006598221,0.001215828,0.001568544,0.002987994,0.003020504,0.003283217,0.001680605,0.002584873],"category_scores_gemma":[0.0251564,0.000941224,0.0008598689,0.001673294,0.003252129,0.005443948,0.002583449,0.001911408,0.0007839496],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003054636,"about_ca_system_score_gemma":0.00478031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0133444,"about_ca_topic_score_gemma":0.008145744,"domain_scores_codex":[0.9881947,0.004896973,0.0006787744,0.001095088,0.003830778,0.001303711],"domain_scores_gemma":[0.9734062,0.01055465,0.003039306,0.008670188,0.003627674,0.0007019741],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00107221,0.000389286,0.00840124,0.0003644814,0.0001906564,0.0005806175,0.002352096,0.542547,0.01921683,0.2072053,0.003746922,0.2139333],"study_design_scores_gemma":[0.00009545961,0.0001451518,0.00120906,0.00004341235,0.0000634773,0.0002599602,0.0003041023,0.9312798,0.01089173,0.05090398,0.004726844,0.00007703208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1776187,0.0008414053,0.8096183,0.0005723556,0.00003379635,0.0002564886,0.00007158332,0.003877488,0.007109901],"genre_scores_gemma":[0.8783136,0.0001738757,0.1186204,0.0001307966,0.00002396952,0.00009174174,0.00007335015,0.0001239592,0.002448377],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0133444,"threshold_uncertainty_score":0.06258583,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1993715996","doi":"10.1145/2629689","title":"A Framework for Expressing and Enforcing Purpose-Based Privacy Policies","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Information and System Security","topic":"Access Control and Trust","field":"Social Sciences","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Alberta Innovates - Technology Futures","keywords":"Computer science; Workflow; Enforcement; Privacy policy; Key (lock); Access control; Semantics (computer science); Modal logic; Formal semantics (linguistics); Formal description; Computer security; Modal; Information privacy; Programming language; Database","authors":[{"name":"Mohammad Jafari","is_ca":true},{"name":"Reihaneh Safavi–Naini","is_ca":true},{"name":"Philip W. L. Fong","is_ca":true},{"name":"Ken Barker","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02172053854095483,"gpt":0.2999754802795083,"spread":0.2782549417385534,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01327977,0.001174954,0.001056351,0.003051284,0.003983811,0.008243193,0.004510968,0.00380736,0.003395242],"category_scores_gemma":[0.009385096,0.001537894,0.004283861,0.002175536,0.006317408,0.0104202,0.005077037,0.008125677,0.00138278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003462183,"about_ca_system_score_gemma":0.009146984,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01017546,"about_ca_topic_score_gemma":0.008388803,"domain_scores_codex":[0.991602,0.00251072,0.00121242,0.001195483,0.00266039,0.00081892],"domain_scores_gemma":[0.9924834,0.002574161,0.0008144203,0.001951097,0.001527966,0.0006488434],"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.00002388894,0.00006191234,0.0001868324,0.000113558,0.00002901953,0.0002104493,0.0005697511,0.006766197,0.001687415,0.9776708,0.002092059,0.01058817],"study_design_scores_gemma":[0.00009596869,0.0001141495,0.0002150426,0.0003602743,0.0001189067,0.000605739,0.0003928207,0.08584116,0.006299224,0.7809303,0.1248918,0.0001345535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001480341,0.0001938027,0.9907892,0.001242135,0.00009741844,0.0002712457,0.0001934246,0.0008115328,0.004920832],"genre_scores_gemma":[0.05972962,0.0006086391,0.9335993,0.0005834739,0.0001300833,0.0006657821,0.000397839,0.0001297975,0.004155428],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01327977,"threshold_uncertainty_score":0.07023096,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169555541","doi":"10.1145/2043621.2043625","title":"Access Control Policy Translation, Verification, and Minimization within Heterogeneous Data Federations","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Information and System Security","topic":"Access Control and Trust","field":"Social Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Access control; XML; Markup language; XACML; Semantics (computer science); Control (management); Relational database; Set (abstract data type); Role-based access control; Database; Programming language; Theoretical computer science; Artificial intelligence; Computer security; World Wide Web","authors":[{"name":"Gregory Leighton","is_ca":true},{"name":"Denilson Barbosa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06829532864135857,"gpt":0.3127621746957987,"spread":0.2444668460544401,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02062871,0.0008010516,0.001513534,0.001346269,0.002463954,0.004282434,0.003113632,0.001877956,0.001126528],"category_scores_gemma":[0.05310071,0.001045292,0.001947398,0.001944503,0.004008895,0.007419949,0.005003032,0.003493994,0.0003547893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003426825,"about_ca_system_score_gemma":0.005968388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003918868,"about_ca_topic_score_gemma":0.00294523,"domain_scores_codex":[0.9748429,0.01206995,0.001970795,0.003455541,0.006034498,0.001626321],"domain_scores_gemma":[0.9610094,0.02315495,0.002816014,0.009272354,0.003083766,0.0006634417],"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.0004970744,0.000541684,0.004499696,0.0003619409,0.0001876125,0.0008942834,0.001618215,0.3351939,0.01230284,0.4536422,0.002736981,0.1875235],"study_design_scores_gemma":[0.00007108905,0.00009334629,0.0004387897,0.00005108729,0.00006149957,0.0002202124,0.0004069369,0.7125101,0.01596649,0.2672947,0.002845091,0.00004060077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04646798,0.0000991095,0.9502381,0.0008548203,0.000024008,0.0002127946,0.00006948589,0.0006335675,0.001400174],"genre_scores_gemma":[0.4531704,0.0001378676,0.5443518,0.0002278775,0.00004066168,0.0003121075,0.0002654452,0.0001687791,0.001324971],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02062871,"threshold_uncertainty_score":0.1090963,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}