{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":41,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":41,"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":"6ecf5e280fda","filters":{"venue":"Cryptography and Communications"}},"results":[{"id":"W2148201159","doi":"10.1007/s12095-010-0019-x","title":"Asymptotic enumeration of correlation-immune boolean functions","year":2010,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Boolean function; Mathematics; Combinatorics; Parity function; Function (biology); Discrete mathematics; Maximum satisfiability problem; Boolean data type; Order (exchange); Boolean expression","authors":[{"name":"E. Rodney Canfield","is_ca":false},{"name":"Zhicheng Gao","is_ca":true},{"name":"Catherine Greenhill","is_ca":false},{"name":"Brendan D. McKay","is_ca":false},{"name":"Robert W. Robinson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008518214191220884,"gpt":0.2212279443611145,"spread":0.2127097301698936,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003393258,0.0001158621,0.0001375458,0.0003161518,0.0006166159,0.00009692059,0.001050327,0.00008138859,0.00003601811],"category_scores_gemma":[0.00004408057,0.0001193589,0.0001387343,0.0009664929,0.0004031941,0.0004287185,0.0002975076,0.0003421929,0.000009911046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003175781,"about_ca_system_score_gemma":0.00003807676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001763196,"about_ca_topic_score_gemma":0.00004329165,"domain_scores_codex":[0.9991422,0.0001022632,0.0003019246,0.0001954257,0.00011912,0.0001390113],"domain_scores_gemma":[0.9974454,0.000272453,0.0001497251,0.001915765,0.0001414215,0.0000752029],"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.000003646125,0.0001023351,0.005146444,0.000006155241,0.00003323263,8.009788e-8,0.0007228011,0.00001590072,0.00511437,0.9616919,0.00005884807,0.02710435],"study_design_scores_gemma":[0.001569221,0.0004839453,0.1823336,0.0001220881,0.0002111703,0.00006539175,0.001004496,0.04864847,0.003441344,0.6963764,0.06465271,0.00109117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.127196,0.001225287,0.8547583,0.001247442,0.0005519015,0.0002764169,0.0000186669,0.0002369398,0.01448902],"genre_scores_gemma":[0.9566482,0.0001370573,0.04304063,0.00006173486,0.00001781007,0.00003636065,0.00003064726,0.000006320855,0.00002117969],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8294522,"threshold_uncertainty_score":0.4867316,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2293795016","doi":"10.1007/s12095-015-0178-x","title":"A new class of Fibonacci sequence based error correcting codes","year":2016,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Fibonacci number; Parity-check matrix; Mathematics; Combinatorics; Decoding methods; Matrix (chemical analysis); Integer matrix; Error detection and correction; Integer (computer science); Discrete mathematics; Inverse; Binary number; Class (philosophy); Sequence (biology); Low-density parity-check code; Arithmetic; Algorithm; Computer science; Nonnegative matrix; Symmetric matrix; Physics","authors":[{"name":"Morteza Esmaeili","is_ca":true},{"name":"M. Moosavi","is_ca":false},{"name":"T. Aaron Gulliver","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03790508481512996,"gpt":0.3152612926342888,"spread":0.2773562078191589,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006454282,0.00007809276,0.0001225134,0.00003782976,0.0001916385,0.00001190512,0.0002917896,0.00001860719,0.0001400742],"category_scores_gemma":[0.00001314916,0.00005660742,0.00007352322,0.0002246113,0.0002432331,0.00007254889,0.00008785983,0.00006157163,0.000003731269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003113307,"about_ca_system_score_gemma":0.00003102147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003176496,"about_ca_topic_score_gemma":0.000003286603,"domain_scores_codex":[0.9995368,0.0000288617,0.0001771853,0.0001040629,0.00004849686,0.0001045859],"domain_scores_gemma":[0.9985271,0.0005570006,0.0001067292,0.0006845132,0.00005538106,0.00006934607],"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.000003254738,0.00004891212,0.003923438,0.000005055103,0.00001679866,8.364922e-9,0.00008173098,0.000002224339,0.002408247,0.9020484,0.00008762103,0.09137428],"study_design_scores_gemma":[0.0004139385,0.00003029564,0.0008320622,0.0001396364,0.00003822224,4.066762e-7,0.0007882168,0.0003499805,0.006145007,0.9782182,0.01287817,0.0001658405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.013552,0.0001328629,0.9720216,0.001720094,0.00001353022,0.0001450413,0.00007424805,0.00003496732,0.0123057],"genre_scores_gemma":[0.9082829,0.00002142274,0.09152757,0.00002790894,0.00001625302,0.00005122259,0.000009238595,0.000006519953,0.00005694394],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8947309,"threshold_uncertainty_score":0.2308384,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035522326","doi":"10.1007/s12095-014-0102-9","title":"Multidimensional meet-in-the-middle attack and its applications to KATAN32/48/64","year":2014,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Block cipher; Computer science; Key schedule; Key (lock); Block size; Cipher; Block (permutation group theory); Cryptography; Theoretical computer science; Computer security; Differential cryptanalysis; Arithmetic; Mathematics; Encryption","authors":[{"name":"Bo Zhu","is_ca":true},{"name":"Guang Gong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06520715281484786,"gpt":0.3169153443027311,"spread":0.2517081914878833,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005499418,0.000134733,0.0001321057,0.0003010062,0.0008210308,0.0001579411,0.00118167,0.00004484551,0.000006381851],"category_scores_gemma":[0.00002886463,0.00011726,0.00005746636,0.001272522,0.0001492006,0.000243945,0.0005226277,0.0001600747,0.00001229116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005637557,"about_ca_system_score_gemma":0.00001752728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003849045,"about_ca_topic_score_gemma":0.0004278338,"domain_scores_codex":[0.9988109,0.0002103795,0.0002735644,0.0003053918,0.0001744219,0.0002252961],"domain_scores_gemma":[0.9977747,0.000517819,0.00006344104,0.001426929,0.00009481905,0.0001222776],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00000153136,0.0001289276,0.001324563,0.000008604221,0.00001011457,1.362445e-7,0.003138278,0.000004127111,0.0001088562,0.9827823,0.0005336759,0.01195891],"study_design_scores_gemma":[0.00159916,0.0002111067,0.07478236,0.00008269303,0.0000599024,0.00004632809,0.00409002,0.02958354,0.0001294608,0.1166653,0.7718673,0.0008827609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2562012,0.006053728,0.6967719,0.03107661,0.0001230315,0.002262441,0.00006365866,0.0002488933,0.007198502],"genre_scores_gemma":[0.924877,0.000523322,0.07273138,0.001353592,0.00001743681,0.000464533,0.00002185205,0.000005898642,0.000004913472],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8661169,"threshold_uncertainty_score":0.6314788,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2624155812","doi":"10.1007/s12095-017-0233-x","title":"The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation","year":2017,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Science Foundation of Shandong Province","keywords":"Autocorrelation; Pseudorandom binary sequence; Mathematics; Binary number; Sequence (biology); Complementary sequences; Class (philosophy); Distribution (mathematics); Stream cipher; Autocorrelation matrix; Combinatorics; Discrete mathematics; Time complexity; Algorithm; Cryptography; Computer science; Statistics; Arithmetic; Mathematical analysis","authors":[{"name":"Yuhua Sun","is_ca":true},{"name":"Qiang Wang","is_ca":true},{"name":"Tongjiang Yan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03889153615739618,"gpt":0.2767834628078698,"spread":0.2378919266504736,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0005283114,0.0001169876,0.0001558136,0.00008833462,0.002063813,0.0001827666,0.00123739,0.00006022655,0.000001599581],"category_scores_gemma":[0.00004529404,0.00008614898,0.00007026886,0.0003282612,0.002969563,0.0005861986,0.0004376844,0.0001762208,2.576256e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006228722,"about_ca_system_score_gemma":0.00003985534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007608389,"about_ca_topic_score_gemma":0.00005629398,"domain_scores_codex":[0.999068,0.000195787,0.0002669401,0.0001865715,0.0001494492,0.0001332357],"domain_scores_gemma":[0.9971852,0.0003763301,0.0004817288,0.001755372,0.0001473193,0.00005403663],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00003940711,0.00007042112,0.03163826,0.00001563527,0.00004553762,1.872078e-7,0.0006848994,0.00003750873,0.0002678574,0.9487461,0.00001644712,0.01843775],"study_design_scores_gemma":[0.0005504471,0.000453952,0.818593,0.0001689667,0.00006778652,0.00001599969,0.000462122,0.05953654,0.0002435521,0.1177468,0.001949592,0.0002113211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.631219,0.001866487,0.3607044,0.003280772,0.00008861298,0.0007065044,0.00006306887,0.00009579555,0.001975378],"genre_scores_gemma":[0.9859459,0.0005479357,0.01340526,0.000008806517,0.000005386429,0.00005078899,0.00002937581,0.000003828464,0.000002745703],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8309993,"threshold_uncertainty_score":0.9997438,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2791996780","doi":"10.1007/s12095-018-0292-7","title":"Compositional inverses of permutation polynomials of the form xrh(xs) over finite fields","year":2018,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"National Key Research and Development Program of China; Program for New Century Excellent Talents in University","keywords":"Permutation (music); Finite field; Mathematics; Combinatorics; Polynomial; Inverse; Discrete mathematics; Cyclic permutation; Field (mathematics); Permutation matrix; Pure mathematics; Symmetric group; Physics","authors":[{"name":"Kangquan Li","is_ca":false},{"name":"Longjiang Qu","is_ca":false},{"name":"Qiang Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01906510945952677,"gpt":0.2589763174456607,"spread":0.2399112079861339,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002069628,0.00007860843,0.0001151931,0.000154871,0.0003880705,0.00003104827,0.001151718,0.00005143589,0.00002618006],"category_scores_gemma":[0.00002587266,0.00006335338,0.0001489046,0.0007085735,0.0007569667,0.0002168945,0.0004427361,0.00009931812,9.62409e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003016688,"about_ca_system_score_gemma":0.00003051071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003238344,"about_ca_topic_score_gemma":0.00004486197,"domain_scores_codex":[0.9992961,0.0001336733,0.0002350183,0.0001164379,0.0001247442,0.00009399411],"domain_scores_gemma":[0.998127,0.0003916115,0.000173021,0.001130538,0.0001455238,0.00003230246],"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.00001318033,0.0001100107,0.009207386,0.00001389173,0.00004688478,2.88907e-8,0.002716989,0.000003263568,0.002911336,0.9786161,0.0002116708,0.006149272],"study_design_scores_gemma":[0.0008987414,0.0004308589,0.1940879,0.0002152325,0.00009458161,0.000008665864,0.0006117236,0.005272035,0.0272478,0.7615936,0.00918753,0.0003513468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7702626,0.0008902376,0.2134214,0.00247458,0.0002477513,0.0002994135,0.00006445935,0.00006994532,0.01226958],"genre_scores_gemma":[0.9882365,0.0001272967,0.01131297,0.0002804662,0.00001716945,0.00001250373,0.000006275907,0.000002958018,0.000003837922],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2179739,"threshold_uncertainty_score":0.2984764,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2612667250","doi":"10.1007/s12095-018-0300-y","title":"A lower bound on the 2-adic complexity of the modified Jacobi sequence","year":2018,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Fundamental Research Funds for the Central Universities; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Sequence (biology); Mathematics; Gauss; Upper and lower bounds; Combinatorics; Discrete mathematics; Physics; Mathematical analysis; Quantum mechanics","authors":[{"name":"Yuhua Sun","is_ca":true},{"name":"Qiang Wang","is_ca":true},{"name":"Tongjiang Yan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1068920937676398,"gpt":0.2924533244600238,"spread":0.1855612306923839,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0004849225,0.0001247219,0.0001181204,0.000102616,0.001437433,0.0001211065,0.003569301,0.00004600602,0.00002024512],"category_scores_gemma":[0.00004120348,0.00007512157,0.0001733638,0.001406779,0.004168596,0.0001381125,0.0008219258,0.0002511641,0.000005906829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005652291,"about_ca_system_score_gemma":0.00003439222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003504654,"about_ca_topic_score_gemma":0.00006342391,"domain_scores_codex":[0.9988581,0.0003817242,0.0002020291,0.0002058932,0.0001740325,0.0001782034],"domain_scores_gemma":[0.9957451,0.0004392198,0.0001331148,0.003503904,0.0001280756,0.00005064223],"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.000008747335,0.00009675258,0.0003430838,0.000002930865,0.00002617197,6.502059e-8,0.0009194221,8.35486e-7,0.000577452,0.9946429,0.0002445352,0.003137165],"study_design_scores_gemma":[0.0001919403,0.0001996762,0.01539129,0.00007957648,0.0000230274,0.00000618037,0.0001713435,0.002737721,0.001279153,0.9706746,0.009070066,0.0001753821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7376441,0.001467101,0.1459083,0.03364762,0.0006585224,0.000969069,0.00005784017,0.0002927597,0.07935468],"genre_scores_gemma":[0.9954916,0.0001106756,0.003172334,0.001152535,0.00001994126,0.00003732643,0.000001228372,0.000004901994,0.000009409724],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2578475,"threshold_uncertainty_score":0.9998626,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2902893142","doi":"10.1007/s12095-019-00386-2","title":"New constructions of involutions over finite fields","year":2019,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Finite field; Mathematics; Combinatorics; Permutation (music); Coding theory; Multiplicative function; Discrete mathematics; Field (mathematics); Inverse; Pure mathematics; Physics; Mathematical analysis; Geometry","authors":[{"name":"Tailin Niu","is_ca":false},{"name":"Kangquan Li","is_ca":false},{"name":"Longjiang Qu","is_ca":false},{"name":"Qiang Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01256994977355277,"gpt":0.2338583574518669,"spread":0.2212884076783142,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001305146,0.00009854831,0.0001392787,0.0002924669,0.0002542606,0.00005716818,0.001121614,0.00006905485,0.0001024463],"category_scores_gemma":[0.00001711857,0.0001014407,0.0001438744,0.001064675,0.0002438886,0.0003045735,0.0004471722,0.000185717,0.00001053308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003240563,"about_ca_system_score_gemma":0.00005457132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006096572,"about_ca_topic_score_gemma":0.00003730853,"domain_scores_codex":[0.9992807,0.00008752784,0.0002155275,0.0001826292,0.00009537184,0.0001382337],"domain_scores_gemma":[0.997526,0.0003916197,0.00009489337,0.001831031,0.00006491205,0.00009155701],"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.000002514931,0.00004104363,0.01419378,0.000007038067,0.00003530318,5.292065e-8,0.0005649948,0.00001058743,0.0002099508,0.9706504,0.0003547565,0.0139296],"study_design_scores_gemma":[0.0007970422,0.0001928499,0.03646643,0.00009395929,0.00005114995,0.00001396075,0.0004782405,0.00354282,0.0003947899,0.9075544,0.05003262,0.0003817568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05772086,0.002486155,0.9101858,0.001527802,0.0002667452,0.0002439576,0.00001852172,0.0001831064,0.02736706],"genre_scores_gemma":[0.9064962,0.000482419,0.09279461,0.0001505798,0.00001020581,0.00001140422,0.000006222414,0.000004049396,0.00004429117],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8487753,"threshold_uncertainty_score":0.4136632,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2745796023","doi":"10.1007/s12095-017-0253-6","title":"Security of BLS and BGLS signatures in a multi-user setting","year":2017,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Horizon 2020 Framework Programme; University of Waterloo; European Commission","keywords":"Computer science; Chemistry","authors":[{"name":"Marie-Sarah Lacharité","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02860318381621792,"gpt":0.3037742683974208,"spread":0.2751710845812029,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000411185,0.0001199911,0.0001803133,0.0002330811,0.0006995238,0.0002441516,0.001931774,0.00008825435,0.000002441371],"category_scores_gemma":[0.00008219208,0.0001187463,0.0000704582,0.0002692731,0.0006673874,0.0006946158,0.001415846,0.000285091,2.995982e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002394098,"about_ca_system_score_gemma":0.00001843895,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002070712,"about_ca_topic_score_gemma":0.0006339765,"domain_scores_codex":[0.9991176,0.0001200236,0.0002376827,0.0002550304,0.00009724588,0.000172415],"domain_scores_gemma":[0.9968278,0.0002168484,0.0001930736,0.002620061,0.00006364271,0.00007860295],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.000005400797,0.0002300536,0.1076893,0.00003811411,0.00002620846,0.000001183023,0.003524577,0.000001046857,0.0003423787,0.8785597,0.0001010718,0.009480921],"study_design_scores_gemma":[0.001338717,0.00006849961,0.8185254,0.0001946329,0.00002551806,0.000005810896,0.0007106149,0.006130642,0.00061675,0.1628762,0.009102767,0.0004043695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7783303,0.03079145,0.1756424,0.006128295,0.0001999228,0.001007953,0.0002254841,0.0002418165,0.007432318],"genre_scores_gemma":[0.920273,0.002007079,0.07760405,0.00007855846,0.000004868557,0.0000223107,0.000005503306,0.000003794777,8.437426e-7],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7156835,"threshold_uncertainty_score":0.5380242,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116360492","doi":"10.1007/s12095-010-0039-6","title":"Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures","year":2010,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Secret sharing; Access structure; Overhead (engineering); Computer science; Converse; Decoding methods; Secure multi-party computation; Scheme (mathematics); Theoretical computer science; Context (archaeology); Mathematics; Cryptography; Algorithm","authors":[{"name":"Keith M. Martin","is_ca":false},{"name":"Maura B. Paterson","is_ca":false},{"name":"Douglas R. Stinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02625024890392574,"gpt":0.2840280931100921,"spread":0.2577778442061663,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003258279,0.0002066752,0.0002075166,0.0002299517,0.001228466,0.0003749931,0.001535137,0.0001749795,0.00002060033],"category_scores_gemma":[0.00001641386,0.0002003623,0.0001305516,0.0004615838,0.0003574709,0.0007843301,0.000564111,0.0005074858,4.492954e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003626501,"about_ca_system_score_gemma":0.00004000117,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007339264,"about_ca_topic_score_gemma":0.0002750125,"domain_scores_codex":[0.998792,0.00006560382,0.0002432431,0.0004695212,0.0001352055,0.0002944241],"domain_scores_gemma":[0.9976784,0.000193923,0.00008992492,0.001747133,0.00007783729,0.0002127699],"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.00001659974,0.00009780324,0.004273577,0.0000562095,0.00005476264,4.057187e-7,0.001762919,0.000001351559,0.004097596,0.9718457,0.0002201891,0.0175729],"study_design_scores_gemma":[0.001434154,0.0001826664,0.0312407,0.00005860723,0.0001162273,0.00004027836,0.0004082286,0.03145043,0.0009693001,0.8382089,0.09518395,0.0007065212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4557268,0.006146064,0.532769,0.002117333,0.0001940757,0.0006911284,0.0001719238,0.0002818763,0.001901754],"genre_scores_gemma":[0.6419705,0.001130575,0.3564618,0.0001887614,0.00003601518,0.00007500093,0.0001225289,0.00001168965,0.000003139781],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.1862437,"threshold_uncertainty_score":0.9448492,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1986968979","doi":"10.1007/s12095-011-0061-3","title":"Fault analysis of the NTRUSign digital signature scheme","year":2012,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Signature (topology); Digital signature; Discrete mathematics; NTRU; Transpose; Computer science; Combinatorics; Polynomial; Lattice (music); Mathematics; Algorithm; Physics; Cryptography; Computer security; Quantum mechanics; Mathematical analysis; Geometry","authors":[{"name":"Abdel Alim Kamal","is_ca":true},{"name":"Amr Youssef","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02145042338599239,"gpt":0.2749272250956457,"spread":0.2534768017096533,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001839565,0.00008913522,0.0001361436,0.0003203759,0.0004396761,0.0001131633,0.001350504,0.00004648161,0.00001313972],"category_scores_gemma":[0.00001922236,0.00006607879,0.0002486426,0.003731756,0.0002893547,0.0005168011,0.0006153169,0.0001574751,7.052554e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003891475,"about_ca_system_score_gemma":0.00001541939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001907726,"about_ca_topic_score_gemma":0.00003331341,"domain_scores_codex":[0.999261,0.00007928976,0.0002142713,0.0001157336,0.0001550414,0.0001746431],"domain_scores_gemma":[0.9978467,0.0001680948,0.000119213,0.001706558,0.00008921194,0.00007022607],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[8.275649e-7,0.0001623803,0.1557448,0.000003304283,0.000349498,1.690165e-8,0.002664406,0.000002632756,0.0002587589,0.8317459,0.0001415178,0.008925977],"study_design_scores_gemma":[0.0003653756,0.00003436795,0.9262744,0.00001718445,0.0005411679,0.00000379818,0.001789784,0.007510839,0.0002407675,0.0251606,0.0377127,0.0003489864],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5109422,0.01284183,0.4604293,0.005114133,0.0002755776,0.0006391671,0.0004239174,0.0002022277,0.009131655],"genre_scores_gemma":[0.9792705,0.0002152041,0.0202889,0.0001603958,0.000007678602,0.00002048751,0.00003020783,0.000002867357,0.000003775387],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8065853,"threshold_uncertainty_score":0.3381678,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100535482","doi":"10.1007/s12095-010-0029-8","title":"Unbiased complex Hadamard matrices and bases","year":2010,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Advanced Photonic Communication Systems","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"","keywords":"Hadamard transform; Complex Hadamard matrix; Hadamard matrix; Mathematics; Mutually unbiased bases; Order (exchange); Hadamard product; Hadamard's inequality; Combinatorics; Hadamard's maximal determinant problem; Pure mathematics; Mathematical analysis","authors":[{"name":"Darcy Best","is_ca":true},{"name":"Hadi Kharaghani","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02123927109641836,"gpt":0.2520727094033488,"spread":0.2308334383069305,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117629,0.0001197688,0.0001388739,0.0001368004,0.0003316981,0.00006859661,0.0005103669,0.00005804926,0.00003815656],"category_scores_gemma":[0.00001717268,0.0001264302,0.00003872383,0.0003154087,0.0003440277,0.0001385092,0.0001888505,0.0003072681,0.000004916023],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004050419,"about_ca_system_score_gemma":0.000007071252,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000313574,"about_ca_topic_score_gemma":0.0002526076,"domain_scores_codex":[0.9994501,0.00004752737,0.0002024956,0.0001069482,0.00006504369,0.0001278973],"domain_scores_gemma":[0.9979263,0.000337371,0.00004098456,0.001555924,0.00004594481,0.000093483],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000321067,0.0004302956,0.0760848,0.0004766124,0.0005513232,0.000002124207,0.006300477,0.0002715428,0.1896321,0.4175127,0.008431783,0.3002741],"study_design_scores_gemma":[0.0006842299,0.00002772629,0.06383774,0.0000579163,0.00005655799,0.00004126599,0.001228866,0.02700547,0.0008715515,0.008186486,0.8974597,0.0005424675],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8485234,0.03086779,0.02265484,0.002553329,0.0003937322,0.001136916,0.0002316595,0.002068075,0.0915702],"genre_scores_gemma":[0.9481161,0.004477716,0.04718217,0.00006807233,0.00001233475,0.00008226783,0.00003728737,0.00001785909,0.000006251142],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.889028,"threshold_uncertainty_score":0.5155674,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4289524100","doi":"10.1007/s12095-022-00603-5","title":"Concrete constructions of weightwise perfectly balanced (2-rotation symmetric) functions with optimal algebraic immunity and high weightwise nonlinearity","year":2022,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Armand Frappier Museum","funders":"Key Scientific Research Project of Colleges and Universities in Henan Province; National Natural Science Foundation of China","keywords":"Boolean function; Hamming weight; Mathematics; Cipher; Hamming distance; Stream cipher; Cryptography; Rotation (mathematics); Algebraic number; Class (philosophy); Simplicity; Discrete mathematics; Topology (electrical circuits); Hamming code; Combinatorics; Computer science; Algorithm; Encryption; Mathematical analysis; Block code","authors":[{"name":"Sihem Mesnager","is_ca":false},{"name":"Sihong Su","is_ca":false},{"name":"Jingjing Li","is_ca":true},{"name":"Linya Zhu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01015853541938722,"gpt":0.2119433588205441,"spread":0.2017848234011569,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004214427,0.0002095906,0.0002838649,0.0006900507,0.002312176,0.0001210995,0.001071745,0.00005560537,0.00005114835],"category_scores_gemma":[0.00002810822,0.0002081502,0.0001197079,0.002797308,0.001083729,0.0004497404,0.0009660095,0.0005522628,9.552912e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001701065,"about_ca_system_score_gemma":0.00008950882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000156782,"about_ca_topic_score_gemma":0.00002498422,"domain_scores_codex":[0.9982257,0.0005692265,0.000350448,0.0003681573,0.0002479365,0.0002385679],"domain_scores_gemma":[0.9971137,0.0006060874,0.0002492169,0.00169139,0.0002046194,0.0001350094],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00008887349,0.0001860801,0.01417959,0.0000274415,0.0001917313,0.000001531567,0.001642911,0.00003896917,0.0009012389,0.9692476,0.00005906464,0.01343492],"study_design_scores_gemma":[0.01915712,0.00982975,0.4382294,0.0004177717,0.001708078,0.001999545,0.03070369,0.07949962,0.003022776,0.3561698,0.05397246,0.005289932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8715648,0.002398731,0.1220949,0.001156814,0.0001504808,0.0004723284,0.0002204193,0.0002244997,0.001717076],"genre_scores_gemma":[0.9213836,0.0005345468,0.07767069,0.00008129556,0.00001189265,0.0002005229,0.00009723147,0.00001150329,0.000008689531],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6130778,"threshold_uncertainty_score":0.9989867,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2065586216","doi":"10.1007/s12095-013-0091-0","title":"Optimal parameters for the WG stream cipher family","year":2013,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stream cipher; Cipher; Mathematics; Transformation (genetics); Exponent; Finite field; Degree (music); Discrete mathematics; Algebraic number; Sequence (biology); Transposition cipher; Algorithm; Combinatorics; Cryptography; Computer science; Mathematical analysis; Physics","authors":[{"name":"Kalikinkar Mandal","is_ca":true},{"name":"Guang Gong","is_ca":true},{"name":"Xinxin Fan","is_ca":true},{"name":"Mark D. Aagaard","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0336229700315679,"gpt":0.2557463073984484,"spread":0.2221233373668806,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002605275,0.0001359348,0.000114138,0.0001172449,0.0009798625,0.000378131,0.002230362,0.00005186074,0.00001226126],"category_scores_gemma":[0.00002137084,0.00009955902,0.0001924189,0.0006037923,0.0004663768,0.0003671545,0.0004551588,0.000162808,0.00001050598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003447057,"about_ca_system_score_gemma":0.00001631265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005708695,"about_ca_topic_score_gemma":0.000008763212,"domain_scores_codex":[0.9991585,0.0001064606,0.0001812821,0.00022414,0.00009287989,0.0002367531],"domain_scores_gemma":[0.9965764,0.001045755,0.00007066146,0.002115515,0.0001071925,0.00008447345],"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.00000502477,0.00009998719,0.0007092892,0.000005891569,0.0001006331,6.156381e-8,0.000934642,0.00004684733,0.0002024495,0.8315063,0.002641662,0.1637472],"study_design_scores_gemma":[0.001307085,0.0005125822,0.04504052,0.00006880787,0.0001745445,0.00001406258,0.004010178,0.05921267,0.0003598715,0.6804932,0.2078367,0.0009698063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04999828,0.004584127,0.9350504,0.006025306,0.000138868,0.000749162,0.00001166887,0.0002152348,0.003226936],"genre_scores_gemma":[0.8067693,0.0007224142,0.190965,0.0008139351,0.000014235,0.0006853301,0.000006284435,0.000008232304,0.00001536121],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.756771,"threshold_uncertainty_score":0.7536409,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015875314","doi":"10.1007/s12095-013-0082-1","title":"A simple combinatorial treatment of constructions and threshold gaps of ramp schemes","year":2013,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Simple (philosophy); Code (set theory); Mathematical proof; Dual (grammatical number); Minimum distance; Mathematics; Nonlinear system; Algorithm; Computer science; Combinatorial design; Linear code; Discrete mathematics; Block code; Geometry; Decoding methods; Physics","authors":[{"name":"Maura B. Paterson","is_ca":false},{"name":"Douglas R. Stinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01868826974391217,"gpt":0.2516684556753886,"spread":0.2329801859314765,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008600084,0.0001106578,0.0002036368,0.0002143524,0.0002717595,0.00005496182,0.000526151,0.00005107654,0.00001731731],"category_scores_gemma":[0.000009115716,0.000099994,0.0001083812,0.0005688507,0.0008630349,0.0002377988,0.0002360153,0.00006316145,7.032893e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003228065,"about_ca_system_score_gemma":0.00002111071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006673185,"about_ca_topic_score_gemma":0.000006020437,"domain_scores_codex":[0.9993166,0.00007831997,0.0002476304,0.000159532,0.00007820847,0.0001197504],"domain_scores_gemma":[0.9982707,0.0002404576,0.000125405,0.001168199,0.0001204245,0.00007479668],"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.000004113296,0.0002358578,0.01574647,0.00001185543,0.00006816433,4.953807e-8,0.0007276292,4.203116e-7,0.001358169,0.9614412,0.00003219555,0.02037384],"study_design_scores_gemma":[0.001182261,0.000525701,0.01475684,0.00003826878,0.0000605174,0.00001077749,0.0006423722,0.000930625,0.004705552,0.9696093,0.007326352,0.0002114513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9680262,0.006951448,0.01944072,0.0006146177,0.0001309204,0.0004774914,0.00002730904,0.0001011908,0.004230077],"genre_scores_gemma":[0.9786192,0.00186975,0.01940408,0.0000168953,0.00000767285,0.0000702887,0.000006572803,0.000003927375,0.000001609356],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02016238,"threshold_uncertainty_score":0.4077637,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1055513040","doi":"10.1007/s12095-015-0141-x","title":"Enhanced criteria on differential uniformity and nonlinearity of cryptographically significant functions","year":2015,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Block cipher; S-box; Nonlinear system; Differential cryptanalysis; Differential (mechanical device); Cryptography; Mathematics; Linear cryptanalysis; Permutation (music); Substitution (logic); Discrete mathematics; Stream cipher; Pure mathematics; Algorithm; Computer science; Physics; Quantum mechanics","authors":[{"name":"Yin Tan","is_ca":true},{"name":"Guang Gong","is_ca":true},{"name":"Bo Zhu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04080440793990234,"gpt":0.2805707567951725,"spread":0.2397663488552702,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004053701,0.0001968671,0.0002584555,0.0004151837,0.0004261869,0.0001391191,0.001061382,0.000102856,0.00001114127],"category_scores_gemma":[0.00006160403,0.000182262,0.0001437957,0.001054318,0.0008507495,0.0002861095,0.0005971074,0.0003005988,0.000002177021],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005516722,"about_ca_system_score_gemma":0.00004619522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002566377,"about_ca_topic_score_gemma":0.00002386318,"domain_scores_codex":[0.9986035,0.0002806911,0.0003418202,0.0003437242,0.0002087874,0.0002215114],"domain_scores_gemma":[0.9973455,0.0003170118,0.0001425647,0.001707108,0.0002263872,0.0002614358],"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.00007497512,0.0005837748,0.002997107,0.00002118591,0.00008095268,4.400061e-7,0.001242239,0.000002810624,0.002903772,0.9730139,0.000116176,0.01896271],"study_design_scores_gemma":[0.003977753,0.00296547,0.1227501,0.0002830305,0.0002615641,0.00002760745,0.002600772,0.01181965,0.00561938,0.838747,0.009404758,0.001542914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4113662,0.0004245384,0.5818118,0.001004892,0.0001625961,0.0002365413,0.00004610383,0.0001733777,0.004773859],"genre_scores_gemma":[0.9675674,0.0003659606,0.03184854,0.0001213639,0.00002102536,0.00004171883,0.00002146849,0.000008017573,0.000004448124],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5562012,"threshold_uncertainty_score":0.7432429,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2140046536","doi":"10.1007/s12095-015-0125-x","title":"Extended results on privacy against coalitions of users in user-private information retrieval protocols","year":2015,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Anonymity; Private information retrieval; Probabilistic logic; Differential privacy; Information retrieval; Identity (music); Set (abstract data type); Computer security; Database; Data mining","authors":[{"name":"Colleen M. Swanson","is_ca":false},{"name":"Douglas R. Stinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07438507081949432,"gpt":0.3265853601268155,"spread":0.2522002893073212,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0008348509,0.0001384713,0.0001828899,0.0006043474,0.0001676882,0.0001375593,0.01542707,0.0001211895,4.827278e-7],"category_scores_gemma":[0.007333522,0.000139102,0.00005246976,0.001751682,0.0003852141,0.001508117,0.02000058,0.0003590766,0.000006082711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004016361,"about_ca_system_score_gemma":0.00009207083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002550481,"about_ca_topic_score_gemma":0.00001025536,"domain_scores_codex":[0.9985012,0.0002035178,0.0005835731,0.000219278,0.0002780205,0.0002143493],"domain_scores_gemma":[0.9874154,0.0002910349,0.0002954833,0.01171736,0.0001912109,0.00008947884],"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.0003701505,0.001125164,0.009353048,0.0001023321,0.00008331708,0.000002516912,0.004431115,0.0000749522,0.0005440347,0.9041442,0.03929386,0.04047536],"study_design_scores_gemma":[0.004479328,0.0005958215,0.05610387,0.0006447026,0.00001323938,0.000005966182,0.0009490069,0.02267378,0.004537397,0.8261348,0.08325282,0.0006092978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3610824,0.0007646362,0.3921065,0.1658833,0.0004080665,0.030765,0.001195679,0.003591013,0.04420331],"genre_scores_gemma":[0.667608,0.0003248788,0.3306725,0.0002398599,0.000004542645,0.0009998129,0.0001421304,0.000006725516,0.00000157311],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3065255,"threshold_uncertainty_score":0.9898999,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2028643223","doi":"10.1007/s12095-013-0089-7","title":"Resilience to distinguishing attacks on WG-7 cipher and their generalizations","year":2013,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stream cipher; Stream cipher attack; Computer science; Cipher; Cryptography; Correlation attack; Transposition cipher; Resilience (materials science); Computer security; Theoretical computer science; Arithmetic; Running key cipher; Mathematics; Encryption","authors":[{"name":"Guang Gong","is_ca":true},{"name":"Mark D. Aagaard","is_ca":true},{"name":"Xinxin Fan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02096830398926615,"gpt":0.252730133834662,"spread":0.2317618298453958,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002117788,0.000155555,0.000127281,0.0002418411,0.0009960878,0.0004624203,0.001301003,0.0000476048,0.00001678928],"category_scores_gemma":[0.00007022284,0.0001340258,0.0000628795,0.001024516,0.000266709,0.0003491212,0.0007115349,0.000168447,0.00001160088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005053789,"about_ca_system_score_gemma":0.00001163675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005421816,"about_ca_topic_score_gemma":0.00003760061,"domain_scores_codex":[0.9990216,0.0001605279,0.0001855884,0.0003230335,0.00008867505,0.0002205434],"domain_scores_gemma":[0.9976181,0.0003630072,0.00005723092,0.001671851,0.0001045972,0.0001851494],"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.000001797431,0.00007041683,0.005221395,0.00000501968,0.0000175525,1.387155e-7,0.00262231,0.00002065599,0.0004710334,0.9315624,0.001029767,0.05897754],"study_design_scores_gemma":[0.0005713968,0.0004667744,0.1510556,0.0002769946,0.00003045978,0.00002252078,0.002047959,0.01493133,0.000750668,0.7314282,0.09722742,0.001190708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2640152,0.001809496,0.7001642,0.01127314,0.0001398234,0.0005980847,0.00001469518,0.0004069358,0.0215784],"genre_scores_gemma":[0.9566643,0.000279821,0.0413743,0.001481129,0.0000209194,0.0001432859,0.000005685861,0.000008546527,0.00002200596],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6926491,"threshold_uncertainty_score":0.7661203,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4289519905","doi":"10.1007/s12095-022-00585-4","title":"Status of three classes of sequences","year":2022,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sequence (biology); Binary Golay code; Pseudorandom number generator; Ambiguity; Field (mathematics); Autocorrelation; Computer science; Cryptography; Complementary sequences; Theoretical computer science; Mathematics; Algorithm; Discrete mathematics; Statistics; Pure mathematics; Programming language","authors":[{"name":"Guang Gong","is_ca":true},{"name":"Z.L. Wang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04423353199970351,"gpt":0.2763334129997022,"spread":0.2320998809999987,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002841861,0.00007246067,0.0001390668,0.0002764702,0.000442628,0.00002066189,0.00163308,0.00001754258,0.00003050999],"category_scores_gemma":[0.00001442829,0.00007408852,0.0001134569,0.001278831,0.0005005941,0.000157236,0.001057505,0.0001485747,2.052622e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000444953,"about_ca_system_score_gemma":0.00005291781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008200743,"about_ca_topic_score_gemma":0.00003774692,"domain_scores_codex":[0.999131,0.0001893296,0.0002296423,0.0001378209,0.0001595932,0.000152563],"domain_scores_gemma":[0.9980273,0.0003041445,0.0001657754,0.001381183,0.00006856573,0.00005306237],"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.00000598374,0.0001263433,0.02417457,0.00001155654,0.00003583151,1.380579e-7,0.0009795176,0.00001384137,0.0008818316,0.9511622,0.00004120917,0.022567],"study_design_scores_gemma":[0.0003494629,0.0004670609,0.0424201,0.00002608264,0.00003865167,0.000009186097,0.001818036,0.001231348,0.001143422,0.9202251,0.03204117,0.0002303842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6231022,0.03072261,0.3129238,0.00195868,0.0002770278,0.0005098052,0.0001875212,0.0002649865,0.03005334],"genre_scores_gemma":[0.9633703,0.0009518874,0.03557055,0.00004790395,0.000002406596,0.00004618344,0.000006286433,0.00000304969,0.000001473444],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.340268,"threshold_uncertainty_score":0.3404381,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125124709","doi":"10.1007/s12095-015-0134-9","title":"On encoding symbol degrees of array BP-XOR codes","year":2015,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Luby transform code; Low-density parity-check code; Fountain code; Encoding (memory); Decoding methods; Exclusive or; Computer science; Bitwise operation; Belief propagation; Arithmetic; Tornado code; Binary number; Symbol (formal); Algorithm; Theoretical computer science; Mathematics; Error floor","authors":[{"name":"Maura B. Paterson","is_ca":false},{"name":"Douglas R. Stinson","is_ca":true},{"name":"Yongge Wang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0674218556422158,"gpt":0.3037691611893067,"spread":0.2363473055470909,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003889129,0.0001017957,0.0001458473,0.0002411649,0.0001959829,0.00005991438,0.001615556,0.00004985198,0.000001153388],"category_scores_gemma":[0.0001087838,0.00009663594,0.00006607723,0.0005875787,0.0002248335,0.0002045629,0.0003368938,0.0001769142,0.000002764156],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001026737,"about_ca_system_score_gemma":0.00003674586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006277498,"about_ca_topic_score_gemma":0.00004207281,"domain_scores_codex":[0.9992071,0.0001445699,0.000198754,0.000172709,0.0001472869,0.0001295788],"domain_scores_gemma":[0.9974571,0.0004115806,0.0001184059,0.001774377,0.0001512265,0.00008728868],"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.000006392183,0.0001697442,0.009110737,0.00001277229,0.00003084453,4.146296e-7,0.004697088,0.00002068087,0.002839381,0.9665608,0.001084187,0.01546689],"study_design_scores_gemma":[0.001808004,0.002093971,0.03475991,0.001265225,0.0001339828,0.00007998694,0.005895621,0.02609644,0.07484034,0.8327134,0.01839171,0.001921418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07091416,0.002473672,0.8788334,0.001751043,0.000162176,0.0002851437,0.000006688701,0.0007549604,0.04481879],"genre_scores_gemma":[0.7627172,0.0001796935,0.2369775,0.00007985393,0.00000522451,0.00002946473,0.000001594147,0.000004838505,0.000004566806],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6918031,"threshold_uncertainty_score":0.3940699,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2890991810","doi":"10.1007/s12095-019-00384-4","title":"Unicyclic strong permutations","year":2019,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Combinatorics; Mathematics","authors":[{"name":"Claude Gravel","is_ca":false},{"name":"Daniel Panario","is_ca":true},{"name":"David Thomson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01529905154711339,"gpt":0.2488915530496273,"spread":0.2335925015025139,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002025669,0.000116411,0.0001227738,0.0002708681,0.0004551407,0.0001762094,0.001635525,0.00004880976,0.00004291243],"category_scores_gemma":[0.000009785009,0.0001176418,0.0001182476,0.0009753162,0.0002028552,0.0004493466,0.0005485757,0.0001980138,0.00005515587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005140659,"about_ca_system_score_gemma":0.00002319908,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009763351,"about_ca_topic_score_gemma":0.00001141998,"domain_scores_codex":[0.9991456,0.0001392868,0.0001709745,0.0002457213,0.0001061812,0.0001922806],"domain_scores_gemma":[0.9973059,0.0002532958,0.00006337276,0.0022272,0.00005876047,0.00009143264],"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.000001403167,0.00005410283,0.006888074,0.000004750151,0.0000242472,1.51275e-7,0.0006285597,0.000004468258,0.0002028955,0.9771392,0.0000585827,0.01499355],"study_design_scores_gemma":[0.0009569242,0.0002469919,0.06427123,0.00008093831,0.0000543535,0.00003187956,0.001558182,0.01064236,0.0001966977,0.7796491,0.1415551,0.0007562743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2203808,0.005708032,0.6360528,0.008032753,0.0003401436,0.0006552441,0.00002046471,0.0008496112,0.1279602],"genre_scores_gemma":[0.9692541,0.0004126181,0.02996331,0.0002625649,0.000008698355,0.00003908281,0.00001262976,0.000006770719,0.00004027733],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7488733,"threshold_uncertainty_score":0.4797294,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3121786052","doi":"10.1007/s12095-020-00469-5","title":"Quiescent photonics side channel analysis: Low cost SRAM readout attack","year":2021,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Integrated Circuits and Semiconductor Failure Analysis","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Photonics; Static random-access memory; Channel (broadcasting); Computer science; Substrate (aquarium); Flash (photography); Optoelectronics; Photon; Computer hardware; Embedded system; Materials science; Optics; Telecommunications; Physics","authors":[{"name":"Mustafa Faraj","is_ca":true},{"name":"Catherine H. Gebotys","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02512956895434567,"gpt":0.2511682808218927,"spread":0.226038711867547,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001042711,0.0001859269,0.0003122035,0.0003290481,0.0002891649,0.0001379994,0.0004172999,0.0001166041,0.00008118841],"category_scores_gemma":[0.00001576542,0.0001890919,0.0003271921,0.002182222,0.0001429343,0.0001182332,0.00008433464,0.000349848,0.00001450045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002581059,"about_ca_system_score_gemma":0.00002896981,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005556898,"about_ca_topic_score_gemma":0.001101971,"domain_scores_codex":[0.9990543,0.00007317357,0.0002998835,0.0002088211,0.0001154366,0.0002483887],"domain_scores_gemma":[0.9980339,0.00007915225,0.00004531149,0.001528724,0.0001923146,0.0001205545],"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.00007035889,0.004647015,0.04941957,0.001205449,0.09702615,0.0001570953,0.04564073,0.2042477,0.1066793,0.2927339,0.04681506,0.1513576],"study_design_scores_gemma":[0.001703686,0.00007535356,0.01537419,0.0004157491,0.01166615,0.00005906065,0.02437463,0.549916,0.02796331,0.005394322,0.3600535,0.003004054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6616343,0.1097124,0.06871212,0.003785785,0.0007524954,0.001139411,0.0006833636,0.002077073,0.1515031],"genre_scores_gemma":[0.9888615,0.009215411,0.001160778,0.0002079699,0.00001596074,0.00006333602,0.0004009733,0.00002148322,0.00005257077],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3456682,"threshold_uncertainty_score":0.7710943,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2130959496","doi":"10.1007/s12095-009-0013-3","title":"On the structural weakness of the GGHN stream cipher","year":2009,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Keystream; Stream cipher; RC4; Computer science; State (computer science); Stream cipher attack; Cryptanalysis; Computation; Arithmetic; Algorithm; Cryptography; Theoretical computer science; Parallel computing; Mathematics","authors":[{"name":"Aleksandar Kircanski","is_ca":true},{"name":"Amr Youssef","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0199745492284133,"gpt":0.2722364008669581,"spread":0.2522618516385448,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001615005,0.00008956523,0.00008314793,0.00007534614,0.0008054537,0.00008947016,0.001864462,0.0000279482,0.00001680049],"category_scores_gemma":[0.0000170441,0.00005031433,0.0001162875,0.0009019069,0.0003199947,0.0001209702,0.0002596864,0.0001717185,6.004146e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000033482,"about_ca_system_score_gemma":0.00001921548,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003655048,"about_ca_topic_score_gemma":0.00007098668,"domain_scores_codex":[0.9992639,0.0001545053,0.0001830552,0.0001257722,0.000148418,0.0001242996],"domain_scores_gemma":[0.9975206,0.0002632338,0.0001001529,0.002015981,0.00006884945,0.00003114354],"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.000001342524,0.00004264505,0.001503234,0.000001123487,0.00001272477,2.714709e-8,0.001161151,0.000002275366,0.00007526367,0.9811587,0.0002706314,0.01577091],"study_design_scores_gemma":[0.0002677928,0.0001001652,0.3038108,0.00002704654,0.00002025926,0.000004499108,0.0008430359,0.001689852,0.0003520261,0.6896492,0.003091622,0.0001436535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9364769,0.001071041,0.02113501,0.03180777,0.0001526491,0.0005313568,0.00002784482,0.00008554261,0.008711875],"genre_scores_gemma":[0.9952583,0.000132171,0.003819214,0.0007589376,0.000006172518,0.00001641063,0.000002804803,0.000002150118,0.00000387063],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3023076,"threshold_uncertainty_score":0.6194981,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400692708","doi":"10.1007/s12095-024-00723-0","title":"Uni/multi variate polynomial embeddings for zkSNARKs","year":2024,"lang":"en","type":"article","venue":"Cryptography and Communications","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":"Random variate; Polynomial; Mathematics; Computer science; Algebra over a field; Pure mathematics; Statistics; Mathematical analysis; Random variable","authors":[{"name":"Guang Gong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03445370602144283,"gpt":0.3140024348940348,"spread":0.279548728872592,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003638283,0.0001688808,0.0001547839,0.0003641854,0.0006688029,0.000665314,0.001735557,0.00009847813,0.000007467847],"category_scores_gemma":[0.00002406795,0.0001642725,0.0002189684,0.001089758,0.0002841371,0.000719314,0.0006584324,0.000257208,0.000007135798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008103286,"about_ca_system_score_gemma":0.00005196426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004019801,"about_ca_topic_score_gemma":0.00003780686,"domain_scores_codex":[0.9989071,0.000078051,0.000247647,0.0003985394,0.00009846474,0.0002701349],"domain_scores_gemma":[0.9975493,0.0004509422,0.00004610382,0.001748827,0.00007388791,0.0001309303],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000005699246,0.00009592969,0.0001812644,0.00003656708,0.00006859409,7.218236e-7,0.001413965,7.60304e-7,0.0002353044,0.9618938,0.003669539,0.03239783],"study_design_scores_gemma":[0.0007428531,0.0001411407,0.003233167,0.0001300305,0.00009394293,0.00002722676,0.0002993979,0.08530711,0.0002283137,0.187754,0.7214582,0.0005846025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001596763,0.009948271,0.9823595,0.003176372,0.000335939,0.000327595,0.000149429,0.0005031683,0.00160294],"genre_scores_gemma":[0.5724991,0.001817843,0.4249943,0.0003278731,0.00005779151,0.0001852314,0.00009410072,0.00001477743,0.000008948643],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7741398,"threshold_uncertainty_score":0.6698837,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055296824","doi":"10.1007/s12095-009-0012-4","title":"A new distinguishing and key recovery attack on NGG stream cipher","year":2009,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stream cipher; Keystream; Stream cipher attack; Computer science; RC4; Key (lock); Computer security; Encryption; Theoretical computer science; Arithmetic; Mathematics","authors":[{"name":"Aleksandar Kircanski","is_ca":true},{"name":"Rabeah Al-Zaidy","is_ca":true},{"name":"Amr Youssef","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03657837812165809,"gpt":0.282026855152945,"spread":0.2454484770312869,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002507861,0.0001665781,0.0001592277,0.0002126471,0.000650162,0.0003871936,0.001109343,0.00006610222,0.000009910024],"category_scores_gemma":[0.0000512481,0.0001624282,0.0001051462,0.000722819,0.0001409579,0.0003544088,0.0003030225,0.0002558273,0.000004119076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005783651,"about_ca_system_score_gemma":0.00002257898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002535079,"about_ca_topic_score_gemma":0.00002348655,"domain_scores_codex":[0.999009,0.0001348204,0.000204052,0.0003168342,0.0001180136,0.0002172866],"domain_scores_gemma":[0.9977509,0.0003371012,0.00009007463,0.001606284,0.00004210927,0.0001735506],"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.00001278237,0.00008541594,0.001068174,0.000003324679,0.00002210929,9.92581e-7,0.0009502977,0.000003287929,0.0000530951,0.718082,0.001187185,0.2785314],"study_design_scores_gemma":[0.0007815951,0.0008125406,0.06596614,0.0002324039,0.00005199388,0.00003064289,0.0002985348,0.001040758,0.0001085072,0.8652429,0.06477244,0.0006615284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2525286,0.01376441,0.5514531,0.020038,0.0003869857,0.0006769294,0.00002646157,0.001189167,0.1599364],"genre_scores_gemma":[0.9120392,0.0008439601,0.08615862,0.0008583792,0.00004130101,0.000009167446,0.000007375627,0.000006713141,0.00003532307],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6595106,"threshold_uncertainty_score":0.6623631,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985780997","doi":"10.1007/s12095-015-0131-z","title":"Linear complexity profile and correlation measure of interleaved sequences","year":2015,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Measure (data warehouse); Correlation; Linear correlation; Distance correlation; Statistics; Mathematics; Computer science; Data mining; Geometry","authors":[{"name":"Jing Jane He","is_ca":true},{"name":"Daniel Panario","is_ca":true},{"name":"Qiang Wang","is_ca":true},{"name":"Arne Winterhof","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09925557996039795,"gpt":0.2913021286730739,"spread":0.192046548712676,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005292048,0.00009732119,0.0001426327,0.0001783216,0.0002488847,0.00005644996,0.0007690801,0.00005192875,0.000003726825],"category_scores_gemma":[0.00004933106,0.00009087268,0.00005608847,0.0006204103,0.0008068885,0.0003204877,0.0004067926,0.0001500474,0.000001627085],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003971892,"about_ca_system_score_gemma":0.00003255052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004415505,"about_ca_topic_score_gemma":0.00003389126,"domain_scores_codex":[0.999141,0.0002447157,0.0002055988,0.0001738764,0.0001275744,0.0001071802],"domain_scores_gemma":[0.9985059,0.0001602932,0.0001174147,0.0009248798,0.0001841676,0.0001072873],"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.0000135961,0.00007693583,0.01057601,0.00001126477,0.00002931494,1.648547e-7,0.003522997,0.000003148545,0.0002009849,0.9688298,0.00009958936,0.01663617],"study_design_scores_gemma":[0.0007712512,0.0003722235,0.02122806,0.0001318325,0.00004581313,0.00002439727,0.001907698,0.03234977,0.000551162,0.9390306,0.003250215,0.0003369363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1448898,0.006070757,0.8332331,0.002031905,0.0001571605,0.0003905582,0.00002554455,0.0002447933,0.0129564],"genre_scores_gemma":[0.8837617,0.0001603353,0.1159812,0.00005475332,0.000007404392,0.00001811611,0.00001042096,0.000003307136,0.000002726859],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7388719,"threshold_uncertainty_score":0.370568,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385891514","doi":"10.1007/s12095-023-00656-0","title":"The welch-gong stream cipher - evolutionary path","year":2023,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stream cipher; Computer science; Cipher; Transposition cipher; Block cipher mode of operation; Cryptography; Stream cipher attack; Path (computing); Encryption; Theoretical computer science; Permutation (music); Running key cipher; Algorithm; Computer security; Programming language","authors":[{"name":"Nuša Zidarič","is_ca":false},{"name":"Kalikinkar Mandal","is_ca":true},{"name":"Guang Gong","is_ca":true},{"name":"Mark D. Aagaard","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02073569150712341,"gpt":0.2539297092273526,"spread":0.2331940177202292,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004900956,0.0001279478,0.00009527067,0.000195809,0.002351791,0.0002522054,0.002259235,0.0000534863,0.000007796424],"category_scores_gemma":[0.00003008114,0.0000995224,0.0001455488,0.002128275,0.0005662414,0.0002875371,0.001017162,0.0002231974,0.00004183905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006027634,"about_ca_system_score_gemma":0.00002906407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001307678,"about_ca_topic_score_gemma":0.00002169494,"domain_scores_codex":[0.9988843,0.0002354768,0.0001968616,0.000236783,0.0001587889,0.0002877746],"domain_scores_gemma":[0.9966794,0.0007218672,0.00006818451,0.002364381,0.00007248748,0.0000937049],"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.000003139764,0.00004009649,0.002679047,0.000002973744,0.00003493151,6.986698e-7,0.0005382544,0.000003208516,0.00003582584,0.9341756,0.003991874,0.05849436],"study_design_scores_gemma":[0.000222692,0.00006749324,0.07723753,0.00003207873,0.0000191878,0.000009827845,0.0008092817,0.005603217,0.000019405,0.6497075,0.2660119,0.0002599494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.189124,0.07181745,0.4246944,0.1009021,0.002813987,0.002534581,0.0001675623,0.009614113,0.1983318],"genre_scores_gemma":[0.983764,0.005589046,0.01013484,0.0002185395,0.00003246129,0.0001477801,0.00002218774,0.0000103022,0.0000808242],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.79464,"threshold_uncertainty_score":0.998947,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4321015079","doi":"10.1007/s12095-022-00623-1","title":"Comparing balanced sequences obtained from ElGamal function to random balanced sequences","year":2023,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"ElGamal encryption; Mathematics; Combinatorics; Discrete mathematics; Randomness; Modulo; Function (biology); Random function; Golomb coding; Prime (order theory); Sequence (biology); Random variable; Computer science; Public-key cryptography","authors":[{"name":"Daniel Panario","is_ca":true},{"name":"Lucas Pandolfo Perin","is_ca":false},{"name":"Brett Stevens","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03930673683234109,"gpt":0.2698127270029333,"spread":0.2305059901705922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000593862,0.0002315625,0.0003191129,0.0005131633,0.00105825,0.0003879549,0.002148748,0.00008511954,0.00001937811],"category_scores_gemma":[0.00005486207,0.0002241238,0.0001756616,0.003200974,0.00032884,0.0005353155,0.0007580271,0.0002591147,0.00005583021],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001284039,"about_ca_system_score_gemma":0.00003976353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001462312,"about_ca_topic_score_gemma":0.0001375567,"domain_scores_codex":[0.9981729,0.0003370506,0.0003543434,0.0005032463,0.0002429742,0.000389428],"domain_scores_gemma":[0.9970522,0.0007104594,0.000123067,0.001801988,0.0001105902,0.0002016876],"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.0002294876,0.0001504443,0.08018717,0.00002626705,0.00029596,0.000005063417,0.005537372,0.0004195586,0.01333452,0.8490877,0.00134754,0.04937889],"study_design_scores_gemma":[0.002819133,0.000391303,0.2823281,0.0002797747,0.0001165072,0.000008613671,0.002422955,0.03634932,0.001043018,0.6482523,0.02482333,0.0011656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5875821,0.001685949,0.3974108,0.004742743,0.000522373,0.0005371874,0.00003933424,0.001590147,0.005889291],"genre_scores_gemma":[0.9762305,0.0006369815,0.02226867,0.0005407368,0.00005159237,0.0001671207,0.00008048542,0.00001095728,0.00001295486],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3886484,"threshold_uncertainty_score":0.9139505,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4404597517","doi":"10.1007/s12095-024-00756-5","title":"On the counting of involutory MDS matrices","year":2024,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Complex Hadamard matrix; Circulant matrix; Hadamard transform; Hadamard matrix; Mathematics; Hadamard's maximal determinant problem; Hadamard's inequality; Matrix (chemical analysis); Hadamard three-lines theorem; Order (exchange); Combinatorics; Discrete mathematics","authors":[{"name":"Susanta Kumar Samanta","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02329012407093261,"gpt":0.2529769112514176,"spread":0.229686787180485,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000527942,0.00008520066,0.00008250042,0.000253201,0.0004062824,0.0001905435,0.0014754,0.00003374065,0.0000127457],"category_scores_gemma":[0.00002358615,0.00006042261,0.0001159839,0.001246943,0.0003673465,0.0001978422,0.0003586463,0.0002025092,0.000006337691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003164928,"about_ca_system_score_gemma":0.00002212542,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001106612,"about_ca_topic_score_gemma":0.000005082176,"domain_scores_codex":[0.9993117,0.0001445686,0.0001605706,0.0001555067,0.0001172394,0.0001104421],"domain_scores_gemma":[0.9972633,0.001271036,0.00004803556,0.001345178,0.00004235687,0.00003009193],"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.000001379876,0.00003093299,0.0002165357,0.00001905571,0.00003229865,2.354363e-7,0.0009196722,0.000001255512,0.0001699183,0.9806874,0.0006224297,0.01729888],"study_design_scores_gemma":[0.00006696711,0.00008429687,0.001715676,0.0002262998,0.0000292334,0.00000526159,0.0003775539,0.005844102,0.000264603,0.9417987,0.04942811,0.0001591758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2763236,0.1185186,0.479559,0.02051835,0.000849308,0.0007174952,0.00004459971,0.001336054,0.102133],"genre_scores_gemma":[0.9925399,0.001362159,0.005788088,0.000254379,0.00001224328,0.00002966869,0.000001677994,0.000005036412,0.000006813092],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7162163,"threshold_uncertainty_score":0.3124837,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2800569707","doi":"10.1007/s12095-018-0301-x","title":"Error analysis of weak Poly-LWE instances","year":2018,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Learning with errors; Gaussian; Encryption; Distribution (mathematics); Error detection and correction; Algorithm; Computer science; Error analysis; Algebraic number; Mathematics; Cryptography; Applied mathematics; Physics; Mathematical analysis","authors":[{"name":"Yao Chen","is_ca":true},{"name":"Benjamin M. Case","is_ca":false},{"name":"Shuhong Gao","is_ca":false},{"name":"Guang Gong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03121228252270323,"gpt":0.2987014544463359,"spread":0.2674891719236326,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002549448,0.0001151157,0.0002329527,0.0007925073,0.0004612994,0.00008917305,0.001975292,0.0000641005,0.00002573432],"category_scores_gemma":[0.00001808442,0.0001098202,0.0001936592,0.004888583,0.001019031,0.000443972,0.0006134923,0.0001358805,0.000003086413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002950194,"about_ca_system_score_gemma":0.00002430244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001144731,"about_ca_topic_score_gemma":0.0007344985,"domain_scores_codex":[0.9990147,0.0001217946,0.0002843739,0.0002554998,0.0001511296,0.000172496],"domain_scores_gemma":[0.9967883,0.0001831771,0.0001501687,0.002635185,0.0001517873,0.00009136097],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.000004816398,0.0001402127,0.01693123,0.00000503397,0.0003787989,8.801709e-8,0.001489959,2.779975e-7,0.0001352421,0.9619247,0.0002195078,0.01877016],"study_design_scores_gemma":[0.0008743436,0.0004852326,0.5356175,0.00007705158,0.001378324,0.000006415216,0.002609814,0.01923313,0.001290624,0.2210607,0.2164278,0.0009389648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08060867,0.01542906,0.8576781,0.002057651,0.0001801515,0.0002430509,0.0002322549,0.0002857508,0.04328528],"genre_scores_gemma":[0.8984308,0.001244034,0.1001088,0.0001430776,0.00001287143,0.00001573727,0.00004002241,0.000003154173,0.000001415544],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8178222,"threshold_uncertainty_score":0.4478339,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2757847923","doi":"10.1007/s12095-017-0256-3","title":"Characteristic digit-sum sequences","year":2017,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Finite field; Autocorrelation; Complementary sequences; Binary number; Mathematics; Numerical digit; Nonlinear system; Primitive polynomial; Sequence (biology); Discrete mathematics; Combinatorics; Arithmetic; Statistics; Biology; Physics; Genetics","authors":[{"name":"Aleksandr Tuxanidy","is_ca":true},{"name":"Qiang Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03788298953616897,"gpt":0.2873308536251481,"spread":0.2494478640889791,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002210814,0.0001274872,0.0001356122,0.0001432445,0.002514892,0.001070381,0.004063666,0.00005015138,0.00001044132],"category_scores_gemma":[0.00005139939,0.0001203966,0.0001117361,0.0001999044,0.0008281388,0.0008796969,0.00112176,0.0001751846,0.00001327363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003370233,"about_ca_system_score_gemma":0.0000213332,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002546001,"about_ca_topic_score_gemma":0.00001983954,"domain_scores_codex":[0.9991957,0.00008553284,0.0001672787,0.0002496354,0.0001030843,0.0001987754],"domain_scores_gemma":[0.9954128,0.0001487567,0.0001652644,0.004101728,0.00006229946,0.000109181],"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.000002240073,0.00005044568,0.01010126,0.00000565681,0.00002478382,0.000001092613,0.0003865014,6.494697e-8,0.0002136585,0.8978069,0.00006802529,0.09133936],"study_design_scores_gemma":[0.0003265172,0.0001035247,0.2004297,0.00008247268,0.00003217372,0.00002545778,0.0001376277,0.0007077483,0.000370465,0.7187731,0.07854818,0.0004630419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3289704,0.00638813,0.4516016,0.02906166,0.001128652,0.0007730598,0.00007574141,0.001352565,0.1806482],"genre_scores_gemma":[0.9811884,0.001075844,0.01741202,0.0002236322,0.00002403512,0.00004503624,0.000006399493,0.000005283619,0.00001933563],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.652218,"threshold_uncertainty_score":0.9999666,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2073411533","doi":"10.1007/s12095-014-0101-x","title":"Revisiting iterated attacks in the context of decorrelation theory","year":2014,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Canadian Imperial Bank of Commerce (Canada)","funders":"","keywords":"Decorrelation; Iterated function; Stream cipher; Ciphertext; Computer science; Cipher; Plaintext; Mathematics; Theoretical computer science; Block cipher; Algorithm; Context (archaeology); Generalization; Discrete mathematics; Cryptography; Encryption; Computer security","authors":[{"name":"Aslí Bay","is_ca":false},{"name":"Atefeh Mashatan","is_ca":true},{"name":"Serge Vaudenay","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02313353761003308,"gpt":0.2916046607366958,"spread":0.2684711231266628,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001172253,0.00006883177,0.00009890058,0.0002026316,0.0002947389,0.000089225,0.0009094594,0.00003037849,0.000005060235],"category_scores_gemma":[0.00005561173,0.00005419211,0.00005748246,0.0009706773,0.0001724269,0.0002194701,0.0001536783,0.0001447455,0.000001067918],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000271317,"about_ca_system_score_gemma":0.000009954582,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004698776,"about_ca_topic_score_gemma":0.00008897278,"domain_scores_codex":[0.9988286,0.0005789089,0.0002762576,0.0001195091,0.0000928457,0.0001039169],"domain_scores_gemma":[0.99784,0.0009031706,0.0001162651,0.001039599,0.00007962171,0.00002132413],"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.000001504664,0.00003375007,0.01741427,0.000005188128,0.000006443944,4.470581e-8,0.00653451,0.000001022178,0.00003390996,0.8797396,0.00002451956,0.09620528],"study_design_scores_gemma":[0.001407181,0.0001527077,0.4485294,0.0001722519,0.00004767867,0.00001729174,0.01568937,0.03838823,0.0001197376,0.4688948,0.02617508,0.0004063068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2624155,0.00193032,0.7260624,0.003482185,0.00005066249,0.0003343865,0.000008816037,0.0000542418,0.00566144],"genre_scores_gemma":[0.9852753,0.0003282753,0.01389872,0.0004345758,0.000007435898,0.00003181196,0.00002073575,0.00000241596,6.830123e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7228598,"threshold_uncertainty_score":0.2266923,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4311209563","doi":"10.1007/s12095-022-00616-0","title":"Self-dual and LCD double circulant and double negacirculant codes over a family of finite rings $ \\mathbb {F}_{q}[v_{1}, v_{2},\\dots ,v_{t}]$","year":2022,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Circulant matrix; Dual (grammatical number); Finite field; Physics; Discrete mathematics; Arithmetic; Crystallography; Combinatorics; Mathematics; Chemistry; Art","authors":[{"name":"Hai Q. Dinh","is_ca":false},{"name":"Bhanu Pratap Yadav","is_ca":false},{"name":"Tushar Bag","is_ca":true},{"name":"Daniel Panario","is_ca":true},{"name":"A. Upadhyay","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02588309565317558,"gpt":0.2478974387774839,"spread":0.2220143431243083,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007110301,0.0002736837,0.00037282,0.0005254422,0.001483078,0.0002636526,0.001239358,0.00007718898,0.00001500611],"category_scores_gemma":[0.000007508525,0.0002856769,0.0001660996,0.001283317,0.000583827,0.0004400205,0.002146742,0.0004276128,0.000001075944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001414008,"about_ca_system_score_gemma":0.00005926417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001594409,"about_ca_topic_score_gemma":0.0000282959,"domain_scores_codex":[0.9981331,0.0002517236,0.0004330088,0.0005131576,0.0003136658,0.0003553744],"domain_scores_gemma":[0.9972948,0.0004031432,0.0002354968,0.001789602,0.00009030991,0.0001866572],"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.0001056826,0.0005051389,0.01494616,0.000115668,0.0002576587,0.000006462757,0.008512778,0.00003276917,0.002384176,0.968336,0.0001789534,0.004618491],"study_design_scores_gemma":[0.02086966,0.002354891,0.2301464,0.0005224326,0.001040176,0.0009041324,0.01033381,0.0472508,0.002111568,0.4395426,0.2405282,0.00439534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9611458,0.01440597,0.01742773,0.0009682784,0.0001589514,0.0006409743,0.0001143466,0.0003938839,0.004744126],"genre_scores_gemma":[0.9853929,0.002659884,0.01134825,0.0003531314,0.00001459674,0.0001772427,0.00002816322,0.00001773129,0.00000809416],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5287935,"threshold_uncertainty_score":0.9999595,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3086805570","doi":"10.1007/s12095-021-00490-2","title":"Kim-type APN functions are affine equivalent to Gold functions","year":2021,"lang":"en","type":"preprint","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Type (biology); Permutation (music); Affine transformation; Combinatorics; Mathematics; Function (biology); Physics; Pure mathematics","authors":[{"name":"Benjamin Chase","is_ca":true},{"name":"Petr Lisoněk","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04773061018136424,"gpt":0.2785821571845635,"spread":0.2308515470031993,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004849102,0.0005129848,0.0005285172,0.001016325,0.001165587,0.000983578,0.003733607,0.000295177,0.00009241694],"category_scores_gemma":[0.0001021503,0.0005655131,0.0005711087,0.003308837,0.0003707714,0.0004058893,0.00781235,0.001285101,0.00005710708],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004090635,"about_ca_system_score_gemma":0.0001735992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006226034,"about_ca_topic_score_gemma":0.0003822608,"domain_scores_codex":[0.9970605,0.0004696992,0.0005797455,0.001052245,0.0003372686,0.0005005553],"domain_scores_gemma":[0.9911398,0.0003900425,0.0002926982,0.007165091,0.0005883684,0.0004239773],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001033166,0.003159381,0.00868143,0.0004483323,0.001895014,0.00002210307,0.008838974,0.001359925,0.001277677,0.7407731,0.03131815,0.2021226],"study_design_scores_gemma":[0.001752911,0.001076288,0.09985293,0.002841468,0.001413242,0.0001491496,0.01225812,0.005096803,0.0003201955,0.1441542,0.7254925,0.005592144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03948375,0.01363239,0.8947939,0.0168251,0.003272485,0.001263594,0.0002552626,0.001439743,0.02903379],"genre_scores_gemma":[0.9280721,0.003395288,0.06561815,0.001259669,0.0001798586,0.0006314907,0.0004169301,0.00004773729,0.0003787672],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8885884,"threshold_uncertainty_score":0.9996796,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4386863539","doi":"10.1007/s12095-023-00674-y","title":"Some classes of permutation binomials and trinomials of index $$q-1$$ over $${\\mathbb {F}_{q^n}}$$","year":2023,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Trinomial; Combinatorics; Permutation (music); Prime (order theory); Mathematics; Prime power; Degree (music); Discrete mathematics; Polynomial; Physics","authors":[{"name":"Rohit Gupta","is_ca":false},{"name":"Luciane Quoos","is_ca":false},{"name":"Qiang Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02931724793707374,"gpt":0.2847397981237077,"spread":0.255422550186634,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005552877,0.0001222501,0.0002580975,0.0006768204,0.0002329838,0.00005875604,0.0008422335,0.00007604923,0.000004657974],"category_scores_gemma":[0.00004511351,0.0001211518,0.0001228538,0.0014363,0.0005448265,0.0004404212,0.0005554542,0.0001089974,0.000001337114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003061135,"about_ca_system_score_gemma":0.00003215339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002887004,"about_ca_topic_score_gemma":0.000008906547,"domain_scores_codex":[0.9989036,0.0002027767,0.0003855467,0.0002170013,0.0001366165,0.000154474],"domain_scores_gemma":[0.9977389,0.0007037638,0.0002237834,0.001178296,0.00008938746,0.00006589952],"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.00001429832,0.00008462808,0.01895155,0.00005680649,0.00006283612,2.588235e-7,0.001503199,0.000007383936,0.005771451,0.9521762,0.0001110561,0.0212603],"study_design_scores_gemma":[0.0009867077,0.0002088512,0.3957283,0.0001206549,0.00006081989,0.000006222544,0.0007676348,0.003347294,0.004418517,0.5908868,0.00313901,0.0003291723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9803625,0.003639285,0.01394793,0.0006587358,0.00008462572,0.0002437892,0.00003420593,0.0001644277,0.0008645155],"genre_scores_gemma":[0.9909927,0.004325831,0.004556997,0.00005272216,0.00001405628,0.00003451348,0.00001142043,0.000006989407,0.000004738657],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3767768,"threshold_uncertainty_score":0.4940429,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4405262838","doi":"10.1007/s12095-024-00761-8","title":"On the stability of $$b^q(x+a)^{q+1}+x$$ from the perspective of periodic sequences","year":2024,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Perspective (graphical); Stability (learning theory); Crystallography; Mathematics; Computer science; Chemistry; Geometry","authors":[{"name":"T. Lin","is_ca":true},{"name":"Qiang Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03811957096684519,"gpt":0.274348788150973,"spread":0.2362292171841278,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005974214,0.00009306654,0.0001156931,0.00008455421,0.0004053766,0.000110888,0.001986207,0.00003211148,0.00003835772],"category_scores_gemma":[0.00007443615,0.00005147102,0.0001783259,0.001048098,0.001490859,0.0001352325,0.0003574272,0.0002346259,0.000001614843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006076169,"about_ca_system_score_gemma":0.00005039238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002263164,"about_ca_topic_score_gemma":0.00004893485,"domain_scores_codex":[0.9989738,0.0003993608,0.0001916633,0.0001971112,0.0001454896,0.00009257638],"domain_scores_gemma":[0.994527,0.003270799,0.00006828624,0.002005716,0.0001028609,0.00002536965],"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.000005169851,0.00005286772,0.0008308547,0.000006121209,0.0000674574,9.836781e-8,0.01026828,8.318598e-7,0.0004642419,0.9844943,0.00008273793,0.003727089],"study_design_scores_gemma":[0.00004707807,0.0000896924,0.006034567,0.00009705075,0.00002945494,9.750464e-7,0.005568358,0.0007949396,0.001223843,0.9846226,0.001416111,0.00007535428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7912571,0.04840897,0.0919528,0.04448976,0.0002880052,0.0006481319,0.0002166884,0.0002421565,0.02249638],"genre_scores_gemma":[0.9965073,0.0007283753,0.002566842,0.0001509916,0.000008913381,0.00003143776,0.000002158716,0.000003244355,7.567835e-7],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2052502,"threshold_uncertainty_score":0.5493133,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3209060430","doi":"10.1007/s12095-022-00580-9","title":"Construction of APN permutations via Walsh zero spaces","year":2022,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subspace topology; Combinatorics; Mathematics; Zero (linguistics); Space (punctuation); Vector space; Inverse; Affine transformation; Affine space; Discrete mathematics; Pure mathematics; Mathematical analysis; Geometry; Computer science","authors":[{"name":"Benjamin Chase","is_ca":true},{"name":"Petr Lisoněk","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01504464115242414,"gpt":0.2356338638127722,"spread":0.220589222660348,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003113824,0.0001002024,0.0001351766,0.0003856844,0.001261111,0.00006783583,0.001309265,0.00002643972,0.00004627348],"category_scores_gemma":[0.00001118387,0.0001117737,0.0001332124,0.001434906,0.0005000617,0.0002493194,0.0008469639,0.0002186764,0.000001246984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007321376,"about_ca_system_score_gemma":0.00002950526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002804299,"about_ca_topic_score_gemma":0.000006551532,"domain_scores_codex":[0.9989691,0.0002954072,0.0002320569,0.0001995829,0.0001655207,0.0001382735],"domain_scores_gemma":[0.9981168,0.0002428423,0.0001520818,0.001349149,0.00007893676,0.00006016939],"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.000004843475,0.00011895,0.002781362,0.000006596028,0.00003812818,2.389438e-7,0.001662083,0.00002412663,0.0005483894,0.9526973,0.00006859897,0.04204932],"study_design_scores_gemma":[0.0003663944,0.0002101705,0.006247845,0.00001343741,0.00004727085,0.00006960793,0.002172403,0.003049008,0.0003881606,0.9630455,0.02411997,0.0002702789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06037271,0.002851276,0.9220455,0.003113048,0.0002200699,0.000257956,0.00004772746,0.0002329548,0.01085871],"genre_scores_gemma":[0.9295359,0.0002574532,0.06994256,0.000124135,0.000005285903,0.000105932,0.00001865964,0.000005299036,0.000004829777],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8691632,"threshold_uncertainty_score":0.9699573,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4411790448","doi":"10.1007/s12095-025-00823-5","title":"New successor rules to efficiently produce exponentially many binary de Bruijn sequences","year":2025,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Science Foundation of Fujian Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Nanyang Technological University","keywords":"De Bruijn sequence; Successor cardinal; Binary number; Computer science; Sequence (biology); Arithmetic; Combinatorics; Mathematics; Biology; Genetics","authors":[{"name":"Zuling Chang","is_ca":false},{"name":"Martianus Frederic Ezerman","is_ca":false},{"name":"Pinhui Ke","is_ca":false},{"name":"Qiang Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01494840563939523,"gpt":0.2771713694160146,"spread":0.2622229637766194,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004962498,0.0001799264,0.0001742566,0.0006466857,0.0008728638,0.0003974469,0.003119458,0.00006814965,0.00001349676],"category_scores_gemma":[0.00004322949,0.0001811991,0.0001401165,0.002175171,0.0002396756,0.0003206558,0.001138487,0.0002090356,0.00001301265],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001374396,"about_ca_system_score_gemma":0.0001638508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001084075,"about_ca_topic_score_gemma":0.00004586039,"domain_scores_codex":[0.9986041,0.0002385971,0.0002631892,0.0004240421,0.0001431948,0.0003268587],"domain_scores_gemma":[0.9971925,0.0002543263,0.0000707984,0.002199152,0.00009318632,0.000190007],"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.00001577027,0.0001346084,0.002597185,0.0000182067,0.0000505753,0.000001138056,0.001391101,0.00002668442,0.003032863,0.9321246,0.001670987,0.05893631],"study_design_scores_gemma":[0.0009458884,0.000391414,0.09504763,0.0005237332,0.0001373536,0.00002320933,0.0008757468,0.002633365,0.006088919,0.7627465,0.1295691,0.001017142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.132479,0.005256612,0.8366244,0.01499373,0.0002229225,0.0004089757,0.000009513085,0.0003887167,0.009616083],"genre_scores_gemma":[0.7761775,0.0005362764,0.2220553,0.0009878807,0.00002385701,0.00009285515,0.000008020277,0.000007091389,0.0001112343],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6436985,"threshold_uncertainty_score":0.7389084,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4396773962","doi":"10.1007/s12095-024-00720-3","title":"Additive codes with few weights","year":2024,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Mathematics","authors":[{"name":"Daniel Panario","is_ca":true},{"name":"Murat Şahin","is_ca":false},{"name":"Qiang Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01363597107798028,"gpt":0.2440361152280393,"spread":0.230400144150059,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017944,0.000136995,0.0001150494,0.0003184736,0.0005342501,0.0004275305,0.00115354,0.00004379706,0.00002031649],"category_scores_gemma":[0.000004636664,0.0001068229,0.0000961799,0.001371825,0.00046904,0.0004673671,0.0003265461,0.0002269348,0.00001601719],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004758372,"about_ca_system_score_gemma":0.0000357866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009436538,"about_ca_topic_score_gemma":0.00002872648,"domain_scores_codex":[0.9991796,0.000121156,0.0001262342,0.0002846257,0.0001128579,0.0001755347],"domain_scores_gemma":[0.9980598,0.0004130025,0.00002783684,0.001349256,0.00005787597,0.00009219634],"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.000003761121,0.00004080568,0.0002357481,0.0000104688,0.00007313075,0.000002945921,0.001071265,2.614789e-7,0.00002991167,0.9319251,0.0003955767,0.06621107],"study_design_scores_gemma":[0.000218869,0.0002307023,0.003888412,0.0003009181,0.00006670609,0.00006636691,0.00039114,0.002809152,0.0003550335,0.6615623,0.3296907,0.0004197839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01391305,0.02716504,0.8896034,0.005755067,0.0002001686,0.0003362016,0.00006116031,0.001402313,0.06156362],"genre_scores_gemma":[0.9299183,0.002171465,0.06753328,0.0002119733,0.00002282828,0.00008775474,0.00001875008,0.000009581116,0.00002606298],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9160053,"threshold_uncertainty_score":0.4356113,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2284443012","doi":"10.1007/s12095-016-0208-3","title":"Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences","year":2016,"lang":"en","type":"preprint","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Character (mathematics); Autocorrelation; Stream cipher; Cipher; Algorithm; Cryptography; Binary number; Mathematics; Sequence (biology); Computer science; Discrete mathematics; Arithmetic; Statistics; Encryption","authors":[{"name":"Şaban Alaca","is_ca":true},{"name":"Goldwyn Millar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02833204586572379,"gpt":0.2651129283421842,"spread":0.2367808824764604,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0006195752,0.0003158154,0.0003622575,0.0003303555,0.0006833759,0.0002187799,0.006819507,0.0002199239,0.00001659576],"category_scores_gemma":[0.0000393189,0.0002096574,0.000543879,0.0007228442,0.001504631,0.0002133475,0.005623914,0.0006303356,0.000004223646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001116222,"about_ca_system_score_gemma":0.0001201723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003030068,"about_ca_topic_score_gemma":0.00001991795,"domain_scores_codex":[0.9978185,0.0006127069,0.000504547,0.0004967466,0.0002900658,0.0002774566],"domain_scores_gemma":[0.9928015,0.0004778143,0.0005189154,0.00588484,0.0002178685,0.00009902632],"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.000005728182,0.0001099695,0.007914962,0.00006251503,0.0001611529,2.779597e-7,0.001761364,0.000001737085,0.001017129,0.9711236,0.0002465674,0.01759501],"study_design_scores_gemma":[0.0001682909,0.00003939007,0.02850661,0.0005874421,0.00007699249,0.000006997857,0.000117627,0.0001855047,0.001082181,0.9589887,0.009872191,0.0003681075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5468581,0.03919182,0.2721407,0.06426697,0.003840672,0.003569691,0.0006645363,0.00121013,0.06825739],"genre_scores_gemma":[0.9847535,0.002235428,0.01238162,0.0003965583,0.00005601863,0.0001254429,0.00001014923,0.0000144732,0.00002678737],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4378955,"threshold_uncertainty_score":0.9985541,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4409873972","doi":"10.1007/s12095-025-00798-3","title":"An effective approach to enumerate universal cycles for k-permutations","year":2025,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Foundation of Henan Educational Committee; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Enumeration; Mathematics; Combinatorics; Discrete mathematics","authors":[{"name":"Zuling Chang","is_ca":false},{"name":"Qiang Wang","is_ca":true},{"name":"Jie Xue","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008558640135579046,"gpt":0.2534321535233065,"spread":0.2448735133877274,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001150106,0.00009258734,0.0001085161,0.0002433649,0.0004003366,0.00005260423,0.0003211783,0.00004779547,8.787088e-7],"category_scores_gemma":[0.000006928181,0.00009943877,0.00006035262,0.000529518,0.00009511539,0.0001098292,0.00002996105,0.00008397623,0.000001316069],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008427747,"about_ca_system_score_gemma":0.000005817422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008441521,"about_ca_topic_score_gemma":0.00001511854,"domain_scores_codex":[0.999559,0.00008039127,0.0001074792,0.0001130672,0.00002624077,0.0001138038],"domain_scores_gemma":[0.999115,0.0001599476,0.00001145845,0.0006038031,0.00004804396,0.00006167325],"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.00001089023,0.00008807127,0.0007387581,0.00005730017,0.0001223739,2.977536e-8,0.002086853,0.001976893,0.001635725,0.9826105,0.0002620172,0.01041062],"study_design_scores_gemma":[0.003497408,0.0004702511,0.132725,0.0004132898,0.000714867,0.00001006379,0.03543289,0.1627774,0.00504731,0.5232379,0.133821,0.001852627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1765308,0.001925829,0.7747369,0.0001753169,0.000128184,0.001189321,0.00009919181,0.0004076454,0.04480677],"genre_scores_gemma":[0.9913153,0.0000865109,0.007809919,0.00005592561,0.000008902864,0.0006438233,0.00005809328,0.00001009855,0.00001141697],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8147845,"threshold_uncertainty_score":0.4054996,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4413224920","doi":"10.1007/s12095-025-00829-z","title":"New Turyn-type sequences","year":2025,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Approximation Theory and Sequence Spaces","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Type (biology); Computer science; Biology","authors":[{"name":"Stephen London","is_ca":false},{"name":"Ilias Kotsireas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05563705351840285,"gpt":0.3583692880045586,"spread":0.3027322344861557,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001992905,0.00008576219,0.0001151113,0.0001357487,0.0003988479,0.00005808166,0.0004747702,0.00005741507,0.00006318895],"category_scores_gemma":[0.0001131264,0.00007638978,0.00004959931,0.0006261566,0.0002699602,0.0001327688,0.0001267477,0.000136558,0.000005873067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005402457,"about_ca_system_score_gemma":0.00006309885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002171666,"about_ca_topic_score_gemma":0.0000334806,"domain_scores_codex":[0.9994636,0.0001008927,0.0001647558,0.0001108076,0.00005845391,0.0001015157],"domain_scores_gemma":[0.9985998,0.0004076663,0.00005843759,0.0008199407,0.00006454514,0.00004960395],"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.000005261931,0.00002444274,0.0007088431,0.00001686933,0.00003187854,8.948132e-8,0.0006537503,2.40089e-7,0.0002031138,0.987467,0.002764367,0.008124153],"study_design_scores_gemma":[0.0001054763,0.00001516701,0.0004040423,0.00004746409,0.00003355711,0.000001568292,0.001094738,0.0000446953,0.0004546705,0.9785318,0.01918642,0.00008040261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1281988,0.01953061,0.3271729,0.02802252,0.0004452242,0.001046364,0.00001783351,0.0009005109,0.4946653],"genre_scores_gemma":[0.81753,0.00149456,0.1795495,0.0003562268,0.0000151616,0.00002349222,0.000009444245,0.000006211708,0.001015453],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6893311,"threshold_uncertainty_score":0.3115085,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}