{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31407082,0.0008058098,0.57686454,0.0017760975,0.0011625137,0.00068548426,0.0017484151,0.002767995,0.10011829],"genre_scores_gemma":[0.78415376,0.0005614913,0.17892401,0.0007766224,0.000338293,0.0005443777,0.0017940941,0.0006324674,0.032274928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932504,0.00010306084,0.000034760298,0.000095992196,0.00023333168,0.00020774058],"domain_scores_gemma":[0.9992144,0.00023747761,0.00007550662,0.00014174379,0.00019325897,0.00013760215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041819367,0.00069599913,0.0005913095,0.0010686931,0.0012968656,0.0011735439,0.0007032278,0.00072721037,0.0064566648],"category_scores_gemma":[0.0015021669,0.0003085654,0.0008277821,0.0011962457,0.001130885,0.00087581185,0.0019997433,0.0013225349,0.0016021682],"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.000248446,0.00014099482,0.00050060323,0.0001608661,0.000022196185,0.00033304142,0.00038277707,0.0054986435,0.020236114,0.90393966,0.010082607,0.05845407],"study_design_scores_gemma":[0.00015376939,0.0003774433,0.0006941417,0.0001262997,0.000064258165,0.0005149168,0.00022147395,0.03700654,0.06271411,0.83362705,0.06432294,0.00017714554],"about_ca_topic_score_codex":0.0016755004,"about_ca_topic_score_gemma":0.0017240996,"teacher_disagreement_score":0.0064566648,"about_ca_system_score_codex":0.0010229836,"about_ca_system_score_gemma":0.002392324,"threshold_uncertainty_score":0.02159971},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25830096,0.0013829041,0.2009531,0.004046181,0.0010578992,0.00019029906,0.0022804993,0.0012981446,0.53049004],"genre_scores_gemma":[0.8774542,0.00053210126,0.026128648,0.00094846456,0.0006351808,0.00015409008,0.0011263698,0.0002822482,0.09273876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989642,0.00017768829,0.00006042116,0.00019863759,0.00033441407,0.00026469876],"domain_scores_gemma":[0.9986828,0.0003218727,0.00012560234,0.00034658198,0.00032832596,0.00019481577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067680614,0.0006623722,0.0007686349,0.0015202007,0.0020453853,0.0028135772,0.0008595613,0.00094307953,0.019729864],"category_scores_gemma":[0.003373427,0.0003136571,0.00080406095,0.0011429997,0.0020397215,0.002869739,0.0027800337,0.00222153,0.0042311153],"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.000042107156,0.000009460689,0.00011285301,0.000018969104,0.000003835588,0.00002323454,0.000046821326,0.00043964,0.00055986247,0.99079376,0.0021300046,0.0058193444],"study_design_scores_gemma":[0.000009601936,0.000010422723,0.00012960662,0.000013121712,0.0000045673546,0.00007610807,0.000028387181,0.0025255766,0.0012636791,0.98821133,0.007717849,0.000009735349],"about_ca_topic_score_codex":0.0010251553,"about_ca_topic_score_gemma":0.00089868146,"teacher_disagreement_score":0.019729864,"about_ca_system_score_codex":0.0014351262,"about_ca_system_score_gemma":0.0018418598,"threshold_uncertainty_score":0.066002905},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21092524,0.0016086907,0.67131466,0.0026480113,0.00043099737,0.00018300224,0.0008233252,0.0012767237,0.110789314],"genre_scores_gemma":[0.8924366,0.00068700523,0.08228227,0.0006761782,0.00025128157,0.0002912586,0.00034331778,0.0002586654,0.022773381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985678,0.00033280032,0.00006608676,0.00021521412,0.0004956247,0.00032239506],"domain_scores_gemma":[0.9976439,0.0010987722,0.00015554801,0.00057192007,0.00029731126,0.0002325321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018060602,0.0011025071,0.001565586,0.0011886876,0.0018171014,0.0027205648,0.0017049796,0.0017946657,0.011432369],"category_scores_gemma":[0.004664073,0.00058571214,0.0007543456,0.001337287,0.0028707557,0.0054094447,0.0054516112,0.0026337225,0.0020067014],"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.00021136021,0.000025552776,0.00016334021,0.00006731534,0.000016284737,0.000050222177,0.000067957604,0.009949827,0.004205284,0.9761755,0.002060431,0.0070068054],"study_design_scores_gemma":[0.000043335564,0.0000358689,0.00010193892,0.00003225765,0.0000245906,0.000085230924,0.0000337764,0.11003951,0.0056954105,0.8805395,0.0033327164,0.000035855013],"about_ca_topic_score_codex":0.000725716,"about_ca_topic_score_gemma":0.001064343,"teacher_disagreement_score":0.011432369,"about_ca_system_score_codex":0.0014808521,"about_ca_system_score_gemma":0.0015603631,"threshold_uncertainty_score":0.03824514},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5575421,0.00076563936,0.25559196,0.0037422462,0.0010450488,0.0001594755,0.00078435644,0.0008400647,0.17952912],"genre_scores_gemma":[0.93883383,0.00044773234,0.017564358,0.00056586845,0.0004623323,0.00012340606,0.00041769832,0.0004970922,0.04108767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990677,0.00018381167,0.00003492418,0.00014076015,0.0002996341,0.00027322772],"domain_scores_gemma":[0.9989427,0.00032169747,0.00013418263,0.00013178572,0.00020635202,0.0002632852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011357631,0.001120365,0.0008758231,0.002545122,0.0026182726,0.004572846,0.0019443118,0.0018384937,0.017424645],"category_scores_gemma":[0.0035197625,0.0005044261,0.0008043825,0.0013743686,0.0033942275,0.0049983556,0.0020707215,0.0031325999,0.0026162772],"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.0000418919,0.000027097789,0.000047582824,0.000009543449,0.0000024887977,0.000030274774,0.000112289476,0.00035423925,0.0010085497,0.9948953,0.0007563254,0.002714467],"study_design_scores_gemma":[0.000015309275,0.000015153037,0.00010460573,0.0000112032385,0.0000027718963,0.00007523123,0.00008146143,0.0050652553,0.0010048515,0.99223655,0.0013676345,0.000020084317],"about_ca_topic_score_codex":0.0013734186,"about_ca_topic_score_gemma":0.0011590901,"teacher_disagreement_score":0.017424645,"about_ca_system_score_codex":0.0016365772,"about_ca_system_score_gemma":0.0014247334,"threshold_uncertainty_score":0.058291256},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16387267,0.0025461186,0.65652525,0.002632684,0.0016390511,0.00015063953,0.00033678563,0.0012182496,0.1710785],"genre_scores_gemma":[0.84260195,0.001116528,0.09189754,0.000609526,0.0008403969,0.0001301634,0.00020189308,0.00072156655,0.06188047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847823,0.00043282576,0.00008526836,0.00018567237,0.0005927222,0.00022523828],"domain_scores_gemma":[0.998669,0.00037659294,0.00009446842,0.00033086495,0.00035510477,0.00017390621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019226071,0.0011183455,0.0017947372,0.0031704216,0.0020148598,0.0035397424,0.0018603835,0.0010631649,0.013926371],"category_scores_gemma":[0.004201799,0.0005336514,0.0011675929,0.0024215956,0.003495831,0.0071978485,0.003713445,0.0030363337,0.0022920826],"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.000026250053,0.000020365647,0.00008612291,0.000046137284,0.0000111092495,0.00004254348,0.0000910627,0.0018925037,0.0004411855,0.9884114,0.001184333,0.007746939],"study_design_scores_gemma":[0.00000778639,0.000011355752,0.000077901444,0.00001344353,0.0000072267712,0.00004147962,0.000032263935,0.013046573,0.00076364324,0.9830928,0.002891893,0.00001361399],"about_ca_topic_score_codex":0.0010166159,"about_ca_topic_score_gemma":0.0014951421,"teacher_disagreement_score":0.013926371,"about_ca_system_score_codex":0.0017286581,"about_ca_system_score_gemma":0.0007383881,"threshold_uncertainty_score":0.0465883},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54791546,0.0009611442,0.1027675,0.0041789953,0.0010769581,0.00021978946,0.0007630309,0.0008129726,0.34130412],"genre_scores_gemma":[0.9227205,0.00052857737,0.0131260995,0.00044952452,0.0007178296,0.00010008739,0.00051431253,0.0002303568,0.061612736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992931,0.0001508772,0.000027892076,0.00014454225,0.00022482032,0.00015881313],"domain_scores_gemma":[0.99931145,0.00014455608,0.00014967413,0.00012647366,0.00010646311,0.00016137966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000490239,0.0012604839,0.0009995721,0.00272937,0.002043784,0.003098433,0.0012257682,0.0013595737,0.014549438],"category_scores_gemma":[0.0013528088,0.0005296665,0.00092109345,0.0015946439,0.0026829129,0.0035936022,0.0026013735,0.0037502027,0.0027516324],"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.00007779653,0.000024801322,0.00010528852,0.000024006145,0.000009264042,0.0001486006,0.00014685745,0.0008637694,0.0016818151,0.9913352,0.0012212651,0.0043613315],"study_design_scores_gemma":[0.000045558114,0.000045586534,0.0003530277,0.000013290638,0.0000133108315,0.00028941562,0.0001383682,0.0037132457,0.0016847254,0.98520666,0.008475667,0.000021190106],"about_ca_topic_score_codex":0.00095357903,"about_ca_topic_score_gemma":0.00036999522,"teacher_disagreement_score":0.014549438,"about_ca_system_score_codex":0.0015971175,"about_ca_system_score_gemma":0.00062304764,"threshold_uncertainty_score":0.048672736},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34464532,0.0004097926,0.6248935,0.0030364185,0.00040536578,0.0003467125,0.0002520985,0.0014913086,0.024519516],"genre_scores_gemma":[0.96620643,0.00011047562,0.02771784,0.00019839696,0.00005363637,0.00007498874,0.00007528461,0.000058474187,0.0055044373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997843,0.00059807,0.00011868745,0.0003483817,0.0007080352,0.00038382979],"domain_scores_gemma":[0.99828076,0.0008361546,0.0001761219,0.00045297266,0.00015379698,0.00010023215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019864219,0.0006130379,0.0008670998,0.0007211331,0.0010927301,0.0019817755,0.0010661717,0.0015894028,0.0035483844],"category_scores_gemma":[0.0031939005,0.0003923001,0.0010230133,0.00059074163,0.0020952118,0.0033558672,0.0021160569,0.0018389855,0.0006295206],"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.0015299317,0.00026576457,0.0015673831,0.0001289664,0.00017879074,0.0010594345,0.00039001077,0.038700007,0.033147153,0.8898333,0.0034527131,0.029746631],"study_design_scores_gemma":[0.00042742127,0.0005578034,0.0011751547,0.00005544747,0.00021291341,0.0012406481,0.00011034189,0.4921772,0.067817844,0.4291295,0.0069611007,0.00013463954],"about_ca_topic_score_codex":0.00038581048,"about_ca_topic_score_gemma":0.00032550067,"teacher_disagreement_score":0.0035483844,"about_ca_system_score_codex":0.0012137705,"about_ca_system_score_gemma":0.0018425717,"threshold_uncertainty_score":0.011870503},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11143581,0.0071841236,0.6569556,0.016700923,0.0022864195,0.00017638424,0.0010715353,0.0003547602,0.2038345],"genre_scores_gemma":[0.88048327,0.006915194,0.07440565,0.0031862175,0.002325298,0.00034192821,0.00073751056,0.00035456748,0.03125027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997214,0.0010507611,0.00017973899,0.0003033525,0.0008265652,0.00042563473],"domain_scores_gemma":[0.99431,0.003630327,0.00023843383,0.0009675426,0.000617611,0.00023590963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043569924,0.001014051,0.0013677967,0.002037784,0.0025999781,0.0039751576,0.0015945649,0.002250321,0.0068056816],"category_scores_gemma":[0.009990543,0.00058939075,0.0010230123,0.0023033998,0.0071525723,0.015544787,0.0041242875,0.0058772066,0.002368411],"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.000040369956,0.0000068721165,0.000025928619,0.000015559359,0.0000031005613,0.000018092634,0.00006200668,0.0006701235,0.00027198845,0.996058,0.0008536736,0.001974291],"study_design_scores_gemma":[0.0000063954417,0.0000044726007,0.000016121623,0.000008529236,0.0000023396979,0.000013542379,0.00000925109,0.0022982056,0.00016359572,0.99601185,0.0014590155,0.0000066488124],"about_ca_topic_score_codex":0.0010541882,"about_ca_topic_score_gemma":0.000455503,"teacher_disagreement_score":0.0068056816,"about_ca_system_score_codex":0.0019360192,"about_ca_system_score_gemma":0.001480965,"threshold_uncertainty_score":0.023042262},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007304856,0.005464394,0.9901439,0.0007773591,0.00010944443,0.000020835969,0.00010957613,0.000098032964,0.0025459933],"genre_scores_gemma":[0.109657854,0.036865354,0.84060985,0.0011713834,0.0027659736,0.00052059005,0.0008838062,0.0002872495,0.00723782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996837,0.0011276003,0.00021803608,0.0004522244,0.0012713881,0.000093703195],"domain_scores_gemma":[0.99591947,0.0023670865,0.00021956503,0.00054234633,0.0008353327,0.000116250354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048946175,0.0015884498,0.0023794735,0.0031090719,0.0012945862,0.0054991804,0.0025292607,0.0018584488,0.0024999816],"category_scores_gemma":[0.010545796,0.0010194766,0.001643328,0.005145576,0.004566448,0.0052909544,0.0029972144,0.0040303012,0.0018121428],"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.000016719352,0.000040264815,0.00032056277,0.00032085332,0.00009570825,0.00006065668,0.0001226951,0.029154819,0.0005123297,0.8670336,0.007444901,0.0948768],"study_design_scores_gemma":[0.000006871299,0.000013826079,0.00016556386,0.00006120457,0.000023997854,0.000055953613,0.000022076698,0.09415988,0.00022745221,0.89349365,0.01173956,0.000030063673],"about_ca_topic_score_codex":0.0023074467,"about_ca_topic_score_gemma":0.0019015182,"teacher_disagreement_score":0.0054991804,"about_ca_system_score_codex":0.0010958115,"about_ca_system_score_gemma":0.0028459907,"threshold_uncertainty_score":0.025885522},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94289833,0.00037385782,0.009155277,0.0008636992,0.000086297914,0.000046478464,0.00018373824,0.00022106786,0.046171267],"genre_scores_gemma":[0.9859438,0.00041395292,0.0018216969,0.00012594617,0.00021247573,0.000034521334,0.00040626738,0.000076787706,0.010964467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990947,0.00016276712,0.0000369573,0.0001559267,0.00020170641,0.00034795518],"domain_scores_gemma":[0.9982687,0.00072084984,0.00027815736,0.00014566001,0.00011237672,0.0004742424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092594005,0.0012393048,0.0010124418,0.0046663648,0.0027917763,0.004905608,0.0012855075,0.0017057557,0.013277149],"category_scores_gemma":[0.0023996797,0.0006522438,0.0008960001,0.002592896,0.0034091547,0.006742134,0.0034156574,0.003114702,0.0008079538],"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.00033951804,0.00018865515,0.004124511,0.00006640683,0.000028175544,0.000567311,0.0017784674,0.0017261622,0.0041366364,0.96961266,0.0017571065,0.015674481],"study_design_scores_gemma":[0.00007633709,0.00008527737,0.005091933,0.000047186706,0.000034908695,0.0004967711,0.00080104376,0.0051383413,0.0028663247,0.98023456,0.0050852364,0.00004213801],"about_ca_topic_score_codex":0.0009624789,"about_ca_topic_score_gemma":0.00056104944,"teacher_disagreement_score":0.013277149,"about_ca_system_score_codex":0.0021921957,"about_ca_system_score_gemma":0.000673366,"threshold_uncertainty_score":0.044416487},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5040901,0.0037583525,0.3389162,0.02313318,0.00163623,0.00015386834,0.00052839157,0.0005128314,0.12727082],"genre_scores_gemma":[0.9407109,0.0018252621,0.025936142,0.0011966379,0.001643503,0.00011807622,0.00049204705,0.00019587668,0.0278815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767417,0.00085528794,0.000106660416,0.00036128963,0.00064717967,0.00035539403],"domain_scores_gemma":[0.9922694,0.0056961128,0.0004956461,0.00066162326,0.0004397408,0.00043737318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029335693,0.001054688,0.0017692661,0.0020595568,0.002636229,0.006672135,0.0022919343,0.0027804119,0.008907999],"category_scores_gemma":[0.01879582,0.0005492959,0.0006952069,0.002775927,0.005399625,0.013399423,0.0042973575,0.005982632,0.0016178024],"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.00020852865,0.00008690969,0.0002802858,0.000084875945,0.000012627131,0.000115828596,0.00023171322,0.0047466517,0.00046630582,0.97667605,0.0035417683,0.01354857],"study_design_scores_gemma":[0.000020404406,0.000010030551,0.000037564507,0.000008289774,0.0000035026542,0.00003098967,0.00004063497,0.0099009415,0.00018079882,0.9892581,0.00050013314,0.000008583104],"about_ca_topic_score_codex":0.00094798073,"about_ca_topic_score_gemma":0.00064067653,"teacher_disagreement_score":0.008907999,"about_ca_system_score_codex":0.001999084,"about_ca_system_score_gemma":0.0013400569,"threshold_uncertainty_score":0.029800236},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43198502,0.0031103406,0.3583911,0.0061780224,0.0017943706,0.00015161639,0.00045444898,0.00076499593,0.1971701],"genre_scores_gemma":[0.94909143,0.000602127,0.019968912,0.0006649599,0.0013743892,0.000074374344,0.00013005614,0.00014410571,0.027949654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984794,0.0004833073,0.00008566793,0.00029496825,0.00039891337,0.00025769556],"domain_scores_gemma":[0.9975942,0.0011639382,0.000328755,0.00043532345,0.00021986233,0.0002579205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016527788,0.00081380963,0.001007894,0.0020428756,0.0019514896,0.0029965448,0.0011826588,0.0009197219,0.0100394655],"category_scores_gemma":[0.005270293,0.0005323254,0.0009613764,0.0016609756,0.004828115,0.008263516,0.0033403598,0.0033878153,0.0015526977],"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.000017792072,0.000006558941,0.000035198147,0.000011336606,0.000002377896,0.00001996717,0.00008221536,0.00015151469,0.00028358796,0.9970305,0.00034158435,0.002017358],"study_design_scores_gemma":[0.000009010389,0.0000130172975,0.00005614933,0.0000058004034,0.0000039865404,0.000058469537,0.000029490837,0.0009963795,0.0004083054,0.9966581,0.0017541196,0.0000071599134],"about_ca_topic_score_codex":0.0002471068,"about_ca_topic_score_gemma":0.00022963125,"teacher_disagreement_score":0.0100394655,"about_ca_system_score_codex":0.0011158622,"about_ca_system_score_gemma":0.00069940946,"threshold_uncertainty_score":0.03358543},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043438002,0.009148404,0.84750974,0.008087903,0.0021654745,0.00006928977,0.00019737141,0.000454338,0.08892942],"genre_scores_gemma":[0.6258664,0.013114174,0.29081786,0.0049687056,0.006979697,0.00025205963,0.00041533637,0.0005732637,0.05701248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935204,0.00024957923,0.000036515692,0.00013187267,0.00015884628,0.00007109711],"domain_scores_gemma":[0.99927825,0.00018480352,0.00008604019,0.00017373804,0.00017969156,0.00009753463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001808085,0.0009075899,0.001105634,0.0016100232,0.0014160379,0.002578302,0.0013307058,0.0017375207,0.0027291845],"category_scores_gemma":[0.002644217,0.00046366485,0.0014363759,0.0014494709,0.0043192604,0.006025363,0.0022909108,0.0037283518,0.0011808696],"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.0000036545432,0.000004175371,0.000028129367,0.000014475436,0.0000037747461,0.000021951448,0.0000878729,0.0009308285,0.00035475174,0.9950015,0.00082830986,0.002720574],"study_design_scores_gemma":[0.0000025624747,0.000008947687,0.00004718134,0.000009239943,0.0000030504468,0.00003051903,0.000023983966,0.006530891,0.000105584426,0.9861837,0.0070433468,0.000010859989],"about_ca_topic_score_codex":0.0022904922,"about_ca_topic_score_gemma":0.0010175931,"teacher_disagreement_score":0.0027291845,"about_ca_system_score_codex":0.0011787708,"about_ca_system_score_gemma":0.0011981552,"threshold_uncertainty_score":0.009562194},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39761165,0.0032740217,0.18045607,0.028494988,0.0018150661,0.00014068189,0.0004683144,0.00055085705,0.38718835],"genre_scores_gemma":[0.9766738,0.00058467727,0.0063498206,0.0009778801,0.00048246022,0.00002670683,0.0000585107,0.000040269886,0.014805821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985549,0.00053485367,0.000044970373,0.00013844136,0.00045662545,0.00027020668],"domain_scores_gemma":[0.9984212,0.00072009745,0.00011430416,0.00047784855,0.00018098786,0.000085594824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013858804,0.0004540728,0.0006716365,0.001020975,0.0012941419,0.0020353904,0.00071342575,0.0017062887,0.008779906],"category_scores_gemma":[0.0041142157,0.00025112883,0.0005280265,0.0010347521,0.0044857753,0.004815158,0.0026149137,0.002367742,0.0011248512],"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.00008345476,0.000009527065,0.00010870279,0.0000188151,0.000006755418,0.00011047866,0.00007507209,0.0020460319,0.000743532,0.98990333,0.001741919,0.0051523717],"study_design_scores_gemma":[0.000016226257,0.000016054353,0.000100995516,0.0000088103425,0.000004067263,0.00013071363,0.000049728213,0.006262904,0.00068185077,0.9893694,0.0033481184,0.000011228949],"about_ca_topic_score_codex":0.00041657925,"about_ca_topic_score_gemma":0.00027436207,"teacher_disagreement_score":0.008779906,"about_ca_system_score_codex":0.0009968712,"about_ca_system_score_gemma":0.0006290906,"threshold_uncertainty_score":0.029371738},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19544476,0.010262807,0.22277988,0.0092717875,0.0014110672,0.00007048221,0.0007872538,0.00024179637,0.55973023],"genre_scores_gemma":[0.9091787,0.008561244,0.019031933,0.0008991919,0.0015279899,0.000053110867,0.00061760814,0.00016362935,0.059966646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952936,0.00016470038,0.000017218012,0.00008413444,0.00013322906,0.000071335504],"domain_scores_gemma":[0.99948704,0.00024198438,0.000044039683,0.000053869393,0.00009323174,0.00007985401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006254072,0.00067744753,0.0006531722,0.0014733888,0.0016218518,0.003303284,0.0006693476,0.00053285947,0.0088799],"category_scores_gemma":[0.0013769495,0.00038962724,0.00046274203,0.001438397,0.0043307473,0.0069832546,0.0027530417,0.0030838093,0.0017347108],"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.000007909859,0.0000028495458,0.000037160215,0.000010151686,0.0000012066704,0.000017163899,0.00008617067,0.0002604629,0.00012501844,0.9971752,0.00067592546,0.0016008387],"study_design_scores_gemma":[0.0000037197622,0.0000048972815,0.00007662091,0.000006837821,0.0000019343695,0.000035292353,0.00008028631,0.0007022509,0.00010002815,0.99371064,0.0052739643,0.0000035143212],"about_ca_topic_score_codex":0.001154721,"about_ca_topic_score_gemma":0.0005679584,"teacher_disagreement_score":0.0088799,"about_ca_system_score_codex":0.00094431895,"about_ca_system_score_gemma":0.00046222893,"threshold_uncertainty_score":0.02970624},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02976038,0.00057024084,0.9432078,0.0012264816,0.00022762509,0.00007572427,0.00029134884,0.0005676608,0.024072712],"genre_scores_gemma":[0.4407289,0.0010653768,0.53109497,0.0012523234,0.00045427796,0.00069319905,0.001038338,0.0008000742,0.022872591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99647635,0.001132661,0.00015660452,0.00049754884,0.0012608638,0.00047601367],"domain_scores_gemma":[0.99077237,0.0056756907,0.00037332097,0.0016774142,0.0008921309,0.0006091241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00241966,0.0011135787,0.0014100765,0.0020071722,0.0015271591,0.003036175,0.0027867467,0.0015973184,0.0065594288],"category_scores_gemma":[0.014242174,0.000891024,0.0015890972,0.0023775366,0.0033404343,0.004169787,0.006540086,0.004586765,0.0016902585],"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.0001010479,0.000040254265,0.00017558946,0.000070082664,0.000015950134,0.00002828635,0.00010049234,0.02737211,0.0018951533,0.94702303,0.0029857543,0.020192116],"study_design_scores_gemma":[0.000026934518,0.000033358097,0.00007567542,0.00003372564,0.000011472076,0.000029371928,0.000024545894,0.10165961,0.0021809659,0.8918957,0.0040045455,0.000024156061],"about_ca_topic_score_codex":0.0013610875,"about_ca_topic_score_gemma":0.0020725075,"teacher_disagreement_score":0.0065594288,"about_ca_system_score_codex":0.0029800124,"about_ca_system_score_gemma":0.002370292,"threshold_uncertainty_score":0.02194351},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7827202,0.0011010614,0.13319711,0.0010191362,0.00021779517,0.00005296482,0.00031812734,0.00024948295,0.08112418],"genre_scores_gemma":[0.9864245,0.0003685044,0.0038023158,0.000056533165,0.00009702305,0.000034256936,0.00016129685,0.000056398163,0.0089992955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962735,0.00007267575,0.000015507434,0.00006256986,0.000101551224,0.00012040155],"domain_scores_gemma":[0.99928814,0.0002808298,0.00012535183,0.00006373535,0.00014507641,0.000096930824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005790783,0.0009187471,0.0008208902,0.0025348028,0.0012803308,0.0033491962,0.0007990173,0.0011332403,0.004330667],"category_scores_gemma":[0.00244687,0.00044036022,0.00074615487,0.001358154,0.0023384008,0.0026406783,0.0016117372,0.0019199955,0.00082970026],"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.0000645435,0.000018944636,0.0002670248,0.000023644983,0.000016038488,0.00014179578,0.00017465181,0.0015183248,0.0024559335,0.99165934,0.0004510715,0.0032087425],"study_design_scores_gemma":[0.00004696836,0.000037450474,0.00051827135,0.000018024079,0.0000146876655,0.00016747731,0.00022428109,0.013955638,0.0025050747,0.9805792,0.0019046228,0.00002827231],"about_ca_topic_score_codex":0.0011595318,"about_ca_topic_score_gemma":0.000694462,"teacher_disagreement_score":0.004330667,"about_ca_system_score_codex":0.0015958385,"about_ca_system_score_gemma":0.00068374246,"threshold_uncertainty_score":0.014487505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77857494,0.000829098,0.095203854,0.0025963609,0.0006229492,0.00008061858,0.00041456698,0.00035312405,0.12132441],"genre_scores_gemma":[0.9741945,0.00028385204,0.010948629,0.0003997706,0.00033712396,0.0000626198,0.00020887108,0.00012472809,0.013439895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998765,0.00035057619,0.00004472507,0.00014257776,0.00036711278,0.00033006535],"domain_scores_gemma":[0.99711347,0.0013860872,0.00037360005,0.00033472784,0.00038801756,0.00040415104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012084836,0.0007547346,0.00082807324,0.0023942967,0.0022402809,0.002638997,0.0010787362,0.0014236469,0.0061101974],"category_scores_gemma":[0.0060546375,0.0004528914,0.0006314983,0.0009728353,0.003027511,0.002559417,0.002109749,0.0024792994,0.0008821447],"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.00009439971,0.000025544485,0.00018475375,0.000022786262,0.0000052101277,0.00010017403,0.00011192819,0.0025908204,0.0012961288,0.99162334,0.0010149931,0.0029299748],"study_design_scores_gemma":[0.000022835959,0.000024967014,0.00021940707,0.000029580546,0.000005013324,0.00017073008,0.00007428475,0.023491008,0.0012816759,0.9732771,0.0013735141,0.00002993614],"about_ca_topic_score_codex":0.0009938788,"about_ca_topic_score_gemma":0.0010605964,"teacher_disagreement_score":0.0061101974,"about_ca_system_score_codex":0.0014919093,"about_ca_system_score_gemma":0.0011911517,"threshold_uncertainty_score":0.020440638},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5516888,0.00032328794,0.33337238,0.0026866912,0.0003520428,0.00023244899,0.0012118113,0.0017557956,0.1083767],"genre_scores_gemma":[0.94992316,0.0001791036,0.028292563,0.00033446666,0.00010760773,0.00012683014,0.0011480326,0.00024656142,0.019641638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971636,0.00025431957,0.00017712174,0.00065759773,0.00094951974,0.00079776224],"domain_scores_gemma":[0.99538124,0.0021942924,0.0004557871,0.00072370464,0.0007892046,0.00045579494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015370073,0.00063536473,0.0010891758,0.0011345635,0.0029968726,0.0039411536,0.0015442667,0.0013823208,0.009842014],"category_scores_gemma":[0.0074378327,0.00064716506,0.0015473171,0.001052563,0.003735019,0.005205388,0.004449119,0.0038001088,0.0018724663],"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.00020396049,0.000049012782,0.0009643885,0.000080695754,0.000023547067,0.00033716994,0.0004061966,0.00254024,0.0036605247,0.9829562,0.0023113706,0.0064667733],"study_design_scores_gemma":[0.00005722902,0.00006315987,0.00047764793,0.000037922153,0.000030610234,0.00031464195,0.00025567578,0.009600629,0.010135562,0.97030276,0.008675659,0.00004847519],"about_ca_topic_score_codex":0.0029710466,"about_ca_topic_score_gemma":0.0017302015,"teacher_disagreement_score":0.009842014,"about_ca_system_score_codex":0.0018425427,"about_ca_system_score_gemma":0.0026581478,"threshold_uncertainty_score":0.03292477},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6774865,0.00044027233,0.24118194,0.0009574004,0.00033206618,0.000066289715,0.00042993462,0.00041411995,0.07869142],"genre_scores_gemma":[0.9640199,0.00024232261,0.01576604,0.0003377252,0.00026694336,0.000053468208,0.0002951062,0.00021350784,0.018804928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987619,0.00032783882,0.000046960897,0.00028135726,0.00026209804,0.0003199856],"domain_scores_gemma":[0.99784565,0.0008468887,0.000291837,0.00030354466,0.00035690557,0.0003552379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011570685,0.00055446883,0.00075283577,0.0017454763,0.0019120225,0.0019227838,0.0011962388,0.000666291,0.006607701],"category_scores_gemma":[0.0040349183,0.00042226308,0.0006609197,0.001517731,0.0030782819,0.00347934,0.0016828994,0.0020905044,0.0010265865],"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.00007170194,0.000019967996,0.00019558442,0.000013353665,0.000004987911,0.00004474131,0.00013678704,0.0010134095,0.0018663777,0.9917156,0.0005460019,0.004371456],"study_design_scores_gemma":[0.000012025452,0.000036073827,0.00036067824,0.000005603298,0.000005681602,0.00011043939,0.000049048893,0.007282059,0.0018852286,0.9887271,0.001504067,0.000021971657],"about_ca_topic_score_codex":0.0012361094,"about_ca_topic_score_gemma":0.0009769272,"teacher_disagreement_score":0.006607701,"about_ca_system_score_codex":0.0010213407,"about_ca_system_score_gemma":0.0008332323,"threshold_uncertainty_score":0.022104979},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72151023,0.000536045,0.27012125,0.00033868878,0.000040893818,0.00006773824,0.00032385153,0.00024764496,0.00681368],"genre_scores_gemma":[0.9787369,0.00015310681,0.019253349,0.000050075243,0.00004119631,0.00007546592,0.00022513165,0.000036263267,0.0014285109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858785,0.0003319844,0.0000871542,0.00025502843,0.0005922262,0.00014578458],"domain_scores_gemma":[0.98966295,0.0061997906,0.0018530968,0.00068942487,0.0011709308,0.0004238261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001398272,0.00040186933,0.0005377403,0.0020544052,0.0006622182,0.0011501592,0.0006584884,0.00059569394,0.002010126],"category_scores_gemma":[0.012224405,0.00021934186,0.00038613778,0.001059271,0.0017167463,0.0019842659,0.0010630703,0.000900363,0.00025380746],"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.0014427529,0.00008665628,0.013484392,0.00036532865,0.00009113193,0.00042467128,0.0006720541,0.43023303,0.049986627,0.44623858,0.0016052097,0.055369623],"study_design_scores_gemma":[0.000025560557,0.00019409033,0.003143169,0.00004111289,0.000014324807,0.00017215354,0.00010485576,0.8770007,0.010308075,0.10795553,0.0009834738,0.000056957135],"about_ca_topic_score_codex":0.0012500999,"about_ca_topic_score_gemma":0.0005048109,"teacher_disagreement_score":0.0020544052,"about_ca_system_score_codex":0.0010235962,"about_ca_system_score_gemma":0.0005919492,"threshold_uncertainty_score":0.007426679},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52717346,0.0008708424,0.33878323,0.0041567213,0.0006446236,0.00018407284,0.0007108911,0.00056677556,0.12690932],"genre_scores_gemma":[0.94083554,0.0003619408,0.038036376,0.00068722497,0.00025547278,0.0001228904,0.00035447563,0.00016360224,0.019182436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798465,0.0006326034,0.00010690791,0.00022771464,0.00055170077,0.0004964215],"domain_scores_gemma":[0.9964941,0.0014936572,0.00039709092,0.00051141024,0.0006151326,0.0004886249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001837632,0.0006660771,0.0008377503,0.0013264765,0.0017248868,0.0033842174,0.0011185277,0.0013221325,0.0070423596],"category_scores_gemma":[0.0056033875,0.0004510152,0.0007845261,0.0009708211,0.0027097114,0.0044667893,0.002719993,0.0024573924,0.0008871551],"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.00009652714,0.000027944574,0.00010008473,0.000020209507,0.0000058346873,0.000016777836,0.00006581305,0.0026211774,0.0005456083,0.9917972,0.00089488114,0.0038078486],"study_design_scores_gemma":[0.000024679799,0.000021200094,0.000071398455,0.000014278696,0.0000068155423,0.000032966662,0.00005385333,0.012000339,0.0011215813,0.9855451,0.0010939706,0.0000138299665],"about_ca_topic_score_codex":0.0008738755,"about_ca_topic_score_gemma":0.0010271432,"teacher_disagreement_score":0.0070423596,"about_ca_system_score_codex":0.0018866882,"about_ca_system_score_gemma":0.0022467074,"threshold_uncertainty_score":0.023558974},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015705006,0.000295596,0.9788871,0.00027842604,0.00011046131,0.000085886684,0.00014665474,0.0014677697,0.0030231625],"genre_scores_gemma":[0.18709828,0.00053788983,0.802392,0.00026157056,0.00031300748,0.0002937846,0.0009168188,0.0003721706,0.007814448],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989612,0.0002167137,0.00006550659,0.00019553167,0.00042380096,0.00013717335],"domain_scores_gemma":[0.99760336,0.0010755333,0.0001467438,0.00062922935,0.0004218395,0.00012336495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011178831,0.0012193762,0.001022191,0.0012900003,0.0010161041,0.0017712169,0.001449143,0.001051459,0.009584542],"category_scores_gemma":[0.0076679494,0.0005484259,0.0008600759,0.0020236888,0.0010077428,0.003945585,0.003040174,0.0027073284,0.0033376873],"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.00062179356,0.0002230757,0.00096513616,0.0002843205,0.00008691379,0.000073166906,0.00029644978,0.06208115,0.012685241,0.20276846,0.014500447,0.7054139],"study_design_scores_gemma":[0.00018491555,0.000163097,0.00035968327,0.000048567686,0.00005316509,0.000117049625,0.00016627574,0.44195923,0.011278473,0.5350947,0.010528702,0.000046157696],"about_ca_topic_score_codex":0.0014850096,"about_ca_topic_score_gemma":0.004345329,"teacher_disagreement_score":0.009584542,"about_ca_system_score_codex":0.0008168946,"about_ca_system_score_gemma":0.0014184695,"threshold_uncertainty_score":0.032063484},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028969888,0.00022442722,0.9362714,0.0013220204,0.00013342411,0.00012466597,0.00082509423,0.0009853698,0.03114368],"genre_scores_gemma":[0.7728924,0.00029957373,0.20191519,0.00046032184,0.00023925566,0.0002857612,0.0017234673,0.00033524598,0.021848733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987669,0.00041487112,0.00007822546,0.00019879788,0.00039613902,0.00014511764],"domain_scores_gemma":[0.997343,0.0014478104,0.0001603745,0.000481733,0.00044632758,0.00012081022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012244595,0.00054075173,0.0006741288,0.0009263862,0.0010751535,0.0023094972,0.0016345108,0.0011244296,0.013275043],"category_scores_gemma":[0.00683334,0.0004681473,0.0017639407,0.0009805248,0.0018040274,0.0035107492,0.002067055,0.0024955666,0.001574982],"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.000029682851,0.000030095047,0.0002392209,0.00003163076,0.000014533972,0.00005502935,0.00009273208,0.053766742,0.00046008095,0.9322529,0.0024233232,0.010604146],"study_design_scores_gemma":[0.000010946569,0.000007558122,0.000056258952,0.000009406809,0.000008785051,0.000020733927,0.00001971877,0.18844472,0.00035147934,0.8087542,0.0023070215,0.000009224548],"about_ca_topic_score_codex":0.0053156,"about_ca_topic_score_gemma":0.009182884,"teacher_disagreement_score":0.013275043,"about_ca_system_score_codex":0.0020034744,"about_ca_system_score_gemma":0.0018007605,"threshold_uncertainty_score":0.044409513},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14822349,0.0012470648,0.7692149,0.0030683775,0.0009806711,0.00013949591,0.0010026661,0.0008510076,0.07527232],"genre_scores_gemma":[0.81751055,0.0011159559,0.12131151,0.0011234676,0.0009499103,0.00039237522,0.0008003839,0.00045476816,0.056341093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858874,0.00035868693,0.00008949924,0.00022200255,0.0004522274,0.00028880683],"domain_scores_gemma":[0.997644,0.0007410032,0.0002492948,0.0007644223,0.00042809354,0.00017315078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013210047,0.0007502346,0.00073202536,0.0017799736,0.0011380694,0.0023103764,0.0011219997,0.0013413465,0.0074814237],"category_scores_gemma":[0.006374766,0.00032370145,0.0008510922,0.0020218955,0.0025174948,0.003306361,0.0023580638,0.0022641132,0.0022692506],"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.000042440453,0.000010071929,0.00010672205,0.000019824303,0.0000048987795,0.000028716016,0.000046654546,0.0018879242,0.0010838232,0.98466176,0.0015512471,0.010555891],"study_design_scores_gemma":[0.0000096698395,0.000015175682,0.00010342637,0.000019563777,0.000006206333,0.00010125003,0.000023721708,0.018938132,0.0017930933,0.9754596,0.003510348,0.000019710713],"about_ca_topic_score_codex":0.0007398983,"about_ca_topic_score_gemma":0.00061937503,"teacher_disagreement_score":0.0074814237,"about_ca_system_score_codex":0.0010499461,"about_ca_system_score_gemma":0.0016928287,"threshold_uncertainty_score":0.025027871},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25148255,0.00046407932,0.66752684,0.0022456427,0.00081465585,0.00021539477,0.0008940373,0.0018720223,0.07448488],"genre_scores_gemma":[0.8467425,0.0003129738,0.120813996,0.00065628503,0.00030384146,0.00024224167,0.0006176479,0.000574418,0.029736085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991359,0.00017890324,0.00003457438,0.00014021441,0.0003274028,0.00018300246],"domain_scores_gemma":[0.99891675,0.000344809,0.00010616712,0.00020725626,0.00028493415,0.00014001504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048406908,0.0004992799,0.0007342492,0.0009900758,0.0013988934,0.0020643903,0.00094315584,0.0011173248,0.00688893],"category_scores_gemma":[0.001741481,0.00027185716,0.0006269637,0.0010215358,0.0016048866,0.0016428095,0.0014814847,0.0019315447,0.0017664043],"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.00013361985,0.00007330713,0.00025535122,0.00006419501,0.0000126062805,0.00016422187,0.00015387208,0.0069695828,0.008413879,0.96435446,0.0034211196,0.015983792],"study_design_scores_gemma":[0.00007692335,0.00009355836,0.0002595339,0.000047367557,0.000026763795,0.000250194,0.000101576305,0.11086576,0.014349386,0.8653107,0.008521106,0.000097071315],"about_ca_topic_score_codex":0.0014370051,"about_ca_topic_score_gemma":0.0012514944,"teacher_disagreement_score":0.00688893,"about_ca_system_score_codex":0.0009873873,"about_ca_system_score_gemma":0.0015205808,"threshold_uncertainty_score":0.023045778},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6139914,0.0018163002,0.18960525,0.0026268784,0.00090612785,0.00008555585,0.00040347254,0.00036528744,0.19019976],"genre_scores_gemma":[0.95232415,0.00093400996,0.019230884,0.0004867612,0.00075840455,0.0000685599,0.00065534184,0.00011486934,0.025427077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900645,0.00026100795,0.000072773924,0.00012441765,0.00032337473,0.0002120994],"domain_scores_gemma":[0.99749494,0.0008607389,0.0002650361,0.0003576867,0.00051997765,0.00050157687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018776684,0.0007265654,0.0008450215,0.0039497716,0.002409572,0.003589362,0.001479864,0.0013193783,0.005708513],"category_scores_gemma":[0.0047100554,0.00025317713,0.0006541147,0.0020819767,0.0046611656,0.005740291,0.0030699696,0.0029237042,0.0011391965],"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.00003173889,0.000022155371,0.0005428875,0.000022126907,0.0000028083546,0.000063199164,0.00015207972,0.0004516591,0.00048069854,0.9906178,0.0009050027,0.00670774],"study_design_scores_gemma":[0.0000059281388,0.000011813519,0.00041858503,0.000021344242,0.000003150264,0.00015741732,0.000077335615,0.0060871686,0.00031627296,0.9903611,0.0025284493,0.000011537438],"about_ca_topic_score_codex":0.0007361023,"about_ca_topic_score_gemma":0.00039701854,"teacher_disagreement_score":0.005708513,"about_ca_system_score_codex":0.0012262353,"about_ca_system_score_gemma":0.0009109822,"threshold_uncertainty_score":0.019096911},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5479064,0.004216706,0.33185354,0.0016181706,0.0014229624,0.00036554283,0.0004500329,0.00069777947,0.11146889],"genre_scores_gemma":[0.89345026,0.0021792632,0.07492108,0.00048574118,0.0007498118,0.00021826067,0.0002833303,0.00015239984,0.02755992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997043,0.00008616911,0.000020713966,0.00005234197,0.00007444801,0.00006199163],"domain_scores_gemma":[0.9994246,0.0001381616,0.00014141049,0.00008633326,0.000091577735,0.00011790931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034197868,0.00068953563,0.00044751764,0.0016227044,0.0008760197,0.0014825502,0.0006061381,0.000850344,0.005533535],"category_scores_gemma":[0.001637207,0.00028062297,0.0005738181,0.0010950681,0.002016766,0.002528582,0.0010890337,0.0010214439,0.0010663632],"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.00005345524,0.000023599112,0.0002496385,0.00004255378,0.000008244377,0.00013224268,0.00015595599,0.002677796,0.0049532945,0.97774214,0.0006866594,0.013274445],"study_design_scores_gemma":[0.000029325789,0.000115296694,0.00037620333,0.00003175701,0.000013506282,0.00047291236,0.000121804995,0.020890737,0.0054638768,0.96047986,0.011949289,0.000055505552],"about_ca_topic_score_codex":0.00031285404,"about_ca_topic_score_gemma":0.00042687776,"teacher_disagreement_score":0.005533535,"about_ca_system_score_codex":0.0005701209,"about_ca_system_score_gemma":0.0008277198,"threshold_uncertainty_score":0.018511534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02034633,0.00044689744,0.96106,0.00051251805,0.0001761549,0.00012090427,0.00023029333,0.0025427558,0.014564241],"genre_scores_gemma":[0.3364628,0.0006517675,0.63955665,0.0004666907,0.0003551557,0.00019949133,0.00091080193,0.0011693232,0.020227289],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849737,0.0003499674,0.000067820176,0.00024330922,0.00062202924,0.00021946512],"domain_scores_gemma":[0.99777716,0.00092436554,0.0000916258,0.0008427138,0.00025534685,0.00010877244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013444653,0.0013729394,0.001286167,0.0015952019,0.0009347029,0.0022269133,0.0018070894,0.0010462966,0.021114111],"category_scores_gemma":[0.005974295,0.00060234434,0.0009958128,0.0021781756,0.0011615802,0.0060955854,0.0039739734,0.0028005182,0.0051087267],"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.00090022193,0.0003357366,0.0005957439,0.00036342224,0.00007242428,0.00011748773,0.00032669533,0.0292219,0.012250444,0.4486115,0.018491058,0.48871344],"study_design_scores_gemma":[0.00018560854,0.00017107658,0.00018008679,0.0000645881,0.000056142944,0.00017823707,0.00015728749,0.33434066,0.018862823,0.62474746,0.021005655,0.000050386436],"about_ca_topic_score_codex":0.0015146681,"about_ca_topic_score_gemma":0.0029270216,"teacher_disagreement_score":0.021114111,"about_ca_system_score_codex":0.00081384956,"about_ca_system_score_gemma":0.0012663667,"threshold_uncertainty_score":0.07063371},"labels":[],"label_agreement":null}]}