{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005360453,0.0001361955,0.0003625376,0.0001226666,0.0001561377,0.00001079164,0.001250329,0.00007427182,0.00002200597],"category_scores_gemma":[0.0006959185,0.0001205332,0.00008353555,0.0002838393,0.000267113,0.0002275701,0.0001987562,0.0002209344,0.000002030621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002328471,"about_ca_system_score_gemma":0.00001872432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001569873,"about_ca_topic_score_gemma":0.00001638504,"domain_scores_codex":[0.9988029,0.00009856663,0.0006063935,0.0001107296,0.000212732,0.0001686785],"domain_scores_gemma":[0.9961045,0.001656029,0.0002913305,0.001807245,0.0001060999,0.00003477823],"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.000006020809,0.000394661,0.0001431481,0.00006488595,0.000008709065,3.017017e-7,0.001816324,0.000009544981,0.0001079051,0.995028,0.00005039099,0.002370139],"study_design_scores_gemma":[0.0003410454,0.00005434698,0.0001591717,0.0001323027,0.00001908778,0.000003331524,0.0004131655,0.0004180931,0.0005061643,0.9958242,0.002004678,0.0001243799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2559713,0.01432222,0.01657238,0.002186832,0.0009098747,0.001613038,0.00005909923,0.0003611478,0.7080041],"genre_scores_gemma":[0.834378,0.001651326,0.163858,0.00003056786,0.00001725117,0.00001312921,0.00000382097,0.00001113967,0.00003675069],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7079673,"threshold_uncertainty_score":0.4915202,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009363141,0.0001067102,0.0002167397,0.0001220734,0.0001945075,0.00003920015,0.003056649,0.00003719001,0.000003178001],"category_scores_gemma":[0.0001757466,0.000105022,0.00004983798,0.0003965921,0.0001275202,0.001510201,0.0004769869,0.0001242388,0.000002237305],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003018254,"about_ca_system_score_gemma":0.00002378902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.550894e-7,"about_ca_topic_score_gemma":0.00002306896,"domain_scores_codex":[0.9990181,0.0001184357,0.0004151988,0.000119359,0.0001127631,0.0002160986],"domain_scores_gemma":[0.9959603,0.0009500464,0.0002102363,0.002684998,0.0001319555,0.00006247167],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[9.548567e-7,0.0005543876,0.0006181058,0.00004634997,0.000006099172,7.25799e-9,0.003086102,0.0003439181,0.0005224597,0.966573,0.00001665414,0.02823195],"study_design_scores_gemma":[0.0004053505,0.00005867202,0.0004362344,0.0001328331,0.00001369256,0.00000468924,0.0008378354,0.8998519,0.00179263,0.08813725,0.008027208,0.0003017495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001258018,0.01133213,0.9748901,0.0002085963,0.00004034642,0.0003394297,0.000003341786,0.00006389579,0.0118642],"genre_scores_gemma":[0.4738455,0.003503738,0.5224864,0.00002747225,0.00000839996,0.0001018258,0.00001142119,0.000005904253,0.000009213919],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8995079,"threshold_uncertainty_score":0.5680065,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007835311,0.00008032865,0.0002558756,0.0002844876,0.00005715464,0.000009889511,0.002425453,0.00004043947,0.000009468916],"category_scores_gemma":[0.0003547875,0.0000776516,0.00008562453,0.0008631944,0.0004466114,0.0001408382,0.0005391563,0.0001811582,8.763138e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005256286,"about_ca_system_score_gemma":0.00002806561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004676786,"about_ca_topic_score_gemma":0.0000855943,"domain_scores_codex":[0.9990177,0.00006087403,0.0005383635,0.0001011521,0.0001742797,0.0001075927],"domain_scores_gemma":[0.9957193,0.001612495,0.0004391843,0.002059361,0.0001439352,0.00002575614],"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.000001768936,0.0004108093,0.0007354621,0.0001269649,0.000008405157,6.212584e-8,0.001391191,0.0004187527,0.009084174,0.9830107,0.000001693196,0.004810004],"study_design_scores_gemma":[0.0002988712,0.00007514286,0.000455327,0.0003983818,0.00001741516,0.000004270005,0.0005835402,0.1314763,0.02688958,0.8387066,0.000923497,0.0001711625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6503437,0.002198948,0.3294705,0.0002889379,0.0001406275,0.0002335329,0.00001724085,0.00004585962,0.01726062],"genre_scores_gemma":[0.6574439,0.0001859009,0.3423487,0.00000494289,0.000001781089,0.000007656047,9.380488e-7,0.000003297112,0.000002973069],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1443042,"threshold_uncertainty_score":0.4507135,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000295213,0.0000483024,0.0001316145,0.00003796959,0.00003976075,0.000002345705,0.0003214214,0.00002178141,0.000004301136],"category_scores_gemma":[0.00008756485,0.0000377239,0.00001588905,0.0001415477,0.0002773435,0.000123251,0.00003114971,0.00005420737,5.651995e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003355905,"about_ca_system_score_gemma":0.000007319897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004482077,"about_ca_topic_score_gemma":0.00007787524,"domain_scores_codex":[0.9994656,0.00004749584,0.0003495283,0.00002879727,0.00005867082,0.00004987534],"domain_scores_gemma":[0.9988689,0.0004393251,0.0001389089,0.0004600585,0.00008359015,0.000009163596],"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.000003390333,0.00006396413,0.0002053294,0.0003604384,0.00002590861,3.386415e-8,0.009835535,0.0007295018,0.008677888,0.9787295,0.000002892218,0.001365656],"study_design_scores_gemma":[0.0003380377,0.00008002758,0.0002622137,0.000710328,0.00004441683,0.000006382241,0.01234602,0.03926498,0.1235014,0.8221896,0.001067234,0.0001893428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7259956,0.1157549,0.03086638,0.000147095,0.0002358984,0.00113218,0.00006906388,0.00008349476,0.1257153],"genre_scores_gemma":[0.9771792,0.008542936,0.01424449,8.678995e-7,0.000001029709,0.00001755273,0.000001378044,0.000004857295,0.000007673876],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2511836,"threshold_uncertainty_score":0.1538336,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001615259,0.00006609646,0.0001221904,0.0001171472,0.00008627801,0.000009831794,0.0006271231,0.00003522133,0.000009857537],"category_scores_gemma":[0.00004801938,0.00005863987,0.00003482258,0.0003875576,0.0001499061,0.0005425182,0.0002166586,0.00009695778,7.614188e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005275352,"about_ca_system_score_gemma":0.000009532017,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002510566,"about_ca_topic_score_gemma":0.00002878878,"domain_scores_codex":[0.9994834,0.0000475407,0.0002493389,0.0000686118,0.00006404102,0.00008708469],"domain_scores_gemma":[0.9979035,0.0008340291,0.0001688665,0.001013843,0.00005420213,0.00002554353],"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":[9.862304e-7,0.0001817526,0.001342907,0.00006795416,0.000009366322,4.861303e-9,0.004750679,0.0003525769,0.0007912589,0.9778919,0.000004711383,0.0146059],"study_design_scores_gemma":[0.0001426608,0.00002660502,0.00162181,0.0000547432,0.00001176814,0.000002682883,0.0007836935,0.01589155,0.001244261,0.9762885,0.003823986,0.0001077555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02712804,0.004433224,0.9643027,0.0001819198,0.00003465608,0.0001849437,0.00002643724,0.00002698797,0.003681082],"genre_scores_gemma":[0.8914382,0.0004913901,0.1080042,0.00001836637,0.000005942274,0.00002539018,0.000006978062,0.000003357245,0.000006233499],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8643101,"threshold_uncertainty_score":0.2391265,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003913759,0.00007863746,0.0001511951,0.0001477418,0.0001180177,0.00002388429,0.002684836,0.00002589242,0.00002316255],"category_scores_gemma":[0.00006397811,0.0000743328,0.00004828766,0.0005829535,0.000423432,0.0004609321,0.0005398932,0.00009881599,0.00002649237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001022366,"about_ca_system_score_gemma":0.00001791337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002360518,"about_ca_topic_score_gemma":0.0000994207,"domain_scores_codex":[0.9992712,0.00006655377,0.0002939607,0.000113254,0.0001197758,0.0001352516],"domain_scores_gemma":[0.9970444,0.0004732713,0.0001495501,0.002245163,0.00006176314,0.00002586982],"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.000001185532,0.0001592907,0.0002490652,0.0000189878,0.000005004993,1.500643e-7,0.001149985,0.000004910062,0.0001185161,0.9921764,0.00002206654,0.006094462],"study_design_scores_gemma":[0.00009520363,0.00005058671,0.0001089546,0.00008058151,0.000003498398,0.000003114797,0.00008734952,0.006991395,0.002059553,0.9755437,0.01489185,0.00008419505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004333441,0.003273421,0.8606154,0.001710731,0.0001478049,0.0001702561,0.000004759708,0.0001166365,0.1296276],"genre_scores_gemma":[0.5974721,0.001027953,0.4014167,0.00003029275,0.00001104008,0.00001226902,0.000001095259,0.00000409391,0.00002449214],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5931386,"threshold_uncertainty_score":0.4989138,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003747374,0.00007788913,0.0002076543,0.00011904,0.00004028518,0.00002103366,0.001683205,0.00004252204,0.00002624774],"category_scores_gemma":[0.0003705032,0.00008413107,0.00005376814,0.0003459532,0.0002195531,0.0003677061,0.0003019798,0.0001650289,0.00002064773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002695437,"about_ca_system_score_gemma":0.00004169009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005375098,"about_ca_topic_score_gemma":0.000007615157,"domain_scores_codex":[0.9990426,0.00007945512,0.0003717894,0.000168995,0.0002134186,0.0001237442],"domain_scores_gemma":[0.9962076,0.001583349,0.0001881228,0.001871106,0.000130691,0.00001913527],"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.000002054865,0.0004090932,0.0002331852,0.0001106202,0.000006836564,1.151535e-7,0.01337706,0.0002281285,0.0002998941,0.982984,0.000007411956,0.002341607],"study_design_scores_gemma":[0.000845624,0.0003375989,0.001330925,0.001310406,0.00001796947,0.000006781737,0.01706499,0.1542057,0.004858367,0.8020216,0.01749937,0.0005006624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2084634,0.02094985,0.1526141,0.006958826,0.0006341874,0.002380341,0.00003857561,0.0003863451,0.6075743],"genre_scores_gemma":[0.8329687,0.0006585355,0.1662774,0.0000345259,0.000004484813,0.00001359531,8.702362e-7,0.000006672738,0.00003517056],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6245053,"threshold_uncertainty_score":0.3430766,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003179246,0.0001117273,0.0002970591,0.0001071956,0.00004295594,0.00000602095,0.002312958,0.00004558596,0.000005666616],"category_scores_gemma":[0.001477508,0.0001184229,0.00007326379,0.0004889289,0.0001766132,0.0002045768,0.000446749,0.0002077001,5.27056e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002049682,"about_ca_system_score_gemma":0.00004188423,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002557385,"about_ca_topic_score_gemma":0.00008857127,"domain_scores_codex":[0.9987754,0.0001161689,0.0006622071,0.0001605669,0.0001821188,0.0001035548],"domain_scores_gemma":[0.9920767,0.005135367,0.0006730772,0.001930892,0.0001544979,0.0000294647],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001938187,0.004968377,0.02056587,0.004533509,0.0002053414,0.000003123024,0.07314893,0.02406636,0.04705163,0.6603606,0.0002871228,0.1646153],"study_design_scores_gemma":[0.0006845496,0.0005099226,0.0003733898,0.00102631,0.00002233378,0.000001480175,0.001402622,0.7537088,0.1159251,0.1259561,0.0001632553,0.0002261723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01301592,0.0003032377,0.9789128,0.002731049,0.00003187556,0.0004713505,0.00002791513,0.000108821,0.004396984],"genre_scores_gemma":[0.4901847,0.0001402081,0.5095533,0.00008706779,0.00000147264,0.00002609645,0.000002282118,0.000004375974,5.666441e-7],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7296424,"threshold_uncertainty_score":0.4829147,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001308208,0.00006338035,0.0001403748,0.00009695973,0.0001489784,0.00001345924,0.002800877,0.00002173249,0.000002558822],"category_scores_gemma":[0.000125547,0.00004993844,0.00006292333,0.000525496,0.0006355662,0.0002248714,0.000426264,0.0001156982,0.000001857231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001029354,"about_ca_system_score_gemma":0.0000168466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003710303,"about_ca_topic_score_gemma":0.0001801732,"domain_scores_codex":[0.999118,0.00006837324,0.0004572437,0.00007243329,0.0001548655,0.0001291051],"domain_scores_gemma":[0.9956398,0.001905476,0.0002712218,0.002070413,0.00009051174,0.00002254946],"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.000001458969,0.0002277338,0.0009186734,0.00002049788,0.000003880015,1.019922e-7,0.0007490092,0.00001081698,0.0001806885,0.9815454,0.000002016908,0.01633966],"study_design_scores_gemma":[0.0001214251,0.00004261824,0.003232935,0.000082788,0.000009664539,0.000003466367,0.0003925822,0.002486751,0.001519621,0.9900814,0.00195322,0.00007353651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06361873,0.009211714,0.8846748,0.0006011644,0.0001601481,0.0004985247,0.000006851518,0.0000765464,0.04115149],"genre_scores_gemma":[0.7614536,0.0006979717,0.2378149,0.000007219048,0.000001951885,0.00001212176,7.871189e-7,0.000002878391,0.000008538453],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6978349,"threshold_uncertainty_score":0.5204774,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001057732,0.0001368587,0.0002361847,0.0001087417,0.0001368039,0.00003164987,0.0005282239,0.00003897974,0.0003718444],"category_scores_gemma":[0.00004420599,0.0001468358,0.00003932951,0.0001805477,0.000327372,0.0004715536,0.0001534938,0.0001799836,0.00004373464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000599669,"about_ca_system_score_gemma":0.0000155318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001273722,"about_ca_topic_score_gemma":0.0001782045,"domain_scores_codex":[0.9990879,0.00004830653,0.0004738515,0.0001118747,0.0001268163,0.0001513097],"domain_scores_gemma":[0.9984745,0.0002434279,0.00009732563,0.001075209,0.00005606778,0.00005346285],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003949611,0.003352407,0.05943877,0.00420407,0.001611591,0.000006676986,0.1209539,0.173179,0.2675071,0.1865283,0.02270331,0.1604754],"study_design_scores_gemma":[0.002463915,0.00011901,0.01241078,0.00104609,0.0001775687,0.00004330855,0.03146505,0.4896769,0.002417269,0.3228844,0.1358459,0.001449771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9391329,0.02686052,0.01332118,0.001417621,0.0003205736,0.001016103,0.0003020087,0.0003350376,0.01729409],"genre_scores_gemma":[0.8358298,0.005740954,0.1579918,0.00001998306,0.00001571261,0.0002130467,0.00009872206,0.00002386601,0.00006612043],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3164979,"threshold_uncertainty_score":0.598779,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001450572,0.0001201548,0.000271011,0.0001804493,0.00004254512,0.000009746214,0.0005250884,0.00004056478,0.00002538412],"category_scores_gemma":[0.00007056304,0.0001138348,0.0000360421,0.0004471712,0.0002036652,0.0003164087,0.00003487113,0.0001242641,0.000004344861],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004253824,"about_ca_system_score_gemma":0.00002609347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003219668,"about_ca_topic_score_gemma":0.00002421803,"domain_scores_codex":[0.9990852,0.00003598768,0.0005007614,0.00008581332,0.0001721934,0.000119995],"domain_scores_gemma":[0.9985452,0.0001398029,0.0001652289,0.0009936232,0.0001199907,0.00003610172],"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.0000243595,0.0004386794,0.0003387064,0.0003726522,0.00007230111,9.283068e-7,0.006680517,0.4777998,0.05105483,0.4578457,0.00009442626,0.005277127],"study_design_scores_gemma":[0.004360231,0.001072796,0.003757417,0.004523365,0.0001865315,0.0002316713,0.009794525,0.2079669,0.2565625,0.4939002,0.0154718,0.00217203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7582935,0.006129229,0.1568107,0.001392043,0.0003107414,0.001318014,0.00005681565,0.0003688972,0.07532003],"genre_scores_gemma":[0.6994452,0.00117958,0.2992971,0.00001069333,0.000004931718,0.00002567148,0.000005337108,0.00001031329,0.00002112389],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2698329,"threshold_uncertainty_score":0.4642049,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007416293,0.000126662,0.0002553909,0.0003172809,0.0001337212,0.0000501271,0.002514113,0.00005897261,0.000008908163],"category_scores_gemma":[0.0004421766,0.0001266561,0.00006989317,0.0009428879,0.0004359635,0.0004354247,0.0009318578,0.0002911059,0.000005543934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001219717,"about_ca_system_score_gemma":0.00001941153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001389607,"about_ca_topic_score_gemma":0.0007303304,"domain_scores_codex":[0.9987228,0.0001112776,0.0006087407,0.0001930104,0.0001425203,0.0002216445],"domain_scores_gemma":[0.9960174,0.001841225,0.0002790414,0.001720113,0.0001055024,0.00003672057],"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.000005669015,0.0002444642,0.008634868,0.00007651156,0.00000911546,0.000001536917,0.003287955,0.0001406885,0.0001092645,0.9602681,0.000002293378,0.02721952],"study_design_scores_gemma":[0.0002312653,0.00009704522,0.004336077,0.0006438044,0.000004872166,0.00000384602,0.0001525756,0.2751528,0.0001172496,0.7185871,0.000499104,0.0001742797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03220058,0.0004728745,0.9584597,0.0005120028,0.00009690195,0.0001588667,0.000003098195,0.00006691082,0.008029025],"genre_scores_gemma":[0.6632796,0.0001669681,0.3364844,0.000038372,0.00001194478,0.000009147286,0.000002177905,0.000005319042,0.000002075006],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.631079,"threshold_uncertainty_score":0.5164884,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002092996,0.00006303244,0.0001525543,0.00009324429,0.0002931175,0.00004785565,0.002846261,0.00002672488,0.000009392877],"category_scores_gemma":[0.0002426593,0.0000605996,0.00005104813,0.0001547523,0.0002542117,0.0007433903,0.0006124067,0.0001113431,0.000001006846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005530229,"about_ca_system_score_gemma":0.00001525754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004489301,"about_ca_topic_score_gemma":0.00007170784,"domain_scores_codex":[0.9993704,0.00004338799,0.0003152475,0.00008747456,0.000102457,0.00008102912],"domain_scores_gemma":[0.9957787,0.0003625027,0.0004362802,0.003321384,0.00008402032,0.00001707379],"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":[9.507678e-7,0.0001033803,0.0006775246,0.00005340456,0.000007308883,8.501698e-8,0.001650723,0.0002850288,0.002334939,0.986186,0.000007350562,0.008693302],"study_design_scores_gemma":[0.0001373337,0.00002747386,0.0005780025,0.0001737589,0.000005968557,0.000002343003,0.0002385214,0.01568108,0.002491854,0.9792231,0.001358252,0.00008225601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1211597,0.004073122,0.7667941,0.001690121,0.0003175004,0.000395505,0.00005478531,0.0001011369,0.105414],"genre_scores_gemma":[0.7019414,0.0001711042,0.2978559,0.000005285213,0.000003390417,0.000004136449,0.000001531905,0.000002684273,0.00001454348],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5807817,"threshold_uncertainty_score":0.5289109,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002479989,0.0000812268,0.0002366704,0.0001795254,0.00007467987,0.00001909499,0.001002689,0.00002877529,0.000001102839],"category_scores_gemma":[0.0002541256,0.00007707687,0.00003733699,0.0007049271,0.0002030479,0.0002333981,0.0005642118,0.0001098185,0.000002334564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007313608,"about_ca_system_score_gemma":0.00003651805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005865833,"about_ca_topic_score_gemma":0.00006737719,"domain_scores_codex":[0.9991378,0.00008053211,0.0003835367,0.0001345726,0.000147007,0.0001165483],"domain_scores_gemma":[0.9970413,0.001610686,0.0002677107,0.0009889852,0.0000574323,0.00003389024],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000147596,0.0005906887,0.00181219,0.0004010071,0.00008284733,0.000003194318,0.04096055,0.02770567,0.004245444,0.6140025,0.001824555,0.3083566],"study_design_scores_gemma":[0.0002440178,0.00005065247,0.002014712,0.0002309124,0.000006788334,0.000004911709,0.0006986708,0.8111036,0.002015471,0.1824327,0.001093501,0.0001040829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4628305,0.00756974,0.516593,0.005982563,0.0002865123,0.0008073252,0.0001059534,0.0003978827,0.005426549],"genre_scores_gemma":[0.6810947,0.003741634,0.3150782,0.00001236548,0.00001126883,0.000009317951,0.0000156202,0.000006310077,0.00003061784],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7833979,"threshold_uncertainty_score":0.3143103,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001321409,0.0000750105,0.0001724273,0.0001532131,0.0001037221,0.00001468626,0.001903383,0.00002559828,0.00001006584],"category_scores_gemma":[0.0001425607,0.00005664198,0.00006348996,0.0006508671,0.0001794407,0.00020662,0.0002653685,0.0001202785,0.00000160068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001461268,"about_ca_system_score_gemma":0.0000211216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003393901,"about_ca_topic_score_gemma":0.0006764716,"domain_scores_codex":[0.998882,0.00009670643,0.0005868283,0.00008843329,0.0002179184,0.0001281056],"domain_scores_gemma":[0.9958817,0.001712775,0.0003325504,0.001935303,0.0001158551,0.00002181489],"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.000001322858,0.0002273868,0.0002045932,0.00003585744,0.000006319422,9.851274e-8,0.004227402,0.00003008184,0.0002066465,0.9940744,0.00002416155,0.0009617261],"study_design_scores_gemma":[0.0002468247,0.00004391736,0.0003049459,0.0001071657,0.000004903129,0.000001748285,0.001615269,0.01281787,0.002117068,0.9802621,0.002393432,0.0000847479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2613033,0.002839812,0.6979144,0.001971882,0.0001435618,0.0008407228,0.00002323471,0.00005498232,0.03490806],"genre_scores_gemma":[0.8732378,0.0006098329,0.1260836,0.0000372443,0.000003035411,0.00001883184,0.000002593397,0.000003526365,0.000003569153],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6119345,"threshold_uncertainty_score":0.3536991,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005991479,0.0001389534,0.0002779116,0.00007460773,0.0001857981,0.000006706272,0.002094273,0.00007669615,0.0000650689],"category_scores_gemma":[0.002716554,0.00008034115,0.0001079044,0.0006987906,0.0009606247,0.000145859,0.0004920481,0.0004092784,0.0000089599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000236756,"about_ca_system_score_gemma":0.00003264852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.16391e-7,"about_ca_topic_score_gemma":0.00009013421,"domain_scores_codex":[0.9987389,0.0001350811,0.0005480821,0.0001112542,0.0003081075,0.0001585163],"domain_scores_gemma":[0.9917434,0.004375504,0.0005393011,0.003101274,0.0002198507,0.00002062835],"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.000004593366,0.000363839,0.0001269669,0.0001165782,0.00001534937,4.075111e-8,0.001978707,0.00000898462,0.0003611655,0.9965389,0.0002154926,0.0002693259],"study_design_scores_gemma":[0.0001419929,0.00003861041,0.00006650581,0.0003868104,0.00001565937,0.000001175817,0.001025284,0.0008241285,0.006310605,0.9895689,0.0015352,0.00008506554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7880421,0.007319896,0.01153067,0.006986151,0.0003664686,0.002107101,0.0001036444,0.0001150108,0.183429],"genre_scores_gemma":[0.9442696,0.00045061,0.05500363,0.00009218498,0.00001768803,0.00003561199,0.000001372669,0.00001755315,0.0001117678],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1833172,"threshold_uncertainty_score":0.3891715,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003694126,0.0001621338,0.0002780885,0.0002425416,0.000148726,0.00005324839,0.003476458,0.00005480111,0.00001663262],"category_scores_gemma":[0.00032702,0.0001507719,0.00009290067,0.001538395,0.0001717399,0.0005779439,0.0004459868,0.0002247653,0.00003024509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002066712,"about_ca_system_score_gemma":0.00005064978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003922417,"about_ca_topic_score_gemma":0.00002222993,"domain_scores_codex":[0.9986666,0.0001510486,0.0004916867,0.0002254759,0.0002805503,0.0001846043],"domain_scores_gemma":[0.9956068,0.001947146,0.0003254006,0.001925832,0.0001165258,0.00007829277],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002334165,0.0005929954,0.002019408,0.0003026001,0.00001709509,0.000001783702,0.00285933,0.002695345,0.0004055994,0.9854977,0.0001633021,0.005421565],"study_design_scores_gemma":[0.0007097817,0.0003785106,0.0002560623,0.0004516992,0.00003077779,0.000002001932,0.0003544374,0.6584325,0.002125958,0.2931755,0.04361789,0.0004648029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02151405,0.03551359,0.8597016,0.0144247,0.0004986649,0.001343099,0.00005353673,0.0008822578,0.06606846],"genre_scores_gemma":[0.6695437,0.001844389,0.3282995,0.0002525668,0.0000132241,0.00002313915,0.000005545693,0.00001062002,0.000007324745],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6923221,"threshold_uncertainty_score":0.6460181,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004677333,0.0002771895,0.0004438028,0.0001535714,0.001014143,0.0002812351,0.003737017,0.00007386189,0.00002792856],"category_scores_gemma":[0.0002467281,0.0001935946,0.00008836904,0.0003220124,0.0008138673,0.0013779,0.0009615101,0.0002911702,0.000009927511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003337739,"about_ca_system_score_gemma":0.0001310379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000725885,"about_ca_topic_score_gemma":0.001688469,"domain_scores_codex":[0.998418,0.0001411293,0.0004445192,0.0003971827,0.0003044656,0.0002947493],"domain_scores_gemma":[0.994225,0.0009051447,0.0004934421,0.004109094,0.0001459124,0.0001213961],"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.0000637875,0.0007761478,0.01477912,0.0002586368,0.0001480773,0.000004629367,0.0112351,0.000161194,0.01635449,0.8466799,0.0001480341,0.1093909],"study_design_scores_gemma":[0.00269366,0.001225663,0.05204202,0.002982967,0.0002287984,0.00008914204,0.0009970107,0.08367741,0.002532052,0.8272712,0.02456528,0.001694799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3622189,0.01730352,0.5428477,0.002975757,0.0003713979,0.001484195,0.00009521272,0.0003840316,0.07231926],"genre_scores_gemma":[0.7985944,0.003292581,0.197585,0.00002369108,0.00002035754,0.00007979498,0.00001015566,0.00001506559,0.0003790002],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4363754,"threshold_uncertainty_score":0.789456,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004229177,0.00006637604,0.0001973251,0.000140781,0.00005274815,0.00001182062,0.001641086,0.0000363872,0.000002583013],"category_scores_gemma":[0.0005613734,0.00006092927,0.00004710867,0.0005484393,0.0001730977,0.0002694236,0.0003802465,0.00009934076,9.825786e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004077297,"about_ca_system_score_gemma":0.00001644849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000194604,"about_ca_topic_score_gemma":0.00005384417,"domain_scores_codex":[0.9992094,0.0000730956,0.0004143888,0.00008576432,0.0001196456,0.00009771191],"domain_scores_gemma":[0.9948855,0.003184718,0.0002741618,0.001573973,0.00006241442,0.0000192215],"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.000001095024,0.0003567588,0.00382617,0.0002237783,0.00001028379,1.312893e-7,0.001869441,0.002545699,0.0005611425,0.9454324,0.000009174824,0.04516399],"study_design_scores_gemma":[0.0003363474,0.00007724387,0.004635083,0.0004744975,0.00001214636,0.0000020854,0.000130408,0.1997221,0.003231802,0.7892314,0.001977176,0.0001697856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02701183,0.002998025,0.9391347,0.0004407881,0.00008454519,0.0001895922,0.000004255478,0.00004809914,0.03008814],"genre_scores_gemma":[0.602714,0.0002688397,0.3969837,0.00001464225,0.000002998211,0.000007309477,5.384639e-7,0.00000262562,0.000005379093],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5757021,"threshold_uncertainty_score":0.3049573,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009331371,0.0002931856,0.0006765083,0.0003900345,0.00009606483,0.00009930145,0.005806468,0.0001720313,0.000003537178],"category_scores_gemma":[0.0004277089,0.0002466554,0.0001079958,0.0006832788,0.0002907388,0.000357811,0.002797359,0.000725485,0.000005751851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005697088,"about_ca_system_score_gemma":0.0001728935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001200523,"about_ca_topic_score_gemma":0.00003984133,"domain_scores_codex":[0.9979659,0.0002709764,0.000752282,0.0003632848,0.0003947366,0.0002527757],"domain_scores_gemma":[0.9912221,0.001686836,0.000822488,0.005936141,0.0002503198,0.000082084],"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.000001822956,0.0002476431,0.0001539213,0.0004105779,0.00002514443,6.961291e-7,0.0007326956,0.002191948,0.000009546513,0.9760787,0.00003082488,0.02011649],"study_design_scores_gemma":[0.0001634229,0.00003766573,0.00003719768,0.0005779475,0.00002792633,0.000005037043,0.00002305515,0.3263482,0.0001318966,0.66959,0.002826551,0.0002310991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001643084,0.006462329,0.9764035,0.0006696515,0.000125103,0.0004339558,0.00001029744,0.00008748541,0.01564331],"genre_scores_gemma":[0.07848486,0.004863725,0.9163986,0.00003437078,0.00001354492,0.0001189265,0.00001092231,0.00002587698,0.00004914572],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3241562,"threshold_uncertainty_score":0.9999986,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001848337,0.00006096507,0.0001688727,0.0001182418,0.00003962704,0.00001310216,0.0008862526,0.00003142214,0.00001419565],"category_scores_gemma":[0.00007021788,0.00006004187,0.00003807748,0.0002626294,0.0001994615,0.0004797424,0.0003499848,0.00009884113,0.000002209311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003423545,"about_ca_system_score_gemma":0.00002663821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006443326,"about_ca_topic_score_gemma":0.00002881501,"domain_scores_codex":[0.9994375,0.00003818884,0.0002774834,0.00008672442,0.00008684395,0.00007326831],"domain_scores_gemma":[0.9975818,0.0009847848,0.0001656594,0.001207264,0.00003722454,0.00002323504],"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.000001301275,0.00006814613,0.001189019,0.00005223409,0.000007894615,3.211882e-8,0.001286166,0.0001732197,0.0001707999,0.99321,0.00001057184,0.003830601],"study_design_scores_gemma":[0.000218743,0.00004520243,0.0003321792,0.000133962,0.000006656755,0.000002527607,0.0002458926,0.01112893,0.000503804,0.9856814,0.001626651,0.00007402668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3623334,0.02139907,0.5818039,0.002466884,0.0004000205,0.0007245312,0.00004143732,0.0001320967,0.03069871],"genre_scores_gemma":[0.7351242,0.002176971,0.2626181,0.0000270868,0.000004101269,0.000004090878,0.000001243352,0.000002686862,0.00004152088],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3727908,"threshold_uncertainty_score":0.2448436,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005974363,0.00006146789,0.0001378292,0.00005599856,0.00027805,0.00003208089,0.004372907,0.00001804269,0.000004647055],"category_scores_gemma":[0.00009432998,0.00004447534,0.00004841741,0.0001087845,0.0003682168,0.0003810295,0.00054939,0.0001072475,0.000003128795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005713597,"about_ca_system_score_gemma":0.00001697606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003938841,"about_ca_topic_score_gemma":0.00001294726,"domain_scores_codex":[0.9994283,0.00004079528,0.0002412435,0.00007346387,0.0001319008,0.00008425483],"domain_scores_gemma":[0.9953197,0.0007392498,0.0003388363,0.003530627,0.00005920899,0.00001237935],"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.000004204082,0.0001368074,0.0003917328,0.00003682356,0.000006481602,5.450015e-8,0.0009830551,0.0006854282,0.0001880201,0.996009,0.0000044493,0.001553969],"study_design_scores_gemma":[0.0004464797,0.0001577642,0.001768054,0.0006989141,0.00001255265,0.000003808818,0.0003145834,0.1385386,0.01011505,0.8466424,0.001127779,0.0001740479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8755555,0.001453827,0.06998374,0.001864514,0.00009511465,0.0003791494,0.000008208179,0.00003884678,0.0506211],"genre_scores_gemma":[0.9270245,0.0009022352,0.0720202,0.00001131732,0.000002040961,0.00002314518,5.984095e-7,0.000002933632,0.00001301543],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1493666,"threshold_uncertainty_score":0.8126022,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042505,0.00008085253,0.0002391064,0.000170021,0.00004345276,0.000009697507,0.001722057,0.00003602161,0.00001404478],"category_scores_gemma":[0.00007924564,0.00007912121,0.00007186012,0.0005252652,0.0002783398,0.0004609518,0.0003698608,0.000112461,0.0000101777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008894055,"about_ca_system_score_gemma":0.00002403033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003622881,"about_ca_topic_score_gemma":0.00001415612,"domain_scores_codex":[0.9991226,0.00008118855,0.000440964,0.0001092175,0.0001459753,0.0001000863],"domain_scores_gemma":[0.996837,0.0007490148,0.0003247475,0.001969178,0.0001002806,0.00001979992],"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.000002307818,0.0001653322,0.001547878,0.0001082826,0.000008813477,5.000605e-8,0.00106724,0.0001911841,0.001278645,0.9904596,0.000001816744,0.005168823],"study_design_scores_gemma":[0.0002700966,0.00006950858,0.0002879551,0.0002897894,0.000009330579,0.000006618569,0.0006070347,0.03222117,0.003662806,0.9601951,0.002254472,0.0001261271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.30367,0.003938435,0.6307361,0.0005744168,0.0002428276,0.0005770744,0.00002089378,0.000132171,0.06010807],"genre_scores_gemma":[0.5552992,0.0009200451,0.443745,0.000007587274,0.000001979826,0.000009265365,0.000001888717,0.00000342937,0.00001159751],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.2516293,"threshold_uncertainty_score":0.3226469,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007993217,0.00008013456,0.0001204765,0.0003042958,0.0001140335,0.00005985267,0.002128789,0.00002737385,8.989192e-7],"category_scores_gemma":[0.0005810906,0.00006040631,0.0000586912,0.0008882894,0.00006810025,0.0003752592,0.0004011994,0.0001569413,0.000004381504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003967922,"about_ca_system_score_gemma":0.00002431014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002186301,"about_ca_topic_score_gemma":0.00001197748,"domain_scores_codex":[0.9992997,0.00005615899,0.0002835561,0.0001281951,0.0001181955,0.0001141941],"domain_scores_gemma":[0.9937805,0.004477923,0.00009296486,0.001571343,0.00006460937,0.00001267167],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[6.425113e-7,0.00008429749,0.000003474724,0.0001350034,0.000003978747,2.381655e-7,0.001708483,0.00006883447,0.0001976362,0.9807554,0.0001101467,0.01693186],"study_design_scores_gemma":[0.00002504307,0.0000572829,0.000006026162,0.0005953091,0.000003656085,0.000002760569,0.0001561649,0.5159657,0.001113869,0.4793691,0.002643567,0.00006155518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001469407,0.009929545,0.9708924,0.005151059,0.0002132113,0.0005601146,0.000004601796,0.0003340162,0.01144563],"genre_scores_gemma":[0.6085568,0.001697663,0.3894528,0.00004706488,0.000006096469,0.0002003646,0.000001036272,0.000008799378,0.00002940841],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6070874,"threshold_uncertainty_score":0.3955856,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002923143,0.00006456672,0.0001432283,0.00007930013,0.00005128251,0.000009948254,0.0009502808,0.0000250548,0.0000057337],"category_scores_gemma":[0.0001876971,0.00006824463,0.00004818268,0.0006403591,0.00009328176,0.0002294968,0.000242291,0.0001324589,0.000001857253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001919626,"about_ca_system_score_gemma":0.00003152211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000397638,"about_ca_topic_score_gemma":0.0000505139,"domain_scores_codex":[0.9992806,0.00008140989,0.0003402832,0.00009525553,0.0001029288,0.00009958017],"domain_scores_gemma":[0.9985723,0.0005150644,0.000146133,0.0006965876,0.00003913767,0.00003072785],"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.000005408244,0.0001924342,0.001437773,0.00005206899,0.000004382852,2.519739e-7,0.001297866,0.006621064,0.0007939914,0.9868594,0.00001411041,0.002721208],"study_design_scores_gemma":[0.0004140208,0.0001693104,0.002476178,0.0002944061,0.000008842207,0.000002627171,0.0004487617,0.1820308,0.003559697,0.8090248,0.00138836,0.0001822772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2132312,0.0006448277,0.7835328,0.0006479299,0.00002905909,0.0001106229,0.00002720919,0.00003096953,0.00174537],"genre_scores_gemma":[0.9046171,0.0002074781,0.09510026,0.00003470236,0.000003833149,0.00001925143,0.00001284631,0.000003320231,0.000001196886],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6913859,"threshold_uncertainty_score":0.2782935,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007651615,0.00009853065,0.0002220933,0.0004211266,0.00004126903,0.00003835852,0.00211344,0.00003809517,0.000004857116],"category_scores_gemma":[0.00006472752,0.00008889027,0.00006320119,0.0008882897,0.0001973473,0.0009096257,0.00013874,0.0001590659,0.000003089943],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002227742,"about_ca_system_score_gemma":0.00005568131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006736333,"about_ca_topic_score_gemma":0.0000902649,"domain_scores_codex":[0.9988708,0.0001888689,0.0004750153,0.0001576679,0.0001897293,0.0001178621],"domain_scores_gemma":[0.9964663,0.001530192,0.0001359463,0.001798624,0.00004488897,0.00002407751],"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.00000226972,0.0003291744,0.0003427789,0.0002965766,0.000004317742,8.719276e-7,0.001447276,0.002459629,0.0005729327,0.991079,0.000002775878,0.003462372],"study_design_scores_gemma":[0.00009647939,0.0001080786,0.0001159484,0.001134257,0.000004831144,0.000001095927,0.0004812599,0.2670836,0.001234308,0.7291281,0.000512927,0.00009911518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1826052,0.02900809,0.7515184,0.002872474,0.0006600054,0.00107142,0.00005215725,0.0004472255,0.03176498],"genre_scores_gemma":[0.8615847,0.0006131603,0.1377273,0.00002235889,0.000004600175,0.00003575428,0.000002866697,0.000005983785,0.000003273266],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6789795,"threshold_uncertainty_score":0.3927332,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000351772,0.00007631237,0.0001756077,0.0003807285,0.00006241994,0.00002103973,0.00231545,0.00002425567,0.00001631017],"category_scores_gemma":[0.0002429976,0.00007270003,0.00005697333,0.001691301,0.0001286456,0.0005024968,0.0005445615,0.00007064608,0.00001448851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001032866,"about_ca_system_score_gemma":0.00001716073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001493026,"about_ca_topic_score_gemma":0.00002099752,"domain_scores_codex":[0.9991592,0.00007689444,0.0004067979,0.0001021017,0.0001415196,0.0001134581],"domain_scores_gemma":[0.9969893,0.0007402301,0.0001878553,0.00187301,0.0001717675,0.0000379125],"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":[3.552751e-7,0.0001803417,0.0005466927,0.00003370911,0.000005617899,2.379848e-8,0.001370935,0.0004141252,0.0003054299,0.9846029,0.00003445759,0.01250536],"study_design_scores_gemma":[0.00010766,0.00004934622,0.0008247141,0.0001234313,0.00000535333,0.000001029886,0.0002458965,0.01714006,0.00214396,0.9772357,0.002013341,0.0001094739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01832076,0.001897736,0.9465746,0.0009167795,0.00005282061,0.0003769041,0.000004345954,0.00005816431,0.03179791],"genre_scores_gemma":[0.5904018,0.0004366181,0.4090602,0.00003227935,0.000001668641,0.00004630774,0.000001255286,0.000003870245,0.00001594393],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5720811,"threshold_uncertainty_score":0.4302721,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002145404,0.00006879373,0.0001678839,0.00007076785,0.00005690392,0.000008067829,0.00183881,0.00003268733,0.00000718772],"category_scores_gemma":[0.0002325899,0.00005377723,0.00005452695,0.0003791341,0.0003944989,0.000489165,0.0003489233,0.0001151186,0.000002754097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005701246,"about_ca_system_score_gemma":0.00001710049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006764139,"about_ca_topic_score_gemma":0.00003682647,"domain_scores_codex":[0.999222,0.0001169019,0.0004009205,0.00008478772,0.0001081602,0.00006726215],"domain_scores_gemma":[0.9938458,0.003981739,0.0004460297,0.001571401,0.0001427862,0.00001225945],"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.000008728498,0.0005778119,0.00845334,0.0001212535,0.00005262276,9.76849e-8,0.04458991,0.004172865,0.03013713,0.8836353,0.00001156249,0.0282394],"study_design_scores_gemma":[0.0002275689,0.00007342967,0.02533349,0.0004511314,0.0000151573,4.2397e-7,0.002937953,0.2242617,0.006551926,0.7399167,0.0001022468,0.0001282066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5072752,0.002219477,0.4866481,0.001215174,0.000059021,0.0004985975,0.00002897481,0.00003166078,0.00202374],"genre_scores_gemma":[0.8558857,0.001599737,0.1424319,0.00002394849,0.000001589964,0.00004411912,0.000007159048,0.000002656985,0.000003141075],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3486105,"threshold_uncertainty_score":0.3416997,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.003552585,0.0009365394,0.001473057,0.001045403,0.001891957,0.0004076188,0.006275423,0.0002641912,0.00009382334],"category_scores_gemma":[0.0005564098,0.001001006,0.0006060119,0.002187256,0.001101839,0.002322664,0.004596369,0.0009782759,0.00001136721],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002839351,"about_ca_system_score_gemma":0.000352589,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004335893,"about_ca_topic_score_gemma":0.00029418,"domain_scores_codex":[0.9935342,0.0006384676,0.002288524,0.00123805,0.00106901,0.001231745],"domain_scores_gemma":[0.9878386,0.003929342,0.001466972,0.005961696,0.0004253597,0.000378025],"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.0001251963,0.003792098,0.0009296654,0.001036258,0.0002466429,0.00001327258,0.01125638,0.0006204323,0.002335676,0.9728254,0.002213732,0.004605242],"study_design_scores_gemma":[0.00423301,0.00121553,0.0004958943,0.0004405478,0.0002849038,0.0002290749,0.003756587,0.1875505,0.00066919,0.6620145,0.1369599,0.002150337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2829517,0.04864464,0.617821,0.008306698,0.003508617,0.01071442,0.001982081,0.003905203,0.02216564],"genre_scores_gemma":[0.5982219,0.003660948,0.3942929,0.0006537161,0.0001022384,0.002163374,0.0001575568,0.0001736024,0.000573814],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3152702,"threshold_uncertainty_score":0.9994075,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006226141,0.0001731716,0.0003583547,0.0002938363,0.0001905755,0.00006740272,0.001251772,0.00006490319,0.000006909594],"category_scores_gemma":[0.0002330002,0.0001690057,0.00005753289,0.0009470367,0.0005223732,0.0007274487,0.0008074064,0.0001747901,0.00001082756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001185006,"about_ca_system_score_gemma":0.00004025052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002630038,"about_ca_topic_score_gemma":0.0001831208,"domain_scores_codex":[0.9987319,0.0001266724,0.0004786939,0.0002379865,0.000193329,0.0002314594],"domain_scores_gemma":[0.9961635,0.001875484,0.000225242,0.001582735,0.00005969037,0.00009331825],"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.000005957559,0.0002348273,0.001615002,0.0001763295,0.00002620497,0.000002141877,0.004292148,0.00006576837,0.0007696699,0.980657,0.0001089063,0.01204609],"study_design_scores_gemma":[0.0009379391,0.0001417263,0.001836444,0.0005023121,0.0000351281,0.00002215678,0.001421151,0.09575779,0.0007580281,0.886297,0.01188836,0.000401994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6957533,0.0343218,0.2435307,0.003806891,0.0002792044,0.00129275,0.0001264695,0.001130877,0.01975798],"genre_scores_gemma":[0.7817125,0.01173383,0.206287,0.00007100032,0.00001190582,0.00003451209,0.00001746192,0.00001854999,0.0001133177],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09569202,"threshold_uncertainty_score":0.6891852,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004324045,0.0001818086,0.000331851,0.00008496471,0.0002093327,0.00006784018,0.002450416,0.00007923818,0.00004688981],"category_scores_gemma":[0.0004304545,0.0001167133,0.00008441101,0.0002337661,0.0003247956,0.0004963315,0.001484428,0.0003226861,0.00001943138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001744474,"about_ca_system_score_gemma":0.00004975645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001107447,"about_ca_topic_score_gemma":0.0003359671,"domain_scores_codex":[0.9987186,0.00004535368,0.000749766,0.000150858,0.0002066794,0.0001287098],"domain_scores_gemma":[0.9955612,0.0006823411,0.00131025,0.002203713,0.0002379914,0.000004469676],"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.0001750895,0.003270175,0.02794116,0.005694658,0.001027533,0.000001352726,0.04385062,0.001067409,0.01678888,0.860185,0.001617443,0.03838069],"study_design_scores_gemma":[0.0004004855,0.000007184339,0.02194695,0.001759671,0.000215502,2.506664e-7,0.002818463,0.008955686,0.001647247,0.9394961,0.02223336,0.0005191261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8231318,0.057003,0.01488498,0.02308633,0.002889,0.006463021,0.000183897,0.0003172887,0.07204071],"genre_scores_gemma":[0.9746639,0.007347018,0.01735692,0.0001153961,0.0001099411,0.0001207116,0.0001949861,0.00002896949,0.0000622113],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1515321,"threshold_uncertainty_score":0.4759428,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}