{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":31,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":31,"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":"13057bc43c56","filters":{"venue":"Advances in Mathematics of Communications"}},"results":[{"id":"W2055241129","doi":"10.3934/amc.2009.3.13","title":"Combinatorial batch codes","year":2009,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":77,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University; University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Server; Code (set theory); Mathematics; Discrete mathematics; Combinatorics; Probabilistic logic; Theoretical computer science; Computer science; Operating system; Statistics; Programming language","authors":[{"name":"Maura B. Paterson","is_ca":false},{"name":"Douglas R. Stinson","is_ca":true},{"name":"Ruizhong Wei","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03114483656957134,"gpt":0.3625640533067013,"spread":0.3314192167371299,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00108429,0.00111495,0.001138325,0.001133839,0.001252935,0.001935735,0.001988531,0.001437603,0.009579293],"category_scores_gemma":[0.005803894,0.0005155411,0.0008004706,0.001952511,0.001955671,0.002973384,0.001726228,0.00243268,0.001764466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002262918,"about_ca_system_score_gemma":0.001613664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002148219,"about_ca_topic_score_gemma":0.002048725,"domain_scores_codex":[0.9984065,0.0004305913,0.00007003261,0.0003052485,0.000482594,0.0003050488],"domain_scores_gemma":[0.9957783,0.002076624,0.0004525224,0.0007579817,0.0006341617,0.0003003871],"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.0001391106,0.00007106286,0.0004786509,0.000171177,0.00002500393,0.0001293903,0.00008398395,0.06031705,0.001741641,0.9011746,0.01067262,0.02499588],"study_design_scores_gemma":[0.00008343432,0.0001311888,0.0003612968,0.00006049663,0.00002848842,0.0004295785,0.00006987425,0.3522367,0.002958511,0.6180383,0.0255401,0.00006191083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0703712,0.003326082,0.8522447,0.001379574,0.0007323171,0.0002841701,0.001494951,0.0007007291,0.0694662],"genre_scores_gemma":[0.6606089,0.003319394,0.2737741,0.001266564,0.001016752,0.0008826432,0.002431843,0.0004771431,0.05622255],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009579293,"threshold_uncertainty_score":0.03204596,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2026698357","doi":"10.3934/amc.2012.6.443","title":"An algebraic approach for decoding spread codes","year":2012,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Mathematics; Finite field; Decoding methods; Dimension (graph theory); Combinatorics; Discrete mathematics; Algebraic number; Coding theory; List decoding; Linear code; Factorization; Matrix (chemical analysis); Extension (predicate logic); Rank (graph theory); Block code; Concatenated error correction code; Algorithm","authors":[{"name":"Elisa Gorla","is_ca":false},{"name":"Felice Manganiello","is_ca":false},{"name":"Joachim Rosenthal","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07231315160863089,"gpt":0.3736553630367348,"spread":0.3013422114281039,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007392291,0.0007384528,0.0004585996,0.001180552,0.0006733676,0.001316259,0.0007888855,0.0009249023,0.003214646],"category_scores_gemma":[0.005569919,0.0003026628,0.0006547066,0.001186125,0.001899787,0.002854063,0.001705657,0.002146326,0.001130407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008568285,"about_ca_system_score_gemma":0.001052092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000955214,"about_ca_topic_score_gemma":0.0008706752,"domain_scores_codex":[0.9989998,0.0002793149,0.00006024023,0.0001571047,0.0004396416,0.00006387868],"domain_scores_gemma":[0.9984342,0.0009524267,0.0001309137,0.0001646775,0.00027872,0.00003899237],"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.00004405305,0.0000267491,0.0002284654,0.0001216538,0.00001420642,0.0001069461,0.0002199504,0.05207394,0.004574892,0.9014531,0.001124931,0.04001108],"study_design_scores_gemma":[0.00003472703,0.00008560706,0.00010033,0.00005259331,0.0000164964,0.0002644917,0.00009015275,0.2992564,0.005211281,0.6825361,0.01231864,0.00003308192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00728285,0.000290641,0.9842436,0.0003528402,0.00006924912,0.00003470289,0.00005883383,0.000079192,0.007588075],"genre_scores_gemma":[0.3200297,0.002866191,0.6593227,0.0006637537,0.0007173726,0.0002456662,0.0003771182,0.0001551179,0.01562228],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003214646,"threshold_uncertainty_score":0.01075411,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2009890571","doi":"10.3934/amc.2010.4.485","title":"Efficient list decoding of a class of algebraic-geometry codes","year":2010,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; List decoding; Algebraic number; Interpolation (computer graphics); Class (philosophy); Decoding methods; Block code; Algebraic geometry; Algebra over a field; Hermitian matrix; Discrete mathematics; Algorithm; Concatenated error correction code; Geometry; Computer science; Pure mathematics; Image (mathematics); Mathematical analysis","authors":[{"name":"Peter Beelen","is_ca":false},{"name":"Kristian Brander","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01526191636158642,"gpt":0.3021736369295236,"spread":0.2869117205679372,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001035246,0.0005408113,0.0007784902,0.00100435,0.0007797839,0.001375647,0.001181839,0.0009388068,0.002272358],"category_scores_gemma":[0.005097765,0.0001926718,0.0004204417,0.001312041,0.001070354,0.002282117,0.00156007,0.001072826,0.0006724794],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001093005,"about_ca_system_score_gemma":0.001505379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006777166,"about_ca_topic_score_gemma":0.0007695789,"domain_scores_codex":[0.9988783,0.0003229828,0.0000462489,0.00014691,0.0003959292,0.0002096475],"domain_scores_gemma":[0.9974711,0.001344306,0.0003402371,0.0003898384,0.0003557014,0.00009891018],"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.0003427023,0.0001100057,0.001651717,0.0001821883,0.00003742921,0.0004881291,0.0002875676,0.2360974,0.01444012,0.6387938,0.003663649,0.1039053],"study_design_scores_gemma":[0.00003938063,0.0001467353,0.0002805401,0.00001695302,0.00001183844,0.0003082209,0.0000622882,0.7617046,0.01343014,0.2198495,0.004119428,0.00003039097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1343608,0.0002816753,0.8551214,0.0005589753,0.00004114197,0.0001328605,0.0003331116,0.0004532971,0.008716586],"genre_scores_gemma":[0.7187616,0.000622592,0.2720011,0.0002376848,0.0002357479,0.0002463131,0.0009036201,0.0001018694,0.006889432],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002272358,"threshold_uncertainty_score":0.007930279,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001357342","doi":"10.3934/amc.2011.5.69","title":"The enumeration of Costas arrays of order 28 and its consequences","year":2011,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Autodesk (Canada)","funders":"Science Foundation Ireland","keywords":"Enumeration; Mathematics; Golomb coding; Order (exchange); Combinatorics; Algorithm; Discrete mathematics; Computer science; Artificial intelligence","authors":[{"name":"Konstantinos Drakakis","is_ca":true},{"name":"Francesco Iorio","is_ca":true},{"name":"Scott Rickard","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03017044645058189,"gpt":0.2670171081107196,"spread":0.2368466616601377,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003431786,0.0002480924,0.0004058207,0.0009525619,0.0008939889,0.001167577,0.0003678595,0.0004087495,0.003761756],"category_scores_gemma":[0.002930001,0.0002182643,0.0003445875,0.0009792248,0.001351867,0.0007974671,0.0007593141,0.0008685287,0.0005553436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004690554,"about_ca_system_score_gemma":0.0006783656,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008367614,"about_ca_topic_score_gemma":0.001059328,"domain_scores_codex":[0.9995757,0.00007287749,0.0000230574,0.00006964027,0.0001508075,0.0001078396],"domain_scores_gemma":[0.9977188,0.00108289,0.0002472542,0.0004160102,0.000397095,0.0001379258],"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.0004548082,0.0001075003,0.01151482,0.0003720265,0.00002904816,0.001244855,0.0008297267,0.06324764,0.03263136,0.7556043,0.008433591,0.1255305],"study_design_scores_gemma":[0.00005719814,0.0002189002,0.005532695,0.00006804195,0.00003529943,0.001354488,0.0005559718,0.15022,0.02940966,0.7847897,0.02768707,0.00007096165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.85233,0.0004385893,0.08622733,0.0005822943,0.00008839236,0.00005366142,0.0004148431,0.0004236463,0.05944122],"genre_scores_gemma":[0.9586024,0.0002285165,0.03001585,0.00009750082,0.00005525976,0.00004850441,0.0003557722,0.00005875985,0.0105374],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003761756,"threshold_uncertainty_score":0.01258439,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072113533","doi":"10.3934/amc.2012.6.347","title":"Cycle structure of permutation functions over finite fields and their applications","year":2012,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Permutation (music); Inverse; Finite field; Order (exchange); Function (biology); Field (mathematics); Pure mathematics; Combinatorics; Discrete mathematics; Geometry","authors":[{"name":"Amin Sakzad","is_ca":false},{"name":"Mohammad‐Reza Sadeghi","is_ca":false},{"name":"Daniel Panario","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01202901674607284,"gpt":0.2796147784415005,"spread":0.2675857616954276,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004138568,0.0003885595,0.0002785385,0.001143461,0.0007365886,0.0008024536,0.0003731716,0.0005824344,0.002775169],"category_scores_gemma":[0.001854429,0.0002381792,0.0003220301,0.0006803553,0.001082847,0.00149273,0.0007219294,0.000894498,0.0005929922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006561777,"about_ca_system_score_gemma":0.0004803881,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004776389,"about_ca_topic_score_gemma":0.0003524998,"domain_scores_codex":[0.9997061,0.00006808591,0.00001832623,0.00005320853,0.00009363983,0.00006058679],"domain_scores_gemma":[0.9994036,0.0002638718,0.0000792562,0.00008853953,0.0001079816,0.00005682391],"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.000041646,0.00002708959,0.0003346916,0.00005915297,0.000005175072,0.0001250321,0.0002175055,0.00623433,0.003477872,0.9499106,0.0004306272,0.03913634],"study_design_scores_gemma":[0.00001350689,0.00008862916,0.0002880587,0.00005352038,0.00001073422,0.00038566,0.00008205696,0.03940114,0.008807383,0.934073,0.0167654,0.0000309905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3372656,0.005180029,0.5742899,0.0006864888,0.0003399909,0.0001089696,0.0001274429,0.0003649773,0.08163662],"genre_scores_gemma":[0.8953882,0.003312096,0.08194286,0.0001717997,0.0002752038,0.00009064196,0.0001499098,0.0001312208,0.01853819],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002775169,"threshold_uncertainty_score":0.009283841,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2791716769","doi":"10.3934/amc.2019006","title":"Maximum weight spectrum codes","year":2018,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mathematics; Cardinality (data modeling); Combinatorics; Conjecture; Finite field; Hamming distance; Discrete mathematics; Prime power; Bounded function; Integer (computer science); Hamming code; Prime (order theory); Upper and lower bounds; Spectrum (functional analysis); Linear code; Block code; Algorithm","authors":[{"name":"T. L. Alderson","is_ca":true},{"name":"Alessandro Neri","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01816801479850437,"gpt":0.3000045371685736,"spread":0.2818365223700692,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007663515,0.0005717567,0.0006271647,0.001267143,0.001160658,0.001511073,0.001193595,0.001312592,0.004555618],"category_scores_gemma":[0.006071154,0.000340754,0.0004892349,0.001099841,0.001584392,0.003023839,0.002214782,0.001589246,0.001037567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001210136,"about_ca_system_score_gemma":0.0007533277,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005774337,"about_ca_topic_score_gemma":0.0006999403,"domain_scores_codex":[0.9988365,0.0001804715,0.00005475823,0.0002339389,0.000429394,0.000265017],"domain_scores_gemma":[0.996434,0.001804007,0.0003955729,0.0006716419,0.0004367137,0.0002581084],"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.0002217125,0.00005284903,0.001021392,0.0001664155,0.00002334908,0.0001964822,0.0002636793,0.01490538,0.0109158,0.93589,0.004453713,0.03188927],"study_design_scores_gemma":[0.00004430102,0.00008484346,0.0007486028,0.00006829018,0.00001658787,0.0004599367,0.0001031636,0.08138773,0.01091077,0.894303,0.0118353,0.00003750668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4055467,0.002695209,0.5144475,0.003684445,0.0004762311,0.0001711526,0.001542715,0.0008108957,0.07062525],"genre_scores_gemma":[0.9276168,0.0008053207,0.0576555,0.0004238625,0.0003104776,0.0001610466,0.0008315835,0.0001130318,0.01208251],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004555618,"threshold_uncertainty_score":0.01524001,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2950759382","doi":"10.3934/amc.2019034","title":"Critical perspectives on provable security: Fifteen years of \"another look\" papers","year":2019,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical proof; Mathematics; Provable security; Subject (documents); Calculus (dental); Computer science; Cryptography; Algorithm; Library science","authors":[{"name":"Neal Koblitz","is_ca":false},{"name":"Alfred Menezes","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01905585154927772,"gpt":0.320767214288058,"spread":0.3017113627387802,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["metaresearch","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.04099899,0.001520261,0.001900319,0.005591436,0.005992406,0.01504695,0.003586064,0.008239881,0.01078532],"category_scores_gemma":[0.08134864,0.000785633,0.001531831,0.004884884,0.04446246,0.0387652,0.00932104,0.02598254,0.001623747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.01393111,"about_ca_system_score_gemma":0.005985553,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002889494,"about_ca_topic_score_gemma":0.002315887,"domain_scores_codex":[0.9768485,0.0128926,0.001245861,0.001857162,0.005967904,0.001187915],"domain_scores_gemma":[0.8601292,0.1143296,0.002984149,0.006761489,0.01296877,0.00282676],"domain_codex":null,"domain_gemma":"evaluation","domain_candidate":"evaluation","domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00003320052,0.00001818406,0.00004151735,0.0002322468,0.0000162087,0.00004692224,0.001757071,0.0002561299,0.00007625404,0.9437749,0.04437567,0.009371727],"study_design_scores_gemma":[0.00002313295,0.00002323292,0.00006869575,0.000886424,0.000008640409,0.00006220763,0.001444985,0.0002932696,0.0001327676,0.6274327,0.369599,0.00002491785],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"commentary","genre_gemma":"review","genre_scores_codex":[0.002992757,0.265907,0.02012024,0.6358634,0.03647829,0.00002273818,0.0001357749,0.0001373205,0.03834252],"genre_scores_gemma":[0.2607739,0.3453967,0.0253825,0.1796867,0.1445517,0.0003206023,0.00030792,0.001278265,0.04230181],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.9944085,"threshold_uncertainty_score":0.216826,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3000741554","doi":"10.3934/amc.2020062","title":"QC-LDPC construction free of small size elementary trapping sets based on multiplicative subgroups of a finite field","year":2020,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Mathematics; Girth (graph theory); Exponent; Multiplicative function; Tanner graph; Algebraic number; Parity-check matrix; Discrete mathematics; Combinatorics; Decoding methods; Finite field; Code (set theory); Error floor; Set (abstract data type); Statistics; Computer science","authors":[{"name":"Farzane Amirzade","is_ca":false},{"name":"Mohammad‐Reza Sadeghi","is_ca":false},{"name":"Daniel Panario","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0371959230580113,"gpt":0.3101597620060507,"spread":0.2729638389480394,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002099886,0.0002425286,0.0001905579,0.0003768004,0.0004365664,0.000313131,0.0003326769,0.0002629203,0.0008417299],"category_scores_gemma":[0.001110932,0.0001489051,0.0002966803,0.0003773056,0.0006332938,0.0005561135,0.0005928823,0.0004561076,0.0001134588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003185157,"about_ca_system_score_gemma":0.0007421019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009834184,"about_ca_topic_score_gemma":0.001400395,"domain_scores_codex":[0.9997784,0.00003943758,0.00001580991,0.00005203329,0.00007658368,0.00003755545],"domain_scores_gemma":[0.9990225,0.00039222,0.0001351926,0.0002728024,0.0001179381,0.00005938824],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005302128,0.0002278178,0.007466931,0.0006894536,0.0000813989,0.00111919,0.0007453192,0.1475853,0.4274366,0.3389623,0.002134615,0.07302088],"study_design_scores_gemma":[0.0001953542,0.0004753028,0.004849753,0.00007412383,0.0001139842,0.001236759,0.0001502601,0.6042513,0.291023,0.08723622,0.01030119,0.00009269696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8074916,0.000195089,0.1824671,0.0002327831,0.00003262865,0.0001256894,0.0002129064,0.0003772908,0.008864931],"genre_scores_gemma":[0.9520144,0.0001356412,0.04619145,0.00005720936,0.00001034734,0.00004931172,0.0002035173,0.00002545792,0.001312681],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0009834184,"threshold_uncertainty_score":0.002815902,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1965279733","doi":"10.3934/amc.2007.1.307","title":"The asymptotic behavior of N-adic complexity","year":2007,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Toronto; National Science Foundation","keywords":"Mathematics; Stream cipher; Sequence (biology); Ternary operation; Shift register; Set (abstract data type); Interval (graph theory); Binary number; Pseudorandom binary sequence; Linear feedback shift register; Discrete mathematics; Carry (investment); Arithmetic; Combinatorics; Algorithm; Cryptography; Computer science","authors":[{"name":"Andrew Klapper","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03981587391996123,"gpt":0.3406604835668546,"spread":0.3008446096468934,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002148247,0.000535861,0.0008414889,0.003084391,0.001042825,0.002327543,0.00131002,0.00108649,0.00421114],"category_scores_gemma":[0.03671803,0.0004959085,0.0005149919,0.001245758,0.003240394,0.005213702,0.002003235,0.001911263,0.0003986273],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002502987,"about_ca_system_score_gemma":0.0008073386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008825529,"about_ca_topic_score_gemma":0.0007578409,"domain_scores_codex":[0.9987189,0.0003638422,0.00005337915,0.0002271156,0.0004350819,0.0002018734],"domain_scores_gemma":[0.9776186,0.01657461,0.001882411,0.001415548,0.001564607,0.0009443287],"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.0002232431,0.00008689161,0.005900563,0.0002496618,0.00007406061,0.0003308699,0.0003387615,0.06139886,0.007061103,0.9065215,0.002516319,0.01529823],"study_design_scores_gemma":[0.00002941609,0.00009060941,0.00419845,0.0001090895,0.00002950862,0.0005436238,0.0001152247,0.3744539,0.002892338,0.6155723,0.001905338,0.00006028358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8135696,0.003060626,0.1339201,0.003667631,0.0001479462,0.00004689121,0.0004998368,0.0005589318,0.04452849],"genre_scores_gemma":[0.9894571,0.0008559357,0.006088973,0.000121402,0.0001906564,0.00008069567,0.0002177111,0.00006701656,0.002920662],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00421114,"threshold_uncertainty_score":0.01816058,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111604339","doi":"10.3934/amc.2013.7.113","title":"Even periodic and odd periodic complementary sequence pairs from generalized Boolean functions","year":2013,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Aperiodic graph; Mathematics; Complementary sequences; Binary Golay code; Sequence (biology); Periodic sequence; Periodic function; Combinatorics; Function (biology); Almost periodic function; Discrete mathematics; Pure mathematics; Mathematical analysis; Algorithm","authors":[{"name":"Yang Yang","is_ca":false},{"name":"Xiaohu Tang","is_ca":false},{"name":"Guang Gong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0335421611714988,"gpt":0.2921867532533029,"spread":0.2586445920818041,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003900598,0.0005995884,0.0003791752,0.001174863,0.0004084154,0.0008643512,0.0003471667,0.000469629,0.002464592],"category_scores_gemma":[0.001147755,0.0001610822,0.0003965272,0.000800999,0.0007078619,0.0009922803,0.0007049378,0.0006102814,0.0003900121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005294068,"about_ca_system_score_gemma":0.0004521652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002376711,"about_ca_topic_score_gemma":0.0003211716,"domain_scores_codex":[0.9995965,0.00009334731,0.0000291285,0.00006343516,0.0001661381,0.00005150331],"domain_scores_gemma":[0.9996827,0.0001172967,0.0000542991,0.00004439466,0.00007471169,0.00002657034],"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.0002154695,0.00004241536,0.0005036985,0.0002606511,0.00002551102,0.0004910271,0.0002651842,0.01746574,0.04110171,0.7999282,0.001608794,0.1380916],"study_design_scores_gemma":[0.00008322042,0.0003108467,0.001782808,0.000142248,0.00005706101,0.002064544,0.0001556692,0.1893037,0.05653023,0.7040453,0.04541924,0.0001050562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2345281,0.001838308,0.7146971,0.0003645196,0.0002814426,0.0001856941,0.0003827145,0.0003865141,0.04733566],"genre_scores_gemma":[0.7914798,0.001208654,0.1976131,0.0002461262,0.00022918,0.0002825369,0.0005312155,0.000102241,0.00830714],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002464592,"threshold_uncertainty_score":0.008244872,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963912591","doi":"10.3934/amc.2009.3.421","title":"A generalized construction of OFDM $M$-QAM sequences with low peak-to-average power ratio","year":2009,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Science Foundation","keywords":"Mathematics; QAM; Upper and lower bounds; Envelope (radar); Power (physics); Orthogonal frequency-division multiplexing; Quadrature amplitude modulation; Constellation; Discrete mathematics; Statistics; Combinatorics; Mathematical analysis; Telecommunications; Bit error rate; Computer science","authors":[{"name":"Zilong Wang","is_ca":false},{"name":"Guang Gong","is_ca":false},{"name":"Rongquan Feng","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01047224890220217,"gpt":0.2790740404006751,"spread":0.268601791498473,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004823421,0.0006618946,0.0005677934,0.0006337717,0.000728183,0.0005750752,0.0005138855,0.0005911202,0.002751555],"category_scores_gemma":[0.001348411,0.0003359852,0.0005771888,0.0006615455,0.0007745252,0.0006064256,0.001021754,0.0009395275,0.00119179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004606796,"about_ca_system_score_gemma":0.0006426522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002316029,"about_ca_topic_score_gemma":0.0003887294,"domain_scores_codex":[0.9996284,0.0001405387,0.00002174013,0.00005906604,0.0001062518,0.00004391497],"domain_scores_gemma":[0.9995042,0.0001440262,0.00006296643,0.000143604,0.0001095615,0.00003567252],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002426939,0.00006597936,0.0007232107,0.0003905275,0.00003343936,0.000671334,0.0005130793,0.03259622,0.1301162,0.6922061,0.004203594,0.1382376],"study_design_scores_gemma":[0.0001047752,0.000692005,0.001687422,0.0002293041,0.00006125731,0.003158958,0.0001394417,0.2874679,0.09370884,0.5092747,0.1032993,0.0001763055],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0524286,0.0005502099,0.925818,0.0004092928,0.0002580063,0.0001428444,0.00021681,0.0002849083,0.01989134],"genre_scores_gemma":[0.3252257,0.000894246,0.6593654,0.0003932128,0.0002100392,0.0004249644,0.0004643834,0.0001290913,0.01289281],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002751555,"threshold_uncertainty_score":0.009204865,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2893614166","doi":"10.3934/amc.2018044","title":"Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields","year":2018,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete logarithm; Finite field; Mathematics; Logarithm; Computation; Field (mathematics); Discrete mathematics; Polynomial; Pure mathematics; Algorithm; Mathematical analysis; Computer science; Public-key cryptography","authors":[{"name":"Gora Adj","is_ca":false},{"name":"Isaac Canales-Martínez","is_ca":false},{"name":"Nareli Cruz-Cortés","is_ca":false},{"name":"Alfred Menezes","is_ca":true},{"name":"Thomaz Oliveira","is_ca":false},{"name":"Luis Rivera-Zamarripa","is_ca":false},{"name":"Francisco Rodríguez‐Henríquez","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02583895282602374,"gpt":0.316651990292815,"spread":0.2908130374667913,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001387696,0.0004627793,0.0005269517,0.0007031752,0.0008147936,0.001857343,0.0007317042,0.0005355544,0.003524341],"category_scores_gemma":[0.005904158,0.0001785021,0.0008707834,0.001061248,0.00219559,0.004706491,0.002333455,0.002056834,0.000828046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001538602,"about_ca_system_score_gemma":0.001615632,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007511857,"about_ca_topic_score_gemma":0.001007728,"domain_scores_codex":[0.9991248,0.0001642515,0.0000604454,0.0001455375,0.0003047244,0.0002003127],"domain_scores_gemma":[0.9973539,0.001606251,0.0002239076,0.0004511025,0.0002255854,0.000139336],"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.001518658,0.0003000622,0.009195647,0.0004530398,0.0001038566,0.0006347011,0.001058383,0.04983587,0.02443377,0.7628602,0.006258711,0.1433471],"study_design_scores_gemma":[0.00023918,0.0002735259,0.001212114,0.00009087334,0.00004394125,0.0004817608,0.0003071597,0.1110794,0.0420236,0.8312187,0.01295673,0.00007291711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5353427,0.0008303486,0.4346442,0.002391879,0.0002103157,0.0001344999,0.0004310072,0.001625153,0.02438993],"genre_scores_gemma":[0.9214618,0.0002513177,0.07533047,0.0002173886,0.00006022404,0.0000369906,0.0002411202,0.00007465968,0.002326077],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003524341,"threshold_uncertainty_score":0.0117901,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2612757204","doi":"10.3934/amc.2017034","title":"Cycle structure of iterating Redei functions","year":2017,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Quadratic equation; Prime (order theory); Reciprocity law; Exponentiation; Reciprocity (cultural anthropology); Pure mathematics; Mathematical analysis; Mathematical physics; Combinatorics; Geometry","authors":[{"name":"Claudio Qureshi","is_ca":false},{"name":"Daniel Panario","is_ca":true},{"name":"Rodrigo S. V. Martins","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01911933057508611,"gpt":0.3157061989901359,"spread":0.2965868684150497,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004907075,0.0003493906,0.00044584,0.001743654,0.00119596,0.001526478,0.000638963,0.0006254075,0.00427275],"category_scores_gemma":[0.002497899,0.0003452175,0.0004939112,0.0006854116,0.001885682,0.002244375,0.001375876,0.000939118,0.0006438485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009284918,"about_ca_system_score_gemma":0.0003917171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001096861,"about_ca_topic_score_gemma":0.0007215476,"domain_scores_codex":[0.9997001,0.00004306377,0.00001788813,0.00004959712,0.00007475284,0.0001146796],"domain_scores_gemma":[0.9985375,0.0005085328,0.0002212265,0.0002177093,0.0002858342,0.000229188],"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.0002093111,0.00003047189,0.002962101,0.00004366279,0.000009104338,0.0003270811,0.001083986,0.007788572,0.004784907,0.9710563,0.0006069833,0.01109746],"study_design_scores_gemma":[0.0000358227,0.0001343027,0.002541468,0.00005411115,0.00002096188,0.0004126148,0.0005571928,0.08208049,0.00975203,0.8979328,0.006416186,0.0000619269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8930033,0.000305151,0.08638277,0.0001748737,0.00003340839,0.00004642207,0.0001645146,0.0001842796,0.01970528],"genre_scores_gemma":[0.979812,0.0001766455,0.008081636,0.00003275186,0.00003057109,0.00004642847,0.000163725,0.00006224488,0.01159408],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00427275,"threshold_uncertainty_score":0.01429379,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4387545514","doi":"10.3934/amc.2023036","title":"Polynomial representation of additive cyclic codes and new quantum codes","year":2023,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Cyclic code; Polynomial code; Combinatorics; Binary number; Polynomial; Symplectic geometry; Linear code; Generator (circuit theory); Discrete mathematics; Quantum; Block code; Pure mathematics; Algorithm; Arithmetic; Power (physics); Decoding methods; Mathematical analysis; Quantum mechanics","authors":[{"name":"Reza Dastbasteh","is_ca":true},{"name":"Khalil Shivji","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03357229013745686,"gpt":0.3365365296462214,"spread":0.3029642395087645,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004483573,0.0003825077,0.0002731989,0.001214611,0.0007846136,0.001320964,0.000757968,0.0007516239,0.004288807],"category_scores_gemma":[0.001630044,0.000196848,0.000504378,0.000930963,0.001650229,0.001678774,0.001568007,0.001892061,0.0007719888],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008757276,"about_ca_system_score_gemma":0.0006000767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005865297,"about_ca_topic_score_gemma":0.0005116633,"domain_scores_codex":[0.9992262,0.0001117785,0.00003623916,0.000110451,0.0003483948,0.0001669055],"domain_scores_gemma":[0.9991478,0.0002278203,0.0001383382,0.0001857219,0.00019889,0.000101536],"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.00002498829,0.0000191939,0.00009707733,0.00002846544,0.000002667254,0.00005310362,0.0001141572,0.003056425,0.00273345,0.9817831,0.000722006,0.01136537],"study_design_scores_gemma":[0.00001821083,0.00009503766,0.0002719565,0.00002740127,0.00001088819,0.0003021893,0.00008305103,0.04584156,0.00828559,0.9319264,0.01309353,0.00004416792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3286253,0.001130268,0.584874,0.002328213,0.0004914115,0.00009290449,0.0004357437,0.0003773191,0.08164477],"genre_scores_gemma":[0.8896413,0.0006498104,0.09223331,0.0004247723,0.0004480334,0.00008419973,0.0002966944,0.0001055592,0.01611633],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004288807,"threshold_uncertainty_score":0.01434743,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024305003","doi":"10.3934/amc.2007.1.413","title":"On the security of generalized Jacobian cryptosystems","year":2007,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"University of Waterloo; McGill University","keywords":"Mathematics; Discrete logarithm; Finite field; Elliptic curve; Jacobian matrix and determinant; Pure mathematics; Cryptosystem; Hyperelliptic curve cryptography; Multiplicative function; Cryptography; Logarithm; Elliptic curve cryptography; Algebraic number; Algebra over a field; Applied mathematics; Discrete mathematics; Mathematical analysis; Public-key cryptography; Algorithm; Encryption; Computer science","authors":[{"name":"Isabelle Déchène","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02774178960676147,"gpt":0.340894421191333,"spread":0.3131526315845715,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00287162,0.001153908,0.001191317,0.00193299,0.002056064,0.004206184,0.001058779,0.00195532,0.004424491],"category_scores_gemma":[0.01243078,0.000512832,0.000590778,0.001484401,0.008889343,0.0112046,0.005701659,0.004446763,0.0007898377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00218646,"about_ca_system_score_gemma":0.001349351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001189999,"about_ca_topic_score_gemma":0.0005391681,"domain_scores_codex":[0.997734,0.0006153291,0.00009807049,0.0003292947,0.0007284392,0.0004949049],"domain_scores_gemma":[0.9897606,0.007232766,0.0007346953,0.001331029,0.0005183491,0.0004225767],"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.0002384536,0.00005483376,0.000526983,0.0001113945,0.00001944954,0.0002238405,0.0003244824,0.01714035,0.001959601,0.9646157,0.00206459,0.01272022],"study_design_scores_gemma":[0.00004851641,0.00005203915,0.0001934564,0.00004595553,0.000008451504,0.00008295143,0.00006885584,0.03635176,0.0008592677,0.9601792,0.00208731,0.00002228566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6952393,0.009260477,0.1392666,0.02435815,0.0007478325,0.0001465232,0.0004324364,0.0003424317,0.1302063],"genre_scores_gemma":[0.9843653,0.002960735,0.005750415,0.0003372179,0.0007999761,0.0000561576,0.0001048447,0.000036071,0.005589132],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004424491,"threshold_uncertainty_score":0.01586396,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2794822170","doi":"10.3934/amc.2019012","title":"On the security of the WOTS-PRF signature scheme","year":2018,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Scheme (mathematics); Mathematics; Signature (topology); Security analysis; Computer security; Computer science; Mathematical analysis; Geometry","authors":[{"name":"Philip Lafrance","is_ca":false},{"name":"Alfred Menezes","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03358422337389119,"gpt":0.3575211957357783,"spread":0.3239369723618872,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006598836,0.001130517,0.001500654,0.002196616,0.002892824,0.004284632,0.001940704,0.003164512,0.005654736],"category_scores_gemma":[0.02016492,0.0006982879,0.00177769,0.002650072,0.01193003,0.0199055,0.006234339,0.007211204,0.001888939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003266324,"about_ca_system_score_gemma":0.002853135,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001938909,"about_ca_topic_score_gemma":0.0006466937,"domain_scores_codex":[0.9932083,0.001215487,0.0004352779,0.0009945077,0.002961466,0.001184981],"domain_scores_gemma":[0.9888552,0.004952288,0.0007919521,0.004052854,0.001035322,0.0003123363],"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.0001273655,0.00001593572,0.0002135356,0.00005512668,0.0000113206,0.0001188036,0.0002655862,0.003760063,0.00137907,0.9861494,0.00078192,0.007121684],"study_design_scores_gemma":[0.00003620296,0.00003713774,0.000140001,0.00005321045,0.00001681749,0.0001609067,0.00006434616,0.01413606,0.003124946,0.9780136,0.004167935,0.00004872533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2187449,0.001546149,0.6900839,0.01039474,0.0006881394,0.000300057,0.0008806081,0.001402199,0.07595932],"genre_scores_gemma":[0.9134542,0.001269035,0.07558559,0.0007313652,0.0003460426,0.0001508204,0.000406003,0.0001944478,0.007862403],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006598836,"threshold_uncertainty_score":0.03489834,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3033468545","doi":"10.3934/amc.2020084","title":"Involutory-Multiple-Lightweight MDS Matrices based on Cauchy-type Matrices","year":2020,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Cauchy distribution; Cauchy matrix; Combinatorics; Matrix (chemical analysis); Separable space; Arithmetic; Algebra over a field; Discrete mathematics; Pure mathematics; Mathematical analysis","authors":[{"name":"Mohsen Mousavi","is_ca":false},{"name":"Ali Zaghian","is_ca":false},{"name":"Morteza Esmaeili","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03156773573641825,"gpt":0.2927607577353855,"spread":0.2611930219989672,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004911972,0.001074949,0.0004402498,0.001491881,0.0007164423,0.00156395,0.0008301182,0.0006464506,0.009976305],"category_scores_gemma":[0.00332403,0.0003178259,0.0005453816,0.001415739,0.001112128,0.001820208,0.001234971,0.001528229,0.005039701],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007447951,"about_ca_system_score_gemma":0.0009825212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009472981,"about_ca_topic_score_gemma":0.001416509,"domain_scores_codex":[0.9993112,0.0001544372,0.00004726555,0.0001341784,0.0002691748,0.00008363901],"domain_scores_gemma":[0.9986703,0.0003472016,0.0001526233,0.0002682209,0.000399581,0.0001620988],"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.0001320735,0.00006497564,0.0003806621,0.0001753292,0.00001866239,0.0002925992,0.0003043199,0.01931135,0.02139823,0.8415149,0.008420736,0.1079861],"study_design_scores_gemma":[0.00004182536,0.0002299412,0.0003223356,0.0001056731,0.00002188884,0.0009139564,0.0002390719,0.3040552,0.04616389,0.590153,0.0576388,0.0001144838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03530035,0.0004720108,0.9316338,0.0003740911,0.000259947,0.0001359491,0.0004247228,0.0009556755,0.03044344],"genre_scores_gemma":[0.4948965,0.00128779,0.4648727,0.0005333216,0.0003693193,0.0003518767,0.001267565,0.0006068275,0.03581417],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009976305,"threshold_uncertainty_score":0.03337401,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2587862547","doi":"10.3934/amc.2017002","title":"New almost perfect, odd perfect, and perfect sequences from difference balanced functions with <i>d</i>-form property","year":2017,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Perfect power; Interleaving; Combinatorics; Complementary sequences; Property (philosophy); QAM; Discrete mathematics; Algorithm; Quadrature amplitude modulation; Decoding methods","authors":[{"name":"Yang Yang","is_ca":false},{"name":"Xiaohu Tang","is_ca":false},{"name":"Guang Gong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02102754691703831,"gpt":0.2666805168844131,"spread":0.2456529699673748,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003673477,0.0006131536,0.0003374786,0.0007332507,0.0003939226,0.0006220129,0.0003434617,0.0005323389,0.002367724],"category_scores_gemma":[0.00131705,0.0002449726,0.0003350415,0.0007449217,0.0006975065,0.001209846,0.0007105211,0.0007265658,0.0005401745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003770255,"about_ca_system_score_gemma":0.0006822668,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002304164,"about_ca_topic_score_gemma":0.0002508706,"domain_scores_codex":[0.999702,0.00007096997,0.0000293705,0.00006048903,0.00009321863,0.00004401132],"domain_scores_gemma":[0.9995922,0.0001093325,0.00007924447,0.00007094925,0.0001004832,0.00004780368],"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.0004094505,0.00005268387,0.001182803,0.0003709226,0.00003509998,0.0004467465,0.000366235,0.01281201,0.1148193,0.7287474,0.001913386,0.1388441],"study_design_scores_gemma":[0.0001590624,0.0009219508,0.00266253,0.0001903268,0.0001107076,0.004278041,0.0003243517,0.1620319,0.2026037,0.570913,0.05561364,0.0001906205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2069546,0.001335524,0.7648592,0.000479584,0.0004423885,0.0001247843,0.0004841453,0.0003212784,0.02499839],"genre_scores_gemma":[0.7549753,0.001142449,0.2318414,0.0003238903,0.0001648791,0.0001617308,0.0007416195,0.00008800312,0.01056067],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002367724,"threshold_uncertainty_score":0.007920861,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980718426","doi":"10.3934/amc.2014.8.459","title":"Smoothness testing of polynomials over finite fields","year":2014,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique","keywords":"Smoothness; Mathematics; Degree (music); Integer (computer science); Finite field; Factorization; Function (biology); Field (mathematics); Bernstein polynomial; Point (geometry); Applied mathematics; Pure mathematics; Discrete mathematics; Mathematical analysis; Algorithm; Geometry","authors":[{"name":"Jean‐François Biasse","is_ca":true},{"name":"Michael J. Jacobson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02584702154191904,"gpt":0.3034912473268492,"spread":0.2776442257849301,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009719581,0.0009666589,0.001482005,0.002140815,0.001341766,0.002240892,0.003512528,0.001447406,0.005332142],"category_scores_gemma":[0.06463011,0.0005239812,0.001010854,0.00150934,0.003831632,0.006378936,0.003375765,0.002974959,0.000782187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002643211,"about_ca_system_score_gemma":0.002367307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002755361,"about_ca_topic_score_gemma":0.001913302,"domain_scores_codex":[0.9937881,0.002101804,0.0002146389,0.0009379229,0.002072693,0.0008847589],"domain_scores_gemma":[0.943629,0.0392896,0.003688375,0.007897872,0.003512764,0.001982336],"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.005926111,0.000515385,0.03830343,0.0003861613,0.0001843357,0.0005356335,0.0004642556,0.2640951,0.0378792,0.4308808,0.008804319,0.2120254],"study_design_scores_gemma":[0.0001202065,0.0004108411,0.002865982,0.00002763026,0.00002740181,0.0001934962,0.00008354946,0.826921,0.02030276,0.1475982,0.001378768,0.00007012468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3769729,0.0004804022,0.6118718,0.001612148,0.0001413979,0.000150139,0.0003963048,0.002013783,0.006361225],"genre_scores_gemma":[0.9197268,0.0001833581,0.07695641,0.0001278986,0.0001543652,0.00006507344,0.0004725666,0.0001618743,0.002151736],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009719581,"threshold_uncertainty_score":0.05140269,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070925289","doi":"10.3934/amc.2014.8.119","title":"Nearest-neighbor entropy estimators with weak metrics","year":2014,"lang":"en","type":"preprint","venue":"Advances in Mathematics of Communications","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Estimator; Mathematics; Entropy estimation; Entropy (arrow of time); Upper and lower bounds; Minimax estimator; Ergodic theory; k-nearest neighbors algorithm; Bounded function; Applied mathematics; Maximum entropy probability distribution; Minimum-variance unbiased estimator; Nonparametric statistics; Statistics; Principle of maximum entropy; Computer science; Artificial intelligence; Mathematical analysis; Physics","authors":[{"name":"Е. А. Тимофеев","is_ca":false},{"name":"Alexei Kaltchenko","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0255040991783082,"gpt":0.3320897558339155,"spread":0.3065856566556073,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008444597,0.001502174,0.00188378,0.002850315,0.0008061873,0.002365774,0.001966341,0.002032455,0.001169088],"category_scores_gemma":[0.05141126,0.000787759,0.0007667862,0.001791804,0.001926196,0.005290181,0.004215193,0.00199097,0.0005809435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00116179,"about_ca_system_score_gemma":0.0008163401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009653355,"about_ca_topic_score_gemma":0.0008724877,"domain_scores_codex":[0.9936252,0.003023378,0.0004045939,0.0008071057,0.001934104,0.0002055294],"domain_scores_gemma":[0.982569,0.01146285,0.001390737,0.002235621,0.002040658,0.0003011409],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001926268,0.00007649812,0.003350441,0.0003021789,0.0001780943,0.0001254884,0.0001554516,0.5063413,0.006477963,0.2958823,0.002442154,0.1844755],"study_design_scores_gemma":[0.000008334046,0.00003594923,0.0004344184,0.00001928208,0.00001419949,0.00005718745,0.00001240767,0.8979938,0.001823794,0.09843109,0.001146049,0.00002351653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007480862,0.0005608998,0.9910061,0.0001058769,0.00003841295,0.00001899071,0.00003434906,0.00008196421,0.0006725242],"genre_scores_gemma":[0.3927233,0.001452337,0.6011732,0.0002127664,0.0004894198,0.0002150877,0.0004629116,0.0001738902,0.00309724],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008444597,"threshold_uncertainty_score":0.04465979,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2911380990","doi":"10.3934/amc.2019019","title":"Some new constructions of isodual and LCD codes over finite fields","year":2019,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Finite field; Liquid-crystal display; Dual (grammatical number); Generator (circuit theory); Root (linguistics); Simple (philosophy); Discrete mathematics; Pure mathematics; Computer science; Physics; Linguistics; Power (physics)","authors":[{"name":"Fatma-Zohra Benahmed","is_ca":false},{"name":"Kenza Guenda","is_ca":false},{"name":"Aicha Batoul","is_ca":false},{"name":"T. Aaron Gulliver","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01516057034657189,"gpt":0.2879144393704459,"spread":0.2727538690238741,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005704869,0.0004080719,0.0003580953,0.001440749,0.001086409,0.001053718,0.0005532512,0.0005770227,0.002624696],"category_scores_gemma":[0.001933338,0.0003099999,0.0005449,0.0008561409,0.001520306,0.001638889,0.001832441,0.00158138,0.0004835819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008905703,"about_ca_system_score_gemma":0.000683749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003290755,"about_ca_topic_score_gemma":0.0003659314,"domain_scores_codex":[0.9994013,0.0001235205,0.00004901268,0.0001217638,0.0002133876,0.00009099538],"domain_scores_gemma":[0.9989574,0.0003014412,0.0001177167,0.0002789201,0.0002078613,0.0001366701],"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.0001228041,0.00004402498,0.001102175,0.0001580896,0.0000105789,0.0003621449,0.000646316,0.004103153,0.01549783,0.9300201,0.001529619,0.04640326],"study_design_scores_gemma":[0.0001035459,0.0002531556,0.001210719,0.0001634788,0.00005169628,0.0028126,0.0004143634,0.05124378,0.04055955,0.8278829,0.07516735,0.0001368436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3060382,0.002326244,0.6050618,0.001230498,0.0005440398,0.000217508,0.0005177211,0.0005392681,0.08352473],"genre_scores_gemma":[0.7710124,0.001413678,0.211689,0.0006037457,0.0003349166,0.0002193356,0.0006390591,0.0001941344,0.01389363],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002624696,"threshold_uncertainty_score":0.008780479,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963700364","doi":"10.3934/amc.2017056","title":"On the performance of optimal double circulant even codes","year":2017,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Circulant matrix; Mathematics; Dual (grammatical number); Decoding methods; Weight distribution; Bounded function; Minimum distance; Minimum weight; Combinatorics; Discrete mathematics; Distribution (mathematics); Algorithm; Mathematical analysis","authors":[{"name":"T. Aaron Gulliver","is_ca":true},{"name":"Masaaki Harada","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03960450188849118,"gpt":0.321030070237887,"spread":0.2814255683493959,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00356571,0.001326058,0.001403093,0.001347407,0.0008967086,0.00190828,0.0009212826,0.001095182,0.001665854],"category_scores_gemma":[0.02713569,0.0003756278,0.0002531141,0.001081243,0.002010083,0.00189196,0.002479488,0.0009048743,0.0003261521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001596803,"about_ca_system_score_gemma":0.0019894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001261645,"about_ca_topic_score_gemma":0.001047008,"domain_scores_codex":[0.9966402,0.001041001,0.0001280685,0.0002940935,0.001050136,0.0008465254],"domain_scores_gemma":[0.9831311,0.01173533,0.001359998,0.001433684,0.001568722,0.0007712275],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00353317,0.0002083439,0.010841,0.0003144889,0.000189473,0.0004139098,0.0002578112,0.794957,0.04112765,0.1055991,0.002391417,0.04016672],"study_design_scores_gemma":[0.0001224186,0.0006950258,0.002820515,0.0001253528,0.00006031988,0.00041477,0.0001763702,0.9027066,0.03029262,0.06157212,0.0008922419,0.0001216083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9506339,0.001462141,0.03577695,0.0006342507,0.00007029844,0.00003483502,0.000286922,0.000267665,0.01083317],"genre_scores_gemma":[0.9957786,0.0002952986,0.003311678,0.00005321687,0.00002436493,0.00001628968,0.0001227207,0.00003620637,0.000361749],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00356571,"threshold_uncertainty_score":0.01885754,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2991341770","doi":"10.3934/amc.2020047","title":"A construction of $ \\mathbb{F}_2 $-linear cyclic, MDS codes","year":2019,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Generator matrix; Combinatorics; Logarithm; Separable space; Partition (number theory); Dimension (graph theory); Prime (order theory); Parity (physics); Linear code; Discrete mathematics; Matrix (chemical analysis); Block code; Algorithm; Mathematical analysis","authors":[{"name":"Sara D. Cardell","is_ca":true},{"name":"Joan‐Josep Climent","is_ca":true},{"name":"Daniel Panario","is_ca":true},{"name":"Brett Stevens","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0146866348005006,"gpt":0.2986698521217794,"spread":0.2839832173212788,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001623345,0.0004006051,0.0002600101,0.0006637676,0.0005715456,0.0004247489,0.0003417023,0.0003673823,0.002515756],"category_scores_gemma":[0.0007412081,0.0002113333,0.0002610594,0.0005790126,0.0007570765,0.0004510479,0.00104375,0.0005776142,0.0007545577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005706596,"about_ca_system_score_gemma":0.0008751375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007800154,"about_ca_topic_score_gemma":0.001033672,"domain_scores_codex":[0.9997864,0.000045374,0.00001001563,0.00003410131,0.00007838265,0.00004572372],"domain_scores_gemma":[0.9997249,0.00007187526,0.00004455577,0.00006842803,0.00005082948,0.00003934835],"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.0002717701,0.00009253121,0.001281411,0.0002920797,0.0000303188,0.0004757668,0.0005057289,0.0380864,0.07871842,0.7123143,0.006950408,0.1609809],"study_design_scores_gemma":[0.0002110448,0.0006455435,0.002245586,0.0001709138,0.00005529731,0.002033771,0.000209759,0.2443778,0.1909288,0.4478878,0.1110407,0.0001929503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2765633,0.0008624311,0.6776021,0.0009228287,0.0002373382,0.0002163284,0.0007552257,0.001144088,0.04169636],"genre_scores_gemma":[0.6786897,0.0004750832,0.3011245,0.0003790292,0.00009526972,0.0002144851,0.0005800604,0.000122051,0.0183199],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002515756,"threshold_uncertainty_score":0.008416057,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4392250595","doi":"10.3934/amc.2024007","title":"A criterion for decoding on the binary symmetric channel","year":2024,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Decoding methods; Binary number; Binary symmetric channel; Channel (broadcasting); Combinatorics; Algorithm; Arithmetic; Channel code; Telecommunications; Computer science","authors":[{"name":"Anup Rao","is_ca":false},{"name":"Oscar Sprumont","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06436179215317825,"gpt":0.3763330940520546,"spread":0.3119713018988763,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003009213,0.001298326,0.001187782,0.003025012,0.001953264,0.002726582,0.002055261,0.002606736,0.005498451],"category_scores_gemma":[0.0291348,0.0005597928,0.0008061467,0.002035027,0.00433149,0.005202984,0.005160057,0.003555539,0.00271223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002987366,"about_ca_system_score_gemma":0.00288981,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001590547,"about_ca_topic_score_gemma":0.0007800526,"domain_scores_codex":[0.994385,0.001060102,0.0002936867,0.0007902847,0.002592643,0.0008782846],"domain_scores_gemma":[0.9836155,0.008398197,0.001247386,0.002265356,0.003509216,0.0009643371],"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.0001848805,0.00004300824,0.0007418847,0.00008560734,0.0000187311,0.0001757978,0.0002108687,0.03356142,0.008519906,0.9340391,0.003783641,0.01863518],"study_design_scores_gemma":[0.00005997883,0.0001308909,0.0004056365,0.00005927582,0.00001524235,0.0002292491,0.00006997466,0.1855342,0.01394643,0.7938143,0.005674487,0.00006042891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1087347,0.000464853,0.8435374,0.002905473,0.0001633181,0.000231223,0.00088185,0.001053368,0.04202778],"genre_scores_gemma":[0.8642728,0.000760131,0.1157008,0.001153052,0.0004107876,0.0007480776,0.00119911,0.0007669049,0.0149884],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005498451,"threshold_uncertainty_score":0.02167499,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3112560171","doi":"10.3934/amc.2020125","title":"On ideal $ t $-tuple distribution of orthogonal functions in filtering de bruijn generators","year":2020,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; De Bruijn sequence; Tuple; Combinatorics; Ideal (ethics); Binary number; Generator (circuit theory); Discrete mathematics; Sequence (biology); Arithmetic","authors":[{"name":"Kalikinkar Mandal","is_ca":true},{"name":"Guang Gong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02528393588309801,"gpt":0.2869563206010946,"spread":0.2616723847179966,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001616598,0.0005152929,0.0006452528,0.001422503,0.0008947524,0.001732272,0.000814747,0.0007737328,0.00620892],"category_scores_gemma":[0.008550189,0.000328382,0.0007104279,0.001020417,0.001816424,0.002265178,0.000953514,0.001136663,0.001402918],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009852317,"about_ca_system_score_gemma":0.0006684191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006787825,"about_ca_topic_score_gemma":0.0004208855,"domain_scores_codex":[0.9984425,0.0005064814,0.00007389569,0.0003352219,0.0003575917,0.0002844183],"domain_scores_gemma":[0.9953945,0.002663818,0.0005359063,0.0006001419,0.0004661648,0.00033949],"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.0002121197,0.00003974167,0.001877813,0.00007561636,0.00001593927,0.0002749806,0.0002185582,0.0207394,0.008885153,0.9472577,0.001918339,0.01848466],"study_design_scores_gemma":[0.00006175583,0.0001649255,0.001909997,0.00005532717,0.00001841906,0.0005864558,0.0001159332,0.3122034,0.01148075,0.6677323,0.005576617,0.00009407431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2919529,0.0006778546,0.6811295,0.0006622014,0.000129798,0.0001080455,0.0006553772,0.0007130217,0.02397142],"genre_scores_gemma":[0.9439269,0.0005331128,0.04254435,0.0002719363,0.0002658774,0.000271508,0.0007504494,0.0004878487,0.01094803],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00620892,"threshold_uncertainty_score":0.02077091,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4402768742","doi":"10.3934/amc.2024039","title":"An RSA cryptosystem based on Lehmer sequences in Some classes of groups","year":2024,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Cryptosystem; Pure mathematics; Arithmetic; Algebra over a field; Cryptography; Algorithm","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.02368202647637344,"gpt":0.3274646391995649,"spread":0.3037826127231915,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003058398,0.0002861122,0.0003816918,0.0007808153,0.0008668168,0.0009163041,0.0002624076,0.0004508996,0.002277988],"category_scores_gemma":[0.001018364,0.0001125439,0.0003081996,0.0004598916,0.0008800786,0.002486752,0.0007361293,0.0006361021,0.0003949438],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005127518,"about_ca_system_score_gemma":0.0005969995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002086158,"about_ca_topic_score_gemma":0.0002197825,"domain_scores_codex":[0.9996682,0.00006389893,0.00002333941,0.00005744745,0.0001130295,0.00007404584],"domain_scores_gemma":[0.9996295,0.000134657,0.00006954672,0.00008315894,0.00004840516,0.00003474683],"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.0004363724,0.00007872184,0.00121959,0.000201679,0.00003098938,0.0003727973,0.0007417432,0.0155181,0.0397297,0.821219,0.00135678,0.1190945],"study_design_scores_gemma":[0.0001455031,0.0005490287,0.001397926,0.0001108504,0.00005683685,0.001565755,0.0003522797,0.1734231,0.09695183,0.6784904,0.04683159,0.0001249267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4522368,0.002272978,0.4888698,0.0009124542,0.0003286922,0.0002590499,0.0001346678,0.0006442002,0.05434141],"genre_scores_gemma":[0.933874,0.0006208894,0.05956287,0.00011747,0.0001095971,0.00005708509,0.00009938181,0.00003214278,0.005526554],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002277988,"threshold_uncertainty_score":0.007620692,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020012988","doi":"10.3934/amc.2013.7.103","title":"Generalizations of Verheul's theorem to asymmetric pairings","year":2013,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Isomorphism (crystallography); Discrete mathematics; Crystallography; Crystal structure","authors":[{"name":"Koray Karabina","is_ca":true},{"name":"Edward Knapp","is_ca":true},{"name":"Alfred Menezes","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01695912699432906,"gpt":0.2840770749925573,"spread":0.2671179479982282,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006232177,0.001462057,0.001350242,0.001985016,0.00298032,0.003281203,0.002984866,0.002080353,0.01277051],"category_scores_gemma":[0.01347284,0.00083432,0.002498958,0.002132411,0.005486901,0.01666738,0.008649488,0.006118016,0.002140839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003753302,"about_ca_system_score_gemma":0.002017688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001848074,"about_ca_topic_score_gemma":0.001155091,"domain_scores_codex":[0.9931073,0.001811244,0.0003492716,0.001170055,0.002129312,0.001432848],"domain_scores_gemma":[0.9909859,0.004298761,0.0004542416,0.003135332,0.0008361087,0.0002897028],"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.00003130873,0.00002164357,0.0001134336,0.00005186892,0.000008281143,0.00005978588,0.000101248,0.001961281,0.0004332767,0.987757,0.001941785,0.007519056],"study_design_scores_gemma":[0.00001948403,0.00001588836,0.0001023894,0.00001838841,0.000008052707,0.00008747214,0.00003154462,0.009092169,0.001476771,0.9820467,0.007082718,0.00001836941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07841565,0.002439047,0.7136264,0.01059989,0.001185874,0.0003362008,0.0008898467,0.0007725097,0.1917346],"genre_scores_gemma":[0.8042375,0.003539926,0.1437122,0.002646014,0.001387761,0.0007272199,0.0008706331,0.000462276,0.04241633],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01277051,"threshold_uncertainty_score":0.04272157,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976832500","doi":"10.3934/amc.2013.7.475","title":"Correlation of binary sequence families derived from the multiplicative characters of finite fields","year":2013,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Multiplicative function; Combinatorics; Sequence (biology); Finite field; Binary number; Bounded function; Pseudorandom binary sequence; Mathematical analysis; Arithmetic","authors":[{"name":"Zilong Wang","is_ca":true},{"name":"Guang Gong","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03027566723517099,"gpt":0.290193938646525,"spread":0.259918271411354,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008568656,0.0004436306,0.0004667295,0.001054509,0.001108172,0.0008194693,0.0005418432,0.0005705283,0.002781499],"category_scores_gemma":[0.003942237,0.0003640821,0.0004398863,0.0007929089,0.0009391168,0.002191563,0.001150861,0.0009984153,0.0004800148],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008206512,"about_ca_system_score_gemma":0.0006155643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001327398,"about_ca_topic_score_gemma":0.0001555553,"domain_scores_codex":[0.9990489,0.0003181787,0.00004703199,0.000145677,0.0002783877,0.0001617511],"domain_scores_gemma":[0.9976293,0.001125846,0.0004329191,0.000364649,0.0002484661,0.0001988421],"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.0004827048,0.00008910011,0.002585262,0.0002618858,0.00002675752,0.0005863254,0.0005154939,0.0174401,0.04060358,0.8685876,0.003177927,0.06564313],"study_design_scores_gemma":[0.00012916,0.0006558626,0.003315904,0.0001727437,0.00007034493,0.00383537,0.0002834336,0.2512524,0.09551289,0.6087876,0.03575669,0.0002276593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5086446,0.002085634,0.4609904,0.0006383379,0.0002377707,0.0001215757,0.0002694217,0.0005335876,0.02647864],"genre_scores_gemma":[0.9342532,0.0008024704,0.05941853,0.0002106786,0.0001722431,0.0001943151,0.0002830711,0.00009245582,0.004573029],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002781499,"threshold_uncertainty_score":0.00930506,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4312608599","doi":"10.3934/amc.2022083","title":"Improved lower bounds for self-dual codes over $ \\mathbb{F}_{11} $, $ \\mathbb{F}_{13} $, $ \\mathbb{F}_{17} $, $ \\mathbb{F}_{19} $ and $ \\mathbb{F}_{23} $","year":2022,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Dual (grammatical number)","authors":[{"name":"T. Aaron Gulliver","is_ca":true},{"name":"Masaaki Harada","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01689771446017701,"gpt":0.3018250839024632,"spread":0.2849273694422862,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002697608,0.005572355,0.001978616,0.003930429,0.002226937,0.005866264,0.002912912,0.002444237,0.03649375],"category_scores_gemma":[0.02035363,0.001093055,0.001751902,0.003593666,0.003227879,0.005101178,0.00647524,0.006103229,0.01878867],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003719851,"about_ca_system_score_gemma":0.004629999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004014768,"about_ca_topic_score_gemma":0.007104164,"domain_scores_codex":[0.9947977,0.0009000701,0.0001985752,0.0007428004,0.002161757,0.001199101],"domain_scores_gemma":[0.9898393,0.005250007,0.0005841079,0.001759891,0.001895592,0.0006710914],"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.0007434346,0.0003781222,0.001366532,0.001136039,0.0001513901,0.0004217469,0.0005308423,0.07450704,0.009930066,0.6865279,0.09741367,0.1268933],"study_design_scores_gemma":[0.0001048462,0.0001731201,0.0003792494,0.000557485,0.0001296563,0.0005245645,0.000209323,0.2790323,0.009397212,0.6723506,0.03696289,0.0001785834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05533886,0.00624311,0.7183101,0.005119711,0.002184619,0.000570018,0.006066263,0.005758217,0.2004091],"genre_scores_gemma":[0.539387,0.005803813,0.3385935,0.004434316,0.001637564,0.002228858,0.01084742,0.007381486,0.08968599],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03649375,"threshold_uncertainty_score":0.1220837,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385457409","doi":"10.3934/amc.2023026","title":"Constacyclic and quasi-twisted codes over $ \\mathbb{Z}_{q}[u]/\\langle u^{2}-1\\rangle $ and new $ \\mathbb{Z}_4 $-linear codes","year":2023,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Ring (chemistry); Code (set theory); Combinatorics; Characterization (materials science); Algebraic number; Linear code; Discrete mathematics; Algorithm; Physics; Block code; Mathematical analysis; Computer science; Decoding methods","authors":[{"name":"Amina Bellil","is_ca":false},{"name":"Kenza Guenda","is_ca":false},{"name":"Nuh Aydın","is_ca":false},{"name":"Peihan Liu","is_ca":false},{"name":"T. Aaron Gulliver","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04000628969610894,"gpt":0.3311027037327874,"spread":0.2910964140366785,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002812122,0.0002988632,0.000253096,0.0008793825,0.0006601951,0.001086941,0.000323184,0.0003393388,0.003827102],"category_scores_gemma":[0.001063175,0.0001914322,0.0003904136,0.0005854961,0.001748885,0.001994883,0.0008622996,0.001029739,0.0004487059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006275073,"about_ca_system_score_gemma":0.0003804209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004547249,"about_ca_topic_score_gemma":0.0005181822,"domain_scores_codex":[0.9996428,0.00005135081,0.00002119846,0.00009046656,0.00009942878,0.00009467062],"domain_scores_gemma":[0.9991709,0.0002330006,0.000212256,0.0001328677,0.0001301653,0.0001208145],"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.0001676057,0.00002689181,0.001167234,0.00006811794,0.000006473188,0.0004130352,0.0006401887,0.003345389,0.01373499,0.9641359,0.0004912573,0.01580283],"study_design_scores_gemma":[0.0000496071,0.0003370334,0.003641766,0.00007448556,0.0000384569,0.001956816,0.0006681308,0.03585473,0.04316185,0.8936888,0.02042988,0.00009839598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8774175,0.0006643878,0.09132607,0.0003925653,0.0001131891,0.00003745329,0.0002162166,0.0001230806,0.02970951],"genre_scores_gemma":[0.9738999,0.0003537106,0.01600423,0.00008690458,0.00009813677,0.00002995355,0.0001722817,0.00005846785,0.009296375],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003827102,"threshold_uncertainty_score":0.0128029,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2011320741","doi":"10.3934/amc.2011.5.589","title":"The merit factor of binary arrays derived from the quadratic character","year":2011,"lang":"en","type":"preprint","venue":"Advances in Mathematics of Communications","topic":"Product Development and Customization","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Binary number; Row; Mathematics; Quadratic equation; Character (mathematics); Figure of merit; Combinatorics; Pure mathematics; Physics; Arithmetic; Geometry; Computer science","authors":[{"name":"Kai‐Uwe Schmidt","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04358549182562847,"gpt":0.2736177343553822,"spread":0.2300322425297537,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006892962,0.0004185169,0.000354582,0.001339789,0.0004649941,0.0009203996,0.0003195736,0.0005392267,0.004072344],"category_scores_gemma":[0.006141453,0.0001663948,0.0003303652,0.0009564665,0.000992929,0.001311524,0.0005780245,0.0006418662,0.0008133399],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006190882,"about_ca_system_score_gemma":0.0003032239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002994796,"about_ca_topic_score_gemma":0.0002641696,"domain_scores_codex":[0.9994424,0.0001427976,0.0000218411,0.00005841516,0.0002372726,0.00009738352],"domain_scores_gemma":[0.9978024,0.001094754,0.0003590894,0.0002578086,0.000373936,0.0001119166],"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.0004627616,0.0000571615,0.002810158,0.000231386,0.0000284313,0.0004196087,0.0003207702,0.05821266,0.04554436,0.8185151,0.002734529,0.07066309],"study_design_scores_gemma":[0.00004761206,0.0003231512,0.005023808,0.00007895136,0.00003560725,0.001368822,0.0002437997,0.442549,0.04163819,0.4981054,0.01045538,0.0001303339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.753058,0.0008977129,0.1884691,0.0004064843,0.0001536503,0.00003557729,0.0001589842,0.0002854304,0.05653495],"genre_scores_gemma":[0.971256,0.0004265216,0.0229408,0.00008912974,0.0001031015,0.0000556708,0.0002035922,0.0001161865,0.004808996],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004072344,"threshold_uncertainty_score":0.01362336,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}