{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":29,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":29,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"9dff181ab68f","filters":{"venue":"Applicable Algebra in Engineering Communication and Computing"}},"results":[{"id":"W2041369703","doi":"10.1007/s002000100081","title":"Constrained Principal Component Analysis: A Comprehensive Theory","year":2001,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Spectroscopy and Chemometric Analyses","field":"Chemistry","cited_by":119,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria; McGill University","funders":"","keywords":"Principal component analysis; Canonical correlation; Correspondence analysis; Matrix (chemical analysis); Singular value decomposition; Canonical form; Metric (unit); Component analysis; Mathematics; Computer science; Canonical analysis; Variety (cybernetics); Applied mathematics; Algorithm; Statistics; Pure mathematics","authors":[{"name":"Yoshio Takane","is_ca":true},{"name":"Michael A. Hunter","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01093422505226197,"gpt":0.2494492427574874,"spread":0.2385150177052255,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004894617,0.00158845,0.002379474,0.003109072,0.001294586,0.00549918,0.002529261,0.001858449,0.002499982],"category_scores_gemma":[0.0105458,0.001019477,0.001643328,0.005145576,0.004566448,0.005290954,0.002997214,0.004030301,0.001812143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001095811,"about_ca_system_score_gemma":0.002845991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002307447,"about_ca_topic_score_gemma":0.001901518,"domain_scores_codex":[0.996837,0.0011276,0.0002180361,0.0004522244,0.001271388,0.00009370319],"domain_scores_gemma":[0.9959195,0.002367086,0.000219565,0.0005423463,0.0008353327,0.0001162504],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001671935,0.00004026481,0.0003205628,0.0003208533,0.00009570825,0.00006065668,0.0001226951,0.02915482,0.0005123297,0.8670336,0.007444901,0.0948768],"study_design_scores_gemma":[0.000006871299,0.00001382608,0.0001655639,0.00006120457,0.00002399785,0.00005595361,0.0000220767,0.09415988,0.0002274522,0.8934937,0.01173956,0.00003006367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007304856,0.005464394,0.9901439,0.0007773591,0.0001094444,0.00002083597,0.0001095761,0.00009803296,0.002545993],"genre_scores_gemma":[0.1096579,0.03686535,0.8406098,0.001171383,0.002765974,0.0005205901,0.0008838062,0.0002872495,0.00723782],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00549918,"threshold_uncertainty_score":0.02588552,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080520202","doi":"10.1007/s00200-006-0196-1","title":"General relativity and quantum mechanics: towards a generalization of the Lambert W function A Generalization of the Lambert W Function","year":2006,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Sports Dynamics and Biomechanics","field":"Engineering","cited_by":86,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Generalization; Theory of relativity; Mathematics; Lambert W function; Function (biology); General relativity; Mathematical analysis; Mathematical physics; Classical mechanics; Pure mathematics; Physics","authors":[{"name":"Robert B. Mann","is_ca":true},{"name":"Roberto E. Martínez","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.003860550060385986,"gpt":0.1717899451693302,"spread":0.1679293951089442,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001808085,0.0009075899,0.001105634,0.001610023,0.001416038,0.002578302,0.001330706,0.001737521,0.002729184],"category_scores_gemma":[0.002644217,0.0004636649,0.001436376,0.001449471,0.00431926,0.006025363,0.002290911,0.003728352,0.00118087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001178771,"about_ca_system_score_gemma":0.001198155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002290492,"about_ca_topic_score_gemma":0.001017593,"domain_scores_codex":[0.999352,0.0002495792,0.00003651569,0.0001318727,0.0001588463,0.00007109711],"domain_scores_gemma":[0.9992782,0.0001848035,0.00008604019,0.000173738,0.0001796916,0.00009753463],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003654543,0.000004175371,0.00002812937,0.00001447544,0.000003774746,0.00002195145,0.0000878729,0.0009308285,0.0003547517,0.9950015,0.0008283099,0.002720574],"study_design_scores_gemma":[0.000002562475,0.000008947687,0.00004718134,0.000009239943,0.000003050447,0.00003051903,0.00002398397,0.006530891,0.0001055844,0.9861837,0.007043347,0.00001085999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.043438,0.009148404,0.8475097,0.008087903,0.002165474,0.00006928977,0.0001973714,0.000454338,0.08892942],"genre_scores_gemma":[0.6258664,0.01311417,0.2908179,0.004968706,0.006979697,0.0002520596,0.0004153364,0.0005732637,0.05701248],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002729184,"threshold_uncertainty_score":0.009562194,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2164838307","doi":"10.1007/s00200-009-0117-1","title":"On the geometry of polar varieties","year":2010,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Correctness; Singular point of an algebraic variety; Mathematics; Polar; Variety (cybernetics); Algebraic variety; Degree (music); Polar coordinate system; Singular point of a curve; Point (geometry); Algebraic geometry; Algebraic number; Algorithm; Algebra over a field; Pure mathematics; Geometry; Mathematical analysis","authors":[{"name":"Bernd Bank","is_ca":false},{"name":"M Giusti","is_ca":false},{"name":"Joos Heintz","is_ca":false},{"name":"Mohab Safey El Din","is_ca":false},{"name":"Éric Schost","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005583937670656649,"gpt":0.2005327999258704,"spread":0.1949488622552137,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006254072,0.0006774475,0.0006531722,0.001473389,0.001621852,0.003303284,0.0006693476,0.0005328595,0.0088799],"category_scores_gemma":[0.001376949,0.0003896272,0.000462742,0.001438397,0.004330747,0.006983255,0.002753042,0.003083809,0.001734711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009443189,"about_ca_system_score_gemma":0.0004622289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001154721,"about_ca_topic_score_gemma":0.0005679584,"domain_scores_codex":[0.9995294,0.0001647004,0.00001721801,0.00008413444,0.0001332291,0.0000713355],"domain_scores_gemma":[0.999487,0.0002419844,0.00004403968,0.00005386939,0.00009323174,0.00007985401],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007909859,0.000002849546,0.00003716021,0.00001015169,0.00000120667,0.0000171639,0.00008617067,0.0002604629,0.0001250184,0.9971752,0.0006759255,0.001600839],"study_design_scores_gemma":[0.000003719762,0.000004897282,0.00007662091,0.000006837821,0.000001934369,0.00003529235,0.00008028631,0.0007022509,0.0001000281,0.9937106,0.005273964,0.000003514321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1954448,0.01026281,0.2227799,0.009271787,0.001411067,0.00007048221,0.0007872538,0.0002417964,0.5597302],"genre_scores_gemma":[0.9091787,0.008561244,0.01903193,0.0008991919,0.00152799,0.00005311087,0.0006176081,0.0001636293,0.05996665],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0088799,"threshold_uncertainty_score":0.02970624,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1760096751","doi":"10.1007/s00200-013-0188-x","title":"Construction of cyclic codes over $$\\mathbb F _2+u\\mathbb F _2$$ F 2 + u F 2 for DNA computing","year":2013,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Complement (music); BCH code; Ring (chemistry); Constraint (computer-aided design); Combinatorics; Construct (python library); Physics; Mathematics; DNA; Discrete mathematics; Computer science; Chemistry; Decoding methods; Algorithm; Biology; Genetics; Computer network; Geometry","authors":[{"name":"Kenza Guenda","is_ca":true},{"name":"T. Aaron Gulliver","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005864888415478002,"gpt":0.222129005381761,"spread":0.216264116966283,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004181937,0.0006959991,0.0005913095,0.001068693,0.001296866,0.001173544,0.0007032278,0.0007272104,0.006456665],"category_scores_gemma":[0.001502167,0.0003085654,0.0008277821,0.001196246,0.001130885,0.0008758118,0.001999743,0.001322535,0.001602168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001022984,"about_ca_system_score_gemma":0.002392324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0016755,"about_ca_topic_score_gemma":0.0017241,"domain_scores_codex":[0.999325,0.0001030608,0.0000347603,0.0000959922,0.0002333317,0.0002077406],"domain_scores_gemma":[0.9992144,0.0002374776,0.00007550662,0.0001417438,0.000193259,0.0001376022],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000248446,0.0001409948,0.0005006032,0.0001608661,0.00002219619,0.0003330414,0.0003827771,0.005498643,0.02023611,0.9039397,0.01008261,0.05845407],"study_design_scores_gemma":[0.0001537694,0.0003774433,0.0006941417,0.0001262997,0.00006425817,0.0005149168,0.000221474,0.03700654,0.06271411,0.833627,0.06432294,0.0001771455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3140708,0.0008058098,0.5768645,0.001776097,0.001162514,0.0006854843,0.001748415,0.002767995,0.1001183],"genre_scores_gemma":[0.7841538,0.0005614913,0.178924,0.0007766224,0.000338293,0.0005443777,0.001794094,0.0006324674,0.03227493],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006456665,"threshold_uncertainty_score":0.02159971,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1990568802","doi":"10.1007/s00200-012-0179-3","title":"Multi-point evaluation in higher dimensions","year":2012,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Agence Nationale de la Recherche","keywords":"Monomial; Tensor product; Interpolation (computer graphics); Multiplication (music); Mathematics; Point (geometry); Product (mathematics); Series (stratigraphy); Combinatorics; Univariate; Discrete mathematics; Algebra over a field; Pure mathematics; Computer science; Geometry; Multivariate statistics","authors":[{"name":"Joris van der Hoeven","is_ca":false},{"name":"Éric Schost","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02954449687721987,"gpt":0.2622690116094465,"spread":0.2327245147322266,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001922607,0.001118346,0.001794737,0.003170422,0.00201486,0.003539742,0.001860384,0.001063165,0.01392637],"category_scores_gemma":[0.004201799,0.0005336514,0.001167593,0.002421596,0.003495831,0.007197849,0.003713445,0.003036334,0.002292083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001728658,"about_ca_system_score_gemma":0.0007383881,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001016616,"about_ca_topic_score_gemma":0.001495142,"domain_scores_codex":[0.9984782,0.0004328258,0.00008526836,0.0001856724,0.0005927222,0.0002252383],"domain_scores_gemma":[0.998669,0.0003765929,0.00009446842,0.0003308649,0.0003551048,0.0001739062],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002625005,0.00002036565,0.00008612291,0.00004613728,0.00001110925,0.00004254348,0.0000910627,0.001892504,0.0004411855,0.9884114,0.001184333,0.007746939],"study_design_scores_gemma":[0.00000778639,0.00001135575,0.00007790144,0.00001344353,0.000007226771,0.00004147962,0.00003226394,0.01304657,0.0007636432,0.9830928,0.002891893,0.00001361399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1638727,0.002546119,0.6565253,0.002632684,0.001639051,0.0001506395,0.0003367856,0.00121825,0.1710785],"genre_scores_gemma":[0.842602,0.001116528,0.09189754,0.000609526,0.0008403969,0.0001301634,0.0002018931,0.0007215666,0.06188047],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01392637,"threshold_uncertainty_score":0.0465883,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2112566740","doi":"10.1007/s00200-005-0186-8","title":"Cryptographic implications of Hess' generalized GHS attack","year":2005,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete logarithm; Finite field; Generalization; Logarithm; Elliptic curve; Mathematics; Cryptography; Field (mathematics); Pure mathematics; Discrete mathematics; Computer science; Mathematical analysis; Public-key cryptography; Algorithm; Encryption; Computer security","authors":[{"name":"Alfred Menezes","is_ca":true},{"name":"Edlyn Teske","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01067644334757325,"gpt":0.238737300977275,"spread":0.2280608576297017,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00138588,0.0004540728,0.0006716365,0.001020975,0.001294142,0.00203539,0.0007134257,0.001706289,0.008779906],"category_scores_gemma":[0.004114216,0.0002511288,0.0005280265,0.001034752,0.004485775,0.004815158,0.002614914,0.002367742,0.001124851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009968712,"about_ca_system_score_gemma":0.0006290906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004165792,"about_ca_topic_score_gemma":0.0002743621,"domain_scores_codex":[0.9985549,0.0005348537,0.00004497037,0.0001384414,0.0004566255,0.0002702067],"domain_scores_gemma":[0.9984212,0.0007200975,0.0001143042,0.0004778485,0.0001809879,0.00008559482],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008345476,0.000009527065,0.0001087028,0.0000188151,0.000006755418,0.0001104787,0.00007507209,0.002046032,0.000743532,0.9899033,0.001741919,0.005152372],"study_design_scores_gemma":[0.00001622626,0.00001605435,0.0001009955,0.000008810342,0.000004067263,0.0001307136,0.00004972821,0.006262904,0.0006818508,0.9893694,0.003348118,0.00001122895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3976116,0.003274022,0.1804561,0.02849499,0.001815066,0.0001406819,0.0004683144,0.000550857,0.3871883],"genre_scores_gemma":[0.9766738,0.0005846773,0.006349821,0.0009778801,0.0004824602,0.00002670683,0.0000585107,0.00004026989,0.01480582],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008779906,"threshold_uncertainty_score":0.02937174,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064281699","doi":"10.1007/s002000100092","title":"Isomorphism Classes of Genus-2 Hyperelliptic Curves Over Finite Fields","year":2002,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Isomorphism (crystallography); Genus; Mathematics; Finite field; Pure mathematics; Discrete mathematics; Zoology; Biology; Crystallography; Chemistry","authors":[{"name":"Luis Hernández Encinas","is_ca":false},{"name":"Alfred Menezes","is_ca":true},{"name":"J. Muñoz Masqué","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01071415078121423,"gpt":0.2033517285445284,"spread":0.1926375777633142,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009259401,0.001239305,0.001012442,0.004666365,0.002791776,0.004905608,0.001285507,0.001705756,0.01327715],"category_scores_gemma":[0.00239968,0.0006522438,0.0008960001,0.002592896,0.003409155,0.006742134,0.003415657,0.003114702,0.0008079538],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002192196,"about_ca_system_score_gemma":0.000673366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009624789,"about_ca_topic_score_gemma":0.0005610494,"domain_scores_codex":[0.9990947,0.0001627671,0.0000369573,0.0001559267,0.0002017064,0.0003479552],"domain_scores_gemma":[0.9982687,0.0007208498,0.0002781574,0.00014566,0.0001123767,0.0004742424],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000339518,0.0001886551,0.004124511,0.00006640683,0.00002817554,0.000567311,0.001778467,0.001726162,0.004136636,0.9696127,0.001757107,0.01567448],"study_design_scores_gemma":[0.00007633709,0.00008527737,0.005091933,0.00004718671,0.00003490869,0.0004967711,0.0008010438,0.005138341,0.002866325,0.9802346,0.005085236,0.00004213801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9428983,0.0003738578,0.009155277,0.0008636992,0.00008629791,0.00004647846,0.0001837382,0.0002210679,0.04617127],"genre_scores_gemma":[0.9859438,0.0004139529,0.001821697,0.0001259462,0.0002124757,0.00003452133,0.0004062674,0.00007678771,0.01096447],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01327715,"threshold_uncertainty_score":0.04441649,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021947009","doi":"10.1007/s00200-012-0170-z","title":"Cryptanalysis of a key exchange protocol based on the endomorphisms ring End $${(\\mathbb{Z}_{p} \\times \\mathbb{Z}_{p^2})}$$","year":2012,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Endomorphism; Key exchange; Mathematics; Polynomial ring; Ring (chemistry); Combinatorics; Polynomial; Cryptanalysis; Discrete mathematics; Homogeneous; Endomorphism ring; Algorithm; Computer science; Public-key cryptography; Mathematical analysis; Cryptography","authors":[{"name":"Abdel Alim Kamal","is_ca":true},{"name":"Amr Youssef","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01192925973261772,"gpt":0.2280390128712923,"spread":0.2161097531386746,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001986422,0.0006130379,0.0008670998,0.0007211331,0.00109273,0.001981776,0.001066172,0.001589403,0.003548384],"category_scores_gemma":[0.0031939,0.0003923001,0.001023013,0.0005907416,0.002095212,0.003355867,0.002116057,0.001838985,0.0006295206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00121377,"about_ca_system_score_gemma":0.001842572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003858105,"about_ca_topic_score_gemma":0.0003255007,"domain_scores_codex":[0.997843,0.00059807,0.0001186875,0.0003483817,0.0007080352,0.0003838298],"domain_scores_gemma":[0.9982808,0.0008361546,0.0001761219,0.0004529727,0.000153797,0.0001002322],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001529932,0.0002657646,0.001567383,0.0001289664,0.0001787907,0.001059434,0.0003900108,0.03870001,0.03314715,0.8898333,0.003452713,0.02974663],"study_design_scores_gemma":[0.0004274213,0.0005578034,0.001175155,0.00005544747,0.0002129134,0.001240648,0.0001103419,0.4921772,0.06781784,0.4291295,0.006961101,0.0001346395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3446453,0.0004097926,0.6248935,0.003036418,0.0004053658,0.0003467125,0.0002520985,0.001491309,0.02451952],"genre_scores_gemma":[0.9662064,0.0001104756,0.02771784,0.000198397,0.00005363637,0.00007498874,0.00007528461,0.00005847419,0.005504437],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003548384,"threshold_uncertainty_score":0.0118705,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964083059","doi":"10.1007/s00200-019-00381-3","title":"On extremal double circulant self-dual codes of lengths 90–96","year":2019,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Japan Society for the Promotion of Science","keywords":"Circulant matrix; Dual (grammatical number); Mathematics; Code (set theory); Combinatorics; Discrete mathematics; Computer science","authors":[{"name":"T. Aaron Gulliver","is_ca":true},{"name":"Masaaki Harada","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006535158867155918,"gpt":0.20682669579713,"spread":0.2002915369299741,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001208484,0.0007547346,0.0008280732,0.002394297,0.002240281,0.002638997,0.001078736,0.001423647,0.006110197],"category_scores_gemma":[0.006054637,0.0004528914,0.0006314983,0.0009728353,0.003027511,0.002559417,0.002109749,0.002479299,0.0008821447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001491909,"about_ca_system_score_gemma":0.001191152,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009938788,"about_ca_topic_score_gemma":0.001060596,"domain_scores_codex":[0.998765,0.0003505762,0.00004472507,0.0001425778,0.0003671128,0.0003300653],"domain_scores_gemma":[0.9971135,0.001386087,0.0003736001,0.0003347278,0.0003880176,0.000404151],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009439971,0.00002554448,0.0001847537,0.00002278626,0.000005210128,0.000100174,0.0001119282,0.00259082,0.001296129,0.9916233,0.001014993,0.002929975],"study_design_scores_gemma":[0.00002283596,0.00002496701,0.0002194071,0.00002958055,0.000005013324,0.0001707301,0.00007428475,0.02349101,0.001281676,0.9732771,0.001373514,0.00002993614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7785749,0.000829098,0.09520385,0.002596361,0.0006229492,0.00008061858,0.000414567,0.0003531241,0.1213244],"genre_scores_gemma":[0.9741945,0.000283852,0.01094863,0.0003997706,0.000337124,0.0000626198,0.0002088711,0.0001247281,0.01343989],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006110197,"threshold_uncertainty_score":0.02044064,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071302523","doi":"10.1007/s00200-005-0187-7","title":"On the low hamming weight discrete logarithm problem for nonadjacent representations","year":2005,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Discrete logarithm; Logarithm; Mathematics; Elliptic curve cryptography; Cryptography; Cryptosystem; Elliptic curve; Post-quantum cryptography; Hyperelliptic curve cryptography; Discrete mathematics; Algorithm; Computer science; Public-key cryptography; Pure mathematics; Encryption","authors":[{"name":"James A. Muir","is_ca":true},{"name":"Douglas R. Stinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006295475143209721,"gpt":0.2229101934455309,"spread":0.2166147183023212,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002933569,0.001054688,0.001769266,0.002059557,0.002636229,0.006672135,0.002291934,0.002780412,0.008907999],"category_scores_gemma":[0.01879582,0.0005492959,0.0006952069,0.002775927,0.005399625,0.01339942,0.004297358,0.005982632,0.001617802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001999084,"about_ca_system_score_gemma":0.001340057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009479807,"about_ca_topic_score_gemma":0.0006406765,"domain_scores_codex":[0.9976742,0.0008552879,0.0001066604,0.0003612896,0.0006471797,0.000355394],"domain_scores_gemma":[0.9922694,0.005696113,0.0004956461,0.0006616233,0.0004397408,0.0004373732],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002085287,0.00008690969,0.0002802858,0.00008487594,0.00001262713,0.0001158286,0.0002317132,0.004746652,0.0004663058,0.976676,0.003541768,0.01354857],"study_design_scores_gemma":[0.00002040441,0.00001003055,0.00003756451,0.000008289774,0.000003502654,0.00003098967,0.00004063497,0.009900942,0.0001807988,0.9892581,0.0005001331,0.000008583104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5040901,0.003758352,0.3389162,0.02313318,0.00163623,0.0001538683,0.0005283916,0.0005128314,0.1272708],"genre_scores_gemma":[0.9407109,0.001825262,0.02593614,0.001196638,0.001643503,0.0001180762,0.0004920471,0.0001958767,0.0278815],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008907999,"threshold_uncertainty_score":0.02980024,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2201326897","doi":"10.1007/s00200-019-00386-y","title":"Greedy construction of DNA codes and new bounds","year":2019,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Bounded function; Greedy algorithm; Upper and lower bounds; Mathematics; Constant (computer programming); GC-content; Construct (python library); Content (measure theory); Discrete mathematics; Algorithm; Computer science; Biology; Genetics; Genome","authors":[{"name":"Nabil Bennenni","is_ca":false},{"name":"Kenza Guenda","is_ca":false},{"name":"T. Aaron Gulliver","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00668701125520002,"gpt":0.2098744550817642,"spread":0.2031874438265642,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00241966,0.001113579,0.001410077,0.002007172,0.001527159,0.003036175,0.002786747,0.001597318,0.006559429],"category_scores_gemma":[0.01424217,0.000891024,0.001589097,0.002377537,0.003340434,0.004169787,0.006540086,0.004586765,0.001690259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002980012,"about_ca_system_score_gemma":0.002370292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001361088,"about_ca_topic_score_gemma":0.002072508,"domain_scores_codex":[0.9964764,0.001132661,0.0001566045,0.0004975488,0.001260864,0.0004760137],"domain_scores_gemma":[0.9907724,0.005675691,0.000373321,0.001677414,0.0008921309,0.0006091241],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001010479,0.00004025426,0.0001755895,0.00007008266,0.00001595013,0.00002828635,0.0001004923,0.02737211,0.001895153,0.947023,0.002985754,0.02019212],"study_design_scores_gemma":[0.00002693452,0.0000333581,0.00007567542,0.00003372564,0.00001147208,0.00002937193,0.00002454589,0.1016596,0.002180966,0.8918957,0.004004546,0.00002415606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02976038,0.0005702408,0.9432078,0.001226482,0.0002276251,0.00007572427,0.0002913488,0.0005676608,0.02407271],"genre_scores_gemma":[0.4407289,0.001065377,0.531095,0.001252323,0.000454278,0.0006931991,0.001038338,0.0008000742,0.02287259],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006559429,"threshold_uncertainty_score":0.02194351,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001374596","doi":"10.1007/s00200-006-0030-9","title":"Hyperelliptic curves with reduced automorphism group A 5","year":2006,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Moduli; Mathematics; Automorphism group; Automorphism; Locus (genetics); Hyperelliptic curve; Genus; Moduli space; Group (periodic table); Pure mathematics; Polynomial; Combinatorics; Mathematical analysis; Physics","authors":[{"name":"David Sevilla","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01003561435807842,"gpt":0.2225480509610611,"spread":0.2125124366029826,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000490239,0.001260484,0.0009995721,0.00272937,0.002043784,0.003098433,0.001225768,0.001359574,0.01454944],"category_scores_gemma":[0.001352809,0.0005296665,0.0009210935,0.001594644,0.002682913,0.003593602,0.002601373,0.003750203,0.002751632],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001597118,"about_ca_system_score_gemma":0.0006230476,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000953579,"about_ca_topic_score_gemma":0.0003699952,"domain_scores_codex":[0.9992931,0.0001508772,0.00002789208,0.0001445423,0.0002248203,0.0001588131],"domain_scores_gemma":[0.9993114,0.0001445561,0.0001496741,0.0001264737,0.0001064631,0.0001613797],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007779653,0.00002480132,0.0001052885,0.00002400615,0.000009264042,0.0001486006,0.0001468574,0.0008637694,0.001681815,0.9913352,0.001221265,0.004361331],"study_design_scores_gemma":[0.00004555811,0.00004558653,0.0003530277,0.00001329064,0.00001331083,0.0002894156,0.0001383682,0.003713246,0.001684725,0.9852067,0.008475667,0.00002119011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5479155,0.0009611442,0.1027675,0.004178995,0.001076958,0.0002197895,0.0007630309,0.0008129726,0.3413041],"genre_scores_gemma":[0.9227205,0.0005285774,0.0131261,0.0004495245,0.0007178296,0.0001000874,0.0005143125,0.0002303568,0.06161274],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01454944,"threshold_uncertainty_score":0.04867274,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976248130","doi":"10.1007/s00200-008-0058-0","title":"Maximal AMDS codes","year":2008,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; University of New Brunswick","funders":"","keywords":"Mathematics; Discrete mathematics; Combinatorics","authors":[{"name":"T. L. Alderson","is_ca":true},{"name":"Aiden A. Bruen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009820394412748035,"gpt":0.2038245864827604,"spread":0.1940041920700123,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006768061,0.0006623722,0.0007686349,0.001520201,0.002045385,0.002813577,0.0008595613,0.0009430795,0.01972986],"category_scores_gemma":[0.003373427,0.0003136571,0.000804061,0.001143,0.002039721,0.002869739,0.002780034,0.00222153,0.004231115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001435126,"about_ca_system_score_gemma":0.00184186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001025155,"about_ca_topic_score_gemma":0.0008986815,"domain_scores_codex":[0.9989642,0.0001776883,0.00006042116,0.0001986376,0.0003344141,0.0002646988],"domain_scores_gemma":[0.9986828,0.0003218727,0.0001256023,0.000346582,0.000328326,0.0001948158],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004210716,0.000009460689,0.000112853,0.0000189691,0.000003835588,0.00002323454,0.00004682133,0.00043964,0.0005598625,0.9907938,0.002130005,0.005819344],"study_design_scores_gemma":[0.000009601936,0.00001042272,0.0001296066,0.00001312171,0.000004567355,0.00007610807,0.00002838718,0.002525577,0.001263679,0.9882113,0.007717849,0.000009735349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.258301,0.001382904,0.2009531,0.004046181,0.001057899,0.0001902991,0.002280499,0.001298145,0.53049],"genre_scores_gemma":[0.8774542,0.0005321013,0.02612865,0.0009484646,0.0006351808,0.0001540901,0.00112637,0.0002822482,0.09273876],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01972986,"threshold_uncertainty_score":0.06600291,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W395247565","doi":"10.1007/s002000050126","title":"Optimal Formally Self-Dual Codes over 𝔽 5 and 𝔽 7","year":2000,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Minimum weight; Dual (grammatical number); Construct (python library); Dimension (graph theory); Minimum distance; Mathematics; Linear code; Code (set theory); Computer science; Discrete mathematics; Block code; Combinatorics; Algorithm; Decoding methods","authors":[{"name":"Steven T. Dougherty","is_ca":false},{"name":"T. Aaron Gulliver","is_ca":true},{"name":"Masaaki Harada","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.003958740976191346,"gpt":0.1971495810064651,"spread":0.1931908400302737,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001837632,0.0006660771,0.0008377503,0.001326476,0.001724887,0.003384217,0.001118528,0.001322133,0.00704236],"category_scores_gemma":[0.005603387,0.0004510152,0.0007845261,0.0009708211,0.002709711,0.004466789,0.002719993,0.002457392,0.0008871551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001886688,"about_ca_system_score_gemma":0.002246707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008738755,"about_ca_topic_score_gemma":0.001027143,"domain_scores_codex":[0.9979846,0.0006326034,0.0001069079,0.0002277146,0.0005517008,0.0004964215],"domain_scores_gemma":[0.9964941,0.001493657,0.0003970909,0.0005114102,0.0006151326,0.0004886249],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009652714,0.00002794457,0.0001000847,0.00002020951,0.000005834687,0.00001677784,0.00006581305,0.002621177,0.0005456083,0.9917972,0.0008948811,0.003807849],"study_design_scores_gemma":[0.0000246798,0.00002120009,0.00007139846,0.0000142787,0.000006815542,0.00003296666,0.00005385333,0.01200034,0.001121581,0.9855451,0.001093971,0.00001382997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5271735,0.0008708424,0.3387832,0.004156721,0.0006446236,0.0001840728,0.0007108911,0.0005667756,0.1269093],"genre_scores_gemma":[0.9408355,0.0003619408,0.03803638,0.000687225,0.0002554728,0.0001228904,0.0003544756,0.0001636022,0.01918244],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00704236,"threshold_uncertainty_score":0.02355897,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3021510930","doi":"10.1007/s00200-020-00431-1","title":"Boomerang uniformity of normalized permutation polynomials of low degree","year":2020,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Boomerang attack; Block cipher; Permutation (music); Differential cryptanalysis; Mathematics; Linear cryptanalysis; Degree (music); Finite field; Higher-order differential cryptanalysis; Differential (mechanical device); Combinatorics; Discrete mathematics; Algorithm; Cryptography; Physics","authors":[{"name":"Wang Yan-ping","is_ca":true},{"name":"Qiang Wang","is_ca":true},{"name":"Weiguo Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0139607045777781,"gpt":0.2148826019315071,"spread":0.200921897353729,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001157069,0.0005544688,0.0007528358,0.001745476,0.001912022,0.001922784,0.001196239,0.000666291,0.006607701],"category_scores_gemma":[0.004034918,0.0004222631,0.0006609197,0.001517731,0.003078282,0.00347934,0.001682899,0.002090504,0.001026587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001021341,"about_ca_system_score_gemma":0.0008332323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001236109,"about_ca_topic_score_gemma":0.0009769272,"domain_scores_codex":[0.9987619,0.0003278388,0.0000469609,0.0002813573,0.000262098,0.0003199856],"domain_scores_gemma":[0.9978456,0.0008468887,0.000291837,0.0003035447,0.0003569056,0.0003552379],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007170194,0.000019968,0.0001955844,0.00001335367,0.000004987911,0.00004474131,0.000136787,0.001013409,0.001866378,0.9917156,0.0005460019,0.004371456],"study_design_scores_gemma":[0.00001202545,0.00003607383,0.0003606782,0.000005603298,0.000005681602,0.0001104394,0.00004904889,0.007282059,0.001885229,0.9887271,0.001504067,0.00002197166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6774865,0.0004402723,0.2411819,0.0009574004,0.0003320662,0.00006628971,0.0004299346,0.0004141199,0.07869142],"genre_scores_gemma":[0.9640199,0.0002423226,0.01576604,0.0003377252,0.0002669434,0.00005346821,0.0002951062,0.0002135078,0.01880493],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006607701,"threshold_uncertainty_score":0.02210498,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4308765265","doi":"10.1007/s002000050004","title":"Algorithms for Computing Sparse Shifts for Multivariate Polynomials","year":2000,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Bell (Canada)","funders":"National Science Foundation","keywords":"Multivariate statistics; Computer science; Mathematics; Algorithm; Combinatorics; Algebra over a field; Pure mathematics; Statistics","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01805105939664032,"gpt":0.2598347592051651,"spread":0.2417836998085248,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001117883,0.001219376,0.001022191,0.00129,0.001016104,0.001771217,0.001449143,0.001051459,0.009584542],"category_scores_gemma":[0.007667949,0.0005484259,0.0008600759,0.002023689,0.001007743,0.003945585,0.003040174,0.002707328,0.003337687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008168946,"about_ca_system_score_gemma":0.001418469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00148501,"about_ca_topic_score_gemma":0.004345329,"domain_scores_codex":[0.9989612,0.0002167137,0.00006550659,0.0001955317,0.000423801,0.0001371734],"domain_scores_gemma":[0.9976034,0.001075533,0.0001467438,0.0006292294,0.0004218395,0.000123365],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006217936,0.0002230757,0.0009651362,0.0002843205,0.00008691379,0.00007316691,0.0002964498,0.06208115,0.01268524,0.2027685,0.01450045,0.7054139],"study_design_scores_gemma":[0.0001849156,0.000163097,0.0003596833,0.00004856769,0.00005316509,0.0001170496,0.0001662757,0.4419592,0.01127847,0.5350947,0.0105287,0.0000461577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01570501,0.000295596,0.9788871,0.000278426,0.0001104613,0.00008588668,0.0001466547,0.00146777,0.003023162],"genre_scores_gemma":[0.1870983,0.0005378898,0.802392,0.0002615706,0.0003130075,0.0002937846,0.0009168188,0.0003721706,0.007814448],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009584542,"threshold_uncertainty_score":0.03206348,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983551238","doi":"10.1007/s00200-007-0044-y","title":"The trace spectra of polynomial bases for $${\\mathbb{F}}_{2^{n}}$$","year":2007,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"TRACE (psycholinguistics); Polynomial; Mathematics; Combinatorics; Basis (linear algebra); Spectral line; Physics; Mathematical analysis; Geometry; Quantum mechanics","authors":[{"name":"Omran Ahmadi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006822601516715925,"gpt":0.2261474540274668,"spread":0.2193248525107509,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001135763,0.001120365,0.0008758231,0.002545122,0.002618273,0.004572846,0.001944312,0.001838494,0.01742464],"category_scores_gemma":[0.003519763,0.0005044261,0.0008043825,0.001374369,0.003394227,0.004998356,0.002070721,0.0031326,0.002616277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001636577,"about_ca_system_score_gemma":0.001424733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001373419,"about_ca_topic_score_gemma":0.00115909,"domain_scores_codex":[0.9990677,0.0001838117,0.00003492418,0.0001407602,0.0002996341,0.0002732277],"domain_scores_gemma":[0.9989427,0.0003216975,0.0001341826,0.0001317857,0.000206352,0.0002632852],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000418919,0.00002709779,0.00004758282,0.000009543449,0.000002488798,0.00003027477,0.0001122895,0.0003542393,0.00100855,0.9948953,0.0007563254,0.002714467],"study_design_scores_gemma":[0.00001530928,0.00001515304,0.0001046057,0.00001120324,0.000002771896,0.00007523123,0.00008146143,0.005065255,0.001004852,0.9922366,0.001367635,0.00002008432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5575421,0.0007656394,0.255592,0.003742246,0.001045049,0.0001594755,0.0007843564,0.0008400647,0.1795291],"genre_scores_gemma":[0.9388338,0.0004477323,0.01756436,0.0005658685,0.0004623323,0.0001234061,0.0004176983,0.0004970922,0.04108767],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.01742464,"threshold_uncertainty_score":0.05829126,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030112834","doi":"10.1007/s00200-005-0184-x","title":"On the bit security of the Diffie-Hellman key","year":2005,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Diffie–Hellman key exchange; Prime (order theory); Mathematics; Function (biology); Elliptic curve; Bit (key); Discrete mathematics; Key (lock); Finite field; Arithmetic; Theoretical computer science; Computer science; Key exchange; Combinatorics; Public-key cryptography; Computer security; Pure mathematics; Encryption","authors":[{"name":"Ian F. Blake","is_ca":true},{"name":"Theo Garefalakis","is_ca":false},{"name":"Igor E. Shparlinski","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005165420690599298,"gpt":0.1935482100278562,"spread":0.1883827893372569,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004356992,0.001014051,0.001367797,0.002037784,0.002599978,0.003975158,0.001594565,0.002250321,0.006805682],"category_scores_gemma":[0.009990543,0.0005893908,0.001023012,0.0023034,0.007152572,0.01554479,0.004124288,0.005877207,0.002368411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001936019,"about_ca_system_score_gemma":0.001480965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001054188,"about_ca_topic_score_gemma":0.000455503,"domain_scores_codex":[0.997214,0.001050761,0.000179739,0.0003033525,0.0008265652,0.0004256347],"domain_scores_gemma":[0.99431,0.003630327,0.0002384338,0.0009675426,0.000617611,0.0002359096],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004036996,0.000006872117,0.00002592862,0.00001555936,0.000003100561,0.00001809263,0.00006200668,0.0006701235,0.0002719885,0.996058,0.0008536736,0.001974291],"study_design_scores_gemma":[0.000006395442,0.000004472601,0.00001612162,0.000008529236,0.000002339698,0.00001354238,0.00000925109,0.002298206,0.0001635957,0.9960119,0.001459016,0.000006648812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1114358,0.007184124,0.6569556,0.01670092,0.00228642,0.0001763842,0.001071535,0.0003547602,0.2038345],"genre_scores_gemma":[0.8804833,0.006915194,0.07440565,0.003186218,0.002325298,0.0003419282,0.0007375106,0.0003545675,0.03125027],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006805682,"threshold_uncertainty_score":0.02304226,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2914313791","doi":"10.1007/s00200-019-00382-2","title":"Fixed points of rational functions satisfying the Carlitz property","year":2019,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Advanced Differential Equations and Dynamical Systems","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Property (philosophy); Rational function; Pure mathematics; Algebra over a field; Philosophy","authors":[{"name":"Kaitlyn Chubb","is_ca":true},{"name":"Daniel Panario","is_ca":true},{"name":"Qiang Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0156801884358921,"gpt":0.2466759624374071,"spread":0.230995774001515,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005790783,0.0009187471,0.0008208902,0.002534803,0.001280331,0.003349196,0.0007990173,0.00113324,0.004330667],"category_scores_gemma":[0.00244687,0.0004403602,0.0007461549,0.001358154,0.002338401,0.002640678,0.001611737,0.001919996,0.0008297003],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001595838,"about_ca_system_score_gemma":0.0006837425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001159532,"about_ca_topic_score_gemma":0.000694462,"domain_scores_codex":[0.9996274,0.00007267575,0.00001550743,0.00006256986,0.0001015512,0.0001204015],"domain_scores_gemma":[0.9992881,0.0002808298,0.0001253518,0.00006373535,0.0001450764,0.00009693082],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000645435,0.00001894464,0.0002670248,0.00002364498,0.00001603849,0.0001417958,0.0001746518,0.001518325,0.002455933,0.9916593,0.0004510715,0.003208742],"study_design_scores_gemma":[0.00004696836,0.00003745047,0.0005182714,0.00001802408,0.00001468767,0.0001674773,0.0002242811,0.01395564,0.002505075,0.9805792,0.001904623,0.00002827231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7827202,0.001101061,0.1331971,0.001019136,0.0002177952,0.00005296482,0.0003181273,0.000249483,0.08112418],"genre_scores_gemma":[0.9864245,0.0003685044,0.003802316,0.00005653316,0.00009702305,0.00003425694,0.0001612968,0.00005639816,0.008999296],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004330667,"threshold_uncertainty_score":0.0144875,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978143507","doi":"10.1007/s00200-008-0067-z","title":"Highly nonlinear balanced S-boxes with improved bound on unrestricted and generalized nonlinearity","year":2008,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Nonlinear system; Upper and lower bounds; Bounded function; Mathematics; Class (philosophy); Combinatorics; Algebraic number; Degree (music); Discrete mathematics; Mathematical analysis; Physics; Quantum mechanics","authors":[{"name":"Khoongming Khoo","is_ca":false},{"name":"Chu-Wee Lim","is_ca":false},{"name":"Guang Gong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00833267848137081,"gpt":0.2079908130257003,"spread":0.1996581345443295,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00180606,0.001102507,0.001565586,0.001188688,0.001817101,0.002720565,0.00170498,0.001794666,0.01143237],"category_scores_gemma":[0.004664073,0.0005857121,0.0007543456,0.001337287,0.002870756,0.005409445,0.005451611,0.002633722,0.002006701],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001480852,"about_ca_system_score_gemma":0.001560363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000725716,"about_ca_topic_score_gemma":0.001064343,"domain_scores_codex":[0.9985678,0.0003328003,0.00006608676,0.0002152141,0.0004956247,0.0003223951],"domain_scores_gemma":[0.9976439,0.001098772,0.000155548,0.0005719201,0.0002973113,0.0002325321],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002113602,0.00002555278,0.0001633402,0.00006731534,0.00001628474,0.00005022218,0.0000679576,0.009949827,0.004205284,0.9761755,0.002060431,0.007006805],"study_design_scores_gemma":[0.00004333556,0.0000358689,0.0001019389,0.00003225765,0.0000245906,0.00008523092,0.0000337764,0.1100395,0.005695411,0.8805395,0.003332716,0.00003585501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2109252,0.001608691,0.6713147,0.002648011,0.0004309974,0.0001830022,0.0008233252,0.001276724,0.1107893],"genre_scores_gemma":[0.8924366,0.0006870052,0.08228227,0.0006761782,0.0002512816,0.0002912586,0.0003433178,0.0002586654,0.02277338],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01143237,"threshold_uncertainty_score":0.03824514,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4395695590","doi":"10.1007/s00200-024-00655-5","title":"Sparse polynomial interpolation: faster strategies over finite fields","year":2024,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Pacific Institute for the Mathematical Sciences; Simon Fraser University","funders":"","keywords":"Monomial; Interpolation (computer graphics); Focus (optics); Monomial basis; Polynomial; Mathematics; Finite field; Field (mathematics); Polynomial interpolation; Degree (music); Combinatorics; Polynomial basis; Basis (linear algebra); Discrete mathematics; Algebra over a field; Pure mathematics; Computer science; Mathematical analysis; Linear interpolation; Geometry; Physics","authors":[{"name":"Joris van der Hoeven","is_ca":true},{"name":"Grégoire Lecerf","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009363980997397995,"gpt":0.2331480155912325,"spread":0.2237840345938345,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001344465,0.001372939,0.001286167,0.001595202,0.0009347029,0.002226913,0.001807089,0.001046297,0.02111411],"category_scores_gemma":[0.005974295,0.0006023443,0.0009958128,0.002178176,0.00116158,0.006095585,0.003973973,0.002800518,0.005108727],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008138496,"about_ca_system_score_gemma":0.001266367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001514668,"about_ca_topic_score_gemma":0.002927022,"domain_scores_codex":[0.9984974,0.0003499674,0.00006782018,0.0002433092,0.0006220292,0.0002194651],"domain_scores_gemma":[0.9977772,0.0009243655,0.0000916258,0.0008427138,0.0002553469,0.0001087724],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009002219,0.0003357366,0.0005957439,0.0003634222,0.00007242428,0.0001174877,0.0003266953,0.0292219,0.01225044,0.4486115,0.01849106,0.4887134],"study_design_scores_gemma":[0.0001856085,0.0001710766,0.0001800868,0.0000645881,0.00005614294,0.0001782371,0.0001572875,0.3343407,0.01886282,0.6247475,0.02100565,0.00005038644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02034633,0.0004468974,0.96106,0.000512518,0.0001761549,0.0001209043,0.0002302933,0.002542756,0.01456424],"genre_scores_gemma":[0.3364628,0.0006517675,0.6395566,0.0004666907,0.0003551557,0.0001994913,0.0009108019,0.001169323,0.02022729],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02111411,"threshold_uncertainty_score":0.07063371,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2989341942","doi":"10.1007/s00200-020-00426-y","title":"A nonexistence certificate for projective planes of order ten with weight 15 codewords","year":2020,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University; Carleton University; University of Waterloo","funders":"","keywords":"Satisfiability; Certificate; Symbolic computation; Simple (philosophy); Projective test; Projective plane; Computation; Theory of computation","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.03974349600337897,"gpt":0.2590012909516102,"spread":0.2192577949482312,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001537007,0.0006353647,0.001089176,0.001134563,0.002996873,0.003941154,0.001544267,0.001382321,0.009842014],"category_scores_gemma":[0.007437833,0.0006471651,0.001547317,0.001052563,0.003735019,0.005205388,0.004449119,0.003800109,0.001872466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001842543,"about_ca_system_score_gemma":0.002658148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002971047,"about_ca_topic_score_gemma":0.001730202,"domain_scores_codex":[0.9971636,0.0002543196,0.0001771217,0.0006575977,0.0009495197,0.0007977622],"domain_scores_gemma":[0.9953812,0.002194292,0.0004557871,0.0007237046,0.0007892046,0.0004557949],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002039605,0.00004901278,0.0009643885,0.00008069575,0.00002354707,0.0003371699,0.0004061966,0.00254024,0.003660525,0.9829562,0.002311371,0.006466773],"study_design_scores_gemma":[0.00005722902,0.00006315987,0.0004776479,0.00003792215,0.00003061023,0.0003146419,0.0002556758,0.009600629,0.01013556,0.9703028,0.008675659,0.00004847519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5516888,0.0003232879,0.3333724,0.002686691,0.0003520428,0.000232449,0.001211811,0.001755796,0.1083767],"genre_scores_gemma":[0.9499232,0.0001791036,0.02829256,0.0003344667,0.0001076077,0.0001268301,0.001148033,0.0002465614,0.01964164],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009842014,"threshold_uncertainty_score":0.03292477,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4393115041","doi":"10.1007/s00200-024-00649-3","title":"New cyclic groups based on the generalized order-k Pell sequences in the Heisenberg group and their application in cryptography","year":2024,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Heisenberg group; Group (periodic table); Cyclic group; Order (exchange); Cryptography; Mathematics; Algebra over a field; Discrete mathematics; Pure mathematics; Theoretical computer science; Computer science; Physics; Algorithm; Quantum mechanics; Business","authors":[{"name":"Elahe Mehraban","is_ca":false},{"name":"T. Aaron Gulliver","is_ca":true},{"name":"Evren Hınçal","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007053071388454554,"gpt":0.2278223220556041,"spread":0.2207692506671495,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003419787,0.0006895356,0.0004475176,0.001622704,0.0008760197,0.00148255,0.0006061381,0.000850344,0.005533535],"category_scores_gemma":[0.001637207,0.000280623,0.0005738181,0.001095068,0.002016766,0.002528582,0.001089034,0.001021444,0.001066363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005701209,"about_ca_system_score_gemma":0.0008277198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000312854,"about_ca_topic_score_gemma":0.0004268778,"domain_scores_codex":[0.9997043,0.00008616911,0.00002071397,0.00005234197,0.00007444801,0.00006199163],"domain_scores_gemma":[0.9994246,0.0001381616,0.0001414105,0.00008633326,0.00009157773,0.0001179093],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005345524,0.00002359911,0.0002496385,0.00004255378,0.000008244377,0.0001322427,0.000155956,0.002677796,0.004953295,0.9777421,0.0006866594,0.01327445],"study_design_scores_gemma":[0.00002932579,0.0001152967,0.0003762033,0.00003175701,0.00001350628,0.0004729124,0.000121805,0.02089074,0.005463877,0.9604799,0.01194929,0.00005550555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5479064,0.004216706,0.3318535,0.001618171,0.001422962,0.0003655428,0.0004500329,0.0006977795,0.1114689],"genre_scores_gemma":[0.8934503,0.002179263,0.07492108,0.0004857412,0.0007498118,0.0002182607,0.0002833303,0.0001523998,0.02755992],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005533535,"threshold_uncertainty_score":0.01851153,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4321437526","doi":"10.1007/s00200-023-00597-4","title":"Algebraic and SAT models for SCA generation","year":2023,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Ubiquitin and proteasome pathways","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Solver; Pairwise comparison; Algebraic number; Scalability; Gröbner basis; Variety (cybernetics); Computation; Computer science; Sequence (biology); Symbolic computation; Polynomial; Boolean satisfiability problem; Basis (linear algebra); Mathematics; Theoretical computer science; Algorithm; Artificial intelligence; Programming language","authors":[{"name":"Marlene Koelbing","is_ca":false},{"name":"Bernhard Garn","is_ca":false},{"name":"Enrico Iurlano","is_ca":false},{"name":"Ilias Kotsireas","is_ca":true},{"name":"Dimitris E. Simos","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02024596758706582,"gpt":0.2415058145373675,"spread":0.2212598469503017,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001224459,0.0005407517,0.0006741288,0.0009263862,0.001075153,0.002309497,0.001634511,0.00112443,0.01327504],"category_scores_gemma":[0.00683334,0.0004681473,0.001763941,0.0009805248,0.001804027,0.003510749,0.002067055,0.002495567,0.001574982],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002003474,"about_ca_system_score_gemma":0.001800761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0053156,"about_ca_topic_score_gemma":0.009182884,"domain_scores_codex":[0.9987669,0.0004148711,0.00007822546,0.0001987979,0.000396139,0.0001451176],"domain_scores_gemma":[0.997343,0.00144781,0.0001603745,0.000481733,0.0004463276,0.0001208102],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002968285,0.00003009505,0.0002392209,0.00003163076,0.00001453397,0.00005502935,0.00009273208,0.05376674,0.0004600809,0.9322529,0.002423323,0.01060415],"study_design_scores_gemma":[0.00001094657,0.000007558122,0.00005625895,0.000009406809,0.000008785051,0.00002073393,0.00001971877,0.1884447,0.0003514793,0.8087542,0.002307022,0.000009224548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02896989,0.0002244272,0.9362714,0.00132202,0.0001334241,0.000124666,0.0008250942,0.0009853698,0.03114368],"genre_scores_gemma":[0.7728924,0.0002995737,0.2019152,0.0004603218,0.0002392557,0.0002857612,0.001723467,0.000335246,0.02184873],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01327504,"threshold_uncertainty_score":0.04440951,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4377094810","doi":"10.1007/s00200-023-00608-4","title":"MWS and FWS codes for coordinate-wise weight functions","year":2023,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mathematics; Combinatorics; Hamming code; Upper and lower bounds; Code (set theory); Hamming weight; Hamming distance; Linear code; Discrete mathematics; Weight function; Set (abstract data type); Block code; Algorithm; Statistics; Computer science; Decoding methods; Mathematical analysis","authors":[{"name":"T. L. Alderson","is_ca":true},{"name":"Benjamin Morine","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009493921149859972,"gpt":0.2231626414672672,"spread":0.2136687203174073,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001321005,0.0007502346,0.0007320254,0.001779974,0.001138069,0.002310376,0.001122,0.001341347,0.007481424],"category_scores_gemma":[0.006374766,0.0003237014,0.0008510922,0.002021895,0.002517495,0.003306361,0.002358064,0.002264113,0.002269251],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001049946,"about_ca_system_score_gemma":0.001692829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007398983,"about_ca_topic_score_gemma":0.000619375,"domain_scores_codex":[0.9985887,0.0003586869,0.00008949924,0.0002220025,0.0004522274,0.0002888068],"domain_scores_gemma":[0.997644,0.0007410032,0.0002492948,0.0007644223,0.0004280935,0.0001731508],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004244045,0.00001007193,0.0001067221,0.0000198243,0.000004898779,0.00002871602,0.00004665455,0.001887924,0.001083823,0.9846618,0.001551247,0.01055589],"study_design_scores_gemma":[0.00000966984,0.00001517568,0.0001034264,0.00001956378,0.000006206333,0.00010125,0.00002372171,0.01893813,0.001793093,0.9754596,0.003510348,0.00001971071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1482235,0.001247065,0.7692149,0.003068377,0.0009806711,0.0001394959,0.001002666,0.0008510076,0.07527232],"genre_scores_gemma":[0.8175105,0.001115956,0.1213115,0.001123468,0.0009499103,0.0003923752,0.0008003839,0.0004547682,0.05634109],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007481424,"threshold_uncertainty_score":0.02502787,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4390973014","doi":"10.1007/s00200-023-00642-2","title":"On the classification of non-exceptional APN functions","year":2024,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Medicine","authors":[{"name":"Nurdagül Anbar","is_ca":false},{"name":"Tekgül Kalaycı","is_ca":false},{"name":"Nihal Yurdakul","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01075947073421124,"gpt":0.2243018309213886,"spread":0.2135423601871773,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001877668,0.0007265654,0.0008450215,0.003949772,0.002409572,0.003589362,0.001479864,0.001319378,0.005708513],"category_scores_gemma":[0.004710055,0.0002531771,0.0006541147,0.002081977,0.004661166,0.005740291,0.00306997,0.002923704,0.001139196],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001226235,"about_ca_system_score_gemma":0.0009109822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007361023,"about_ca_topic_score_gemma":0.0003970185,"domain_scores_codex":[0.9990065,0.000261008,0.00007277392,0.0001244177,0.0003233747,0.0002120994],"domain_scores_gemma":[0.9974949,0.0008607389,0.0002650361,0.0003576867,0.0005199776,0.0005015769],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003173889,0.00002215537,0.0005428875,0.00002212691,0.000002808355,0.00006319916,0.0001520797,0.0004516591,0.0004806985,0.9906178,0.0009050027,0.00670774],"study_design_scores_gemma":[0.000005928139,0.00001181352,0.000418585,0.00002134424,0.000003150264,0.0001574173,0.00007733562,0.006087169,0.000316273,0.9903611,0.002528449,0.00001153744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6139914,0.0018163,0.1896053,0.002626878,0.0009061279,0.00008555585,0.0004034725,0.0003652874,0.1901998],"genre_scores_gemma":[0.9523242,0.00093401,0.01923088,0.0004867612,0.0007584046,0.0000685599,0.0006553418,0.0001148693,0.02542708],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005708513,"threshold_uncertainty_score":0.01909691,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385296592","doi":"10.1007/s00200-023-00614-6","title":"Linear label code of a root lattice using Gröbner bases","year":2023,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lambda; Lattice (music); Mathematics; Quotient; Binomial coefficient; Combinatorics; Discrete mathematics; Physics; Quantum mechanics","authors":[{"name":"Malihe Aliasgari","is_ca":false},{"name":"Daniel Panario","is_ca":true},{"name":"Mohammad‐Reza Sadeghi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02511286486479027,"gpt":0.2667025432007845,"spread":0.2415896783359942,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004840691,0.0004992799,0.0007342492,0.0009900758,0.001398893,0.00206439,0.0009431558,0.001117325,0.00688893],"category_scores_gemma":[0.001741481,0.0002718572,0.0006269637,0.001021536,0.001604887,0.001642809,0.001481485,0.001931545,0.001766404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009873873,"about_ca_system_score_gemma":0.001520581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001437005,"about_ca_topic_score_gemma":0.001251494,"domain_scores_codex":[0.9991359,0.0001789032,0.00003457438,0.0001402144,0.0003274028,0.0001830025],"domain_scores_gemma":[0.9989167,0.000344809,0.0001061671,0.0002072563,0.0002849342,0.000140015],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001336198,0.00007330713,0.0002553512,0.00006419501,0.00001260628,0.0001642219,0.0001538721,0.006969583,0.008413879,0.9643545,0.00342112,0.01598379],"study_design_scores_gemma":[0.00007692335,0.00009355836,0.0002595339,0.00004736756,0.0000267638,0.000250194,0.0001015763,0.1108658,0.01434939,0.8653107,0.008521106,0.00009707132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2514825,0.0004640793,0.6675268,0.002245643,0.0008146559,0.0002153948,0.0008940373,0.001872022,0.07448488],"genre_scores_gemma":[0.8467425,0.0003129738,0.120814,0.000656285,0.0003038415,0.0002422417,0.0006176479,0.000574418,0.02973608],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00688893,"threshold_uncertainty_score":0.02304578,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078476935","doi":"10.1007/s00200-014-0219-2","title":"VSH and multiplicative modular relations between small primes with polynomial exponents","year":2014,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Multiplicative function; Mathematics; Combinatorics; Polynomial; Prime (order theory); Order (exchange); Multiplicative number theory; Discrete mathematics; Hash function; Prime factor; Computer science","authors":[{"name":"Ian F. Blake","is_ca":true},{"name":"Florian Luca","is_ca":false},{"name":"Igor E. Shparlinski","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007021612000770943,"gpt":0.191208816233149,"spread":0.184187204232378,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001652779,0.0008138096,0.001007894,0.002042876,0.00195149,0.002996545,0.001182659,0.0009197219,0.01003947],"category_scores_gemma":[0.005270293,0.0005323254,0.0009613764,0.001660976,0.004828115,0.008263516,0.00334036,0.003387815,0.001552698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001115862,"about_ca_system_score_gemma":0.0006994095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002471068,"about_ca_topic_score_gemma":0.0002296312,"domain_scores_codex":[0.9984794,0.0004833073,0.00008566793,0.0002949683,0.0003989134,0.0002576956],"domain_scores_gemma":[0.9975942,0.001163938,0.000328755,0.0004353235,0.0002198623,0.0002579205],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001779207,0.000006558941,0.00003519815,0.00001133661,0.000002377896,0.00001996717,0.00008221536,0.0001515147,0.000283588,0.9970305,0.0003415844,0.002017358],"study_design_scores_gemma":[0.000009010389,0.0000130173,0.00005614933,0.000005800403,0.00000398654,0.00005846954,0.00002949084,0.0009963795,0.0004083054,0.9966581,0.00175412,0.000007159913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.431985,0.003110341,0.3583911,0.006178022,0.001794371,0.0001516164,0.000454449,0.0007649959,0.1971701],"genre_scores_gemma":[0.9490914,0.000602127,0.01996891,0.0006649599,0.001374389,0.00007437434,0.0001300561,0.0001441057,0.02794965],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01003947,"threshold_uncertainty_score":0.03358543,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3092499131","doi":"10.1007/s00200-020-00467-3","title":"On the stability of periodic binary sequences with zone restriction","year":2020,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"Algorithm; Computer science","authors":[{"name":"Ming Su","is_ca":false},{"name":"Qiang Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01450020622714313,"gpt":0.1999279193647825,"spread":0.1854277131376394,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001398272,0.0004018693,0.0005377403,0.002054405,0.0006622182,0.001150159,0.0006584884,0.0005956939,0.002010126],"category_scores_gemma":[0.01222441,0.0002193419,0.0003861378,0.001059271,0.001716746,0.001984266,0.00106307,0.000900363,0.0002538075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001023596,"about_ca_system_score_gemma":0.0005919492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0012501,"about_ca_topic_score_gemma":0.0005048109,"domain_scores_codex":[0.9985878,0.0003319844,0.0000871542,0.0002550284,0.0005922262,0.0001457846],"domain_scores_gemma":[0.9896629,0.006199791,0.001853097,0.0006894249,0.001170931,0.0004238261],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001442753,0.00008665628,0.01348439,0.0003653287,0.00009113193,0.0004246713,0.0006720541,0.430233,0.04998663,0.4462386,0.00160521,0.05536962],"study_design_scores_gemma":[0.00002556056,0.0001940903,0.003143169,0.00004111289,0.00001432481,0.0001721535,0.0001048558,0.8770007,0.01030807,0.1079555,0.0009834738,0.00005695713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7215102,0.000536045,0.2701212,0.0003386888,0.00004089382,0.00006773824,0.0003238515,0.000247645,0.00681368],"genre_scores_gemma":[0.9787369,0.0001531068,0.01925335,0.00005007524,0.00004119631,0.00007546592,0.0002251316,0.00003626327,0.001428511],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002054405,"threshold_uncertainty_score":0.007426679,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}