{"meta":{"query_hash":"9dff181ab68f","filters":{"venue":"Applicable Algebra in Engineering Communication and Computing"},"cohort_total":29,"direct_labels_cover":0,"predictions_cover":29,"exported":29,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/9dff181ab68f","api":"https://metacan.xera.ac/api/v1/cohort?venue=Applicable+Algebra+in+Engineering+Communication+and+Computing"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005864888415478002,"score_gpt":0.222129005381761,"score_spread":0.216264116966283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1760096751","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92304045,0.0007011488,0.07542243,0.00007669683,0.00004813806,0.0004142293,0.0000030772287,0.000052455518,0.00024139673],"genre_scores_gemma":[0.95820093,0.00010459464,0.041385766,0.000098718694,0.00007572564,0.000027447384,0.000077043136,0.000020788233,0.000008968605],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988177,0.000047676822,0.00045883527,0.00030584095,0.00007744122,0.00029254745],"domain_scores_gemma":[0.9990753,0.00020257065,0.00018140298,0.00039601568,0.00008293645,0.00006180296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036896125,0.00018885508,0.00027625848,0.000070239774,0.00013181663,0.0000511094,0.00031684345,0.00015592486,0.000004817416],"category_scores_gemma":[0.0000862829,0.00018827974,0.000069965914,0.00017086726,0.000089912646,0.000011774681,0.00037087267,0.00015744325,0.0000017465143],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031532512,0.00015821414,0.01908369,0.00037112107,0.000096021286,3.3233005e-7,0.00024796303,0.013000488,0.87187433,0.01693973,0.00018950735,0.078007035],"study_design_scores_gemma":[0.0023597975,0.00035773762,0.05248215,0.00044993294,0.00003847273,0.000047165107,0.00058688293,0.7893831,0.14435351,0.0029097823,0.005987165,0.0010442612],"about_ca_topic_score_codex":0.000062037005,"about_ca_topic_score_gemma":0.0000034732927,"teacher_disagreement_score":0.7763826,"about_ca_system_score_codex":0.000016091833,"about_ca_system_score_gemma":0.000013484566,"threshold_uncertainty_score":0.76778245},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of New Brunswick","funders":"","keywords":"Mathematics; Discrete mathematics; Combinatorics","score_opus":0.009820394412748035,"score_gpt":0.20382458648276036,"score_spread":0.19400419207001232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976248130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40056476,0.0007964188,0.59687495,0.00019785562,0.000031280862,0.000098096774,2.1881716e-7,0.00031500307,0.0011214484],"genre_scores_gemma":[0.92709255,0.0001665166,0.07257595,0.00011818752,0.00001431064,0.000013635314,0.0000021610294,0.000008567002,0.000008133509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992055,0.000043067812,0.00020991321,0.00022264285,0.000096068434,0.00022274829],"domain_scores_gemma":[0.99899167,0.00023035752,0.000046283592,0.0006502991,0.000022077827,0.00005933148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035635292,0.00011999473,0.00014996143,0.00014300003,0.0002139886,0.000064056425,0.00076198933,0.00004654283,0.0000025686331],"category_scores_gemma":[0.000016575697,0.00013496856,0.000032983025,0.0005337462,0.00005203272,0.00019058387,0.0004856635,0.00022170918,0.00000623346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004789394,0.000084180196,0.0071103335,0.00003554758,0.000017033924,0.000007890582,0.0016157156,0.0090034185,0.0014418458,0.9419191,0.00007206178,0.038688105],"study_design_scores_gemma":[0.0005291639,0.00004235594,0.028680827,0.00009352925,0.0000034954858,0.00013566687,0.00006179553,0.9516287,0.0012519655,0.012313446,0.004832929,0.00042616593],"about_ca_topic_score_codex":0.00002571906,"about_ca_topic_score_gemma":0.0000015053639,"teacher_disagreement_score":0.9426252,"about_ca_system_score_codex":0.00001636389,"about_ca_system_score_gemma":0.000011036856,"threshold_uncertainty_score":0.55038583},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.00833267848137081,"score_gpt":0.20799081302570027,"score_spread":0.19965813454432946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978143507","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8504028,0.00048156458,0.14825435,0.0002334566,0.000023023136,0.00019336668,9.833449e-7,0.00025969066,0.00015079105],"genre_scores_gemma":[0.86060166,0.00024369413,0.13892989,0.00016038964,0.000021123144,0.000017497472,0.000007733607,0.000012735432,0.000005267401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901783,0.000059201644,0.00023276106,0.0003305722,0.000111619345,0.00024798364],"domain_scores_gemma":[0.9988161,0.00031076706,0.000076808945,0.0006730256,0.000038856182,0.000084450905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026956675,0.00018266217,0.00022547862,0.00015962461,0.00027755203,0.000108034044,0.0005013758,0.00006393905,7.3193434e-7],"category_scores_gemma":[0.000020954565,0.00017468522,0.000023609733,0.00062414934,0.0000803787,0.00015577082,0.0003076773,0.00029965746,0.00000104881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003067043,0.0010233306,0.0389112,0.00029308256,0.00023558909,0.00004616388,0.004508843,0.050078977,0.028402582,0.78489244,0.000089887624,0.09121121],"study_design_scores_gemma":[0.0010992116,0.00012395106,0.021094503,0.000082000195,0.0000048598195,0.000043363347,0.000017446106,0.97431713,0.0011727773,0.00096894,0.0007768465,0.0002989792],"about_ca_topic_score_codex":0.00007350877,"about_ca_topic_score_gemma":0.000007724581,"teacher_disagreement_score":0.92423815,"about_ca_system_score_codex":0.00001909154,"about_ca_system_score_gemma":0.00002094057,"threshold_uncertainty_score":0.71234566},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0068226015167159254,"score_gpt":0.2261474540274668,"score_spread":0.21932485251075087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983551238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123747304,0.0012939967,0.8739768,0.00029718888,0.00005104687,0.0002072472,4.7009962e-7,0.000097493255,0.00032843792],"genre_scores_gemma":[0.9182327,0.00007592728,0.08159975,0.000041857827,0.000024034332,0.000012323364,9.378096e-7,0.000007734457,0.0000047643593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991985,0.000025167243,0.0003012151,0.00015748572,0.00007967588,0.00023796393],"domain_scores_gemma":[0.9976382,0.0016222458,0.000090211135,0.00057747343,0.00003149736,0.000040331044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014775686,0.00009696235,0.00012942265,0.00009416831,0.00020699813,0.00007123136,0.00078636134,0.00003836076,4.1342787e-7],"category_scores_gemma":[0.000048440404,0.000088197434,0.000048664075,0.00038184773,0.000051027422,0.00009855222,0.00021852231,0.00013635587,4.0666558e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020661191,0.000053146545,0.00041288257,0.00004550448,0.00001607831,3.5005255e-7,0.00077755016,0.0023722886,0.0039023166,0.83513516,0.00006211501,0.15720192],"study_design_scores_gemma":[0.0012700463,0.00014199488,0.012146342,0.00018272894,0.000013652879,0.000022405633,0.00051900005,0.90610695,0.025833774,0.020864312,0.03238575,0.0005130438],"about_ca_topic_score_codex":0.00001715474,"about_ca_topic_score_gemma":0.000008494663,"teacher_disagreement_score":0.9037347,"about_ca_system_score_codex":0.000014755011,"about_ca_system_score_gemma":0.000011058438,"threshold_uncertainty_score":0.3596587},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.029544496877219873,"score_gpt":0.2622690116094465,"score_spread":0.2327245147322266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990568802","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5621213,0.002709478,0.43301314,0.00082791015,0.00021998989,0.0004502663,2.745204e-7,0.00021574255,0.0004419389],"genre_scores_gemma":[0.9334677,0.00003515082,0.06626526,0.00013279817,0.000030984873,0.000044164277,0.0000060339025,0.00000962579,0.0000082918905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989493,0.00009418124,0.00031716056,0.00018429343,0.00013775505,0.00031732247],"domain_scores_gemma":[0.9991093,0.00023710229,0.000068862726,0.00047112815,0.000030383517,0.00008320062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010844448,0.00013121552,0.00015501976,0.00019480767,0.00008333611,0.00006610925,0.00039925196,0.000057900674,0.000005976768],"category_scores_gemma":[0.000037433467,0.00014356236,0.000022418511,0.00054780894,0.000016636892,0.00045540908,0.00046052164,0.00022744546,0.000011307555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008585695,0.00090254226,0.035118867,0.00011052059,0.000035640594,0.0000020312748,0.010574087,0.20809418,0.012902628,0.35826993,0.0001203154,0.3738607],"study_design_scores_gemma":[0.0005128917,0.0000061862193,0.09557949,0.00005880452,0.0000025871507,0.0000044005287,0.00004139198,0.9021831,0.00022894861,0.0008667592,0.00035284448,0.00016256726],"about_ca_topic_score_codex":0.000090622845,"about_ca_topic_score_gemma":0.000008920408,"teacher_disagreement_score":0.69408894,"about_ca_system_score_codex":0.00009715721,"about_ca_system_score_gemma":0.000017654405,"threshold_uncertainty_score":0.5854303},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010035614358078423,"score_gpt":0.22254805096106106,"score_spread":0.21251243660298264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001374596","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.951951,0.0023562927,0.042336676,0.00025047237,0.000020630107,0.0003384316,7.320543e-7,0.00032454618,0.002421215],"genre_scores_gemma":[0.96846247,0.000112636524,0.031152982,0.00009239073,0.000030354973,0.00003753664,0.000015732192,0.000032717966,0.00006319003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903566,0.000052882904,0.00031716784,0.00021367363,0.00012837713,0.00025224514],"domain_scores_gemma":[0.99869406,0.0006029175,0.00009800595,0.000532962,0.000026341882,0.000045689696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005342849,0.00017451835,0.00025069228,0.000104073835,0.000115220995,0.00003605808,0.00027569087,0.000063599706,0.000013609154],"category_scores_gemma":[0.000040134426,0.00016977327,0.000025896514,0.0004175691,0.000055393262,0.00008882133,0.00014183576,0.00028441846,0.0000056025037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023911984,0.00034298786,0.0028295524,0.0009664755,0.000054907447,0.000008086375,0.00038817193,0.003533458,0.0037721142,0.98342794,0.00053006987,0.0041223513],"study_design_scores_gemma":[0.0059214667,0.00031024005,0.05060436,0.007429167,0.00024494584,0.0006232664,0.0009402467,0.3931382,0.0071547735,0.52402794,0.0064471816,0.003158171],"about_ca_topic_score_codex":0.00008590346,"about_ca_topic_score_gemma":0.0000059309355,"teacher_disagreement_score":0.45939994,"about_ca_system_score_codex":0.0000330219,"about_ca_system_score_gemma":0.000008062223,"threshold_uncertainty_score":0.6923153},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011929259732617716,"score_gpt":0.2280390128712923,"score_spread":0.2161097531386746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021947009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051818952,0.00050916953,0.9321057,0.0008773174,0.00006542901,0.009640314,0.0000020102784,0.00040301232,0.0045781],"genre_scores_gemma":[0.9621374,0.000010356311,0.033648904,0.00019171619,0.000028216607,0.003958322,0.0000022570966,0.000017802744,0.0000050417843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998511,0.00018607847,0.00042412733,0.0002516995,0.00024411612,0.00038298787],"domain_scores_gemma":[0.99717796,0.0012258942,0.00019817028,0.0012654457,0.000043679236,0.000088865134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017925767,0.0002182183,0.00028451768,0.00028938154,0.00021847553,0.00010039336,0.0011424772,0.00006809124,0.000025944986],"category_scores_gemma":[0.000070309194,0.00018549987,0.00009861311,0.0010069975,0.00008183702,0.00023026207,0.00051732874,0.00031756377,0.0000055524442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017944045,0.00028698024,0.0022055737,0.00019070234,0.00004891635,8.2450896e-7,0.0021162233,0.017285207,0.0019926757,0.9496744,0.000042132557,0.026138408],"study_design_scores_gemma":[0.0006047282,0.00005021723,0.0026168241,0.00025219476,0.000014657785,0.000005643137,0.000092847215,0.9853021,0.00427097,0.0027777134,0.0037258037,0.00028629886],"about_ca_topic_score_codex":0.000029268254,"about_ca_topic_score_gemma":0.0000015082085,"teacher_disagreement_score":0.9680169,"about_ca_system_score_codex":0.00003293309,"about_ca_system_score_gemma":0.000015256457,"threshold_uncertainty_score":0.75644654},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005165420690599298,"score_gpt":0.19354821002785624,"score_spread":0.18838278933725694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030112834","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83035785,0.0009019484,0.16338088,0.0036010547,0.000050130246,0.00031721545,0.0000022759805,0.00012240949,0.0012662321],"genre_scores_gemma":[0.99206626,0.00007556854,0.007485941,0.0003378125,0.000015609161,0.000010748752,0.0000015366865,0.0000054055254,0.0000010902461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999241,0.00006739537,0.00022637281,0.00016968757,0.00013484017,0.00016068334],"domain_scores_gemma":[0.99808794,0.00054996804,0.00008260521,0.0012290039,0.000020761023,0.000029742358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004915097,0.000103506,0.000115283045,0.000058333007,0.00017191825,0.0000650359,0.0014043471,0.000041009553,0.000003019057],"category_scores_gemma":[0.00003909711,0.0000724139,0.000044155164,0.00053933944,0.00005677356,0.0001141449,0.0007749175,0.00032210042,0.0000025946347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012093543,0.00006038028,0.00050963747,0.000015147099,0.0000062003473,6.6029436e-8,0.0011789054,0.005574223,0.0002578335,0.98519075,0.00011173894,0.0070939246],"study_design_scores_gemma":[0.00027402476,0.000016556454,0.009672046,0.00011974382,0.0000037041793,0.0000045416527,0.00007326214,0.9537904,0.0026001583,0.025046838,0.008221545,0.00017716446],"about_ca_topic_score_codex":0.00004037857,"about_ca_topic_score_gemma":0.00001824847,"teacher_disagreement_score":0.9601439,"about_ca_system_score_codex":0.000015259013,"about_ca_system_score_gemma":0.000008561762,"threshold_uncertainty_score":0.29529533},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010934225052261968,"score_gpt":0.24944924275748742,"score_spread":0.23851501770522546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041369703","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9287643,0.0027284434,0.06400024,0.000100465535,0.000008579933,0.00008469432,0.0000022245515,0.0002148336,0.004096251],"genre_scores_gemma":[0.9942436,0.00031730597,0.0051760995,0.00009181825,0.000022197726,0.00002031962,0.00004601722,0.000016589776,0.0000660186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989385,0.000028283252,0.00035992044,0.0002684402,0.00012144358,0.00028339837],"domain_scores_gemma":[0.99872077,0.0004930872,0.000104665094,0.0005554099,0.000041413274,0.000084646694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021663564,0.00018738153,0.00037125105,0.00028672864,0.00012628127,0.0000580834,0.00034921253,0.00008759235,0.0001613709],"category_scores_gemma":[0.00002992353,0.00020527576,0.000081223625,0.0011986464,0.00007532194,0.00005624835,0.0002241016,0.000330164,0.0000053071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001861254,0.0011597086,0.1970439,0.0007202631,0.0048767957,0.000053801105,0.0032623857,0.31176737,0.14610596,0.308227,0.000060375467,0.026536295],"study_design_scores_gemma":[0.0018573938,0.00002409538,0.025098883,0.00012095807,0.0008287973,0.00007403679,0.002560338,0.9509051,0.010694995,0.0022371213,0.0046596923,0.0009385957],"about_ca_topic_score_codex":0.00008450785,"about_ca_topic_score_gemma":0.0000065044937,"teacher_disagreement_score":0.63913774,"about_ca_system_score_codex":0.000062125284,"about_ca_system_score_gemma":0.000011333303,"threshold_uncertainty_score":0.83709025},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Isomorphism (crystallography); Genus; Mathematics; Finite field; Pure mathematics; Discrete mathematics; Zoology; Biology; Crystallography; Chemistry","score_opus":0.010714150781214234,"score_gpt":0.20335172854452843,"score_spread":0.1926375777633142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064281699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33419234,0.025632774,0.6374168,0.0010814613,0.000077586075,0.00028000984,9.736982e-7,0.0002095447,0.0011085538],"genre_scores_gemma":[0.9703408,0.0033011094,0.026103497,0.00021385006,0.0000103422635,0.000010006194,0.0000016768452,0.000007985466,0.000010741315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919957,0.00003560764,0.00028300832,0.00018683718,0.000113576214,0.00018137856],"domain_scores_gemma":[0.99873817,0.0004769914,0.00007891361,0.00063405826,0.000027001497,0.0000448819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020169995,0.000113165,0.00018326128,0.0001435322,0.00007194345,0.00004130331,0.0006118734,0.00006095869,0.0000114986],"category_scores_gemma":[0.00003060393,0.0001192675,0.000041508538,0.00054095645,0.000042772353,0.00013851903,0.00031907004,0.00022235388,0.0000035931678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008223677,0.0010315967,0.029349633,0.0024816007,0.00020595705,0.000019630754,0.006278875,0.16353168,0.0051757265,0.52821547,0.0020430158,0.2616586],"study_design_scores_gemma":[0.00026757366,0.000025013122,0.008301482,0.00032340817,0.000005990997,0.000009544061,0.000017113896,0.9879426,0.00045898464,0.0010210932,0.0014539874,0.00017325568],"about_ca_topic_score_codex":0.000054192362,"about_ca_topic_score_gemma":0.0000036230722,"teacher_disagreement_score":0.82441086,"about_ca_system_score_codex":0.000008647517,"about_ca_system_score_gemma":0.0000046374503,"threshold_uncertainty_score":0.48635873},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.006295475143209721,"score_gpt":0.22291019344553092,"score_spread":0.2166147183023212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071302523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03222356,0.0005136046,0.95944804,0.0064443727,0.000033940192,0.00057627127,9.770645e-7,0.00014727884,0.0006119534],"genre_scores_gemma":[0.8236972,0.00007652167,0.17578173,0.00026697596,0.000029721421,0.00011890907,0.000004859016,0.000010517814,0.00001353971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906945,0.000042216398,0.0002585723,0.00026440818,0.00011624039,0.00024909817],"domain_scores_gemma":[0.9981469,0.0009741769,0.000070965856,0.0007249388,0.000033631244,0.000049377944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004668995,0.00012833225,0.00012442312,0.0001171971,0.00032836822,0.00015638107,0.00072213804,0.000043919874,0.0000019504878],"category_scores_gemma":[0.000033677643,0.00010530016,0.00004920473,0.00041589362,0.00003926691,0.00015087235,0.00031037081,0.00023204192,0.000003449736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031751795,0.000069992064,0.00018999689,0.00003580378,0.000018565059,3.7508997e-7,0.0009011872,0.076989494,0.00037171654,0.8741733,0.00017953038,0.047066905],"study_design_scores_gemma":[0.00035627052,0.00001962516,0.0015158083,0.0001163657,0.0000042051342,0.000005694395,0.000055273205,0.9835761,0.0011478802,0.008589569,0.0044458406,0.0001673692],"about_ca_topic_score_codex":0.00002837758,"about_ca_topic_score_gemma":0.000012562309,"teacher_disagreement_score":0.9065866,"about_ca_system_score_codex":0.000029666273,"about_ca_system_score_gemma":0.000012487005,"threshold_uncertainty_score":0.42940158},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007021612000770943,"score_gpt":0.19120881623314898,"score_spread":0.18418720423237803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078476935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49151003,0.00018533578,0.507663,0.0001588094,0.000006713745,0.0001250818,3.0035315e-7,0.0001231218,0.00022759491],"genre_scores_gemma":[0.883156,0.000017265438,0.11672108,0.000041911553,0.000018214221,0.00002468593,0.000004569069,0.000011160876,0.0000050870067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991419,0.00008180205,0.00021022606,0.00029260438,0.000076102675,0.00019738289],"domain_scores_gemma":[0.99866664,0.0005234953,0.000080644066,0.00062697957,0.000026314368,0.000075943884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047913237,0.00014232776,0.00017625665,0.00014008806,0.00020269938,0.00011068638,0.0005055498,0.000055645247,5.1618815e-7],"category_scores_gemma":[0.000026156607,0.00014499435,0.000018165407,0.0003618144,0.000057253936,0.00016362975,0.00043890745,0.00023315212,0.0000018880615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020671821,0.00014465596,0.17797942,0.00010318464,0.0001096269,0.0000010048263,0.0054117306,0.024790978,0.0036731085,0.607671,0.000021330827,0.18007326],"study_design_scores_gemma":[0.0009630834,0.00008213088,0.22735246,0.00018107131,0.00001434552,0.000009018471,0.000078100646,0.7634701,0.0011053081,0.0047215456,0.0016020703,0.00042073725],"about_ca_topic_score_codex":0.00003457194,"about_ca_topic_score_gemma":0.0000034710486,"teacher_disagreement_score":0.7386792,"about_ca_system_score_codex":0.000016452701,"about_ca_system_score_gemma":0.000009382322,"threshold_uncertainty_score":0.5912698},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0038605500603859856,"score_gpt":0.1717899451693302,"score_spread":0.1679293951089442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080520202","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6850822,0.0005941816,0.31375787,0.00006325578,0.00014428512,0.00023167048,0.0000027427043,0.00006430163,0.00005950389],"genre_scores_gemma":[0.9981941,0.0002051718,0.0014555615,0.000023930286,0.000034727436,0.000015369316,0.000028526341,0.00002703348,0.00001557831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991128,0.00004668361,0.0003984126,0.00014876931,0.00014780455,0.00014555168],"domain_scores_gemma":[0.99932206,0.000035563913,0.0001434822,0.00042265246,0.00005676812,0.000019448618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003439812,0.00015014145,0.00018165151,0.00008340731,0.000099250065,0.00002458105,0.0001748413,0.00011324566,0.0000020474754],"category_scores_gemma":[0.0000111691415,0.00012242323,0.000045812147,0.00054540206,0.000024684112,0.00008740174,0.00017057559,0.00016855917,1.317907e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009625705,0.000038964652,0.0052187806,0.00015566069,0.000029885718,7.654733e-8,0.00017190415,0.76574934,0.05091441,0.17384948,0.00003578504,0.0038261118],"study_design_scores_gemma":[0.00023564711,0.000011606581,0.037085377,0.000079319834,0.00002626978,0.000004599426,0.000019577188,0.95593417,0.0020941326,0.004063534,0.00032283374,0.00012296256],"about_ca_topic_score_codex":0.00041324747,"about_ca_topic_score_gemma":0.00011454727,"teacher_disagreement_score":0.3131119,"about_ca_system_score_codex":0.00005098732,"about_ca_system_score_gemma":0.000012114869,"threshold_uncertainty_score":0.49922743},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010676443347573252,"score_gpt":0.238737300977275,"score_spread":0.22806085762970174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112566740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4588228,0.0024862078,0.53634876,0.0013829186,0.000022088478,0.0002134908,7.839293e-7,0.0001829197,0.0005400711],"genre_scores_gemma":[0.80653006,0.0003606077,0.192946,0.00010747391,0.000015791371,0.000024682153,0.0000034657096,0.000009221821,0.0000026881967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989762,0.000045398545,0.0003904106,0.00024998502,0.00010404734,0.00023399894],"domain_scores_gemma":[0.99863935,0.00022724614,0.0001088703,0.00090564846,0.000050697454,0.00006818831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034331545,0.00013609347,0.00020798265,0.00028050845,0.00012165622,0.000064557345,0.00085670815,0.00006560981,0.0000031180948],"category_scores_gemma":[0.000013981685,0.00014588772,0.000059854985,0.0010034424,0.00005844478,0.0001932934,0.00038617512,0.00020236151,0.0000026336543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029512528,0.0001945949,0.0077985604,0.00008710531,0.00004109757,3.198469e-7,0.0009595323,0.09339289,0.007828376,0.7831854,0.00008444453,0.10642469],"study_design_scores_gemma":[0.00092187687,0.000031400632,0.11583006,0.00014313901,0.000012378781,0.000023679404,0.0000483853,0.8661386,0.0035259114,0.0066003855,0.006292618,0.00043157005],"about_ca_topic_score_codex":0.000047166788,"about_ca_topic_score_gemma":0.000012910198,"teacher_disagreement_score":0.77658504,"about_ca_system_score_codex":0.000016532704,"about_ca_system_score_gemma":0.000014649814,"threshold_uncertainty_score":0.5949129},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005583937670656649,"score_gpt":0.20053279992587036,"score_spread":0.1949488622552137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164838307","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72707593,0.00014499095,0.2708267,0.0011550764,0.000077898476,0.00012215672,3.6789726e-7,0.00008939968,0.00050746015],"genre_scores_gemma":[0.9843411,0.000013523047,0.015442175,0.00016406944,0.000016496415,0.000008498508,0.0000015718168,0.0000064693018,0.0000060838656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993287,0.000031083713,0.0002239412,0.00015425493,0.00011284784,0.00014920649],"domain_scores_gemma":[0.99840575,0.0008250342,0.000079203404,0.00062886847,0.000027439963,0.00003371003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051211676,0.0000967248,0.000121923906,0.00011422908,0.00010889399,0.00007104798,0.00078531535,0.00004680529,0.000003804067],"category_scores_gemma":[0.00007833608,0.00008072154,0.000025181505,0.0004367559,0.000045495093,0.000105143925,0.00039056025,0.0003692651,0.0000035760895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011510392,0.000029170127,0.00034466403,0.000012828164,0.000005394615,1.7068479e-7,0.00033410394,0.0040033627,0.0039814617,0.97070634,0.00002802539,0.020553313],"study_design_scores_gemma":[0.00022070433,0.000028473884,0.015843824,0.000040369658,0.00000194857,0.000007495618,0.00003624617,0.9414063,0.003871189,0.03757542,0.00079795823,0.00017003577],"about_ca_topic_score_codex":0.00006946213,"about_ca_topic_score_gemma":0.000004666909,"teacher_disagreement_score":0.93740296,"about_ca_system_score_codex":0.000008464825,"about_ca_system_score_gemma":0.000014340947,"threshold_uncertainty_score":0.32917288},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0066870112552000205,"score_gpt":0.20987445508176425,"score_spread":0.20318744382656423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2201326897","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99005145,0.0010720169,0.008316128,0.000052519983,0.000021914195,0.00010628946,5.56889e-7,0.000016693682,0.00036243393],"genre_scores_gemma":[0.98747265,0.00018434307,0.012234344,0.00004169146,0.000023495371,0.0000016056499,0.000018306875,0.000006496984,0.000017052009],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994931,0.000020473397,0.00017739317,0.00015961193,0.000037692986,0.00011170382],"domain_scores_gemma":[0.99962056,0.000047670503,0.00006009571,0.00021725461,0.000017840517,0.00003658485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001784214,0.0000828772,0.00012950019,0.000033334345,0.000033145596,0.000018418903,0.0001214172,0.000073644085,0.000002488491],"category_scores_gemma":[0.000020389161,0.00008250337,0.000017075163,0.00008891154,0.00004184559,0.0000040095374,0.0002325348,0.00008734202,8.5092586e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028851173,0.00004093743,0.1166043,0.00013727289,0.000039234015,2.3492068e-7,0.00014998135,0.003739303,0.8005955,0.01931157,0.00003415116,0.059318658],"study_design_scores_gemma":[0.005087724,0.0009905151,0.31825987,0.00076156604,0.000050010676,0.00017960841,0.0011472177,0.39047563,0.25186592,0.0056061866,0.023847412,0.0017283349],"about_ca_topic_score_codex":0.000042927702,"about_ca_topic_score_gemma":0.0000033033248,"teacher_disagreement_score":0.5487296,"about_ca_system_score_codex":0.000004603114,"about_ca_system_score_gemma":0.000009977264,"threshold_uncertainty_score":0.33643898},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0156801884358921,"score_gpt":0.24667596243740714,"score_spread":0.23099577400151503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914313791","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6454075,0.00015552386,0.35291955,0.00021759394,0.00004147896,0.00045128746,0.0000018668283,0.000054125823,0.00075106625],"genre_scores_gemma":[0.9836205,0.000010464735,0.016191106,0.000018126497,0.000012838694,0.000030319867,0.000010932614,0.000011668164,0.00009403086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929035,0.0000477499,0.00032430218,0.000116304036,0.000108172004,0.00011313796],"domain_scores_gemma":[0.9987548,0.00068335474,0.00010278625,0.00039185648,0.000044610504,0.00002257478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032398585,0.00008469088,0.00016085031,0.000045873465,0.000091283255,0.000024111394,0.00017162968,0.000038465932,0.000015572485],"category_scores_gemma":[0.00008345314,0.00005779638,0.0000282703,0.0001984735,0.000024220684,0.00006589459,0.00013145457,0.00015742959,0.0000047876215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013313879,0.00014852236,0.015392419,0.00039342095,0.000059066948,1.4313777e-7,0.0013305657,0.05882741,0.010315441,0.89500636,0.00005972759,0.018453639],"study_design_scores_gemma":[0.0004741464,0.000017921879,0.007192155,0.00020010654,0.00001104942,0.0000040657033,0.00039601087,0.9752515,0.00020407095,0.015478343,0.00061738864,0.00015324481],"about_ca_topic_score_codex":0.00008960013,"about_ca_topic_score_gemma":0.000014544846,"teacher_disagreement_score":0.9164241,"about_ca_system_score_codex":0.000027428077,"about_ca_system_score_gemma":0.000010790284,"threshold_uncertainty_score":0.23568681},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.006535158867155918,"score_gpt":0.20682669579713003,"score_spread":0.20029153692997412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964083059","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8918137,0.00039813758,0.10545989,0.00009033706,0.000059421487,0.00023105653,5.0207575e-7,0.00025157907,0.0016953785],"genre_scores_gemma":[0.9800426,0.00005094304,0.01980682,0.000058752707,0.000009996868,0.0000112185835,0.0000031630727,0.000011137383,0.000005411446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990423,0.000048002945,0.00028408208,0.0002643303,0.00014199819,0.00021933479],"domain_scores_gemma":[0.9985,0.00045616028,0.000094271396,0.00087084377,0.000030307621,0.000048456062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056870515,0.00014171729,0.00022309467,0.0001775834,0.00007327203,0.00006531084,0.00067741645,0.000059353482,0.0000051735856],"category_scores_gemma":[0.000008616938,0.00015214294,0.000047045567,0.00046802638,0.000023008308,0.0001411303,0.0004110966,0.0002376539,0.00000966815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000116229785,0.00011286602,0.0019319737,0.00008640578,0.000023465202,8.711788e-7,0.0008374664,0.02774063,0.0029909608,0.95909214,0.0000104251985,0.0071611432],"study_design_scores_gemma":[0.0013511806,0.000120983,0.005778454,0.00030302146,0.000008226103,0.000020255842,0.00010897786,0.97642994,0.004680768,0.009783869,0.0010157789,0.0003985708],"about_ca_topic_score_codex":0.000026520072,"about_ca_topic_score_gemma":0.0000012084571,"teacher_disagreement_score":0.9493083,"about_ca_system_score_codex":0.000021699132,"about_ca_system_score_gemma":0.000014099287,"threshold_uncertainty_score":0.6204209},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.039743496003378974,"score_gpt":0.2590012909516102,"score_spread":0.2192577949482312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989341942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024652075,0.00023021219,0.9736151,0.00058371463,0.000017520293,0.0005150382,0.0000017974406,0.00013887566,0.00024567344],"genre_scores_gemma":[0.5233744,0.000020534246,0.4764628,0.00006160944,0.000008692071,0.000057496964,0.0000042034567,0.000008550225,0.000001713178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990536,0.00004437742,0.0003106369,0.00028786188,0.00011636258,0.00018718601],"domain_scores_gemma":[0.9988865,0.00027416137,0.0001533899,0.0005261628,0.000103892075,0.000055873967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003839345,0.0001321038,0.00021582378,0.00007540187,0.00007952803,0.000050633727,0.000761944,0.00005161376,6.0543135e-7],"category_scores_gemma":[0.00008491985,0.00012510142,0.000018577033,0.0006941476,0.000050669016,0.00018594472,0.00024997973,0.00017313105,0.0000010033167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016263608,0.00021305216,0.0041102665,0.0010925418,0.0001002703,0.0000017452389,0.014539613,0.10468239,0.013663986,0.78201973,0.00006648369,0.07934726],"study_design_scores_gemma":[0.0003722765,0.00008907418,0.0017914738,0.00008724197,0.0000053174986,0.000006084674,0.00011697502,0.98971486,0.0064355386,0.00040542785,0.0008114965,0.00016421106],"about_ca_topic_score_codex":0.000029828963,"about_ca_topic_score_gemma":0.000001943604,"teacher_disagreement_score":0.8850325,"about_ca_system_score_codex":0.000021369724,"about_ca_system_score_gemma":0.000029710245,"threshold_uncertainty_score":0.51014876},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013960704577778095,"score_gpt":0.21488260193150707,"score_spread":0.20092189735372898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021510930","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5286713,0.0004038406,0.47026828,0.00019978273,0.000012220656,0.00011872849,7.5254593e-7,0.00007061792,0.0002544513],"genre_scores_gemma":[0.9615052,0.00005355732,0.03835283,0.00006541391,0.000007684073,0.0000053314643,0.000003171505,0.0000062419986,6.0431523e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992168,0.000053513693,0.00035838276,0.00014961834,0.000095211755,0.00012647235],"domain_scores_gemma":[0.9991309,0.00024896034,0.00014742679,0.00038069463,0.000041347543,0.000050648596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039483927,0.00009415739,0.00021621559,0.00010468442,0.000049139308,0.000023876206,0.0005894643,0.00004054509,0.000002282442],"category_scores_gemma":[0.000040103558,0.00010564748,0.000043464977,0.0005920977,0.00003694599,0.0001737751,0.00032009697,0.00013020949,7.164349e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005695054,0.00017396551,0.009641836,0.0008968426,0.000071570015,0.0000014377924,0.010082319,0.06823466,0.086275026,0.6388118,0.000019112618,0.18573447],"study_design_scores_gemma":[0.00068501994,0.000057132787,0.009850461,0.0001522212,0.0000065799914,0.0000035329213,0.00013603673,0.9590493,0.027284568,0.002482608,0.000102606566,0.0001899647],"about_ca_topic_score_codex":0.00002886786,"about_ca_topic_score_gemma":9.895439e-7,"teacher_disagreement_score":0.8908146,"about_ca_system_score_codex":0.000008428906,"about_ca_system_score_gemma":0.0000133752155,"threshold_uncertainty_score":0.4308179},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"Algorithm; Computer science","score_opus":0.014500206227143132,"score_gpt":0.19992791936478252,"score_spread":0.1854277131376394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092499131","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69769865,0.00018731691,0.30037418,0.0013570089,0.000007730754,0.00012245601,3.0589223e-7,0.000086909786,0.00016544465],"genre_scores_gemma":[0.98933667,0.00004818103,0.010421934,0.00016890447,0.0000060438815,0.000012520465,9.650093e-7,0.000004508232,2.454039e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993665,0.00007770652,0.00016960101,0.0001743151,0.000103293176,0.000108582244],"domain_scores_gemma":[0.9988907,0.000503493,0.00007083535,0.00047550205,0.000023559076,0.000035886933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039263716,0.00008499,0.00011186582,0.000050007016,0.00012133705,0.000049812264,0.0005721107,0.000024684186,0.0000024336155],"category_scores_gemma":[0.00003256523,0.00006503192,0.00001969079,0.0006808454,0.000064437045,0.00009771995,0.00021570068,0.00020397214,8.528862e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023831471,0.00005847656,0.002771574,0.00006566036,0.000014707572,9.276956e-7,0.0026182188,0.029945293,0.0053013484,0.9512841,0.000010395774,0.007905474],"study_design_scores_gemma":[0.0002889473,0.00026509268,0.0073049017,0.00013682459,0.0000049570954,0.0000038428716,0.00042813946,0.9824467,0.003963347,0.004719959,0.0002446094,0.00019269767],"about_ca_topic_score_codex":0.000024183493,"about_ca_topic_score_gemma":0.0000010330873,"teacher_disagreement_score":0.9525014,"about_ca_system_score_codex":0.00001061273,"about_ca_system_score_gemma":0.0000134506945,"threshold_uncertainty_score":0.26519248},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.003958740976191346,"score_gpt":0.19714958100646507,"score_spread":0.19319084003027373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W395247565","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8745496,0.00085555314,0.12291621,0.00012819945,0.000014736925,0.00012180325,3.7675807e-7,0.00034398885,0.001069524],"genre_scores_gemma":[0.9007605,0.00027758337,0.09879852,0.00012063465,0.000013048461,0.000011481172,0.0000020659486,0.0000083120585,0.000007853421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992291,0.000037785107,0.00020249921,0.00022227355,0.00008405195,0.00022429912],"domain_scores_gemma":[0.9992126,0.00020340053,0.00003389563,0.0004718766,0.000012993935,0.000065197375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041600273,0.0001277305,0.00014168806,0.00009666251,0.00016125372,0.00016659207,0.00042554198,0.000050209288,0.000009281415],"category_scores_gemma":[0.0000051017305,0.00014129268,0.000023272525,0.00033258653,0.000031311767,0.0002785826,0.00033141475,0.00020117179,0.0000032601515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014705636,0.00014131272,0.0031240867,0.000093854636,0.00004802688,0.0000045692773,0.0038404036,0.04015015,0.0008380562,0.6782209,0.000052243297,0.27347165],"study_design_scores_gemma":[0.00040940143,0.00003442767,0.009309385,0.000058920104,0.000004645405,0.00003414748,0.00003519461,0.98306984,0.00019657543,0.0022699332,0.0043406314,0.0002369066],"about_ca_topic_score_codex":0.000019041747,"about_ca_topic_score_gemma":0.000001690127,"teacher_disagreement_score":0.9429197,"about_ca_system_score_codex":0.0000123653135,"about_ca_system_score_gemma":0.0000076224933,"threshold_uncertainty_score":0.5761748},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018051059396640316,"score_gpt":0.2598347592051651,"score_spread":0.24178369980852477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308765265","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12098924,0.00044612747,0.87655956,0.0006174529,0.000101914055,0.0008415336,0.0000043341147,0.00030767717,0.00013217701],"genre_scores_gemma":[0.6943653,0.000027777101,0.30517182,0.00019630157,0.00009148698,0.00007543167,0.000021459593,0.000021821588,0.000028583652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998345,0.000047107384,0.0005419304,0.00047918258,0.000110417706,0.00047634824],"domain_scores_gemma":[0.998056,0.0010688207,0.00012799965,0.0005838291,0.000054925367,0.00010842094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079334265,0.00024020884,0.00033449856,0.00014956592,0.0003120339,0.0002309872,0.00085244316,0.00009558942,0.0000036844403],"category_scores_gemma":[0.000053360476,0.0002724413,0.000081755075,0.00037447695,0.000030595358,0.00028654246,0.00028110127,0.00018124397,0.0000056301583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022149892,0.00010403872,0.00009443235,0.00010613598,0.000032030566,6.029155e-7,0.0012562752,0.110516176,0.0013855626,0.0662979,0.00011669011,0.820068],"study_design_scores_gemma":[0.0012240941,0.00004407128,0.0021258623,0.00009766488,0.0000065232275,0.0000060015877,0.000021969232,0.9864659,0.0006113211,0.004322784,0.0047585173,0.00031533654],"about_ca_topic_score_codex":0.00011363704,"about_ca_topic_score_gemma":0.0000047718104,"teacher_disagreement_score":0.8759497,"about_ca_system_score_codex":0.00005786735,"about_ca_system_score_gemma":0.000032104323,"threshold_uncertainty_score":0.99997276},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020245967587065823,"score_gpt":0.24150581453736752,"score_spread":0.2212598469503017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321437526","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92451084,0.0019378081,0.07284305,0.00016595198,0.000022240352,0.00032823786,0.0000038069286,0.000062677434,0.00012538895],"genre_scores_gemma":[0.99050593,0.00047487114,0.00851506,0.00009508735,0.00006199552,0.00009261322,0.00020655218,0.000019004508,0.000028905924],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994465,0.000018930124,0.00014435341,0.00019196453,0.000039243245,0.0001590159],"domain_scores_gemma":[0.9996185,0.000046253183,0.000030903266,0.00024413686,0.00002166376,0.000038581984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031591987,0.000091378235,0.00009165772,0.000058253507,0.00010381902,0.00003668621,0.000112288675,0.000072490155,5.655896e-7],"category_scores_gemma":[0.000025199532,0.0001052462,0.000018055634,0.00012262548,0.000019530542,0.000007076581,0.00018292348,0.000067683075,0.0000014383623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024290082,0.000042599186,0.0012511524,0.00025191696,0.00005238219,5.371341e-7,0.0006783892,0.11513238,0.7800531,0.03927049,0.0007653362,0.06247746],"study_design_scores_gemma":[0.00040557416,0.000036743037,0.000702095,0.000028884897,0.000004623723,0.000005063289,0.00004723388,0.96500355,0.029105967,0.0013915458,0.0031058374,0.00016286303],"about_ca_topic_score_codex":0.000010066326,"about_ca_topic_score_gemma":0.000005737703,"teacher_disagreement_score":0.8498712,"about_ca_system_score_codex":0.0000061180467,"about_ca_system_score_gemma":0.000008608099,"threshold_uncertainty_score":0.42918158},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009493921149859972,"score_gpt":0.22316264146726725,"score_spread":0.21366872031740727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377094810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19365035,0.00076125294,0.8035695,0.0007447261,0.0000739693,0.000287567,0.000002080876,0.00058553845,0.00032505504],"genre_scores_gemma":[0.97544,0.00018252736,0.024138404,0.00007605825,0.000020138088,0.000084027204,0.000012277232,0.000012372643,0.000034154687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992246,0.000032611697,0.00019674085,0.0002510056,0.00006188211,0.00023313245],"domain_scores_gemma":[0.99874777,0.0006287652,0.00004501626,0.00048877683,0.000029376215,0.00006027463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006009733,0.00011864914,0.00015119153,0.00021708892,0.00026591154,0.00013120164,0.00043295207,0.000049505717,0.0000010900121],"category_scores_gemma":[0.0000312899,0.0001309621,0.000031861913,0.0007745683,0.000037775677,0.00016028546,0.00044685425,0.00014642601,0.000004480011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074937952,0.000043372784,0.0025797721,0.000114142844,0.000028467986,9.71183e-7,0.00086018926,0.008626607,0.0014399141,0.88773537,0.00045321963,0.09811046],"study_design_scores_gemma":[0.0004358379,0.000031411342,0.005365145,0.000072538474,0.0000062103363,0.000007212618,0.000102107595,0.96155465,0.00026032358,0.017725073,0.014223784,0.00021572672],"about_ca_topic_score_codex":0.00001376215,"about_ca_topic_score_gemma":0.0000035785001,"teacher_disagreement_score":0.952928,"about_ca_system_score_codex":0.0000122435695,"about_ca_system_score_gemma":0.000007801915,"threshold_uncertainty_score":0.53404796},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.025112864864790273,"score_gpt":0.26670254320078446,"score_spread":0.24158967833599418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385296592","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6696146,0.00030776497,0.32939962,0.0001189816,0.000031824038,0.00009962431,9.191074e-7,0.00027441178,0.00015222507],"genre_scores_gemma":[0.90841174,0.000045447832,0.09145935,0.0000439437,0.000012409888,0.000007386782,0.000003379424,0.0000116119145,0.0000047083486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913144,0.000060250204,0.00027548015,0.00020715462,0.00010916292,0.00021648491],"domain_scores_gemma":[0.99866974,0.00052464026,0.00008107914,0.0006405174,0.000037917092,0.000046089444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007082429,0.00011337671,0.00017698926,0.00024361728,0.0001107025,0.000045323206,0.00066455005,0.00004724869,0.0000014895807],"category_scores_gemma":[0.000043686698,0.00012754812,0.00003138605,0.0013323186,0.00003649367,0.00015377607,0.00063226116,0.00017602369,0.0000037259122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001034947,0.00015116914,0.007859847,0.00026019991,0.00004919797,0.0000050993626,0.001657282,0.17471088,0.017828701,0.75378734,0.000032565425,0.043647394],"study_design_scores_gemma":[0.00024643398,0.000015096867,0.002499001,0.00012611784,0.0000045012757,0.000005533164,0.000042695956,0.9912647,0.0014627055,0.0037589474,0.00043653042,0.00013772317],"about_ca_topic_score_codex":0.00004457141,"about_ca_topic_score_gemma":0.000004545152,"teacher_disagreement_score":0.81655383,"about_ca_system_score_codex":0.00001359523,"about_ca_system_score_gemma":0.000013668452,"threshold_uncertainty_score":0.5201261},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Medicine","score_opus":0.010759470734211237,"score_gpt":0.22430183092138856,"score_spread":0.21354236018717732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390973014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16994962,0.00039366903,0.82638556,0.001013112,0.00006989978,0.00012891625,6.907764e-7,0.0001530413,0.0019054995],"genre_scores_gemma":[0.99462074,0.000034589983,0.005213438,0.00006556953,0.000016151505,0.000028850145,0.0000038480434,0.000006561434,0.000010242638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999396,0.000038068025,0.0001878894,0.00017235507,0.00009828481,0.00010738694],"domain_scores_gemma":[0.99859476,0.0007961918,0.00003463445,0.0005299601,0.00002184056,0.000022623764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005509692,0.00008139031,0.00008098106,0.00015420104,0.000115610914,0.00009859955,0.0004918445,0.000034365126,0.0000064848355],"category_scores_gemma":[0.000019258585,0.00006908122,0.0000371451,0.000680741,0.000039245722,0.000108847235,0.00017546714,0.00022482585,0.000010122881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012442991,0.000023247423,0.00008737997,0.000025687683,0.000009515974,1.4593991e-7,0.00031036686,0.0056949286,0.0022690617,0.95608455,0.00009079169,0.03540311],"study_design_scores_gemma":[0.000064733926,0.000020129566,0.010731195,0.00014548117,0.0000030585757,0.0000035853548,0.00006106954,0.967128,0.00020307681,0.020370182,0.001183678,0.00008583739],"about_ca_topic_score_codex":0.0000069818084,"about_ca_topic_score_gemma":8.222179e-7,"teacher_disagreement_score":0.96143305,"about_ca_system_score_codex":0.000016856635,"about_ca_system_score_gemma":0.000012847655,"threshold_uncertainty_score":0.28170505},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007053071388454554,"score_gpt":0.2278223220556041,"score_spread":0.22076925066714953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393115041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19921423,0.00090191077,0.7959445,0.0020724307,0.000013955878,0.0006462824,0.000002568872,0.000059829592,0.0011442688],"genre_scores_gemma":[0.98857987,0.000067243294,0.010876719,0.00015546384,0.000038485963,0.00024406155,0.00001945533,0.00001557746,0.0000031157947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920154,0.000064219676,0.0002614657,0.00022262013,0.00006959277,0.00018055606],"domain_scores_gemma":[0.9983608,0.001125427,0.00004186381,0.00043307772,0.000007740086,0.00003110681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047710148,0.00015264162,0.00015240588,0.00009197916,0.00011063178,0.000118773096,0.00031841343,0.000032293978,0.00000703022],"category_scores_gemma":[0.0000071870254,0.000101415026,0.00003089736,0.00080171524,0.00005060295,0.000065606466,0.000083034625,0.00032790302,0.0000020457335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023183725,0.00003972469,0.0006843007,0.000025843045,0.0000052497135,1.07046e-7,0.00064602826,0.015188724,0.00037140198,0.9609213,0.000012129402,0.022102859],"study_design_scores_gemma":[0.00023751779,0.000010206294,0.0009410938,0.00014118076,0.0000039645233,8.0462127e-7,0.00086542167,0.741257,0.000108771485,0.25359306,0.002696073,0.00014489269],"about_ca_topic_score_codex":0.00023717988,"about_ca_topic_score_gemma":0.000022415752,"teacher_disagreement_score":0.78936565,"about_ca_system_score_codex":0.000015079713,"about_ca_system_score_gemma":0.000010461148,"threshold_uncertainty_score":0.41355845},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009363980997397995,"score_gpt":0.23314801559123247,"score_spread":0.22378403459383447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395695590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11862965,0.0014244668,0.87733066,0.00080472504,0.00022039122,0.0001408387,6.738227e-7,0.0003989274,0.0010496523],"genre_scores_gemma":[0.981097,0.000051323794,0.018532852,0.00016292547,0.000086659966,0.0000150878395,0.0000074077525,0.000012951281,0.00003382245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990157,0.00003591452,0.00031012335,0.00030278656,0.00010761622,0.00022789584],"domain_scores_gemma":[0.99903697,0.00041966696,0.00004100315,0.00042684606,0.000016954957,0.000058542704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002682189,0.0001580522,0.00015357132,0.00019813229,0.000089938556,0.0006330668,0.00051547703,0.000074537915,0.000009902515],"category_scores_gemma":[0.000013643914,0.00016670019,0.000040364277,0.0004554979,0.000025461324,0.0006212089,0.00048317196,0.0003147012,0.000015844103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000104335095,0.000078369776,0.0006851933,0.00026918657,0.00006274531,0.000017228238,0.006027916,0.13509545,0.0020174964,0.5450457,0.0008585038,0.3098318],"study_design_scores_gemma":[0.00016684028,0.000017407932,0.0021568004,0.00015721093,0.0000029814773,0.000011116028,0.00005929099,0.9901908,0.00010965011,0.0033772958,0.0035650954,0.00018551952],"about_ca_topic_score_codex":0.00008720189,"about_ca_topic_score_gemma":0.000012469786,"teacher_disagreement_score":0.86246735,"about_ca_system_score_codex":0.000033706852,"about_ca_system_score_gemma":0.000040430623,"threshold_uncertainty_score":0.67978364},"labels":[],"label_agreement":null}]}