{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":29,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":29,"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":"9dff181ab68f","filters":{"venue":"Applicable Algebra in Engineering Communication and Computing"}},"results":[{"id":"W2041369703","doi":"10.1007/s002000100081","title":"Constrained Principal Component Analysis: A Comprehensive Theory","year":2001,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Spectroscopy and Chemometric Analyses","field":"Chemistry","cited_by":119,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria; McGill University","funders":"","keywords":"Principal component analysis; Canonical correlation; Correspondence analysis; Matrix (chemical analysis); Singular value decomposition; Canonical form; Metric (unit); Component analysis; Mathematics; Computer science; Canonical analysis; Variety (cybernetics); Applied mathematics; Algorithm; Statistics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01093422505226197,"gpt":0.2494492427574874,"spread":0.2385150177052255,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002166356,0.0001873815,0.0003712511,0.0002867286,0.0001262813,0.0000580834,0.0003492125,0.00008759235,0.0001613709],"category_scores_gemma":[0.00002992353,0.0002052758,0.00008122362,0.001198646,0.00007532194,0.00005624835,0.0002241016,0.000330164,0.0000053071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006212528,"about_ca_system_score_gemma":0.0000113333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008450785,"about_ca_topic_score_gemma":0.000006504494,"domain_scores_codex":[0.9989385,0.00002828325,0.0003599204,0.0002684402,0.0001214436,0.0002833984],"domain_scores_gemma":[0.9987208,0.0004930872,0.0001046651,0.0005554099,0.00004141327,0.00008464669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001861254,0.001159709,0.1970439,0.0007202631,0.004876796,0.0000538011,0.003262386,0.3117674,0.146106,0.308227,0.00006037547,0.0265363],"study_design_scores_gemma":[0.001857394,0.00002409538,0.02509888,0.0001209581,0.0008287973,0.00007403679,0.002560338,0.9509051,0.01069499,0.002237121,0.004659692,0.0009385957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9287643,0.002728443,0.06400024,0.0001004655,0.000008579933,0.00008469432,0.000002224552,0.0002148336,0.004096251],"genre_scores_gemma":[0.9942436,0.000317306,0.005176099,0.00009181825,0.00002219773,0.00002031962,0.00004601722,0.00001658978,0.0000660186],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6391377,"threshold_uncertainty_score":0.8370903,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080520202","doi":"10.1007/s00200-006-0196-1","title":"General relativity and quantum mechanics: towards a generalization of the Lambert W function A Generalization of the Lambert W Function","year":2006,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Sports Dynamics and Biomechanics","field":"Engineering","cited_by":86,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Generalization; Theory of relativity; Mathematics; Lambert W function; Function (biology); General relativity; Mathematical analysis; Mathematical physics; Classical mechanics; Pure mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.003860550060385986,"gpt":0.1717899451693302,"spread":0.1679293951089442,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003439812,0.0001501415,0.0001816515,0.00008340731,0.00009925006,0.00002458105,0.0001748413,0.0001132457,0.000002047475],"category_scores_gemma":[0.00001116914,0.0001224232,0.00004581215,0.0005454021,0.00002468411,0.00008740174,0.0001705756,0.0001685592,1.317907e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005098732,"about_ca_system_score_gemma":0.00001211487,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004132475,"about_ca_topic_score_gemma":0.0001145473,"domain_scores_codex":[0.9991128,0.00004668361,0.0003984126,0.0001487693,0.0001478045,0.0001455517],"domain_scores_gemma":[0.9993221,0.00003556391,0.0001434822,0.0004226525,0.00005676812,0.00001944862],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009625705,0.00003896465,0.005218781,0.0001556607,0.00002988572,7.654733e-8,0.0001719041,0.7657493,0.05091441,0.1738495,0.00003578504,0.003826112],"study_design_scores_gemma":[0.0002356471,0.00001160658,0.03708538,0.00007931983,0.00002626978,0.000004599426,0.00001957719,0.9559342,0.002094133,0.004063534,0.0003228337,0.0001229626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6850822,0.0005941816,0.3137579,0.00006325578,0.0001442851,0.0002316705,0.000002742704,0.00006430163,0.00005950389],"genre_scores_gemma":[0.9981941,0.0002051718,0.001455561,0.00002393029,0.00003472744,0.00001536932,0.00002852634,0.00002703348,0.00001557831],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3131119,"threshold_uncertainty_score":0.4992274,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2164838307","doi":"10.1007/s00200-009-0117-1","title":"On the geometry of polar varieties","year":2010,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Correctness; Singular point of an algebraic variety; Mathematics; Polar; Variety (cybernetics); Algebraic variety; Degree (music); Polar coordinate system; Singular point of a curve; Point (geometry); Algebraic geometry; Algebraic number; Algorithm; Algebra over a field; Pure mathematics; Geometry; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.005583937670656649,"gpt":0.2005327999258704,"spread":0.1949488622552137,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005121168,0.0000967248,0.0001219239,0.0001142291,0.000108894,0.00007104798,0.0007853154,0.00004680529,0.000003804067],"category_scores_gemma":[0.00007833608,0.00008072154,0.00002518151,0.0004367559,0.00004549509,0.0001051439,0.0003905602,0.0003692651,0.00000357609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008464825,"about_ca_system_score_gemma":0.00001434095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006946213,"about_ca_topic_score_gemma":0.000004666909,"domain_scores_codex":[0.9993287,0.00003108371,0.0002239412,0.0001542549,0.0001128478,0.0001492065],"domain_scores_gemma":[0.9984058,0.0008250342,0.0000792034,0.0006288685,0.00002743996,0.00003371003],"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.000001151039,0.00002917013,0.000344664,0.00001282816,0.000005394615,1.706848e-7,0.0003341039,0.004003363,0.003981462,0.9707063,0.00002802539,0.02055331],"study_design_scores_gemma":[0.0002207043,0.00002847388,0.01584382,0.00004036966,0.00000194857,0.000007495618,0.00003624617,0.9414063,0.003871189,0.03757542,0.0007979582,0.0001700358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7270759,0.0001449909,0.2708267,0.001155076,0.00007789848,0.0001221567,3.678973e-7,0.00008939968,0.0005074602],"genre_scores_gemma":[0.9843411,0.00001352305,0.01544217,0.0001640694,0.00001649641,0.000008498508,0.000001571817,0.000006469302,0.000006083866],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.937403,"threshold_uncertainty_score":0.3291729,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1760096751","doi":"10.1007/s00200-013-0188-x","title":"Construction of cyclic codes over $$\\mathbb F _2+u\\mathbb F _2$$ F 2 + u F 2 for DNA computing","year":2013,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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 Victoria","funders":"","keywords":"Complement (music); BCH code; Ring (chemistry); Constraint (computer-aided design); Combinatorics; Construct (python library); Physics; Mathematics; DNA; Discrete mathematics; Computer science; Chemistry; Decoding methods; Algorithm; Biology; Genetics; Computer network; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.005864888415478002,"gpt":0.222129005381761,"spread":0.216264116966283,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003689612,0.0001888551,0.0002762585,0.00007023977,0.0001318166,0.0000511094,0.0003168434,0.0001559249,0.000004817416],"category_scores_gemma":[0.0000862829,0.0001882797,0.00006996591,0.0001708673,0.00008991265,0.00001177468,0.0003708727,0.0001574433,0.000001746514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001609183,"about_ca_system_score_gemma":0.00001348457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000062037,"about_ca_topic_score_gemma":0.000003473293,"domain_scores_codex":[0.9988177,0.00004767682,0.0004588353,0.0003058409,0.00007744122,0.0002925475],"domain_scores_gemma":[0.9990753,0.0002025706,0.000181403,0.0003960157,0.00008293645,0.00006180296],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003153251,0.0001582141,0.01908369,0.0003711211,0.00009602129,3.3233e-7,0.000247963,0.01300049,0.8718743,0.01693973,0.0001895074,0.07800703],"study_design_scores_gemma":[0.002359797,0.0003577376,0.05248215,0.0004499329,0.00003847273,0.00004716511,0.0005868829,0.7893831,0.1443535,0.002909782,0.005987165,0.001044261],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9230404,0.0007011488,0.07542243,0.00007669683,0.00004813806,0.0004142293,0.000003077229,0.00005245552,0.0002413967],"genre_scores_gemma":[0.9582009,0.0001045946,0.04138577,0.00009871869,0.00007572564,0.00002744738,0.00007704314,0.00002078823,0.000008968605],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7763826,"threshold_uncertainty_score":0.7677824,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1990568802","doi":"10.1007/s00200-012-0179-3","title":"Multi-point evaluation in higher dimensions","year":2012,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Polynomial and algebraic computation","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":"Western University","funders":"Agence Nationale de la Recherche","keywords":"Monomial; Tensor product; Interpolation (computer graphics); Multiplication (music); Mathematics; Point (geometry); Product (mathematics); Series (stratigraphy); Combinatorics; Univariate; Discrete mathematics; Algebra over a field; Pure mathematics; Computer science; Geometry; Multivariate statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02954449687721987,"gpt":0.2622690116094465,"spread":0.2327245147322266,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001084445,0.0001312155,0.0001550198,0.0001948077,0.00008333611,0.00006610925,0.000399252,0.00005790067,0.000005976768],"category_scores_gemma":[0.00003743347,0.0001435624,0.00002241851,0.0005478089,0.00001663689,0.0004554091,0.0004605216,0.0002274455,0.00001130755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009715721,"about_ca_system_score_gemma":0.00001765441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009062285,"about_ca_topic_score_gemma":0.000008920408,"domain_scores_codex":[0.9989493,0.00009418124,0.0003171606,0.0001842934,0.0001377551,0.0003173225],"domain_scores_gemma":[0.9991093,0.0002371023,0.00006886273,0.0004711282,0.00003038352,0.00008320062],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008585695,0.0009025423,0.03511887,0.0001105206,0.00003564059,0.000002031275,0.01057409,0.2080942,0.01290263,0.3582699,0.0001203154,0.3738607],"study_design_scores_gemma":[0.0005128917,0.000006186219,0.09557949,0.00005880452,0.000002587151,0.000004400529,0.00004139198,0.9021831,0.0002289486,0.0008667592,0.0003528445,0.0001625673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5621213,0.002709478,0.4330131,0.0008279101,0.0002199899,0.0004502663,2.745204e-7,0.0002157425,0.0004419389],"genre_scores_gemma":[0.9334677,0.00003515082,0.06626526,0.0001327982,0.00003098487,0.00004416428,0.000006033903,0.00000962579,0.00000829189],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6940889,"threshold_uncertainty_score":0.5854303,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2112566740","doi":"10.1007/s00200-005-0186-8","title":"Cryptographic implications of Hess' generalized GHS attack","year":2005,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Cryptography and Residue Arithmetic","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":"University of Waterloo","funders":"","keywords":"Discrete logarithm; Finite field; Generalization; Logarithm; Elliptic curve; Mathematics; Cryptography; Field (mathematics); Pure mathematics; Discrete mathematics; Computer science; Mathematical analysis; Public-key cryptography; Algorithm; Encryption; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.01067644334757325,"gpt":0.238737300977275,"spread":0.2280608576297017,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003433154,0.0001360935,0.0002079827,0.0002805085,0.0001216562,0.00006455735,0.0008567082,0.00006560981,0.000003118095],"category_scores_gemma":[0.00001398168,0.0001458877,0.00005985499,0.001003442,0.00005844478,0.0001932934,0.0003861751,0.0002023615,0.000002633654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000165327,"about_ca_system_score_gemma":0.00001464981,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004716679,"about_ca_topic_score_gemma":0.0000129102,"domain_scores_codex":[0.9989762,0.00004539854,0.0003904106,0.000249985,0.0001040473,0.0002339989],"domain_scores_gemma":[0.9986393,0.0002272461,0.0001088703,0.0009056485,0.00005069745,0.00006818831],"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.000002951253,0.0001945949,0.00779856,0.00008710531,0.00004109757,3.198469e-7,0.0009595323,0.09339289,0.007828376,0.7831854,0.00008444453,0.1064247],"study_design_scores_gemma":[0.0009218769,0.00003140063,0.1158301,0.000143139,0.00001237878,0.0000236794,0.0000483853,0.8661386,0.003525911,0.006600386,0.006292618,0.00043157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4588228,0.002486208,0.5363488,0.001382919,0.00002208848,0.0002134908,7.839293e-7,0.0001829197,0.0005400711],"genre_scores_gemma":[0.8065301,0.0003606077,0.192946,0.0001074739,0.00001579137,0.00002468215,0.00000346571,0.000009221821,0.000002688197],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.776585,"threshold_uncertainty_score":0.5949129,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064281699","doi":"10.1007/s002000100092","title":"Isomorphism Classes of Genus-2 Hyperelliptic Curves Over Finite Fields","year":2002,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":20,"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":"Isomorphism (crystallography); Genus; Mathematics; Finite field; Pure mathematics; Discrete mathematics; Zoology; Biology; Crystallography; Chemistry","retraction":null,"screen_n_in":null,"score":{"opus":0.01071415078121423,"gpt":0.2033517285445284,"spread":0.1926375777633142,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002016999,0.000113165,0.0001832613,0.0001435322,0.00007194345,0.00004130331,0.0006118734,0.00006095869,0.0000114986],"category_scores_gemma":[0.00003060393,0.0001192675,0.00004150854,0.0005409564,0.00004277235,0.000138519,0.00031907,0.0002223539,0.000003593168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008647517,"about_ca_system_score_gemma":0.00000463745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005419236,"about_ca_topic_score_gemma":0.000003623072,"domain_scores_codex":[0.9991996,0.00003560764,0.0002830083,0.0001868372,0.0001135762,0.0001813786],"domain_scores_gemma":[0.9987382,0.0004769914,0.00007891361,0.0006340583,0.0000270015,0.0000448819],"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.000008223677,0.001031597,0.02934963,0.002481601,0.0002059571,0.00001963075,0.006278875,0.1635317,0.005175726,0.5282155,0.002043016,0.2616586],"study_design_scores_gemma":[0.0002675737,0.00002501312,0.008301482,0.0003234082,0.000005990997,0.000009544061,0.0000171139,0.9879426,0.0004589846,0.001021093,0.001453987,0.0001732557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3341923,0.02563277,0.6374168,0.001081461,0.00007758608,0.0002800098,9.736982e-7,0.0002095447,0.001108554],"genre_scores_gemma":[0.9703408,0.003301109,0.0261035,0.0002138501,0.00001034226,0.00001000619,0.000001676845,0.000007985466,0.00001074132],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8244109,"threshold_uncertainty_score":0.4863587,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021947009","doi":"10.1007/s00200-012-0170-z","title":"Cryptanalysis of a key exchange protocol based on the endomorphisms ring End $${(\\mathbb{Z}_{p} \\times \\mathbb{Z}_{p^2})}$$","year":2012,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":15,"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":"Endomorphism; Key exchange; Mathematics; Polynomial ring; Ring (chemistry); Combinatorics; Polynomial; Cryptanalysis; Discrete mathematics; Homogeneous; Endomorphism ring; Algorithm; Computer science; Public-key cryptography; Mathematical analysis; Cryptography","retraction":null,"screen_n_in":null,"score":{"opus":0.01192925973261772,"gpt":0.2280390128712923,"spread":0.2161097531386746,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001792577,0.0002182183,0.0002845177,0.0002893815,0.0002184755,0.0001003934,0.001142477,0.00006809124,0.00002594499],"category_scores_gemma":[0.00007030919,0.0001854999,0.00009861311,0.001006998,0.00008183702,0.0002302621,0.0005173287,0.0003175638,0.000005552444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003293309,"about_ca_system_score_gemma":0.00001525646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002926825,"about_ca_topic_score_gemma":0.000001508208,"domain_scores_codex":[0.998511,0.0001860785,0.0004241273,0.0002516995,0.0002441161,0.0003829879],"domain_scores_gemma":[0.997178,0.001225894,0.0001981703,0.001265446,0.00004367924,0.00008886513],"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.00001794404,0.0002869802,0.002205574,0.0001907023,0.00004891635,8.24509e-7,0.002116223,0.01728521,0.001992676,0.9496744,0.00004213256,0.02613841],"study_design_scores_gemma":[0.0006047282,0.00005021723,0.002616824,0.0002521948,0.00001465778,0.000005643137,0.00009284721,0.9853021,0.00427097,0.002777713,0.003725804,0.0002862989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05181895,0.0005091695,0.9321057,0.0008773174,0.00006542901,0.009640314,0.000002010278,0.0004030123,0.0045781],"genre_scores_gemma":[0.9621374,0.00001035631,0.0336489,0.0001917162,0.00002821661,0.003958322,0.000002257097,0.00001780274,0.000005041784],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9680169,"threshold_uncertainty_score":0.7564465,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964083059","doi":"10.1007/s00200-019-00381-3","title":"On extremal double circulant self-dual codes of lengths 90–96","year":2019,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"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":"Japan Society for the Promotion of Science","keywords":"Circulant matrix; Dual (grammatical number); Mathematics; Code (set theory); Combinatorics; Discrete mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.006535158867155918,"gpt":0.20682669579713,"spread":0.2002915369299741,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005687051,0.0001417173,0.0002230947,0.0001775834,0.00007327203,0.00006531084,0.0006774165,0.00005935348,0.000005173586],"category_scores_gemma":[0.000008616938,0.0001521429,0.00004704557,0.0004680264,0.00002300831,0.0001411303,0.0004110966,0.0002376539,0.00000966815],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002169913,"about_ca_system_score_gemma":0.00001409929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002652007,"about_ca_topic_score_gemma":0.000001208457,"domain_scores_codex":[0.9990423,0.00004800294,0.0002840821,0.0002643303,0.0001419982,0.0002193348],"domain_scores_gemma":[0.9985,0.0004561603,0.0000942714,0.0008708438,0.00003030762,0.00004845606],"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.00001162298,0.000112866,0.001931974,0.00008640578,0.0000234652,8.711788e-7,0.0008374664,0.02774063,0.002990961,0.9590921,0.0000104252,0.007161143],"study_design_scores_gemma":[0.001351181,0.000120983,0.005778454,0.0003030215,0.000008226103,0.00002025584,0.0001089779,0.9764299,0.004680768,0.009783869,0.001015779,0.0003985708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8918137,0.0003981376,0.1054599,0.00009033706,0.00005942149,0.0002310565,5.020757e-7,0.0002515791,0.001695378],"genre_scores_gemma":[0.9800426,0.00005094304,0.01980682,0.00005875271,0.000009996868,0.00001121858,0.000003163073,0.00001113738,0.000005411446],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9493083,"threshold_uncertainty_score":0.6204209,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071302523","doi":"10.1007/s00200-005-0187-7","title":"On the low hamming weight discrete logarithm problem for nonadjacent representations","year":2005,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":11,"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","keywords":"Discrete logarithm; Logarithm; Mathematics; Elliptic curve cryptography; Cryptography; Cryptosystem; Elliptic curve; Post-quantum cryptography; Hyperelliptic curve cryptography; Discrete mathematics; Algorithm; Computer science; Public-key cryptography; Pure mathematics; Encryption","retraction":null,"screen_n_in":null,"score":{"opus":0.006295475143209721,"gpt":0.2229101934455309,"spread":0.2166147183023212,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004668995,0.0001283322,0.0001244231,0.0001171971,0.0003283682,0.0001563811,0.000722138,0.00004391987,0.000001950488],"category_scores_gemma":[0.00003367764,0.0001053002,0.00004920473,0.0004158936,0.00003926691,0.0001508724,0.0003103708,0.0002320419,0.000003449736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002966627,"about_ca_system_score_gemma":0.000012487,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002837758,"about_ca_topic_score_gemma":0.00001256231,"domain_scores_codex":[0.9990695,0.0000422164,0.0002585723,0.0002644082,0.0001162404,0.0002490982],"domain_scores_gemma":[0.9981469,0.0009741769,0.00007096586,0.0007249388,0.00003363124,0.00004937794],"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.000003175179,0.00006999206,0.0001899969,0.00003580378,0.00001856506,3.7509e-7,0.0009011872,0.07698949,0.0003717165,0.8741733,0.0001795304,0.0470669],"study_design_scores_gemma":[0.0003562705,0.00001962516,0.001515808,0.0001163657,0.000004205134,0.000005694395,0.00005527321,0.9835761,0.00114788,0.008589569,0.004445841,0.0001673692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03222356,0.0005136046,0.959448,0.006444373,0.00003394019,0.0005762713,9.770645e-7,0.0001472788,0.0006119534],"genre_scores_gemma":[0.8236972,0.00007652167,0.1757817,0.000266976,0.00002972142,0.0001189091,0.000004859016,0.00001051781,0.00001353971],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9065866,"threshold_uncertainty_score":0.4294016,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2201326897","doi":"10.1007/s00200-019-00386-y","title":"Greedy construction of DNA codes and new bounds","year":2019,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Bounded function; Greedy algorithm; Upper and lower bounds; Mathematics; Constant (computer programming); GC-content; Construct (python library); Content (measure theory); Discrete mathematics; Algorithm; Computer science; Biology; Genetics; Genome","retraction":null,"screen_n_in":null,"score":{"opus":0.00668701125520002,"gpt":0.2098744550817642,"spread":0.2031874438265642,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001784214,0.0000828772,0.0001295002,0.00003333435,0.0000331456,0.0000184189,0.0001214172,0.00007364409,0.000002488491],"category_scores_gemma":[0.00002038916,0.00008250337,0.00001707516,0.00008891154,0.00004184559,0.000004009537,0.0002325348,0.00008734202,8.509259e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004603114,"about_ca_system_score_gemma":0.000009977264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000429277,"about_ca_topic_score_gemma":0.000003303325,"domain_scores_codex":[0.9994931,0.0000204734,0.0001773932,0.0001596119,0.00003769299,0.0001117038],"domain_scores_gemma":[0.9996206,0.0000476705,0.00006009571,0.0002172546,0.00001784052,0.00003658485],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002885117,0.00004093743,0.1166043,0.0001372729,0.00003923402,2.349207e-7,0.0001499814,0.003739303,0.8005955,0.01931157,0.00003415116,0.05931866],"study_design_scores_gemma":[0.005087724,0.0009905151,0.3182599,0.000761566,0.00005001068,0.0001796084,0.001147218,0.3904756,0.2518659,0.005606187,0.02384741,0.001728335],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9900514,0.001072017,0.008316128,0.00005251998,0.00002191419,0.0001062895,5.56889e-7,0.00001669368,0.0003624339],"genre_scores_gemma":[0.9874727,0.0001843431,0.01223434,0.00004169146,0.00002349537,0.00000160565,0.00001830688,0.000006496984,0.00001705201],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5487296,"threshold_uncertainty_score":0.336439,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001374596","doi":"10.1007/s00200-006-0030-9","title":"Hyperelliptic curves with reduced automorphism group A 5","year":2006,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":8,"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":"Moduli; Mathematics; Automorphism group; Automorphism; Locus (genetics); Hyperelliptic curve; Genus; Moduli space; Group (periodic table); Pure mathematics; Polynomial; Combinatorics; Mathematical analysis; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01003561435807842,"gpt":0.2225480509610611,"spread":0.2125124366029826,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005342849,0.0001745184,0.0002506923,0.0001040738,0.000115221,0.00003605808,0.0002756909,0.00006359971,0.00001360915],"category_scores_gemma":[0.00004013443,0.0001697733,0.00002589651,0.0004175691,0.00005539326,0.00008882133,0.0001418358,0.0002844185,0.000005602504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000330219,"about_ca_system_score_gemma":0.000008062223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008590346,"about_ca_topic_score_gemma":0.000005930935,"domain_scores_codex":[0.9990357,0.0000528829,0.0003171678,0.0002136736,0.0001283771,0.0002522451],"domain_scores_gemma":[0.9986941,0.0006029175,0.00009800595,0.000532962,0.00002634188,0.0000456897],"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.00002391198,0.0003429879,0.002829552,0.0009664755,0.00005490745,0.000008086375,0.0003881719,0.003533458,0.003772114,0.9834279,0.0005300699,0.004122351],"study_design_scores_gemma":[0.005921467,0.0003102401,0.05060436,0.007429167,0.0002449458,0.0006232664,0.0009402467,0.3931382,0.007154773,0.5240279,0.006447182,0.003158171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.951951,0.002356293,0.04233668,0.0002504724,0.00002063011,0.0003384316,7.320543e-7,0.0003245462,0.002421215],"genre_scores_gemma":[0.9684625,0.0001126365,0.03115298,0.00009239073,0.00003035497,0.00003753664,0.00001573219,0.00003271797,0.00006319003],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4593999,"threshold_uncertainty_score":0.6923153,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976248130","doi":"10.1007/s00200-008-0058-0","title":"Maximal AMDS codes","year":2008,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; University of New Brunswick","funders":"","keywords":"Mathematics; Discrete mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.009820394412748035,"gpt":0.2038245864827604,"spread":0.1940041920700123,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003563529,0.0001199947,0.0001499614,0.000143,0.0002139886,0.00006405642,0.0007619893,0.00004654283,0.000002568633],"category_scores_gemma":[0.0000165757,0.0001349686,0.00003298303,0.0005337462,0.00005203272,0.0001905839,0.0004856635,0.0002217092,0.00000623346],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001636389,"about_ca_system_score_gemma":0.00001103686,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002571906,"about_ca_topic_score_gemma":0.000001505364,"domain_scores_codex":[0.9992055,0.00004306781,0.0002099132,0.0002226428,0.00009606843,0.0002227483],"domain_scores_gemma":[0.9989917,0.0002303575,0.00004628359,0.0006502991,0.00002207783,0.00005933148],"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.000004789394,0.0000841802,0.007110334,0.00003554758,0.00001703392,0.000007890582,0.001615716,0.009003418,0.001441846,0.9419191,0.00007206178,0.0386881],"study_design_scores_gemma":[0.0005291639,0.00004235594,0.02868083,0.00009352925,0.000003495486,0.0001356669,0.00006179553,0.9516287,0.001251966,0.01231345,0.004832929,0.0004261659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4005648,0.0007964188,0.596875,0.0001978556,0.00003128086,0.00009809677,2.188172e-7,0.0003150031,0.001121448],"genre_scores_gemma":[0.9270926,0.0001665166,0.07257595,0.0001181875,0.00001431064,0.00001363531,0.000002161029,0.000008567002,0.000008133509],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9426252,"threshold_uncertainty_score":0.5503858,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W395247565","doi":"10.1007/s002000050126","title":"Optimal Formally Self-Dual Codes over 𝔽 5 and 𝔽 7","year":2000,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Minimum weight; Dual (grammatical number); Construct (python library); Dimension (graph theory); Minimum distance; Mathematics; Linear code; Code (set theory); Computer science; Discrete mathematics; Block code; Combinatorics; Algorithm; Decoding methods","retraction":null,"screen_n_in":null,"score":{"opus":0.003958740976191346,"gpt":0.1971495810064651,"spread":0.1931908400302737,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004160027,0.0001277305,0.0001416881,0.00009666251,0.0001612537,0.0001665921,0.000425542,0.00005020929,0.000009281415],"category_scores_gemma":[0.00000510173,0.0001412927,0.00002327253,0.0003325865,0.00003131177,0.0002785826,0.0003314147,0.0002011718,0.000003260152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001236531,"about_ca_system_score_gemma":0.000007622493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001904175,"about_ca_topic_score_gemma":0.000001690127,"domain_scores_codex":[0.9992291,0.00003778511,0.0002024992,0.0002222735,0.00008405195,0.0002242991],"domain_scores_gemma":[0.9992126,0.0002034005,0.00003389563,0.0004718766,0.00001299394,0.00006519738],"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.00001470564,0.0001413127,0.003124087,0.00009385464,0.00004802688,0.000004569277,0.003840404,0.04015015,0.0008380562,0.6782209,0.0000522433,0.2734717],"study_design_scores_gemma":[0.0004094014,0.00003442767,0.009309385,0.0000589201,0.000004645405,0.00003414748,0.00003519461,0.9830698,0.0001965754,0.002269933,0.004340631,0.0002369066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8745496,0.0008555531,0.1229162,0.0001281994,0.00001473692,0.0001218032,3.767581e-7,0.0003439889,0.001069524],"genre_scores_gemma":[0.9007605,0.0002775834,0.09879852,0.0001206346,0.00001304846,0.00001148117,0.000002065949,0.000008312059,0.000007853421],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9429197,"threshold_uncertainty_score":0.5761748,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3021510930","doi":"10.1007/s00200-020-00431-1","title":"Boomerang uniformity of normalized permutation polynomials of low degree","year":2020,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Boomerang attack; Block cipher; Permutation (music); Differential cryptanalysis; Mathematics; Linear cryptanalysis; Degree (music); Finite field; Higher-order differential cryptanalysis; Differential (mechanical device); Combinatorics; Discrete mathematics; Algorithm; Cryptography; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.0139607045777781,"gpt":0.2148826019315071,"spread":0.200921897353729,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003948393,0.00009415739,0.0002162156,0.0001046844,0.00004913931,0.00002387621,0.0005894643,0.00004054509,0.000002282442],"category_scores_gemma":[0.00004010356,0.0001056475,0.00004346498,0.0005920977,0.00003694599,0.0001737751,0.000320097,0.0001302095,7.164349e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008428906,"about_ca_system_score_gemma":0.00001337522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002886786,"about_ca_topic_score_gemma":9.895439e-7,"domain_scores_codex":[0.9992168,0.00005351369,0.0003583828,0.0001496183,0.00009521176,0.0001264724],"domain_scores_gemma":[0.9991309,0.0002489603,0.0001474268,0.0003806946,0.00004134754,0.0000506486],"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.00005695054,0.0001739655,0.009641836,0.0008968426,0.00007157002,0.000001437792,0.01008232,0.06823466,0.08627503,0.6388118,0.00001911262,0.1857345],"study_design_scores_gemma":[0.0006850199,0.00005713279,0.009850461,0.0001522212,0.000006579991,0.000003532921,0.0001360367,0.9590493,0.02728457,0.002482608,0.0001026066,0.0001899647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5286713,0.0004038406,0.4702683,0.0001997827,0.00001222066,0.0001187285,7.525459e-7,0.00007061792,0.0002544513],"genre_scores_gemma":[0.9615052,0.00005355732,0.03835283,0.00006541391,0.000007684073,0.000005331464,0.000003171505,0.000006241999,6.043152e-7],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8908146,"threshold_uncertainty_score":0.4308179,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4308765265","doi":"10.1007/s002000050004","title":"Algorithms for Computing Sparse Shifts for Multivariate Polynomials","year":2000,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Bell (Canada)","funders":"National Science Foundation","keywords":"Multivariate statistics; Computer science; Mathematics; Algorithm; Combinatorics; Algebra over a field; Pure mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01805105939664032,"gpt":0.2598347592051651,"spread":0.2417836998085248,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007933427,0.0002402088,0.0003344986,0.0001495659,0.0003120339,0.0002309872,0.0008524432,0.00009558942,0.00000368444],"category_scores_gemma":[0.00005336048,0.0002724413,0.00008175508,0.0003744769,0.00003059536,0.0002865425,0.0002811013,0.000181244,0.000005630158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005786735,"about_ca_system_score_gemma":0.00003210432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000113637,"about_ca_topic_score_gemma":0.00000477181,"domain_scores_codex":[0.998345,0.00004710738,0.0005419304,0.0004791826,0.0001104177,0.0004763482],"domain_scores_gemma":[0.998056,0.001068821,0.0001279997,0.0005838291,0.00005492537,0.0001084209],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002214989,0.0001040387,0.00009443235,0.000106136,0.00003203057,6.029155e-7,0.001256275,0.1105162,0.001385563,0.0662979,0.0001166901,0.820068],"study_design_scores_gemma":[0.001224094,0.00004407128,0.002125862,0.00009766488,0.000006523228,0.000006001588,0.00002196923,0.9864659,0.0006113211,0.004322784,0.004758517,0.0003153365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1209892,0.0004461275,0.8765596,0.0006174529,0.0001019141,0.0008415336,0.000004334115,0.0003076772,0.000132177],"genre_scores_gemma":[0.6943653,0.0000277771,0.3051718,0.0001963016,0.00009148698,0.00007543167,0.00002145959,0.00002182159,0.00002858365],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8759497,"threshold_uncertainty_score":0.9999728,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983551238","doi":"10.1007/s00200-007-0044-y","title":"The trace spectra of polynomial bases for $${\\mathbb{F}}_{2^{n}}$$","year":2007,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"TRACE (psycholinguistics); Polynomial; Mathematics; Combinatorics; Basis (linear algebra); Spectral line; Physics; Mathematical analysis; Geometry; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.006822601516715925,"gpt":0.2261474540274668,"spread":0.2193248525107509,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001477569,0.00009696235,0.0001294227,0.00009416831,0.0002069981,0.00007123136,0.0007863613,0.00003836076,4.134279e-7],"category_scores_gemma":[0.0000484404,0.00008819743,0.00004866407,0.0003818477,0.00005102742,0.00009855222,0.0002185223,0.0001363559,4.066656e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001475501,"about_ca_system_score_gemma":0.00001105844,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001715474,"about_ca_topic_score_gemma":0.000008494663,"domain_scores_codex":[0.9991985,0.00002516724,0.0003012151,0.0001574857,0.00007967588,0.0002379639],"domain_scores_gemma":[0.9976382,0.001622246,0.00009021114,0.0005774734,0.00003149736,0.00004033104],"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.00002066119,0.00005314654,0.0004128826,0.00004550448,0.00001607831,3.500525e-7,0.0007775502,0.002372289,0.003902317,0.8351352,0.00006211501,0.1572019],"study_design_scores_gemma":[0.001270046,0.0001419949,0.01214634,0.0001827289,0.00001365288,0.00002240563,0.0005190001,0.9061069,0.02583377,0.02086431,0.03238575,0.0005130438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1237473,0.001293997,0.8739768,0.0002971889,0.00005104687,0.0002072472,4.700996e-7,0.00009749326,0.0003284379],"genre_scores_gemma":[0.9182327,0.00007592728,0.08159975,0.00004185783,0.00002403433,0.00001232336,9.378096e-7,0.000007734457,0.000004764359],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9037347,"threshold_uncertainty_score":0.3596587,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030112834","doi":"10.1007/s00200-005-0184-x","title":"On the bit security of the Diffie-Hellman key","year":2005,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Diffie–Hellman key exchange; Prime (order theory); Mathematics; Function (biology); Elliptic curve; Bit (key); Discrete mathematics; Key (lock); Finite field; Arithmetic; Theoretical computer science; Computer science; Key exchange; Combinatorics; Public-key cryptography; Computer security; Pure mathematics; Encryption","retraction":null,"screen_n_in":null,"score":{"opus":0.005165420690599298,"gpt":0.1935482100278562,"spread":0.1883827893372569,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004915097,0.000103506,0.000115283,0.00005833301,0.0001719182,0.0000650359,0.001404347,0.00004100955,0.000003019057],"category_scores_gemma":[0.00003909711,0.0000724139,0.00004415516,0.0005393394,0.00005677356,0.0001141449,0.0007749175,0.0003221004,0.000002594635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001525901,"about_ca_system_score_gemma":0.000008561762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004037857,"about_ca_topic_score_gemma":0.00001824847,"domain_scores_codex":[0.999241,0.00006739537,0.0002263728,0.0001696876,0.0001348402,0.0001606833],"domain_scores_gemma":[0.9980879,0.000549968,0.00008260521,0.001229004,0.00002076102,0.00002974236],"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.000001209354,0.00006038028,0.0005096375,0.0000151471,0.000006200347,6.602944e-8,0.001178905,0.005574223,0.0002578335,0.9851907,0.0001117389,0.007093925],"study_design_scores_gemma":[0.0002740248,0.00001655645,0.009672046,0.0001197438,0.000003704179,0.000004541653,0.00007326214,0.9537904,0.002600158,0.02504684,0.008221545,0.0001771645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8303578,0.0009019484,0.1633809,0.003601055,0.00005013025,0.0003172155,0.00000227598,0.0001224095,0.001266232],"genre_scores_gemma":[0.9920663,0.00007556854,0.007485941,0.0003378125,0.00001560916,0.00001074875,0.000001536686,0.000005405525,0.000001090246],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9601439,"threshold_uncertainty_score":0.2952953,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2914313791","doi":"10.1007/s00200-019-00382-2","title":"Fixed points of rational functions satisfying the Carlitz property","year":2019,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Advanced Differential Equations and Dynamical Systems","field":"Mathematics","cited_by":4,"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":"Mathematics; Property (philosophy); Rational function; Pure mathematics; Algebra over a field; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.0156801884358921,"gpt":0.2466759624374071,"spread":0.230995774001515,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003239858,0.00008469088,0.0001608503,0.00004587346,0.00009128325,0.00002411139,0.0001716297,0.00003846593,0.00001557248],"category_scores_gemma":[0.00008345314,0.00005779638,0.0000282703,0.0001984735,0.00002422068,0.00006589459,0.0001314546,0.0001574296,0.000004787621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002742808,"about_ca_system_score_gemma":0.00001079028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008960013,"about_ca_topic_score_gemma":0.00001454485,"domain_scores_codex":[0.9992903,0.0000477499,0.0003243022,0.000116304,0.000108172,0.000113138],"domain_scores_gemma":[0.9987548,0.0006833547,0.0001027863,0.0003918565,0.0000446105,0.00002257478],"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.00001331388,0.0001485224,0.01539242,0.000393421,0.00005906695,1.431378e-7,0.001330566,0.05882741,0.01031544,0.8950064,0.00005972759,0.01845364],"study_design_scores_gemma":[0.0004741464,0.00001792188,0.007192155,0.0002001065,0.00001104942,0.000004065703,0.0003960109,0.9752515,0.000204071,0.01547834,0.0006173886,0.0001532448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6454075,0.0001555239,0.3529195,0.0002175939,0.00004147896,0.0004512875,0.000001866828,0.00005412582,0.0007510663],"genre_scores_gemma":[0.9836205,0.00001046474,0.01619111,0.0000181265,0.00001283869,0.00003031987,0.00001093261,0.00001166816,0.00009403086],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9164241,"threshold_uncertainty_score":0.2356868,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978143507","doi":"10.1007/s00200-008-0067-z","title":"Highly nonlinear balanced S-boxes with improved bound on unrestricted and generalized nonlinearity","year":2008,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Nonlinear system; Upper and lower bounds; Bounded function; Mathematics; Class (philosophy); Combinatorics; Algebraic number; Degree (music); Discrete mathematics; Mathematical analysis; Physics; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.00833267848137081,"gpt":0.2079908130257003,"spread":0.1996581345443295,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002695667,0.0001826622,0.0002254786,0.0001596246,0.000277552,0.000108034,0.0005013758,0.00006393905,7.319343e-7],"category_scores_gemma":[0.00002095457,0.0001746852,0.00002360973,0.0006241493,0.0000803787,0.0001557708,0.0003076773,0.0002996575,0.00000104881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001909154,"about_ca_system_score_gemma":0.00002094057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007350877,"about_ca_topic_score_gemma":0.000007724581,"domain_scores_codex":[0.9990178,0.00005920164,0.0002327611,0.0003305722,0.0001116193,0.0002479836],"domain_scores_gemma":[0.9988161,0.0003107671,0.00007680894,0.0006730256,0.00003885618,0.0000844509],"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.0003067043,0.001023331,0.0389112,0.0002930826,0.0002355891,0.00004616388,0.004508843,0.05007898,0.02840258,0.7848924,0.00008988762,0.09121121],"study_design_scores_gemma":[0.001099212,0.0001239511,0.0210945,0.0000820002,0.000004859819,0.00004336335,0.00001744611,0.9743171,0.001172777,0.00096894,0.0007768465,0.0002989792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8504028,0.0004815646,0.1482543,0.0002334566,0.00002302314,0.0001933667,9.833449e-7,0.0002596907,0.000150791],"genre_scores_gemma":[0.8606017,0.0002436941,0.1389299,0.0001603896,0.00002112314,0.00001749747,0.000007733607,0.00001273543,0.000005267401],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9242381,"threshold_uncertainty_score":0.7123457,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4395695590","doi":"10.1007/s00200-024-00655-5","title":"Sparse polynomial interpolation: faster strategies over finite fields","year":2024,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Pacific Institute for the Mathematical Sciences; Simon Fraser University","funders":"","keywords":"Monomial; Interpolation (computer graphics); Focus (optics); Monomial basis; Polynomial; Mathematics; Finite field; Field (mathematics); Polynomial interpolation; Degree (music); Combinatorics; Polynomial basis; Basis (linear algebra); Discrete mathematics; Algebra over a field; Pure mathematics; Computer science; Mathematical analysis; Linear interpolation; Geometry; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.009363980997397995,"gpt":0.2331480155912325,"spread":0.2237840345938345,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002682189,0.0001580522,0.0001535713,0.0001981323,0.00008993856,0.0006330668,0.000515477,0.00007453791,0.000009902515],"category_scores_gemma":[0.00001364391,0.0001667002,0.00004036428,0.0004554979,0.00002546132,0.0006212089,0.000483172,0.0003147012,0.0000158441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003370685,"about_ca_system_score_gemma":0.00004043062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008720189,"about_ca_topic_score_gemma":0.00001246979,"domain_scores_codex":[0.9990157,0.00003591452,0.0003101233,0.0003027866,0.0001076162,0.0002278958],"domain_scores_gemma":[0.999037,0.000419667,0.00004100315,0.0004268461,0.00001695496,0.0000585427],"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.00001043351,0.00007836978,0.0006851933,0.0002691866,0.00006274531,0.00001722824,0.006027916,0.1350954,0.002017496,0.5450457,0.0008585038,0.3098318],"study_design_scores_gemma":[0.0001668403,0.00001740793,0.0021568,0.0001572109,0.000002981477,0.00001111603,0.00005929099,0.9901908,0.0001096501,0.003377296,0.003565095,0.0001855195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1186296,0.001424467,0.8773307,0.000804725,0.0002203912,0.0001408387,6.738227e-7,0.0003989274,0.001049652],"genre_scores_gemma":[0.981097,0.00005132379,0.01853285,0.0001629255,0.00008665997,0.00001508784,0.000007407752,0.00001295128,0.00003382245],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8624673,"threshold_uncertainty_score":0.6797836,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2989341942","doi":"10.1007/s00200-020-00426-y","title":"A nonexistence certificate for projective planes of order ten with weight 15 codewords","year":2020,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University; Carleton University; University of Waterloo","funders":"","keywords":"Satisfiability; Certificate; Symbolic computation; Simple (philosophy); Projective test; Projective plane; Computation; Theory of computation","retraction":null,"screen_n_in":null,"score":{"opus":0.03974349600337897,"gpt":0.2590012909516102,"spread":0.2192577949482312,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003839345,0.0001321038,0.0002158238,0.00007540187,0.00007952803,0.00005063373,0.000761944,0.00005161376,6.054314e-7],"category_scores_gemma":[0.00008491985,0.0001251014,0.00001857703,0.0006941476,0.00005066902,0.0001859447,0.0002499797,0.000173131,0.000001003317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002136972,"about_ca_system_score_gemma":0.00002971025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002982896,"about_ca_topic_score_gemma":0.000001943604,"domain_scores_codex":[0.9990536,0.00004437742,0.0003106369,0.0002878619,0.0001163626,0.000187186],"domain_scores_gemma":[0.9988865,0.0002741614,0.0001533899,0.0005261628,0.0001038921,0.00005587397],"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.0001626361,0.0002130522,0.004110266,0.001092542,0.0001002703,0.000001745239,0.01453961,0.1046824,0.01366399,0.7820197,0.00006648369,0.07934726],"study_design_scores_gemma":[0.0003722765,0.00008907418,0.001791474,0.00008724197,0.000005317499,0.000006084674,0.000116975,0.9897149,0.006435539,0.0004054279,0.0008114965,0.0001642111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02465208,0.0002302122,0.9736151,0.0005837146,0.00001752029,0.0005150382,0.000001797441,0.0001388757,0.0002456734],"genre_scores_gemma":[0.5233744,0.00002053425,0.4764628,0.00006160944,0.000008692071,0.00005749696,0.000004203457,0.000008550225,0.000001713178],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8850325,"threshold_uncertainty_score":0.5101488,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4393115041","doi":"10.1007/s00200-024-00649-3","title":"New cyclic groups based on the generalized order-k Pell sequences in the Heisenberg group and their application in cryptography","year":2024,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Heisenberg group; Group (periodic table); Cyclic group; Order (exchange); Cryptography; Mathematics; Algebra over a field; Discrete mathematics; Pure mathematics; Theoretical computer science; Computer science; Physics; Algorithm; Quantum mechanics; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.007053071388454554,"gpt":0.2278223220556041,"spread":0.2207692506671495,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004771015,0.0001526416,0.0001524059,0.00009197916,0.0001106318,0.0001187731,0.0003184134,0.00003229398,0.00000703022],"category_scores_gemma":[0.000007187025,0.000101415,0.00003089736,0.0008017152,0.00005060295,0.00006560647,0.00008303463,0.000327903,0.000002045733],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001507971,"about_ca_system_score_gemma":0.00001046115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002371799,"about_ca_topic_score_gemma":0.00002241575,"domain_scores_codex":[0.9992015,0.00006421968,0.0002614657,0.0002226201,0.00006959277,0.0001805561],"domain_scores_gemma":[0.9983608,0.001125427,0.00004186381,0.0004330777,0.000007740086,0.00003110681],"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.000002318372,0.00003972469,0.0006843007,0.00002584304,0.000005249713,1.07046e-7,0.0006460283,0.01518872,0.000371402,0.9609213,0.0000121294,0.02210286],"study_design_scores_gemma":[0.0002375178,0.00001020629,0.0009410938,0.0001411808,0.000003964523,8.046213e-7,0.0008654217,0.741257,0.0001087715,0.2535931,0.002696073,0.0001448927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1992142,0.0009019108,0.7959445,0.002072431,0.00001395588,0.0006462824,0.000002568872,0.00005982959,0.001144269],"genre_scores_gemma":[0.9885799,0.00006724329,0.01087672,0.0001554638,0.00003848596,0.0002440615,0.00001945533,0.00001557746,0.000003115795],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7893656,"threshold_uncertainty_score":0.4135585,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4321437526","doi":"10.1007/s00200-023-00597-4","title":"Algebraic and SAT models for SCA generation","year":2023,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Ubiquitin and proteasome pathways","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Solver; Pairwise comparison; Algebraic number; Scalability; Gröbner basis; Variety (cybernetics); Computation; Computer science; Sequence (biology); Symbolic computation; Polynomial; Boolean satisfiability problem; Basis (linear algebra); Mathematics; Theoretical computer science; Algorithm; Artificial intelligence; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02024596758706582,"gpt":0.2415058145373675,"spread":0.2212598469503017,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003159199,0.00009137824,0.00009165772,0.00005825351,0.000103819,0.00003668621,0.0001122887,0.00007249015,5.655896e-7],"category_scores_gemma":[0.00002519953,0.0001052462,0.00001805563,0.0001226255,0.00001953054,0.000007076581,0.0001829235,0.00006768308,0.000001438362],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006118047,"about_ca_system_score_gemma":0.000008608099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001006633,"about_ca_topic_score_gemma":0.000005737703,"domain_scores_codex":[0.9994465,0.00001893012,0.0001443534,0.0001919645,0.00003924324,0.0001590159],"domain_scores_gemma":[0.9996185,0.00004625318,0.00003090327,0.0002441369,0.00002166376,0.00003858198],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002429008,0.00004259919,0.001251152,0.000251917,0.00005238219,5.371341e-7,0.0006783892,0.1151324,0.7800531,0.03927049,0.0007653362,0.06247746],"study_design_scores_gemma":[0.0004055742,0.00003674304,0.000702095,0.0000288849,0.000004623723,0.000005063289,0.00004723388,0.9650036,0.02910597,0.001391546,0.003105837,0.000162863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9245108,0.001937808,0.07284305,0.000165952,0.00002224035,0.0003282379,0.000003806929,0.00006267743,0.0001253889],"genre_scores_gemma":[0.9905059,0.0004748711,0.00851506,0.00009508735,0.00006199552,0.00009261322,0.0002065522,0.00001900451,0.00002890592],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8498712,"threshold_uncertainty_score":0.4291816,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4377094810","doi":"10.1007/s00200-023-00608-4","title":"MWS and FWS codes for coordinate-wise weight functions","year":2023,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mathematics; Combinatorics; Hamming code; Upper and lower bounds; Code (set theory); Hamming weight; Hamming distance; Linear code; Discrete mathematics; Weight function; Set (abstract data type); Block code; Algorithm; Statistics; Computer science; Decoding methods; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.009493921149859972,"gpt":0.2231626414672672,"spread":0.2136687203174073,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006009733,0.0001186491,0.0001511915,0.0002170889,0.0002659115,0.0001312016,0.0004329521,0.00004950572,0.000001090012],"category_scores_gemma":[0.0000312899,0.0001309621,0.00003186191,0.0007745683,0.00003777568,0.0001602855,0.0004468542,0.000146426,0.000004480011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001224357,"about_ca_system_score_gemma":0.000007801915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001376215,"about_ca_topic_score_gemma":0.0000035785,"domain_scores_codex":[0.9992246,0.0000326117,0.0001967408,0.0002510056,0.00006188211,0.0002331325],"domain_scores_gemma":[0.9987478,0.0006287652,0.00004501626,0.0004887768,0.00002937622,0.00006027463],"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.000007493795,0.00004337278,0.002579772,0.0001141428,0.00002846799,9.71183e-7,0.0008601893,0.008626607,0.001439914,0.8877354,0.0004532196,0.09811046],"study_design_scores_gemma":[0.0004358379,0.00003141134,0.005365145,0.00007253847,0.000006210336,0.000007212618,0.0001021076,0.9615546,0.0002603236,0.01772507,0.01422378,0.0002157267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1936503,0.0007612529,0.8035695,0.0007447261,0.0000739693,0.000287567,0.000002080876,0.0005855385,0.000325055],"genre_scores_gemma":[0.97544,0.0001825274,0.0241384,0.00007605825,0.00002013809,0.0000840272,0.00001227723,0.00001237264,0.00003415469],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.952928,"threshold_uncertainty_score":0.534048,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4390973014","doi":"10.1007/s00200-023-00642-2","title":"On the classification of non-exceptional APN functions","year":2024,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Medicine","retraction":null,"screen_n_in":null,"score":{"opus":0.01075947073421124,"gpt":0.2243018309213886,"spread":0.2135423601871773,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005509692,0.00008139031,0.00008098106,0.000154201,0.0001156109,0.00009859955,0.0004918445,0.00003436513,0.000006484835],"category_scores_gemma":[0.00001925858,0.00006908122,0.0000371451,0.000680741,0.00003924572,0.0001088472,0.0001754671,0.0002248259,0.00001012288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001685663,"about_ca_system_score_gemma":0.00001284765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006981808,"about_ca_topic_score_gemma":8.222179e-7,"domain_scores_codex":[0.999396,0.00003806802,0.0001878894,0.0001723551,0.00009828481,0.0001073869],"domain_scores_gemma":[0.9985948,0.0007961918,0.00003463445,0.0005299601,0.00002184056,0.00002262376],"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.000001244299,0.00002324742,0.00008737997,0.00002568768,0.000009515974,1.459399e-7,0.0003103669,0.005694929,0.002269062,0.9560845,0.00009079169,0.03540311],"study_design_scores_gemma":[0.00006473393,0.00002012957,0.0107312,0.0001454812,0.000003058576,0.000003585355,0.00006106954,0.967128,0.0002030768,0.02037018,0.001183678,0.00008583739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1699496,0.000393669,0.8263856,0.001013112,0.00006989978,0.0001289162,6.907764e-7,0.0001530413,0.001905499],"genre_scores_gemma":[0.9946207,0.00003458998,0.005213438,0.00006556953,0.00001615151,0.00002885015,0.000003848043,0.000006561434,0.00001024264],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9614331,"threshold_uncertainty_score":0.2817051,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385296592","doi":"10.1007/s00200-023-00614-6","title":"Linear label code of a root lattice using Gröbner bases","year":2023,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lambda; Lattice (music); Mathematics; Quotient; Binomial coefficient; Combinatorics; Discrete mathematics; Physics; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.02511286486479027,"gpt":0.2667025432007845,"spread":0.2415896783359942,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007082429,0.0001133767,0.0001769893,0.0002436173,0.0001107025,0.00004532321,0.0006645501,0.00004724869,0.000001489581],"category_scores_gemma":[0.0000436867,0.0001275481,0.00003138605,0.001332319,0.00003649367,0.0001537761,0.0006322612,0.0001760237,0.000003725912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001359523,"about_ca_system_score_gemma":0.00001366845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004457141,"about_ca_topic_score_gemma":0.000004545152,"domain_scores_codex":[0.9991314,0.0000602502,0.0002754802,0.0002071546,0.0001091629,0.0002164849],"domain_scores_gemma":[0.9986697,0.0005246403,0.00008107914,0.0006405174,0.00003791709,0.00004608944],"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.00001034947,0.0001511691,0.007859847,0.0002601999,0.00004919797,0.000005099363,0.001657282,0.1747109,0.0178287,0.7537873,0.00003256543,0.04364739],"study_design_scores_gemma":[0.000246434,0.00001509687,0.002499001,0.0001261178,0.000004501276,0.000005533164,0.00004269596,0.9912647,0.001462706,0.003758947,0.0004365304,0.0001377232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6696146,0.000307765,0.3293996,0.0001189816,0.00003182404,0.00009962431,9.191074e-7,0.0002744118,0.0001522251],"genre_scores_gemma":[0.9084117,0.00004544783,0.09145935,0.0000439437,0.00001240989,0.000007386782,0.000003379424,0.00001161191,0.000004708349],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8165538,"threshold_uncertainty_score":0.5201261,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078476935","doi":"10.1007/s00200-014-0219-2","title":"VSH and multiplicative modular relations between small primes with polynomial exponents","year":2014,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Multiplicative function; Mathematics; Combinatorics; Polynomial; Prime (order theory); Order (exchange); Multiplicative number theory; Discrete mathematics; Hash function; Prime factor; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.007021612000770943,"gpt":0.191208816233149,"spread":0.184187204232378,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004791324,0.0001423278,0.0001762567,0.0001400881,0.0002026994,0.0001106864,0.0005055498,0.00005564525,5.161882e-7],"category_scores_gemma":[0.00002615661,0.0001449944,0.00001816541,0.0003618144,0.00005725394,0.0001636298,0.0004389074,0.0002331521,0.000001888062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000164527,"about_ca_system_score_gemma":0.000009382322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003457194,"about_ca_topic_score_gemma":0.000003471049,"domain_scores_codex":[0.9991419,0.00008180205,0.0002102261,0.0002926044,0.00007610267,0.0001973829],"domain_scores_gemma":[0.9986666,0.0005234953,0.00008064407,0.0006269796,0.00002631437,0.00007594388],"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.00002067182,0.000144656,0.1779794,0.0001031846,0.0001096269,0.000001004826,0.005411731,0.02479098,0.003673109,0.607671,0.00002133083,0.1800733],"study_design_scores_gemma":[0.0009630834,0.00008213088,0.2273525,0.0001810713,0.00001434552,0.000009018471,0.00007810065,0.7634701,0.001105308,0.004721546,0.00160207,0.0004207373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.49151,0.0001853358,0.507663,0.0001588094,0.000006713745,0.0001250818,3.003532e-7,0.0001231218,0.0002275949],"genre_scores_gemma":[0.883156,0.00001726544,0.1167211,0.00004191155,0.00001821422,0.00002468593,0.000004569069,0.00001116088,0.000005087007],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7386792,"threshold_uncertainty_score":0.5912698,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3092499131","doi":"10.1007/s00200-020-00467-3","title":"On the stability of periodic binary sequences with zone restriction","year":2020,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"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; China Scholarship Council","keywords":"Algorithm; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01450020622714313,"gpt":0.1999279193647825,"spread":0.1854277131376394,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003926372,0.00008499,0.0001118658,0.00005000702,0.000121337,0.00004981226,0.0005721107,0.00002468419,0.000002433615],"category_scores_gemma":[0.00003256523,0.00006503192,0.00001969079,0.0006808454,0.00006443704,0.00009771995,0.0002157007,0.0002039721,8.528862e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001061273,"about_ca_system_score_gemma":0.00001345069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002418349,"about_ca_topic_score_gemma":0.000001033087,"domain_scores_codex":[0.9993665,0.00007770652,0.000169601,0.0001743151,0.0001032932,0.0001085822],"domain_scores_gemma":[0.9988907,0.000503493,0.00007083535,0.000475502,0.00002355908,0.00003588693],"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.00002383147,0.00005847656,0.002771574,0.00006566036,0.00001470757,9.276956e-7,0.002618219,0.02994529,0.005301348,0.9512841,0.00001039577,0.007905474],"study_design_scores_gemma":[0.0002889473,0.0002650927,0.007304902,0.0001368246,0.000004957095,0.000003842872,0.0004281395,0.9824467,0.003963347,0.004719959,0.0002446094,0.0001926977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6976987,0.0001873169,0.3003742,0.001357009,0.000007730754,0.000122456,3.058922e-7,0.00008690979,0.0001654447],"genre_scores_gemma":[0.9893367,0.00004818103,0.01042193,0.0001689045,0.000006043882,0.00001252047,9.650093e-7,0.000004508232,2.454039e-7],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9525014,"threshold_uncertainty_score":0.2651925,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}