{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006021254,0.000298266,0.000322198,0.0003809034,0.0006083882,0.0003315289,0.0009891054,0.00007515667,0.00003673139],"category_scores_gemma":[0.00001071246,0.0002032301,0.0003819042,0.002093245,0.0007393414,0.0003043691,0.00009236912,0.0002185965,0.00001127114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003683677,"about_ca_system_score_gemma":0.00003308125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006571151,"about_ca_topic_score_gemma":0.00002681689,"domain_scores_codex":[0.997804,0.0002198909,0.0004802786,0.0005049793,0.000419497,0.0005713096],"domain_scores_gemma":[0.9982553,0.0004647254,0.000145731,0.0008194829,0.0001189554,0.0001958277],"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.0001041677,0.0002548586,0.007782164,0.00006424931,0.0003490626,0.00002207487,0.00150921,0.0001952336,0.001812335,0.2916914,0.0009121015,0.6953031],"study_design_scores_gemma":[0.002363901,0.001675181,0.1076018,0.0002193906,0.0001838841,0.0001251491,0.0003146019,0.01184244,0.009489758,0.7794228,0.08497875,0.001782439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4611519,0.01873948,0.5132601,0.0006335622,0.0003031685,0.0007051441,0.00002772202,0.000337496,0.004841458],"genre_scores_gemma":[0.9502386,0.01152114,0.03786011,0.0002136602,0.00003998049,0.00005041094,0.000003133445,0.00002420926,0.00004870294],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6935207,"threshold_uncertainty_score":0.8287482,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005020868,0.0001992012,0.0001714321,0.0001654796,0.0002925611,0.000232502,0.0004536603,0.00005982407,0.00002779887],"category_scores_gemma":[0.00003073716,0.0001744517,0.00009328618,0.0004799923,0.0001074511,0.0002197518,0.00004127502,0.00007283367,0.000006341242],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001373874,"about_ca_system_score_gemma":0.0000405678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001628953,"about_ca_topic_score_gemma":0.000001177038,"domain_scores_codex":[0.9984082,0.0001435048,0.0002930916,0.0005565315,0.0002338153,0.0003648362],"domain_scores_gemma":[0.9988048,0.00007664044,0.0001344038,0.0006312128,0.0001597892,0.0001931646],"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.00002369808,0.000456661,0.0003493327,0.0000568551,0.0000178022,0.000001004035,0.0007231063,0.00009993488,0.002517817,0.9910707,0.00004580934,0.004637304],"study_design_scores_gemma":[0.004344776,0.001468732,0.001564155,0.00008572014,0.00002976212,0.000016083,0.0001741152,0.1729007,0.04179049,0.7316949,0.04501307,0.0009175079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"protocol","genre_scores_codex":[0.0005156097,0.000006185318,0.8322465,0.00005301983,0.0000286041,0.1667188,0.000004843582,0.0001356936,0.0002907512],"genre_scores_gemma":[0.1576255,4.496593e-7,0.3097865,0.0001231245,0.00001031419,0.5324299,0.000002779424,0.00001207787,0.000009271094],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.52246,"threshold_uncertainty_score":0.7113934,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001007178,0.0005332503,0.0004982657,0.0008205713,0.0005025407,0.0008634519,0.001014659,0.0002407293,0.00002261891],"category_scores_gemma":[0.00005573922,0.0004838805,0.000426205,0.003015155,0.0004164125,0.001665385,0.0002442948,0.0003452667,0.00007138483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002753652,"about_ca_system_score_gemma":0.0001128619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006147417,"about_ca_topic_score_gemma":0.000008865544,"domain_scores_codex":[0.996617,0.0002264938,0.0007302206,0.000731857,0.00085013,0.000844254],"domain_scores_gemma":[0.9973896,0.0001357883,0.0003068904,0.0009077999,0.0004390738,0.0008208374],"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.0000465548,0.0001455626,0.004170459,0.00002977903,0.00008152665,0.00001214514,0.001083223,0.0000198178,0.0002249414,0.9698777,0.01751938,0.006788966],"study_design_scores_gemma":[0.003155467,0.001451605,0.01262095,0.00009279861,0.0001048407,0.0001616139,0.001926865,0.07148527,0.001276598,0.7092575,0.1964945,0.001971899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05236702,0.001806634,0.9394557,0.0007777028,0.0006611875,0.0004065066,0.00007424585,0.0007314092,0.003719528],"genre_scores_gemma":[0.9695209,0.0005682413,0.02830597,0.001190123,0.0001089737,0.00009499429,0.0001731795,0.00003191652,0.000005754666],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9171538,"threshold_uncertainty_score":0.9997613,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001625452,0.0001143252,0.0001508229,0.0002406167,0.0001483092,0.00004202822,0.000113841,0.0000656997,0.000004864921],"category_scores_gemma":[0.000008007473,0.0001181867,0.00007288098,0.0003476177,0.0001529178,0.0001021281,0.000009542111,0.00008652829,0.000001559895],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001305834,"about_ca_system_score_gemma":0.000009127113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002238932,"about_ca_topic_score_gemma":0.0001519005,"domain_scores_codex":[0.9994376,0.00003122337,0.0002070501,0.0001149049,0.0000491584,0.0001600418],"domain_scores_gemma":[0.999565,0.0000974201,0.00002426293,0.000226561,0.00003673497,0.00005000028],"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.00002601522,0.00008370254,0.004092077,0.0001206094,0.00009324885,0.000001560312,0.001714282,0.007885891,0.01299561,0.9678135,0.00009100553,0.005082492],"study_design_scores_gemma":[0.007300362,0.0005379173,0.02011678,0.0005491134,0.0002183572,0.0001713017,0.01304534,0.02964278,0.008636417,0.8955593,0.02257717,0.001645201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5533248,0.002743595,0.4398288,0.0001622524,0.0002062707,0.0006558743,0.0001266305,0.0002889772,0.002662799],"genre_scores_gemma":[0.9799125,0.0003879725,0.01943584,0.00002549411,0.00001741118,0.0001526149,0.00004971287,0.00001634704,0.000002167698],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4265876,"threshold_uncertainty_score":0.4819514,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001924593,0.0003927285,0.0005376563,0.0006027878,0.0001428066,0.00008561933,0.0002057436,0.0001703624,0.0002489176],"category_scores_gemma":[0.000003849217,0.0003336028,0.0002067277,0.001289658,0.0004018259,0.0002224539,0.00002008164,0.0002034622,0.000004179958],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005594626,"about_ca_system_score_gemma":0.000005081421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000354244,"about_ca_topic_score_gemma":0.000007012579,"domain_scores_codex":[0.9984323,0.0000671717,0.0004503451,0.0003530064,0.0002620647,0.0004351317],"domain_scores_gemma":[0.9992217,0.00008892574,0.00007784411,0.0003362006,0.0001027337,0.0001725914],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0006740026,0.0007608476,0.220616,0.002146941,0.003824092,0.0001079685,0.003923694,0.001537894,0.3376184,0.3364967,0.001958239,0.09033525],"study_design_scores_gemma":[0.01648648,0.005853328,0.2506778,0.004348962,0.001799467,0.001150166,0.01271191,0.03995575,0.5392815,0.09436478,0.0213511,0.01201874],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9522416,0.002971156,0.03765225,0.000008819899,0.0001710021,0.0003333291,0.00006579248,0.0003267962,0.006229265],"genre_scores_gemma":[0.9953853,0.0003918469,0.004032367,0.0000206697,0.00005723766,0.00004090739,0.000006420953,0.0000576794,0.000007510564],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2421319,"threshold_uncertainty_score":0.9999116,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009912614,0.0002151986,0.000236708,0.0001595116,0.000554854,0.0006514158,0.0007901505,0.00008069965,0.0000027193],"category_scores_gemma":[0.00006014263,0.0001492858,0.0001746305,0.0009808275,0.0002910957,0.0005658966,0.000254474,0.0002110351,0.000008458135],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001422918,"about_ca_system_score_gemma":0.00006238616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000406169,"about_ca_topic_score_gemma":0.0000399202,"domain_scores_codex":[0.9982864,0.0001504687,0.000236403,0.0004893763,0.0004171772,0.0004202296],"domain_scores_gemma":[0.9985211,0.0001630098,0.00009861749,0.0007406327,0.0001866039,0.0002900166],"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.0001337579,0.00007237473,0.00537072,0.000004830803,0.00006063741,0.00000645725,0.001155125,0.00004891146,0.00007495326,0.980917,0.007185577,0.004969632],"study_design_scores_gemma":[0.003166131,0.000378205,0.003153753,0.00002103798,0.00004119822,0.00002258737,0.0006150547,0.08152799,0.0003042356,0.8893698,0.02086255,0.0005374431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01184228,0.001980803,0.9820265,0.0004455466,0.0001975475,0.0002877105,0.00003011817,0.0002311351,0.00295841],"genre_scores_gemma":[0.9114725,0.0007729079,0.08733583,0.0002659937,0.00006644268,0.00005485518,0.000008246683,0.00001534279,0.000007892285],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8996302,"threshold_uncertainty_score":0.6281618,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003552624,0.0002011676,0.0002776796,0.000171522,0.0001830296,0.0001176931,0.00008381315,0.00009861053,0.0001127929],"category_scores_gemma":[0.0001095034,0.0001555086,0.00007316993,0.0002595562,0.0001242819,0.0001660133,0.00001513072,0.0001225301,0.000004714202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005766366,"about_ca_system_score_gemma":0.00001035217,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005035186,"about_ca_topic_score_gemma":0.000005797826,"domain_scores_codex":[0.9989908,0.00008839185,0.0002934983,0.0002344401,0.0001800224,0.0002128057],"domain_scores_gemma":[0.9992063,0.0003112498,0.00008064727,0.0001850662,0.00007589575,0.0001408355],"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.00002164836,0.0001279171,0.0001543759,0.00006858892,0.00002565401,0.000002444128,0.000569651,1.607682e-7,0.002180277,0.9842747,0.002464661,0.0101099],"study_design_scores_gemma":[0.0003340846,0.0003063105,0.0009697792,0.00007134994,0.0000565359,0.00002287933,0.0004734496,0.002163076,0.00185333,0.99259,0.0009216117,0.0002375884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3001154,0.0005732606,0.6813678,0.0009543611,0.00003472896,0.0005806802,0.00001680478,0.0002718373,0.01608518],"genre_scores_gemma":[0.7456157,0.000276055,0.2532174,0.0007030789,0.00004123919,0.00002344738,0.0000131853,0.00001722339,0.00009260513],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4455003,"threshold_uncertainty_score":0.6341458,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005969118,0.0002297946,0.0002360618,0.0003378674,0.0003009232,0.0004532333,0.0004980864,0.00008004879,0.000003168275],"category_scores_gemma":[0.0000200603,0.000196212,0.0001009262,0.0008869668,0.0001189136,0.00025555,0.0002619829,0.0002499541,0.000005728604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000150844,"about_ca_system_score_gemma":0.0000696202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007974431,"about_ca_topic_score_gemma":0.000003642833,"domain_scores_codex":[0.9982642,0.000154004,0.0002203624,0.0004963541,0.0003680023,0.0004970859],"domain_scores_gemma":[0.9989876,0.0001595278,0.00006061802,0.0003777755,0.0001048152,0.0003096933],"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.000165014,0.0009662526,0.1440574,0.0003050066,0.0007453085,0.001074928,0.03888939,0.08090801,0.02174934,0.446144,0.002834509,0.2621608],"study_design_scores_gemma":[0.0003676402,0.0002619163,0.002802088,0.00006702178,0.00001892611,0.0001454853,0.0002613154,0.9867458,0.0006188018,0.00742247,0.0008903948,0.0003981167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4827043,0.0003371785,0.5163347,0.0001039925,0.0001861951,0.00008330737,0.00000235549,0.0001140292,0.0001339551],"genre_scores_gemma":[0.8581386,0.00001324439,0.1415388,0.0001659097,0.0001165352,0.000002875301,0.000001968091,0.00001675908,0.000005328783],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9058378,"threshold_uncertainty_score":0.8001291,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001513721,0.0001558138,0.000170667,0.0003216921,0.0001666671,0.0001239985,0.0001677383,0.00007087748,0.00001968019],"category_scores_gemma":[0.000005431686,0.0001419998,0.0001016135,0.0005829072,0.00006512239,0.0001799938,0.0000601198,0.00008983368,0.000001537804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003001073,"about_ca_system_score_gemma":0.00001565959,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004476254,"about_ca_topic_score_gemma":0.00001224018,"domain_scores_codex":[0.9990731,0.00005983956,0.0002204701,0.0003120321,0.0001531681,0.0001813587],"domain_scores_gemma":[0.9993596,0.0001356507,0.000100215,0.0002731849,0.00004243489,0.00008891318],"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.00008161564,0.0001995822,0.00934518,0.00004710413,0.00006529153,0.000004770346,0.0005418229,0.0001171215,0.02964312,0.8958929,0.001106973,0.06295449],"study_design_scores_gemma":[0.003899994,0.00463647,0.3494589,0.0005964128,0.0002718268,0.00005644789,0.0002754852,0.01719257,0.03798193,0.5290495,0.05443501,0.002145483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2051439,0.0001759365,0.7932315,0.0002265946,0.0001067872,0.0001267316,0.00001161307,0.0000733314,0.0009035194],"genre_scores_gemma":[0.9932684,0.0001480518,0.006211579,0.0002065185,0.00006265595,0.00001270604,0.00001718143,0.000007374335,0.00006554824],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7881244,"threshold_uncertainty_score":0.5790585,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002600872,0.0002001914,0.0001840057,0.0002469335,0.0002678932,0.0002992208,0.0005258409,0.00006947076,0.000281616],"category_scores_gemma":[0.000005063924,0.0001766225,0.0001650293,0.0008031546,0.0001223185,0.0004149747,0.00006701332,0.0001498573,0.00003326691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004495915,"about_ca_system_score_gemma":0.00001077431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001332111,"about_ca_topic_score_gemma":0.000001782398,"domain_scores_codex":[0.9987897,0.00007898933,0.000184145,0.0004232606,0.0001767568,0.0003472034],"domain_scores_gemma":[0.9992222,0.0001082097,0.00003536951,0.0004440435,0.00003214618,0.0001580298],"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.00002770695,0.00007416924,0.003482922,0.00001380664,0.00006036002,0.00001640893,0.001389281,0.00001592829,0.00138819,0.6202825,0.0004024746,0.3728463],"study_design_scores_gemma":[0.001694777,0.001063996,0.02634901,0.0001913234,0.00008304267,0.0001679737,0.0003266093,0.006484258,0.006831164,0.5462583,0.4083627,0.002186875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1886224,0.0009555735,0.7913679,0.0002761466,0.0001778774,0.0001577108,0.000004249341,0.0005248085,0.01791332],"genre_scores_gemma":[0.9765866,0.0003120143,0.02247962,0.0004666967,0.00005505383,0.00001945593,0.000001658413,0.00001166159,0.00006718997],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7879643,"threshold_uncertainty_score":0.7202455,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002357294,0.0001466186,0.0001313567,0.0002070565,0.00009522519,0.00003472356,0.00008645551,0.00004924528,0.0001433065],"category_scores_gemma":[0.000002431108,0.000147782,0.00007326595,0.0003001921,0.00008321253,0.00008562404,0.000009340293,0.0001108653,0.00001217217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001373169,"about_ca_system_score_gemma":0.000002942254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001679762,"about_ca_topic_score_gemma":0.00001735848,"domain_scores_codex":[0.9992332,0.00001478054,0.0001900194,0.0001484031,0.0001213783,0.0002921646],"domain_scores_gemma":[0.9996343,0.00005685313,0.00001889994,0.0001484043,0.00001945136,0.0001221501],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001351553,0.000240509,0.10365,0.0004008054,0.001134489,0.00008050491,0.003689554,0.002665538,0.6137663,0.03225132,0.1333323,0.1086536],"study_design_scores_gemma":[0.00274265,0.0004854442,0.1138414,0.0001511103,0.0002107653,0.000198048,0.005565489,0.001950426,0.1818417,0.02204612,0.668553,0.002413792],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3598733,0.001739393,0.6150726,0.00005909848,0.0006248323,0.0002317921,0.00002735319,0.0006670782,0.02170457],"genre_scores_gemma":[0.9781791,0.0001493925,0.02137534,0.0001011319,0.000127901,0.00001045896,0.0000154831,0.00002719847,0.00001398973],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6183058,"threshold_uncertainty_score":0.6026375,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002206359,0.0001545316,0.0002840036,0.0004290162,0.0002343206,0.00009990855,0.0006900005,0.00006976848,0.0001074463],"category_scores_gemma":[0.000005351608,0.0001004922,0.0005162055,0.004696368,0.0002831941,0.0001369783,0.00008273555,0.0001075612,0.000002811581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003116146,"about_ca_system_score_gemma":0.00001790426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008858378,"about_ca_topic_score_gemma":0.00005077577,"domain_scores_codex":[0.9987561,0.0001259583,0.0002502525,0.0003403963,0.0002720734,0.0002552564],"domain_scores_gemma":[0.9989992,0.0001090778,0.00007731236,0.0006697868,0.00005300093,0.00009167018],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0000714583,0.0006750011,0.2351714,0.00008601299,0.005016072,0.00002646875,0.004355509,0.004911673,0.003563214,0.3545502,0.002127612,0.3894454],"study_design_scores_gemma":[0.0009009444,0.0002891534,0.8869902,0.00006368266,0.00172941,0.0000243845,0.0001626337,0.07780282,0.00313729,0.009822682,0.01829905,0.0007776933],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7532316,0.001853604,0.2397522,0.0004667098,0.0001118168,0.0002405662,0.0000206006,0.0001041273,0.004218783],"genre_scores_gemma":[0.992092,0.0003761601,0.007204591,0.0002579044,0.00001307971,0.00000966304,0.000001829996,0.000005706401,0.00003903919],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6518189,"threshold_uncertainty_score":0.4097953,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006062201,0.0001559665,0.0001783153,0.0002323578,0.0001305401,0.0001456967,0.0002711455,0.00007529712,0.00001527297],"category_scores_gemma":[0.00003038268,0.0001517759,0.00003749629,0.000559428,0.0001273543,0.0009144022,0.0001512074,0.0001214721,0.000006081834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001380702,"about_ca_system_score_gemma":0.00001550198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000100402,"about_ca_topic_score_gemma":0.00001198807,"domain_scores_codex":[0.998709,0.0001461324,0.0002433734,0.0003480402,0.0001947614,0.0003587419],"domain_scores_gemma":[0.9991726,0.00008925844,0.0001129214,0.000403452,0.00005297794,0.0001687625],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00001977241,0.0004118781,0.07285491,0.0001428704,0.0000131242,0.000001103868,0.004769144,5.878655e-7,0.004202717,0.882553,0.00002311925,0.0350078],"study_design_scores_gemma":[0.001653847,0.0002632598,0.498381,0.000201337,0.00001815086,0.00001819624,0.0001416963,0.00453575,0.007656699,0.4798298,0.006593595,0.0007065788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02452519,0.0002796438,0.9556713,0.0002479102,0.00003070496,0.0187391,0.00000433575,0.0001151749,0.0003866482],"genre_scores_gemma":[0.8595435,0.00004086003,0.1152305,0.0001307318,0.00003137104,0.02500148,0.000002669861,0.00001001603,0.000008850618],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8404408,"threshold_uncertainty_score":0.6189242,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000515608,0.0002533975,0.00028631,0.0001613975,0.0003047129,0.0002675242,0.0004485107,0.0002021111,0.000001453919],"category_scores_gemma":[0.00003716624,0.0002456433,0.0001452374,0.0007949653,0.00008718552,0.0003540257,0.0001349368,0.0001713236,0.000002040292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002123947,"about_ca_system_score_gemma":0.00001547183,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008868703,"about_ca_topic_score_gemma":5.602922e-7,"domain_scores_codex":[0.9982263,0.000113711,0.0002590535,0.0004391322,0.0002366941,0.0007251454],"domain_scores_gemma":[0.9987156,0.0002445045,0.00009179457,0.0004467824,0.000145321,0.0003559808],"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.00008540712,0.0002958961,0.002260426,0.00003472916,0.0000775581,6.305958e-7,0.0007972141,0.0007108789,0.0003761358,0.9869466,0.003219437,0.00519503],"study_design_scores_gemma":[0.005013137,0.001234568,0.007712621,0.0001368046,0.0002126572,0.00008579901,0.0006949537,0.8152102,0.003920468,0.03558283,0.1276609,0.002535084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02604936,0.0007041206,0.970721,0.000107182,0.0009333685,0.0007535044,0.00002050399,0.0002391558,0.000471796],"genre_scores_gemma":[0.8275588,0.0000457118,0.1714462,0.0001969678,0.000548792,0.0001386097,0.0000447943,0.00001690199,0.000003243044],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9513638,"threshold_uncertainty_score":0.9999996,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003597961,0.0003229531,0.0003377491,0.0004352179,0.0003868556,0.0005091057,0.0008041302,0.0001098325,0.00001103451],"category_scores_gemma":[0.00001485046,0.0002955067,0.0001994469,0.001257267,0.0001485105,0.0005778292,0.0001055265,0.000316153,0.000004782036],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007426365,"about_ca_system_score_gemma":0.00003189788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002037693,"about_ca_topic_score_gemma":0.00001781472,"domain_scores_codex":[0.9981247,0.0001042618,0.0002771987,0.0006590851,0.0003244176,0.0005103333],"domain_scores_gemma":[0.9987322,0.0001148837,0.0001229091,0.0006978897,0.00008408148,0.0002480407],"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.00006679396,0.0003348984,0.01748914,0.00004082251,0.00006732478,0.00005747829,0.0003293023,0.0001637506,0.007808615,0.9263104,0.001766701,0.0455648],"study_design_scores_gemma":[0.008410275,0.002569477,0.1036272,0.000678044,0.000195352,0.0001048617,0.0001873783,0.226166,0.04013416,0.5476777,0.06620838,0.004041175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09319313,0.003031567,0.9015526,0.0004728409,0.0001128285,0.0002111697,0.00001197613,0.0005088381,0.0009051034],"genre_scores_gemma":[0.8751181,0.00009662929,0.1235409,0.001151559,0.00005295729,0.000009844878,0.00002038065,0.000008895392,7.268578e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7819249,"threshold_uncertainty_score":0.9999497,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004372962,0.0002550574,0.0002099578,0.0002817868,0.0004592251,0.0006854261,0.0008981423,0.00008750314,0.0001410859],"category_scores_gemma":[0.00001960744,0.0001684527,0.0002391103,0.001135534,0.0003561104,0.0005067404,0.0002056578,0.0002351155,0.00004511526],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006175336,"about_ca_system_score_gemma":0.00001758794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008690308,"about_ca_topic_score_gemma":0.000008604629,"domain_scores_codex":[0.9984038,0.0002016731,0.0002395681,0.0004551745,0.0002607995,0.0004389402],"domain_scores_gemma":[0.9985997,0.0003376523,0.0000897203,0.0007259489,0.00007930183,0.000167648],"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.00001008749,0.00005330015,0.004489075,0.0000128664,0.0000873571,0.000005775255,0.0008526506,0.000006086662,0.002507234,0.9101003,0.006251228,0.07562397],"study_design_scores_gemma":[0.00118065,0.0006492014,0.07652598,0.0001062875,0.00008042141,0.00008654466,0.001151365,0.01185288,0.002736765,0.8546193,0.04969428,0.001316344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3294492,0.001240458,0.6590968,0.001576453,0.0003975846,0.0005447243,0.00000447341,0.0004003311,0.007290022],"genre_scores_gemma":[0.9864939,0.0001425884,0.01156048,0.001617511,0.00006542625,0.00007544414,0.000001571487,0.00001451302,0.00002857929],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6570447,"threshold_uncertainty_score":0.6869302,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002981823,0.0001718945,0.0001820543,0.0001030459,0.0004953066,0.0000910325,0.0005067416,0.00009132668,0.000023456],"category_scores_gemma":[0.00002086232,0.0001023414,0.0001223095,0.0005523274,0.0007901505,0.0001341285,0.0001583395,0.0002926507,0.000004569566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000676062,"about_ca_system_score_gemma":0.000009721954,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003473424,"about_ca_topic_score_gemma":0.00001391432,"domain_scores_codex":[0.9987882,0.0002180425,0.0002131758,0.0003213309,0.0002228406,0.0002364299],"domain_scores_gemma":[0.9987365,0.0003862347,0.0001309672,0.0006300395,0.00004963251,0.00006662607],"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.00002388731,0.0001006103,0.002984616,0.00001004641,0.00007445517,0.000001994337,0.001804762,0.00009828372,0.0002434494,0.9910134,0.001853078,0.001791437],"study_design_scores_gemma":[0.001593264,0.001520012,0.1782828,0.0005657751,0.0001414087,0.00006716447,0.001169683,0.07283217,0.004841279,0.7362332,0.001718673,0.001034479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9624659,0.000401425,0.03052882,0.001315866,0.0004078872,0.0004032957,0.0000115697,0.0001197438,0.004345438],"genre_scores_gemma":[0.9977066,0.00008339289,0.001565318,0.0005889087,0.00002173038,0.00001070801,8.554434e-7,0.00001010363,0.00001240096],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2547801,"threshold_uncertainty_score":0.4173363,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005199988,0.00009670999,0.0001398107,0.0001264392,0.0001200217,0.0001606413,0.0003697535,0.00003909826,0.000001716999],"category_scores_gemma":[0.00002277211,0.00006697366,0.00006592239,0.0004649375,0.0001052852,0.0002672732,0.00007537359,0.00006519103,0.000002685095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004452161,"about_ca_system_score_gemma":0.00002540128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000870002,"about_ca_topic_score_gemma":0.00005327909,"domain_scores_codex":[0.9990619,0.0001527138,0.0002229684,0.0001765204,0.0002399629,0.0001459351],"domain_scores_gemma":[0.9992391,0.00008748502,0.0001147219,0.0003594533,0.0001166635,0.0000825406],"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.00001170309,0.00009460899,0.02805729,0.00004976617,0.00004251346,0.000001615243,0.11074,0.000003085663,0.002539447,0.8538178,0.001124841,0.003517351],"study_design_scores_gemma":[0.004292992,0.001646633,0.06476484,0.0003659181,0.0001879132,0.000142637,0.05202861,0.2949539,0.03484748,0.4240333,0.1205396,0.002196187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4843746,0.001467788,0.5113481,0.001120503,0.0002327554,0.0003026866,0.000006929213,0.0001172427,0.001029417],"genre_scores_gemma":[0.9977296,0.00007063663,0.001960569,0.0001878957,0.00002630824,0.00001361384,0.000002153188,0.000004229827,0.00000501505],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.513355,"threshold_uncertainty_score":0.2731107,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001714934,0.0001367612,0.0001827074,0.0002219972,0.0002745464,0.000153165,0.0003447997,0.00003808047,0.00005779343],"category_scores_gemma":[0.000001917235,0.0001151946,0.00006960146,0.0004706958,0.0003565883,0.0003177392,0.0001531605,0.00007234304,0.000002463295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001990291,"about_ca_system_score_gemma":0.00001012488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008520675,"about_ca_topic_score_gemma":0.000003536189,"domain_scores_codex":[0.9990792,0.00008440187,0.0002107109,0.0003007006,0.0001412006,0.0001838038],"domain_scores_gemma":[0.9993241,0.000112435,0.0000918009,0.0002966436,0.00006404681,0.0001109296],"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.000009087727,0.0001033035,0.03183376,0.0000832663,0.00006298897,0.000001099527,0.0008515932,0.000005767351,0.01763921,0.828146,0.0005211956,0.1207427],"study_design_scores_gemma":[0.001209388,0.0008491831,0.07963619,0.0001775066,0.00007746648,0.00005714026,0.001637756,0.008122165,0.006014009,0.8833967,0.01792773,0.0008946985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2038655,0.001993569,0.7921452,0.0002485813,0.00003741042,0.0004804617,0.00001127669,0.0001083453,0.001109689],"genre_scores_gemma":[0.9543639,0.0002986823,0.04503243,0.0001637568,0.00001770281,0.0001107781,0.00000532847,0.000004905283,0.000002539895],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7504984,"threshold_uncertainty_score":0.46975,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002177263,0.0003796396,0.000419566,0.0002266235,0.0004944735,0.0001909759,0.0001880315,0.0001374162,0.0001486892],"category_scores_gemma":[0.0001396096,0.0002935259,0.00009389291,0.0005921655,0.0002588309,0.0002119066,0.00006578433,0.0002358573,0.00001071262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008937104,"about_ca_system_score_gemma":0.000004180695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005916266,"about_ca_topic_score_gemma":0.0000249319,"domain_scores_codex":[0.9983591,0.00007494741,0.0002665241,0.0005191503,0.0003082484,0.0004719852],"domain_scores_gemma":[0.998094,0.0009670072,0.0001591739,0.0004843055,0.00006927296,0.000226222],"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.0005305236,0.001004801,0.02593494,0.0004288077,0.0005414247,0.0001742954,0.000851309,0.00002239651,0.004903888,0.9441678,0.006061862,0.01537793],"study_design_scores_gemma":[0.003627762,0.004139528,0.01526895,0.0003430866,0.0003386719,0.0001667346,0.0005306258,0.0008486742,0.0009075283,0.9705412,0.001894284,0.001392905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9314045,0.001024896,0.06377024,0.0001616425,0.00008435946,0.0005103521,0.00001654616,0.000199375,0.002828079],"genre_scores_gemma":[0.9452842,0.000558921,0.05356231,0.0003369285,0.00006424494,0.0000278405,0.000002209423,0.00005770763,0.0001056404],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02637343,"threshold_uncertainty_score":0.9999517,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002281067,0.0002259312,0.0002810618,0.0005489844,0.000370141,0.0001446205,0.000484097,0.00008569346,0.00002867328],"category_scores_gemma":[0.00002749229,0.0002000974,0.0002382373,0.0008454056,0.0004007371,0.0002232002,0.00009032301,0.0001478827,0.000004629886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004817429,"about_ca_system_score_gemma":0.00002280538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001012294,"about_ca_topic_score_gemma":0.000006305783,"domain_scores_codex":[0.9986306,0.0001278381,0.0003067148,0.0003948069,0.0002582774,0.0002817083],"domain_scores_gemma":[0.9987497,0.0002948807,0.0001455951,0.0005493526,0.0001130378,0.0001474038],"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.00001858282,0.0001110088,0.001544452,0.00002492077,0.00005870753,0.000001178369,0.0006689348,0.00004471576,0.002948781,0.9706953,0.0001162456,0.02376722],"study_design_scores_gemma":[0.002073145,0.00199791,0.05238198,0.0002366445,0.0001890259,0.00009782224,0.001037599,0.01959573,0.0097317,0.9046546,0.006768982,0.001234821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2251569,0.00006463238,0.7699369,0.000214729,0.0001672195,0.0001459834,0.00001761052,0.0001665626,0.004129473],"genre_scores_gemma":[0.9656124,0.00005501386,0.03403173,0.0002067268,0.00003953243,0.00002568488,0.000007941887,0.00001200482,0.000009022745],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7404554,"threshold_uncertainty_score":0.8159735,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003679633,0.0001962234,0.0003135652,0.0002521584,0.0007311159,0.0002207285,0.001165751,0.00009831254,0.00006171289],"category_scores_gemma":[0.00004349392,0.0001438191,0.0003534046,0.0003273023,0.0006011344,0.000566416,0.0002513955,0.0001224581,9.784874e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005999409,"about_ca_system_score_gemma":0.0000891094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001229143,"about_ca_topic_score_gemma":0.00003998981,"domain_scores_codex":[0.9986837,0.00009437839,0.0003851645,0.0003208382,0.0002743661,0.000241572],"domain_scores_gemma":[0.9979881,0.0001458475,0.0005321187,0.001112635,0.0001099984,0.0001112753],"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.00003315802,0.00005388296,0.02238381,0.00004225664,0.0001122347,0.000001160049,0.001197507,0.000005974136,0.01665307,0.9354339,0.0007693161,0.02331371],"study_design_scores_gemma":[0.001539738,0.0003508674,0.2469363,0.0002362941,0.0001717461,0.00007024885,0.0002928054,0.0009615742,0.06461336,0.6807802,0.003491429,0.0005553958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.519299,0.0003861006,0.4744396,0.0004259022,0.0005651183,0.0003684941,0.00003621454,0.00007565685,0.004403853],"genre_scores_gemma":[0.9749569,0.00008956735,0.02480074,0.0000619555,0.00004693932,0.000006128568,0.000001267866,0.000009646439,0.00002687253],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4556578,"threshold_uncertainty_score":0.5864773,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001257111,0.0001876194,0.0002045512,0.0002584234,0.00017358,0.00004196079,0.0001209906,0.00007864121,0.00005510509],"category_scores_gemma":[0.00000477679,0.0001704139,0.00008211546,0.0007919489,0.00005962786,0.0001033095,0.00001451806,0.00008843743,0.00003859337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004638255,"about_ca_system_score_gemma":0.000004486686,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001529611,"about_ca_topic_score_gemma":0.000007688201,"domain_scores_codex":[0.9991879,0.00003738331,0.0001767856,0.0001912275,0.0001282902,0.0002784503],"domain_scores_gemma":[0.9995556,0.00004316168,0.00001837768,0.0001870428,0.00003806787,0.0001577876],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0006538176,0.0004478663,0.1748686,0.002186028,0.002344048,0.0004838446,0.03946728,0.01991264,0.1814966,0.3348588,0.1786501,0.06463046],"study_design_scores_gemma":[0.00581209,0.002042253,0.1071921,0.0009028823,0.0004484999,0.001122863,0.00755917,0.01131243,0.03907305,0.04950331,0.7678251,0.007206243],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9231137,0.002683175,0.06893977,0.00002289504,0.0003993158,0.0002394516,0.00001611291,0.0003995588,0.004186012],"genre_scores_gemma":[0.996064,0.0008262701,0.002792965,0.00008924081,0.00007126054,0.00004395957,0.000004481099,0.00003037052,0.00007744523],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5891751,"threshold_uncertainty_score":0.6949276,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007285583,0.0001559393,0.0001695508,0.000144509,0.0002273813,0.00008854033,0.00004849233,0.00006581727,0.00006753335],"category_scores_gemma":[0.000003272256,0.0001497849,0.00008717109,0.0001427733,0.0001493853,0.0001294108,0.000008660815,0.00008626101,0.00000223087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007321083,"about_ca_system_score_gemma":0.000002362473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002412162,"about_ca_topic_score_gemma":0.000007004144,"domain_scores_codex":[0.9994345,0.00002039592,0.0001476733,0.000158846,0.00006629718,0.0001723011],"domain_scores_gemma":[0.9996316,0.0001171183,0.00002797444,0.00009828835,0.00004095422,0.00008405271],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001266971,0.0002707868,0.01495438,0.0008336852,0.002292886,0.0000157694,0.005216823,0.0004563098,0.02284593,0.8969233,0.03412928,0.02193416],"study_design_scores_gemma":[0.01020278,0.001967703,0.01478883,0.0009072952,0.0009017036,0.0007540009,0.01522786,0.1047978,0.01762503,0.3779374,0.4511643,0.003725325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7793036,0.004471489,0.2026759,0.0001287085,0.0006288947,0.0009930076,0.0005078057,0.0003326214,0.01095801],"genre_scores_gemma":[0.99518,0.0002356164,0.004262306,0.00005002815,0.00005380824,0.0001564419,0.00002268932,0.00001764869,0.00002147586],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5189859,"threshold_uncertainty_score":0.610805,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002896242,0.0001116801,0.0001687758,0.0001750692,0.000163661,0.0001473767,0.0004588943,0.00004712426,0.000006918296],"category_scores_gemma":[0.000008967069,0.0001001455,0.00006027964,0.0005703695,0.00009327677,0.0004373104,0.00005362618,0.0000975032,9.849957e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005476637,"about_ca_system_score_gemma":0.00001047312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003989549,"about_ca_topic_score_gemma":0.00001317322,"domain_scores_codex":[0.9991168,0.0001717654,0.0001972944,0.0002294341,0.0001301324,0.0001545725],"domain_scores_gemma":[0.9992337,0.00005693727,0.00006626891,0.0004496277,0.00009485777,0.00009859063],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00001528541,0.0001783854,0.002107041,0.000004132735,0.00001189889,0.000001458296,0.0005491989,0.00001418382,0.04765539,0.7056717,0.0002195544,0.2435717],"study_design_scores_gemma":[0.002735127,0.006092684,0.559489,0.0002784884,0.00007975165,0.00006516257,0.0004670891,0.2139861,0.01871804,0.1823055,0.01412497,0.00165813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1291885,0.001032271,0.8686641,0.0002464507,0.00003780437,0.000100234,0.000001219089,0.00009593934,0.0006334466],"genre_scores_gemma":[0.9249344,0.001356235,0.07331816,0.0003524238,0.00002338424,0.00000477883,0.000005151332,0.000003205685,0.000002237739],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7957459,"threshold_uncertainty_score":0.4083816,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004503891,0.0002001048,0.0003082629,0.0004678854,0.0001705543,0.00008135435,0.0004327892,0.00009435214,0.00004081996],"category_scores_gemma":[0.000008647067,0.0001870618,0.0001729035,0.001001815,0.0002062776,0.0005290481,0.00006697851,0.00010696,0.000001721503],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003547026,"about_ca_system_score_gemma":0.00001212759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001270198,"about_ca_topic_score_gemma":0.000002764087,"domain_scores_codex":[0.9985131,0.0002362169,0.0003598812,0.0003776596,0.0002665259,0.0002466119],"domain_scores_gemma":[0.9988738,0.000160416,0.0001847989,0.0005390785,0.000123775,0.0001181772],"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.0000689355,0.001265454,0.01167357,0.0001512761,0.0002403677,0.00001315095,0.007001068,0.0002265639,0.07594994,0.8573336,0.0005331425,0.04554292],"study_design_scores_gemma":[0.006103732,0.01745061,0.05918009,0.0005728722,0.0006525005,0.000200569,0.002628825,0.499663,0.1537701,0.2465413,0.009468908,0.003767504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7412477,0.001464952,0.2555868,0.00006979884,0.00008676817,0.0002053423,0.0000203929,0.000222908,0.001095308],"genre_scores_gemma":[0.9454053,0.0004474303,0.05402625,0.00006194126,0.00002960645,0.00001180486,0.000004634956,0.00001037012,0.000002667384],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6107923,"threshold_uncertainty_score":0.7628158,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005505786,0.0004281891,0.0004867327,0.0002698873,0.0005156757,0.00051868,0.0009331618,0.0001578278,0.00001260489],"category_scores_gemma":[0.00002451411,0.0003603949,0.0002434197,0.0005757748,0.0001923232,0.0002600443,0.0003024981,0.0003635734,0.00002338716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008227204,"about_ca_system_score_gemma":0.00004244239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003260899,"about_ca_topic_score_gemma":0.00002042247,"domain_scores_codex":[0.9973116,0.000327174,0.0004126412,0.0008873508,0.0004551968,0.000606064],"domain_scores_gemma":[0.9981889,0.0005306607,0.0001753109,0.0006879505,0.000106218,0.0003110181],"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.0002446208,0.001472208,0.1056344,0.0002719635,0.001348538,0.0002876397,0.01112582,0.009400642,0.01392198,0.5727382,0.004923086,0.2786309],"study_design_scores_gemma":[0.000589339,0.0004892094,0.01356797,0.00008036716,0.00003786317,0.00003764506,0.00004503622,0.9276363,0.000656308,0.04747957,0.008778688,0.0006016611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4197672,0.0005712667,0.5783913,0.0003308225,0.0002389681,0.0001108929,0.00002740921,0.0004383207,0.000123843],"genre_scores_gemma":[0.7645378,0.0001771905,0.2341641,0.0006958931,0.000346827,0.00001354266,0.00002955432,0.0000289756,0.000006151616],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9182357,"threshold_uncertainty_score":0.9998848,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005462706,0.0001816806,0.0001413559,0.0001765429,0.0005429547,0.0003161817,0.0005137922,0.00005102008,0.0002436704],"category_scores_gemma":[0.00001641517,0.0001263407,0.0001409695,0.0008158218,0.0001729466,0.000256975,0.00005495387,0.0001804668,0.00002656935],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006047305,"about_ca_system_score_gemma":0.00001026295,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001719811,"about_ca_topic_score_gemma":0.000004298003,"domain_scores_codex":[0.9987455,0.0002743405,0.000164374,0.0003213997,0.0002315017,0.0002628897],"domain_scores_gemma":[0.9986479,0.0007244865,0.00005564693,0.0004617845,0.00003221899,0.00007795777],"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.00003720126,0.00005354625,0.0002928979,0.000003736778,0.00003989694,0.000003512217,0.001956346,0.00007415006,0.0002306154,0.9480016,0.000332998,0.04897351],"study_design_scores_gemma":[0.0005851572,0.0005334045,0.007284577,0.0000833365,0.00002745231,0.00001143803,0.0001872337,0.02238561,0.0009397073,0.9601773,0.007342951,0.0004418096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4385988,0.0002826166,0.5428464,0.0006861995,0.00007062627,0.0002583548,0.000005381175,0.0002098224,0.01704183],"genre_scores_gemma":[0.9925063,0.0001101084,0.00587709,0.001408219,0.00002559697,0.00004080648,0.000001989459,0.000009262293,0.00002062666],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5539075,"threshold_uncertainty_score":0.5152022,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002344551,0.000265747,0.0002813471,0.0002419506,0.0003642233,0.0005391501,0.0005033989,0.0001169035,0.00005609288],"category_scores_gemma":[0.0000209686,0.0002392906,0.0002325729,0.0005186661,0.0002945097,0.0007574252,0.00009378785,0.0001366458,0.00001180118],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007950921,"about_ca_system_score_gemma":0.00002486122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001519306,"about_ca_topic_score_gemma":0.00001685611,"domain_scores_codex":[0.9984338,0.00009290402,0.0003001018,0.0005980372,0.0001891323,0.0003860289],"domain_scores_gemma":[0.9987423,0.0003751943,0.0001494392,0.0004691943,0.00009610576,0.0001677578],"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.00009733725,0.0001230474,0.01237348,0.00008235312,0.0002799154,0.000005750006,0.002089761,0.00005934945,0.01228142,0.8565537,0.001279375,0.1147746],"study_design_scores_gemma":[0.001404922,0.0006133608,0.007507736,0.000164168,0.00007921367,0.00002150119,0.0007260115,0.01533588,0.007345586,0.9547621,0.01106313,0.0009763864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1911334,0.0003401356,0.8067737,0.0003310124,0.0002691845,0.0003764808,0.00003013828,0.0002093443,0.0005366384],"genre_scores_gemma":[0.6998741,0.0001027176,0.2994552,0.0002835311,0.0001245368,0.0001265112,0.00001356153,0.00001384604,0.000005995327],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5087407,"threshold_uncertainty_score":0.9757988,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000210929,0.0001945275,0.0002929345,0.0004657368,0.00007165367,0.00005253214,0.0000898602,0.00009899618,0.0000470795],"category_scores_gemma":[0.000005788639,0.0001726851,0.000085946,0.0008687161,0.00008860108,0.0001428639,0.00001907073,0.00008289402,0.000001973965],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000436775,"about_ca_system_score_gemma":0.000003510087,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002581531,"about_ca_topic_score_gemma":0.00001386941,"domain_scores_codex":[0.9991338,0.00005472271,0.0002631126,0.0001835957,0.0001368951,0.0002278852],"domain_scores_gemma":[0.9995725,0.00008342205,0.00005037728,0.0001596793,0.00003574919,0.00009823377],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0003169406,0.0003326663,0.1263812,0.001821241,0.00169663,0.00002691634,0.002915567,0.004749096,0.09384753,0.6438969,0.01048165,0.1135337],"study_design_scores_gemma":[0.0191433,0.002109471,0.3431163,0.001127092,0.001822889,0.0004242124,0.002857839,0.1523835,0.05862374,0.1054016,0.3051081,0.007882065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.970544,0.01706043,0.01009074,0.00001646146,0.00009811921,0.0001695326,0.00002018029,0.0001243913,0.001876094],"genre_scores_gemma":[0.9930984,0.002268679,0.004464886,0.00005077713,0.0000573084,0.00001830888,0.000005198246,0.00002537846,0.00001099707],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5384952,"threshold_uncertainty_score":0.7041895,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002668629,0.000240936,0.0003026856,0.0004886814,0.0001433677,0.00006405533,0.0005843942,0.0001210525,0.0001073225],"category_scores_gemma":[0.00002345086,0.0002029474,0.0002627645,0.0006189609,0.000125264,0.0002269075,0.0001120807,0.0001401214,0.000003835435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003683909,"about_ca_system_score_gemma":0.00001555043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006989046,"about_ca_topic_score_gemma":0.000006529348,"domain_scores_codex":[0.9987,0.0001132322,0.0002922942,0.0004049953,0.0001875017,0.0003020093],"domain_scores_gemma":[0.9986948,0.0004258227,0.0001435598,0.0005631966,0.00003878943,0.0001338306],"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.0001050253,0.0001927397,0.01712359,0.00002340767,0.00009673216,0.000006558737,0.002696366,0.000007823553,0.002772094,0.9715102,0.0003449373,0.005120474],"study_design_scores_gemma":[0.001551417,0.002924852,0.1265503,0.0001935729,0.00009726097,0.000009717101,0.0003899671,0.001390964,0.07821022,0.7861072,0.001277425,0.001297115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6653218,0.0001508613,0.3305826,0.00001398279,0.0001437262,0.000138213,0.00001063521,0.0001067339,0.003531472],"genre_scores_gemma":[0.9926342,0.00008642154,0.006934172,0.0002892852,0.00001884335,0.00001582119,0.00000186695,0.00001229698,0.000007133117],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3273124,"threshold_uncertainty_score":0.8275955,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007037483,0.000297972,0.0002553151,0.0003716067,0.0003935625,0.0003648429,0.001032972,0.0001468261,0.00004971891],"category_scores_gemma":[0.00002451923,0.0002646014,0.0002282157,0.0009033534,0.0003173391,0.0005859804,0.0002093204,0.000429765,0.00002136185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004494603,"about_ca_system_score_gemma":0.000037131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004335661,"about_ca_topic_score_gemma":0.00002222825,"domain_scores_codex":[0.9981517,0.0001491013,0.0002714033,0.0006442697,0.0002934669,0.0004900778],"domain_scores_gemma":[0.9985243,0.0002252693,0.0001054717,0.0008039974,0.00007939905,0.0002615311],"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.0000291663,0.0001087301,0.02713331,0.00002494359,0.00007264136,0.00004774817,0.0007884362,0.000004147149,0.06730226,0.8420763,0.0006698222,0.0617425],"study_design_scores_gemma":[0.00173857,0.001340043,0.0361753,0.0001428703,0.0001095076,0.0004833961,0.0003745049,0.01610269,0.02441213,0.8505496,0.06601641,0.00255499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5246651,0.0003452514,0.4702605,0.000491769,0.0006302596,0.0002303508,0.00001217463,0.0005488007,0.002815775],"genre_scores_gemma":[0.9432515,0.0001286842,0.05601047,0.0004379544,0.00009452198,0.00003631633,0.000003941934,0.00001777382,0.00001884545],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4185864,"threshold_uncertainty_score":0.9999806,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001013418,0.0002470175,0.000310302,0.0006140399,0.0002429457,0.0001357014,0.0003815404,0.0001280145,0.00002651344],"category_scores_gemma":[0.0000139516,0.0002342079,0.000229337,0.001294397,0.0003611543,0.0003931804,0.0001309214,0.0001663641,0.000002295639],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009728177,"about_ca_system_score_gemma":0.00002596164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003658578,"about_ca_topic_score_gemma":0.00001329758,"domain_scores_codex":[0.9983084,0.00009294438,0.0003963553,0.0004590147,0.0003238854,0.000419366],"domain_scores_gemma":[0.998792,0.0002803789,0.0001923411,0.0004407581,0.0001222155,0.0001722955],"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.00007148412,0.0001377194,0.03554264,0.00005403287,0.0001387265,0.00001436023,0.001114284,0.000003251771,0.01150851,0.9235085,0.0001896626,0.0277168],"study_design_scores_gemma":[0.003932499,0.002329126,0.2150819,0.0003318667,0.0003426991,0.0004938577,0.001616309,0.00316035,0.1200316,0.6293696,0.020867,0.002443216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4582627,0.0003846084,0.5387403,0.00003061603,0.0001735753,0.0001234785,0.000006772873,0.0002405424,0.00203743],"genre_scores_gemma":[0.8608721,0.0001726863,0.1387538,0.000124666,0.00005264855,0.000006332988,0.000002488174,0.0000117945,0.000003398615],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4026095,"threshold_uncertainty_score":0.9550721,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001876523,0.000154485,0.0001439558,0.0000924764,0.0003396876,0.0001093114,0.0001287912,0.0000709345,0.000002256351],"category_scores_gemma":[0.000003946293,0.0001213802,0.00005806685,0.0003074845,0.0001034972,0.0000875285,0.00001996809,0.0001064131,0.00001227404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008985182,"about_ca_system_score_gemma":0.000006826114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000699028,"about_ca_topic_score_gemma":0.000008651508,"domain_scores_codex":[0.999285,0.00002866317,0.0001630951,0.0001733387,0.0001049125,0.0002449711],"domain_scores_gemma":[0.9995427,0.00008634727,0.00001809875,0.0001714114,0.00002775208,0.000153715],"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.00001762022,0.00001906198,0.00006428486,0.00003922073,0.00005587523,0.000001608938,0.0002838617,0.001318945,0.004648384,0.9894717,0.0001568222,0.003922558],"study_design_scores_gemma":[0.002076022,0.0003991029,0.001140449,0.0001125219,0.00009707698,0.00005107548,0.001629761,0.001299721,0.01595989,0.8628809,0.1134188,0.0009347469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3713419,0.01004106,0.6140764,0.0002945814,0.0007478606,0.001232962,0.0000412475,0.0004419243,0.001781985],"genre_scores_gemma":[0.998935,0.0004206399,0.0002471757,0.0000571849,0.0001216875,0.0001908128,0.000003013952,0.00002059294,0.000003895406],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6275931,"threshold_uncertainty_score":0.4949743,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003191418,0.0002863599,0.0002802729,0.0004025144,0.0003354246,0.0005032156,0.0007214269,0.0001196867,0.00003422234],"category_scores_gemma":[0.00001208696,0.0002609675,0.000214368,0.001156169,0.0001415885,0.0008507764,0.0001275541,0.0002048875,0.00001032279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006253274,"about_ca_system_score_gemma":0.00002059786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002708169,"about_ca_topic_score_gemma":0.000008443016,"domain_scores_codex":[0.9982038,0.00006572367,0.0002759438,0.0006321879,0.000326889,0.0004954864],"domain_scores_gemma":[0.9987866,0.00009146528,0.00009534963,0.0007095248,0.00005868623,0.0002584073],"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.00001764032,0.0001342795,0.003412565,0.00001144136,0.00002966568,0.00002324837,0.0005100351,0.000001590201,0.002015202,0.9513217,0.003764467,0.0387582],"study_design_scores_gemma":[0.001324471,0.0007429903,0.1238232,0.00005315695,0.00004989605,0.00008013084,0.00009822462,0.002903406,0.00212694,0.8131567,0.05458021,0.001060697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1108925,0.001993683,0.8793658,0.0005935184,0.000197488,0.000249926,0.00003331511,0.0004545682,0.006219144],"genre_scores_gemma":[0.8913442,0.0004926417,0.1057756,0.00225952,0.00008516992,0.0000120027,0.00001618422,0.00001059681,0.000004152124],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7804517,"threshold_uncertainty_score":0.9999843,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001997373,0.0002345177,0.0002363055,0.0002161852,0.0001635265,0.0001011905,0.0001276919,0.0001084297,0.00007516444],"category_scores_gemma":[0.000002879371,0.0002208346,0.0001384452,0.0004204193,0.0001007413,0.0001278001,0.00001279408,0.00011264,0.00001841448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000710378,"about_ca_system_score_gemma":0.000004717751,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005917369,"about_ca_topic_score_gemma":0.00003664678,"domain_scores_codex":[0.9989788,0.00006010712,0.0002423482,0.0002162382,0.0001296986,0.0003728145],"domain_scores_gemma":[0.9995442,0.00008323236,0.0000213451,0.0002252436,0.00002669971,0.00009925244],"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.00007382572,0.0002012604,0.06087684,0.000431915,0.000369193,0.00008063953,0.0008265515,0.004295865,0.1958338,0.6800117,0.04592615,0.01107221],"study_design_scores_gemma":[0.003810983,0.0007579947,0.0615053,0.0002403164,0.000390668,0.0002895652,0.002590451,0.01621201,0.078047,0.5889865,0.2429294,0.004239797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8344147,0.003794897,0.1447107,0.00001591855,0.0002381969,0.0002900577,0.00004033241,0.0007426855,0.01575247],"genre_scores_gemma":[0.9982322,0.0001152045,0.001359969,0.00003551362,0.0001165886,0.00004416111,0.00002607793,0.00004043978,0.00002982674],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1970033,"threshold_uncertainty_score":0.9005373,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001715536,0.000196457,0.0001970405,0.0001721517,0.0001299115,0.00009177782,0.0001034137,0.00007265178,0.00005159163],"category_scores_gemma":[0.000001773365,0.0001584186,0.00006846948,0.0003390016,0.00009861612,0.0001612127,0.000009551241,0.0001114891,0.00001421357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006189438,"about_ca_system_score_gemma":0.000004302294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000134352,"about_ca_topic_score_gemma":0.00004270968,"domain_scores_codex":[0.9991935,0.00003127352,0.0001603384,0.0001873622,0.0001241909,0.0003033719],"domain_scores_gemma":[0.9995974,0.00004348001,0.00002475786,0.0002011018,0.00002497759,0.0001083201],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0006684777,0.0004054973,0.08110307,0.001297576,0.00177755,0.0001341223,0.009531261,0.02241462,0.08411877,0.6199719,0.02944136,0.1491358],"study_design_scores_gemma":[0.004887613,0.001402255,0.01787319,0.0008999667,0.0004096112,0.000444573,0.005923645,0.02118891,0.05240922,0.07144512,0.8189725,0.004143408],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.897634,0.005409349,0.07624368,0.00008644573,0.0001107938,0.0002981781,0.00001986909,0.0007361119,0.01946156],"genre_scores_gemma":[0.9942474,0.0002631584,0.005234538,0.00006945743,0.00007971695,0.00003470914,0.000005359249,0.00003557124,0.00003011145],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7895311,"threshold_uncertainty_score":0.6460121,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004309787,0.0002181518,0.0003047888,0.0003364933,0.0001639573,0.00009720535,0.0003061761,0.00009769097,0.00001380757],"category_scores_gemma":[0.00003028343,0.0001849832,0.0001136612,0.0006073581,0.000218475,0.0004293795,0.0001468241,0.0001193675,8.94591e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003023639,"about_ca_system_score_gemma":0.00001486825,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002875257,"about_ca_topic_score_gemma":0.000002300283,"domain_scores_codex":[0.9987628,0.0001354258,0.0002579704,0.0003192842,0.000162077,0.0003623868],"domain_scores_gemma":[0.9988872,0.0003674891,0.0001301421,0.0003986055,0.00004660383,0.0001699656],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0001168123,0.0003954903,0.397529,0.0001943762,0.0002446857,0.000003370035,0.005802437,0.00001380875,0.04997799,0.5296405,0.0007817105,0.01529977],"study_design_scores_gemma":[0.00246224,0.001328649,0.7993426,0.0002113573,0.0002147774,0.00004319786,0.0005511043,0.002303073,0.1079967,0.07239658,0.01126298,0.001886709],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8882561,0.001717785,0.1090653,0.00007843822,0.00019832,0.0001977932,0.0000112964,0.00008946192,0.0003854512],"genre_scores_gemma":[0.9894993,0.000185768,0.01007857,0.0001543288,0.00005509315,0.000008693802,0.000003275009,0.00001036521,0.000004654483],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4572439,"threshold_uncertainty_score":0.7543395,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003943135,0.0001929571,0.0003777944,0.0003783701,0.00008312223,0.00003279387,0.0001767823,0.00008325639,0.00001090416],"category_scores_gemma":[0.00004892311,0.0001457263,0.0001037755,0.001894773,0.0002760226,0.00009236582,0.00002666736,0.0001043173,5.554881e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003252967,"about_ca_system_score_gemma":0.00002563089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000113595,"about_ca_topic_score_gemma":0.00003341971,"domain_scores_codex":[0.9988806,0.0000958164,0.0004438995,0.0001594712,0.0001875281,0.000232746],"domain_scores_gemma":[0.9988402,0.0005077841,0.0001412664,0.0002685555,0.0001486477,0.00009354868],"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.0008793261,0.0002122641,0.1673515,0.001829608,0.001375476,0.00001918674,0.002648924,0.003467703,0.1663495,0.6121292,0.001304666,0.04243264],"study_design_scores_gemma":[0.01688827,0.009348133,0.2066405,0.004491763,0.002825379,0.0006953352,0.01800893,0.03698912,0.1625859,0.4567506,0.07895663,0.005819408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9480461,0.01836356,0.03110606,0.00001610589,0.0001466588,0.0002968677,0.00001499793,0.00005892951,0.001950672],"genre_scores_gemma":[0.9917135,0.005092074,0.003103749,0.000007613521,0.00002192536,0.000007101134,0.000001911151,0.00002137677,0.00003073439],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1553786,"threshold_uncertainty_score":0.5942547,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005540841,0.0004939433,0.0004710567,0.0005902371,0.0006257885,0.0009546715,0.0005444341,0.0001941523,0.00002499133],"category_scores_gemma":[0.000008993657,0.0004531385,0.0002589279,0.001195145,0.0004025141,0.0008077783,0.0003112725,0.0002587003,0.000008341779],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009219917,"about_ca_system_score_gemma":0.0000307251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004789532,"about_ca_topic_score_gemma":0.00001925055,"domain_scores_codex":[0.9973428,0.0002096345,0.0004484711,0.0009067401,0.000394788,0.0006975828],"domain_scores_gemma":[0.9985129,0.00031924,0.0001677193,0.000675081,0.00006787282,0.0002572436],"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.00004262898,0.0002522211,0.01033249,0.00008757911,0.000119072,0.00005332175,0.0005918826,0.000007916878,0.004582872,0.9710683,0.001179748,0.01168194],"study_design_scores_gemma":[0.003445652,0.001323315,0.05898215,0.0002856863,0.0003051107,0.0005168993,0.0004697347,0.01524254,0.006247799,0.8535808,0.05670067,0.002899671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5714232,0.006523265,0.4130945,0.0003529387,0.0003314866,0.0005289878,0.00003528819,0.001316773,0.006393546],"genre_scores_gemma":[0.922793,0.0007247361,0.07579564,0.0004028617,0.0001575306,0.00005096438,0.00001235195,0.00003489032,0.00002802356],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3513697,"threshold_uncertainty_score":0.999792,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003059279,0.0001840256,0.0002211632,0.0003861126,0.0001328238,0.00005516212,0.0005653702,0.00006903536,0.00003974448],"category_scores_gemma":[0.000008461103,0.0001584166,0.000181101,0.0006456608,0.0002058714,0.0002078263,0.0001069054,0.0001076406,0.000006851677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002197975,"about_ca_system_score_gemma":0.00001082272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000151801,"about_ca_topic_score_gemma":0.000002007586,"domain_scores_codex":[0.9988785,0.0001011191,0.0002244086,0.0003520485,0.0001833313,0.0002605889],"domain_scores_gemma":[0.9990608,0.0001235958,0.0001053021,0.0005377121,0.00005314949,0.0001194404],"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.0000547431,0.0001430322,0.00321159,0.00001936091,0.00004486788,0.000007824098,0.001234227,8.148783e-7,0.002820326,0.9738699,0.0001704282,0.01842287],"study_design_scores_gemma":[0.0008249547,0.001885289,0.02430914,0.0001152019,0.00004372737,0.00002405114,0.0001354327,0.0003620822,0.04226185,0.9284095,0.001053307,0.0005754661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4304692,0.0003052201,0.5559023,0.00003404811,0.0001752929,0.0001916609,0.000007805435,0.0001861036,0.01272836],"genre_scores_gemma":[0.9782313,0.00006363801,0.02141931,0.0002406547,0.00001305255,0.00001387599,0.000001217667,0.000009637656,0.000007395973],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.547762,"threshold_uncertainty_score":0.6460042,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008728925,0.0003813216,0.000329633,0.0005908019,0.0004573904,0.000288895,0.0005342063,0.0001434304,0.00004385415],"category_scores_gemma":[0.00003159406,0.0003398382,0.0002709158,0.001138789,0.0001713474,0.000630023,0.0001962584,0.000272314,0.00002809681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000126948,"about_ca_system_score_gemma":0.00001655443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001749664,"about_ca_topic_score_gemma":0.000003684518,"domain_scores_codex":[0.9977641,0.0002368854,0.0002931077,0.0005435014,0.0003746347,0.0007877531],"domain_scores_gemma":[0.9981251,0.0006900723,0.0001278133,0.0006461099,0.00004625484,0.0003646222],"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.00004678405,0.0003415624,0.01489878,0.0000283076,0.0001221851,0.000009295472,0.001862521,0.00001594619,0.001283097,0.971746,0.0009913268,0.008654228],"study_design_scores_gemma":[0.004908733,0.003427972,0.1729374,0.0004507118,0.0003578012,0.0001917278,0.0006091057,0.01381983,0.01302938,0.6952227,0.09019706,0.004847482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5472916,0.001368384,0.4441395,0.0001619682,0.0004909619,0.0003209008,0.00001790202,0.0008636427,0.005345061],"genre_scores_gemma":[0.9769655,0.0002079799,0.02140393,0.001172227,0.0001560811,0.00004748461,0.00000506794,0.00002527482,0.00001645252],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4296739,"threshold_uncertainty_score":0.9999053,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008920528,0.000116398,0.0001356036,0.0003090595,0.00007590848,0.0002500981,0.0003448518,0.00003693877,0.000003031693],"category_scores_gemma":[0.00002041725,0.0001038386,0.00007806678,0.0006660651,0.0001736742,0.0004956321,0.00008407146,0.00005564125,0.000002150748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004684289,"about_ca_system_score_gemma":0.00001697658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000039197,"about_ca_topic_score_gemma":0.000001522968,"domain_scores_codex":[0.9991758,0.00002879905,0.0001958688,0.0002768689,0.0001705644,0.0001521208],"domain_scores_gemma":[0.9993294,0.0001380701,0.00009034323,0.0003176591,0.00008212899,0.00004238774],"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.0000297312,0.0004248404,0.001986848,0.00005190447,0.00003244585,0.00002465992,0.0001679172,0.00008294693,0.03488446,0.8996288,0.01643469,0.04625079],"study_design_scores_gemma":[0.0002896808,0.000563366,0.002095368,0.00009910189,0.00001385801,0.00001080874,0.00003721486,0.002740899,0.1296636,0.863158,0.0009913045,0.0003367809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02005277,0.0001479449,0.9588913,0.0001843403,0.00002555161,0.0001143415,0.000009324671,0.0003015986,0.02027282],"genre_scores_gemma":[0.8750825,0.00001210183,0.1247142,0.0001241485,0.00000772098,0.00001761229,0.000005396487,0.000007433409,0.00002888851],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8550297,"threshold_uncertainty_score":0.4234416,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002267273,0.0002215769,0.0001832105,0.0003405153,0.0003896194,0.0004252089,0.0004231916,0.00007786332,0.0001688836],"category_scores_gemma":[0.00001054471,0.0001880486,0.0001940461,0.0007539381,0.0001458849,0.000386662,0.0001037129,0.0001590297,0.0001351727],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005723618,"about_ca_system_score_gemma":0.00001370867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003351687,"about_ca_topic_score_gemma":0.00000338772,"domain_scores_codex":[0.9985917,0.000114885,0.0002105733,0.0004774368,0.0002246208,0.0003808093],"domain_scores_gemma":[0.9989431,0.0001681225,0.000061073,0.0005457858,0.00006638115,0.000215575],"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.00001956447,0.000184028,0.003465343,0.000009619641,0.00006878173,0.000004705842,0.0002951397,0.00002842784,0.002192549,0.9128407,0.006064751,0.07482645],"study_design_scores_gemma":[0.002304451,0.004073015,0.07679324,0.000179737,0.0001423561,0.00007929041,0.0006209085,0.01482117,0.009242418,0.7789903,0.1104141,0.002338946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.144189,0.0002546571,0.8459381,0.0007246542,0.0003862082,0.0003367478,0.000006363263,0.0003998712,0.007764405],"genre_scores_gemma":[0.9885187,0.00005932758,0.01037759,0.0007689998,0.00008692846,0.0001296414,0.000004219134,0.00001180374,0.00004276746],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8443298,"threshold_uncertainty_score":0.7668397,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002819697,0.000188287,0.0001894613,0.0005720784,0.0001252976,0.0003757111,0.0004301225,0.0000836847,0.00008429907],"category_scores_gemma":[0.000009199654,0.0001730032,0.0001206931,0.0008154166,0.0001093362,0.0007262667,0.0001374416,0.0001630396,0.00002921726],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007306869,"about_ca_system_score_gemma":0.00001168804,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000136789,"about_ca_topic_score_gemma":0.00002007105,"domain_scores_codex":[0.9987551,0.0001096657,0.0002517605,0.0004020209,0.0001416874,0.0003397465],"domain_scores_gemma":[0.9993291,0.0001134669,0.00006796278,0.00033252,0.00004131786,0.0001155712],"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.00006231941,0.0002571425,0.1484395,0.00005276213,0.00008428312,0.00001851719,0.003803043,0.00001110152,0.02134015,0.6484334,0.005813005,0.1716847],"study_design_scores_gemma":[0.002268244,0.0007955497,0.426983,0.0002362747,0.00003279744,0.00006025502,0.0004235641,0.0334741,0.00254427,0.5198976,0.01170068,0.001583642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4663571,0.0002879691,0.52929,0.000526652,0.0001701383,0.0002773708,0.000001436512,0.0001668075,0.002922619],"genre_scores_gemma":[0.9675509,0.00003724003,0.03165743,0.0006286048,0.00004463201,0.00005832542,0.000001873323,0.000009723566,0.00001129439],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5011938,"threshold_uncertainty_score":0.7054865,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001199074,0.0002774308,0.0002741342,0.0001833224,0.001313766,0.0004625963,0.0007072715,0.0001340388,0.00000546669],"category_scores_gemma":[0.00002660841,0.0002002964,0.000324049,0.0007884273,0.0002195141,0.0008511721,0.0002639224,0.0002090779,0.000001078002],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001464771,"about_ca_system_score_gemma":0.00005504035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001693077,"about_ca_topic_score_gemma":0.00002810301,"domain_scores_codex":[0.9980515,0.000154517,0.0003041774,0.0004345572,0.0002375401,0.0008176892],"domain_scores_gemma":[0.9985484,0.000324148,0.0001362014,0.0006435128,0.00008866088,0.0002590074],"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.0000360792,0.0001514424,0.001296695,0.00003998103,0.00009246606,3.198822e-7,0.001386611,0.000001114849,0.001043998,0.9915236,0.001937895,0.002489862],"study_design_scores_gemma":[0.003612769,0.000530446,0.003457815,0.0000456146,0.0002814211,0.00003527532,0.0004460803,0.02374452,0.00238419,0.8422112,0.1221178,0.001132805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007155095,0.004849423,0.9840581,0.0006652918,0.001065438,0.001344956,0.0001327698,0.0002507558,0.0004781377],"genre_scores_gemma":[0.9232336,0.0002870548,0.07536861,0.0002201316,0.0003851529,0.0004573895,0.00002997196,0.00001718927,9.178854e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9160785,"threshold_uncertainty_score":0.9999864,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002591041,0.0001526941,0.0002466086,0.0005407918,0.0001708657,0.00003951752,0.0003402744,0.00006708164,0.00001137823],"category_scores_gemma":[0.0000222152,0.0001457349,0.0001284914,0.001201404,0.0001977825,0.0000769367,0.00008584096,0.0001334434,0.000002408129],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004154796,"about_ca_system_score_gemma":0.00002693338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002394796,"about_ca_topic_score_gemma":0.00001366159,"domain_scores_codex":[0.9988624,0.0001138301,0.0003033776,0.0003054228,0.0001723095,0.0002426194],"domain_scores_gemma":[0.9990909,0.0003553285,0.0001012889,0.0003063093,0.00006114469,0.00008509323],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0001243195,0.00102844,0.1125418,0.0001483034,0.0001169978,0.0001413267,0.01046357,0.01317248,0.001886918,0.8321509,0.0002721093,0.0279528],"study_design_scores_gemma":[0.0020124,0.001059843,0.6258985,0.0002619165,0.00004348933,0.0001159902,0.0002327921,0.2834078,0.001376504,0.0835545,0.00102955,0.001006673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4570158,0.0001968426,0.5421602,0.00006608202,0.00006210765,0.00008898372,0.000005057836,0.00004613236,0.0003588191],"genre_scores_gemma":[0.982011,0.00006467202,0.01775905,0.0001212965,0.00001480828,0.00001631073,0.000003602978,0.000006210495,0.000003079959],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7485964,"threshold_uncertainty_score":0.5942898,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000615725,0.0002200141,0.0002356164,0.0001742676,0.0009603974,0.0001516708,0.0005686206,0.00005567694,0.00001513303],"category_scores_gemma":[0.00001018491,0.0001661604,0.0001378225,0.0005339507,0.0009491672,0.0004938337,0.0001723013,0.0001429203,6.738797e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003337329,"about_ca_system_score_gemma":0.00003069274,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003048246,"about_ca_topic_score_gemma":0.00002474217,"domain_scores_codex":[0.9984255,0.0002129947,0.0003090589,0.0003796442,0.0002831879,0.0003895956],"domain_scores_gemma":[0.9988677,0.0002579867,0.0001279869,0.0004717337,0.00008674389,0.0001878815],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0005703944,0.0006733891,0.0191246,0.0001029982,0.000183367,0.00006141914,0.003868178,0.0001847436,0.004564809,0.852609,0.0005239888,0.1175331],"study_design_scores_gemma":[0.009607678,0.01422612,0.5407943,0.0003455738,0.000365195,0.001897542,0.004502282,0.1518517,0.08872781,0.1507638,0.03209711,0.004820957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7484228,0.001032311,0.2496733,0.0001212484,0.00006761572,0.0001712479,0.00001541599,0.0000804105,0.0004156302],"genre_scores_gemma":[0.9543746,0.0005640545,0.04487316,0.0001172922,0.00003524146,0.00001875222,0.00000349624,0.000008828825,0.000004553148],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7018452,"threshold_uncertainty_score":0.7386698,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007602806,0.0003324991,0.0002884122,0.0004148913,0.0007130597,0.0003560366,0.001101776,0.0001627109,0.0000617417],"category_scores_gemma":[0.0000256587,0.0002953432,0.0002532534,0.00101105,0.0003835715,0.0006308925,0.0003286779,0.0004740323,0.00001584327],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000483324,"about_ca_system_score_gemma":0.00003903493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004363043,"about_ca_topic_score_gemma":0.00002311353,"domain_scores_codex":[0.9979835,0.0001398574,0.0002977672,0.000708261,0.0003282566,0.0005423151],"domain_scores_gemma":[0.9984107,0.0001977748,0.0001161666,0.0009021485,0.0000878341,0.0002853549],"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.00003061115,0.0001442739,0.01504362,0.00002318695,0.00007223061,0.00004537819,0.001076309,0.00000408738,0.0655338,0.8601096,0.0008987989,0.05701808],"study_design_scores_gemma":[0.002031067,0.002301999,0.02102874,0.0001662847,0.0001307807,0.0005366257,0.0004311497,0.01755294,0.03287492,0.8073422,0.1126057,0.002997665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6426888,0.0003757108,0.3519854,0.0005358077,0.0006728586,0.0002272466,0.00001226792,0.0005799505,0.002921959],"genre_scores_gemma":[0.9432401,0.0001581226,0.05589248,0.0005167036,0.0001039728,0.00003749186,0.00000433417,0.00001928004,0.00002750353],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3005513,"threshold_uncertainty_score":0.9999499,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001938456,0.0001390564,0.0001765772,0.00007139376,0.0001464633,0.0000533663,0.0001401868,0.00004594464,0.0000157651],"category_scores_gemma":[0.000005465733,0.0000869623,0.00007670479,0.0003123702,0.0002701503,0.00006369154,0.000009071334,0.00008163229,0.000002697519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002014484,"about_ca_system_score_gemma":0.000001969788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003979861,"about_ca_topic_score_gemma":0.000008078755,"domain_scores_codex":[0.9993082,0.00005867891,0.0001772692,0.0001172344,0.0001323746,0.0002062292],"domain_scores_gemma":[0.9994828,0.0001787207,0.00004089663,0.0002077647,0.00003248569,0.00005730847],"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.0002968272,0.0001448783,0.01472814,0.000603502,0.001023845,0.00005444996,0.004255465,0.001705664,0.05441069,0.8661114,0.002550985,0.05411419],"study_design_scores_gemma":[0.02098237,0.008367001,0.05579462,0.003835816,0.001590486,0.001210695,0.03106779,0.1174342,0.125959,0.4811092,0.1430523,0.009596431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8912302,0.009604195,0.08599125,0.00004880746,0.0001627624,0.0004093009,0.00002420783,0.000255251,0.01227405],"genre_scores_gemma":[0.9983801,0.0005933268,0.0009228857,0.00001263748,0.00002126685,0.00003043917,7.015161e-7,0.00001670689,0.00002192853],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3850022,"threshold_uncertainty_score":0.3546219,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}