{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98280555,0.0008369315,0.005499939,0.0004919318,0.00012955623,0.00057062856,0.0024315563,0.0021120037,0.005121884],"genre_scores_gemma":[0.9822947,0.00036784651,0.007971761,0.00039098787,0.00004717498,0.00021520819,0.0064596,0.00015486694,0.002097879],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99202955,0.0034256508,0.00058622216,0.0011210664,0.0024713613,0.0003661606],"domain_scores_gemma":[0.95775926,0.02305366,0.003223213,0.0080533195,0.005307646,0.0026029018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068803295,0.0011144164,0.0007408921,0.0014626217,0.0009332075,0.001191541,0.001763322,0.0013602149,0.0021695793],"category_scores_gemma":[0.04076192,0.00042593654,0.00055333396,0.0014594843,0.0010943167,0.0039705816,0.001917616,0.0021297794,0.002848143],"study_design_candidate":"observational","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.013438816,0.018419215,0.3912421,0.0053740656,0.0013341878,0.0014308799,0.004582566,0.028086293,0.02825967,0.008335781,0.08655436,0.41294205],"study_design_scores_gemma":[0.0020637675,0.026361385,0.5848376,0.0008344638,0.00074859476,0.0037173685,0.0049755652,0.25148222,0.032299206,0.005251021,0.0870175,0.0004112525],"about_ca_topic_score_codex":0.0018984553,"about_ca_topic_score_gemma":0.0022699826,"teacher_disagreement_score":0.0068803295,"about_ca_system_score_codex":0.0010041518,"about_ca_system_score_gemma":0.00072932744,"threshold_uncertainty_score":0.036387086},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016647734,0.0040390627,0.36466166,0.014399314,0.0038988357,0.0006987595,0.006435485,0.041126892,0.54809225],"genre_scores_gemma":[0.19671139,0.005221953,0.19002606,0.0048643774,0.00079441385,0.00070930633,0.011828088,0.00721613,0.5826283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960311,0.00051232346,0.00033857962,0.000821514,0.0019523567,0.00034403746],"domain_scores_gemma":[0.99416566,0.0013523158,0.00036698434,0.001691118,0.001986843,0.00043692457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002367323,0.0009668906,0.00074083277,0.0023617516,0.001939542,0.0040329895,0.0018499232,0.0015996554,0.13988161],"category_scores_gemma":[0.012133765,0.00066239655,0.0007704334,0.0015925977,0.0011419985,0.006295308,0.0042586857,0.0025139565,0.06677171],"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.00044047818,0.000159269,0.0026783012,0.0006283623,0.000048333877,0.0005297999,0.000637141,0.004736774,0.006344552,0.16576879,0.21276976,0.60525835],"study_design_scores_gemma":[0.000048259382,0.000065021515,0.0008540437,0.00022817466,0.000033503526,0.00072649424,0.00017940166,0.016465805,0.0077277482,0.05774765,0.9158495,0.00007440755],"about_ca_topic_score_codex":0.0048470492,"about_ca_topic_score_gemma":0.0043235878,"teacher_disagreement_score":0.13988161,"about_ca_system_score_codex":0.0022422043,"about_ca_system_score_gemma":0.0033828234,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014803408,0.00019380271,0.99078923,0.0012421348,0.000097418444,0.00027124572,0.00019342455,0.0008115328,0.004920832],"genre_scores_gemma":[0.05972962,0.0006086391,0.9335993,0.0005834739,0.00013008327,0.0006657821,0.000397839,0.00012979751,0.004155428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.991602,0.0025107202,0.0012124196,0.0011954827,0.0026603905,0.00081892003],"domain_scores_gemma":[0.99248344,0.002574161,0.00081442035,0.0019510966,0.0015279663,0.0006488434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013279772,0.0011749543,0.0010563511,0.0030512835,0.0039838115,0.008243193,0.004510968,0.0038073598,0.0033952424],"category_scores_gemma":[0.009385096,0.0015378945,0.0042838613,0.0021755365,0.006317408,0.010420196,0.0050770375,0.008125677,0.0013827797],"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.00002388894,0.00006191234,0.00018683236,0.00011355799,0.000029019528,0.00021044926,0.0005697511,0.0067661973,0.001687415,0.9776708,0.002092059,0.010588166],"study_design_scores_gemma":[0.000095968695,0.000114149465,0.00021504263,0.00036027425,0.000118906726,0.000605739,0.0003928207,0.085841164,0.0062992238,0.7809303,0.12489185,0.00013455354],"about_ca_topic_score_codex":0.010175457,"about_ca_topic_score_gemma":0.008388803,"teacher_disagreement_score":0.013279772,"about_ca_system_score_codex":0.0034621828,"about_ca_system_score_gemma":0.009146984,"threshold_uncertainty_score":0.07023096},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032798268,0.0005086791,0.9592837,0.00023132417,0.00004399499,0.0001210575,0.00003703895,0.00011511753,0.0068608117],"genre_scores_gemma":[0.5480566,0.0012662543,0.44714174,0.0001846402,0.000102162776,0.00034364648,0.000092698276,0.00005427444,0.0027579954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979765,0.0010916275,0.00011191811,0.00021505631,0.00045957018,0.00014537373],"domain_scores_gemma":[0.995262,0.0031413129,0.00044768208,0.00074069755,0.00031959033,0.0000886282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027285833,0.0006619548,0.00051820936,0.0008215424,0.0005514793,0.001370762,0.00078028603,0.00078543235,0.002256549],"category_scores_gemma":[0.0065885577,0.0005055587,0.00067254,0.0008975271,0.0019311862,0.0024798221,0.0013622268,0.0011634745,0.00043390956],"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.0001509547,0.00008318228,0.000568186,0.00034056243,0.000055173427,0.00011984693,0.00016989489,0.2302611,0.01572109,0.68189514,0.0008753209,0.06975964],"study_design_scores_gemma":[0.00007268182,0.0005171364,0.00027594945,0.00009693881,0.00004346711,0.0003253725,0.00009051145,0.6773923,0.015091781,0.29685116,0.009178385,0.00006434924],"about_ca_topic_score_codex":0.00016144202,"about_ca_topic_score_gemma":0.00020045851,"teacher_disagreement_score":0.0027285833,"about_ca_system_score_codex":0.00096519524,"about_ca_system_score_gemma":0.0006438111,"threshold_uncertainty_score":0.0144302845},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17761871,0.0008414053,0.8096183,0.00057235564,0.00003379635,0.00025648862,0.00007158332,0.0038774877,0.0071099014],"genre_scores_gemma":[0.8783136,0.00017387571,0.11862035,0.00013079657,0.000023969516,0.00009174174,0.00007335015,0.0001239592,0.0024483765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9881947,0.004896973,0.0006787744,0.0010950877,0.0038307784,0.001303711],"domain_scores_gemma":[0.9734062,0.010554645,0.0030393058,0.008670188,0.0036276737,0.0007019741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011834174,0.0006598221,0.0012158279,0.0015685443,0.0029879936,0.0030205043,0.003283217,0.0016806049,0.0025848732],"category_scores_gemma":[0.025156403,0.00094122405,0.0008598689,0.0016732942,0.0032521293,0.0054439483,0.0025834488,0.0019114082,0.00078394957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010722096,0.000389286,0.00840124,0.00036448138,0.0001906564,0.0005806175,0.0023520964,0.542547,0.019216828,0.20720531,0.003746922,0.21393332],"study_design_scores_gemma":[0.00009545961,0.0001451518,0.00120906,0.000043412354,0.000063477295,0.0002599602,0.00030410226,0.9312798,0.010891735,0.05090398,0.0047268444,0.00007703208],"about_ca_topic_score_codex":0.013344402,"about_ca_topic_score_gemma":0.008145744,"teacher_disagreement_score":0.013344402,"about_ca_system_score_codex":0.0030546363,"about_ca_system_score_gemma":0.00478031,"threshold_uncertainty_score":0.06258583},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05260496,0.0018209554,0.742144,0.0036255505,0.002471833,0.0012966056,0.0011557363,0.0312811,0.16359918],"genre_scores_gemma":[0.63258624,0.0012034051,0.25421947,0.002955451,0.00065145735,0.00061567145,0.0020456668,0.005168003,0.100554645],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9895629,0.0017269962,0.0007261068,0.0018717838,0.0053086574,0.0008035584],"domain_scores_gemma":[0.9625353,0.008617616,0.0029732762,0.01785782,0.0072766636,0.0007393154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006735812,0.0014866514,0.0008369424,0.0021547978,0.0016714368,0.0027635335,0.0034892953,0.0020057573,0.01901607],"category_scores_gemma":[0.037258793,0.0006143692,0.0009998921,0.0008928444,0.0017589529,0.0033904149,0.0032377387,0.0027838133,0.0045327153],"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.0006954972,0.0007000435,0.011549964,0.0013148511,0.00020585392,0.0014341375,0.0018610455,0.02610379,0.03952822,0.21883588,0.06627054,0.6315001],"study_design_scores_gemma":[0.0002344719,0.0007438274,0.007636503,0.00094722566,0.00033291252,0.0025992899,0.0010281267,0.16465572,0.07455687,0.14629275,0.60072803,0.00024430786],"about_ca_topic_score_codex":0.0028109136,"about_ca_topic_score_gemma":0.0036901573,"teacher_disagreement_score":0.01901607,"about_ca_system_score_codex":0.0013956452,"about_ca_system_score_gemma":0.0034117608,"threshold_uncertainty_score":0.063615024},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008464939,0.00042540993,0.9869468,0.0006039563,0.000055470602,0.00024269035,0.0003596918,0.001023764,0.0018772669],"genre_scores_gemma":[0.33446658,0.00038004143,0.661497,0.00022205316,0.0001177579,0.0003749224,0.0008663606,0.00016326582,0.001912044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9886108,0.0065811626,0.0006597639,0.0018222948,0.0019784116,0.00034763536],"domain_scores_gemma":[0.95113784,0.030282766,0.0046137865,0.007494764,0.005365197,0.001105494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010547603,0.0014343883,0.0012509623,0.008343361,0.0011373503,0.006107213,0.004058761,0.0031050516,0.0038310636],"category_scores_gemma":[0.064131364,0.00088060874,0.0015980547,0.0035470275,0.0025596628,0.0076381243,0.006807819,0.0038159364,0.0012301216],"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.0009290891,0.0006148062,0.014833716,0.0010820662,0.0003073118,0.0011898954,0.0039445315,0.13289246,0.016197285,0.15119818,0.007015775,0.6697949],"study_design_scores_gemma":[0.00007600648,0.00017610696,0.0021982144,0.00021748505,0.000079066274,0.00051832886,0.00072629994,0.7566369,0.011185183,0.21634859,0.011735404,0.00010241553],"about_ca_topic_score_codex":0.001343078,"about_ca_topic_score_gemma":0.001681501,"teacher_disagreement_score":0.010547603,"about_ca_system_score_codex":0.0015002163,"about_ca_system_score_gemma":0.0016518869,"threshold_uncertainty_score":0.055781722},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06307198,0.0013656095,0.855419,0.002455152,0.0002228211,0.0006121065,0.0007435733,0.0053286823,0.07078106],"genre_scores_gemma":[0.92561185,0.00082258973,0.05389978,0.00040534354,0.00021124553,0.00033103453,0.0005125317,0.00021987395,0.01798588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98849714,0.0032579924,0.00096669357,0.0018132523,0.0042683585,0.0011965724],"domain_scores_gemma":[0.97618663,0.0071850163,0.0021697655,0.010833165,0.0029098291,0.0007155568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059345253,0.00053439685,0.0010845016,0.001413334,0.0019061309,0.0048383675,0.0019426487,0.0014026086,0.00866898],"category_scores_gemma":[0.02407083,0.0004284622,0.00072740513,0.001942426,0.0022047302,0.0061443876,0.004220088,0.0017422389,0.0023623023],"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.00070469646,0.00024302628,0.010455845,0.0005819513,0.00013580149,0.0006014264,0.003245656,0.033010866,0.03272415,0.5417546,0.015531185,0.3610108],"study_design_scores_gemma":[0.00035780453,0.0005884921,0.0060239756,0.00029956247,0.00021657882,0.0021148534,0.0015659768,0.23307723,0.07976221,0.33764398,0.33809495,0.00025436998],"about_ca_topic_score_codex":0.0040319376,"about_ca_topic_score_gemma":0.0020790861,"teacher_disagreement_score":0.00866898,"about_ca_system_score_codex":0.0019377697,"about_ca_system_score_gemma":0.0021239633,"threshold_uncertainty_score":0.031385124},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32349676,0.0008113303,0.66330767,0.0031640995,0.00011053792,0.00023317961,0.0009873206,0.0009895967,0.0068995575],"genre_scores_gemma":[0.96051097,0.00044125214,0.034903064,0.00031343522,0.000107135354,0.00023284175,0.0008272259,0.000070380585,0.0025936994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973845,0.0012890635,0.000117528434,0.00057332264,0.00033431695,0.0003012848],"domain_scores_gemma":[0.93457514,0.055149667,0.0036865938,0.0034924315,0.0023323835,0.0007638749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007059285,0.0014913348,0.0014966996,0.0018645675,0.0010189934,0.0028313515,0.002153873,0.0017325867,0.0049824584],"category_scores_gemma":[0.048721388,0.0007627873,0.0013283063,0.001418262,0.003086285,0.0060643903,0.002003117,0.0041161305,0.00067508745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005814557,0.00021930465,0.012471102,0.00010151716,0.00009589175,0.00014657038,0.00045259442,0.86775863,0.0006119781,0.08271337,0.0020161758,0.03283146],"study_design_scores_gemma":[0.000010929497,0.000020121583,0.000503937,0.000011558964,0.000008681886,0.000012909426,0.000020985763,0.97458357,0.000090022804,0.024615392,0.00011316065,0.000008817571],"about_ca_topic_score_codex":0.01942134,"about_ca_topic_score_gemma":0.013986564,"teacher_disagreement_score":0.01942134,"about_ca_system_score_codex":0.0022991279,"about_ca_system_score_gemma":0.0010367172,"threshold_uncertainty_score":0.038616598},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5613648,0.00060066493,0.36787868,0.0007724984,0.00024709967,0.0005776498,0.0006422993,0.058197677,0.009718661],"genre_scores_gemma":[0.8900428,0.00008825429,0.10452037,0.0003052038,0.000046194535,0.00006730585,0.00036051573,0.0001517484,0.0044176495],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99956435,0.00008729185,0.0000357574,0.00014627141,0.00013255175,0.000033866952],"domain_scores_gemma":[0.9981213,0.0006672156,0.00018812151,0.0003815327,0.0004715283,0.00017022679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008122168,0.00050774374,0.000599683,0.0009367625,0.00052846276,0.0009879406,0.00066226494,0.0009965997,0.00235208],"category_scores_gemma":[0.00372725,0.00026203212,0.00022817988,0.00037480117,0.00035314087,0.0012753535,0.0010279675,0.0007389386,0.0010447492],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002613671,0.0012727589,0.0222289,0.00058778655,0.00021158742,0.0015657396,0.0018606549,0.009988451,0.23078547,0.005149009,0.0179515,0.70578444],"study_design_scores_gemma":[0.00024491837,0.001739084,0.028840452,0.00009437241,0.00026332148,0.0019099273,0.00041299185,0.802841,0.13606831,0.0063000377,0.021105384,0.00018016093],"about_ca_topic_score_codex":0.0010515503,"about_ca_topic_score_gemma":0.0010720136,"teacher_disagreement_score":0.00235208,"about_ca_system_score_codex":0.00033393936,"about_ca_system_score_gemma":0.00034622225,"threshold_uncertainty_score":0.007868528},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18912217,0.0016199485,0.77957195,0.0026706778,0.00022501472,0.0006680038,0.00016171059,0.0030804505,0.022880083],"genre_scores_gemma":[0.9264441,0.00037618724,0.06957149,0.00034175362,0.00019565888,0.00027829935,0.000074180636,0.00012786046,0.002590369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9828757,0.009548049,0.00075561466,0.0014893644,0.0038370462,0.0014942783],"domain_scores_gemma":[0.8883772,0.068992555,0.011964662,0.02419173,0.0045475406,0.0019263304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0083249295,0.0016757477,0.0020743753,0.003048897,0.002034366,0.0030629113,0.0028195826,0.002771133,0.0029705497],"category_scores_gemma":[0.055045977,0.000710646,0.001014601,0.0021459176,0.006215107,0.013959418,0.006289949,0.0038903183,0.0007643182],"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.0036202294,0.0008854638,0.013549973,0.0008248811,0.0005003295,0.0009764404,0.0019418076,0.16261715,0.0246796,0.4467323,0.0076516694,0.33602014],"study_design_scores_gemma":[0.0002752702,0.0011088353,0.0014971242,0.00014328837,0.00019814984,0.0013247711,0.00027831332,0.7699502,0.021494279,0.19607362,0.0074837254,0.00017234596],"about_ca_topic_score_codex":0.0008548977,"about_ca_topic_score_gemma":0.00086759205,"teacher_disagreement_score":0.0083249295,"about_ca_system_score_codex":0.0015670008,"about_ca_system_score_gemma":0.0023441927,"threshold_uncertainty_score":0.04402697},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050008964,0.00019957051,0.9338478,0.0004343907,0.00010240418,0.0004155632,0.000055758548,0.0020933398,0.0128421625],"genre_scores_gemma":[0.81555575,0.00013669244,0.18027993,0.00018138828,0.000051404175,0.00030600064,0.000090248555,0.00018655777,0.0032120629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9891671,0.0051104543,0.0009647194,0.0012594678,0.0024550725,0.0010432675],"domain_scores_gemma":[0.98075473,0.006053353,0.0015790295,0.008677395,0.001915994,0.0010194251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01020613,0.0005897195,0.0006515628,0.00083955115,0.0013124401,0.0038587581,0.0028970398,0.0013898336,0.0023258962],"category_scores_gemma":[0.020818911,0.00063198654,0.00086155673,0.0005604364,0.0029322752,0.0054248953,0.00312444,0.003021439,0.0008877208],"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.00039045245,0.00048560026,0.0049372623,0.00015943567,0.000111948946,0.00045990272,0.002312558,0.07125163,0.023642525,0.8091792,0.0027705743,0.08429896],"study_design_scores_gemma":[0.00017087949,0.00024523857,0.0008301917,0.00011019098,0.0000813347,0.0005129072,0.0004465266,0.6258885,0.028298035,0.31876495,0.024496993,0.0001542002],"about_ca_topic_score_codex":0.001794499,"about_ca_topic_score_gemma":0.001801923,"teacher_disagreement_score":0.01020613,"about_ca_system_score_codex":0.001417242,"about_ca_system_score_gemma":0.0023209632,"threshold_uncertainty_score":0.05397582},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027497007,0.00034436965,0.9408545,0.0006412038,0.00034011315,0.00017878096,0.000099535726,0.00056437746,0.029480148],"genre_scores_gemma":[0.73936105,0.00081983884,0.23748109,0.00050102983,0.00035288025,0.00037323264,0.00029375267,0.00025295693,0.020564046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99626356,0.0013258792,0.00023514799,0.0004295509,0.0012509363,0.0004949514],"domain_scores_gemma":[0.9972275,0.000799635,0.00025812042,0.0012654369,0.00031166695,0.00013768772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023284748,0.00071860105,0.0008865467,0.0008491384,0.0017291205,0.0024161967,0.0016933389,0.0010606388,0.00415609],"category_scores_gemma":[0.0035825658,0.00034331097,0.0010701377,0.0011281627,0.0021846925,0.006825047,0.0062486306,0.0027478025,0.0012278476],"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.00029255962,0.00007949376,0.00029663675,0.00013259154,0.00004061763,0.00024432898,0.00047112265,0.026268845,0.009789172,0.9105406,0.002546118,0.049297977],"study_design_scores_gemma":[0.00018084301,0.00039676056,0.00028641408,0.00009380912,0.00011197584,0.00076028047,0.00022664868,0.20582743,0.04044259,0.66155475,0.0899849,0.0001336989],"about_ca_topic_score_codex":0.00032746626,"about_ca_topic_score_gemma":0.00030641627,"teacher_disagreement_score":0.00415609,"about_ca_system_score_codex":0.0011896895,"about_ca_system_score_gemma":0.0010386335,"threshold_uncertainty_score":0.013903499},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011011934,0.01685242,0.9000997,0.011002612,0.0011145672,0.000266233,0.00014739088,0.00059576007,0.05890934],"genre_scores_gemma":[0.45938283,0.07313766,0.42318782,0.007391586,0.006631294,0.001060391,0.0006988446,0.00054073177,0.027968911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931764,0.0018209396,0.0003558324,0.0011351069,0.0029379772,0.00057382014],"domain_scores_gemma":[0.9913856,0.003989932,0.0006942685,0.0024389883,0.0012153029,0.00027587215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049847947,0.0017536784,0.0010392709,0.0030558216,0.0018961403,0.0038807641,0.0023748802,0.003201856,0.003356135],"category_scores_gemma":[0.010317382,0.0011342501,0.0009791086,0.0065919226,0.007696569,0.015373372,0.006304804,0.006794818,0.0017587352],"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.00012131795,0.000048769478,0.00064554455,0.00019927502,0.000030352145,0.0002726282,0.00023582128,0.018706176,0.0016654006,0.89413667,0.0075442484,0.07639366],"study_design_scores_gemma":[0.000048055925,0.00021047617,0.0008043636,0.0003273439,0.000055583037,0.0011064443,0.00015040001,0.082684934,0.004276317,0.79439133,0.115854025,0.0000906367],"about_ca_topic_score_codex":0.0030678438,"about_ca_topic_score_gemma":0.001997204,"teacher_disagreement_score":0.0049847947,"about_ca_system_score_codex":0.0038488572,"about_ca_system_score_gemma":0.0023478935,"threshold_uncertainty_score":0.027925491},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04646798,0.0000991095,0.9502381,0.0008548203,0.000024008003,0.00021279459,0.00006948589,0.00063356746,0.0014001741],"genre_scores_gemma":[0.45317045,0.00013786755,0.54435176,0.00022787754,0.00004066168,0.00031210753,0.00026544524,0.00016877908,0.0013249714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9748429,0.012069952,0.001970795,0.0034555406,0.0060344976,0.0016263206],"domain_scores_gemma":[0.96100944,0.02315495,0.0028160142,0.009272354,0.0030837655,0.0006634417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020628713,0.0008010516,0.0015135342,0.0013462694,0.002463954,0.0042824335,0.0031136316,0.0018779562,0.0011265278],"category_scores_gemma":[0.05310071,0.0010452922,0.0019473984,0.0019445033,0.0040088953,0.0074199494,0.005003032,0.003493994,0.0003547893],"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.0004970744,0.00054168404,0.0044996957,0.00036194085,0.00018761252,0.0008942834,0.0016182151,0.33519387,0.012302845,0.4536422,0.0027369813,0.1875235],"study_design_scores_gemma":[0.00007108905,0.00009334629,0.00043878972,0.000051087285,0.000061499566,0.00022021239,0.00040693686,0.7125101,0.015966488,0.26729473,0.0028450906,0.000040600768],"about_ca_topic_score_codex":0.003918868,"about_ca_topic_score_gemma":0.0029452299,"teacher_disagreement_score":0.020628713,"about_ca_system_score_codex":0.0034268247,"about_ca_system_score_gemma":0.005968388,"threshold_uncertainty_score":0.10909635},"labels":[],"label_agreement":null}]}