{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":159,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":159,"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":"841f66641ad2","filters":{"venue":"Designs Codes and Cryptography"}},"results":[{"id":"W1754939103","doi":"10.1023/a:1008354106356","title":"The State of Elliptic Curve Cryptography","year":2000,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":668,"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":"Discrete logarithm; Public-key cryptography; Multiplicative function; Mathematics; Modulo; Cryptosystem; Elliptic curve cryptography; Elliptic curve; Cryptography; Arithmetic; Key (lock); Diffie–Hellman key exchange; Prime (order theory); Discrete mathematics; Logarithm; Computer science; Pure mathematics; Algorithm; Combinatorics; Computer security; Key exchange; Encryption","authors":[{"name":"Neal Koblitz","is_ca":false},{"name":"Alfred Menezes","is_ca":true},{"name":"Scott A. Vanstone","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0106775203571429,"gpt":0.2186878329867931,"spread":0.2080103126296502,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006006673,0.0007053165,0.001225256,0.00312519,0.002884011,0.01076369,0.00147357,0.004666646,0.005974757],"category_scores_gemma":[0.01488252,0.0009137201,0.0005760495,0.004169207,0.01606915,0.02327198,0.004436087,0.01261441,0.002709457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003607925,"about_ca_system_score_gemma":0.002720306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008980347,"about_ca_topic_score_gemma":0.0004105888,"domain_scores_codex":[0.9958287,0.001347474,0.0002866377,0.0007269275,0.001454809,0.0003553402],"domain_scores_gemma":[0.988398,0.006030548,0.0006504888,0.002749855,0.001708762,0.0004623932],"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.00007866194,0.00003983699,0.0001456228,0.0001767128,0.000009844044,0.00002629972,0.000312925,0.0007300262,0.0004483204,0.9443856,0.006840991,0.04680509],"study_design_scores_gemma":[0.00002356173,0.00004432785,0.0001197299,0.0002396098,0.00000924192,0.00006248105,0.00009382291,0.002389739,0.0008306449,0.8723568,0.1237985,0.00003149443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.03562805,0.3292655,0.1669951,0.1308384,0.01044468,0.0001753098,0.0008796202,0.0006501788,0.3251231],"genre_scores_gemma":[0.6721773,0.2015847,0.04877789,0.01171139,0.02813956,0.000267923,0.0005565085,0.000211814,0.03657301],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.01076369,"threshold_uncertainty_score":0.03176671,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1927099252","doi":"10.1023/a:1022595222606","title":"An Efficient Protocol for Authenticated Key Agreement","year":2003,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":513,"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":"National Security Agency","keywords":"Key (lock); Protocol (science); Standardization; Computer science; Computer security; Operating system; Medicine","authors":[{"name":"Laurie Law","is_ca":false},{"name":"Alfred Menezes","is_ca":true},{"name":"Minghua Qu","is_ca":false},{"name":"Jerry Solinas","is_ca":false},{"name":"Scott A. Vanstone","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04136267479298559,"gpt":0.3335327797335682,"spread":0.2921701049405826,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005081635,0.001174634,0.001563217,0.001477434,0.002461343,0.004061386,0.003087252,0.002847783,0.006687845],"category_scores_gemma":[0.009882995,0.001175397,0.001015812,0.002177,0.002625172,0.009015481,0.007092945,0.004258597,0.004045961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001696074,"about_ca_system_score_gemma":0.003987882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004942736,"about_ca_topic_score_gemma":0.0006849199,"domain_scores_codex":[0.9917539,0.002350327,0.0006501168,0.0007298538,0.003815676,0.000700156],"domain_scores_gemma":[0.9934334,0.001827865,0.0004924936,0.002766397,0.001217572,0.0002622352],"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.0005111994,0.0001464474,0.0001747785,0.0002351976,0.00007082753,0.0002534381,0.0003452466,0.01128817,0.01456274,0.8708382,0.01118378,0.09038997],"study_design_scores_gemma":[0.0004540821,0.0003885645,0.000217595,0.0001677651,0.0002402427,0.0008782431,0.0001350148,0.1966539,0.0355773,0.6500139,0.1150761,0.0001972133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005787799,0.0003708925,0.983623,0.0006513238,0.0003176939,0.0003772354,0.0001397866,0.0009245654,0.007807749],"genre_scores_gemma":[0.2713516,0.000965097,0.691364,0.0006709673,0.0004872168,0.001563199,0.0008056542,0.0003726075,0.03241968],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006687845,"threshold_uncertainty_score":0.0268746,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1762828224","doi":"10.1007/s10623-015-0157-4","title":"Quantum cryptography beyond quantum key distribution","year":2015,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":216,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Quantum cryptography; Quantum network; Quantum key distribution; Quantum algorithm; Quantum computer; Quantum technology; Quantum information; Quantum capacity; Open quantum system","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.0308997678488024,"gpt":0.2469166181679688,"spread":0.2160168503191663,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004626601,0.000805588,0.001665159,0.00170499,0.002357389,0.005471599,0.001714479,0.004235264,0.007815497],"category_scores_gemma":[0.01098078,0.0007321938,0.0009155732,0.00200298,0.01153081,0.02436756,0.004988893,0.008975782,0.003413102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004171272,"about_ca_system_score_gemma":0.003058263,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007760374,"about_ca_topic_score_gemma":0.0003201057,"domain_scores_codex":[0.9960465,0.001348727,0.0002018834,0.0005130726,0.001488326,0.0004014361],"domain_scores_gemma":[0.9915519,0.004994825,0.0003206698,0.002109885,0.0008359618,0.0001868384],"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.000003346173,0.000004230068,0.00001758864,0.00006893499,0.000001887959,0.000009461082,0.00003503905,0.0003557037,0.0001114319,0.9941743,0.0006779384,0.004540108],"study_design_scores_gemma":[0.000004997203,0.00001523338,0.00002857695,0.0001478615,0.000002753915,0.00008887742,0.00003547465,0.002495635,0.00040276,0.9534976,0.04327023,0.000009945596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01225835,0.1591062,0.4205328,0.04420866,0.003415264,0.000259151,0.0002735804,0.0003957727,0.3595502],"genre_scores_gemma":[0.6242528,0.1974415,0.1175214,0.009604295,0.007205169,0.0006673193,0.000286156,0.0003511969,0.04267012],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007815497,"threshold_uncertainty_score":0.03026479,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066218472","doi":"10.1023/b:desi.0000029212.52214.71","title":"Constructions for Permutation Codes in Powerline Communications","year":2004,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":177,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Army Research Office; Deutscher Akademischer Austauschdienst","keywords":"Hamming distance; Permutation (music); Partial permutation; Mathematics; Hamming weight; Hamming code; Discrete mathematics; Combinatorics; Coding theory; Coding (social sciences); Cyclic permutation; Set (abstract data type); Automorphism; Permutation graph; Hamming graph; Block code; Computer science; Algorithm; Symmetric group; Decoding methods; Statistics; Physics","authors":[{"name":"Wensong Chu","is_ca":false},{"name":"Charles J. Colbourn","is_ca":false},{"name":"Peter J. Dukes","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02147336466098679,"gpt":0.2456515097056048,"spread":0.224178145044618,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009775474,0.0007308968,0.0004841951,0.0009525896,0.001624923,0.001875499,0.0008519812,0.001414843,0.006039259],"category_scores_gemma":[0.003544965,0.0006174869,0.000796372,0.001421398,0.00208502,0.002630951,0.002093993,0.002509486,0.001944982],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001369816,"about_ca_system_score_gemma":0.00106346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006319977,"about_ca_topic_score_gemma":0.0008723227,"domain_scores_codex":[0.9990844,0.0003711722,0.00003926985,0.0001018708,0.0002561419,0.000147128],"domain_scores_gemma":[0.9982332,0.0008444423,0.0001673654,0.0004703211,0.0001781548,0.0001065298],"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.00004752424,0.00001935065,0.0001090252,0.00003406051,0.000005384423,0.00006824902,0.0001571194,0.006027176,0.001913101,0.9736242,0.002227533,0.01576721],"study_design_scores_gemma":[0.00003197886,0.00005198067,0.00008122383,0.0000397309,0.00001298485,0.000179336,0.0000585673,0.02779824,0.006108489,0.9463907,0.01922172,0.00002494802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06070957,0.0004617169,0.8833715,0.001721754,0.0002008192,0.0001961853,0.0002306836,0.00056646,0.05254118],"genre_scores_gemma":[0.5961949,0.001270254,0.3535443,0.0008533982,0.0002832916,0.0005265033,0.0005815328,0.0004167625,0.04632908],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006039259,"threshold_uncertainty_score":0.02020335,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1485965721","doi":"10.1023/a:1012504516447","title":"Threshold Visual Cryptography Schemes with Specified Whiteness Levels of Reconstructed Pixels","year":2002,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":148,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Crosslight Software (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada; Beijing Institute For Brain Disorders","keywords":"Visual cryptography; Computer science; Cryptography; Pixel; Computation; Theoretical computer science; Transparency (behavior); Integer (computer science); Algorithm; Steganography; Discrete mathematics; Mathematics; Image (mathematics); Secret sharing; Artificial intelligence; Computer security","authors":[{"name":"Philip A. Eisen","is_ca":true},{"name":"Douglas R. Stinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02859812944527219,"gpt":0.2067404513237735,"spread":0.1781423218785013,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001332863,0.0007825706,0.0005045698,0.0007533887,0.0005305965,0.001974181,0.0008613175,0.001059662,0.002920173],"category_scores_gemma":[0.004600488,0.000363048,0.0004226479,0.0009620746,0.0009712345,0.002192914,0.001394373,0.0009246556,0.0007586419],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009824515,"about_ca_system_score_gemma":0.0006575515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001754138,"about_ca_topic_score_gemma":0.0002924334,"domain_scores_codex":[0.9989727,0.0002499231,0.00008942305,0.0001546495,0.0003596615,0.0001736549],"domain_scores_gemma":[0.9966124,0.0009845641,0.0004835952,0.00123909,0.0005521198,0.0001283026],"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.002213056,0.0001834065,0.001410696,0.0003207957,0.00009023493,0.0002591247,0.000431616,0.07602701,0.3552014,0.4618721,0.00161777,0.1003728],"study_design_scores_gemma":[0.0001700962,0.0004142938,0.0005868639,0.000143374,0.00007214881,0.0004388976,0.00009575462,0.361908,0.5283365,0.1033645,0.004384748,0.00008466384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.196672,0.0004004338,0.7896241,0.0003330708,0.00008848869,0.0001319367,0.0001681127,0.0008557545,0.01172611],"genre_scores_gemma":[0.8619091,0.0003330171,0.1313792,0.0001371685,0.0000407992,0.0001065912,0.0001508062,0.0001350334,0.00580822],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002920173,"threshold_uncertainty_score":0.009768963,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W813596860","doi":"10.1007/s10623-015-0094-2","title":"The random oracle model: a twenty-year retrospective","year":2015,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":112,"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":"Random oracle; Computer science; Oracle; Mathematical proof; Provable security; Pseudorandom number generator; Theoretical computer science; Schnorr signature; Concrete security; Flexibility (engineering); Computer security model; Computer security; Cryptography; Encryption; Mathematics; Algorithm; Public-key cryptography; Programming language; Statistics","authors":[{"name":"Neal Koblitz","is_ca":false},{"name":"Alfred Menezes","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03038591141236432,"gpt":0.2513953581725988,"spread":0.2210094467602345,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01454884,0.000501466,0.000684778,0.001896846,0.0007542795,0.002487128,0.001546202,0.00140057,0.003921806],"category_scores_gemma":[0.04978226,0.0005742552,0.000612301,0.002719587,0.003550946,0.007785235,0.002000048,0.003736804,0.0009283826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002413854,"about_ca_system_score_gemma":0.002629052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003666007,"about_ca_topic_score_gemma":0.00242564,"domain_scores_codex":[0.9957832,0.002220057,0.0003430238,0.0004793759,0.0008537311,0.0003205934],"domain_scores_gemma":[0.9252061,0.05255435,0.007278346,0.007305823,0.006099757,0.001555608],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.002095561,0.001403069,0.136699,0.001722447,0.0005514746,0.001380236,0.002104501,0.01042137,0.001084451,0.3428637,0.03304104,0.4666331],"study_design_scores_gemma":[0.000256665,0.003377382,0.1199114,0.005524486,0.001109982,0.01051115,0.004148958,0.0264888,0.007648044,0.205067,0.6155486,0.000407536],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.4008714,0.4185498,0.05997178,0.05750433,0.001601763,0.0003964293,0.003216081,0.0002477774,0.05764071],"genre_scores_gemma":[0.7574966,0.2181365,0.008592085,0.006124789,0.001369206,0.000154173,0.00146066,0.0001945828,0.006471501],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.01454884,"threshold_uncertainty_score":0.0769425,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071880083","doi":"10.1007/s10623-009-9290-2","title":"Unitary designs and codes","year":2009,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":107,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Unitary state; Unitary group; Mathematics; Unitary matrix; Product (mathematics); Code (set theory); TRACE (psycholinguistics); Group (periodic table); Special unitary group; Upper and lower bounds; Combinatorics; Inner product space; Circular ensemble; Unit (ring theory); Pure mathematics; Discrete mathematics; Geometry; Computer science; Mathematical analysis; Physics; Quantum mechanics; Mathematical physics","authors":[{"name":"Aidan Roy","is_ca":true},{"name":"A.J. Scott","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07906106529969248,"gpt":0.3132571014224813,"spread":0.2341960361227888,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001221129,0.0008145312,0.0008832478,0.001852172,0.002272903,0.003919767,0.0006560379,0.002311452,0.009885357],"category_scores_gemma":[0.004934378,0.0004685456,0.0005259472,0.00199337,0.005929043,0.005211352,0.002685241,0.003418466,0.002221233],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00157878,"about_ca_system_score_gemma":0.001019528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005415755,"about_ca_topic_score_gemma":0.0002763594,"domain_scores_codex":[0.9982144,0.0006572239,0.00008368181,0.0002679417,0.0005594118,0.0002174322],"domain_scores_gemma":[0.9984745,0.0006415616,0.0001578226,0.0003290037,0.0002942978,0.0001027433],"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.000002661785,0.000001863848,0.000007039243,0.000004892859,5.741069e-7,0.000002864854,0.00003016418,0.00007025465,0.00004407716,0.9975597,0.0003737163,0.001902197],"study_design_scores_gemma":[0.000003026982,0.000006126586,0.00001411725,0.000008415745,0.000001189064,0.00002514153,0.00002043495,0.0005310405,0.0001603311,0.9937232,0.005502822,0.00000412518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.07545289,0.01040769,0.3977322,0.009498395,0.003135276,0.0001669976,0.0004041904,0.000424079,0.5027783],"genre_scores_gemma":[0.7925354,0.005740729,0.06650509,0.00287866,0.002871961,0.0003134832,0.000290053,0.0002382607,0.1286263],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009885357,"threshold_uncertainty_score":0.03306985,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1992938819","doi":"10.1007/s10623-015-0067-5","title":"Finding shortest lattice vectors faster using quantum search","year":2015,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute; University of Waterloo; Canadian Institute for Advanced Research","funders":"Engineering and Physical Sciences Research Council; Canadian Institute for Advanced Research; Institut Périmètre de physique théorique; Lorentz Center; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Lattice problem; Quantum; Lattice (music); Computer science; Theoretical computer science; Algorithm; Physics; Quantum mechanics; Cryptography","authors":[{"name":"Thijs Laarhoven","is_ca":false},{"name":"Michele Mosca","is_ca":true},{"name":"Joop van de Pol","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08119813990694018,"gpt":0.2931261093051544,"spread":0.2119279693982142,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00126207,0.0006748764,0.001222264,0.001290528,0.0009356158,0.002047115,0.00148274,0.00120952,0.01110597],"category_scores_gemma":[0.008053584,0.0005742931,0.001113459,0.001883397,0.001848279,0.005793813,0.002061534,0.002515236,0.002241723],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001784995,"about_ca_system_score_gemma":0.002553947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002362266,"about_ca_topic_score_gemma":0.00454759,"domain_scores_codex":[0.9980978,0.0005178099,0.0001022368,0.0003482907,0.0007320936,0.0002017871],"domain_scores_gemma":[0.9970405,0.001692315,0.0002112684,0.0006932967,0.0002572601,0.000105336],"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.0005166916,0.0003329377,0.0009038033,0.0004339714,0.0001114338,0.00008543587,0.0002355858,0.1819599,0.01487622,0.5848801,0.01194488,0.203719],"study_design_scores_gemma":[0.0001871722,0.00009622561,0.0001471374,0.00004304518,0.0000204697,0.00005799133,0.00008117162,0.5871657,0.004886474,0.4007394,0.006541844,0.00003338468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.078821,0.000781259,0.8897461,0.001787514,0.0002423438,0.00018076,0.0002326944,0.002300927,0.02590742],"genre_scores_gemma":[0.3847722,0.0005478958,0.6056462,0.000539278,0.0001364985,0.0002630658,0.0004738797,0.0005951928,0.007025698],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01110597,"threshold_uncertainty_score":0.03715312,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2112446992","doi":"10.1007/s10623-005-6345-x","title":"A New Characterization of Semi-bent and Bent Functions on Finite Fields*","year":2006,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":82,"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":"Bent molecular geometry; Bent function; Finite field; Mathematics; Characterization (materials science); Prime (order theory); Boolean function; Combinatorics; Computation; Polynomial; Quadratic equation; Discrete mathematics; Pure mathematics; Mathematical analysis; Geometry; Physics; Algorithm; Materials science; Optics","authors":[{"name":"Khoongming Khoo","is_ca":false},{"name":"Guang Gong","is_ca":true},{"name":"Douglas R. Stinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01302568874685186,"gpt":0.2043936848409103,"spread":0.1913679960940584,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009697395,0.001059599,0.0006328165,0.002639388,0.001022818,0.002780925,0.0009616636,0.001151341,0.003955167],"category_scores_gemma":[0.002904145,0.0004625683,0.0006564053,0.001742704,0.003344321,0.004410178,0.002165012,0.003337867,0.0008557865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001015036,"about_ca_system_score_gemma":0.0004648717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003575034,"about_ca_topic_score_gemma":0.0002983138,"domain_scores_codex":[0.9992577,0.0001434113,0.00005175879,0.0001614376,0.0002445189,0.0001409983],"domain_scores_gemma":[0.9977049,0.0007771492,0.000398827,0.0002669141,0.0004402193,0.0004121206],"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.00003981358,0.00002075736,0.0002605587,0.00002627322,0.000003851715,0.00006293613,0.0001826356,0.0007218131,0.002841164,0.9876707,0.0007195704,0.007449884],"study_design_scores_gemma":[0.0000116236,0.00007787961,0.0005297238,0.00002936354,0.000009780535,0.0004759083,0.0001124115,0.0139675,0.001965852,0.9763525,0.006436777,0.00003057941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4531837,0.001374065,0.4431499,0.0021307,0.0005891087,0.00009896467,0.0005668254,0.0004882546,0.09841844],"genre_scores_gemma":[0.9234037,0.0009894168,0.04728791,0.0008653813,0.0007901502,0.0001061198,0.0003849151,0.0001929622,0.02597946],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003955167,"threshold_uncertainty_score":0.01323134,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2915023553","doi":"10.1023/a:1008397921377","title":"Integer Factoring","year":2000,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science","authors":[{"name":"Arjen K. Lenstra","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01856317441616658,"gpt":0.2261205295762287,"spread":0.2075573551600621,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005358972,0.000952136,0.0005381133,0.001101545,0.0009225691,0.001898517,0.0005289405,0.0006078986,0.02678907],"category_scores_gemma":[0.00227934,0.0003244331,0.0005951033,0.001279582,0.001537655,0.003390115,0.001653512,0.001733393,0.008049577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008466133,"about_ca_system_score_gemma":0.0005627201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004183219,"about_ca_topic_score_gemma":0.0004566712,"domain_scores_codex":[0.9991435,0.0001307313,0.00004499774,0.0002499341,0.0002784582,0.00015237],"domain_scores_gemma":[0.9991547,0.0001757666,0.00007339015,0.0003888537,0.0001580633,0.0000493129],"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.0001648525,0.00003776893,0.0001947824,0.00009794273,0.00001266492,0.00006421171,0.0001188908,0.002898064,0.005696794,0.8195982,0.01002543,0.1610904],"study_design_scores_gemma":[0.00004817054,0.0001442072,0.0002108066,0.00008035121,0.00003309683,0.0004061571,0.00009008672,0.01189195,0.01712686,0.800198,0.1697282,0.00004196827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04589275,0.002124292,0.6031575,0.001505452,0.001228554,0.0001642674,0.0005683259,0.001699208,0.3436598],"genre_scores_gemma":[0.5827075,0.002602117,0.2280553,0.001352341,0.0009722266,0.0002115005,0.001132988,0.001015056,0.181951],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02678907,"threshold_uncertainty_score":0.08961838,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006439589","doi":"10.1007/s10623-007-9088-z","title":"Golay complementary array pairs","year":2007,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":71,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Binary Golay code; Constructive; Binary number; Ternary Golay code; Mathematics; Complementary sequences; Combinatorics; Algorithm; Arithmetic; Computer science; Process (computing); Hamming code; Decoding methods","authors":[{"name":"Jonathan Jedwab","is_ca":true},{"name":"Matthew G. Parker","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02103313968661861,"gpt":0.2401961966686455,"spread":0.2191630569820269,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007333164,0.001247758,0.0007868598,0.001859856,0.00115848,0.002526845,0.0005720761,0.001707956,0.01583953],"category_scores_gemma":[0.003445433,0.0003838943,0.0004906913,0.00208154,0.001100947,0.001555417,0.001645732,0.001181921,0.007774167],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007540556,"about_ca_system_score_gemma":0.0009997512,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001982965,"about_ca_topic_score_gemma":0.0003750438,"domain_scores_codex":[0.9988154,0.0004539766,0.00005566958,0.0001648274,0.0003783359,0.0001317599],"domain_scores_gemma":[0.998202,0.0006940017,0.0002356325,0.0003778338,0.0004125442,0.00007805948],"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.0003664121,0.00006077203,0.0005366667,0.0002415887,0.0000746861,0.0003297199,0.0002112415,0.01134203,0.03017563,0.7698045,0.007931877,0.1789248],"study_design_scores_gemma":[0.0001740161,0.0007240779,0.0009892575,0.0003714197,0.0001317462,0.003960893,0.0002428766,0.1318796,0.116861,0.6041331,0.1403306,0.0002014314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03984761,0.002129173,0.8490459,0.001767655,0.0007637987,0.000231117,0.00041266,0.0008651689,0.104937],"genre_scores_gemma":[0.4987931,0.002228509,0.4249907,0.002327372,0.001016358,0.0005633846,0.0006309722,0.0002494479,0.06920025],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01583953,"threshold_uncertainty_score":0.05298859,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1809742378","doi":"10.1023/a:1008312401197","title":"Analysis of the Xedni Calculus Attack","year":2000,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":65,"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":"Mathematics; Elliptic curve; Logarithm; Discrete logarithm; Finite field; Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis; Computer science","authors":[{"name":"Michael J. Jacobson","is_ca":true},{"name":"Neal Koblitz","is_ca":true},{"name":"Joseph H. Silverman","is_ca":true},{"name":"Andreas Stein","is_ca":true},{"name":"Edlyn Teske","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01767769015688338,"gpt":0.2412242157429259,"spread":0.2235465255860425,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001339023,0.0008415177,0.0007973299,0.001882213,0.001689018,0.00270753,0.001347245,0.001788658,0.01028638],"category_scores_gemma":[0.005341158,0.0003154847,0.0007681528,0.001356206,0.003361404,0.005382706,0.002050217,0.002656425,0.001041594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002493174,"about_ca_system_score_gemma":0.001382125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00123476,"about_ca_topic_score_gemma":0.0008372719,"domain_scores_codex":[0.9987325,0.0002567523,0.0000300176,0.0001101119,0.000572536,0.0002980817],"domain_scores_gemma":[0.9978743,0.0008647084,0.0002819677,0.0004890646,0.0003236765,0.0001663559],"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.00004974467,0.00001899138,0.0001877897,0.00001772569,0.000005786289,0.00005125472,0.00006252502,0.00680263,0.0006303867,0.9872543,0.0008524789,0.004066352],"study_design_scores_gemma":[0.00001955101,0.00003190801,0.0003405407,0.00002480804,0.00001206573,0.0001380372,0.00006695362,0.1355181,0.001120517,0.8593147,0.003392189,0.00002064157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3393226,0.00253393,0.3446432,0.00560432,0.0004643263,0.0001626628,0.0002079019,0.0004872739,0.3065738],"genre_scores_gemma":[0.9668764,0.0009187754,0.008006113,0.0001914265,0.0002579928,0.00004478819,0.0000690625,0.00006727019,0.02356828],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01028638,"threshold_uncertainty_score":0.03441143,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980499647","doi":"10.1007/s10623-011-9604-z","title":"Anonymity and one-way authentication in key exchange protocols","year":2012,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":65,"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":"Anonymity; Computer science; Computer security; Authenticated Key Exchange; Mutual authentication; Key (lock); Key exchange; Session key; Authentication (law); Authentication protocol; Secrecy; Key-agreement protocol; Public-key cryptography; Forward secrecy; Internet privacy; Key distribution; Encryption","authors":[{"name":"Ian Goldberg","is_ca":true},{"name":"Douglas Stebila","is_ca":false},{"name":"Berkant Ustaoğlu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05317927073998197,"gpt":0.3066438702162299,"spread":0.2534645994762479,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004002787,0.000979299,0.001101765,0.001728646,0.003461387,0.005601563,0.00134137,0.003396867,0.003467778],"category_scores_gemma":[0.01326851,0.0006693281,0.0009466702,0.00296062,0.008321904,0.01251284,0.003163187,0.005242986,0.001509432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001832565,"about_ca_system_score_gemma":0.001852009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006560063,"about_ca_topic_score_gemma":0.0005510836,"domain_scores_codex":[0.9929335,0.003328864,0.0004592,0.0008845336,0.001783407,0.0006105777],"domain_scores_gemma":[0.9894866,0.005981625,0.001009615,0.002141054,0.001083612,0.0002974698],"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.00007994267,0.00001535855,0.0001038883,0.00004009169,0.000005224383,0.00004746666,0.0002271344,0.001889039,0.0004880207,0.987976,0.0008296087,0.008298283],"study_design_scores_gemma":[0.00001768122,0.00002578347,0.00006220733,0.00002909255,0.00001557675,0.0001645658,0.00008768892,0.01342984,0.001475172,0.9778715,0.006794287,0.00002667448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02906607,0.002452524,0.9382997,0.003052707,0.0006444479,0.0001021842,0.0001293682,0.0003160258,0.02593702],"genre_scores_gemma":[0.8244446,0.003152416,0.140618,0.000917646,0.001205921,0.0003968391,0.0002421694,0.0001737306,0.02884875],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005601563,"threshold_uncertainty_score":0.02116895,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984179204","doi":"10.1007/s10623-012-9749-4","title":"A unified approach to combinatorial key predistribution schemes for sensor networks","year":2012,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":55,"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":"Key (lock); Computer science; Class (philosophy); Scheme (mathematics); Combinatorial design; Wireless sensor network; Theoretical computer science; Mathematics; Artificial intelligence; Computer network; Discrete mathematics; Computer security","authors":[{"name":"Maura B. Paterson","is_ca":false},{"name":"Douglas R. Stinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02729268902626618,"gpt":0.2467781936238008,"spread":0.2194855045975346,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001475162,0.001175826,0.001128041,0.00170743,0.001014004,0.003065714,0.002403955,0.001541102,0.005123413],"category_scores_gemma":[0.003915733,0.000646203,0.001288195,0.002167829,0.002410175,0.004335473,0.00320248,0.003306081,0.001436439],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001864029,"about_ca_system_score_gemma":0.001729814,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005939176,"about_ca_topic_score_gemma":0.00115554,"domain_scores_codex":[0.9979476,0.0006946512,0.0001236707,0.0002391134,0.0008211487,0.0001737647],"domain_scores_gemma":[0.9984474,0.0005227721,0.0001067127,0.0005348047,0.0003193121,0.00006899881],"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.00002172082,0.00002335984,0.00003630285,0.00005477621,0.00001400565,0.00003772502,0.00005286756,0.03788612,0.001934328,0.9390507,0.001281176,0.01960688],"study_design_scores_gemma":[0.00001668512,0.00005067584,0.00004387637,0.00004637385,0.00001835699,0.0001309676,0.0000367944,0.3262019,0.001676581,0.6622318,0.009512062,0.00003388925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002062719,0.0003559897,0.9890915,0.0002235585,0.0001066334,0.00005039908,0.00003394089,0.00006678308,0.008008421],"genre_scores_gemma":[0.2814464,0.003222495,0.6912857,0.0006505653,0.0006824136,0.0006182397,0.0002442001,0.0002525251,0.02159742],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005123413,"threshold_uncertainty_score":0.01713949,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2140685585","doi":"10.1007/s10623-009-9334-7","title":"Comparing two pairing-based aggregate signature schemes","year":2009,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":53,"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":"Random oracle; Pairing; Bilinear interpolation; Scheme (mathematics); Computer science; Signature (topology); Mathematics; Public-key cryptography; Theoretical computer science; Computer security; Statistics; Encryption; Physics","authors":[{"name":"Sanjit Chatterjee","is_ca":true},{"name":"Darrel Hankerson","is_ca":false},{"name":"Edward Knapp","is_ca":true},{"name":"Alfred Menezes","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02630182846305684,"gpt":0.2562259585936287,"spread":0.2299241301305718,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006172718,0.0006077097,0.00118418,0.002324814,0.001200866,0.003116721,0.001530324,0.002152787,0.004954096],"category_scores_gemma":[0.01551091,0.0003802257,0.0007452435,0.002951995,0.001923051,0.00702604,0.004150193,0.00163238,0.001320777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001633103,"about_ca_system_score_gemma":0.002109062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003888074,"about_ca_topic_score_gemma":0.0003586785,"domain_scores_codex":[0.9912078,0.003017477,0.0005146873,0.0004630448,0.003826114,0.0009708646],"domain_scores_gemma":[0.9863749,0.00488631,0.001026078,0.00497293,0.002093869,0.0006460804],"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.01220712,0.0008013886,0.008575736,0.0008240474,0.0003890134,0.000279268,0.001389451,0.1092568,0.04298979,0.5014073,0.007332908,0.3145473],"study_design_scores_gemma":[0.001105252,0.006167296,0.006626966,0.0003085959,0.0005338197,0.001378567,0.00169461,0.49575,0.07456703,0.3744487,0.03707802,0.0003411824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.498999,0.002744888,0.4589945,0.001628582,0.0008485254,0.000574768,0.0006884881,0.001135351,0.03438597],"genre_scores_gemma":[0.9226081,0.0007610405,0.06941752,0.0001950059,0.000142489,0.0001608569,0.0005691848,0.00009605396,0.006049676],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006172718,"threshold_uncertainty_score":0.03264481,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966244415","doi":"10.1007/s10623-013-9850-3","title":"ETRU: NTRU over the Eisenstein integers","year":2013,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"NTRU; Public key cryptosystem; Cryptosystem; Eisenstein integer; Polynomial ring; Mathematics; Public-key cryptography; Discrete mathematics; Polynomial; Computer science; Cryptography; Algorithm; Computer security; Encryption; Algebraic number; Mathematical analysis","authors":[{"name":"Katherine Jarvis","is_ca":true},{"name":"Monica Nevins","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01374569531009495,"gpt":0.2152243456784864,"spread":0.2014786503683914,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001274238,0.0009360959,0.00101134,0.001960772,0.001129603,0.002975994,0.0008738309,0.0009422994,0.02347396],"category_scores_gemma":[0.004327788,0.000301651,0.0004585272,0.002053934,0.001651439,0.005148025,0.002184801,0.00272997,0.007987991],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001245467,"about_ca_system_score_gemma":0.0007080758,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005302676,"about_ca_topic_score_gemma":0.0005027326,"domain_scores_codex":[0.9989961,0.0003099706,0.0000596174,0.0001477892,0.0002998985,0.0001866019],"domain_scores_gemma":[0.9988462,0.000459071,0.0001286779,0.0002562045,0.0001759711,0.0001338194],"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.000223211,0.00002325267,0.0001448548,0.00012728,0.000007570072,0.00009179784,0.00009817581,0.001268412,0.001297673,0.9287852,0.01214647,0.05578606],"study_design_scores_gemma":[0.00007742966,0.00006780104,0.0002049246,0.0001861007,0.00001826919,0.0002795395,0.00004153715,0.006964296,0.004929428,0.8875901,0.09960707,0.00003355457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07261589,0.01058187,0.5034696,0.004623626,0.004137109,0.0001937967,0.002384212,0.006436775,0.3955571],"genre_scores_gemma":[0.7529535,0.005449333,0.1150516,0.002227981,0.00257101,0.0003456267,0.001633894,0.00261186,0.1171552],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02347396,"threshold_uncertainty_score":0.07852817,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2033154378","doi":"10.1007/s10623-010-9481-x","title":"On the complexity of the herding attack and some related attacks on hash functions","year":2011,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":49,"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":"Herding; Hash function; Computer science; Theoretical computer science; Computational complexity theory; Discrete mathematics; Mathematics; Algorithm; Computer security","authors":[{"name":"Simon R. Blackburn⋆","is_ca":false},{"name":"Douglas R. Stinson","is_ca":true},{"name":"Jalaj Upadhyay","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.109308169504407,"gpt":0.2494344636524989,"spread":0.1401262941480919,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005687751,0.001932249,0.003548715,0.003605786,0.003526787,0.00595784,0.003654294,0.005693987,0.009854819],"category_scores_gemma":[0.05010771,0.001486919,0.002969503,0.004207683,0.007183231,0.02272609,0.006452555,0.008988487,0.001163079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006008873,"about_ca_system_score_gemma":0.003128219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002440395,"about_ca_topic_score_gemma":0.001991944,"domain_scores_codex":[0.9915086,0.002905307,0.0003579526,0.0008439073,0.003059304,0.00132504],"domain_scores_gemma":[0.8941597,0.09031038,0.004426932,0.00709478,0.002460954,0.00154704],"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.001452857,0.0003459051,0.003735498,0.0005156011,0.0003071501,0.0003969337,0.0006313603,0.2434463,0.003530149,0.692137,0.01668928,0.03681188],"study_design_scores_gemma":[0.0001324974,0.00008133177,0.0008123545,0.00005650161,0.0001015746,0.0002772247,0.0001218486,0.3467949,0.001081166,0.6484972,0.001967311,0.00007610734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3948169,0.007928576,0.4715205,0.02922724,0.0006710123,0.0004987189,0.002136439,0.0007781493,0.09242249],"genre_scores_gemma":[0.9453901,0.004030072,0.0356828,0.001200461,0.001266069,0.0003395882,0.0008880896,0.0002920644,0.0109107],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009854819,"threshold_uncertainty_score":0.04359764,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2089241088","doi":"10.1007/s10623-015-0071-9","title":"Quantifying the security advantage of password expiration policies","year":2015,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":46,"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; Canada Research Chairs","keywords":"Password; Expiration; Security policy; Computer security; Computer science; Business; Psychology","authors":[{"name":"Sonia Chiasson","is_ca":true},{"name":"Paul C. van Oorschot","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09323440488320062,"gpt":0.3056442427337035,"spread":0.2124098378505029,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0111942,0.001177019,0.001059357,0.00215086,0.0008818645,0.004201753,0.001603275,0.003066385,0.003284166],"category_scores_gemma":[0.06711224,0.0005946355,0.0005895534,0.001738204,0.002953551,0.01059179,0.00276756,0.002756427,0.0005544152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002578063,"about_ca_system_score_gemma":0.002503426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005831487,"about_ca_topic_score_gemma":0.0004370034,"domain_scores_codex":[0.987312,0.005292704,0.00049652,0.001299922,0.004007196,0.001591674],"domain_scores_gemma":[0.914423,0.05862982,0.006736789,0.0150644,0.003967018,0.001178969],"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.003619699,0.0006160002,0.0145351,0.0003062592,0.00018362,0.0002661441,0.000214049,0.2591675,0.03440501,0.5577965,0.002083355,0.1268068],"study_design_scores_gemma":[0.00009664829,0.0008242949,0.002787755,0.00008565079,0.0001418648,0.0004428438,0.0001212228,0.7397341,0.02459555,0.2292425,0.001829374,0.00009833678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6268066,0.001868097,0.3463203,0.002254336,0.0002636108,0.0001334266,0.0003019694,0.000727977,0.02132368],"genre_scores_gemma":[0.9881512,0.0002609469,0.01068904,0.00007212423,0.00006987114,0.00002002491,0.00004476805,0.00004149626,0.000650559],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0111942,"threshold_uncertainty_score":0.0592013,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2047782372","doi":"10.1007/s10623-013-9862-z","title":"Compression of periodic complementary sequences and applications","year":2013,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Lambda; Autocorrelation; Sequence (biology); Mathematics; Compression (physics); Zero (linguistics); Combinatorics; Complementary sequences; Function (biology); Data compression; Discrete mathematics; Algorithm; Physics; Statistics; Quantum mechanics","authors":[{"name":"Dragomir Ž. Ðoković","is_ca":true},{"name":"Ilias Kotsireas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02061128218749861,"gpt":0.2422285624615389,"spread":0.2216172802740403,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002950879,0.0004229772,0.0003814222,0.001331829,0.0003338054,0.0006834138,0.0004074109,0.0007082128,0.003138198],"category_scores_gemma":[0.002344717,0.0001977176,0.0002455637,0.001731261,0.000575526,0.0007473034,0.000601252,0.0005289224,0.0005283154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004197169,"about_ca_system_score_gemma":0.0003916516,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003591574,"about_ca_topic_score_gemma":0.0004186328,"domain_scores_codex":[0.9997398,0.00005115348,0.00001435474,0.00003266837,0.0001391377,0.00002294037],"domain_scores_gemma":[0.9992118,0.0004265507,0.00005659675,0.0001205284,0.0001557999,0.00002876774],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004043899,0.000104726,0.0006975785,0.0003273208,0.00002889474,0.0004717174,0.0002468941,0.05619313,0.05056242,0.4332443,0.005104821,0.4526138],"study_design_scores_gemma":[0.00006454861,0.0002869904,0.00131975,0.0001715312,0.00003797802,0.001938822,0.0001378527,0.6508653,0.05234485,0.2660126,0.02676015,0.00005967083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2274082,0.01314722,0.6837091,0.001320399,0.0009366926,0.0001433175,0.0003328341,0.0007178146,0.0722843],"genre_scores_gemma":[0.7656017,0.007464442,0.199302,0.0003744142,0.0009196844,0.0001502211,0.0006116427,0.0000988349,0.02547714],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003138198,"threshold_uncertainty_score":0.01049829,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4230766887","doi":"10.1023/a:1016512717269","title":"On Group-Divisible Designs with Block Size Four and Group-Type gum1","year":2002,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Suzhou University","keywords":"Value (mathematics); Mathematics; Spectrum (functional analysis); Physics; Combinatorics; Statistics; Quantum mechanics","authors":[{"name":"Guanghan Ge Guanghan Ge","is_ca":false},{"name":"Rolf S. Rees","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05969434767606992,"gpt":0.265416555905958,"spread":0.205722208229888,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002252937,0.001180568,0.001127092,0.002130748,0.002192623,0.002327307,0.001057717,0.001940353,0.00651987],"category_scores_gemma":[0.0104673,0.0008256945,0.0007755436,0.002213906,0.004078194,0.003781938,0.00303525,0.00252796,0.001095892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00190985,"about_ca_system_score_gemma":0.001298503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007847714,"about_ca_topic_score_gemma":0.0006911383,"domain_scores_codex":[0.9981178,0.0007452709,0.00007886924,0.0002123115,0.0005133356,0.0003324426],"domain_scores_gemma":[0.993405,0.003943762,0.0009352663,0.0008251713,0.0005349038,0.0003558409],"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.000114878,0.00001459397,0.0001679725,0.00003084322,0.000005597092,0.00005144752,0.0001781206,0.002644625,0.0006401282,0.9888808,0.001080452,0.006190688],"study_design_scores_gemma":[0.0000373908,0.00005428357,0.00009321478,0.00002628121,0.000008741404,0.00009799252,0.00005060582,0.01188385,0.0008475251,0.9841747,0.002704578,0.0000208838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4583364,0.001953128,0.3970315,0.003436564,0.0006868406,0.0001834391,0.0003843166,0.0005725143,0.1374153],"genre_scores_gemma":[0.9132457,0.001188647,0.05172105,0.0007524617,0.00054048,0.0001981209,0.0002241329,0.0001412171,0.03198822],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00651987,"threshold_uncertainty_score":0.02181119,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W45261477","doi":"10.1007/s10623-014-0006-x","title":"More constructions of differentially 4-uniform permutations on $${\\mathbb {F}}_{2^{2k}}$$ F 2 2 k","year":2014,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":42,"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":"Boolean function; Stream cipher; Substitution (logic); Mathematics; Block cipher; Class (philosophy); Combinatorics; Discrete mathematics; Type (biology); Block (permutation group theory); Computer science; Algorithm; Cryptography","authors":[{"name":"Longjiang Qu","is_ca":false},{"name":"Yin Tan","is_ca":true},{"name":"Chao Li","is_ca":false},{"name":"Guang Gong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01515496332052796,"gpt":0.2352172507737953,"spread":0.2200622874532674,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00119393,0.001372243,0.0009644672,0.001182553,0.001564464,0.002265588,0.001484069,0.001959047,0.02392222],"category_scores_gemma":[0.002706649,0.0007630832,0.001594547,0.001693917,0.001790652,0.004288157,0.003457486,0.003205371,0.004278091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002983566,"about_ca_system_score_gemma":0.001176034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009087932,"about_ca_topic_score_gemma":0.001653725,"domain_scores_codex":[0.9983413,0.0004606401,0.0001072307,0.000281758,0.0004244668,0.0003845112],"domain_scores_gemma":[0.9987684,0.0003430486,0.000133642,0.0004931417,0.0001551529,0.0001066081],"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.0002037854,0.00006926191,0.0003929377,0.00008000643,0.000024117,0.0001084511,0.000229745,0.004835384,0.006241194,0.9591019,0.004234827,0.02447839],"study_design_scores_gemma":[0.0001561252,0.0001620647,0.0006897284,0.00009645464,0.00005766803,0.0003932523,0.0001489347,0.02359558,0.01890717,0.9014242,0.0542371,0.0001317794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1889482,0.001252112,0.6352092,0.006025184,0.001471759,0.0003081833,0.00117814,0.001606134,0.1640011],"genre_scores_gemma":[0.6189615,0.001160543,0.2492789,0.003253184,0.0005419789,0.0004997579,0.001778442,0.0009884557,0.1235372],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02392222,"threshold_uncertainty_score":0.08002782,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2744871629","doi":"10.1007/s10623-017-0452-3","title":"New constructions of permutation polynomials of the form $$x^rh\\left( x^{q-1}\\right) $$ x r h x q - 1 over $${\\mathbb F}_{q^2}$$ F q 2","year":2017,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":39,"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; State Key Laboratory of Cryptography","keywords":"Trinomial; Permutation (music); Multiplicative function; Cyclic permutation; Permutation graph; Finite field; Partial permutation; Generalized permutation matrix","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01736009532675113,"gpt":0.2515466679506085,"spread":0.2341865726238574,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001176803,0.001161549,0.0006976484,0.001439225,0.001474649,0.002562715,0.001363888,0.001315581,0.01397331],"category_scores_gemma":[0.003100721,0.0008047838,0.001192755,0.001601384,0.002658732,0.004649586,0.00331478,0.003846737,0.003704855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001550046,"about_ca_system_score_gemma":0.001185834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004428882,"about_ca_topic_score_gemma":0.001043694,"domain_scores_codex":[0.9985831,0.0003331849,0.00008311871,0.0002418654,0.0004448606,0.000313969],"domain_scores_gemma":[0.9984729,0.000502983,0.0001634804,0.0004481498,0.0002281413,0.0001843841],"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.00009272192,0.00004737583,0.0001384511,0.00008291145,0.00001242731,0.0001390839,0.00020111,0.00137301,0.005376698,0.9646881,0.005457566,0.02239066],"study_design_scores_gemma":[0.0001340498,0.0001430795,0.0003036047,0.00009417558,0.00007424198,0.001232371,0.0001566128,0.02338762,0.03044178,0.8440123,0.09988487,0.0001353255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06890943,0.001174186,0.8187864,0.003538635,0.002211541,0.0002474991,0.0005958743,0.00204551,0.1024909],"genre_scores_gemma":[0.5344458,0.001605647,0.3642287,0.001787959,0.0009711903,0.0003663978,0.0009497619,0.001487675,0.09415685],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01397331,"threshold_uncertainty_score":0.04674536,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024144406","doi":"10.1007/s10623-007-9163-5","title":"Williamson matrices up to order 59","year":2008,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Class (philosophy); Order (exchange); Mathematics; Combinatorics; Pure mathematics; Computer science; Artificial intelligence; Economics","authors":[{"name":"W. H. Holzmann","is_ca":true},{"name":"Hadi Kharaghani","is_ca":true},{"name":"B. Tayfeh‐Rezaie","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01850153224551272,"gpt":0.2070204207014444,"spread":0.1885188884559317,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005217258,0.001078109,0.0006289006,0.001892719,0.001685182,0.002158117,0.0006296895,0.001244652,0.02136425],"category_scores_gemma":[0.003791385,0.0006095535,0.0005053231,0.001557133,0.00216835,0.002737429,0.001581538,0.002585584,0.007486801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001076061,"about_ca_system_score_gemma":0.001044898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0013024,"about_ca_topic_score_gemma":0.001541928,"domain_scores_codex":[0.999009,0.0001676849,0.00005131718,0.0001927003,0.0003452,0.0002340548],"domain_scores_gemma":[0.9984498,0.0005342407,0.0001797094,0.0003515562,0.0003530392,0.0001315992],"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.00003186825,0.00001256817,0.00005402877,0.00001867277,0.000003919949,0.00007566871,0.0001015465,0.000687523,0.001591492,0.9838832,0.002403956,0.01113556],"study_design_scores_gemma":[0.0000127477,0.00003203937,0.0001454889,0.00003204065,0.000007310726,0.0002213362,0.00004882631,0.003198317,0.004693266,0.9632824,0.02830114,0.00002514957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1552432,0.001800738,0.2741715,0.003502931,0.001528124,0.0001936995,0.0007340393,0.0007393677,0.5620864],"genre_scores_gemma":[0.6829434,0.001993663,0.06344537,0.001616817,0.0008523348,0.0001936812,0.0004327793,0.0004156641,0.2481063],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02136425,"threshold_uncertainty_score":0.0714705,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1528227909","doi":"10.1023/a:1016501125022","title":"Constructions and Bounds for Unconditionally Secure Non-Interactive Commitment Schemes","year":2002,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Computer science","authors":[{"name":"Carlo Blundo","is_ca":false},{"name":"Barbara Masucci","is_ca":false},{"name":"Douglas R. Stinson","is_ca":true},{"name":"Ruizhong Wei","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01400849361375752,"gpt":0.2070894277002008,"spread":0.1930809340864432,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01114475,0.003234392,0.003115749,0.004075244,0.005662488,0.0152932,0.009476336,0.005844024,0.01564902],"category_scores_gemma":[0.04266531,0.003437834,0.003230844,0.006623103,0.008702802,0.03055005,0.01998633,0.02309554,0.005515755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.01087767,"about_ca_system_score_gemma":0.006040762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001387615,"about_ca_topic_score_gemma":0.0016314,"domain_scores_codex":[0.9816563,0.004021409,0.0009612907,0.002686284,0.007301041,0.00337365],"domain_scores_gemma":[0.9332033,0.04696933,0.002768905,0.01148666,0.0029399,0.002631894],"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.000193855,0.000112709,0.0002092152,0.000135939,0.000031011,0.0000587225,0.000337131,0.01172592,0.00121573,0.9730032,0.00264733,0.01032915],"study_design_scores_gemma":[0.00003831895,0.00004089571,0.0001179119,0.0000922101,0.0000501461,0.00006416978,0.00007218464,0.04272301,0.003094668,0.9496188,0.004030102,0.00005765988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05963128,0.003119423,0.8367394,0.00698472,0.0004977508,0.0004223943,0.00108533,0.00197033,0.0895494],"genre_scores_gemma":[0.7624867,0.003286057,0.1960291,0.001425713,0.0009016187,0.001566509,0.001582493,0.000981662,0.03174025],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01564902,"threshold_uncertainty_score":0.0789234,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2022676089","doi":"10.1007/s10623-008-9261-z","title":"An intrinsical description of group codes","year":2009,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Abelian group; Group code; General linear group; Group (periodic table); Combinatorics; Linear code; Code (set theory); Discrete mathematics; Isomorphism (crystallography); Group algebra; Algebra over a field; Pure mathematics; Block code; Decoding methods; Symmetric group; Algorithm; Computer science; Physics","authors":[{"name":"José Joaquín Bernal","is_ca":true},{"name":"Ángel del Rı́o","is_ca":false},{"name":"Juan Jacobo Simón","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04610486165626739,"gpt":0.277141148110304,"spread":0.2310362864540366,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001477111,0.0008079019,0.0005089789,0.002183154,0.00177385,0.002972751,0.001403208,0.001827222,0.00662841],"category_scores_gemma":[0.003712059,0.0003308623,0.0009297229,0.001429193,0.004242147,0.004445673,0.002312613,0.003124997,0.001990716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001324675,"about_ca_system_score_gemma":0.0009561586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006797353,"about_ca_topic_score_gemma":0.0004572573,"domain_scores_codex":[0.9984363,0.00047221,0.00008167242,0.0002123529,0.0005792748,0.0002182481],"domain_scores_gemma":[0.9984089,0.0004311675,0.0001411001,0.0004324196,0.0004685036,0.0001179815],"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.000002652547,0.00000230465,0.00002142144,0.000008161115,8.354352e-7,0.00001453586,0.00005777202,0.0003568906,0.0001423026,0.9975603,0.0004449527,0.001387871],"study_design_scores_gemma":[0.000003900036,0.00001471723,0.00004158114,0.00001436532,0.000002914064,0.000109121,0.00003460838,0.004444273,0.0002599352,0.9819031,0.01316336,0.000008164327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03213818,0.001485117,0.7889137,0.003391403,0.001071031,0.0001778482,0.0005794424,0.0002901837,0.1719531],"genre_scores_gemma":[0.7032041,0.003087178,0.2032481,0.00248052,0.002482904,0.000672082,0.0008150097,0.0004433781,0.08356674],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00662841,"threshold_uncertainty_score":0.0221743,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1496348523","doi":"10.1023/a:1016544907275","title":"An Enumeration of Binary Self-Dual Codes of Length 32","year":2002,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Combinatorics; Enumeration; Binary number; Mathematics; Permutation (music); Code (set theory); Binary code; Discrete mathematics; Dual (grammatical number); Automorphism; Linear code; Dual code; Set (abstract data type); Block code; Computer science; Algorithm; Decoding methods; Arithmetic; Physics","authors":[{"name":"R. T. Bilous","is_ca":true},{"name":"Glynda Rees","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02439286493554739,"gpt":0.2343478383543354,"spread":0.209954973418788,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007087407,0.0007179562,0.0007772167,0.002016051,0.001592949,0.002418276,0.0008422642,0.001261698,0.01024428],"category_scores_gemma":[0.004723404,0.0006022333,0.0006000269,0.002417699,0.0009653742,0.002156005,0.001957572,0.00140767,0.002194807],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001097884,"about_ca_system_score_gemma":0.00123232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000462711,"about_ca_topic_score_gemma":0.00074306,"domain_scores_codex":[0.9989405,0.0002888157,0.00009109014,0.0001196855,0.0003589547,0.0002009536],"domain_scores_gemma":[0.996929,0.001468029,0.0002597393,0.0004516332,0.0006548318,0.0002367472],"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.0007861978,0.0002010359,0.002775781,0.000337452,0.00002892554,0.0003171589,0.0005505405,0.007338159,0.01467426,0.8513585,0.01155096,0.1100811],"study_design_scores_gemma":[0.00008825909,0.000160607,0.0009581334,0.0001461912,0.00003197712,0.0009178706,0.0002265723,0.04352631,0.008976494,0.9208847,0.02403463,0.00004819357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6891871,0.0009382588,0.1857443,0.002130779,0.0003208514,0.0001892341,0.002162045,0.0006346137,0.1186928],"genre_scores_gemma":[0.8122945,0.0006561303,0.1293349,0.0006363007,0.0001848836,0.0003409382,0.002851688,0.0002962114,0.05340442],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01024428,"threshold_uncertainty_score":0.03427052,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1979275900","doi":"10.1007/s10623-014-9934-8","title":"Quantum codes from nearly self-orthogonal quaternary linear codes","year":2014,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Quantum convolutional code; Quantum; Linear code; Orthogonality; Mathematics; Discrete mathematics; Code (set theory); Minimum distance; Error detection and correction; Expander code; Combinatorics; Physics; Block code; Quantum mechanics; Algorithm; Computer science; Decoding methods; Geometry; Set (abstract data type)","authors":[{"name":"Petr Lisoněk","is_ca":true},{"name":"Vijaykumar Singh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01281574074036141,"gpt":0.2267412512054778,"spread":0.2139255104651164,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007409697,0.0004873168,0.0006001694,0.00111661,0.0008245199,0.002071287,0.000501838,0.001389359,0.006418106],"category_scores_gemma":[0.003867173,0.0003783927,0.0005013642,0.0009349359,0.001784863,0.002245912,0.00217523,0.001872561,0.001891784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000840571,"about_ca_system_score_gemma":0.0009540129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003915051,"about_ca_topic_score_gemma":0.0004478026,"domain_scores_codex":[0.999171,0.0001925541,0.00004976208,0.00008989395,0.0004004413,0.0000963343],"domain_scores_gemma":[0.9985065,0.0004678738,0.0002062104,0.000322402,0.0003732596,0.00012372],"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.00004342271,0.0000108354,0.0001229355,0.00003980981,0.000004887679,0.00003988056,0.00009285509,0.003438151,0.004041246,0.9824576,0.0008540033,0.008854205],"study_design_scores_gemma":[0.00002448152,0.0000372198,0.0002889864,0.00003937578,0.00000547383,0.0001824693,0.00003349465,0.02489822,0.004222071,0.9625238,0.007710248,0.0000343461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2330205,0.002483674,0.6092359,0.003342134,0.001429244,0.0002627218,0.0009215145,0.0006720504,0.1486323],"genre_scores_gemma":[0.8554519,0.001820584,0.09953772,0.001686621,0.0009464036,0.0002208986,0.0006377504,0.0003506997,0.03934754],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006418106,"threshold_uncertainty_score":0.02147073,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1567897629","doi":"10.1023/a:1008385407717","title":"On the Key Equation Over a Commutative Ring","year":2000,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Communications Research Centre Canada","funders":"Engineering and Physical Sciences Research Council","keywords":"Monic polynomial; Mathematics; Polynomial ring; BCH code; Commutative ring; Ring (chemistry); Discrete mathematics; Integral domain; Quotient ring; Minimal polynomial (linear algebra); Combinatorics; Ring of integers; Polynomial; Field (mathematics); Matrix polynomial; Decoding methods; Reciprocal polynomial; Commutative property; Pure mathematics; Algorithm; Algebraic number field","authors":[{"name":"Graham H. Norton","is_ca":true},{"name":"Ana Sălăgean","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03502660253253438,"gpt":0.2452001216337981,"spread":0.2101735191012638,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001606924,0.0008065926,0.001155953,0.001628313,0.001453526,0.002175675,0.0008377128,0.002128453,0.008240617],"category_scores_gemma":[0.004215281,0.0004420518,0.0008184817,0.002010044,0.004594326,0.008629248,0.003065041,0.004384884,0.001496344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002059169,"about_ca_system_score_gemma":0.00130832,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001828531,"about_ca_topic_score_gemma":0.0008841121,"domain_scores_codex":[0.9991164,0.000234411,0.00005944799,0.0001443857,0.0002735002,0.0001719037],"domain_scores_gemma":[0.9983057,0.001036424,0.0001483936,0.0001277105,0.000273347,0.0001084149],"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.00002048725,0.00000890601,0.00009488038,0.00001950587,0.000003080061,0.00005173603,0.0001380009,0.0007261253,0.0003022348,0.9955583,0.0009540829,0.002122671],"study_design_scores_gemma":[0.00001783001,0.000008859248,0.00007960939,0.00001491631,0.000005097895,0.00005888919,0.00002689369,0.003776528,0.0001946063,0.9930092,0.00279715,0.00001041036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2901013,0.008745598,0.3823408,0.0248799,0.003405914,0.0001404676,0.0008226582,0.0001880796,0.2893752],"genre_scores_gemma":[0.8865017,0.006771138,0.02850175,0.002001715,0.002466312,0.0001494329,0.0004887328,0.0001549913,0.07296409],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008240617,"threshold_uncertainty_score":0.02756757,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2052060691","doi":"10.1007/s10623-013-9835-2","title":"A construction for strength-3 covering arrays from linear feedback shift register sequences","year":2013,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"Beijing Institute For Brain Disorders","keywords":"Prime power; Prime (order theory); Combinatorics; Mathematics; Finite field; Variable (mathematics); Discrete mathematics; Upper and lower bounds; Shift register; Type (biology); Polynomial; Computer science; Mathematical analysis; Telecommunications","authors":[{"name":"Sebastian Raaphorst","is_ca":true},{"name":"Lucia Moura","is_ca":true},{"name":"Brett Stevens","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02420121539016985,"gpt":0.2335028447412578,"spread":0.209301629351088,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003852318,0.00065182,0.0004866424,0.0006392971,0.000669906,0.0009300237,0.0006334003,0.0009417363,0.0036588],"category_scores_gemma":[0.001940927,0.0004363488,0.0005993919,0.0007005809,0.0006505846,0.0009738175,0.001847725,0.001154297,0.001479017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005272075,"about_ca_system_score_gemma":0.0006262499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002402983,"about_ca_topic_score_gemma":0.0003006597,"domain_scores_codex":[0.9993807,0.000124567,0.00004745244,0.00008881438,0.0002511335,0.0001072732],"domain_scores_gemma":[0.9989995,0.0003943242,0.0001349459,0.0002229355,0.0001412703,0.000107061],"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.0004184181,0.00008559324,0.0009051961,0.0002342557,0.00003890893,0.0004743929,0.0004020635,0.01937035,0.1250247,0.6880124,0.004685085,0.1603485],"study_design_scores_gemma":[0.0001438661,0.0007946157,0.001326797,0.0001473608,0.00008392937,0.001898352,0.0001557757,0.1622496,0.1815831,0.5991251,0.05231579,0.0001756778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1053572,0.0003218425,0.8664795,0.0005990145,0.0002759654,0.0001467118,0.000319735,0.001873886,0.02462625],"genre_scores_gemma":[0.6662607,0.0003639928,0.3188681,0.0005151943,0.0001794805,0.0003451921,0.0005558619,0.0002868656,0.01262468],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0036588,"threshold_uncertainty_score":0.01223993,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2085688367","doi":"10.1007/s10623-003-4195-y","title":"Symmetric (4,4)-Nets and Generalized Hadamard Matrices Over Groups of Order 4","year":2005,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":29,"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":"Hadamard transform; Mathematics; Order (exchange); Pure mathematics; Combinatorics; Complex Hadamard matrix; Hadamard matrix; Mathematical analysis; Business","authors":[{"name":"Masaaki Harada","is_ca":false},{"name":"Clement Lam","is_ca":true},{"name":"Vladimir D. Tonchev","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009775038603313631,"gpt":0.2049086435643117,"spread":0.195133604960998,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006667852,0.0007454217,0.0006021503,0.00166274,0.001269738,0.002496272,0.0006757353,0.001147334,0.004597432],"category_scores_gemma":[0.001753365,0.0004310817,0.0005449264,0.001226363,0.002187802,0.002866186,0.001222094,0.001444439,0.0005776582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001284349,"about_ca_system_score_gemma":0.0009684759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009728831,"about_ca_topic_score_gemma":0.001496693,"domain_scores_codex":[0.9992679,0.0002450247,0.00004356315,0.0001080928,0.0001648579,0.0001705552],"domain_scores_gemma":[0.9983934,0.0005726213,0.0004235602,0.0002085039,0.0001962859,0.000205607],"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.0001045284,0.00001753297,0.0002423379,0.00002163978,0.0000082059,0.0001286422,0.0001487488,0.003900517,0.001930858,0.9879067,0.0004784574,0.005111912],"study_design_scores_gemma":[0.0000274813,0.00005389888,0.0001883414,0.00001961841,0.00001001627,0.0001612019,0.0001239255,0.01895753,0.002953607,0.9745691,0.002908255,0.00002689115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7232293,0.0007057129,0.21395,0.001507931,0.0005300508,0.0001090758,0.0002472247,0.0003073713,0.05941332],"genre_scores_gemma":[0.9355454,0.0003700951,0.03908959,0.0003487361,0.0002385308,0.00009689909,0.0001330035,0.00005281895,0.02412487],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004597432,"threshold_uncertainty_score":0.01537991,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147118979","doi":"10.1007/s10623-011-9537-6","title":"On explicit factors of cyclotomic polynomials over finite fields","year":2011,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","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":"Center for Advanced Study, University of Illinois at Urbana-Champaign; National Natural Science Foundation of China","keywords":"Cyclotomic polynomial; Mathematics; Finite field; Factorization; Cyclotomic field; Field (mathematics); Factorization of polynomials; Combinatorics; Pure mathematics; Polynomial; Discrete mathematics; Mathematical analysis; Algorithm","authors":[{"name":"Liping Wang","is_ca":false},{"name":"Qiang Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04522408745819378,"gpt":0.2362040187997211,"spread":0.1909799313415273,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009614088,0.001428336,0.0009610759,0.001930907,0.001445694,0.002663685,0.0008045987,0.001045523,0.008461938],"category_scores_gemma":[0.004713011,0.0005829617,0.0006362473,0.002186108,0.00355663,0.005500826,0.002017632,0.003107639,0.001146162],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001850758,"about_ca_system_score_gemma":0.0007483991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001852426,"about_ca_topic_score_gemma":0.002102411,"domain_scores_codex":[0.9991429,0.0001737253,0.00003550207,0.0001307944,0.0002749979,0.0002420716],"domain_scores_gemma":[0.9979965,0.001062725,0.0002993802,0.000222843,0.0002297107,0.0001888417],"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.0000611802,0.00002628962,0.0002073748,0.00004023841,0.000003993934,0.0001001893,0.0002329075,0.002049406,0.0005397535,0.9903489,0.0008802483,0.005509399],"study_design_scores_gemma":[0.0000182693,0.00002093441,0.0001498704,0.00003300595,0.000007019709,0.0001042288,0.00006736533,0.004784936,0.0004659003,0.9913772,0.002957479,0.00001380078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6274722,0.005371606,0.1677709,0.004095552,0.0009347199,0.00008826971,0.0005709887,0.0004178201,0.1932779],"genre_scores_gemma":[0.9628443,0.002280422,0.01048526,0.0002814636,0.0006913884,0.00003820134,0.0002493087,0.0001186221,0.02301112],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008461938,"threshold_uncertainty_score":0.02830803,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1981994820","doi":"10.1007/s10623-010-9471-z","title":"Quaternary Golay sequence pairs I: even length","year":2010,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Athabasca University; Simon Fraser University; University of Alberta","funders":"","keywords":"Binary Golay code; Sequence (biology); Mathematics; Complementary sequences; Phase (matter); Ternary Golay code; Combinatorics; Physics; Statistics; Biology; Genetics; Decoding methods; Quantum mechanics","authors":[{"name":"Richard G. Gibson","is_ca":true},{"name":"Jonathan Jedwab","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02799504692566045,"gpt":0.2529711090485152,"spread":0.2249760621228547,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004901079,0.00135122,0.0005277568,0.001662498,0.001495178,0.002496444,0.0004591013,0.001214897,0.01281481],"category_scores_gemma":[0.001712511,0.0002855669,0.0002695768,0.001271684,0.001676865,0.001513844,0.001241476,0.001329012,0.006163632],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009806018,"about_ca_system_score_gemma":0.00105765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002717779,"about_ca_topic_score_gemma":0.000156521,"domain_scores_codex":[0.9995171,0.0001043217,0.00004292437,0.0001024544,0.0000940211,0.0001392736],"domain_scores_gemma":[0.9990844,0.0001982842,0.0002101746,0.0001702278,0.0002156514,0.0001212149],"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.001110821,0.0001004182,0.001573284,0.0003296245,0.00001865607,0.0009077606,0.0005893508,0.001805411,0.04971953,0.8152152,0.02870202,0.09992793],"study_design_scores_gemma":[0.0001799161,0.001128074,0.001924109,0.0003503139,0.00006641019,0.00366323,0.0007472593,0.01240347,0.1312304,0.5992925,0.248855,0.0001594444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3396058,0.00403554,0.3203935,0.005227269,0.004239962,0.0007332294,0.005209471,0.003847108,0.3167081],"genre_scores_gemma":[0.8791918,0.001773541,0.06921483,0.001741951,0.0009728196,0.0006739585,0.001680043,0.0007353256,0.04401575],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01281481,"threshold_uncertainty_score":0.04286987,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068652081","doi":"10.1007/s10623-007-9117-y","title":"Construction of MDS self-dual codes over Galois rings","year":2007,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Louisville","keywords":"Dual (grammatical number); Mathematics; Galois theory; Computer science; Discrete mathematics; Linguistics; Philosophy","authors":[{"name":"Jon-Lark Kim","is_ca":false},{"name":"Yoonjin Lee","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01198365667907049,"gpt":0.2340833622846912,"spread":0.2220997056056208,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005852816,0.0004309252,0.0005459962,0.001201902,0.0009078978,0.001307282,0.000477809,0.0005518558,0.003834131],"category_scores_gemma":[0.001259022,0.0004082388,0.0005824149,0.0006939926,0.001096304,0.001108841,0.002700149,0.001210641,0.0008157872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007078238,"about_ca_system_score_gemma":0.0007037276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001459017,"about_ca_topic_score_gemma":0.0002120052,"domain_scores_codex":[0.9994647,0.0001198072,0.00003450087,0.00006705283,0.0002104994,0.0001033371],"domain_scores_gemma":[0.9991419,0.0002299669,0.000105284,0.0002339484,0.0001372475,0.0001515906],"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.0001464102,0.00006727206,0.0007146061,0.00008688382,0.00001751442,0.000170029,0.0003676306,0.004799863,0.00981212,0.9575067,0.001821271,0.02448978],"study_design_scores_gemma":[0.0001853624,0.0002403946,0.000804898,0.0001091174,0.00005782772,0.0009775055,0.0002942964,0.06240759,0.05836043,0.8364969,0.03997914,0.00008649549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4648744,0.0005804658,0.4736954,0.001166093,0.0004377897,0.000229804,0.0004530461,0.001039651,0.0575234],"genre_scores_gemma":[0.8831699,0.0003152589,0.09715777,0.0001956436,0.0001317675,0.0001152678,0.0003436201,0.0001435345,0.01842712],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003834131,"threshold_uncertainty_score":0.01282644,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024356427","doi":"10.1023/b:desi.0000029217.97956.26","title":"The Lovász Local Lemma and Its Applications to some Combinatorial Arrays","year":2004,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University; University of Waterloo","funders":"","keywords":"Lemma (botany); Probabilistic logic; Set (abstract data type); Hash function; Cover (algebra); Discrete mathematics; Mathematics; Combinatorics; Computer science; Theoretical computer science","authors":[{"name":"Dong Deng","is_ca":true},{"name":"Douglas R. Stinson","is_ca":true},{"name":"Ruizhong Wei","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01203635585631058,"gpt":0.2113518942167845,"spread":0.199315538360474,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00142154,0.0007872832,0.00117354,0.003088871,0.001581389,0.003363779,0.0009657196,0.001448802,0.007365212],"category_scores_gemma":[0.007799823,0.0005150904,0.001100845,0.003406688,0.003784364,0.005195092,0.002094705,0.004103342,0.001501117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001602956,"about_ca_system_score_gemma":0.0006415916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006519365,"about_ca_topic_score_gemma":0.0006231343,"domain_scores_codex":[0.9993325,0.0002622087,0.00003494057,0.0001175576,0.0001702007,0.0000825536],"domain_scores_gemma":[0.9960323,0.00277971,0.0003341502,0.0003226916,0.0003474528,0.0001836915],"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.00001332094,0.00001127857,0.00006485042,0.00002994774,0.000005172415,0.00003993738,0.00007355436,0.001557183,0.0004587403,0.9914384,0.001447479,0.004860125],"study_design_scores_gemma":[0.000007925462,0.00000967827,0.00005127574,0.000008203405,0.00000610537,0.00006731576,0.00003043563,0.008849259,0.0003691385,0.9875998,0.002989674,0.00001109569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07311799,0.004881545,0.7820665,0.006403618,0.0004836805,0.0000592566,0.0003176632,0.0004101022,0.1322597],"genre_scores_gemma":[0.8422004,0.007150779,0.09931256,0.002675561,0.002440649,0.0003084071,0.0004749743,0.0004242025,0.04501251],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007365212,"threshold_uncertainty_score":0.02463901,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2040765034","doi":"10.1007/s10623-009-9342-7","title":"NTRU over rings beyond $${\\mathbb{Z}}$$","year":2009,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"NTRU; Cryptosystem; Lattice (music); Eisenstein integer; Mathematics; Lattice problem; Discrete mathematics; Pure mathematics; Combinatorics; Physics; Cryptography; Algorithm; Algebraic number; Mathematical analysis","authors":[{"name":"Monica Nevins","is_ca":true},{"name":"Camelia Karimianpour","is_ca":true},{"name":"Ali Miri","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01191249267348816,"gpt":0.2361115233317453,"spread":0.2241990306582572,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001020846,0.0007478341,0.0007970493,0.00102692,0.001528084,0.002980509,0.000781689,0.0007259895,0.02430453],"category_scores_gemma":[0.002649786,0.0003105551,0.0004744538,0.0007395662,0.001573559,0.004052051,0.002165416,0.001872433,0.00882065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001094302,"about_ca_system_score_gemma":0.0006850763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005454266,"about_ca_topic_score_gemma":0.0005398364,"domain_scores_codex":[0.9986736,0.0003595529,0.00007128149,0.0002164142,0.0003826368,0.0002965828],"domain_scores_gemma":[0.9988881,0.0002853867,0.0001425243,0.0003179049,0.0002375749,0.0001285501],"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.000222304,0.00004174508,0.000143243,0.00008879902,0.000008611248,0.0000800457,0.0001189937,0.0007053924,0.002766738,0.9581935,0.006651799,0.03097874],"study_design_scores_gemma":[0.00005212073,0.0001533293,0.0003285613,0.0001255341,0.00004162944,0.0005486757,0.00007885435,0.008966606,0.01846899,0.8838751,0.08730005,0.00006063041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1499967,0.002279049,0.2984647,0.003018415,0.002239689,0.0001549082,0.00119919,0.00312606,0.5395212],"genre_scores_gemma":[0.8092861,0.0008872274,0.04865865,0.0009659966,0.0008348429,0.0001525403,0.0005025095,0.0007673145,0.1379448],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02430453,"threshold_uncertainty_score":0.08130676,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2045656598","doi":"10.1007/s10623-005-3256-9","title":"Super-simple (ν, 5, 5) Designs","year":2006,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"Beijing Institute For Brain Disorders","keywords":"Simple (philosophy); Computer science; Block (permutation group theory); Hash function; Block code; Arithmetic; Mathematics; Algorithm; Theoretical computer science; Combinatorics; Decoding methods; Programming language","authors":[{"name":"Kejun Chen","is_ca":true},{"name":"Ruizhong Wei","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01382403335301103,"gpt":0.1967245047692172,"spread":0.1829004714162062,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001550367,0.0006920359,0.0007410658,0.001289445,0.001105545,0.001837134,0.0008000489,0.00127223,0.01132544],"category_scores_gemma":[0.003837816,0.0005424533,0.0007091901,0.001084385,0.001086016,0.001540068,0.001512382,0.0009593309,0.002711431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006514812,"about_ca_system_score_gemma":0.001035446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002723337,"about_ca_topic_score_gemma":0.0007132208,"domain_scores_codex":[0.9982862,0.0007353851,0.0001058878,0.0001780399,0.0004672745,0.0002271086],"domain_scores_gemma":[0.9974577,0.0008183668,0.0003687319,0.0006820657,0.000444014,0.0002291212],"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.0005982317,0.00005999986,0.000883802,0.0002026597,0.00006959382,0.00038495,0.000229651,0.007707093,0.01842886,0.9173771,0.002893294,0.05116474],"study_design_scores_gemma":[0.0002675883,0.0005234029,0.0008294945,0.0001186329,0.0001257612,0.001060255,0.000118763,0.04398008,0.01256557,0.9172816,0.02304634,0.00008242612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3390253,0.0009636081,0.5368884,0.001242136,0.0005611606,0.0002835169,0.0005554305,0.0009445341,0.119536],"genre_scores_gemma":[0.8532149,0.0004034387,0.1243823,0.0006773384,0.0002377339,0.0002389413,0.0002537716,0.00008214398,0.02050943],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01132544,"threshold_uncertainty_score":0.03788739,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2042048765","doi":"10.1007/s10623-003-6739-6","title":"Resolvable Maximum Packings with Quadruples","year":2005,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":26,"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":"Combinatorics; Mathematics; Partition (number theory); Block (permutation group theory); Type (biology); Group (periodic table); Physics","authors":[{"name":"Gennian Ge","is_ca":false},{"name":"Clement Lam","is_ca":true},{"name":"Alan C. H. Ling","is_ca":false},{"name":"Hao Shen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00945934874243578,"gpt":0.1832503914591324,"spread":0.1737910427166966,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00110459,0.0008853923,0.001191354,0.001911795,0.001878873,0.002460912,0.001270629,0.00212088,0.01152452],"category_scores_gemma":[0.005866095,0.001277462,0.0008913059,0.002402649,0.001742004,0.003986174,0.003308492,0.002940248,0.002822322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007798794,"about_ca_system_score_gemma":0.0006555198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002968303,"about_ca_topic_score_gemma":0.0004435847,"domain_scores_codex":[0.9985947,0.000523579,0.00009676937,0.0002306541,0.000340471,0.0002138667],"domain_scores_gemma":[0.9950984,0.002709457,0.0005981452,0.001044918,0.0002734427,0.0002756176],"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.0002885969,0.00010518,0.0003101364,0.000160162,0.00003061106,0.0001765745,0.0003278669,0.01957886,0.007299389,0.9156678,0.005342837,0.05071196],"study_design_scores_gemma":[0.0000494014,0.0001187554,0.0001409848,0.00007140049,0.00001306061,0.0002476386,0.00009826252,0.04950888,0.005157677,0.9378048,0.006754036,0.000035167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2558548,0.001096366,0.6682604,0.00185373,0.0003388337,0.0001866635,0.0007597075,0.001468118,0.0701813],"genre_scores_gemma":[0.6695431,0.001006688,0.2984356,0.001140152,0.0002847744,0.0003826526,0.0009600547,0.0006199703,0.02762713],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01152452,"threshold_uncertainty_score":0.03855342,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2047352316","doi":"10.1007/s10623-012-9647-9","title":"Composed products and factors of cyclotomic polynomials over finite fields","year":2012,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":25,"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":"Factorization; Finite field; Primitive root modulo n; Multiplicative function; Combinatorics; Root of unity; Mathematics; Cyclotomic polynomial; Prime (order theory); Coprime integers; Modulo; Prime factor; Euler's totient function; Polynomial; Cyclotomic field; Discrete mathematics; Euler's formula; Physics","authors":[{"name":"Aleksandr Tuxanidy","is_ca":true},{"name":"Qiang Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02827624232016959,"gpt":0.242050483323458,"spread":0.2137742410032884,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001017063,0.0007862052,0.0006697866,0.001395758,0.0009113299,0.002522937,0.0006133824,0.000626267,0.007381643],"category_scores_gemma":[0.003294102,0.0004694311,0.0007073804,0.001386609,0.002270167,0.003861369,0.001435184,0.001516159,0.001019496],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001049387,"about_ca_system_score_gemma":0.0006965008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005053913,"about_ca_topic_score_gemma":0.0006641748,"domain_scores_codex":[0.998899,0.000229705,0.00006451872,0.0002169007,0.0003779389,0.0002118785],"domain_scores_gemma":[0.9982997,0.0006862059,0.0003150389,0.000264049,0.0002498491,0.0001852642],"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.00010293,0.00002221363,0.0002926139,0.00004507117,0.00001194853,0.000126778,0.0002397119,0.001455929,0.001322784,0.9856269,0.000908147,0.009844937],"study_design_scores_gemma":[0.00002708754,0.00005539889,0.0003127255,0.00002899583,0.00002156164,0.0002545896,0.00009172936,0.005359638,0.002535775,0.9833377,0.007952906,0.00002182561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6076958,0.004076897,0.2685804,0.001567134,0.0006904826,0.0001276565,0.0006086467,0.0004433405,0.1162097],"genre_scores_gemma":[0.9388478,0.001497049,0.03050558,0.0002107128,0.0005385318,0.00006530143,0.000338276,0.0001401884,0.02785657],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007381643,"threshold_uncertainty_score":0.02469409,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W208847948","doi":"10.1023/a:1011212922844","title":"The Existence of a Bush-Type Hadamard Matrix of Order 324 and Two New Infinite Classes of Symmetric Designs","year":2001,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Hadamard transform; Mathematics; Order (exchange); Type (biology); Lambda; Block (permutation group theory); Graph; Integer (computer science); Matrix (chemical analysis); Physics; Mathematical analysis; Quantum mechanics; Computer science","authors":[{"name":"Zvonimir Janko","is_ca":false},{"name":"Hadi Kharaghani","is_ca":true},{"name":"Vladimir D. Tonchev","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0278077648928304,"gpt":0.2540481118211361,"spread":0.2262403469283057,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006358554,0.0004951261,0.000530917,0.001627425,0.001423076,0.002168234,0.0007233001,0.001482876,0.002638732],"category_scores_gemma":[0.002774643,0.0004677597,0.0006342041,0.0007007605,0.002743958,0.002354014,0.0009401118,0.001449834,0.0002963643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008750736,"about_ca_system_score_gemma":0.0006963374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003389455,"about_ca_topic_score_gemma":0.0004310168,"domain_scores_codex":[0.9995162,0.0001090858,0.00003637421,0.0001094751,0.0001195635,0.0001093772],"domain_scores_gemma":[0.9978495,0.0009779371,0.0003299081,0.0003854038,0.0001782664,0.0002790263],"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.00009959912,0.00002847856,0.0004921964,0.00003045494,0.000006100004,0.0001847523,0.0002485927,0.0008115802,0.005187254,0.9884545,0.0005048793,0.00395156],"study_design_scores_gemma":[0.00006375209,0.00009098796,0.0007365542,0.00002613834,0.00001748194,0.0009668936,0.0001591412,0.01603802,0.00683858,0.9705611,0.004446894,0.00005449672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"other","genre_scores_codex":[0.9061353,0.0004656706,0.05279346,0.0006763475,0.0001280886,0.00003692999,0.0001730258,0.0001686323,0.03942257],"genre_scores_gemma":[0.9804128,0.0001547757,0.01276775,0.0001130705,0.00009148111,0.00004059814,0.0001446407,0.00003772509,0.006237161],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.002638732,"threshold_uncertainty_score":0.008827448,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066388619","doi":"10.1007/s10623-006-9000-2","title":"Self-dual codes over $$\\mathbb{Z}_8$$ and $$\\mathbb{Z}_9$$","year":2006,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":25,"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":"Dual (grammatical number); Combinatorics; Mathematics; Torsion (gastropod); Discrete mathematics; Physics; Art","authors":[{"name":"Steven T. Dougherty","is_ca":false},{"name":"T. Aaron Gulliver","is_ca":true},{"name":"John N. C. Wong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01069031078913155,"gpt":0.2158688764443587,"spread":0.2051785656552271,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001173441,0.001111736,0.0008414187,0.003042697,0.001884915,0.004016038,0.0009067001,0.001573371,0.01354936],"category_scores_gemma":[0.002972544,0.0005892628,0.0008170471,0.001784515,0.002414556,0.003803576,0.002717405,0.002909037,0.003753915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001784763,"about_ca_system_score_gemma":0.001374809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006108205,"about_ca_topic_score_gemma":0.0005671202,"domain_scores_codex":[0.9984042,0.0003336788,0.00008578444,0.0002682967,0.0005291852,0.0003789129],"domain_scores_gemma":[0.9981418,0.0004828062,0.0003202373,0.0002548236,0.0005125593,0.000287748],"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.0001119099,0.0000331795,0.00009711496,0.00002672942,0.00000719265,0.00003869322,0.00007338819,0.0003841762,0.001218877,0.9884791,0.001940888,0.007588731],"study_design_scores_gemma":[0.00004715096,0.0000323603,0.00019509,0.00004120066,0.00001444628,0.0002162003,0.00005182047,0.003987473,0.004508402,0.9806443,0.01022649,0.00003501379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4244424,0.00200579,0.3114555,0.007452722,0.002286428,0.0002434556,0.00183473,0.001405093,0.2488739],"genre_scores_gemma":[0.8614613,0.001173098,0.04266281,0.00198048,0.001243955,0.0002874401,0.0007700595,0.0005621478,0.08985873],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01354936,"threshold_uncertainty_score":0.04532713,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2086188341","doi":"10.1007/s10623-010-9457-x","title":"On zeros of Kloosterman sums","year":2011,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Kloosterman sum; Mathematics; Zero (linguistics); Monomial; Ternary operation; Combinatorics; Pure mathematics; Discrete mathematics; Computer science","authors":[{"name":"Petr Lisoněk","is_ca":true},{"name":"Marko Moisio","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04483294077571989,"gpt":0.2252095334496642,"spread":0.1803765926739443,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001492666,0.001384193,0.001056082,0.002833501,0.002235009,0.003317683,0.001305231,0.001549889,0.007530612],"category_scores_gemma":[0.008786697,0.0006698217,0.0007198276,0.001957834,0.005028006,0.005444282,0.003303246,0.002944062,0.001764143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001441681,"about_ca_system_score_gemma":0.0008345518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007517142,"about_ca_topic_score_gemma":0.0007305034,"domain_scores_codex":[0.9990036,0.0003163812,0.00004999046,0.0001269902,0.0002820794,0.0002208912],"domain_scores_gemma":[0.9972385,0.001535937,0.0003609009,0.0002490956,0.0003153939,0.000300139],"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.00007533543,0.00001480301,0.0001277623,0.00003202986,0.000005326329,0.00005877053,0.0001824214,0.001521286,0.0006384005,0.9922036,0.0009142808,0.004225991],"study_design_scores_gemma":[0.00001335023,0.00001357902,0.00006412052,0.0000258411,0.000005087667,0.00006685243,0.00005276372,0.003948661,0.0003876815,0.9942497,0.001156227,0.00001603686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5869055,0.003890816,0.2070001,0.004719958,0.001503592,0.00007563987,0.0003232146,0.0004073133,0.1951738],"genre_scores_gemma":[0.9375029,0.001663246,0.01405712,0.0006778978,0.0008480154,0.00007759365,0.0001921495,0.0002068426,0.04477426],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007530612,"threshold_uncertainty_score":0.02519238,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2044689213","doi":"10.1007/s10623-012-9696-0","title":"On self-dual cyclic codes over finite chain rings","year":2012,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":25,"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":"Chain (unit); Dual (grammatical number); Mathematics; Lift (data mining); Finite field; Ring (chemistry); Code (set theory); Cyclic code; Extension (predicate logic); Discrete mathematics; Linear code; Topology (electrical circuits); Pure mathematics; Computer science; Combinatorics; Block code; Physics; Algorithm; Decoding methods; Chemistry; Quantum mechanics","authors":[{"name":"Aicha Batoul","is_ca":false},{"name":"Kenza Guenda","is_ca":false},{"name":"T. Aaron Gulliver","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01801084104784086,"gpt":0.2382375273079923,"spread":0.2202266862601515,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001075348,0.001126298,0.0008138485,0.003245036,0.001869619,0.002511841,0.0007841786,0.001450055,0.005417671],"category_scores_gemma":[0.00349829,0.0006430785,0.0006642375,0.002701865,0.004260868,0.004721815,0.003739209,0.002292579,0.0007498804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001792816,"about_ca_system_score_gemma":0.0009708562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001009531,"about_ca_topic_score_gemma":0.0009447639,"domain_scores_codex":[0.9989733,0.0002716894,0.00004630052,0.0001251249,0.0003215269,0.0002621065],"domain_scores_gemma":[0.9972039,0.001313485,0.0004702331,0.0003040826,0.0003544956,0.0003536982],"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.0000609277,0.00002594136,0.0001643408,0.00002843286,0.000003737595,0.00007392006,0.0001893874,0.001848036,0.000701525,0.9932701,0.0004469838,0.003186715],"study_design_scores_gemma":[0.00002131169,0.00003705635,0.0001329577,0.0000336582,0.000007396081,0.0001071715,0.00006705258,0.007573804,0.0007658672,0.9893679,0.001864702,0.00002111069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.726002,0.003186627,0.1457225,0.002971424,0.0007411917,0.00009772591,0.0004025796,0.0002196938,0.1206562],"genre_scores_gemma":[0.9592425,0.002386231,0.01117569,0.0004850444,0.001044063,0.00008425174,0.0003074189,0.00008998091,0.02518491],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.005417671,"threshold_uncertainty_score":0.01812392,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2022789141","doi":"10.1007/s10623-006-9014-9","title":"On binary signed digit representations of integers","year":2006,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Digital Image Processing Techniques","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":"University of Waterloo","funders":"","keywords":"Integer (computer science); Mathematics; Binary number; Numerical digit; Representation (politics); Cryptography; Discrete mathematics; Arithmetic; Number theory; Combinatorics; Algorithm; Computer science","authors":[{"name":"Nevine Ebeid","is_ca":true},{"name":"M.A. Hasan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01542386974479558,"gpt":0.2578590586946326,"spread":0.242435188949837,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007881209,0.0008227963,0.0004471197,0.001838744,0.0005222271,0.002510503,0.0005621079,0.0009591093,0.005532171],"category_scores_gemma":[0.006584623,0.0002738284,0.0003457855,0.002962267,0.001513239,0.003297266,0.001495154,0.001482723,0.001969331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006359693,"about_ca_system_score_gemma":0.0005049442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004058499,"about_ca_topic_score_gemma":0.0004588545,"domain_scores_codex":[0.9990044,0.0002854703,0.00008727957,0.0001155453,0.0003973959,0.000109904],"domain_scores_gemma":[0.9982309,0.0008504793,0.0002384419,0.0003209309,0.0002967922,0.00006250451],"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.00007865459,0.00001472399,0.00009574969,0.0000668512,0.000003772983,0.00007025248,0.000127746,0.005702686,0.002199688,0.9125199,0.002969286,0.0761507],"study_design_scores_gemma":[0.00001793089,0.00006241852,0.0001051221,0.0001449943,0.000008246726,0.0002028878,0.00007690713,0.03587118,0.002802925,0.9380593,0.02261974,0.00002837957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05313645,0.004705862,0.8712491,0.001543986,0.001594916,0.00008164864,0.0003013224,0.0004958448,0.06689093],"genre_scores_gemma":[0.659357,0.0097847,0.2807689,0.001309015,0.001728138,0.0002455426,0.0008054103,0.0003257105,0.0456757],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005532171,"threshold_uncertainty_score":0.01850694,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043513759","doi":"10.1007/s10623-013-9820-9","title":"Bent functions on partial spreads","year":2013,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bent molecular geometry; Prime (order theory); Combinatorics; Binary number; Mathematics; Construct (python library); Physics; Discrete mathematics; Arithmetic; Materials science; Computer science","authors":[{"name":"Petr Lisoněk","is_ca":true},{"name":"Hui Yi Lu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01995621316208238,"gpt":0.2214328709217498,"spread":0.2014766577596674,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009896802,0.001676206,0.001017294,0.00392766,0.001418403,0.003440941,0.0009733342,0.001378748,0.009890492],"category_scores_gemma":[0.004002308,0.0008470914,0.0007846282,0.003213101,0.003671626,0.004858847,0.002677076,0.003793965,0.002235701],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002038257,"about_ca_system_score_gemma":0.0006728593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008580605,"about_ca_topic_score_gemma":0.0007564563,"domain_scores_codex":[0.9989616,0.0003079181,0.00004912689,0.0001352244,0.0003929906,0.0001531711],"domain_scores_gemma":[0.9980186,0.0008776526,0.0002742843,0.0002293544,0.0003305785,0.0002694781],"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.00001698832,0.000005426392,0.00003928388,0.000009385822,0.000002685726,0.00002213318,0.00007576023,0.0007529862,0.0003456836,0.9946101,0.0004077021,0.00371188],"study_design_scores_gemma":[0.000009277131,0.00001257363,0.00006365102,0.00001229064,0.000004372921,0.00004990302,0.00002770204,0.003444258,0.0003010436,0.9937663,0.00229823,0.00001043292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3658972,0.002160011,0.3963881,0.003423423,0.0005480376,0.0001120348,0.0005206188,0.0004753253,0.2304752],"genre_scores_gemma":[0.8453527,0.002033821,0.04126561,0.0007594595,0.0007134329,0.0001753552,0.0003364501,0.0002774616,0.1090857],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009890492,"threshold_uncertainty_score":0.03308702,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2089248193","doi":"10.1007/s10623-012-9784-1","title":"Kötter interpolation in skew polynomial rings","year":2013,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Trigonometric interpolation; Mathematics; Skew; Polynomial interpolation; Interpolation (computer graphics); Birkhoff interpolation; Spline interpolation; Lagrange polynomial; Algebra over a field; Polynomial ring; Polynomial; Noncommutative geometry; Bilinear interpolation; Linear interpolation; Difference polynomials; Orthogonal polynomials; Pure mathematics; Mathematical analysis; Computer science; Artificial intelligence; Image (mathematics)","authors":[{"name":"Siyu Liu","is_ca":true},{"name":"Felice Manganiello","is_ca":true},{"name":"Frank R. Kschischang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01248851822664694,"gpt":0.2144672195103788,"spread":0.2019787012837319,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001176149,0.0004796329,0.000805955,0.001428887,0.001228133,0.00135385,0.0006246131,0.0006915267,0.006502252],"category_scores_gemma":[0.003328956,0.0003439268,0.0005994884,0.001640186,0.002147779,0.002916373,0.001839452,0.002003573,0.001075975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001152888,"about_ca_system_score_gemma":0.0007559572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007728857,"about_ca_topic_score_gemma":0.0009053343,"domain_scores_codex":[0.999302,0.000245973,0.00003718333,0.0000886697,0.0002126716,0.0001135006],"domain_scores_gemma":[0.9988084,0.000520197,0.0001804466,0.0001915824,0.0001840713,0.0001152135],"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.00005859332,0.000009583293,0.0001248106,0.00002074873,0.000002726385,0.00002757495,0.00006957756,0.003225569,0.0005309993,0.9897752,0.0004711389,0.005683464],"study_design_scores_gemma":[0.00002167231,0.00003213521,0.0001220142,0.00001650243,0.000007278905,0.00007342255,0.00004320922,0.01859842,0.001227631,0.9769283,0.002914242,0.0000152834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3673481,0.001799011,0.51195,0.001740965,0.0004708638,0.0001153142,0.0004841179,0.0005057238,0.1155859],"genre_scores_gemma":[0.9182807,0.001121138,0.04907675,0.000295774,0.0002917037,0.00006273929,0.000192499,0.0001565194,0.03052208],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006502252,"threshold_uncertainty_score":0.02175218,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2141368734","doi":"10.1007/s10623-012-9770-7","title":"Combinatorial solutions providing improved security for the generalized Russian cards problem","year":2012,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":20,"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":"Alice (programming language); Alice and Bob; Computer science; Set (abstract data type); Characterization (materials science); Theoretical computer science; Computer security; Mathematical economics; Mathematics; Programming language; Physics","authors":[{"name":"Colleen M. Swanson","is_ca":true},{"name":"Douglas R. Stinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03084577807676895,"gpt":0.2575107934663556,"spread":0.2266650153895867,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001361436,0.001090746,0.001145685,0.001063793,0.001300708,0.00283576,0.001623602,0.001561679,0.00749022],"category_scores_gemma":[0.005330781,0.0005080446,0.001099673,0.001478325,0.002181913,0.003254639,0.002849733,0.003260521,0.0013331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001109062,"about_ca_system_score_gemma":0.001455767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000771944,"about_ca_topic_score_gemma":0.001027725,"domain_scores_codex":[0.9984843,0.0007035052,0.00005713937,0.0001883698,0.0003037491,0.0002629141],"domain_scores_gemma":[0.9977601,0.001174616,0.0002255488,0.0005322479,0.0001697049,0.0001378415],"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.0003389669,0.00009461794,0.0002173768,0.0001081164,0.00004089971,0.00007660042,0.0001321435,0.06603949,0.002418328,0.8990429,0.005796839,0.02569362],"study_design_scores_gemma":[0.0002038956,0.00009465367,0.0001746468,0.00004509681,0.00004238357,0.0001078632,0.00009237139,0.184501,0.001741719,0.806415,0.006544247,0.00003713824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3729956,0.0009463643,0.506955,0.003369031,0.0004897027,0.0002405648,0.0006339049,0.000558799,0.1138111],"genre_scores_gemma":[0.843517,0.0007171821,0.1346941,0.0006095149,0.0002571199,0.0002173583,0.0005935825,0.0001693075,0.01922478],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00749022,"threshold_uncertainty_score":0.02505726,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2060682338","doi":"10.1007/s10623-008-9236-0","title":"Efficient pth root computations in finite fields of characteristic p","year":2008,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":19,"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; Trinomial; Mathematics; Combinatorics; Binomial (polynomial); Irreducible polynomial; Reduction (mathematics); Scalar (mathematics); Polynomial; Field (mathematics); Root (linguistics); Discrete mathematics; Matrix polynomial; Pure mathematics; Mathematical analysis; Geometry","authors":[{"name":"Daniel Panario","is_ca":true},{"name":"David Thomson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02703201342140166,"gpt":0.2355212298611136,"spread":0.208489216439712,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001265751,0.0008890854,0.001209532,0.0009834719,0.001106854,0.00291769,0.001244491,0.000964311,0.009047275],"category_scores_gemma":[0.006580479,0.0004069403,0.0006245741,0.001508896,0.001954312,0.005748445,0.002804071,0.001603202,0.002079698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001576241,"about_ca_system_score_gemma":0.001720452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000794646,"about_ca_topic_score_gemma":0.001744955,"domain_scores_codex":[0.9982294,0.0003715049,0.00009542717,0.0002929117,0.0005492414,0.000461367],"domain_scores_gemma":[0.9963822,0.002147057,0.0002319894,0.0008629817,0.0002434829,0.0001322244],"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.00207375,0.000247476,0.002020315,0.0004994302,0.00008586753,0.0004113235,0.00091287,0.03822319,0.02132099,0.616411,0.01450956,0.3032842],"study_design_scores_gemma":[0.0002452968,0.0002021088,0.0004218328,0.00007170325,0.00006346144,0.0002849137,0.0002044212,0.08622994,0.0183925,0.8870949,0.006745811,0.00004323688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3710985,0.001598982,0.5672973,0.002405637,0.0003227474,0.0001830238,0.0004512767,0.002681764,0.05396076],"genre_scores_gemma":[0.8997141,0.0004979971,0.08288193,0.0002653334,0.0001859412,0.00008265882,0.0003026786,0.0002825262,0.01578677],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009047275,"threshold_uncertainty_score":0.03026611,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076436757","doi":"10.1007/s10623-008-9195-5","title":"The trace of an optimal normal element and low complexity normal bases","year":2008,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Extension (predicate logic); Element (criminal law); Type (biology); Mathematics; TRACE (psycholinguistics); Combinatorics; Finite field; Field (mathematics); Discrete mathematics; Pure mathematics; Computer science","authors":[{"name":"Maria Christopoulou","is_ca":false},{"name":"Theo Garefalakis","is_ca":false},{"name":"Daniel Panario","is_ca":true},{"name":"David Thomson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03360526761037703,"gpt":0.241619337353863,"spread":0.208014069743486,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009678146,0.0007492793,0.0008685747,0.001119767,0.0009566247,0.002506592,0.001441949,0.001363393,0.007813659],"category_scores_gemma":[0.007470675,0.0004369946,0.0005501526,0.001009724,0.003288988,0.004391117,0.002736912,0.003155114,0.001402461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00108423,"about_ca_system_score_gemma":0.001098236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007287438,"about_ca_topic_score_gemma":0.0005103095,"domain_scores_codex":[0.9986891,0.0003128414,0.00005706444,0.0002011383,0.0005280092,0.000211862],"domain_scores_gemma":[0.99784,0.0008875712,0.0001799697,0.0004386168,0.0003467545,0.0003070185],"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.0001142741,0.00003159641,0.0001574301,0.00002255085,0.000005532229,0.00003301812,0.00009071367,0.004664457,0.00138472,0.9835916,0.001000722,0.00890344],"study_design_scores_gemma":[0.00001319725,0.00003838673,0.00004702044,0.000009087691,0.000003280979,0.00006748181,0.00003261213,0.02251191,0.001163234,0.9747696,0.00133254,0.00001167725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3337613,0.0005377042,0.569034,0.002699334,0.000436545,0.00009715513,0.0003481935,0.0005200059,0.09256566],"genre_scores_gemma":[0.8878263,0.0005232191,0.06640045,0.0004547542,0.0003368804,0.0001057915,0.0003291324,0.000302637,0.04372092],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007813659,"threshold_uncertainty_score":0.02613932,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049569453","doi":"10.1007/s10623-010-9472-y","title":"Quaternary Golay sequence pairs II: odd length","year":2010,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Athabasca University; Simon Fraser University; University of Alberta","funders":"","keywords":"Binary Golay code; Sequence (biology); Phase (matter); Mathematics; Complementary sequences; Combinatorics; Physics; Statistics; Biology; Genetics","authors":[{"name":"Richard G. Gibson","is_ca":true},{"name":"Jonathan Jedwab","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02770794634581787,"gpt":0.249631698839137,"spread":0.2219237524933191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003343264,0.001253409,0.0006007436,0.001661259,0.001510431,0.002729021,0.0004238791,0.001161727,0.01140203],"category_scores_gemma":[0.00131392,0.0003506787,0.0003147061,0.001415917,0.001309312,0.001486597,0.001149622,0.001319269,0.004186979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007119953,"about_ca_system_score_gemma":0.0008016714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002466911,"about_ca_topic_score_gemma":0.0002149972,"domain_scores_codex":[0.9996419,0.00007873292,0.00002948506,0.00007498138,0.00007634812,0.00009859971],"domain_scores_gemma":[0.9993792,0.0001309005,0.0001432566,0.0001154347,0.0001354312,0.00009585706],"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.001440069,0.00011551,0.001931648,0.0003397993,0.00002189266,0.001041196,0.0005090951,0.003356662,0.06200029,0.8280206,0.01650409,0.0847192],"study_design_scores_gemma":[0.0001875943,0.001067136,0.002835523,0.0002512358,0.00007861009,0.004706712,0.0005263799,0.02118248,0.1066136,0.6780927,0.1842878,0.0001702252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3853514,0.003858152,0.3225143,0.002587546,0.003038232,0.0005233837,0.002489287,0.002169512,0.2774683],"genre_scores_gemma":[0.884798,0.001359573,0.05737735,0.001075342,0.0008596823,0.0003745239,0.001049451,0.0004582334,0.05264792],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01140203,"threshold_uncertainty_score":0.03814363,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1606300424","doi":"10.1023/a:1016588722296","title":"The Existence of Four HMOLS with Equal Sized Holes","year":2002,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada; Suzhou University; University of New South Wales; University Research Committee, Emory University; Mount Saint Vincent University","keywords":"Prime power; Mathematics; Combinatorics; Prime (order theory); Discrete mathematics; Pure mathematics","authors":[{"name":"R. Julian R. Abel","is_ca":false},{"name":"F.E. Bennett","is_ca":true},{"name":"G. Ge","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02939402757677752,"gpt":0.191181676290877,"spread":0.1617876487140995,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000562292,0.0004181775,0.0005036519,0.0009535408,0.001390669,0.0021483,0.0008217879,0.001620927,0.007543553],"category_scores_gemma":[0.003702286,0.0005277834,0.000440159,0.0005071442,0.003150367,0.002692925,0.002848711,0.001017242,0.000542792],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007020101,"about_ca_system_score_gemma":0.0005251064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003739209,"about_ca_topic_score_gemma":0.0003214807,"domain_scores_codex":[0.9993679,0.0001428829,0.00002869417,0.000103637,0.0001100258,0.0002467715],"domain_scores_gemma":[0.997329,0.00130062,0.0003544288,0.0004494004,0.0002007781,0.0003657891],"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.0009615131,0.00004547885,0.001483729,0.00006794473,0.00001762114,0.0002481331,0.0004515254,0.002880643,0.01592239,0.9644672,0.0009427827,0.01251097],"study_design_scores_gemma":[0.0003007288,0.0003455529,0.002304296,0.00007018894,0.00005319469,0.000699018,0.001140768,0.0339113,0.03221327,0.9194718,0.00938133,0.0001085214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8786302,0.0002441768,0.0790184,0.00095084,0.0001342949,0.00007111151,0.0001570957,0.0002321798,0.04056167],"genre_scores_gemma":[0.9710361,0.0000667352,0.02057996,0.0001194326,0.00002384606,0.00004012489,0.00006284947,0.00002820023,0.00804262],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007543553,"threshold_uncertainty_score":0.02523571,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}