{"meta":{"query_hash":"5e5570f43176","filters":{"venue":"ACM Transactions on Information and System Security"},"cohort_total":15,"direct_labels_cover":0,"predictions_cover":15,"exported":15,"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/5e5570f43176","api":"https://metacan.xera.ac/api/v1/cohort?venue=ACM+Transactions+on+Information+and+System+Security"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.029238118420328394,"score_gpt":0.27970299851614566,"score_spread":0.25046488009581724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526870393","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.503755,0.000046361965,0.49350253,0.0003566402,0.0006001596,0.0005771011,0.00010445391,0.00018580724,0.00087199296],"genre_scores_gemma":[0.998838,0.0000072528906,0.0009881676,0.000059855847,0.0000129366035,0.000055046326,0.000026463984,0.0000042741212,0.000008003348],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977992,0.00031486404,0.0006211635,0.00017051063,0.00090823724,0.00018602776],"domain_scores_gemma":[0.9980761,0.000071764356,0.00028599368,0.00073810347,0.0006215949,0.00020644974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020083368,0.00015342058,0.00025338482,0.00031648422,0.00013584601,0.00017229415,0.00042213625,0.00010167318,0.000018551696],"category_scores_gemma":[0.00006547254,0.0001325916,0.00009545947,0.00044051828,0.000025743415,0.0018259597,0.000017104765,0.0001276264,0.00005795915],"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.00020531229,0.0009957603,0.0011436333,0.0009735626,0.0004922714,0.0000012818043,0.8242013,0.0027477762,0.00003496356,0.058998078,0.0018745601,0.10833153],"study_design_scores_gemma":[0.003301164,0.00027215903,0.002031487,0.00012042945,0.000093525676,0.0000365452,0.014322802,0.9739822,0.0006869254,0.002750836,0.002098509,0.0003033817],"about_ca_topic_score_codex":0.00019458025,"about_ca_topic_score_gemma":0.0000798861,"teacher_disagreement_score":0.97123444,"about_ca_system_score_codex":0.00018537157,"about_ca_system_score_gemma":0.00017127664,"threshold_uncertainty_score":0.54069287},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Reachability; Role-based access control; Abstraction; Access control; Model checking; Bounded function; Theoretical computer science; Graph; Distributed computing; Computer security; Mathematics","score_opus":0.010176910761603503,"score_gpt":0.24798975568802517,"score_spread":0.23781284492642166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975584929","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29928932,0.00018564312,0.1383904,0.013826467,0.0019602126,0.0025523691,0.0000929441,0.0011911247,0.5425115],"genre_scores_gemma":[0.9993356,0.0000514486,0.00009500947,0.00027570475,0.000034864337,0.00007287111,0.0000032057674,0.0000020049115,0.00012930877],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999317,0.000063667,0.00021116513,0.00005915615,0.00020861562,0.0001403978],"domain_scores_gemma":[0.9995056,0.00006470137,0.00006380216,0.0001493409,0.00010915924,0.00010741226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022814308,0.000064910186,0.000090567475,0.00008127607,0.00066201534,0.0002417633,0.00013811035,0.000079479825,0.00042890917],"category_scores_gemma":[0.000028608754,0.000056613833,0.000037400412,0.00013118197,0.00005878362,0.0019101744,0.0000025401996,0.00009717366,0.0006321132],"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.000042356554,0.000109198096,0.0010975258,0.00029067032,0.00008926383,8.854594e-7,0.08531122,0.00009790975,0.0000052471264,0.32221317,0.0022352154,0.5885073],"study_design_scores_gemma":[0.004187381,0.00022904728,0.021567581,0.00024485475,0.00011244582,0.000024636049,0.2572092,0.015690695,0.00018281472,0.019709093,0.6796216,0.0012206889],"about_ca_topic_score_codex":0.0034412863,"about_ca_topic_score_gemma":0.00030032103,"teacher_disagreement_score":0.70004624,"about_ca_system_score_codex":0.000047742975,"about_ca_system_score_gemma":0.000035023415,"threshold_uncertainty_score":0.8124747},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.021720538540954834,"score_gpt":0.29997548027950827,"score_spread":0.2782549417385534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993715996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047768705,0.000032723292,0.94613945,0.0015925643,0.0001604207,0.0004819913,0.000021141577,0.0001300791,0.003672905],"genre_scores_gemma":[0.99577713,0.000016120226,0.0036349487,0.00040091568,0.00006438279,0.000084066574,0.000004178952,0.0000038927788,0.000014364125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99923486,0.000077435674,0.00025011023,0.000084890155,0.00017519112,0.00017754055],"domain_scores_gemma":[0.999095,0.00044216937,0.00011864899,0.00015943134,0.000084253974,0.00010047959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005174181,0.00009051957,0.00014391288,0.00011356143,0.0011925254,0.00036222962,0.0001256047,0.000119143326,0.000012087902],"category_scores_gemma":[0.00021869128,0.00008213858,0.000045455403,0.0001071685,0.00008379604,0.0009970196,0.0000039108495,0.00010628588,0.000004697678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015588432,0.000048063786,0.0008523275,0.0008645786,0.000037980593,1.2523356e-7,0.09533504,0.00023355243,0.000011485019,0.69721353,0.000076059514,0.20517136],"study_design_scores_gemma":[0.008130997,0.0005965344,0.004347307,0.002034531,0.0002790525,0.000013299177,0.11082478,0.1755861,0.0015252368,0.08737785,0.60764825,0.0016360689],"about_ca_topic_score_codex":0.00054665597,"about_ca_topic_score_gemma":0.00007934304,"teacher_disagreement_score":0.9480084,"about_ca_system_score_codex":0.000040864285,"about_ca_system_score_gemma":0.000044969845,"threshold_uncertainty_score":0.9172061},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0352407569787436,"score_gpt":0.258810254101161,"score_spread":0.2235694971224174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995397007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091147274,0.000010296197,0.90631133,0.00049233553,0.0010166677,0.00069015136,0.00015798809,0.0001386558,0.00003527287],"genre_scores_gemma":[0.9868485,0.00002703901,0.012897523,0.00006034897,0.00006033975,0.000045979832,0.000054321416,0.0000054975744,4.6478297e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841577,0.00020077256,0.0005995615,0.00018411597,0.00036119611,0.0002385807],"domain_scores_gemma":[0.99758357,0.0010526279,0.00037580155,0.0005290372,0.0003703809,0.00008861095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048912683,0.00018174811,0.00024661637,0.00010334287,0.0007545405,0.00011472631,0.00027651328,0.00021624242,0.0000044272],"category_scores_gemma":[0.00021387626,0.00015003323,0.00010898664,0.00037822683,0.00016781274,0.0010111287,0.0000146036,0.00031178808,0.0000030691272],"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.00041891236,0.00020293954,0.00007343647,0.00021129865,0.000125964,0.0000022494896,0.0022703928,0.027823195,0.000033503864,0.96644694,0.0003617134,0.0020294378],"study_design_scores_gemma":[0.0012292035,0.0002412683,0.00006580683,0.00011904856,0.00003893063,0.00028152138,0.0008585164,0.99097186,0.0016932179,0.0034625535,0.0008283368,0.00020974022],"about_ca_topic_score_codex":0.000019324198,"about_ca_topic_score_gemma":0.0000013415969,"teacher_disagreement_score":0.96314865,"about_ca_system_score_codex":0.00014800325,"about_ca_system_score_gemma":0.000089456335,"threshold_uncertainty_score":0.6118177},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Bottleneck; Authorization; Access control; Reuse; Role-based access control; Single point of failure; Distributed computing; Computer security; Computer network; Embedded system","score_opus":0.029671248893919127,"score_gpt":0.2710190726943146,"score_spread":0.24134782380039546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003748004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2403462,0.00021131946,0.5142289,0.0015320118,0.0033871215,0.002301113,0.00009134084,0.0008205517,0.23708147],"genre_scores_gemma":[0.99958605,0.000069180074,0.00014585673,0.000053739826,0.00004075168,0.00005447093,0.0000063585535,0.0000033671183,0.000040227063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9988614,0.00020740688,0.0004122087,0.0000983574,0.0002439378,0.00017671277],"domain_scores_gemma":[0.99947804,0.000086497384,0.00010871083,0.0001475012,0.000076809076,0.000102416445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007854927,0.000084485575,0.00014458512,0.0002101328,0.0004791476,0.00012609415,0.00015306544,0.00014547896,0.00004531696],"category_scores_gemma":[0.00006728151,0.00007976845,0.000034916156,0.00028726272,0.000060108458,0.0013288113,0.000003566548,0.00019032617,0.00004659933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017598504,0.00012982187,0.0040213526,0.00033619363,0.000036308924,0.0000034131463,0.15784109,0.0002565431,0.0000024382534,0.7766394,0.00004036968,0.0605171],"study_design_scores_gemma":[0.013195793,0.00085192936,0.09260345,0.0025692615,0.00029320345,0.00008666426,0.5062009,0.18149623,0.00026982627,0.030364156,0.16874199,0.003326559],"about_ca_topic_score_codex":0.0044045593,"about_ca_topic_score_gemma":0.0007172291,"teacher_disagreement_score":0.75923985,"about_ca_system_score_codex":0.000097469885,"about_ca_system_score_gemma":0.00005774206,"threshold_uncertainty_score":0.66584057},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Enforcement; Flexibility (engineering); Set (abstract data type); Computer security; Property (philosophy); Programming language","score_opus":0.016544511836672434,"score_gpt":0.24211220588529916,"score_spread":0.22556769404862673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060674139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077010063,0.00003814168,0.9811885,0.00020414084,0.0012105926,0.00021637909,0.000007296268,0.00028317183,0.009150805],"genre_scores_gemma":[0.9957688,0.000014862922,0.0037834935,0.00033833634,0.000038798175,0.000035429603,0.0000045336296,0.00000237306,0.000013409918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990748,0.000062832536,0.00032543595,0.00010267365,0.0002283567,0.00020587882],"domain_scores_gemma":[0.9991148,0.00011019825,0.00012287417,0.00043276828,0.00008900622,0.00013033678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045921528,0.0001088221,0.00010854124,0.00014701404,0.00038602826,0.00016590953,0.00031434078,0.000067736684,0.000026873697],"category_scores_gemma":[0.000020657691,0.00010404302,0.000045781693,0.00024539483,0.00002073239,0.0024445392,0.000016829474,0.00014969643,0.00017437103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021982158,0.0001337918,0.0003667274,0.00021431436,0.00005024338,2.6983398e-7,0.05282685,0.0004141458,0.000006551926,0.79727376,0.00043579025,0.1482556],"study_design_scores_gemma":[0.0032203523,0.00046148727,0.0073609343,0.00038270676,0.00006792981,0.00047282455,0.029724088,0.6846369,0.0071079554,0.0041780774,0.26075438,0.0016323555],"about_ca_topic_score_codex":0.000043271422,"about_ca_topic_score_gemma":0.0000014774978,"teacher_disagreement_score":0.98806775,"about_ca_system_score_codex":0.00010221203,"about_ca_system_score_gemma":0.000025127623,"threshold_uncertainty_score":0.42427513},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.10748296186962741,"score_gpt":0.3201323593290201,"score_spread":0.2126493974593927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066783897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024141595,0.000071802235,0.99481124,0.0006885426,0.00043496408,0.0006839707,0.00004742468,0.0003911222,0.00045678098],"genre_scores_gemma":[0.96411026,0.000012450328,0.035372023,0.00018315253,0.000033045835,0.00018615859,0.000053648295,0.0000047822027,0.000044503147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848324,0.00019665329,0.0004794727,0.00022087128,0.00035424138,0.00026549393],"domain_scores_gemma":[0.99853814,0.00016177612,0.0001821597,0.00047011257,0.0003752467,0.00027253933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017485834,0.00016124322,0.00020475936,0.00020531545,0.0004246479,0.0003418422,0.00043287608,0.00018495171,0.0000037044344],"category_scores_gemma":[0.00017099275,0.00014953215,0.00008742707,0.00043822132,0.000030255269,0.002880933,0.000019645473,0.00019560991,0.0000494502],"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.0004364303,0.0002467674,0.00046769102,0.0019126794,0.000113443486,0.0000013011531,0.03972296,0.010562687,0.000029100942,0.8981628,0.0020595626,0.046284623],"study_design_scores_gemma":[0.0010846083,0.00027977204,0.00009446839,0.00014617686,0.00002664017,0.000051919098,0.0021209999,0.98212135,0.0008884027,0.002821016,0.010048578,0.0003160809],"about_ca_topic_score_codex":0.00003171996,"about_ca_topic_score_gemma":0.0000026372268,"teacher_disagreement_score":0.97155863,"about_ca_system_score_codex":0.00019394988,"about_ca_system_score_gemma":0.00013488291,"threshold_uncertainty_score":0.6097744},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Access control; Variety (cybernetics); Control (management); Computer security; Signature (topology); Database; Distributed computing","score_opus":0.01012953432973272,"score_gpt":0.2770003379755333,"score_spread":0.26687080364580057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106964285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06032619,0.000033731612,0.87898946,0.016290002,0.0007379145,0.001799469,0.0001268884,0.0005307446,0.041165587],"genre_scores_gemma":[0.9978577,0.000027228562,0.00015147863,0.0016839706,0.0000886293,0.00013468027,0.000018070936,0.000003018687,0.00003520655],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987702,0.00009327544,0.00045351035,0.00008248526,0.00038973565,0.0002108228],"domain_scores_gemma":[0.9989996,0.00009762145,0.0001545442,0.00022108133,0.00033928794,0.00018785721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005785043,0.00011325115,0.000158686,0.00026518488,0.00086794945,0.000595925,0.00029756752,0.000115512965,0.00013370917],"category_scores_gemma":[0.00011390663,0.00010891146,0.000044183522,0.00047103345,0.000032880554,0.0081690075,0.0000065513636,0.00012666949,0.00067295285],"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.0004092704,0.00013653589,0.0023667752,0.00044608137,0.00009930901,2.5312568e-7,0.15967242,0.015789445,0.0000022619365,0.094249725,0.001723611,0.7251043],"study_design_scores_gemma":[0.0054766955,0.00019386878,0.031003473,0.00021071496,0.00012875722,0.000012960365,0.05555459,0.042803757,0.00012415911,0.00069197075,0.862885,0.0009140606],"about_ca_topic_score_codex":0.0018024568,"about_ca_topic_score_gemma":0.0025116787,"teacher_disagreement_score":0.93753153,"about_ca_system_score_codex":0.00018570648,"about_ca_system_score_gemma":0.000104969695,"threshold_uncertainty_score":0.86496717},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01549079063818891,"score_gpt":0.2213604928802214,"score_spread":0.20586970224203247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117436924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14662842,0.00003565452,0.84963685,0.00083509216,0.00036032413,0.00045934774,0.00004789962,0.0003682002,0.0016281945],"genre_scores_gemma":[0.99896437,0.00008873911,0.0004514513,0.00036841285,0.000014960138,0.000066847206,0.000007588727,0.000005212783,0.00003244503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985309,0.0001237274,0.0004742368,0.0002433866,0.00043303845,0.00019468514],"domain_scores_gemma":[0.99879104,0.00014370076,0.00012909822,0.0006018131,0.00013566608,0.00019866474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002904996,0.00018303488,0.00022031998,0.0003134663,0.0007328326,0.00027121246,0.00035051157,0.00014610957,0.000005514446],"category_scores_gemma":[0.000019237046,0.00016352614,0.0000690234,0.00033721127,0.000108522705,0.002070444,0.000018627408,0.0002595767,0.00004200132],"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.00018721547,0.00040612943,0.00040901446,0.00059270154,0.0001763399,0.000011078007,0.28012913,0.0008752836,0.000007723419,0.70645046,0.0013702499,0.0093846265],"study_design_scores_gemma":[0.001524451,0.00039474515,0.0022254386,0.00015975327,0.000021416632,0.00032398387,0.0017559676,0.9783057,0.00011622992,0.009737706,0.005029677,0.00040491953],"about_ca_topic_score_codex":0.000055884982,"about_ca_topic_score_gemma":0.000014274878,"teacher_disagreement_score":0.9774304,"about_ca_system_score_codex":0.00005114049,"about_ca_system_score_gemma":0.000056985693,"threshold_uncertainty_score":0.66684026},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008118801109391142,"score_gpt":0.2114931089923365,"score_spread":0.20337430788294536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121216923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098723136,0.000005016238,0.8969874,0.0001514782,0.0009868965,0.0002695967,0.000013184212,0.0009978366,0.0018654779],"genre_scores_gemma":[0.9971834,0.00000536061,0.0024479055,0.0002508033,0.000048900485,0.0000379224,0.000018355195,0.0000055975383,0.0000017636374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842024,0.00017382533,0.0006107274,0.00016822992,0.00040167005,0.00022528348],"domain_scores_gemma":[0.9985351,0.00009959672,0.0002684949,0.0007694011,0.00016149924,0.00016593102],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00087946374,0.00018787995,0.0002174622,0.00039140575,0.0007440499,0.0011668174,0.0005419215,0.00015599027,0.000003250328],"category_scores_gemma":[0.000039526185,0.00017967602,0.00006753567,0.0003917973,0.00002094876,0.011718426,0.000014151145,0.00024486287,0.000114005765],"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.000121643556,0.00018278629,0.0014284945,0.0038815762,0.00013581304,0.0000023502912,0.06614922,0.009467522,0.00031855342,0.33972555,0.00023943673,0.578347],"study_design_scores_gemma":[0.0014464974,0.00030813256,0.0060718586,0.0003237662,0.00002972194,0.00015034583,0.0037652268,0.9779488,0.0012435128,0.0003686742,0.00781911,0.00052439753],"about_ca_topic_score_codex":0.00016450483,"about_ca_topic_score_gemma":0.000009635823,"teacher_disagreement_score":0.96848124,"about_ca_system_score_codex":0.0001442323,"about_ca_system_score_gemma":0.000029150688,"threshold_uncertainty_score":0.99987006},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Login; Computer science; Protocol (science); Password; Computer security; Flexibility (engineering); Medicine","score_opus":0.010116869080754756,"score_gpt":0.21855145999504708,"score_spread":0.2084345909142923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134909295","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6593937,0.00012996368,0.3327738,0.0030171627,0.0006807226,0.0007960509,0.000078223995,0.0003606887,0.0027696532],"genre_scores_gemma":[0.9993141,0.000015883972,0.00022201375,0.00031096497,0.000022947272,0.000042718573,0.000020897127,0.000003747364,0.00004670415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889827,0.00008651902,0.0003856993,0.00016705219,0.00032150839,0.00014096308],"domain_scores_gemma":[0.9992277,0.00011648493,0.00011472629,0.0004286342,0.0000702202,0.00004224994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003171293,0.00014156495,0.00014988484,0.00021294152,0.00033549228,0.0002561842,0.00029044508,0.00006557941,0.0000038671883],"category_scores_gemma":[0.000006177275,0.00010495063,0.000027489545,0.00024037478,0.00005297257,0.001041348,0.000007833392,0.00018157871,0.000011806681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030461678,0.0012296982,0.003807513,0.0019033321,0.00010585053,0.000028591972,0.31940538,0.0013883989,0.000029461837,0.654162,0.0019757769,0.0156594],"study_design_scores_gemma":[0.011834577,0.002758762,0.08704885,0.0020365461,0.00014740099,0.0020393238,0.054838084,0.642451,0.00024901715,0.012645123,0.18107767,0.0028736535],"about_ca_topic_score_codex":0.00019020987,"about_ca_topic_score_gemma":0.00035137855,"teacher_disagreement_score":0.64151686,"about_ca_system_score_codex":0.000092204675,"about_ca_system_score_gemma":0.000024472589,"threshold_uncertainty_score":0.42797625},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.011140396466826024,"score_gpt":0.2849402230639566,"score_spread":0.2737998265971306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148952798","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65728194,0.00037418536,0.19847067,0.018467765,0.0007800587,0.004851189,0.0014937534,0.0010389242,0.1172415],"genre_scores_gemma":[0.99732333,0.00006887459,0.000017861672,0.0022092264,0.000081329104,0.00017849386,0.000015951215,0.0000075430107,0.00009738356],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984377,0.00018281849,0.00046816043,0.00018175646,0.0004111087,0.0003184668],"domain_scores_gemma":[0.99892986,0.00025024454,0.00012930695,0.00025225585,0.00013946541,0.00029888607],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00051884097,0.00019162525,0.0002908772,0.00023809508,0.0013069608,0.0009248476,0.0004424464,0.00014573072,0.00051326514],"category_scores_gemma":[0.000040878844,0.00017628973,0.00007361614,0.00024405618,0.00015864783,0.0032410112,0.000007939715,0.00018225882,0.00006367969],"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.0073112226,0.0006403772,0.04235896,0.0022644273,0.00094495236,0.000018494813,0.1270294,0.03740975,0.00006243352,0.16137722,0.0011781465,0.6194046],"study_design_scores_gemma":[0.037696514,0.00081100076,0.13680686,0.0013271625,0.0007809057,0.00006298831,0.06354286,0.11389872,0.00053658674,0.0036728051,0.6373052,0.00355842],"about_ca_topic_score_codex":0.0033470301,"about_ca_topic_score_gemma":0.0005222201,"teacher_disagreement_score":0.636127,"about_ca_system_score_codex":0.00009823068,"about_ca_system_score_gemma":0.00011601212,"threshold_uncertainty_score":0.9999932},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Anonymity; Routing (electronic design automation); Secrecy; Computer network; Directory; Identity (music); Node (physics); Static routing; Computer security; Key (lock); Routing protocol","score_opus":0.005705924926676644,"score_gpt":0.20394629098521974,"score_spread":0.1982403660585431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150494876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08211323,0.0000028997608,0.91613346,0.00038703985,0.00030773444,0.00019953132,0.0000065338704,0.00029524523,0.0005543265],"genre_scores_gemma":[0.9927534,0.0000010236266,0.006888349,0.00027685662,0.000027430522,0.000025760137,0.000010081103,0.000005755479,0.000011371971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988147,0.00004886356,0.00043623717,0.00020215572,0.0002705863,0.00022747484],"domain_scores_gemma":[0.99901086,0.000089649584,0.00020179941,0.00037811894,0.00017202765,0.00014751585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055192603,0.00017462048,0.00019597661,0.00019470678,0.0003875081,0.00039114495,0.0003945515,0.000115608316,0.000015901092],"category_scores_gemma":[0.000032163,0.00013768526,0.00009372214,0.00027606476,0.000030193984,0.0012844629,0.00001106801,0.00039905935,0.000027879958],"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.00025291627,0.00036577514,0.0005618429,0.0010666761,0.0003765559,0.000010051295,0.032405272,0.031285014,0.0002636726,0.71490985,0.00014001218,0.21836235],"study_design_scores_gemma":[0.00059542566,0.00012069528,0.00009539305,0.00007288875,0.000019353662,0.000029815734,0.0007585937,0.99656135,0.00055836485,0.000015294736,0.0009841309,0.00018866967],"about_ca_topic_score_codex":0.00006118506,"about_ca_topic_score_gemma":0.0002995468,"teacher_disagreement_score":0.96527636,"about_ca_system_score_codex":0.00004406152,"about_ca_system_score_gemma":0.00008307171,"threshold_uncertainty_score":0.5614642},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007396536651520265,"score_gpt":0.2503016591918466,"score_spread":0.24290512254032634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169267327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04244878,0.000019714966,0.95182985,0.0004359055,0.00029786676,0.002167812,0.000037185742,0.00042864535,0.0023342136],"genre_scores_gemma":[0.99460083,0.00000971525,0.004648785,0.00045906586,0.000023344724,0.00023026972,0.000008563061,0.000009133311,0.00001027298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997887,0.00013021899,0.000771412,0.00038052883,0.0004577029,0.0003731019],"domain_scores_gemma":[0.9980405,0.00038236822,0.00032202216,0.0008482947,0.00016257541,0.00024421612],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013373401,0.00027989649,0.00026645616,0.00030507008,0.0005748709,0.00032771833,0.00052438607,0.00018934484,0.000015263695],"category_scores_gemma":[0.00011484714,0.00026673632,0.000077814664,0.00040947294,0.00008690283,0.002414446,0.00005600375,0.00048755744,0.000054499345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0001454282,0.00018015468,0.00015468783,0.00057071546,0.000048191152,0.0000055714386,0.038812917,0.00009891122,0.000027033857,0.8917532,0.000040990126,0.06816221],"study_design_scores_gemma":[0.010357413,0.0019772754,0.0064002844,0.0022002272,0.000114944836,0.0008778032,0.023395935,0.4480401,0.016639618,0.4693045,0.017359298,0.003332595],"about_ca_topic_score_codex":0.00002427648,"about_ca_topic_score_gemma":0.000043155043,"teacher_disagreement_score":0.9521521,"about_ca_system_score_codex":0.00018234913,"about_ca_system_score_gemma":0.000040607512,"threshold_uncertainty_score":0.9999785},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; 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","score_opus":0.06829532864135857,"score_gpt":0.3127621746957987,"score_spread":0.24446684605444013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169555541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033514153,0.00026266972,0.93043953,0.005979445,0.0007805474,0.0023847457,0.0010072475,0.0006293752,0.025002273],"genre_scores_gemma":[0.99869955,0.0001628125,0.0005485994,0.0003403093,0.000063609274,0.00006264557,0.00009904731,0.000006328874,0.000017091757],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869585,0.00018837303,0.0004966255,0.00019265109,0.0002596302,0.00016686367],"domain_scores_gemma":[0.998891,0.000102973245,0.00020850825,0.00044612313,0.00020267251,0.00014872037],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00050954113,0.00013001668,0.00016306092,0.00021453151,0.0014640142,0.00049451005,0.00039624175,0.0001346653,0.000064504195],"category_scores_gemma":[0.00011027148,0.00012677943,0.000027732081,0.0002925839,0.00013402547,0.00392662,0.000009207441,0.00011197089,0.000016647959],"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.00087462773,0.0005306841,0.0070103533,0.00075534184,0.00055292266,0.000003868462,0.373103,0.0026926403,0.000015092037,0.35552445,0.00038321802,0.2585538],"study_design_scores_gemma":[0.02527734,0.00081064046,0.04787468,0.0006432307,0.0014740879,0.00023784392,0.113827966,0.6260258,0.0009303758,0.027961792,0.15056634,0.0043698843],"about_ca_topic_score_codex":0.0028764987,"about_ca_topic_score_gemma":0.0023618683,"teacher_disagreement_score":0.9651854,"about_ca_system_score_codex":0.000053892247,"about_ca_system_score_gemma":0.00017698924,"threshold_uncertainty_score":0.99983597},"labels":[],"label_agreement":null}]}