{"meta":{"query_hash":"13057bc43c56","filters":{"venue":"Advances in Mathematics of Communications"},"cohort_total":31,"direct_labels_cover":0,"predictions_cover":31,"exported":31,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/13057bc43c56","api":"https://metacan.xera.ac/api/v1/cohort?venue=Advances+in+Mathematics+of+Communications"},"results":[{"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.039815873919961234,"score_gpt":0.34066048356685463,"score_spread":0.3008446096468934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965279733","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8135696,0.0030606263,0.13392013,0.0036676307,0.0001479462,0.000046891215,0.00049983675,0.0005589318,0.04452849],"genre_scores_gemma":[0.9894571,0.00085593574,0.0060889735,0.00012140202,0.00019065643,0.000080695674,0.00021771115,0.00006701656,0.002920662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871886,0.00036384223,0.000053379154,0.00022711564,0.0004350819,0.00020187335],"domain_scores_gemma":[0.97761863,0.01657461,0.0018824106,0.0014155485,0.0015646073,0.0009443287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002148247,0.000535861,0.00084148895,0.0030843914,0.001042825,0.0023275432,0.0013100199,0.0010864902,0.0042111403],"category_scores_gemma":[0.036718026,0.00049590855,0.00051499193,0.0012457584,0.0032403942,0.0052137016,0.002003235,0.0019112625,0.00039862728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002232431,0.00008689161,0.005900563,0.00024966177,0.00007406061,0.00033086992,0.0003387615,0.06139886,0.0070611034,0.9065215,0.0025163193,0.015298233],"study_design_scores_gemma":[0.000029416091,0.00009060941,0.00419845,0.00010908952,0.000029508616,0.0005436238,0.000115224684,0.37445387,0.0028923382,0.6155723,0.0019053376,0.000060283575],"about_ca_topic_score_codex":0.00088255294,"about_ca_topic_score_gemma":0.00075784087,"teacher_disagreement_score":0.0042111403,"about_ca_system_score_codex":0.002502987,"about_ca_system_score_gemma":0.00080733857,"threshold_uncertainty_score":0.018160582},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.030275667235170986,"score_gpt":0.29019393864652504,"score_spread":0.25991827141135404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976832500","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5086446,0.0020856343,0.4609904,0.0006383379,0.00023777066,0.00012157574,0.00026942173,0.00053358765,0.026478635],"genre_scores_gemma":[0.9342532,0.0008024704,0.05941853,0.00021067857,0.00017224315,0.0001943151,0.00028307107,0.00009245582,0.0045730295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990489,0.00031817873,0.000047031994,0.000145677,0.00027838774,0.00016175107],"domain_scores_gemma":[0.99762934,0.0011258458,0.0004329191,0.00036464902,0.0002484661,0.00019884208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008568656,0.0004436306,0.0004667295,0.0010545086,0.0011081715,0.0008194693,0.00054184324,0.00057052827,0.0027814987],"category_scores_gemma":[0.0039422372,0.00036408208,0.0004398863,0.0007929089,0.00093911676,0.002191563,0.0011508606,0.0009984153,0.0004800148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004827048,0.00008910011,0.0025852623,0.00026188578,0.000026757523,0.00058632536,0.0005154939,0.017440101,0.040603578,0.8685876,0.0031779273,0.06564313],"study_design_scores_gemma":[0.00012915999,0.00065586256,0.0033159044,0.00017274369,0.000070344926,0.0038353696,0.00028343356,0.25125238,0.09551289,0.6087876,0.03575669,0.00022765926],"about_ca_topic_score_codex":0.00013273983,"about_ca_topic_score_gemma":0.00015555533,"teacher_disagreement_score":0.0027814987,"about_ca_system_score_codex":0.00082065124,"about_ca_system_score_gemma":0.0006155643,"threshold_uncertainty_score":0.00930506},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.025847021541919042,"score_gpt":0.3034912473268492,"score_spread":0.27764422578493014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980718426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37697288,0.0004804022,0.61187184,0.0016121481,0.00014139795,0.00015013899,0.00039630482,0.0020137825,0.0063612247],"genre_scores_gemma":[0.9197268,0.00018335815,0.076956406,0.00012789857,0.0001543652,0.00006507344,0.0004725666,0.00016187427,0.0021517358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99378806,0.0021018044,0.00021463893,0.00093792286,0.002072693,0.00088475895],"domain_scores_gemma":[0.943629,0.0392896,0.003688375,0.007897872,0.0035127637,0.0019823364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009719581,0.0009666589,0.0014820053,0.0021408154,0.0013417655,0.0022408916,0.0035125278,0.0014474059,0.005332142],"category_scores_gemma":[0.064630106,0.0005239812,0.0010108536,0.0015093402,0.0038316317,0.0063789356,0.0033757652,0.0029749589,0.000782187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005926111,0.000515385,0.03830343,0.00038616126,0.00018433566,0.00053563353,0.0004642556,0.26409507,0.037879195,0.43088078,0.008804319,0.21202536],"study_design_scores_gemma":[0.000120206525,0.00041084108,0.0028659815,0.000027630258,0.000027401806,0.00019349619,0.000083549465,0.82692105,0.02030276,0.1475982,0.0013787675,0.000070124675],"about_ca_topic_score_codex":0.0027553614,"about_ca_topic_score_gemma":0.0019133021,"teacher_disagreement_score":0.009719581,"about_ca_system_score_codex":0.0026432113,"about_ca_system_score_gemma":0.0023673072,"threshold_uncertainty_score":0.051402688},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03017044645058189,"score_gpt":0.2670171081107196,"score_spread":0.2368466616601377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001357342","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85233,0.0004385893,0.08622733,0.0005822943,0.00008839236,0.000053661424,0.0004148431,0.00042364633,0.05944122],"genre_scores_gemma":[0.9586024,0.00022851648,0.030015849,0.00009750082,0.000055259763,0.000048504415,0.00035577215,0.000058759848,0.010537403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995757,0.00007287749,0.000023057402,0.00006964027,0.00015080751,0.000107839565],"domain_scores_gemma":[0.9977188,0.00108289,0.0002472542,0.00041601015,0.00039709502,0.00013792579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003431786,0.0002480924,0.00040582073,0.0009525619,0.0008939889,0.0011675773,0.0003678595,0.0004087495,0.0037617558],"category_scores_gemma":[0.002930001,0.00021826434,0.0003445875,0.0009792248,0.0013518668,0.00079746713,0.0007593141,0.0008685287,0.00055534363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045480818,0.00010750028,0.01151482,0.00037202652,0.000029048158,0.0012448549,0.00082972675,0.063247636,0.03263136,0.75560427,0.008433591,0.1255305],"study_design_scores_gemma":[0.000057198144,0.0002189002,0.0055326954,0.000068041954,0.000035299432,0.0013544883,0.0005559718,0.15021999,0.029409664,0.7847897,0.027687067,0.00007096165],"about_ca_topic_score_codex":0.0008367614,"about_ca_topic_score_gemma":0.0010593281,"teacher_disagreement_score":0.0037617558,"about_ca_system_score_codex":0.0004690554,"about_ca_system_score_gemma":0.00067836564,"threshold_uncertainty_score":0.012584388},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015261916361586416,"score_gpt":0.30217363692952365,"score_spread":0.28691172056793723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009890571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13436083,0.00028167528,0.85512143,0.00055897527,0.00004114197,0.00013286048,0.00033311162,0.0004532971,0.008716586],"genre_scores_gemma":[0.7187616,0.000622592,0.2720011,0.00023768481,0.0002357479,0.00024631308,0.0009036201,0.00010186941,0.0068894317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988783,0.00032298284,0.000046248897,0.00014691002,0.00039592918,0.00020964748],"domain_scores_gemma":[0.9974711,0.0013443056,0.00034023714,0.00038983836,0.00035570143,0.00009891018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010352456,0.0005408113,0.00077849015,0.0010043504,0.00077978394,0.0013756474,0.001181839,0.0009388068,0.0022723577],"category_scores_gemma":[0.0050977645,0.00019267175,0.00042044173,0.0013120407,0.0010703539,0.0022821168,0.0015600697,0.0010728263,0.0006724794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003427023,0.000110005734,0.0016517165,0.00018218828,0.00003742921,0.00048812912,0.00028756764,0.23609743,0.014440116,0.63879377,0.0036636493,0.10390531],"study_design_scores_gemma":[0.00003938063,0.0001467353,0.00028054015,0.000016953025,0.000011838438,0.00030822094,0.0000622882,0.76170456,0.013430138,0.21984954,0.004119428,0.00003039097],"about_ca_topic_score_codex":0.00067771657,"about_ca_topic_score_gemma":0.0007695789,"teacher_disagreement_score":0.0022723577,"about_ca_system_score_codex":0.001093005,"about_ca_system_score_gemma":0.0015053786,"threshold_uncertainty_score":0.007930279},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04358549182562847,"score_gpt":0.2736177343553822,"score_spread":0.23003224252975374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011320741","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75305796,0.00089771295,0.18846913,0.00040648432,0.0001536503,0.00003557729,0.00015898416,0.0002854304,0.05653495],"genre_scores_gemma":[0.971256,0.00042652155,0.022940796,0.00008912974,0.00010310155,0.0000556708,0.00020359221,0.000116186464,0.004808996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994424,0.00014279764,0.000021841099,0.000058415157,0.00023727256,0.00009738352],"domain_scores_gemma":[0.99780244,0.0010947537,0.00035908943,0.00025780857,0.00037393597,0.000111916626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068929617,0.00041851692,0.00035458204,0.0013397895,0.00046499405,0.0009203996,0.00031957356,0.0005392267,0.004072344],"category_scores_gemma":[0.0061414526,0.00016639476,0.00033036523,0.00095646654,0.000992929,0.0013115236,0.00057802454,0.0006418662,0.0008133399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046276159,0.0000571615,0.0028101578,0.00023138596,0.000028431296,0.0004196087,0.0003207702,0.058212664,0.04554436,0.81851506,0.0027345293,0.070663095],"study_design_scores_gemma":[0.000047612062,0.0003231512,0.005023808,0.00007895136,0.00003560725,0.001368822,0.00024379966,0.44254905,0.041638188,0.4981054,0.01045538,0.00013033386],"about_ca_topic_score_codex":0.00029947955,"about_ca_topic_score_gemma":0.0002641696,"teacher_disagreement_score":0.004072344,"about_ca_system_score_codex":0.00061908824,"about_ca_system_score_gemma":0.00030322393,"threshold_uncertainty_score":0.013623357},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Isomorphism (crystallography); Discrete mathematics; Crystallography; Crystal structure","score_opus":0.016959126994329065,"score_gpt":0.2840770749925573,"score_spread":0.26711794799822824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020012988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07841565,0.0024390474,0.71362644,0.010599889,0.001185874,0.0003362008,0.0008898467,0.0007725097,0.19173458],"genre_scores_gemma":[0.80423754,0.003539926,0.14371222,0.0026460139,0.0013877614,0.00072721986,0.0008706331,0.000462276,0.042416334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99310726,0.001811244,0.0003492716,0.0011700551,0.0021293121,0.0014328476],"domain_scores_gemma":[0.9909859,0.0042987606,0.0004542416,0.0031353317,0.0008361087,0.0002897028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062321774,0.0014620571,0.0013502417,0.0019850158,0.0029803198,0.0032812033,0.0029848658,0.0020803527,0.012770514],"category_scores_gemma":[0.013472845,0.00083432,0.0024989578,0.0021324109,0.0054869014,0.016667385,0.008649488,0.006118016,0.002140839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031308733,0.000021643575,0.00011343365,0.00005186892,0.000008281143,0.00005978588,0.00010124805,0.0019612806,0.00043327667,0.98775697,0.0019417853,0.007519056],"study_design_scores_gemma":[0.000019484032,0.000015888365,0.00010238943,0.000018388411,0.000008052707,0.000087472145,0.000031544616,0.009092169,0.0014767706,0.9820467,0.007082718,0.00001836941],"about_ca_topic_score_codex":0.0018480741,"about_ca_topic_score_gemma":0.0011550912,"teacher_disagreement_score":0.012770514,"about_ca_system_score_codex":0.003753302,"about_ca_system_score_gemma":0.0020176875,"threshold_uncertainty_score":0.04272157},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02774178960676147,"score_gpt":0.340894421191333,"score_spread":0.3131526315845715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024305003","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6952393,0.009260477,0.1392666,0.024358151,0.0007478325,0.0001465232,0.00043243644,0.00034243168,0.13020626],"genre_scores_gemma":[0.98436534,0.0029607348,0.005750415,0.0003372179,0.00079997606,0.0000561576,0.000104844694,0.000036071,0.0055891317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773395,0.0006153291,0.00009807049,0.0003292947,0.0007284392,0.0004949049],"domain_scores_gemma":[0.9897606,0.007232766,0.0007346953,0.0013310295,0.0005183491,0.0004225767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00287162,0.0011539084,0.0011913169,0.0019329903,0.002056064,0.0042061843,0.0010587787,0.00195532,0.0044244905],"category_scores_gemma":[0.012430784,0.00051283196,0.000590778,0.0014844007,0.008889343,0.011204604,0.005701659,0.0044467626,0.0007898377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023845358,0.00005483376,0.000526983,0.00011139448,0.000019449537,0.00022384048,0.00032448236,0.01714035,0.001959601,0.9646157,0.0020645899,0.012720224],"study_design_scores_gemma":[0.000048516413,0.000052039148,0.0001934564,0.000045955534,0.000008451504,0.00008295143,0.00006885584,0.036351763,0.00085926766,0.96017915,0.0020873097,0.000022285656],"about_ca_topic_score_codex":0.0011899989,"about_ca_topic_score_gemma":0.00053916813,"teacher_disagreement_score":0.0044244905,"about_ca_system_score_codex":0.0021864604,"about_ca_system_score_gemma":0.0013493507,"threshold_uncertainty_score":0.015863955},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07231315160863089,"score_gpt":0.3736553630367348,"score_spread":0.3013422114281039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026698357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072828503,0.00029064104,0.98424363,0.00035284023,0.00006924912,0.00003470289,0.000058833826,0.000079191996,0.007588075],"genre_scores_gemma":[0.32002974,0.0028661906,0.6593227,0.00066375366,0.00071737263,0.00024566616,0.00037711818,0.00015511786,0.015622284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989998,0.0002793149,0.00006024023,0.00015710475,0.00043964156,0.00006387868],"domain_scores_gemma":[0.99843425,0.0009524267,0.00013091366,0.00016467752,0.00027872002,0.00003899237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007392291,0.0007384528,0.00045859956,0.0011805518,0.00067336764,0.0013162587,0.0007888855,0.00092490227,0.003214646],"category_scores_gemma":[0.0055699195,0.00030266275,0.0006547066,0.0011861252,0.001899787,0.0028540632,0.0017056575,0.002146326,0.0011304073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044053046,0.000026749098,0.00022846539,0.000121653844,0.000014206421,0.0001069461,0.00021995037,0.052073944,0.0045748916,0.9014531,0.0011249314,0.04001108],"study_design_scores_gemma":[0.000034727032,0.00008560706,0.00010033001,0.00005259331,0.000016496402,0.00026449174,0.00009015275,0.29925644,0.005211281,0.68253607,0.012318638,0.00003308192],"about_ca_topic_score_codex":0.00095521397,"about_ca_topic_score_gemma":0.0008706752,"teacher_disagreement_score":0.003214646,"about_ca_system_score_codex":0.00085682847,"about_ca_system_score_gemma":0.0010520918,"threshold_uncertainty_score":0.010754108},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.031144836569571337,"score_gpt":0.3625640533067013,"score_spread":0.33141921673712993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055241129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070371196,0.0033260817,0.85224473,0.0013795741,0.0007323171,0.00028417012,0.0014949514,0.0007007291,0.069466196],"genre_scores_gemma":[0.66060895,0.003319394,0.27377415,0.0012665642,0.0010167515,0.00088264316,0.0024318427,0.0004771431,0.056222554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840647,0.00043059126,0.000070032605,0.00030524845,0.00048259404,0.00030504883],"domain_scores_gemma":[0.9957783,0.0020766242,0.0004525224,0.0007579817,0.0006341617,0.00030038712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010842899,0.00111495,0.0011383253,0.0011338395,0.0012529346,0.0019357353,0.001988531,0.0014376027,0.009579293],"category_scores_gemma":[0.0058038943,0.00051554106,0.0008004706,0.0019525115,0.0019556708,0.0029733838,0.001726228,0.0024326805,0.0017644664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013911059,0.00007106286,0.00047865094,0.000171177,0.00002500393,0.00012939035,0.00008398395,0.06031705,0.0017416407,0.9011746,0.010672624,0.024995876],"study_design_scores_gemma":[0.000083434315,0.00013118878,0.0003612968,0.000060496626,0.00002848842,0.00042957853,0.00006987425,0.35223675,0.0029585112,0.6180383,0.025540097,0.000061910825],"about_ca_topic_score_codex":0.0021482194,"about_ca_topic_score_gemma":0.0020487255,"teacher_disagreement_score":0.009579293,"about_ca_system_score_codex":0.0022629178,"about_ca_system_score_gemma":0.0016136641,"threshold_uncertainty_score":0.03204596},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0255040991783082,"score_gpt":0.3320897558339155,"score_spread":0.3065856566556073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070925289","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007480862,0.00056089985,0.9910061,0.000105876934,0.000038412953,0.00001899071,0.000034349057,0.00008196421,0.00067252415],"genre_scores_gemma":[0.39272326,0.0014523367,0.60117316,0.00021276645,0.0004894198,0.00021508773,0.00046291156,0.00017389018,0.00309724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99362516,0.0030233779,0.00040459385,0.0008071057,0.0019341037,0.00020552937],"domain_scores_gemma":[0.982569,0.011462848,0.0013907371,0.0022356212,0.0020406581,0.00030114094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008444597,0.001502174,0.0018837802,0.0028503148,0.00080618734,0.002365774,0.0019663414,0.0020324548,0.0011690882],"category_scores_gemma":[0.05141126,0.000787759,0.00076678616,0.0017918036,0.0019261956,0.0052901814,0.0042151934,0.0019909705,0.0005809435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019262683,0.000076498116,0.003350441,0.0003021789,0.0001780943,0.00012548843,0.0001554516,0.5063413,0.006477963,0.29588225,0.0024421536,0.18447551],"study_design_scores_gemma":[0.0000083340465,0.000035949233,0.00043441844,0.00001928208,0.00001419949,0.00005718745,0.000012407667,0.8979938,0.0018237941,0.09843109,0.0011460485,0.00002351653],"about_ca_topic_score_codex":0.00096533546,"about_ca_topic_score_gemma":0.0008724877,"teacher_disagreement_score":0.008444597,"about_ca_system_score_codex":0.00116179,"about_ca_system_score_gemma":0.0008163401,"threshold_uncertainty_score":0.044659793},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012029016746072835,"score_gpt":0.27961477844150046,"score_spread":0.26758576169542764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072113533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33726558,0.005180029,0.57428986,0.00068648875,0.0003399909,0.00010896961,0.00012744285,0.00036497726,0.08163662],"genre_scores_gemma":[0.8953882,0.0033120958,0.081942864,0.00017179968,0.0002752038,0.00009064196,0.0001499098,0.00013122085,0.018538192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997061,0.00006808591,0.000018326227,0.000053208532,0.00009363983,0.000060586786],"domain_scores_gemma":[0.9994036,0.0002638718,0.0000792562,0.000088539535,0.00010798164,0.00005682391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041385685,0.00038855954,0.00027853853,0.001143461,0.00073658855,0.0008024536,0.00037317164,0.00058243435,0.0027751694],"category_scores_gemma":[0.0018544287,0.00023817923,0.00032203007,0.0006803553,0.0010828474,0.00149273,0.0007219294,0.000894498,0.0005929922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041645995,0.00002708959,0.00033469163,0.00005915297,0.000005175072,0.0001250321,0.00021750551,0.00623433,0.003477872,0.9499106,0.00043062723,0.039136335],"study_design_scores_gemma":[0.000013506893,0.00008862916,0.0002880587,0.000053520384,0.000010734223,0.00038566,0.00008205696,0.03940114,0.008807383,0.93407303,0.016765397,0.0000309905],"about_ca_topic_score_codex":0.0004776389,"about_ca_topic_score_gemma":0.00035249977,"teacher_disagreement_score":0.0027751694,"about_ca_system_score_codex":0.0006561777,"about_ca_system_score_gemma":0.00048038812,"threshold_uncertainty_score":0.009283841},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.033542161171498795,"score_gpt":0.2921867532533029,"score_spread":0.2586445920818041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111604339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23452812,0.0018383081,0.7146971,0.00036451957,0.00028144263,0.00018569412,0.0003827145,0.0003865141,0.047335662],"genre_scores_gemma":[0.7914798,0.0012086541,0.19761315,0.00024612618,0.00022917998,0.00028253687,0.00053121545,0.000102241014,0.00830714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959654,0.000093347306,0.000029128498,0.00006343516,0.00016613808,0.000051503313],"domain_scores_gemma":[0.99968266,0.000117296695,0.000054299104,0.000044394663,0.000074711694,0.000026570338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039005984,0.00059958844,0.0003791752,0.0011748631,0.00040841536,0.0008643512,0.00034716673,0.00046962895,0.0024645915],"category_scores_gemma":[0.0011477546,0.0001610822,0.00039652718,0.000800999,0.0007078619,0.0009922803,0.00070493785,0.00061028136,0.00039001208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021546951,0.00004241536,0.0005036985,0.00026065105,0.00002551102,0.00049102714,0.00026518424,0.017465739,0.041101705,0.7999282,0.0016087943,0.1380916],"study_design_scores_gemma":[0.000083220424,0.00031084672,0.0017828079,0.00014224801,0.000057061006,0.0020645445,0.00015566924,0.18930371,0.05653023,0.7040453,0.045419242,0.00010505619],"about_ca_topic_score_codex":0.00023767108,"about_ca_topic_score_gemma":0.00032117157,"teacher_disagreement_score":0.0024645915,"about_ca_system_score_codex":0.0005294068,"about_ca_system_score_gemma":0.0004521652,"threshold_uncertainty_score":0.008244872},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021027546917038314,"score_gpt":0.26668051688441313,"score_spread":0.24565296996737482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2587862547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20695464,0.0013355239,0.7648592,0.000479584,0.00044238853,0.00012478427,0.0004841453,0.0003212784,0.024998395],"genre_scores_gemma":[0.7549753,0.0011424485,0.23184142,0.00032389027,0.0001648791,0.00016173076,0.0007416195,0.00008800312,0.010560673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970204,0.000070969974,0.0000293705,0.000060489027,0.00009321863,0.00004401132],"domain_scores_gemma":[0.99959224,0.00010933254,0.00007924447,0.000070949245,0.00010048316,0.00004780368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036734767,0.0006131536,0.0003374786,0.0007332507,0.0003939226,0.0006220129,0.0003434617,0.00053233886,0.002367724],"category_scores_gemma":[0.0013170501,0.00024497256,0.00033504146,0.00074492174,0.0006975065,0.001209846,0.00071052107,0.0007265658,0.00054017454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004094505,0.000052683874,0.001182803,0.0003709226,0.00003509998,0.00044674653,0.00036623504,0.012812015,0.11481926,0.72874737,0.0019133862,0.13884415],"study_design_scores_gemma":[0.00015906236,0.0009219508,0.00266253,0.0001903268,0.000110707595,0.004278041,0.0003243517,0.16203187,0.20260373,0.570913,0.05561364,0.00019062053],"about_ca_topic_score_codex":0.00023041641,"about_ca_topic_score_gemma":0.00025087062,"teacher_disagreement_score":0.002367724,"about_ca_system_score_codex":0.0003770255,"about_ca_system_score_gemma":0.00068226684,"threshold_uncertainty_score":0.007920861},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019119330575086114,"score_gpt":0.31570619899013586,"score_spread":0.2965868684150497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612757204","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89300334,0.000305151,0.08638277,0.00017487371,0.000033408385,0.00004642207,0.00016451461,0.00018427959,0.019705283],"genre_scores_gemma":[0.97981197,0.00017664554,0.008081636,0.000032751857,0.000030571093,0.000046428475,0.00016372495,0.00006224488,0.011594077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970007,0.000043063774,0.00001788813,0.000049597118,0.00007475284,0.00011467956],"domain_scores_gemma":[0.99853754,0.0005085328,0.00022122652,0.0002177093,0.00028583416,0.00022918802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049070746,0.00034939064,0.00044583998,0.0017436543,0.0011959597,0.001526478,0.000638963,0.0006254075,0.00427275],"category_scores_gemma":[0.0024978989,0.0003452175,0.00049391115,0.0006854116,0.0018856819,0.0022443752,0.0013758759,0.00093911804,0.0006438485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020931111,0.000030471887,0.0029621006,0.000043662785,0.000009104338,0.00032708107,0.0010839865,0.0077885715,0.004784907,0.97105634,0.0006069833,0.011097464],"study_design_scores_gemma":[0.0000358227,0.00013430267,0.0025414678,0.000054111148,0.00002096188,0.00041261475,0.0005571928,0.08208049,0.00975203,0.8979328,0.0064161858,0.0000619269],"about_ca_topic_score_codex":0.0010968612,"about_ca_topic_score_gemma":0.00072154764,"teacher_disagreement_score":0.00427275,"about_ca_system_score_codex":0.0009284918,"about_ca_system_score_gemma":0.00039171713,"threshold_uncertainty_score":0.01429379},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mathematics; 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","score_opus":0.018168014798504373,"score_gpt":0.3000045371685736,"score_spread":0.28183652237006923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791716769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4055467,0.0026952093,0.51444745,0.0036844448,0.00047623113,0.00017115258,0.0015427154,0.0008108957,0.070625246],"genre_scores_gemma":[0.9276168,0.0008053207,0.057655502,0.0004238625,0.0003104776,0.00016104663,0.0008315835,0.00011303178,0.012082507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883646,0.00018047148,0.000054758235,0.00023393889,0.00042939401,0.000265017],"domain_scores_gemma":[0.996434,0.0018040065,0.00039557286,0.0006716419,0.0004367137,0.0002581084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007663515,0.0005717567,0.0006271647,0.0012671431,0.0011606584,0.0015110731,0.0011935948,0.001312592,0.0045556184],"category_scores_gemma":[0.0060711545,0.00034075405,0.00048923487,0.0010998406,0.0015843916,0.0030238389,0.0022147822,0.0015892462,0.0010375674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022171247,0.000052849035,0.0010213924,0.00016641547,0.000023349075,0.00019648219,0.0002636793,0.014905384,0.010915797,0.93588996,0.004453713,0.03188927],"study_design_scores_gemma":[0.000044301018,0.000084843465,0.0007486028,0.00006829018,0.000016587868,0.00045993674,0.000103163584,0.08138773,0.010910774,0.894303,0.011835301,0.000037506677],"about_ca_topic_score_codex":0.00057743373,"about_ca_topic_score_gemma":0.00069994025,"teacher_disagreement_score":0.0045556184,"about_ca_system_score_codex":0.0012101365,"about_ca_system_score_gemma":0.00075332774,"threshold_uncertainty_score":0.015240014},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scheme (mathematics); Mathematics; Signature (topology); Security analysis; Computer security; Computer science; Mathematical analysis; Geometry","score_opus":0.033584223373891185,"score_gpt":0.35752119573577834,"score_spread":0.3239369723618872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794822170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21874495,0.001546149,0.69008386,0.010394744,0.0006881394,0.000300057,0.0008806081,0.0014021987,0.075959325],"genre_scores_gemma":[0.9134542,0.0012690347,0.07558559,0.00073136523,0.00034604257,0.00015082042,0.00040600298,0.00019444784,0.007862403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99320835,0.0012154874,0.00043527794,0.0009945077,0.0029614656,0.0011849811],"domain_scores_gemma":[0.9888552,0.004952288,0.0007919521,0.0040528537,0.0010353219,0.00031233628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065988363,0.0011305166,0.0015006542,0.0021966165,0.002892824,0.0042846324,0.0019407036,0.003164512,0.0056547364],"category_scores_gemma":[0.02016492,0.0006982879,0.00177769,0.0026500723,0.011930031,0.0199055,0.0062343394,0.007211204,0.0018889388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012736549,0.000015935719,0.00021353562,0.000055126682,0.000011320601,0.00011880356,0.00026558622,0.0037600629,0.0013790696,0.98614943,0.00078192004,0.0071216836],"study_design_scores_gemma":[0.000036202964,0.00003713774,0.00014000098,0.000053210446,0.000016817488,0.00016090674,0.00006434616,0.014136061,0.0031249456,0.97801363,0.0041679353,0.00004872533],"about_ca_topic_score_codex":0.001938909,"about_ca_topic_score_gemma":0.00064669375,"teacher_disagreement_score":0.0065988363,"about_ca_system_score_codex":0.0032663236,"about_ca_system_score_gemma":0.002853135,"threshold_uncertainty_score":0.03489834},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete logarithm; Finite field; Mathematics; Logarithm; Computation; Field (mathematics); Discrete mathematics; Polynomial; Pure mathematics; Algorithm; Mathematical analysis; Computer science; Public-key cryptography","score_opus":0.025838952826023737,"score_gpt":0.316651990292815,"score_spread":0.29081303746679127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2893614166","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5353427,0.0008303486,0.4346442,0.0023918794,0.00021031572,0.0001344999,0.0004310072,0.0016251529,0.024389926],"genre_scores_gemma":[0.92146176,0.00025131766,0.07533047,0.00021738863,0.00006022404,0.0000369906,0.00024112024,0.00007465968,0.0023260766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991248,0.00016425154,0.0000604454,0.00014553753,0.00030472438,0.0002003127],"domain_scores_gemma":[0.9973539,0.0016062515,0.00022390757,0.00045110253,0.00022558538,0.00013933597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013876957,0.0004627793,0.00052695174,0.0007031752,0.0008147936,0.0018573427,0.0007317042,0.00053555437,0.003524341],"category_scores_gemma":[0.0059041576,0.00017850212,0.0008707834,0.0010612482,0.0021955904,0.0047064913,0.0023334546,0.002056834,0.000828046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015186585,0.00030006218,0.009195647,0.00045303977,0.00010385656,0.0006347011,0.0010583827,0.049835872,0.024433766,0.76286024,0.0062587108,0.1433471],"study_design_scores_gemma":[0.00023917998,0.0002735259,0.0012121138,0.00009087334,0.000043941254,0.00048176083,0.00030715973,0.11107944,0.042023595,0.8312187,0.012956727,0.00007291711],"about_ca_topic_score_codex":0.0007511857,"about_ca_topic_score_gemma":0.0010077284,"teacher_disagreement_score":0.003524341,"about_ca_system_score_codex":0.0015386019,"about_ca_system_score_gemma":0.0016156319,"threshold_uncertainty_score":0.011790097},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.015160570346571891,"score_gpt":0.2879144393704459,"score_spread":0.27275386902387405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911380990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3060382,0.0023262438,0.60506177,0.0012304983,0.00054403977,0.00021750802,0.00051772106,0.0005392681,0.08352473],"genre_scores_gemma":[0.7710124,0.0014136782,0.21168904,0.00060374575,0.0003349166,0.00021933556,0.00063905906,0.00019413438,0.0138936285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940133,0.00012352048,0.000049012684,0.000121763755,0.00021338761,0.00009099538],"domain_scores_gemma":[0.9989574,0.00030144124,0.0001177167,0.00027892005,0.0002078613,0.0001366701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057048694,0.00040807194,0.00035809528,0.0014407494,0.0010864085,0.0010537178,0.0005532512,0.0005770227,0.0026246957],"category_scores_gemma":[0.0019333381,0.0003099999,0.00054489996,0.0008561409,0.0015203056,0.0016388888,0.0018324406,0.0015813796,0.00048358188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012280408,0.00004402498,0.0011021749,0.00015808965,0.0000105788995,0.00036214493,0.00064631604,0.0041031525,0.015497834,0.9300201,0.0015296186,0.04640326],"study_design_scores_gemma":[0.000103545855,0.00025315557,0.0012107186,0.00016347882,0.000051696283,0.0028125995,0.0004143634,0.051243782,0.040559545,0.8278829,0.07516735,0.00013684356],"about_ca_topic_score_codex":0.00032907553,"about_ca_topic_score_gemma":0.00036593137,"teacher_disagreement_score":0.0026246957,"about_ca_system_score_codex":0.0008905703,"about_ca_system_score_gemma":0.000683749,"threshold_uncertainty_score":0.008780479},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019055851549277723,"score_gpt":0.320767214288058,"score_spread":0.30171136273878024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950759382","genre_codex":"commentary","genre_gemma":"review","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029927574,0.26590702,0.02012024,0.63586336,0.03647829,0.000022738184,0.00013577493,0.00013732052,0.038342517],"genre_scores_gemma":[0.26077387,0.34539667,0.025382502,0.17968671,0.14455171,0.0003206023,0.00030791998,0.001278265,0.04230181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9768485,0.012892596,0.0012458606,0.0018571625,0.0059679043,0.0011879153],"domain_scores_gemma":[0.86012924,0.11432961,0.0029841494,0.006761489,0.012968767,0.0028267603],"candidate_categories":["metaresearch","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.04099899,0.0015202608,0.0019003195,0.0055914363,0.0059924056,0.015046954,0.0035860639,0.008239881,0.01078532],"category_scores_gemma":[0.081348635,0.000785633,0.0015318306,0.004884884,0.044462457,0.038765203,0.0093210405,0.025982542,0.0016237468],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003320052,0.000018184057,0.000041517353,0.00023224684,0.000016208704,0.000046922243,0.0017570705,0.00025612995,0.00007625404,0.9437749,0.044375673,0.009371727],"study_design_scores_gemma":[0.000023132947,0.000023232924,0.00006869575,0.000886424,0.000008640409,0.000062207626,0.001444985,0.0002932696,0.00013276759,0.6274327,0.36959898,0.00002491785],"about_ca_topic_score_codex":0.0028894944,"about_ca_topic_score_gemma":0.0023158875,"teacher_disagreement_score":0.99440855,"about_ca_system_score_codex":0.013931112,"about_ca_system_score_gemma":0.0059855534,"threshold_uncertainty_score":0.21682602},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03960450188849118,"score_gpt":0.32103007023788704,"score_spread":0.28142556834939586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963700364","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9506339,0.0014621408,0.035776947,0.0006342507,0.00007029844,0.00003483502,0.000286922,0.00026766502,0.010833172],"genre_scores_gemma":[0.99577856,0.00029529864,0.0033116776,0.000053216874,0.000024364927,0.000016289681,0.00012272065,0.000036206373,0.000361749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966402,0.0010410007,0.00012806852,0.0002940935,0.0010501364,0.00084652536],"domain_scores_gemma":[0.98313105,0.011735331,0.001359998,0.0014336845,0.0015687218,0.0007712275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035657098,0.0013260583,0.0014030929,0.0013474065,0.00089670863,0.0019082796,0.0009212826,0.0010951823,0.0016658541],"category_scores_gemma":[0.027135694,0.0003756278,0.00025311412,0.0010812429,0.0020100828,0.0018919602,0.0024794883,0.0009048743,0.00032615208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00353317,0.00020834395,0.010840998,0.0003144889,0.00018947295,0.00041390976,0.00025781125,0.794957,0.041127652,0.10559908,0.0023914173,0.04016672],"study_design_scores_gemma":[0.0001224186,0.00069502584,0.0028205153,0.00012535276,0.000060319882,0.00041477004,0.00017637023,0.9027066,0.030292615,0.061572123,0.0008922419,0.000121608275],"about_ca_topic_score_codex":0.0012616453,"about_ca_topic_score_gemma":0.0010470075,"teacher_disagreement_score":0.0035657098,"about_ca_system_score_codex":0.0015968028,"about_ca_system_score_gemma":0.0019894,"threshold_uncertainty_score":0.018857539},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.010472248902202172,"score_gpt":0.2790740404006751,"score_spread":0.26860179149847296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963912591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052428596,0.0005502099,0.92581797,0.00040929284,0.00025800633,0.00014284436,0.00021681005,0.00028490825,0.019891344],"genre_scores_gemma":[0.32522574,0.00089424604,0.6593654,0.0003932128,0.00021003923,0.00042496435,0.00046438337,0.00012909129,0.012892811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996284,0.00014053874,0.000021740127,0.000059066042,0.00010625178,0.000043914966],"domain_scores_gemma":[0.9995042,0.00014402621,0.00006296643,0.00014360403,0.000109561515,0.000035672518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048234212,0.00066189456,0.0005677934,0.0006337717,0.00072818296,0.0005750752,0.00051388546,0.00059112016,0.002751555],"category_scores_gemma":[0.001348411,0.00033598518,0.0005771888,0.0006615455,0.00077452516,0.0006064256,0.0010217538,0.0009395275,0.0011917901],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024269386,0.00006597936,0.00072321075,0.00039052748,0.00003343936,0.00067133404,0.0005130793,0.03259622,0.13011622,0.69220614,0.0042035943,0.13823755],"study_design_scores_gemma":[0.00010477516,0.000692005,0.0016874219,0.00022930407,0.000061257306,0.0031589582,0.00013944166,0.28746787,0.093708836,0.50927466,0.10329926,0.00017630549],"about_ca_topic_score_codex":0.00023160291,"about_ca_topic_score_gemma":0.00038872942,"teacher_disagreement_score":0.002751555,"about_ca_system_score_codex":0.00046067964,"about_ca_system_score_gemma":0.00064265216,"threshold_uncertainty_score":0.0092048645},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014686634800500595,"score_gpt":0.29866985212177943,"score_spread":0.28398321732127885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991341770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27656332,0.0008624311,0.67760205,0.00092282874,0.00023733823,0.00021632841,0.00075522566,0.0011440882,0.04169636],"genre_scores_gemma":[0.67868966,0.00047508324,0.30112454,0.00037902922,0.000095269716,0.00021448506,0.0005800604,0.00012205104,0.018319901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978644,0.000045374,0.000010015627,0.000034101307,0.00007838265,0.000045723722],"domain_scores_gemma":[0.9997249,0.00007187526,0.00004455577,0.00006842803,0.000050829483,0.000039348353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016233455,0.00040060515,0.00026001013,0.00066376757,0.00057154556,0.00042474893,0.0003417023,0.00036738234,0.0025157556],"category_scores_gemma":[0.0007412081,0.00021133333,0.00026105935,0.0005790126,0.0007570765,0.00045104788,0.0010437503,0.00057761424,0.0007545577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027177014,0.000092531205,0.0012814107,0.0002920797,0.000030318797,0.00047576684,0.0005057289,0.038086403,0.078718424,0.7123143,0.006950408,0.16098087],"study_design_scores_gemma":[0.00021104475,0.0006455435,0.002245586,0.0001709138,0.000055297307,0.002033771,0.00020975896,0.2443778,0.1909288,0.4478878,0.11104067,0.00019295026],"about_ca_topic_score_codex":0.0007800154,"about_ca_topic_score_gemma":0.0010336722,"teacher_disagreement_score":0.0025157556,"about_ca_system_score_codex":0.00057065964,"about_ca_system_score_gemma":0.00087513746,"threshold_uncertainty_score":0.008416057},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.037195923058011296,"score_gpt":0.31015976200605067,"score_spread":0.2729638389480394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000741554","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8074916,0.00019508903,0.1824671,0.00023278309,0.000032628654,0.00012568943,0.00021290642,0.0003772908,0.008864931],"genre_scores_gemma":[0.9520144,0.00013564118,0.046191446,0.00005720936,0.000010347343,0.00004931172,0.00020351728,0.000025457924,0.0013126805],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977845,0.000039437582,0.000015809906,0.000052033287,0.00007658368,0.000037555452],"domain_scores_gemma":[0.9990225,0.00039222,0.00013519259,0.00027280237,0.0001179381,0.000059388236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020998859,0.00024252862,0.0001905579,0.0003768004,0.00043656636,0.00031313096,0.0003326769,0.00026292028,0.0008417299],"category_scores_gemma":[0.0011109324,0.00014890506,0.00029668031,0.00037730558,0.0006332938,0.0005561135,0.0005928823,0.0004561076,0.00011345876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005302128,0.0002278178,0.0074669314,0.0006894536,0.0000813989,0.0011191897,0.00074531924,0.14758533,0.4274366,0.33896226,0.002134615,0.07302088],"study_design_scores_gemma":[0.00019535418,0.00047530278,0.004849753,0.00007412383,0.0001139842,0.0012367588,0.00015026011,0.60425127,0.291023,0.08723622,0.010301194,0.00009269696],"about_ca_topic_score_codex":0.0009834184,"about_ca_topic_score_gemma":0.001400395,"teacher_disagreement_score":0.0009834184,"about_ca_system_score_codex":0.00031851567,"about_ca_system_score_gemma":0.00074210187,"threshold_uncertainty_score":0.0028159022},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.031567735736418245,"score_gpt":0.29276075773538546,"score_spread":0.2611930219989672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033468545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035300348,0.00047201078,0.93163383,0.00037409112,0.00025994697,0.00013594909,0.00042472282,0.0009556755,0.030443445],"genre_scores_gemma":[0.49489653,0.0012877904,0.4648727,0.00053332164,0.00036931928,0.00035187666,0.0012675651,0.0006068275,0.035814174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993112,0.00015443719,0.000047265552,0.00013417838,0.00026917478,0.00008363901],"domain_scores_gemma":[0.99867034,0.00034720157,0.0001526233,0.00026822087,0.00039958104,0.00016209878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049119716,0.0010749492,0.00044024983,0.0014918809,0.0007164423,0.0015639502,0.0008301182,0.0006464506,0.009976305],"category_scores_gemma":[0.0033240295,0.0003178259,0.0005453816,0.0014157386,0.0011121284,0.0018202083,0.0012349708,0.0015282285,0.0050397012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013207347,0.00006497564,0.0003806621,0.00017532922,0.00001866239,0.0002925992,0.00030431992,0.019311352,0.021398233,0.84151495,0.008420736,0.10798606],"study_design_scores_gemma":[0.000041825362,0.00022994124,0.00032233563,0.0001056731,0.000021888844,0.0009139564,0.00023907186,0.30405518,0.046163894,0.590153,0.0576388,0.00011448379],"about_ca_topic_score_codex":0.0009472981,"about_ca_topic_score_gemma":0.0014165094,"teacher_disagreement_score":0.009976305,"about_ca_system_score_codex":0.00074479514,"about_ca_system_score_gemma":0.0009825212,"threshold_uncertainty_score":0.03337401},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02528393588309801,"score_gpt":0.2869563206010946,"score_spread":0.2616723847179966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112560171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29195288,0.0006778546,0.68112946,0.0006622014,0.00012979803,0.00010804554,0.00065537717,0.00071302167,0.02397142],"genre_scores_gemma":[0.9439269,0.00053311285,0.04254435,0.0002719363,0.00026587743,0.00027150798,0.00075044937,0.00048784868,0.010948034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984425,0.00050648145,0.00007389569,0.00033522194,0.00035759172,0.00028441835],"domain_scores_gemma":[0.99539447,0.0026638182,0.0005359063,0.0006001419,0.0004661648,0.00033948995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016165976,0.0005152929,0.0006452528,0.0014225033,0.00089475245,0.0017322716,0.000814747,0.00077373284,0.00620892],"category_scores_gemma":[0.008550189,0.00032838198,0.00071042794,0.0010204172,0.0018164243,0.0022651777,0.00095351395,0.0011366626,0.0014029185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021211967,0.00003974167,0.0018778134,0.00007561636,0.000015939271,0.00027498064,0.00021855815,0.020739404,0.008885153,0.9472577,0.0019183392,0.018484663],"study_design_scores_gemma":[0.00006175583,0.00016492551,0.0019099966,0.00005532717,0.000018419058,0.0005864558,0.00011593318,0.31220344,0.011480748,0.6677323,0.0055766166,0.00009407431],"about_ca_topic_score_codex":0.00067878247,"about_ca_topic_score_gemma":0.00042088545,"teacher_disagreement_score":0.00620892,"about_ca_system_score_codex":0.0009852317,"about_ca_system_score_gemma":0.0006684191,"threshold_uncertainty_score":0.020770907},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Dual (grammatical number)","score_opus":0.016897714460177005,"score_gpt":0.3018250839024632,"score_spread":0.2849273694422862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312608599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05533886,0.0062431097,0.71831006,0.0051197107,0.0021846192,0.000570018,0.006066263,0.0057582166,0.20040914],"genre_scores_gemma":[0.539387,0.005803813,0.33859348,0.0044343164,0.0016375637,0.0022288584,0.010847424,0.0073814862,0.08968599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947977,0.00090007007,0.00019857516,0.00074280036,0.002161757,0.0011991009],"domain_scores_gemma":[0.9898393,0.005250007,0.0005841079,0.001759891,0.0018955921,0.0006710914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026976075,0.005572355,0.0019786158,0.003930429,0.0022269366,0.0058662645,0.0029129123,0.0024442365,0.03649375],"category_scores_gemma":[0.02035363,0.0010930555,0.0017519023,0.0035936658,0.0032278786,0.0051011783,0.0064752405,0.006103229,0.018788675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074343465,0.0003781222,0.0013665323,0.0011360387,0.00015139006,0.0004217469,0.00053084234,0.07450704,0.009930066,0.6865279,0.09741367,0.12689328],"study_design_scores_gemma":[0.00010484617,0.00017312013,0.00037924942,0.00055748504,0.0001296563,0.0005245645,0.00020932301,0.27903235,0.009397212,0.6723506,0.036962885,0.00017858339],"about_ca_topic_score_codex":0.0040147677,"about_ca_topic_score_gemma":0.0071041635,"teacher_disagreement_score":0.03649375,"about_ca_system_score_codex":0.003719851,"about_ca_system_score_gemma":0.0046299994,"threshold_uncertainty_score":0.12208372},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04000628969610894,"score_gpt":0.33110270373278744,"score_spread":0.2910964140366785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385457409","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8774175,0.00066438783,0.09132607,0.0003925653,0.000113189126,0.00003745329,0.00021621662,0.00012308061,0.029709509],"genre_scores_gemma":[0.9738999,0.0003537106,0.016004235,0.000086904576,0.00009813677,0.000029953553,0.00017228173,0.000058467846,0.009296375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964285,0.000051350813,0.000021198459,0.00009046656,0.000099428784,0.00009467062],"domain_scores_gemma":[0.9991709,0.00023300064,0.00021225595,0.00013286769,0.00013016527,0.00012081449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028121218,0.00029886316,0.00025309605,0.0008793825,0.00066019513,0.0010869405,0.00032318404,0.00033933882,0.0038271025],"category_scores_gemma":[0.0010631746,0.0001914322,0.00039041362,0.00058549613,0.0017488851,0.0019948834,0.00086229964,0.0010297392,0.00044870592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016760567,0.000026891814,0.0011672343,0.00006811794,0.0000064731876,0.00041303522,0.0006401887,0.0033453894,0.01373499,0.9641359,0.0004912573,0.015802827],"study_design_scores_gemma":[0.000049607104,0.00033703342,0.003641766,0.000074485564,0.000038456903,0.0019568163,0.0006681308,0.03585473,0.043161847,0.8936888,0.020429883,0.000098395976],"about_ca_topic_score_codex":0.0004547249,"about_ca_topic_score_gemma":0.0005181822,"teacher_disagreement_score":0.0038271025,"about_ca_system_score_codex":0.00062750734,"about_ca_system_score_gemma":0.00038042088,"threshold_uncertainty_score":0.012802899},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03357229013745686,"score_gpt":0.3365365296462214,"score_spread":0.3029642395087645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387545514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32862532,0.0011302682,0.584874,0.0023282133,0.00049141154,0.00009290449,0.00043574368,0.0003773191,0.081644766],"genre_scores_gemma":[0.8896413,0.0006498104,0.09223331,0.00042477227,0.00044803345,0.00008419973,0.00029669443,0.00010555917,0.016116327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992262,0.000111778514,0.000036239162,0.00011045098,0.0003483948,0.0001669055],"domain_scores_gemma":[0.9991478,0.00022782027,0.00013833822,0.00018572192,0.00019889002,0.00010153601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044835726,0.00038250771,0.00027319894,0.0012146108,0.0007846136,0.001320964,0.000757968,0.00075162394,0.0042888066],"category_scores_gemma":[0.0016300442,0.000196848,0.000504378,0.00093096297,0.0016502285,0.0016787738,0.0015680074,0.0018920611,0.00077198877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024988294,0.0000191939,0.00009707733,0.000028465442,0.0000026672535,0.000053103617,0.000114157185,0.0030564254,0.00273345,0.9817831,0.00072200596,0.01136537],"study_design_scores_gemma":[0.000018210827,0.00009503766,0.00027195647,0.000027401271,0.00001088819,0.00030218926,0.000083051025,0.045841556,0.0082855895,0.9319264,0.013093527,0.000044167922],"about_ca_topic_score_codex":0.0005865297,"about_ca_topic_score_gemma":0.00051166327,"teacher_disagreement_score":0.0042888066,"about_ca_system_score_codex":0.0008757276,"about_ca_system_score_gemma":0.0006000767,"threshold_uncertainty_score":0.014347434},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.06436179215317825,"score_gpt":0.3763330940520546,"score_spread":0.31197130189887634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392250595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1087347,0.00046485302,0.84353745,0.0029054726,0.00016331808,0.00023122304,0.00088185,0.0010533679,0.042027775],"genre_scores_gemma":[0.8642728,0.000760131,0.11570075,0.0011530517,0.00041078756,0.0007480776,0.0011991098,0.0007669049,0.014988401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994385,0.0010601017,0.0002936867,0.00079028466,0.0025926426,0.00087828457],"domain_scores_gemma":[0.98361546,0.008398197,0.0012473856,0.0022653558,0.0035092158,0.0009643371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003009213,0.0012983258,0.0011877816,0.003025012,0.0019532635,0.0027265823,0.0020552608,0.002606736,0.0054984507],"category_scores_gemma":[0.029134797,0.0005597928,0.00080614665,0.0020350271,0.0043314896,0.005202984,0.0051600565,0.0035555386,0.0027122304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018488045,0.00004300824,0.0007418847,0.00008560734,0.000018731103,0.0001757978,0.00021086866,0.033561423,0.008519906,0.9340391,0.003783641,0.018635178],"study_design_scores_gemma":[0.000059978833,0.00013089094,0.00040563647,0.00005927582,0.000015242348,0.0002292491,0.00006997466,0.18553416,0.0139464345,0.7938143,0.0056744865,0.00006042891],"about_ca_topic_score_codex":0.0015905473,"about_ca_topic_score_gemma":0.00078005256,"teacher_disagreement_score":0.0054984507,"about_ca_system_score_codex":0.002987366,"about_ca_system_score_gemma":0.0028898104,"threshold_uncertainty_score":0.02167499},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Cryptosystem; Pure mathematics; Arithmetic; Algebra over a field; Cryptography; Algorithm","score_opus":0.02368202647637344,"score_gpt":0.3274646391995649,"score_spread":0.30378261272319146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402768742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4522368,0.0022729782,0.48886976,0.0009124542,0.00032869223,0.00025904994,0.00013466776,0.00064420025,0.054341406],"genre_scores_gemma":[0.93387395,0.0006208894,0.059562873,0.00011746995,0.000109597146,0.00005708509,0.00009938181,0.00003214278,0.005526554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966824,0.00006389893,0.000023339413,0.00005744745,0.00011302946,0.00007404584],"domain_scores_gemma":[0.9996295,0.00013465704,0.000069546724,0.000083158935,0.000048405156,0.000034746827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030583984,0.00028611225,0.00038169176,0.00078081526,0.00086681684,0.0009163041,0.00026240764,0.00045089956,0.0022779885],"category_scores_gemma":[0.0010183641,0.00011254393,0.00030819964,0.00045989163,0.00088007865,0.0024867519,0.0007361293,0.0006361021,0.00039494384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004363724,0.00007872184,0.0012195904,0.000201679,0.000030989384,0.0003727973,0.0007417432,0.015518099,0.039729696,0.821219,0.0013567802,0.11909446],"study_design_scores_gemma":[0.00014550315,0.0005490287,0.0013979258,0.00011085037,0.00005683685,0.0015657548,0.00035227972,0.17342314,0.096951835,0.6784904,0.046831593,0.00012492671],"about_ca_topic_score_codex":0.00020861579,"about_ca_topic_score_gemma":0.00021978254,"teacher_disagreement_score":0.0022779885,"about_ca_system_score_codex":0.0005127518,"about_ca_system_score_gemma":0.00059699954,"threshold_uncertainty_score":0.0076206923},"labels":[],"label_agreement":null}]}