{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":211,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":211,"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":"8eb74faf2f3e","filters":{"venue":"IACR Cryptology ePrint Archive"}},"results":[{"id":"W34785529","doi":"","title":"Outsourcing Multi-Party Computation.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":174,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Protocol (science); Secure two-party computation; Outsourcing; Computation; Set (abstract data type); Construct (python library); Secure multi-party computation; Standard Model (mathematical formulation); Scheme (mathematics); Computer security; Programming language; Mathematics","authors":[{"name":"Seny Kamara","is_ca":false},{"name":"Payman Mohassel","is_ca":true},{"name":"Mariana Raykova","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04780136964815156,"gpt":0.2858845172483337,"spread":0.2380831476001821,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004303315,0.001013672,0.001395362,0.0007227086,0.00154357,0.003634978,0.002687411,0.001928841,0.01146801],"category_scores_gemma":[0.008896807,0.0007453567,0.001844872,0.001923465,0.003733004,0.007441579,0.007507343,0.004452041,0.002813668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002480262,"about_ca_system_score_gemma":0.002555924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007997425,"about_ca_topic_score_gemma":0.0008491183,"domain_scores_codex":[0.9928353,0.002552562,0.0004396529,0.001142191,0.002349052,0.0006811735],"domain_scores_gemma":[0.9908194,0.002661511,0.000498901,0.00522388,0.0004355694,0.0003606597],"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.00006130982,0.00004791079,0.0003085562,0.0002922555,0.00004139886,0.0001716529,0.0002131391,0.01314001,0.001631191,0.9584835,0.002925335,0.02268388],"study_design_scores_gemma":[0.00003172419,0.00006118766,0.0001836193,0.0001016134,0.00003584709,0.0003921509,0.00009538716,0.122262,0.004338286,0.8295241,0.04294891,0.00002512344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009805077,0.002123821,0.9358369,0.002941051,0.0003652565,0.0004001818,0.000357171,0.0005515987,0.04761893],"genre_scores_gemma":[0.6427596,0.00448968,0.3124824,0.001143689,0.000582651,0.0007098781,0.0007326126,0.0002332093,0.0368663],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01146801,"threshold_uncertainty_score":0.03836435,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2403115307","doi":"","title":"On Verifying Dynamic Multiple Data Copies over Cloud Servers.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cloud Data Security Solutions","field":"Computer Science","cited_by":77,"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; Server; Scalability; Cloud computing; Outsourcing; File server; Computer network; Block (permutation group theory); Cloud storage; Database; Cheating; Service provider; Distributed computing; Service (business); Computer security; Operating system","authors":[{"name":"Ayad Barsoum","is_ca":true},{"name":"M.A. Hasan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0590448383529274,"gpt":0.3044836691374198,"spread":0.2454388307844924,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0176906,0.001629148,0.002349536,0.002235009,0.003773328,0.004417942,0.005627433,0.004827903,0.004199166],"category_scores_gemma":[0.1003157,0.001478001,0.001932296,0.003387994,0.01209909,0.02236681,0.01256095,0.007448563,0.001967831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004767994,"about_ca_system_score_gemma":0.005013249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001239846,"about_ca_topic_score_gemma":0.0009371579,"domain_scores_codex":[0.9629764,0.01262907,0.002564053,0.00410958,0.01531758,0.002403345],"domain_scores_gemma":[0.8330408,0.09971404,0.009999273,0.04898203,0.006633344,0.001630463],"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.00271894,0.0006390166,0.006495855,0.001376861,0.000543342,0.001660178,0.002374537,0.1119562,0.02523131,0.6547847,0.01298085,0.1792382],"study_design_scores_gemma":[0.0006483488,0.0007703193,0.001195059,0.0002543209,0.0002131748,0.002426195,0.0005645273,0.3735743,0.05277369,0.5553918,0.01197417,0.0002140966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03815746,0.0008426247,0.9474008,0.003662905,0.0002568922,0.000530961,0.0003857964,0.001092165,0.007670411],"genre_scores_gemma":[0.7608911,0.001019972,0.2292458,0.001228552,0.0005563005,0.0005799801,0.0006494781,0.0002267849,0.005602096],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0176906,"threshold_uncertainty_score":0.09355795,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2398056013","doi":"","title":"Efficient and Secure Delegation of Linear Algebra.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Homomorphic encryption; Delegation; Computer science; Multiplication (music); Matrix multiplication; Linear algebra; Encryption; Theoretical computer science; Oblivious transfer; Computation; Mathematics; Algorithm; Combinatorics; Computer security","authors":[{"name":"Payman Mohassel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01632441907637648,"gpt":0.2448443606290776,"spread":0.2285199415527011,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004347095,0.0006286926,0.001020493,0.0004895117,0.001838229,0.002614568,0.001993995,0.001271514,0.006419358],"category_scores_gemma":[0.01022207,0.000682499,0.001496331,0.0007934795,0.003751977,0.007330544,0.008556291,0.003077512,0.002363889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002094594,"about_ca_system_score_gemma":0.002481766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000806028,"about_ca_topic_score_gemma":0.000862706,"domain_scores_codex":[0.9921332,0.002422116,0.0004082955,0.001001598,0.002974413,0.001060482],"domain_scores_gemma":[0.9908145,0.001861043,0.0006324141,0.005923641,0.0004119662,0.0003564721],"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.0003675855,0.0002669204,0.001013604,0.0002842868,0.00006793075,0.0003694633,0.0008227943,0.02766299,0.01094178,0.8986954,0.004559259,0.05494805],"study_design_scores_gemma":[0.0001274185,0.0001395728,0.0004887455,0.00004746612,0.00005237351,0.0008012124,0.0001794107,0.1918251,0.03362055,0.752278,0.02037512,0.00006502207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02408859,0.0003009311,0.9619621,0.00076997,0.00008254645,0.0002547523,0.0001615059,0.0007772503,0.01160235],"genre_scores_gemma":[0.7810126,0.0004229823,0.2038186,0.0002856227,0.0001268006,0.000331693,0.0002774983,0.0001702783,0.013554],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006419358,"threshold_uncertainty_score":0.02298993,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3210270412","doi":"","title":"A taxonomy of pairing-friendly elliptic curves","year":2006,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Pairing; Embedding; Elliptic curve; Computer science; Cryptography; Mathematics; Pure mathematics; Theoretical computer science; Physics; Algorithm; Artificial intelligence","authors":[{"name":"David Mandell Freeman","is_ca":false},{"name":"Michael Scott","is_ca":false},{"name":"Edlyn Teske","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01777655156329359,"gpt":0.2360314912774119,"spread":0.2182549397141183,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002568112,0.00152574,0.0009454452,0.005282323,0.003004694,0.004886284,0.001306591,0.002203977,0.003853791],"category_scores_gemma":[0.005663897,0.0006866251,0.001026282,0.005675292,0.003205468,0.009549969,0.004076678,0.003930788,0.002061346],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001040968,"about_ca_system_score_gemma":0.001433824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003177589,"about_ca_topic_score_gemma":0.0001843931,"domain_scores_codex":[0.9961137,0.0008180599,0.0005700936,0.0005424143,0.001475055,0.0004806625],"domain_scores_gemma":[0.9967243,0.0006176837,0.0004636946,0.001108037,0.0006612364,0.0004250737],"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.00003127964,0.00004086589,0.001047017,0.0001705264,0.000008179798,0.0002501261,0.0006244062,0.001266,0.001650083,0.9525014,0.002416689,0.03999345],"study_design_scores_gemma":[0.00002382179,0.000225915,0.001152174,0.0004028792,0.00002267609,0.003752233,0.0006283919,0.006530741,0.003278557,0.7166012,0.2672966,0.00008473123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1087596,0.01496509,0.6969701,0.003759781,0.0008579334,0.001138422,0.001377609,0.001862255,0.1703091],"genre_scores_gemma":[0.4575315,0.02582885,0.4811142,0.001106297,0.0009377572,0.000939131,0.002413059,0.0004200799,0.02970909],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005282323,"threshold_uncertainty_score":0.01358163,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W115500278","doi":"","title":"On the Use of Financial Data as a Random Beacon.","year":2010,"lang":"en","type":"article","venue":"IACR Cryptology ePrint Archive","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","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":"Randomness; Computer science; Random number generation; Cryptography; Beacon; Entropy (arrow of time); Randomness tests; Pseudorandom number generator; Pseudorandomness; Theoretical computer science; Algorithm; Computer network; Statistics; Mathematics","authors":[{"name":"Jeremy Clark","is_ca":true},{"name":"Urs Hengartner","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03695438671327419,"gpt":0.2636028940946578,"spread":0.2266485073813836,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008712056,0.000779088,0.0009573591,0.003230721,0.001767141,0.003555801,0.002360935,0.002383848,0.00842586],"category_scores_gemma":[0.05397967,0.0006612354,0.0007890366,0.003327907,0.00816518,0.01245087,0.004669609,0.003570231,0.002449865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002112818,"about_ca_system_score_gemma":0.001354034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001398855,"about_ca_topic_score_gemma":0.001141415,"domain_scores_codex":[0.991266,0.004017082,0.000335505,0.001062211,0.002816136,0.0005031217],"domain_scores_gemma":[0.9585162,0.02223998,0.003762391,0.01269841,0.002348585,0.0004344833],"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.0001167149,0.00002284954,0.001116783,0.0000739728,0.00002822758,0.0001278619,0.0002596508,0.01489062,0.001782559,0.928335,0.002417732,0.05082807],"study_design_scores_gemma":[0.00004129314,0.0001037656,0.001028385,0.0001727255,0.00004091104,0.0005762665,0.000191449,0.1266624,0.007194406,0.8307151,0.03318499,0.00008837417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02211182,0.0009818519,0.9345795,0.00290718,0.0002275393,0.000196199,0.0003986875,0.0006201869,0.03797699],"genre_scores_gemma":[0.8059054,0.001918353,0.1727409,0.001070548,0.0004838324,0.0005048633,0.0005317681,0.0003153118,0.01652904],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008712056,"threshold_uncertainty_score":0.04607427,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W36205663","doi":"","title":"Attribute-Based Encryption with Key Cloning Protection.","year":2008,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","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 Calgary; University of Waterloo","funders":"","keywords":"Encryption; Computer science; Security token; Computer security; Attribute-based encryption; Probabilistic encryption; Scheme (mathematics); Key (lock); Ciphertext; Delegation; Theoretical computer science; Public-key cryptography; Mathematics; Law; Political science","authors":[{"name":"M. Jason Hinek","is_ca":true},{"name":"Shaoquan Jiang","is_ca":true},{"name":"Reihaneh Safavi–Naini","is_ca":true},{"name":"Siamak F. Shahandashti","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02518052485577259,"gpt":0.2350324610392741,"spread":0.2098519361835015,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004131737,0.0003790733,0.0009175744,0.0005600778,0.001106233,0.00305589,0.00210178,0.001688205,0.002933627],"category_scores_gemma":[0.01059909,0.0003677574,0.0009820758,0.001727764,0.002328573,0.006911322,0.003337952,0.003448555,0.001453663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001385529,"about_ca_system_score_gemma":0.001361673,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000252824,"about_ca_topic_score_gemma":0.00014125,"domain_scores_codex":[0.9940886,0.002043774,0.0005220467,0.0005740868,0.002402662,0.0003687574],"domain_scores_gemma":[0.9896498,0.002889271,0.001191505,0.005143914,0.0007771464,0.0003484263],"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.0003184881,0.00007976145,0.0009405894,0.0002807051,0.00006989783,0.0004187238,0.0004108047,0.008419075,0.009112581,0.9345555,0.003107261,0.04228676],"study_design_scores_gemma":[0.0001968385,0.0002558675,0.0007659587,0.0002049029,0.0001744495,0.003132701,0.0002085037,0.1693002,0.04767739,0.6903412,0.0876549,0.00008694215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02426779,0.001678428,0.9588352,0.001674621,0.0003769029,0.0002329206,0.000218443,0.000429378,0.01228633],"genre_scores_gemma":[0.7902995,0.001333208,0.1956628,0.0006599223,0.000281811,0.0002965408,0.0002956781,0.00006192072,0.01110858],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004131737,"threshold_uncertainty_score":0.02185094,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2396907655","doi":"","title":"Re-Encryption-Based Key Management Towards Secure and Scalable Mobile Applications in Clouds.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","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; Cloud computing; Mobile cloud computing; Encryption; Client-side encryption; Scalability; Computer security; Mobile device; Key management; Cloud computing security; Computer network; Distributed computing; On-the-fly encryption; Database; Operating system","authors":[{"name":"Piotr K. Tysowski","is_ca":true},{"name":"M. Anwarul Hasan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01521569710605519,"gpt":0.2575426950589091,"spread":0.242326997952854,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001224987,0.0004999533,0.000636973,0.0004361576,0.0009471537,0.002262691,0.001567204,0.0008930775,0.002110443],"category_scores_gemma":[0.002218336,0.0002746426,0.0004837393,0.0008362322,0.001020975,0.003708049,0.001924604,0.001496648,0.001013079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00146117,"about_ca_system_score_gemma":0.001312693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001934499,"about_ca_topic_score_gemma":0.001768329,"domain_scores_codex":[0.9990185,0.0002532184,0.00007487913,0.0001240614,0.000326591,0.0002026713],"domain_scores_gemma":[0.9987691,0.0002595422,0.0001536687,0.0004136215,0.0003185732,0.00008540545],"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.000829972,0.0003020888,0.001801807,0.0004880717,0.0001338002,0.001111798,0.0004956753,0.2989369,0.07426333,0.4127789,0.02208328,0.1867743],"study_design_scores_gemma":[0.00006329779,0.00008215376,0.000222909,0.00004138849,0.00002640845,0.0003391978,0.0001124228,0.9046177,0.02301928,0.05165675,0.01979483,0.00002359705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03064708,0.002195924,0.9580167,0.001286098,0.0002755444,0.000241805,0.0001039212,0.001109304,0.006123574],"genre_scores_gemma":[0.8403679,0.001238138,0.152486,0.0003052175,0.0001371455,0.0001381141,0.0001367078,0.0001014412,0.005089394],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002262691,"threshold_uncertainty_score":0.01060152,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2399698160","doi":"","title":"Scalable, Server-Passive, User-Anonymous Timed Release Public Key Encryption from Bilinear Pairing.","year":2004,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","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 Toronto","funders":"","keywords":"Computer science; Scalability; Anonymity; Computer network; Communication source; Encryption; Network Time Protocol; Key (lock); Public-key cryptography; Broadcast encryption; Computer security; Scheme (mathematics); Operating system","authors":[{"name":"Ian F. Blake","is_ca":true},{"name":"Aldar C.-F. Chan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01804911491935102,"gpt":0.2395105284474859,"spread":0.2214614135281349,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002455401,0.0004890915,0.000740338,0.0004041562,0.0009045718,0.001688433,0.001534294,0.001091177,0.003864608],"category_scores_gemma":[0.004403793,0.0003680773,0.0007827276,0.001059627,0.001239322,0.007855402,0.004436546,0.002283783,0.001912823],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007457884,"about_ca_system_score_gemma":0.001255666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001505143,"about_ca_topic_score_gemma":0.0001788263,"domain_scores_codex":[0.9974836,0.0007394849,0.000180098,0.0002506014,0.001068907,0.0002773544],"domain_scores_gemma":[0.9970911,0.0006119458,0.0003240251,0.001565618,0.0002535339,0.0001538638],"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.0006381233,0.0001643046,0.0005878293,0.0003704787,0.0000740047,0.0006380307,0.0005392048,0.02456398,0.02729161,0.8604378,0.008424496,0.07627024],"study_design_scores_gemma":[0.0002745197,0.0005154505,0.0004555263,0.00009571692,0.0001058156,0.001936948,0.0002305408,0.2557838,0.05405728,0.6056595,0.08077744,0.000107536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0123402,0.0004298735,0.9753224,0.0005282288,0.0001819662,0.0002687166,0.0001591213,0.0006123908,0.01015703],"genre_scores_gemma":[0.670956,0.000743595,0.3064179,0.0003690285,0.0002820915,0.0006202307,0.0005018228,0.0001674391,0.01994202],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003864608,"threshold_uncertainty_score":0.01298553,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2949485271","doi":"","title":"Public Key Encryption with Keyword Search Revisited.","year":2005,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Scheme (mathematics); Encryption; Inefficiency; Keyword search; Key (lock); Computer security; Public-key cryptography; Channel (broadcasting); Theoretical computer science; Information retrieval; Computer network; Mathematics","authors":[{"name":"Joonsang Baek","is_ca":false},{"name":"Reihaneh Safavi–Naini","is_ca":true},{"name":"Willy Susilo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03917362331164062,"gpt":0.263392807182281,"spread":0.2242191838706404,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002372024,0.0004756804,0.0008394855,0.0007018366,0.001050382,0.002777568,0.001490836,0.002414234,0.004463182],"category_scores_gemma":[0.00878737,0.0004074007,0.0005360924,0.002044964,0.002982969,0.01510957,0.003164611,0.004430247,0.002455046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001695221,"about_ca_system_score_gemma":0.001655914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004388395,"about_ca_topic_score_gemma":0.0003455412,"domain_scores_codex":[0.996256,0.001270426,0.0002813178,0.0004399394,0.001366705,0.0003856044],"domain_scores_gemma":[0.9964474,0.001402284,0.0003618758,0.001313789,0.0003861947,0.0000886037],"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.00008839933,0.00001566929,0.00009993712,0.0001698231,0.00001035475,0.0001979261,0.0001443222,0.001469111,0.001581315,0.9611328,0.005227791,0.02986243],"study_design_scores_gemma":[0.00006681777,0.00008189854,0.0001608739,0.0001078528,0.00002602972,0.002443352,0.0001792733,0.01951756,0.006621053,0.880613,0.09014352,0.00003882466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02816547,0.03459835,0.6878684,0.03855845,0.003309102,0.0003341249,0.0005760986,0.0006082908,0.2059817],"genre_scores_gemma":[0.8265107,0.01337934,0.107143,0.004631328,0.002028602,0.0002589338,0.0003815057,0.0001484267,0.04551817],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004463182,"threshold_uncertainty_score":0.0149309,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W181112729","doi":"","title":"A 32-bit RC4-like Keystream Generator.","year":2005,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":37,"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":"Keystream; RC4; Computer science; Generator (circuit theory); Stream cipher; Self-shrinking generator; Randomness; Encryption; Bit (key); Software; State (computer science); Algorithm; Computer hardware; Cryptography; Mathematics; Power (physics); Computer network; Electrical engineering; Operating system; Induction generator; Engineering","authors":[{"name":"Yassir Nawaz","is_ca":true},{"name":"Kishan Chand Gupta","is_ca":true},{"name":"Guang Gong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01928593122520285,"gpt":0.2828424928633809,"spread":0.263556561638178,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007387383,0.0005604249,0.0003727187,0.0005184883,0.000293445,0.0004574193,0.001022182,0.0008550778,0.007956197],"category_scores_gemma":[0.00245329,0.0002740298,0.0004341868,0.0003944057,0.0004818745,0.001148937,0.0007448075,0.0008425011,0.00338452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004081935,"about_ca_system_score_gemma":0.0004136921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001348443,"about_ca_topic_score_gemma":0.0001359494,"domain_scores_codex":[0.9992067,0.0002174226,0.00006247129,0.0001272056,0.0002995346,0.00008673875],"domain_scores_gemma":[0.9987333,0.0003746636,0.0001315497,0.0003855172,0.0003069006,0.00006803848],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00240424,0.00021807,0.002751789,0.0008895019,0.0001906456,0.001297113,0.0003492757,0.02884215,0.4614718,0.108376,0.01582338,0.3773861],"study_design_scores_gemma":[0.0005875697,0.001685144,0.002292553,0.0001223413,0.0001856113,0.005010365,0.00007684123,0.2741775,0.5602985,0.04284986,0.1124664,0.0002472739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07802496,0.0007951713,0.9037241,0.0006881148,0.000584094,0.0006485708,0.0006682005,0.004548263,0.01031847],"genre_scores_gemma":[0.5846743,0.0002820469,0.3934149,0.0004565183,0.0001452184,0.0005788979,0.001210433,0.0004337118,0.01880398],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007956197,"threshold_uncertainty_score":0.02661616,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3029452169","doi":"","title":"Another Look at \"Provable Security\". II.","year":2004,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":33,"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; Provable security; Computer security; Cryptography","authors":[{"name":"Neal Koblitz","is_ca":false},{"name":"Alfred Menezes","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01645337355455491,"gpt":0.2709123745534825,"spread":0.2544590009989276,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004658083,0.0009906561,0.0009517962,0.001911906,0.002612788,0.006181344,0.002177724,0.004797489,0.01692264],"category_scores_gemma":[0.00936196,0.0005233033,0.001717636,0.001461941,0.01903079,0.01998308,0.003752173,0.01518465,0.003058041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004527772,"about_ca_system_score_gemma":0.001309155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001073249,"about_ca_topic_score_gemma":0.0006790633,"domain_scores_codex":[0.9953359,0.002631051,0.00012207,0.0004281802,0.001112478,0.0003703803],"domain_scores_gemma":[0.9954923,0.002862163,0.0002187164,0.0008133067,0.0004440614,0.0001694342],"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.000004817306,0.000003748203,0.00001253725,0.00002554881,0.00000208958,0.000007534021,0.00005038549,0.0001203001,0.00005541199,0.9961622,0.002303231,0.001252271],"study_design_scores_gemma":[0.00000365407,0.000005674834,0.00002042503,0.00002937594,0.000002422745,0.0000166814,0.0000386509,0.0003590074,0.00009858422,0.9895527,0.009869984,0.000002751618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.008035493,0.01973195,0.3555928,0.1508538,0.005191448,0.00008284161,0.0003535521,0.0006987305,0.4594594],"genre_scores_gemma":[0.7799264,0.01400733,0.08974586,0.03594471,0.006982342,0.0004189487,0.0005650063,0.001153369,0.07125605],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.01692264,"threshold_uncertainty_score":0.05661184,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2950596278","doi":"","title":"Privacy-aware Attribute-based Encryption with User Accountability.","year":2009,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":29,"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":"Ciphertext; Attribute-based encryption; Computer science; Encryption; Computer security; Access control; Accountability; Key (lock); Scheme (mathematics); Public-key cryptography; Access structure; Cryptography; Secret sharing; Mathematics; Political science","authors":[{"name":"Jin Li","is_ca":false},{"name":"Kui Ren","is_ca":false},{"name":"Bo Zhu","is_ca":true},{"name":"Zhiguo Wan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01708966988669608,"gpt":0.2629797871105366,"spread":0.2458901172238405,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003145861,0.0004823276,0.0007506283,0.0005772318,0.001166813,0.002590467,0.001715088,0.001389328,0.002444202],"category_scores_gemma":[0.00630902,0.000382814,0.00100836,0.001462381,0.001958613,0.006867338,0.004699274,0.003932287,0.001389698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009149458,"about_ca_system_score_gemma":0.001783897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002723947,"about_ca_topic_score_gemma":0.0002796449,"domain_scores_codex":[0.9950725,0.001607262,0.0003457522,0.0004084355,0.002117655,0.000448284],"domain_scores_gemma":[0.9951695,0.001183704,0.0004809624,0.002492317,0.0004566002,0.0002169634],"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.0001824727,0.00008250927,0.0004517233,0.0001609666,0.00003372117,0.0002688367,0.0002522772,0.007099672,0.006763815,0.939651,0.00471258,0.0403404],"study_design_scores_gemma":[0.00008759733,0.0001475645,0.0004724699,0.0000868419,0.00007609143,0.001605719,0.0001169817,0.1506109,0.02926487,0.7187306,0.09872901,0.00007136413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007925552,0.0005439207,0.9773405,0.001079517,0.0002036045,0.0001691865,0.0001939396,0.0004448569,0.01209885],"genre_scores_gemma":[0.6430013,0.001321185,0.3368638,0.0007631562,0.0003443607,0.0004181071,0.0004781674,0.00009920367,0.01671073],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003145861,"threshold_uncertainty_score":0.01663709,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2949439822","doi":"","title":"Cryptographic hash functions from expander graphs.","year":2006,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Hash function; Collision resistance; Expander graph; Ramanujan's sum; Rolling hash; Double hashing; Cryptographic hash function; Discrete mathematics; SWIFFT; Mathematics; SHA-2; Computer science; Graph; Combinatorics","authors":[{"name":"Denis Charles","is_ca":false},{"name":"Eyal Z. Goren","is_ca":false},{"name":"Kristin Lauter","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01506809800087223,"gpt":0.2339711279922226,"spread":0.2189030299913503,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001686274,0.000572087,0.0004533613,0.001000495,0.0007630883,0.001282972,0.001190084,0.000983395,0.008074233],"category_scores_gemma":[0.005981603,0.0004837296,0.0008065297,0.00088391,0.001547551,0.005401725,0.002271284,0.002159353,0.001523256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001100132,"about_ca_system_score_gemma":0.0006573185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002570993,"about_ca_topic_score_gemma":0.0003912178,"domain_scores_codex":[0.9981116,0.0006130639,0.00005712136,0.0002706266,0.0007343785,0.0002132324],"domain_scores_gemma":[0.995152,0.002540094,0.0003056331,0.001558175,0.0003152092,0.0001289012],"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.0007208238,0.000218729,0.001305855,0.0003539309,0.00006936272,0.0003489561,0.000473363,0.0526145,0.0375431,0.7747852,0.006598714,0.1249676],"study_design_scores_gemma":[0.0001347492,0.0003725974,0.0007172259,0.00005821909,0.0000533088,0.0006357164,0.0001569866,0.2100528,0.06836101,0.6934212,0.02597029,0.00006585132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1303106,0.0006581168,0.8354807,0.00153505,0.0001841239,0.0005012056,0.0005446573,0.002624273,0.02816116],"genre_scores_gemma":[0.8056872,0.000493091,0.180229,0.0006216674,0.0001455242,0.000398591,0.0009485545,0.0003218129,0.01115451],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008074233,"threshold_uncertainty_score":0.02701098,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3212030079","doi":"","title":"Iron: Functional Encryption using Intel SGX","year":2016,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Security and Verification in Computing","field":"Computer Science","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; Guard (computer science); Cryptographic primitive; Cryptography; Encryption; Context (archaeology); Theoretical computer science; Functional encryption; Construct (python library); Cryptographic protocol; Computer security; Programming language; Ciphertext","authors":[{"name":"Ben Fisch","is_ca":false},{"name":"Dhinakaran Vinayagamurthy","is_ca":true},{"name":"Dan Boneh","is_ca":false},{"name":"S. Gorbunov","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05872375147886557,"gpt":0.2922273820116055,"spread":0.2335036305327399,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009877115,0.0006080023,0.0003650408,0.0004575852,0.0004571239,0.001062657,0.0009839615,0.0006928213,0.007541839],"category_scores_gemma":[0.001858993,0.0003535266,0.0004981613,0.0002400189,0.001295827,0.002801433,0.001547174,0.001256008,0.002286154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008933861,"about_ca_system_score_gemma":0.0007952209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008824008,"about_ca_topic_score_gemma":0.00099712,"domain_scores_codex":[0.9992649,0.000143565,0.00005323986,0.0001064836,0.0002955163,0.0001362742],"domain_scores_gemma":[0.9993818,0.0001254697,0.00005853865,0.0002984035,0.0001038901,0.00003189908],"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.001177718,0.0001979227,0.002180741,0.0004052609,0.0000454917,0.0004409308,0.000586246,0.01662734,0.03642327,0.7044913,0.05405114,0.1833726],"study_design_scores_gemma":[0.0003279437,0.0009690332,0.001841716,0.0002688218,0.0001036345,0.001369393,0.0001360546,0.2437806,0.1481633,0.2630764,0.3398428,0.0001202419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05975805,0.0006817808,0.8336356,0.0009364483,0.0002395668,0.0003262794,0.0008073024,0.03588612,0.0677289],"genre_scores_gemma":[0.7833315,0.0003505206,0.184037,0.0005658993,0.00007798117,0.000218368,0.00142061,0.001215613,0.02878263],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007541839,"threshold_uncertainty_score":0.02522993,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2403185010","doi":"","title":"Imperfect Decryption and an Attack on the NTRU Encryption Scheme.","year":2003,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":21,"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":"NTRU; Padding; Computer science; Cryptosystem; Encryption; Public-key cryptography; Computer security; Theoretical computer science","authors":[{"name":"John Proos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04247813839381644,"gpt":0.3088640541697436,"spread":0.2663859157759271,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001768416,0.0004901717,0.0007634432,0.0005702866,0.001171477,0.001403389,0.0005324843,0.002393264,0.002360235],"category_scores_gemma":[0.007185609,0.0003469169,0.0008930639,0.0005590849,0.00228153,0.004693928,0.002569743,0.002517261,0.000771158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001154289,"about_ca_system_score_gemma":0.0005246151,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007453006,"about_ca_topic_score_gemma":0.0005507247,"domain_scores_codex":[0.9973344,0.0008994911,0.0001116855,0.000221464,0.0009550027,0.0004780101],"domain_scores_gemma":[0.9957111,0.002285262,0.0004345881,0.001259331,0.0001742021,0.0001354966],"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.001057339,0.0001166079,0.001419888,0.0001301965,0.00009744106,0.003078949,0.0008220174,0.02447617,0.01576798,0.9167336,0.007847259,0.02845263],"study_design_scores_gemma":[0.0002404879,0.0003332564,0.002372943,0.0001828893,0.0001024231,0.006930613,0.0003218694,0.311094,0.04999904,0.5967533,0.03155623,0.0001129909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4163954,0.002559089,0.3370368,0.0121657,0.0006741546,0.0002780608,0.0005627569,0.00108939,0.2292387],"genre_scores_gemma":[0.9728822,0.0005104133,0.01695405,0.0003896261,0.00009259494,0.00004799929,0.00008230625,0.00003553538,0.009005216],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002393264,"threshold_uncertainty_score":0.009352386,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2950443886","doi":"","title":"Pass-thoughts: Authenticating With Our Minds.","year":2005,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":21,"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":"Computer science; Status quo; Brain–computer interface; Human–computer interaction; Space (punctuation); Interface (matter); Authentication (law); Computer security; Psychology; Neuroscience","authors":[{"name":"Julie Thorpe","is_ca":true},{"name":"Paul C. van Oorschot","is_ca":true},{"name":"Anil Somayaji","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01701529740211745,"gpt":0.2679101938523389,"spread":0.2508948964502214,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002364449,0.0007700242,0.0004133326,0.0009231071,0.002174481,0.004409289,0.001323817,0.002757967,0.01614477],"category_scores_gemma":[0.01265261,0.0004099868,0.0008600315,0.0006217157,0.00860719,0.01151334,0.005252681,0.003265821,0.007184864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008801479,"about_ca_system_score_gemma":0.0008141175,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004232212,"about_ca_topic_score_gemma":0.000414603,"domain_scores_codex":[0.997573,0.001046322,0.0001341879,0.0003967637,0.0006635081,0.0001863901],"domain_scores_gemma":[0.9954791,0.001515179,0.0004726978,0.001666439,0.0004921966,0.000374307],"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.0001884267,0.00003061343,0.0004762277,0.0001704072,0.00002168312,0.0002042857,0.002470843,0.0008556955,0.003030653,0.8894964,0.01328009,0.08977459],"study_design_scores_gemma":[0.00004295624,0.0001473291,0.0004786915,0.0001403423,0.00003975202,0.001053573,0.0008385939,0.008245569,0.007743898,0.781643,0.199568,0.00005828008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01876592,0.004182436,0.7876111,0.01519322,0.002316902,0.0003401709,0.00026656,0.002566421,0.1687572],"genre_scores_gemma":[0.5995086,0.003515511,0.2842932,0.005049083,0.001561173,0.0006278623,0.0004434333,0.0004600418,0.1045411],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01614477,"threshold_uncertainty_score":0.05400968,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2495523385","doi":"","title":"Resource Fairness and Composability of Cryptographic Protocols.","year":2005,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; Universal composability; Composability; Impossibility; Commit; Protocol (science); Cryptography; Cryptographic primitive; Proof-of-work system; Cryptographic protocol; Computer security; Secure multi-party computation; Resource (disambiguation); Theoretical computer science; Distributed computing; Computer network; Cryptocurrency","authors":[{"name":"Juan A. Garay","is_ca":true},{"name":"Manoj Prabhakaran","is_ca":false},{"name":"Ke Yang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01821921392728335,"gpt":0.2822069954822428,"spread":0.2639877815549594,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007584075,0.00101212,0.0008192401,0.001264957,0.002808564,0.003066376,0.001983405,0.001662695,0.005142455],"category_scores_gemma":[0.01503761,0.0007355263,0.001794216,0.001140056,0.007982665,0.008658696,0.004299025,0.0043307,0.0008369715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002710157,"about_ca_system_score_gemma":0.002160717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001743885,"about_ca_topic_score_gemma":0.0009570982,"domain_scores_codex":[0.9930099,0.0024091,0.0005605667,0.001271353,0.002073625,0.0006755606],"domain_scores_gemma":[0.9900865,0.004880024,0.001001853,0.002880499,0.0006700585,0.0004810503],"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.00004837476,0.00001942822,0.000150714,0.00003837053,0.00001235512,0.00007881664,0.0002019057,0.007264717,0.001012638,0.9851245,0.0003232409,0.00572506],"study_design_scores_gemma":[0.0000332175,0.00004471758,0.0001159228,0.00003647839,0.00003692134,0.0001400116,0.00005491007,0.0522071,0.004379901,0.9308497,0.01208258,0.00001851257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02193255,0.0006074524,0.9503958,0.001268285,0.0002761514,0.0001615543,0.00008434457,0.0005938245,0.02468015],"genre_scores_gemma":[0.8057753,0.0005941014,0.1779431,0.0005197048,0.0004043132,0.00045487,0.0002041727,0.0003107741,0.01379378],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007584075,"threshold_uncertainty_score":0.04010892,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2479395603","doi":"","title":"Authenticated Network Time Synchronization","year":2015,"lang":"en","type":"article","venue":"IACR Cryptology ePrint Archive","topic":"Network Time Synchronization Technologies","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Network Time Protocol; Computer science; Key exchange; Synchronization (alternating current); Authentication (law); Cryptography; Public-key cryptography; Computer network; Computer security; Key (lock); Time synchronization; Encryption","authors":[{"name":"Benjamin Dowling","is_ca":false},{"name":"Douglas Stebila","is_ca":true},{"name":"Greg Zaverucha","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01273441275611105,"gpt":0.2235404354263354,"spread":0.2108060226702244,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003496244,0.0006461183,0.0006183968,0.0009091435,0.001354779,0.00274113,0.002362238,0.001479479,0.004547456],"category_scores_gemma":[0.01007608,0.0004614578,0.0008632594,0.001068146,0.002767764,0.005329652,0.003713384,0.002548223,0.001366472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001920469,"about_ca_system_score_gemma":0.00222213,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007295955,"about_ca_topic_score_gemma":0.0005858517,"domain_scores_codex":[0.9950287,0.00137093,0.0003755234,0.0009706369,0.001822051,0.0004321242],"domain_scores_gemma":[0.9921696,0.00186643,0.0010069,0.003427966,0.001274759,0.0002544],"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.0002709497,0.00005105229,0.0005756816,0.0001832226,0.00004253867,0.0002823558,0.000477529,0.04010766,0.01515614,0.8934497,0.003824403,0.04557877],"study_design_scores_gemma":[0.000182552,0.0003257667,0.000367374,0.0001425028,0.0001164872,0.0007789248,0.0001785272,0.435084,0.04890831,0.3900769,0.1237279,0.0001105993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009625827,0.0002014486,0.9784278,0.0002678595,0.0001667183,0.0001280745,0.0001172056,0.001105812,0.009959335],"genre_scores_gemma":[0.5898463,0.0008396254,0.3932796,0.0003728394,0.0003486171,0.0005533894,0.0005912719,0.0003538969,0.01381451],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004547456,"threshold_uncertainty_score":0.01849014,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3031052868","doi":"","title":"Squaring in cyclotomic subgroups.","year":2010,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"French Language Learning Methods","field":"Social Sciences","cited_by":18,"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":"Mathematics; Computer science; Arithmetic","authors":[{"name":"Koray Karabina","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02348332380350394,"gpt":0.3467552850420604,"spread":0.3232719612385564,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006640004,0.00043187,0.0004237876,0.000857133,0.0005806405,0.001110381,0.0005214785,0.0005557151,0.007931452],"category_scores_gemma":[0.004782834,0.0001680323,0.0005627262,0.0007499633,0.001353291,0.002620658,0.001391729,0.001167524,0.001212831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005689144,"about_ca_system_score_gemma":0.0003707779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002042878,"about_ca_topic_score_gemma":0.0003040513,"domain_scores_codex":[0.9993601,0.0001229244,0.00005558744,0.0001310586,0.0002452568,0.00008497779],"domain_scores_gemma":[0.9986816,0.0005416282,0.0001595779,0.0003683361,0.0001758636,0.00007310134],"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.0006063555,0.0001275375,0.001654875,0.0003252707,0.00004005184,0.0004646438,0.0005995714,0.01416078,0.03177554,0.6993752,0.007681591,0.2431885],"study_design_scores_gemma":[0.0001222528,0.000470177,0.0008364618,0.0000982044,0.00005557758,0.001125649,0.0002365477,0.08654,0.04613743,0.8380569,0.026259,0.00006182809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3341348,0.001187787,0.6271971,0.001282815,0.0005316339,0.0003116204,0.0004600144,0.001589754,0.03330449],"genre_scores_gemma":[0.8543722,0.0003451226,0.1358158,0.0003683016,0.0002731566,0.0001019349,0.0003698706,0.000184461,0.008169139],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007931452,"threshold_uncertainty_score":0.02653331,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3185400193","doi":"10.48550/arxiv.2004.02264","title":"PrivFL: Practical Privacy-preserving Federated Regressions on High-dimensional Data over Mobile Networks","year":2020,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":17,"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; Homomorphic encryption; Encryption; Protocol (science); Federated learning; Information privacy; Semantic security; Scheme (mathematics); Robustness (evolution); Computer network; Machine learning; Artificial intelligence; Computer security; Public-key cryptography","authors":[{"name":"Kalikinkar Mandal","is_ca":true},{"name":"Guang Gong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07637538680421993,"gpt":0.3490333168209711,"spread":0.2726579300167511,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005190976,0.000877868,0.001199421,0.0004956597,0.00100348,0.001806904,0.002454356,0.001933563,0.001682147],"category_scores_gemma":[0.01662051,0.0006102266,0.0009920445,0.0008137026,0.001692695,0.005685015,0.005242871,0.002861069,0.0008633783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001060792,"about_ca_system_score_gemma":0.001526289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001331108,"about_ca_topic_score_gemma":0.001175897,"domain_scores_codex":[0.9954248,0.001982379,0.0002692937,0.0008758877,0.001023325,0.0004242831],"domain_scores_gemma":[0.9914427,0.003490943,0.0007110987,0.003704989,0.0004624157,0.0001877531],"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.001259231,0.0003301312,0.00389973,0.0002242101,0.0001674519,0.0006948819,0.000585456,0.6778781,0.01569733,0.08626457,0.008222296,0.2047766],"study_design_scores_gemma":[0.00003473894,0.00005164765,0.0001955931,0.000008275676,0.000007019042,0.00008567481,0.00003015482,0.9660868,0.005405868,0.02720499,0.0008749772,0.00001428071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02596013,0.0001192938,0.9688292,0.0004589768,0.00002452742,0.0000604323,0.0001566586,0.003819037,0.0005719538],"genre_scores_gemma":[0.8515768,0.0001521886,0.1445615,0.0003909005,0.00004771039,0.0001806669,0.0004626353,0.0002337961,0.00239373],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005190976,"threshold_uncertainty_score":0.02745289,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2185939662","doi":"","title":"Asynchronous Distributed Private-Key Generators for Identity-Based Cryptography","year":2009,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":17,"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":"Random oracle; Computer science; Asynchronous communication; Scheme (mathematics); Encryption; The Internet; Public-key cryptography; Key (lock); Computer security; Bilinear interpolation; Cryptography; Protocol (science); Computer network; Theoretical computer science; Distributed computing; Mathematics; World Wide Web","authors":[{"name":"Aniket Kate","is_ca":true},{"name":"Ian Goldberg","is_ca":true},{"name":"David R. Cheriton","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01574802926459836,"gpt":0.2727249808000736,"spread":0.2569769515354753,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003551761,0.001079783,0.0009486841,0.000937212,0.001505461,0.002686601,0.001879757,0.001959299,0.007724358],"category_scores_gemma":[0.00620797,0.0006232535,0.0009445943,0.001826933,0.002723778,0.00682086,0.002907708,0.005977536,0.003595213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002011999,"about_ca_system_score_gemma":0.0016875,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002725613,"about_ca_topic_score_gemma":0.0002922149,"domain_scores_codex":[0.9962198,0.001732777,0.0002248272,0.0004522244,0.001180216,0.0001901949],"domain_scores_gemma":[0.9969454,0.001245436,0.0001935058,0.001136749,0.0003543939,0.0001245114],"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.00004877501,0.00004088899,0.00008170257,0.0001105896,0.000006832591,0.00007112754,0.00009047721,0.002820102,0.001718414,0.9641011,0.004556375,0.02635349],"study_design_scores_gemma":[0.00007772778,0.00008988763,0.00008489039,0.0001024229,0.00001840857,0.0002389971,0.00003554672,0.05819068,0.003693272,0.8470643,0.09036479,0.00003913821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001937551,0.001569887,0.9794041,0.001106094,0.0003662812,0.0002184294,0.00007268989,0.000435202,0.01488974],"genre_scores_gemma":[0.1822784,0.00401658,0.7927732,0.0008602655,0.001266562,0.001163899,0.0004905347,0.0002599006,0.01689069],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007724358,"threshold_uncertainty_score":0.02584052,"prediction_status":"machine_predicted_unvalidated"},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"agree"},{"id":"W2397122158","doi":"","title":"Setting Speed Records with the (Fractional) Multibase Non-Adjacent Form Method for Efficient Elliptic Curve Scalar Multiplication.","year":2008,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":16,"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":"Scalar multiplication; Precomputation; Scalar (mathematics); Elliptic curve; Complex multiplication; Jacobian matrix and determinant; Mathematics; Computer science; Generalization; Speedup; Algorithm; Arithmetic; Applied mathematics; Pure mathematics; Parallel computing; Mathematical analysis; Geometry","authors":[{"name":"Patrick Longa","is_ca":true},{"name":"Catherine H. Gebotys","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01474522547207931,"gpt":0.2799320463613278,"spread":0.2651868208892486,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006512245,0.0004781591,0.0003620732,0.0007848955,0.0004815602,0.0008052741,0.0006091383,0.000456337,0.006718246],"category_scores_gemma":[0.00323095,0.0001542613,0.0003412503,0.0006605639,0.0004542971,0.002102901,0.001124528,0.0008276658,0.00246277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002866217,"about_ca_system_score_gemma":0.0005859634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003394176,"about_ca_topic_score_gemma":0.0004178896,"domain_scores_codex":[0.9994411,0.0001231445,0.00003629953,0.00007721548,0.0002688139,0.00005336587],"domain_scores_gemma":[0.999173,0.0002264104,0.00007209761,0.0003339481,0.0001567189,0.00003786469],"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.0006681166,0.0001366905,0.001515905,0.000289704,0.00004342737,0.0002457805,0.0003995575,0.02053943,0.06796241,0.1300747,0.008341339,0.769783],"study_design_scores_gemma":[0.0001886361,0.00105209,0.0020354,0.0001862184,0.00007327141,0.001967315,0.0002756492,0.6436734,0.1610102,0.08776278,0.101648,0.0001270203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06576034,0.001065629,0.9197942,0.0001855556,0.0002466676,0.0001259026,0.0000712945,0.001741822,0.01100852],"genre_scores_gemma":[0.362797,0.000556953,0.6271174,0.00009002406,0.0001182053,0.0001255449,0.0001808636,0.0002740134,0.00874008],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006718246,"threshold_uncertainty_score":0.02247477,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2890774540","doi":"","title":"On Post-Modern Cryptography.","year":2006,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Triviality; Cryptography; Relevance (law); Computer science; Quarter (Canadian coin); Point (geometry); Epistemology; Computer security; Mathematics; Mathematical economics; Philosophy; Law; Pure mathematics; Political science; History","authors":[{"name":"Oded Goldreich","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009665921524565033,"gpt":0.244235066854762,"spread":0.234569145330197,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002224863,0.0004513106,0.0002709494,0.00111978,0.00192632,0.003315889,0.0006039718,0.002930847,0.01004284],"category_scores_gemma":[0.00529295,0.0001832027,0.0002874323,0.000815879,0.01104999,0.009075474,0.002111141,0.005365436,0.003654299],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003204284,"about_ca_system_score_gemma":0.001126538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000748506,"about_ca_topic_score_gemma":0.0008049372,"domain_scores_codex":[0.9983457,0.0006076523,0.00005292746,0.0002214305,0.0005775025,0.0001947327],"domain_scores_gemma":[0.9980927,0.0008971857,0.0001559472,0.0004499854,0.0003252926,0.00007888261],"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.000004887606,0.000002635213,0.00003145846,0.00001747577,0.000001241948,0.000009859414,0.0001144202,0.00003815796,0.00003249729,0.9874599,0.007854791,0.004432679],"study_design_scores_gemma":[0.000005570399,0.00001166139,0.0001804979,0.0001218991,0.00000188567,0.00009575737,0.0001204278,0.0001939657,0.0001929668,0.6854759,0.3135931,0.000006365188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.008828955,0.08435815,0.01869558,0.1248467,0.00866866,0.00003095908,0.0001359348,0.0001059536,0.7543291],"genre_scores_gemma":[0.5593417,0.06727735,0.008703233,0.04863093,0.01856459,0.0001399774,0.000171157,0.0002600261,0.296911],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.01004284,"threshold_uncertainty_score":0.03359669,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126852669","doi":"","title":"An Efficient Identification Protocol and the Knowledge-of-Exponent Assumption.","year":2007,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":13,"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":"Identification (biology); Computer science; Protocol (science); Exponent; Simple (philosophy); Adversary; Algorithm; Theoretical computer science; Computer security; Medicine","authors":[{"name":"Jiang Wu","is_ca":false},{"name":"Douglas R. Stinson","is_ca":true},{"name":"David R. Cheriton","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02027962401737626,"gpt":0.3545070374627575,"spread":0.3342274134453813,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006233471,0.0008171994,0.001091133,0.0009727963,0.001835777,0.0028812,0.002979552,0.003812572,0.005381992],"category_scores_gemma":[0.01677798,0.0006772708,0.001250221,0.001178653,0.004946601,0.01470171,0.008308511,0.005863854,0.002547395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009848188,"about_ca_system_score_gemma":0.001917365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002005271,"about_ca_topic_score_gemma":0.0001070336,"domain_scores_codex":[0.9922776,0.002641896,0.0005382906,0.001600319,0.002375416,0.0005662884],"domain_scores_gemma":[0.982976,0.007243915,0.001568703,0.006681125,0.001058577,0.0004717254],"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.0002057754,0.0001091848,0.0004021773,0.0002728729,0.00007646835,0.0003805397,0.0004225995,0.004313578,0.007544015,0.9561719,0.002679091,0.02742164],"study_design_scores_gemma":[0.0001692358,0.0003209189,0.000499479,0.0001829455,0.0001381701,0.001689176,0.000214175,0.07210215,0.02566239,0.8516005,0.04726522,0.0001557316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01654757,0.0006204098,0.9582938,0.001896736,0.00040074,0.0003965951,0.0002321054,0.0004362719,0.02117574],"genre_scores_gemma":[0.6709892,0.00113648,0.304035,0.001241656,0.0004443394,0.0008786974,0.0006154674,0.0001351605,0.02052401],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006233471,"threshold_uncertainty_score":0.03296614,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3031215330","doi":"","title":"Some observations on the theory of cryptographic hash functions.","year":2001,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":13,"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":"Hash function; Random oracle; Collision resistance; Security of cryptographic hash functions; Cryptographic hash function; Computer science; Oracle; SWIFFT; Function (biology); Theoretical computer science; SHA-2; Cryptography; Cryptographic primitive; Collision attack; Mathematics; Double hashing; Algorithm; Computer security; Cryptographic protocol; Encryption; Programming language; Public-key cryptography","authors":[{"name":"Douglas R. Stinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05900874040137442,"gpt":0.2818161552245252,"spread":0.2228074148231508,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005965978,0.001174709,0.001210025,0.002105041,0.003030516,0.00464358,0.002327893,0.003907748,0.01496089],"category_scores_gemma":[0.01826837,0.001141901,0.001940035,0.003034503,0.01192223,0.02006168,0.005508248,0.0106636,0.003243629],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002678822,"about_ca_system_score_gemma":0.00138784,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009860359,"about_ca_topic_score_gemma":0.0005954721,"domain_scores_codex":[0.9956555,0.001328896,0.0002343963,0.0007562871,0.001670421,0.0003543517],"domain_scores_gemma":[0.9852356,0.01102379,0.000584018,0.00193311,0.0009522179,0.000271337],"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.00001753112,0.00002255052,0.0001160203,0.0001458408,0.00001302959,0.00006708019,0.0001641105,0.001398654,0.0002207269,0.9885471,0.002986165,0.006301322],"study_design_scores_gemma":[0.0000128243,0.00002544066,0.0001137416,0.00006325441,0.000008172753,0.0001524572,0.00004969415,0.002506385,0.000330637,0.9778891,0.01883312,0.00001528139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02367925,0.04033556,0.6654788,0.03936158,0.003814884,0.0001765632,0.0007356685,0.0004821851,0.2259356],"genre_scores_gemma":[0.6245473,0.07542627,0.2065004,0.02170415,0.02105856,0.0006084167,0.001456862,0.0005243597,0.04817372],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01496089,"threshold_uncertainty_score":0.05004913,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2579035965","doi":"","title":"Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck.","year":2016,"lang":"en","type":"article","venue":"IACR Cryptology ePrint Archive","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Proof complexity; Mathematical proof; Oracle; Constant (computer programming); Mathematics; Sublinear function; Satisfiability; Combinatorial proof; Discrete mathematics; Gas meter prover; Upper and lower bounds; Computer science","authors":[{"name":"Eli Ben‐Sasson","is_ca":false},{"name":"Alessandro Chiesa","is_ca":false},{"name":"Ariel Gabizon","is_ca":false},{"name":"Michael Riabzev","is_ca":false},{"name":"Nicholas Spooner","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02470146613603537,"gpt":0.2633926433495877,"spread":0.2386911772135523,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007324484,0.001326168,0.001263103,0.001659089,0.001697817,0.005314163,0.003702719,0.001629171,0.01513751],"category_scores_gemma":[0.0502837,0.001631696,0.002471312,0.002253298,0.004648379,0.01833715,0.009310593,0.006029871,0.003967475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002815238,"about_ca_system_score_gemma":0.003570306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00090238,"about_ca_topic_score_gemma":0.00104875,"domain_scores_codex":[0.9823194,0.00479679,0.001019272,0.003150521,0.007096583,0.001617383],"domain_scores_gemma":[0.9362177,0.04124262,0.004141264,0.01414473,0.002714289,0.001539399],"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.0006373317,0.0002350509,0.001870569,0.0008863313,0.000206861,0.0004348743,0.0009959234,0.02174001,0.01356412,0.8451068,0.007548918,0.1067731],"study_design_scores_gemma":[0.0001103037,0.0001465657,0.0003772797,0.00009065233,0.0001431581,0.0004053846,0.00008797502,0.0817107,0.01659919,0.8851769,0.01508364,0.00006823872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02018777,0.001028225,0.9536757,0.001367651,0.0001664982,0.0003348321,0.000667859,0.003815801,0.0187555],"genre_scores_gemma":[0.4759992,0.0009012978,0.505924,0.001056056,0.00050242,0.0005141629,0.001205684,0.001563429,0.01233375],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01513751,"threshold_uncertainty_score":0.05064005,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2401020796","doi":"","title":"A Cryptanalysis of HummingBird-2: The Differential Sequence Analysis.","year":2012,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":12,"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":"Block cipher; Computer science; Key (lock); Differential cryptanalysis; Cipher; Cryptanalysis; Theoretical computer science; Sequence (biology); Algorithm; Differential (mechanical device); Symmetric-key algorithm; Encryption; Cryptography; Computer security; Public-key cryptography","authors":[{"name":"Qi Chai","is_ca":false},{"name":"Guang Gong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04197999025954345,"gpt":0.3194083773701073,"spread":0.2774283871105638,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007641292,0.0005018751,0.0004059428,0.0007433252,0.0004174292,0.0006400998,0.0004899076,0.0006278738,0.002348377],"category_scores_gemma":[0.003371443,0.0002018754,0.0005540575,0.0003941018,0.001043797,0.001185194,0.001028033,0.0007123486,0.0005244376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006888132,"about_ca_system_score_gemma":0.0005569864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001947743,"about_ca_topic_score_gemma":0.0001936623,"domain_scores_codex":[0.9990043,0.0002725475,0.00003563774,0.000148675,0.0004312083,0.0001077094],"domain_scores_gemma":[0.9988979,0.0004274757,0.0001669804,0.0003045032,0.0001456484,0.00005753576],"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.001759645,0.0002168571,0.006792096,0.0004984566,0.0003810427,0.001852835,0.0006042951,0.0878246,0.235294,0.4371663,0.008667577,0.2189424],"study_design_scores_gemma":[0.0001224742,0.0007819941,0.003179594,0.0000861888,0.0001001877,0.003102227,0.00009867431,0.6014608,0.2350714,0.1395354,0.0163688,0.00009224477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3171384,0.00086866,0.6655972,0.0009315909,0.0003019623,0.0002060592,0.0002563498,0.0008384151,0.01386136],"genre_scores_gemma":[0.9377824,0.0001933691,0.05612328,0.0002088427,0.00005680916,0.00005023236,0.0001313097,0.00003649902,0.005417226],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002348377,"threshold_uncertainty_score":0.007856071,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3037557713","doi":"","title":"Uncloneable Quantum Encryption via Oracles","year":2019,"lang":"en","type":"article","venue":"IACR Cryptology ePrint Archive","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Encryption; Computer science; Theoretical computer science; Pseudorandom function family; Probabilistic encryption; Quantum cryptography; Random oracle; Cryptography; Quantum; Quantum information; Algorithm; Computer security; Public-key cryptography; Physics; Quantum mechanics","authors":[{"name":"Anne Broadbent","is_ca":true},{"name":"Sébastien Lord","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005727296969806965,"gpt":0.2157169969128803,"spread":0.2099896999430733,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002624406,0.0006715254,0.0007762904,0.0007657763,0.0007797008,0.002800263,0.001752791,0.001614085,0.00607451],"category_scores_gemma":[0.007465186,0.0005102166,0.001071679,0.0006283559,0.005065124,0.008932161,0.004666174,0.003885126,0.001403191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001420749,"about_ca_system_score_gemma":0.001098404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004872093,"about_ca_topic_score_gemma":0.0004263505,"domain_scores_codex":[0.9968994,0.0009057138,0.0002281685,0.0005154997,0.0009324479,0.0005188145],"domain_scores_gemma":[0.9953479,0.002321238,0.0003661957,0.001322618,0.0004094609,0.0002326372],"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.00004256183,0.00001587578,0.0000784067,0.00003422164,0.000003787143,0.00005419049,0.00009645255,0.002489807,0.001348955,0.9925395,0.0002822325,0.003014015],"study_design_scores_gemma":[0.00004261815,0.00006352933,0.0001027149,0.00005365003,0.00001621046,0.0002142754,0.00004971579,0.07930622,0.01429334,0.8980253,0.007793837,0.00003864034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08898608,0.0006968774,0.8650012,0.002021648,0.00018119,0.0001552311,0.0002456198,0.0006001323,0.04211206],"genre_scores_gemma":[0.8722796,0.0006317066,0.112431,0.0004780707,0.0001059158,0.0002172876,0.0002023316,0.0002335762,0.01342043],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00607451,"threshold_uncertainty_score":0.02032131,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3030978102","doi":"","title":"Exact Maximum Expected Differential and Linear Probability for 2-Round Advanced Encryption Standard (AES).","year":2005,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Mount Allison University","funders":"","keywords":"Linear cryptanalysis; Block cipher; Advanced Encryption Standard; Upper and lower bounds; Encryption; Mathematics; Differential cryptanalysis; Differential (mechanical device); Impossible differential cryptanalysis; Value (mathematics); Provable security; Computer science; Algorithm; Statistics; Computer security; Physics; Mathematical analysis","authors":[{"name":"Liam Keliher","is_ca":true},{"name":"Jiayuan Sui","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02407413391174426,"gpt":0.3070008694113259,"spread":0.2829267354995816,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00873248,0.002182348,0.002404644,0.002991577,0.001347793,0.004911072,0.004088631,0.003255563,0.009946045],"category_scores_gemma":[0.05512751,0.001535999,0.002633036,0.00251574,0.005524178,0.01281751,0.006099265,0.006738903,0.002432105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004995561,"about_ca_system_score_gemma":0.002566729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007256475,"about_ca_topic_score_gemma":0.0009086516,"domain_scores_codex":[0.9925138,0.002323879,0.0003178213,0.00138999,0.002111783,0.001342589],"domain_scores_gemma":[0.9534851,0.0364909,0.00263215,0.004474882,0.0016756,0.001241438],"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.001012071,0.0001685921,0.001878207,0.0009543161,0.0002218137,0.0004998787,0.0003916098,0.1482812,0.003966472,0.7928701,0.01111958,0.03863607],"study_design_scores_gemma":[0.00006223775,0.00009050058,0.0007326657,0.0001233968,0.00005553518,0.0003832436,0.00004305102,0.2900444,0.002765131,0.7034246,0.002217727,0.00005755337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03831261,0.006218432,0.9177925,0.003543886,0.0004209366,0.0001603387,0.0009029943,0.000990082,0.03165828],"genre_scores_gemma":[0.8880284,0.004355385,0.0946039,0.001307593,0.001179819,0.0004845102,0.0008965782,0.00039805,0.008745863],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009946045,"threshold_uncertainty_score":0.04618233,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2950244776","doi":"","title":"Performance and Security Improvements for Tor: A Survey.","year":2015,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":10,"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":"Anonymity; Computer science; Software deployment; Computer security; State (computer science); Network security; Point (geometry); Dozen; Internet privacy; Operating system","authors":[{"name":"Mashael AlSabah","is_ca":false},{"name":"Ian Goldberg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0259892599939159,"gpt":0.2749678279110856,"spread":0.2489785679171697,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006823086,0.00152971,0.001883295,0.003581793,0.001493264,0.002926623,0.002472865,0.001737344,0.0116903],"category_scores_gemma":[0.02083471,0.000652346,0.00100851,0.00580347,0.001436515,0.008954315,0.002701415,0.003040239,0.004460062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002745062,"about_ca_system_score_gemma":0.00189998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001328588,"about_ca_topic_score_gemma":0.001453831,"domain_scores_codex":[0.9932505,0.001475838,0.0003783407,0.0008327006,0.003051569,0.001011033],"domain_scores_gemma":[0.986029,0.00787127,0.0007950902,0.002212137,0.00258174,0.0005107843],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000708916,0.000272899,0.003565818,0.00381885,0.0001552472,0.0001275676,0.0001577738,0.01887208,0.002811647,0.05365336,0.09332489,0.8225309],"study_design_scores_gemma":[0.0001792765,0.002028487,0.009341801,0.003134698,0.0005954943,0.00417072,0.001356903,0.1484953,0.01706318,0.0992194,0.7141256,0.0002891238],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.04163303,0.7457132,0.08764863,0.01584897,0.003866673,0.0002753759,0.001472758,0.003078227,0.1004631],"genre_scores_gemma":[0.5262564,0.4058777,0.040817,0.002853884,0.004598542,0.0002435816,0.003343719,0.001136586,0.0148726],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.0116903,"threshold_uncertainty_score":0.03910804,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2951981597","doi":"","title":"Provisions: Privacy-preserving proofs of solvency for Bitcoin exchanges.","year":2015,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":10,"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":"Solvency; Mathematical proof; Computer science; Computer security; Extension (predicate logic); Business; Cover (algebra); Function (biology); Finance; Mathematics; Market liquidity; Engineering","authors":[{"name":"Gaby G. Dagher","is_ca":true},{"name":"Benedikt Bünz","is_ca":false},{"name":"Joseph Bonneau","is_ca":false},{"name":"Jeremy Clark","is_ca":true},{"name":"Dan Boneh","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04102507242458837,"gpt":0.302501910919838,"spread":0.2614768384952496,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008271293,0.0009175757,0.0007691288,0.001066725,0.001950335,0.004804214,0.002495522,0.002301013,0.01116381],"category_scores_gemma":[0.05206187,0.001262423,0.001366635,0.001054208,0.005697368,0.01208573,0.008581906,0.007543059,0.003652296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001641107,"about_ca_system_score_gemma":0.00306814,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000738391,"about_ca_topic_score_gemma":0.000640001,"domain_scores_codex":[0.989576,0.003811124,0.0006053435,0.001051245,0.004146257,0.0008100035],"domain_scores_gemma":[0.9621595,0.02163126,0.002763379,0.01069283,0.001791814,0.0009611033],"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.0005973623,0.0001732728,0.0007736703,0.0004378405,0.00007424831,0.0004501176,0.0009546049,0.01197358,0.009666274,0.8852695,0.01574865,0.07388075],"study_design_scores_gemma":[0.0003697285,0.0002711501,0.0004753244,0.0002365543,0.00009383913,0.0005767709,0.0002070774,0.06492775,0.02998356,0.8286616,0.07408999,0.0001065266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01449699,0.000324993,0.9617419,0.002181093,0.0003472385,0.0006657144,0.000572484,0.003949074,0.01572067],"genre_scores_gemma":[0.5880776,0.000718067,0.387099,0.001201177,0.0005596228,0.0008269979,0.0009459346,0.001187524,0.01938397],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01116381,"threshold_uncertainty_score":0.04374331,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2395604259","doi":"","title":"Secure Computation with Sublinear Amortized Work.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Bell (Canada)","funders":"","keywords":"Sublinear function; Secure two-party computation; Computer science; Computation; Secure multi-party computation; Protocol (science); Theoretical computer science; Function (biology); Simple (philosophy); Security parameter; Algorithm; Cryptography; Mathematics; Discrete mathematics","authors":[{"name":"Steven Gordon","is_ca":false},{"name":"Jonathan Katz","is_ca":false},{"name":"Vladimir Kolesnikov","is_ca":false},{"name":"Tal Malkin","is_ca":false},{"name":"Mariana Raykova","is_ca":true},{"name":"Yevgeniy Vahlis","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0223179254063797,"gpt":0.2463094695259464,"spread":0.2239915441195667,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005551507,0.002176481,0.001982663,0.00166398,0.002536782,0.006274738,0.004352768,0.003015556,0.01467301],"category_scores_gemma":[0.0136419,0.001177205,0.003626091,0.00275034,0.0057345,0.02028453,0.00989207,0.005074918,0.005400199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004482387,"about_ca_system_score_gemma":0.003988706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006642403,"about_ca_topic_score_gemma":0.0008657521,"domain_scores_codex":[0.989073,0.002405279,0.0008082213,0.002061087,0.004089224,0.00156311],"domain_scores_gemma":[0.976486,0.006474583,0.001135871,0.01445793,0.0007862669,0.0006593458],"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.002268064,0.0003273185,0.0009012928,0.0006216819,0.0002435242,0.0002498429,0.0004259953,0.04607416,0.01726325,0.8614157,0.009028596,0.06118067],"study_design_scores_gemma":[0.0003010641,0.0001767302,0.0002018288,0.00006448018,0.0001406999,0.0003080123,0.0000770448,0.1855929,0.01982919,0.7813154,0.01193146,0.00006118045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03453591,0.0008199465,0.93211,0.003370361,0.0002450731,0.0006891334,0.0008118528,0.004466984,0.02295072],"genre_scores_gemma":[0.6212865,0.0008786927,0.3518468,0.0008426898,0.0003723963,0.001829149,0.001391653,0.001558808,0.01999334],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01467301,"threshold_uncertainty_score":0.04908603,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2407643022","doi":"","title":"How to Compress (Reusable) Garbled Circuits.","year":2013,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Ciphertext; IBM; Key (lock); Computer science; Encryption; Homomorphic encryption; Learning with errors; Electronic circuit; Multilinear map; Scheme (mathematics); Functional encryption; Multiplicative function; Boolean circuit; Theoretical computer science; Security parameter; Arithmetic; Algorithm; Mathematics; Computer network; Logic gate; Computer security; Electrical engineering; Engineering","authors":[{"name":"Craig Gentry","is_ca":false},{"name":"S. Gorbunov","is_ca":true},{"name":"Shai Halevi","is_ca":false},{"name":"Vinod Vaikuntanathan","is_ca":false},{"name":"Dhinakaran Vinayagamurthy","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02216625853187726,"gpt":0.2505621489034478,"spread":0.2283958903715705,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037775,0.001402299,0.001664154,0.001174235,0.001099262,0.003705427,0.002243826,0.002417342,0.0123165],"category_scores_gemma":[0.03578157,0.0008042714,0.001606654,0.001566323,0.002995139,0.01957505,0.00444811,0.004007993,0.003413463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001822224,"about_ca_system_score_gemma":0.001585388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004508701,"about_ca_topic_score_gemma":0.000415783,"domain_scores_codex":[0.9960376,0.0009118653,0.0003546854,0.0008667641,0.001354187,0.0004749142],"domain_scores_gemma":[0.9799682,0.00882384,0.001284794,0.008347494,0.001177239,0.0003984649],"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.000870903,0.000149159,0.001295705,0.001124005,0.0001381275,0.0003461713,0.0007719198,0.06314105,0.02411002,0.7167602,0.007232237,0.1840605],"study_design_scores_gemma":[0.0001074079,0.0003059913,0.0002594689,0.0003153967,0.0001064351,0.0006161918,0.0002207766,0.08280316,0.0345834,0.8558099,0.02479556,0.00007625695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05846735,0.002157927,0.9163908,0.003704951,0.0004325634,0.0004594371,0.0007789967,0.003314016,0.01429383],"genre_scores_gemma":[0.6593477,0.002599755,0.3167165,0.00165565,0.0004036741,0.0009572024,0.001417439,0.001246414,0.01565568],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0123165,"threshold_uncertainty_score":0.04120278,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W173447543","doi":"","title":"On the use of Continued Fractions for Stream Ciphers.","year":2009,"lang":"en","type":"article","venue":"IACR Cryptology ePrint Archive","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":9,"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":"Stream cipher; Computer science; Key (lock); Key schedule; Cryptanalysis; Cryptography; Stream cipher attack; Theoretical computer science; Algorithm; Arithmetic; Mathematics; Computer security; Differential cryptanalysis","authors":[{"name":"Amadou Moctar Kane","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04822066608377977,"gpt":0.2781522351455353,"spread":0.2299315690617555,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001725517,0.001045817,0.0006086729,0.001585835,0.0008608908,0.001764347,0.0005042994,0.0009361936,0.004918247],"category_scores_gemma":[0.005082563,0.0003204055,0.0008618852,0.0008855129,0.004055097,0.006368674,0.00193001,0.002310707,0.001862404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007196204,"about_ca_system_score_gemma":0.0004949612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002819849,"about_ca_topic_score_gemma":0.0002984079,"domain_scores_codex":[0.9987584,0.0004649854,0.00008851875,0.0001619713,0.0004600136,0.00006606043],"domain_scores_gemma":[0.997818,0.001461056,0.0001283471,0.0004072885,0.0001504513,0.00003480284],"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.0000417343,0.00001185065,0.0001005102,0.0001282942,0.00001655409,0.0001089806,0.0001567506,0.002009304,0.002498605,0.9486785,0.001366464,0.04488238],"study_design_scores_gemma":[0.00004312067,0.0001574866,0.0001229373,0.0001725585,0.00003245861,0.0007746417,0.00004834844,0.01417327,0.008349508,0.8721473,0.1039226,0.00005575166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01243034,0.02542842,0.8768063,0.002162356,0.001486114,0.0001896473,0.00009811843,0.0005261597,0.08087254],"genre_scores_gemma":[0.4177831,0.04249193,0.4915119,0.001838987,0.002919048,0.0004212939,0.0002126098,0.0004599524,0.04236123],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004918247,"threshold_uncertainty_score":0.01645321,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2907648450","doi":"","title":"EzPC: Programmable, Efficient, and Scalable Secure Two-Party Computation for Machine Learning","year":2017,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Correctness; Scalability; Secure multi-party computation; Compiler; Computation; Oblivious transfer; Theoretical computer science; Programming language; Operating system","authors":[{"name":"Nishanth Chandran","is_ca":false},{"name":"Divya Gupta","is_ca":false},{"name":"Shardul Tripathi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02202174771668337,"gpt":0.2977916640176854,"spread":0.275769916301002,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00199245,0.0007026979,0.0005314357,0.000539813,0.0007980578,0.001757042,0.001507947,0.000886507,0.00619343],"category_scores_gemma":[0.004546601,0.0004733169,0.0007177353,0.0005997968,0.001724786,0.003580281,0.003514749,0.002785986,0.001701508],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000812177,"about_ca_system_score_gemma":0.002100007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006802684,"about_ca_topic_score_gemma":0.0008577813,"domain_scores_codex":[0.9981926,0.0005169155,0.0001051913,0.0002643997,0.0006778775,0.0002429466],"domain_scores_gemma":[0.9980021,0.0006590944,0.0001162988,0.001021196,0.0001303789,0.00007081126],"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.0005179086,0.0002016495,0.0008405381,0.0004091789,0.00008121186,0.0002482134,0.0003018642,0.1082071,0.02429963,0.7143396,0.01361883,0.1369343],"study_design_scores_gemma":[0.0001266411,0.0001400198,0.0001934898,0.00006241888,0.00003784088,0.0001699213,0.00004670667,0.6174449,0.04635648,0.3119229,0.02345392,0.00004467948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01237223,0.0001841204,0.9743373,0.0003642073,0.00005414838,0.0002316207,0.0002027407,0.006570069,0.00568347],"genre_scores_gemma":[0.5628347,0.0004288688,0.4265169,0.0003542503,0.00008081355,0.0007151021,0.0007780993,0.00111883,0.007172429],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00619343,"threshold_uncertainty_score":0.02071911,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2949376982","doi":"","title":"Combinatorial Properties of Frameproof and Traceability Codes.","year":2000,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Copyright and Intellectual Property","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University; University of Waterloo","funders":"","keywords":"Computer science; Traceability; Disjoint sets; Hash function; Combinatorial design; Coding (social sciences); Theoretical computer science; Order (exchange); Discrete mathematics; Mathematics; Computer security","authors":[{"name":"Jessica Staddon","is_ca":false},{"name":"Douglas R. Stinson","is_ca":true},{"name":"Ruizhong Wei","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02797596289779946,"gpt":0.2209522293025324,"spread":0.1929762664047329,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002545776,0.0009370231,0.0009316356,0.002287739,0.002873512,0.00668386,0.001624488,0.002128125,0.01543768],"category_scores_gemma":[0.01723727,0.0009049273,0.001495026,0.003590232,0.006300912,0.00954234,0.002911586,0.004369244,0.002187983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003677932,"about_ca_system_score_gemma":0.001956105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001750993,"about_ca_topic_score_gemma":0.001208071,"domain_scores_codex":[0.9966063,0.0009291614,0.0001869394,0.0006674687,0.001118344,0.0004917716],"domain_scores_gemma":[0.9810145,0.01250884,0.002189815,0.00201185,0.001228539,0.001046422],"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.00003237974,0.00002024629,0.0001978567,0.00004087421,0.000005643194,0.00005759907,0.0001243169,0.002021339,0.0003638634,0.9909922,0.001484671,0.004658967],"study_design_scores_gemma":[0.00001966082,0.0000236747,0.0001634526,0.00002391752,0.00001315726,0.0002032827,0.00007458551,0.007051803,0.0009005289,0.9855154,0.005993909,0.00001672694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.128498,0.001637431,0.6664636,0.006639044,0.0003426481,0.000383455,0.002623506,0.0005020564,0.1929104],"genre_scores_gemma":[0.8380696,0.002110565,0.1102034,0.001226439,0.0007904256,0.0008432819,0.002885109,0.0003909627,0.04348017],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01543768,"threshold_uncertainty_score":0.05164421,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3193336782","doi":"","title":"Functional Encryption: New Perspectives and Lower Bounds.","year":2012,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Functional encryption; Encryption; Computer science; Theoretical computer science; Computation; Exploit; Key (lock); Upper and lower bounds; Computer security; Algorithm; Mathematics; Ciphertext","authors":[{"name":"Shweta Agrawal","is_ca":false},{"name":"S. Gorbunov","is_ca":true},{"name":"Vinod Vaikuntanathan","is_ca":true},{"name":"Hoeteck Wee","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02247108557450471,"gpt":0.2501553859783875,"spread":0.2276843004038828,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01212747,0.002496239,0.001852896,0.003153979,0.002611794,0.00801531,0.003598693,0.004724821,0.007197801],"category_scores_gemma":[0.03778247,0.001111253,0.003054228,0.00268374,0.01218456,0.03377746,0.009087459,0.02160809,0.002098489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005487445,"about_ca_system_score_gemma":0.001803879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006695598,"about_ca_topic_score_gemma":0.0004122678,"domain_scores_codex":[0.9857103,0.004701349,0.0007966922,0.002225029,0.005311311,0.001255417],"domain_scores_gemma":[0.954504,0.03478793,0.001677588,0.005839577,0.00215834,0.001032601],"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.0000228406,0.00001794134,0.0000934287,0.00008204266,0.000009436441,0.00002390075,0.00008042575,0.002007168,0.0003310762,0.9928283,0.0006742233,0.003829125],"study_design_scores_gemma":[0.000007981304,0.00003448711,0.00006068814,0.00007998987,0.00001428048,0.00007230088,0.0000361557,0.01619561,0.0009686098,0.975908,0.006605269,0.00001662952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01306054,0.01417533,0.9056695,0.01133722,0.0007337003,0.00007019914,0.0001801248,0.0002285376,0.05454485],"genre_scores_gemma":[0.7068206,0.01806703,0.2472168,0.005522154,0.003472294,0.0007503424,0.0005977096,0.0006952629,0.01685784],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01212747,"threshold_uncertainty_score":0.06413698,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2951754992","doi":"","title":"Resilient Aggregation in Simple Linear Sensor Networks.","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":7,"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":"Wireless sensor network; Computer science; Computer network; Aggregate (composite); Base station; Key distribution in wireless sensor networks; Simple (philosophy); Protocol (science); Node (physics); Wireless; Wireless network; Telecommunications; Engineering","authors":[{"name":"Kevin Henry","is_ca":true},{"name":"Douglas R. Stinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01424304818891629,"gpt":0.2647413245042318,"spread":0.2504982763153155,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002227585,0.0007863948,0.0008003947,0.0009636167,0.0009306032,0.001226926,0.001203323,0.001072239,0.002062472],"category_scores_gemma":[0.009046176,0.0004781564,0.0008245725,0.001046641,0.002646749,0.003642687,0.003186284,0.001542871,0.0006627476],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001155479,"about_ca_system_score_gemma":0.0005706419,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004916068,"about_ca_topic_score_gemma":0.0003640136,"domain_scores_codex":[0.9982033,0.0006438104,0.0001100269,0.0002962222,0.0005970949,0.0001495454],"domain_scores_gemma":[0.9948826,0.003096429,0.0007179937,0.0008941876,0.0002875078,0.0001213895],"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.000410773,0.00008389592,0.0009912954,0.0008057139,0.0001418234,0.0006800721,0.0005893267,0.3929184,0.0153802,0.5209804,0.006611496,0.06040667],"study_design_scores_gemma":[0.00006106309,0.0001845029,0.0002443243,0.0000687525,0.00004365252,0.0004136448,0.00007468425,0.5938572,0.005812589,0.3908401,0.008357573,0.00004192916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04259059,0.002495442,0.9390704,0.001532468,0.0003120586,0.0002767741,0.0001797582,0.001301502,0.01224102],"genre_scores_gemma":[0.8485193,0.0021111,0.1408703,0.0006763662,0.0002977042,0.0003795581,0.0001997782,0.0001118311,0.006834151],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002227585,"threshold_uncertainty_score":0.01178074,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2950781338","doi":"","title":"Efficient Hardware Implementations of the Warbler Pseudorandom Number Generator.","year":2015,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":7,"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":"Pseudorandom number generator; Application-specific integrated circuit; Computer science; CMOS; Computer hardware; Embedded system; Electronic engineering; Engineering; Algorithm","authors":[{"name":"Gangqiang Yang","is_ca":true},{"name":"Mark D. Aagaard","is_ca":false},{"name":"Guang Gong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03076629392048703,"gpt":0.3129129739134178,"spread":0.2821466799929307,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003201484,0.0005765741,0.0002249412,0.0005903465,0.0001726432,0.0004237092,0.00108991,0.0003093634,0.005286344],"category_scores_gemma":[0.0007845916,0.0001820874,0.0001900752,0.0002984312,0.0002183145,0.0007452587,0.000324854,0.0003269362,0.001352095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003811095,"about_ca_system_score_gemma":0.0004548498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002564247,"about_ca_topic_score_gemma":0.0008170397,"domain_scores_codex":[0.9996178,0.0001149704,0.00002674716,0.00004524783,0.0001366197,0.00005873714],"domain_scores_gemma":[0.9995145,0.0001290048,0.0001111092,0.0001177564,0.0001078462,0.00001979613],"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.001602709,0.0003822442,0.003640118,0.001037638,0.000146955,0.0006842933,0.0003328837,0.05001851,0.4136409,0.04686639,0.009456566,0.4721908],"study_design_scores_gemma":[0.0004782438,0.001939498,0.002077173,0.00008984932,0.000109023,0.001236813,0.00009141651,0.3838448,0.5563788,0.0065335,0.04715746,0.00006334786],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2250158,0.001135614,0.7516893,0.0003449837,0.0001855682,0.0003927671,0.0002788418,0.008283281,0.01267382],"genre_scores_gemma":[0.7590038,0.0001721294,0.2337084,0.0001318577,0.00002555229,0.0001940854,0.0003371328,0.0001683153,0.006258727],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005286344,"threshold_uncertainty_score":0.01768458,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3193291579","doi":"","title":"Improved OT Extension for Transferring Short Secrets.","year":2013,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Bell (Canada)","funders":"","keywords":"Sublinear function; Extension (predicate logic); Generalization; Computation; Factor (programming language); Security parameter; Computer science; Block (permutation group theory); Provable security; Work (physics); Protocol (science); Theoretical computer science; Discrete mathematics; Mathematics; Algorithm; Cryptography; Combinatorics; Physics; Mathematical analysis","authors":[{"name":"Vladimir Kolesnikov","is_ca":true},{"name":"Ranjit Kumaresan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02803369439283846,"gpt":0.275520161173267,"spread":0.2474864667804285,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002159015,0.001026627,0.001321706,0.00105355,0.001681035,0.001869562,0.002649075,0.001519262,0.009228552],"category_scores_gemma":[0.007516391,0.0006285393,0.001748154,0.001486364,0.002490156,0.008997011,0.01111359,0.004526173,0.003515739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001512107,"about_ca_system_score_gemma":0.002265526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008445804,"about_ca_topic_score_gemma":0.0006245304,"domain_scores_codex":[0.9958254,0.0006286413,0.0003430082,0.0005940939,0.001848947,0.0007600034],"domain_scores_gemma":[0.9938811,0.001214903,0.0004176039,0.003535021,0.0006519469,0.0002993825],"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.001538887,0.0004620638,0.001982137,0.0009276648,0.0001186087,0.001117723,0.001587991,0.03080478,0.06436323,0.6311648,0.01282136,0.2531108],"study_design_scores_gemma":[0.0003850753,0.00137994,0.001701841,0.0003355089,0.0003563171,0.003365018,0.0005715729,0.2608487,0.09884682,0.5025024,0.1293575,0.000349407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03520511,0.0005705627,0.9329419,0.0006124947,0.0004892343,0.000695576,0.0004110452,0.00278459,0.02628938],"genre_scores_gemma":[0.6783866,0.0007571362,0.293013,0.0007066522,0.0003904287,0.001013424,0.001006885,0.0006281135,0.02409782],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009228552,"threshold_uncertainty_score":0.03087258,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2951256639","doi":"","title":"Verifiable Sealed-Bid Auction on the Ethereum Blockchain.","year":2018,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":7,"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":"Smart contract; Blockchain; Computer science; Computer security; Verifiable secret sharing; Correctness; Protocol (science); Homomorphic encryption; Transparency (behavior); Scheme (mathematics); Vickrey–Clarke–Groves auction; Encryption; Auction theory; Common value auction; Microeconomics; Programming language","authors":[{"name":"Hisham S. Galal","is_ca":true},{"name":"Amr Youssef","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01905914272387012,"gpt":0.2538417123297927,"spread":0.2347825696059226,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004781928,0.0005663265,0.0007978556,0.0007568994,0.001048541,0.002457723,0.002177508,0.002325299,0.005991332],"category_scores_gemma":[0.01085149,0.000457742,0.0007213523,0.001137148,0.002619612,0.005777597,0.00334521,0.00187576,0.001468801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001917185,"about_ca_system_score_gemma":0.002346367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001030311,"about_ca_topic_score_gemma":0.001022175,"domain_scores_codex":[0.9945963,0.002334753,0.000249679,0.0004848423,0.00188236,0.0004521366],"domain_scores_gemma":[0.9948617,0.002121963,0.0004880922,0.001810587,0.0004883537,0.0002292549],"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.0002086528,0.0000557815,0.000260076,0.0001158322,0.00003565294,0.0003039414,0.0001458715,0.05126077,0.004036622,0.9204118,0.001514697,0.02165044],"study_design_scores_gemma":[0.0001447319,0.0001117981,0.0001409357,0.00005820853,0.00002186122,0.0001959936,0.00003281272,0.3440258,0.006073783,0.6333125,0.01584149,0.00004006413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02918936,0.0005300945,0.9471134,0.0009497793,0.0001529229,0.0004274223,0.000336006,0.0003960253,0.02090491],"genre_scores_gemma":[0.7577693,0.0008234701,0.2246926,0.0002235101,0.0001050372,0.0005771408,0.0004924641,0.00009179996,0.01522471],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005991332,"threshold_uncertainty_score":0.0252896,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2949160893","doi":"","title":"A double large prime variation for small genus hyperelliptic index calculus.","year":2004,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":7,"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":"Prime (order theory); Logarithm; Genus; Variation (astronomy); Context (archaeology); Heuristic; Hyperelliptic curve cryptography; Mathematics; Algorithm; Discrete logarithm; Computer science; Combinatorics; Mathematical optimization; Mathematical analysis; Zoology","authors":[{"name":"Pierrick Gaudry","is_ca":false},{"name":"Emmanuel Thomé","is_ca":false},{"name":"Nicolas Thériault","is_ca":true},{"name":"Claus Diem","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02083633222881232,"gpt":0.2587462555160087,"spread":0.2379099232871963,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001503733,0.0005800187,0.0007917046,0.001148015,0.0006628156,0.001811715,0.001108318,0.0004725537,0.004524223],"category_scores_gemma":[0.007431854,0.0002629388,0.0005752945,0.001112798,0.001737034,0.002364286,0.003206611,0.002202531,0.001465765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006934504,"about_ca_system_score_gemma":0.0006952407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002170915,"about_ca_topic_score_gemma":0.0003736567,"domain_scores_codex":[0.9985787,0.0003842895,0.00005908161,0.0002379799,0.0006387048,0.0001014003],"domain_scores_gemma":[0.9979699,0.0007526031,0.0001487795,0.0007475935,0.0002351864,0.0001458388],"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.0004398176,0.00009916611,0.002409988,0.0002595547,0.00005184189,0.0004166607,0.0003511843,0.0165005,0.02469555,0.5499334,0.008311328,0.3965309],"study_design_scores_gemma":[0.0001201167,0.0003702356,0.001622202,0.00007314814,0.00005472924,0.001194659,0.0001247262,0.2666152,0.0339445,0.6550796,0.04070376,0.0000971869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0472216,0.0005342638,0.9410697,0.0004528016,0.0002483081,0.0001207355,0.00006872862,0.001286002,0.008997854],"genre_scores_gemma":[0.361857,0.0003719475,0.6303087,0.0002067542,0.0002832635,0.00008761223,0.000156943,0.0004168141,0.006310845],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004524223,"threshold_uncertainty_score":0.01513505,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2403999494","doi":"","title":"IBAKE: Identity-Based Authenticated Key Exchange Protocol.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; Authenticated Key Exchange; Computer security; Key (lock); Key exchange; Public-key cryptography; Identity (music); Authentication (law); Protocol (science); Encryption; Theoretical computer science","authors":[{"name":"Vladimir Kolesnikov","is_ca":true},{"name":"Ganapathy S. Sundaram","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03765234709929096,"gpt":0.3014489787261447,"spread":0.2637966316268538,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003857861,0.001042175,0.001241042,0.002025889,0.001970097,0.003004413,0.003184814,0.003332686,0.01035321],"category_scores_gemma":[0.006265433,0.0004772662,0.0006648429,0.002355391,0.002769972,0.006596202,0.007442273,0.004822501,0.008920532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001203016,"about_ca_system_score_gemma":0.002217234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005782141,"about_ca_topic_score_gemma":0.0004493341,"domain_scores_codex":[0.9946334,0.001660594,0.0005038655,0.0005720761,0.002031423,0.0005985229],"domain_scores_gemma":[0.9976947,0.0004720462,0.0003702852,0.0007059162,0.0004181883,0.0003389414],"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.001287621,0.000246471,0.0006546961,0.001133589,0.0001111791,0.0009895436,0.0009307585,0.004755133,0.01823453,0.7048368,0.07302182,0.1937978],"study_design_scores_gemma":[0.000232945,0.0003166558,0.0004546108,0.0002715022,0.0001056388,0.001962682,0.000186532,0.02817165,0.0190218,0.3090026,0.6400747,0.0001986732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006816634,0.004619942,0.9168954,0.003598213,0.00208636,0.001445935,0.001679757,0.00749611,0.0553617],"genre_scores_gemma":[0.3552674,0.006136652,0.5398882,0.005053558,0.001264377,0.004285454,0.006419357,0.001112051,0.08057295],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01035321,"threshold_uncertainty_score":0.03463495,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2949285224","doi":"","title":"Noninteractive two-channel message authentication based on hybrid-collision resistant hash functions.","year":2006,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"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; Hash function; Computer network; Message authentication code; Computer security; Protocol (science); Hash-based message authentication code; Key (lock); Hash chain; Collision resistance; Channel (broadcasting); Context (archaeology); Authentication (law); Cryptographic hash function; Cryptography; Perfect hash function","authors":[{"name":"Atefeh Mashatan","is_ca":true},{"name":"Douglas R. Stinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01337245603226996,"gpt":0.2622821550418686,"spread":0.2489096990095987,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002802295,0.0006449896,0.0008143368,0.0006613255,0.0009187773,0.002036789,0.002658215,0.001489179,0.003351191],"category_scores_gemma":[0.005765768,0.0004791826,0.000866719,0.0007344472,0.00358033,0.005841398,0.003475838,0.001953631,0.00125368],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001030096,"about_ca_system_score_gemma":0.0009773192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004016634,"about_ca_topic_score_gemma":0.0003298646,"domain_scores_codex":[0.997322,0.0009462371,0.0001061729,0.0003499412,0.0009759546,0.0002997065],"domain_scores_gemma":[0.9952068,0.002201324,0.0004582515,0.0015527,0.0003873251,0.0001935485],"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.0003274828,0.0001079801,0.0004343012,0.0001585166,0.00006951483,0.0002757479,0.000390051,0.03624335,0.01066945,0.9245231,0.001829917,0.02497066],"study_design_scores_gemma":[0.0001198406,0.0003247192,0.0002063965,0.0000359551,0.00006668959,0.0004731714,0.00009722786,0.6599391,0.02206567,0.3038275,0.01277534,0.00006846173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01108112,0.0002648512,0.9846348,0.0001800074,0.00008279286,0.0001272347,0.00003289562,0.0003572849,0.003238984],"genre_scores_gemma":[0.7554147,0.000476872,0.2332956,0.0002290251,0.0001233571,0.0003329309,0.0001535357,0.00009117202,0.009882794],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003351191,"threshold_uncertainty_score":0.01482016,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2949736952","doi":"","title":"Human Assisted Randomness Generation Using Video Games.","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Randomness; Computer science; Entropy (arrow of time); Randomness tests; Set (abstract data type); Theoretical computer science; Human–computer interaction; Mathematics","authors":[{"name":"Mohsen Alimomeni","is_ca":true},{"name":"Reihaneh Safavi–Naini","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05109110243666436,"gpt":0.3099897016658757,"spread":0.2588985992292114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002251961,0.001025409,0.0004167669,0.0007167701,0.0004147779,0.0009395427,0.001157989,0.0008340346,0.003514808],"category_scores_gemma":[0.01020977,0.0002633804,0.0004885731,0.0003436055,0.001661842,0.001517694,0.001850041,0.000941594,0.0005382756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005769361,"about_ca_system_score_gemma":0.0004668251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000588489,"about_ca_topic_score_gemma":0.0009778799,"domain_scores_codex":[0.9977418,0.001425557,0.00006182594,0.0001894764,0.0004674664,0.0001138799],"domain_scores_gemma":[0.9939592,0.004141188,0.0004549541,0.0008167538,0.0004153512,0.0002126024],"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.001549551,0.001076397,0.008667111,0.000970747,0.0003409634,0.0009787774,0.00207478,0.1713221,0.08792397,0.3434265,0.006614912,0.3750542],"study_design_scores_gemma":[0.0002241518,0.00136275,0.002830963,0.0001407388,0.00006713909,0.0007213618,0.000274908,0.7544824,0.05084726,0.1640192,0.02490741,0.0001217512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04768146,0.0002435401,0.9374341,0.0003816128,0.00007319845,0.0006085314,0.0001145247,0.0005281013,0.01293489],"genre_scores_gemma":[0.6971332,0.0002077909,0.2941588,0.0001879554,0.00004169208,0.0007139228,0.0001585643,0.00008286133,0.007315165],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003514808,"threshold_uncertainty_score":0.01190966,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3030140832","doi":"","title":"Elliptic Curve Cryptography: The Serpentine Course of a Paradigm Shift.","year":2008,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":6,"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; Cryptography; Ideal (ethics); Elliptic curve cryptography; Function (biology); Key (lock); Computer security; Elliptic curve; Public-key cryptography; Political science; Mathematics; Law; Pure mathematics; Encryption","authors":[{"name":"Ann Hibner Koblitz","is_ca":false},{"name":"Neal Koblitz","is_ca":false},{"name":"Alfred Menezes","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01493298593194446,"gpt":0.2538706889830655,"spread":0.238937703051121,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006097721,0.0007370021,0.0004798156,0.001479727,0.002619305,0.006595177,0.000672482,0.00382432,0.005003115],"category_scores_gemma":[0.01244462,0.0004865526,0.0003562134,0.001763713,0.01432279,0.01862872,0.003588015,0.009461317,0.00293736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004713092,"about_ca_system_score_gemma":0.001926926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006325467,"about_ca_topic_score_gemma":0.0005763582,"domain_scores_codex":[0.9962411,0.001590429,0.000177557,0.00041732,0.001362168,0.0002114677],"domain_scores_gemma":[0.9956936,0.002114629,0.0003257407,0.0008188144,0.000700939,0.0003463902],"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.00002611353,0.000009901441,0.00007901126,0.00003735874,0.000002410216,0.00004584147,0.0002351034,0.0002546199,0.0001093471,0.9709141,0.0120312,0.01625479],"study_design_scores_gemma":[0.00001433487,0.00002127745,0.0001019778,0.0001238566,0.000001887554,0.0001706273,0.0001370084,0.0008154058,0.0001873581,0.866078,0.1323365,0.00001168678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"commentary","genre_gemma":"empirical","genre_scores_codex":[0.01873693,0.09597323,0.09721059,0.3957949,0.01257999,0.0001078261,0.0003505071,0.000546615,0.3786995],"genre_scores_gemma":[0.6564228,0.1118247,0.08952103,0.03472706,0.01575681,0.0002530022,0.0003118082,0.0004469084,0.09073582],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006595177,"threshold_uncertainty_score":0.03419602,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3204067048","doi":"","title":"Post-Quantum Cryptography on FPGA Based on Isogenies on Elliptic Curves","year":2016,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":6,"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":"Isogeny; Computer science; Key exchange; Parallel computing; Cryptography; Public-key cryptography; Supersingular elliptic curve; Software; Curve25519; Shared secret; Multiplier (economics); Elliptic curve cryptography; Arithmetic; Elliptic curve; Algorithm; Encryption; Mathematics; Operating system","authors":[{"name":"Brian Koziel","is_ca":false},{"name":"Reza Azarderakhsh","is_ca":false},{"name":"Mehran Mozaffari Kermani","is_ca":false},{"name":"David Jao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01288095458855957,"gpt":0.2479428629866351,"spread":0.2350619083980756,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003133944,0.0004955414,0.0003579277,0.0005908135,0.0003691887,0.0008666154,0.0006781003,0.0002612566,0.006988365],"category_scores_gemma":[0.0007665973,0.0001707573,0.0002811321,0.0005906133,0.000420937,0.001108352,0.0004179123,0.0004157771,0.001505353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007254775,"about_ca_system_score_gemma":0.0006171713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008227018,"about_ca_topic_score_gemma":0.0009580846,"domain_scores_codex":[0.9995655,0.00007438191,0.00002400284,0.00005804349,0.0001760862,0.000102005],"domain_scores_gemma":[0.9996363,0.00007728796,0.0000388827,0.0001600506,0.00006964309,0.00001790277],"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.002351551,0.000383677,0.005870615,0.0007383752,0.0001240626,0.001110721,0.0004468843,0.08452246,0.2273071,0.161416,0.01259575,0.5031329],"study_design_scores_gemma":[0.0004988418,0.001904779,0.007416892,0.0002018876,0.000133333,0.001398158,0.0001522838,0.3286363,0.5220305,0.04366189,0.09384177,0.0001232226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6430274,0.001585422,0.2729525,0.0004508575,0.0003458465,0.000239232,0.0003519491,0.007585534,0.07346128],"genre_scores_gemma":[0.9400483,0.0002955716,0.05186577,0.00007621096,0.00003784842,0.00004804273,0.0002239168,0.0001077526,0.007296536],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006988365,"threshold_uncertainty_score":0.02337843,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3028966272","doi":"","title":"Salus: A System for Server-Aided Secure Function Evaluation.","year":2012,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Server; Implementation; Set (abstract data type); Function (biology); Cloud computing; Representation (politics); Work (physics); Focus (optics); Distributed computing; Operating system; Software engineering; Programming language","authors":[{"name":"Seny Kamara","is_ca":false},{"name":"Payman Mohassel","is_ca":true},{"name":"Ben Riva","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05256112980436337,"gpt":0.3047204043262798,"spread":0.2521592745219164,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006645358,0.001713839,0.001842743,0.002299176,0.001762919,0.005008447,0.006403934,0.002824264,0.03041003],"category_scores_gemma":[0.01645344,0.001773959,0.002047644,0.00127162,0.00367836,0.01156354,0.01260618,0.005815288,0.01687155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002397791,"about_ca_system_score_gemma":0.004016227,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001192628,"about_ca_topic_score_gemma":0.001324966,"domain_scores_codex":[0.9933821,0.002036054,0.0006494234,0.000956602,0.00220446,0.0007713746],"domain_scores_gemma":[0.99115,0.002830081,0.0006268078,0.003916866,0.0009074375,0.0005688374],"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.004985975,0.0007560411,0.003609293,0.001780599,0.0004150116,0.001306476,0.001364608,0.03462189,0.03824813,0.5432471,0.126026,0.243639],"study_design_scores_gemma":[0.0005522952,0.0005580598,0.0005820077,0.0003517965,0.0001664346,0.0008802309,0.0001834868,0.4411787,0.05651168,0.3342197,0.1644962,0.0003192677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006538489,0.0006587072,0.8665165,0.0006557594,0.0003439463,0.0007543399,0.0009353189,0.1106765,0.01292043],"genre_scores_gemma":[0.3844321,0.001117637,0.5446509,0.002772823,0.0004751027,0.002840831,0.006230209,0.01538774,0.04209273],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03041003,"threshold_uncertainty_score":0.1017317,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3081740921","doi":"","title":"Further Optimizations of CSIDH: A Systematic Approach to Efficient Strategies, Permutations, and Bound Vectors.","year":2019,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","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 Waterloo","funders":"","keywords":"Speedup; Computer science; Partition (number theory); Class (philosophy); Supersingular elliptic curve; Theoretical computer science; Algorithm; Elliptic curve; Parallel computing; Mathematics; Combinatorics","authors":[{"name":"Aaron Hutchinson","is_ca":true},{"name":"Jason T. LeGrow","is_ca":true},{"name":"Brian Koziel","is_ca":false},{"name":"Reza Azarderakhsh","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01194958658092149,"gpt":0.2437269256537538,"spread":0.2317773390728323,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002010652,0.001329806,0.0009476191,0.001149032,0.0008451089,0.002088085,0.002318949,0.0008618622,0.007029707],"category_scores_gemma":[0.006056629,0.0007351405,0.001360045,0.001674292,0.00159443,0.003984883,0.002800344,0.004978626,0.002793689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001862955,"about_ca_system_score_gemma":0.003468966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002838476,"about_ca_topic_score_gemma":0.003919354,"domain_scores_codex":[0.9966785,0.001094286,0.000195021,0.0003710612,0.001226678,0.0004346214],"domain_scores_gemma":[0.9976012,0.0006699968,0.0001304211,0.001198373,0.0003221497,0.00007776071],"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.0003195636,0.0002960793,0.0008072725,0.0003696735,0.0001097263,0.0001340697,0.0003880442,0.1156313,0.02007114,0.5316544,0.01370836,0.3165104],"study_design_scores_gemma":[0.0001234065,0.0001973672,0.0003326646,0.0001045918,0.00006350044,0.0001886677,0.0001760402,0.6028454,0.02879935,0.308485,0.05859881,0.00008520636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005717557,0.0002998192,0.9797006,0.0004357988,0.00009013407,0.0001733652,0.0001336759,0.001119692,0.01232939],"genre_scores_gemma":[0.1353093,0.0004055386,0.855023,0.0002972657,0.00007795294,0.0002739938,0.000397768,0.0006900494,0.007525253],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007029707,"threshold_uncertainty_score":0.02351671,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2405997985","doi":"","title":"Sequential Secret Sharing as a New Hierarchical Access Structure.","year":2015,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","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 Waterloo","funders":"","keywords":"Secret sharing; Computer science; Access structure; Theoretical computer science; Context (archaeology); Verifiable secret sharing; Cryptography; Set (abstract data type); Computer security; Secure multi-party computation; Cryptographic primitive; Homomorphic secret sharing; Distributed computing; Cryptographic protocol; Programming language","authors":[{"name":"Mehrdad Nojoumian","is_ca":false},{"name":"Douglas R. Stinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04896042530811537,"gpt":0.3320779916451271,"spread":0.2831175663370118,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001740585,0.0003165033,0.0004011503,0.0009183078,0.001279677,0.002416403,0.001424091,0.0009988914,0.004130803],"category_scores_gemma":[0.003658056,0.0004300745,0.0007807305,0.001375772,0.003043658,0.005853306,0.003771649,0.002093414,0.0008115971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00170254,"about_ca_system_score_gemma":0.001563859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006974656,"about_ca_topic_score_gemma":0.0008284583,"domain_scores_codex":[0.9975287,0.0005897979,0.0001871979,0.0003834003,0.001051995,0.0002588876],"domain_scores_gemma":[0.9966234,0.0008173549,0.0004801608,0.001512798,0.0003069192,0.0002594152],"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.00005257746,0.00002773836,0.0002464468,0.00005991972,0.00001309533,0.0001075962,0.0003540085,0.004105845,0.009388315,0.9691896,0.0008183477,0.01563665],"study_design_scores_gemma":[0.00006147821,0.0002457075,0.0006064815,0.00006497129,0.00005094784,0.001032866,0.0002242909,0.1146059,0.01658996,0.8206862,0.04577353,0.00005767786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04166166,0.0004883778,0.9376341,0.0009797808,0.0001163582,0.0002747394,0.0002297005,0.0004352866,0.01818006],"genre_scores_gemma":[0.7316769,0.0006148661,0.2526374,0.0003756307,0.000155681,0.0003134184,0.0002448587,0.00006872274,0.01391256],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004130803,"threshold_uncertainty_score":0.01381892,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}