{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06361873,0.009211714,0.88467485,0.00060116436,0.00016014812,0.0004985247,0.0000068515183,0.0000765464,0.04115149],"genre_scores_gemma":[0.7614536,0.00069797167,0.2378149,0.000007219048,0.0000019518855,0.00001212176,7.8711895e-7,0.000002878391,0.000008538453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999118,0.000068373236,0.00045724373,0.00007243329,0.0001548655,0.00012910512],"domain_scores_gemma":[0.9956398,0.0019054761,0.0002712218,0.0020704125,0.00009051174,0.000022549462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013082084,0.00006338035,0.00014037485,0.00009695973,0.00014897838,0.000013459237,0.0028008774,0.000021732494,0.0000025588222],"category_scores_gemma":[0.00012554697,0.00004993844,0.00006292333,0.000525496,0.00063556625,0.00022487144,0.000426264,0.00011569821,0.0000018572306],"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.0000014589688,0.00022773376,0.00091867335,0.000020497879,0.0000038800154,1.0199225e-7,0.0007490092,0.000010816977,0.00018068848,0.98154545,0.0000020169077,0.016339663],"study_design_scores_gemma":[0.00012142511,0.000042618238,0.0032329354,0.000082788,0.000009664539,0.000003466367,0.00039258218,0.002486751,0.0015196209,0.99008137,0.0019532198,0.00007353651],"about_ca_topic_score_codex":0.0000037103034,"about_ca_topic_score_gemma":0.00018017321,"teacher_disagreement_score":0.6978349,"about_ca_system_score_codex":0.000010293538,"about_ca_system_score_gemma":0.0000168466,"threshold_uncertainty_score":0.5204774},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5072752,0.0022194767,0.48664814,0.001215174,0.000059021004,0.0004985975,0.000028974808,0.00003166078,0.0020237397],"genre_scores_gemma":[0.85588574,0.0015997372,0.1424319,0.000023948485,0.0000015899637,0.00004411912,0.0000071590484,0.0000026569846,0.0000031410755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999222,0.00011690188,0.00040092046,0.00008478772,0.000108160224,0.00006726215],"domain_scores_gemma":[0.99384576,0.003981739,0.00044602974,0.0015714006,0.00014278619,0.000012259448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021454041,0.00006879373,0.00016788395,0.00007076785,0.00005690392,0.000008067829,0.00183881,0.000032687327,0.0000071877203],"category_scores_gemma":[0.00023258994,0.000053777232,0.00005452695,0.00037913406,0.0003944989,0.000489165,0.00034892326,0.000115118615,0.0000027540966],"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.000008728498,0.0005778119,0.00845334,0.00012125355,0.00005262276,9.7684904e-8,0.04458991,0.004172865,0.030137125,0.8836353,0.000011562485,0.028239395],"study_design_scores_gemma":[0.00022756893,0.00007342967,0.02533349,0.0004511314,0.000015157298,4.2397e-7,0.0029379528,0.22426172,0.0065519256,0.73991674,0.000102246835,0.00012820656],"about_ca_topic_score_codex":0.00006764139,"about_ca_topic_score_gemma":0.00003682647,"teacher_disagreement_score":0.34861052,"about_ca_system_score_codex":0.000005701246,"about_ca_system_score_gemma":0.00001710049,"threshold_uncertainty_score":0.34169972},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027011828,0.0029980247,0.9391347,0.00044078808,0.00008454519,0.00018959217,0.0000042554784,0.000048099137,0.030088136],"genre_scores_gemma":[0.602714,0.0002688397,0.39698368,0.000014642247,0.000002998211,0.0000073094766,5.384639e-7,0.0000026256203,0.000005379093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992094,0.0000730956,0.0004143888,0.000085764324,0.00011964557,0.000097711905],"domain_scores_gemma":[0.9948855,0.003184718,0.00027416178,0.0015739731,0.000062414416,0.000019221496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042291766,0.000066376044,0.00019732506,0.00014078098,0.000052748153,0.000011820621,0.0016410856,0.0000363872,0.0000025830134],"category_scores_gemma":[0.0005613734,0.000060929266,0.000047108668,0.0005484393,0.00017309765,0.00026942356,0.00038024646,0.00009934076,9.825786e-7],"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.0000010950245,0.00035675883,0.0038261702,0.00022377835,0.000010283787,1.3128926e-7,0.001869441,0.0025456985,0.00056114246,0.94543236,0.000009174824,0.045163985],"study_design_scores_gemma":[0.00033634735,0.00007724387,0.0046350835,0.0004744975,0.000012146359,0.0000020854002,0.00013040796,0.19972207,0.0032318018,0.78923136,0.0019771764,0.00016978556],"about_ca_topic_score_codex":0.000019460396,"about_ca_topic_score_gemma":0.00005384417,"teacher_disagreement_score":0.57570213,"about_ca_system_score_codex":0.0000040772975,"about_ca_system_score_gemma":0.000016448488,"threshold_uncertainty_score":0.30495727},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7259956,0.11575495,0.030866379,0.00014709495,0.00023589839,0.00113218,0.000069063884,0.000083494764,0.12571533],"genre_scores_gemma":[0.9771792,0.008542936,0.014244487,8.678995e-7,0.0000010297092,0.00001755273,0.0000013780443,0.000004857295,0.000007673876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946564,0.000047495836,0.00034952833,0.000028797267,0.000058670816,0.000049875343],"domain_scores_gemma":[0.99886894,0.0004393251,0.00013890894,0.0004600585,0.00008359015,0.000009163596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029521296,0.0000483024,0.00013161449,0.000037969592,0.000039760755,0.000002345705,0.00032142142,0.000021781414,0.0000043011364],"category_scores_gemma":[0.000087564855,0.000037723905,0.000015889045,0.00014154769,0.00027734353,0.00012325101,0.000031149706,0.000054207372,5.651995e-7],"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.0000033903332,0.00006396413,0.00020532937,0.00036043837,0.000025908606,3.386415e-8,0.009835535,0.00072950183,0.008677888,0.9787295,0.000002892218,0.0013656559],"study_design_scores_gemma":[0.00033803773,0.00008002758,0.0002622137,0.000710328,0.00004441683,0.000006382241,0.012346024,0.03926498,0.123501405,0.8221896,0.0010672343,0.00018934278],"about_ca_topic_score_codex":0.0000044820767,"about_ca_topic_score_gemma":0.000077875244,"teacher_disagreement_score":0.2511836,"about_ca_system_score_codex":0.000003355905,"about_ca_system_score_gemma":0.0000073198967,"threshold_uncertainty_score":0.15383361},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6503437,0.0021989476,0.32947052,0.00028893788,0.00014062745,0.00023353295,0.00001724085,0.000045859622,0.017260617],"genre_scores_gemma":[0.6574439,0.00018590094,0.34234866,0.0000049428895,0.0000017810889,0.000007656047,9.380488e-7,0.0000032971122,0.0000029730693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990177,0.000060874027,0.0005383635,0.00010115212,0.00017427972,0.00010759272],"domain_scores_gemma":[0.99571925,0.0016124954,0.0004391843,0.002059361,0.00014393518,0.000025756144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078353105,0.000080328646,0.0002558756,0.00028448764,0.00005715464,0.000009889511,0.0024254527,0.00004043947,0.000009468916],"category_scores_gemma":[0.00035478748,0.000077651595,0.00008562453,0.0008631944,0.00044661138,0.00014083816,0.00053915626,0.00018115819,8.763138e-7],"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.0000017689357,0.00041080927,0.0007354621,0.00012696488,0.000008405157,6.2125835e-8,0.0013911912,0.00041875266,0.009084174,0.9830107,0.0000016931964,0.0048100045],"study_design_scores_gemma":[0.00029887116,0.00007514286,0.00045532704,0.00039838182,0.000017415165,0.0000042700053,0.0005835402,0.13147627,0.026889581,0.83870655,0.000923497,0.00017116251],"about_ca_topic_score_codex":0.000004676786,"about_ca_topic_score_gemma":0.0000855943,"teacher_disagreement_score":0.14430417,"about_ca_system_score_codex":0.0000052562864,"about_ca_system_score_gemma":0.000028065615,"threshold_uncertainty_score":0.45071352},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8231318,0.057002995,0.014884976,0.02308633,0.002889,0.0064630206,0.000183897,0.00031728874,0.072040714],"genre_scores_gemma":[0.97466385,0.0073470185,0.017356915,0.000115396084,0.00010994108,0.0001207116,0.00019498609,0.00002896949,0.0000622113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987186,0.00004535368,0.000749766,0.000150858,0.00020667943,0.00012870981],"domain_scores_gemma":[0.99556124,0.0006823411,0.0013102503,0.0022037127,0.00023799141,0.0000044696762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004324045,0.00018180859,0.00033185098,0.00008496471,0.00020933268,0.000067840185,0.0024504163,0.00007923818,0.00004688981],"category_scores_gemma":[0.00043045447,0.00011671325,0.00008441101,0.00023376614,0.00032479563,0.0004963315,0.0014844277,0.00032268607,0.00001943138],"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.00017508947,0.0032701746,0.027941156,0.0056946576,0.0010275329,0.0000013527264,0.043850616,0.0010674091,0.016788881,0.860185,0.0016174433,0.038380686],"study_design_scores_gemma":[0.00040048553,0.000007184339,0.021946946,0.0017596706,0.000215502,2.506664e-7,0.002818463,0.008955686,0.001647247,0.9394961,0.022233358,0.0005191261],"about_ca_topic_score_codex":0.00011074474,"about_ca_topic_score_gemma":0.00033596714,"teacher_disagreement_score":0.15153207,"about_ca_system_score_codex":0.00001744474,"about_ca_system_score_gemma":0.000049756454,"threshold_uncertainty_score":0.47594282},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01832076,0.0018977362,0.94657457,0.0009167795,0.00005282061,0.0003769041,0.0000043459536,0.000058164307,0.03179791],"genre_scores_gemma":[0.5904018,0.00043661808,0.4090602,0.000032279346,0.0000016686407,0.00004630774,0.000001255286,0.000003870245,0.000015943928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991592,0.000076894445,0.00040679792,0.00010210167,0.00014151956,0.000113458074],"domain_scores_gemma":[0.99698925,0.0007402301,0.00018785529,0.0018730098,0.00017176752,0.0000379125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035177203,0.00007631237,0.00017560767,0.0003807285,0.00006241994,0.000021039728,0.00231545,0.000024255667,0.000016310174],"category_scores_gemma":[0.00024299764,0.00007270003,0.000056973335,0.0016913008,0.00012864564,0.0005024968,0.00054456154,0.00007064608,0.000014488509],"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":[3.5527506e-7,0.00018034165,0.0005466927,0.00003370911,0.0000056178988,2.3798481e-8,0.0013709349,0.0004141252,0.00030542986,0.9846029,0.000034457593,0.012505358],"study_design_scores_gemma":[0.00010765996,0.00004934622,0.0008247141,0.00012343128,0.0000053533304,0.0000010298857,0.00024589646,0.017140064,0.0021439602,0.97723573,0.0020133406,0.00010947389],"about_ca_topic_score_codex":0.000014930262,"about_ca_topic_score_gemma":0.00002099752,"teacher_disagreement_score":0.5720811,"about_ca_system_score_codex":0.000010328659,"about_ca_system_score_gemma":0.000017160726,"threshold_uncertainty_score":0.43027207},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26130334,0.0028398116,0.6979144,0.0019718823,0.00014356183,0.0008407228,0.000023234712,0.000054982316,0.034908056],"genre_scores_gemma":[0.8732378,0.00060983293,0.12608357,0.0000372443,0.000003035411,0.000018831844,0.000002593397,0.0000035263652,0.0000035691535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998882,0.000096706426,0.0005868283,0.00008843329,0.00021791835,0.0001281056],"domain_scores_gemma":[0.9958817,0.0017127747,0.00033255038,0.0019353026,0.00011585508,0.000021814893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013214095,0.000075010495,0.00017242726,0.0001532131,0.000103722145,0.000014686259,0.0019033831,0.000025598278,0.000010065836],"category_scores_gemma":[0.00014256069,0.000056641977,0.00006348996,0.0006508671,0.00017944067,0.00020661998,0.00026536846,0.000120278506,0.0000016006802],"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.0000013228581,0.0002273868,0.00020459322,0.000035857436,0.0000063194216,9.8512736e-8,0.0042274017,0.000030081841,0.00020664654,0.9940744,0.000024161545,0.00096172607],"study_design_scores_gemma":[0.00024682467,0.000043917364,0.00030494586,0.00010716566,0.000004903129,0.0000017482853,0.0016152692,0.012817865,0.0021170683,0.9802621,0.0023934324,0.000084747895],"about_ca_topic_score_codex":0.000033939006,"about_ca_topic_score_gemma":0.0006764716,"teacher_disagreement_score":0.6119345,"about_ca_system_score_codex":0.000014612682,"about_ca_system_score_gemma":0.000021121605,"threshold_uncertainty_score":0.3536991},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012580182,0.011332126,0.97489005,0.00020859635,0.000040346422,0.00033942968,0.0000033417857,0.00006389579,0.011864196],"genre_scores_gemma":[0.47384554,0.0035037384,0.52248645,0.00002747225,0.00000839996,0.00010182583,0.000011421192,0.000005904253,0.000009213919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901813,0.00011843566,0.00041519883,0.00011935903,0.00011276312,0.00021609858],"domain_scores_gemma":[0.9959603,0.0009500464,0.00021023629,0.0026849979,0.00013195554,0.00006247167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009363141,0.000106710206,0.00021673975,0.00012207344,0.00019450752,0.000039200146,0.0030566491,0.00003719001,0.0000031780014],"category_scores_gemma":[0.00017574655,0.00010502201,0.000049837978,0.00039659208,0.00012752015,0.0015102011,0.00047698687,0.00012423877,0.0000022373051],"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":[9.548567e-7,0.00055438763,0.00061810575,0.000046349975,0.0000060991724,7.2579898e-9,0.003086102,0.0003439181,0.00052245974,0.966573,0.000016654138,0.028231952],"study_design_scores_gemma":[0.0004053505,0.000058672023,0.00043623443,0.00013283313,0.000013692557,0.00000468924,0.00083783537,0.89985186,0.0017926298,0.088137254,0.008027208,0.00030174947],"about_ca_topic_score_codex":8.5508935e-7,"about_ca_topic_score_gemma":0.000023068964,"teacher_disagreement_score":0.89950794,"about_ca_system_score_codex":0.000030182544,"about_ca_system_score_gemma":0.000023789022,"threshold_uncertainty_score":0.5680065},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25597134,0.014322223,0.01657238,0.002186832,0.0009098747,0.0016130379,0.000059099228,0.00036114783,0.70800406],"genre_scores_gemma":[0.834378,0.0016513261,0.16385804,0.000030567862,0.00001725117,0.000013129214,0.0000038209696,0.000011139671,0.000036750695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988029,0.00009856663,0.0006063935,0.00011072958,0.00021273197,0.00016867848],"domain_scores_gemma":[0.99610454,0.0016560286,0.0002913305,0.0018072448,0.00010609989,0.000034778233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005360453,0.0001361955,0.0003625376,0.0001226666,0.00015613768,0.000010791641,0.0012503292,0.00007427182,0.000022005968],"category_scores_gemma":[0.0006959185,0.00012053322,0.00008353555,0.0002838393,0.00026711304,0.00022757005,0.00019875621,0.00022093438,0.000002030621],"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.0000060208095,0.00039466098,0.00014314814,0.00006488595,0.000008709065,3.0170173e-7,0.0018163237,0.000009544981,0.00010790508,0.99502796,0.000050390994,0.002370139],"study_design_scores_gemma":[0.0003410454,0.000054346976,0.00015917167,0.00013230268,0.000019087784,0.0000033315237,0.00041316552,0.0004180931,0.00050616433,0.9958242,0.0020046777,0.00012437992],"about_ca_topic_score_codex":0.0000015698731,"about_ca_topic_score_gemma":0.000016385044,"teacher_disagreement_score":0.70796734,"about_ca_system_score_codex":0.00002328471,"about_ca_system_score_gemma":0.000018724324,"threshold_uncertainty_score":0.49152023},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016430841,0.0064623286,0.97640353,0.00066965155,0.00012510298,0.00043395584,0.0000102974445,0.00008748541,0.015643306],"genre_scores_gemma":[0.078484856,0.004863725,0.91639864,0.000034370783,0.00001354492,0.000118926524,0.00001092231,0.000025876983,0.00004914572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796593,0.00027097642,0.000752282,0.00036328478,0.0003947366,0.00025277567],"domain_scores_gemma":[0.99122214,0.0016868364,0.00082248804,0.005936141,0.00025031983,0.000082084],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009331371,0.0002931856,0.0006765083,0.00039003446,0.00009606483,0.000099301455,0.005806468,0.00017203132,0.000003537178],"category_scores_gemma":[0.0004277089,0.0002466554,0.00010799581,0.0006832788,0.00029073883,0.00035781105,0.002797359,0.000725485,0.000005751851],"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.0000018229559,0.00024764307,0.0001539213,0.0004105779,0.000025144425,6.961291e-7,0.0007326956,0.0021919478,0.000009546513,0.9760787,0.00003082488,0.020116488],"study_design_scores_gemma":[0.0001634229,0.00003766573,0.00003719768,0.00057794753,0.00002792633,0.0000050370427,0.000023055152,0.3263482,0.00013189664,0.66959,0.0028265505,0.00023109914],"about_ca_topic_score_codex":0.000012005228,"about_ca_topic_score_gemma":0.000039841332,"teacher_disagreement_score":0.32415622,"about_ca_system_score_codex":0.00005697088,"about_ca_system_score_gemma":0.00017289349,"threshold_uncertainty_score":0.99999857},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027128045,0.004433224,0.9643027,0.00018191978,0.000034656085,0.00018494367,0.000026437243,0.000026987966,0.0036810823],"genre_scores_gemma":[0.8914382,0.0004913901,0.108004175,0.000018366365,0.000005942274,0.000025390176,0.0000069780617,0.000003357245,0.0000062334993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994834,0.0000475407,0.00024933886,0.0000686118,0.00006404102,0.00008708469],"domain_scores_gemma":[0.9979035,0.00083402905,0.00016886654,0.0010138435,0.000054202133,0.000025543526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001615259,0.00006609646,0.0001221904,0.00011714725,0.00008627801,0.000009831794,0.00062712305,0.000035221332,0.000009857537],"category_scores_gemma":[0.00004801938,0.00005863987,0.00003482258,0.0003875576,0.00014990613,0.0005425182,0.00021665863,0.00009695778,7.6141885e-7],"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":[9.862304e-7,0.00018175262,0.0013429072,0.00006795416,0.000009366322,4.8613034e-9,0.004750679,0.0003525769,0.0007912589,0.9778919,0.000004711383,0.014605904],"study_design_scores_gemma":[0.00014266076,0.000026605016,0.0016218101,0.0000547432,0.0000117681375,0.000002682883,0.0007836935,0.01589155,0.0012442608,0.9762885,0.0038239863,0.000107755506],"about_ca_topic_score_codex":0.0000025105664,"about_ca_topic_score_gemma":0.000028788778,"teacher_disagreement_score":0.86431015,"about_ca_system_score_codex":0.000005275352,"about_ca_system_score_gemma":0.000009532017,"threshold_uncertainty_score":0.23912646},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93913287,0.026860524,0.013321184,0.001417621,0.00032057357,0.0010161031,0.00030200873,0.00033503762,0.017294094],"genre_scores_gemma":[0.8358298,0.005740954,0.15799183,0.000019983065,0.000015712605,0.0002130467,0.000098722056,0.000023866007,0.00006612043],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908787,0.000048306534,0.00047385154,0.00011187469,0.00012681632,0.0001513097],"domain_scores_gemma":[0.9984745,0.00024342794,0.00009732563,0.001075209,0.000056067776,0.00005346285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010577317,0.00013685871,0.00023618466,0.0001087417,0.00013680391,0.000031649866,0.0005282239,0.000038979735,0.0003718444],"category_scores_gemma":[0.000044205994,0.00014683578,0.00003932951,0.00018054774,0.000327372,0.00047155356,0.00015349378,0.00017998363,0.000043734635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003949611,0.0033524067,0.059438765,0.0042040697,0.0016115905,0.0000066769862,0.12095389,0.173179,0.26750708,0.18652833,0.022703314,0.16047539],"study_design_scores_gemma":[0.0024639154,0.000119009994,0.01241078,0.0010460904,0.00017756874,0.000043308548,0.03146505,0.48967686,0.0024172692,0.32288444,0.13584591,0.001449771],"about_ca_topic_score_codex":0.0001273722,"about_ca_topic_score_gemma":0.0001782045,"teacher_disagreement_score":0.31649786,"about_ca_system_score_codex":0.000059966904,"about_ca_system_score_gemma":0.0000155318,"threshold_uncertainty_score":0.59877896},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36221895,0.017303523,0.5428477,0.0029757568,0.0003713979,0.0014841955,0.00009521272,0.00038403162,0.07231926],"genre_scores_gemma":[0.79859436,0.0032925813,0.19758502,0.000023691076,0.000020357536,0.000079794976,0.000010155658,0.000015065594,0.00037900015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998418,0.00014112929,0.00044451925,0.00039718268,0.00030446562,0.00029474933],"domain_scores_gemma":[0.994225,0.00090514467,0.0004934421,0.004109094,0.00014591239,0.000121396086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046773333,0.0002771895,0.00044380283,0.00015357135,0.0010141426,0.00028123506,0.0037370173,0.00007386189,0.000027928558],"category_scores_gemma":[0.00024672807,0.00019359462,0.00008836904,0.00032201243,0.0008138673,0.0013779001,0.00096151006,0.00029117023,0.000009927511],"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.0000637875,0.00077614776,0.014779115,0.00025863684,0.00014807729,0.000004629367,0.011235098,0.00016119397,0.016354494,0.84667987,0.00014803406,0.10939094],"study_design_scores_gemma":[0.00269366,0.0012256631,0.052042022,0.0029829673,0.00022879842,0.00008914204,0.0009970107,0.08367741,0.0025320516,0.8272712,0.02456528,0.0016947986],"about_ca_topic_score_codex":0.0000725885,"about_ca_topic_score_gemma":0.0016884694,"teacher_disagreement_score":0.43637538,"about_ca_system_score_codex":0.000033377393,"about_ca_system_score_gemma":0.00013103787,"threshold_uncertainty_score":0.78945595},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12115971,0.004073122,0.76679415,0.0016901214,0.0003175004,0.00039550505,0.000054785312,0.000101136895,0.105413996],"genre_scores_gemma":[0.7019414,0.00017110423,0.2978559,0.000005285213,0.0000033904173,0.000004136449,0.0000015319049,0.0000026842729,0.0000145434815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993704,0.000043387987,0.00031524745,0.00008747456,0.000102457045,0.000081029124],"domain_scores_gemma":[0.99577874,0.0003625027,0.00043628024,0.0033213838,0.00008402032,0.000017073788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020929959,0.00006303244,0.00015255435,0.000093244285,0.00029311754,0.00004785565,0.0028462615,0.00002672488,0.0000093928775],"category_scores_gemma":[0.00024265933,0.0000605996,0.000051048133,0.00015475226,0.0002542117,0.0007433903,0.0006124067,0.00011134307,0.0000010068461],"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":[9.507678e-7,0.000103380306,0.0006775246,0.000053404565,0.000007308883,8.501698e-8,0.0016507229,0.0002850288,0.0023349386,0.986186,0.0000073505616,0.008693302],"study_design_scores_gemma":[0.00013733369,0.00002747386,0.00057800254,0.00017375886,0.000005968557,0.0000023430027,0.0002385214,0.015681077,0.0024918537,0.97922313,0.001358252,0.00008225601],"about_ca_topic_score_codex":0.000004489301,"about_ca_topic_score_gemma":0.00007170784,"teacher_disagreement_score":0.5807817,"about_ca_system_score_codex":0.0000055302294,"about_ca_system_score_gemma":0.0000152575385,"threshold_uncertainty_score":0.52891093},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043334407,0.0032734205,0.8606154,0.001710731,0.0001478049,0.0001702561,0.0000047597077,0.00011663645,0.12962757],"genre_scores_gemma":[0.5974721,0.001027953,0.40141672,0.000030292746,0.000011040082,0.000012269021,0.0000010952587,0.00000409391,0.000024492143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992712,0.000066553774,0.00029396074,0.000113254006,0.000119775825,0.00013525157],"domain_scores_gemma":[0.9970444,0.0004732713,0.00014955008,0.0022451633,0.00006176314,0.000025869822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003913759,0.00007863746,0.00015119505,0.00014774177,0.00011801767,0.00002388429,0.002684836,0.000025892425,0.000023162547],"category_scores_gemma":[0.00006397811,0.0000743328,0.00004828766,0.0005829535,0.00042343198,0.00046093206,0.00053989317,0.00009881599,0.00002649237],"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.0000011855325,0.0001592907,0.0002490652,0.000018987805,0.000005004993,1.5006428e-7,0.0011499845,0.000004910062,0.0001185161,0.99217635,0.000022066535,0.0060944622],"study_design_scores_gemma":[0.00009520363,0.00005058671,0.00010895456,0.00008058151,0.0000034983977,0.000003114797,0.000087349516,0.006991395,0.002059553,0.97554374,0.014891854,0.00008419505],"about_ca_topic_score_codex":0.0000023605178,"about_ca_topic_score_gemma":0.0000994207,"teacher_disagreement_score":0.59313864,"about_ca_system_score_codex":0.0000102236645,"about_ca_system_score_gemma":0.000017913373,"threshold_uncertainty_score":0.4989138},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78804207,0.0073198956,0.011530673,0.006986151,0.00036646862,0.0021071015,0.00010364442,0.00011501084,0.18342902],"genre_scores_gemma":[0.9442696,0.00045060998,0.05500363,0.00009218498,0.000017688031,0.000035611985,0.000001372669,0.000017553151,0.00011176775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873894,0.00013508106,0.0005480821,0.000111254165,0.00030810747,0.00015851633],"domain_scores_gemma":[0.99174345,0.004375504,0.0005393011,0.0031012737,0.00021985073,0.000020628346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059914787,0.00013895343,0.0002779116,0.00007460773,0.00018579808,0.000006706272,0.002094273,0.000076696146,0.0000650689],"category_scores_gemma":[0.0027165539,0.000080341146,0.00010790436,0.0006987906,0.0009606247,0.00014585904,0.0004920481,0.00040927844,0.0000089599],"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.0000045933657,0.00036383898,0.00012696687,0.00011657821,0.000015349366,4.0751107e-8,0.0019787073,0.00000898462,0.0003611655,0.99653894,0.00021549262,0.0002693259],"study_design_scores_gemma":[0.00014199295,0.00003861041,0.00006650581,0.00038681042,0.000015659367,0.000001175817,0.0010252843,0.0008241285,0.0063106054,0.98956895,0.0015352,0.00008506554],"about_ca_topic_score_codex":9.16391e-7,"about_ca_topic_score_gemma":0.00009013421,"teacher_disagreement_score":0.18331724,"about_ca_system_score_codex":0.000023675599,"about_ca_system_score_gemma":0.000032648517,"threshold_uncertainty_score":0.38917154},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032200582,0.0004728745,0.95845973,0.0005120028,0.000096901946,0.00015886672,0.0000030981948,0.00006691082,0.008029025],"genre_scores_gemma":[0.6632796,0.00016696814,0.3364844,0.000038371996,0.000011944784,0.000009147286,0.0000021779051,0.000005319042,0.0000020750058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987228,0.000111277644,0.00060874067,0.00019301043,0.00014252026,0.0002216445],"domain_scores_gemma":[0.9960174,0.0018412246,0.0002790414,0.001720113,0.00010550241,0.000036720572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007416293,0.00012666195,0.00025539086,0.00031728085,0.00013372116,0.000050127095,0.0025141127,0.00005897261,0.000008908163],"category_scores_gemma":[0.0004421766,0.00012665606,0.00006989317,0.00094288785,0.00043596353,0.0004354247,0.0009318578,0.00029110594,0.0000055439336],"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.000005669015,0.00024446417,0.008634868,0.00007651156,0.00000911546,0.000001536917,0.0032879552,0.00014068851,0.00010926448,0.96026814,0.0000022933782,0.027219515],"study_design_scores_gemma":[0.0002312653,0.000097045224,0.004336077,0.00064380444,0.000004872166,0.00000384602,0.00015257561,0.27515277,0.000117249576,0.7185871,0.000499104,0.0001742797],"about_ca_topic_score_codex":0.000013896068,"about_ca_topic_score_gemma":0.00073033036,"teacher_disagreement_score":0.631079,"about_ca_system_score_codex":0.00001219717,"about_ca_system_score_gemma":0.000019411525,"threshold_uncertainty_score":0.51648843},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36233342,0.021399066,0.58180386,0.0024668844,0.00040002048,0.0007245312,0.00004143732,0.00013209668,0.03069871],"genre_scores_gemma":[0.7351242,0.0021769707,0.26261812,0.0000270868,0.000004101269,0.000004090878,0.0000012433521,0.000002686862,0.000041520878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994375,0.00003818884,0.00027748343,0.00008672442,0.000086843946,0.00007326831],"domain_scores_gemma":[0.99758184,0.0009847848,0.0001656594,0.001207264,0.000037224538,0.000023235045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018483373,0.00006096507,0.00016887275,0.00011824185,0.000039627044,0.000013102159,0.00088625256,0.00003142214,0.000014195653],"category_scores_gemma":[0.00007021788,0.00006004187,0.000038077476,0.0002626294,0.00019946149,0.00047974245,0.00034998482,0.000098841134,0.0000022093107],"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.0000013012751,0.00006814613,0.0011890193,0.00005223409,0.000007894615,3.2118816e-8,0.0012861659,0.00017321973,0.00017079992,0.99321,0.000010571839,0.0038306015],"study_design_scores_gemma":[0.00021874301,0.000045202432,0.00033217916,0.00013396198,0.000006656755,0.0000025276074,0.0002458926,0.011128932,0.00050380395,0.9856814,0.0016266513,0.000074026684],"about_ca_topic_score_codex":0.000006443326,"about_ca_topic_score_gemma":0.000028815006,"teacher_disagreement_score":0.37279075,"about_ca_system_score_codex":0.0000034235447,"about_ca_system_score_gemma":0.000026638207,"threshold_uncertainty_score":0.24484365},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20846343,0.020949852,0.15261415,0.006958826,0.00063418737,0.0023803413,0.000038575607,0.00038634508,0.6075743],"genre_scores_gemma":[0.8329687,0.00065853546,0.16627742,0.000034525896,0.0000044848134,0.000013595305,8.7023625e-7,0.0000066727384,0.000035170564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990426,0.00007945512,0.00037178939,0.00016899496,0.00021341864,0.00012374419],"domain_scores_gemma":[0.9962076,0.0015833494,0.00018812284,0.0018711061,0.00013069101,0.000019135274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003747374,0.000077889126,0.00020765432,0.00011903997,0.000040285184,0.000021033657,0.0016832052,0.000042522035,0.000026247742],"category_scores_gemma":[0.00037050317,0.00008413107,0.000053768144,0.0003459532,0.00021955314,0.00036770612,0.00030197977,0.00016502893,0.000020647729],"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.000002054865,0.00040909316,0.00023318517,0.00011062016,0.0000068365644,1.1515347e-7,0.013377059,0.00022812854,0.00029989413,0.982984,0.0000074119557,0.002341607],"study_design_scores_gemma":[0.00084562396,0.00033759893,0.0013309248,0.0013104058,0.000017969465,0.000006781737,0.017064992,0.15420566,0.004858367,0.8020216,0.017499372,0.0005006624],"about_ca_topic_score_codex":0.000005375098,"about_ca_topic_score_gemma":0.0000076151573,"teacher_disagreement_score":0.6245053,"about_ca_system_score_codex":0.000026954369,"about_ca_system_score_gemma":0.000041690088,"threshold_uncertainty_score":0.34307656},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8755555,0.0014538268,0.069983736,0.001864514,0.00009511465,0.0003791494,0.000008208179,0.00003884678,0.050621103],"genre_scores_gemma":[0.92702454,0.0009022352,0.072020195,0.000011317325,0.0000020409607,0.000023145183,5.984095e-7,0.0000029336318,0.000013015429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942833,0.00004079528,0.00024124348,0.000073463874,0.00013190084,0.00008425483],"domain_scores_gemma":[0.9953197,0.0007392498,0.0003388363,0.0035306267,0.000059208993,0.000012379351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005974363,0.00006146789,0.0001378292,0.000055998556,0.00027804996,0.00003208089,0.004372907,0.000018042692,0.0000046470554],"category_scores_gemma":[0.00009432998,0.000044475335,0.000048417405,0.00010878452,0.0003682168,0.0003810295,0.00054939,0.0001072475,0.0000031287946],"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.000004204082,0.00013680736,0.00039173278,0.000036823556,0.000006481602,5.4500152e-8,0.0009830551,0.00068542815,0.00018802009,0.996009,0.0000044493004,0.0015539693],"study_design_scores_gemma":[0.00044647974,0.00015776423,0.0017680541,0.00069891405,0.000012552647,0.0000038088178,0.00031458336,0.13853857,0.010115047,0.8466424,0.001127779,0.00017404795],"about_ca_topic_score_codex":0.0000039388406,"about_ca_topic_score_gemma":0.000012947261,"teacher_disagreement_score":0.14936657,"about_ca_system_score_codex":0.000005713597,"about_ca_system_score_gemma":0.000016976062,"threshold_uncertainty_score":0.81260216},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7582935,0.006129229,0.15681075,0.0013920426,0.0003107414,0.0013180142,0.000056815647,0.00036889716,0.07532003],"genre_scores_gemma":[0.69944525,0.0011795796,0.29929712,0.000010693333,0.000004931718,0.000025671485,0.000005337108,0.000010313294,0.000021123891],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908525,0.000035987683,0.0005007614,0.00008581332,0.00017219337,0.000119995006],"domain_scores_gemma":[0.9985452,0.00013980291,0.00016522894,0.0009936232,0.00011999068,0.00003610172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014505717,0.00012015482,0.00027101103,0.00018044931,0.00004254512,0.000009746214,0.0005250884,0.000040564777,0.00002538412],"category_scores_gemma":[0.000070563045,0.000113834816,0.0000360421,0.00044717122,0.00020366523,0.00031640872,0.00003487113,0.0001242641,0.000004344861],"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.000024359499,0.0004386794,0.00033870642,0.00037265217,0.00007230111,9.283068e-7,0.0066805175,0.47779983,0.051054828,0.45784566,0.000094426265,0.0052771266],"study_design_scores_gemma":[0.004360231,0.0010727956,0.0037574174,0.0045233653,0.00018653153,0.00023167128,0.009794525,0.20796694,0.25656247,0.4939002,0.015471797,0.0021720303],"about_ca_topic_score_codex":0.0000032196679,"about_ca_topic_score_gemma":0.000024218029,"teacher_disagreement_score":0.26983288,"about_ca_system_score_codex":0.00004253824,"about_ca_system_score_gemma":0.000026093472,"threshold_uncertainty_score":0.4642049},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30367,0.003938435,0.6307361,0.00057441683,0.00024282756,0.00057707436,0.000020893782,0.00013217099,0.06010807],"genre_scores_gemma":[0.5552992,0.0009200451,0.44374496,0.0000075872736,0.0000019798263,0.000009265365,0.0000018887166,0.0000034293703,0.000011597507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912256,0.00008118855,0.00044096404,0.00010921746,0.00014597528,0.00010008629],"domain_scores_gemma":[0.99683696,0.0007490148,0.0003247475,0.0019691777,0.00010028061,0.000019799923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042505004,0.00008085253,0.00023910642,0.00017002097,0.000043452757,0.000009697507,0.0017220569,0.000036021615,0.000014044777],"category_scores_gemma":[0.00007924564,0.00007912121,0.00007186012,0.0005252652,0.00027833975,0.0004609518,0.00036986082,0.000112461,0.000010177702],"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.0000023078182,0.00016533224,0.0015478784,0.00010828257,0.000008813477,5.0006054e-8,0.00106724,0.00019118405,0.0012786454,0.9904596,0.0000018167441,0.0051688226],"study_design_scores_gemma":[0.0002700966,0.00006950858,0.0002879551,0.00028978943,0.000009330579,0.000006618569,0.00060703466,0.03222117,0.003662806,0.96019506,0.0022544723,0.00012612708],"about_ca_topic_score_codex":0.0000036228814,"about_ca_topic_score_gemma":0.000014156124,"teacher_disagreement_score":0.25162926,"about_ca_system_score_codex":0.000008894055,"about_ca_system_score_gemma":0.000024030334,"threshold_uncertainty_score":0.32264692},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013015922,0.0003032377,0.97891283,0.0027310485,0.00003187556,0.00047135047,0.000027915126,0.00010882102,0.004396984],"genre_scores_gemma":[0.49018466,0.00014020808,0.50955325,0.00008706779,0.0000014726397,0.00002609645,0.000002282118,0.0000043759737,5.6664413e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877536,0.000116168936,0.00066220714,0.00016056692,0.00018211882,0.00010355476],"domain_scores_gemma":[0.9920767,0.0051353667,0.00067307724,0.0019308918,0.0001544979,0.000029464702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031792457,0.00011172733,0.0002970591,0.000107195636,0.00004295594,0.00000602095,0.0023129585,0.000045585963,0.000005666616],"category_scores_gemma":[0.0014775081,0.00011842294,0.00007326379,0.0004889289,0.00017661323,0.00020457679,0.00044674904,0.00020770013,5.2705605e-7],"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.0001938187,0.0049683773,0.020565867,0.0045335093,0.00020534142,0.0000031230243,0.07314893,0.02406636,0.04705163,0.66036063,0.00028712276,0.1646153],"study_design_scores_gemma":[0.0006845496,0.0005099226,0.00037338978,0.0010263101,0.000022333785,0.0000014801745,0.0014026217,0.7537088,0.11592509,0.12595609,0.00016325529,0.00022617231],"about_ca_topic_score_codex":0.000025573849,"about_ca_topic_score_gemma":0.000088571265,"teacher_disagreement_score":0.7296424,"about_ca_system_score_codex":0.000020496824,"about_ca_system_score_gemma":0.000041884232,"threshold_uncertainty_score":0.48291475},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021514049,0.035513595,0.85970163,0.014424697,0.0004986649,0.0013430993,0.000053536733,0.0008822578,0.06606846],"genre_scores_gemma":[0.66954374,0.0018443895,0.32829946,0.00025256682,0.000013224097,0.000023139146,0.0000055456926,0.000010620016,0.000007324745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866664,0.00015104865,0.00049168675,0.00022547589,0.00028055027,0.00018460432],"domain_scores_gemma":[0.9956068,0.0019471463,0.00032540062,0.0019258321,0.000116525815,0.000078292775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036941265,0.0001621338,0.00027808847,0.00024254163,0.00014872605,0.000053248394,0.003476458,0.000054801112,0.00001663262],"category_scores_gemma":[0.00032702004,0.00015077187,0.00009290067,0.001538395,0.00017173991,0.0005779439,0.00044598678,0.00022476535,0.000030245092],"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.00002334165,0.00059299543,0.0020194084,0.00030260012,0.000017095088,0.0000017837021,0.0028593298,0.0026953449,0.00040559942,0.98549765,0.00016330209,0.005421565],"study_design_scores_gemma":[0.0007097817,0.0003785106,0.00025606228,0.00045169925,0.00003077779,0.0000020019318,0.0003544374,0.65843254,0.0021259575,0.29317555,0.043617893,0.0004648029],"about_ca_topic_score_codex":0.000003922417,"about_ca_topic_score_gemma":0.000022229933,"teacher_disagreement_score":0.6923221,"about_ca_system_score_codex":0.000020667125,"about_ca_system_score_gemma":0.00005064978,"threshold_uncertainty_score":0.64601815},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21323122,0.00064482767,0.7835328,0.0006479299,0.000029059085,0.00011062289,0.000027209186,0.00003096953,0.0017453701],"genre_scores_gemma":[0.90461713,0.00020747814,0.09510026,0.00003470236,0.000003833149,0.000019251434,0.000012846305,0.0000033202311,0.0000011968864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992806,0.00008140989,0.00034028324,0.00009525553,0.000102928774,0.00009958017],"domain_scores_gemma":[0.99857235,0.0005150644,0.00014613298,0.0006965876,0.000039137674,0.00003072785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002923143,0.000064566724,0.00014322829,0.00007930013,0.000051282506,0.000009948254,0.0009502808,0.000025054796,0.0000057337],"category_scores_gemma":[0.0001876971,0.000068244626,0.000048182676,0.0006403591,0.000093281764,0.00022949677,0.00024229103,0.00013245891,0.0000018572531],"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.0000054082443,0.00019243419,0.0014377735,0.000052068994,0.000004382852,2.519739e-7,0.0012978659,0.006621064,0.00079399144,0.98685944,0.000014110415,0.0027212084],"study_design_scores_gemma":[0.00041402082,0.00016931037,0.0024761779,0.00029440614,0.000008842207,0.0000026271714,0.00044876174,0.18203078,0.0035596974,0.80902475,0.0013883597,0.00018227719],"about_ca_topic_score_codex":0.00000397638,"about_ca_topic_score_gemma":0.0000505139,"teacher_disagreement_score":0.69138587,"about_ca_system_score_codex":0.000019196263,"about_ca_system_score_gemma":0.000031522108,"threshold_uncertainty_score":0.27829352},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2829517,0.04864464,0.617821,0.008306698,0.0035086172,0.010714418,0.001982081,0.0039052032,0.022165645],"genre_scores_gemma":[0.5982219,0.0036609485,0.39429286,0.0006537161,0.00010223838,0.002163374,0.00015755676,0.00017360236,0.000573814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935342,0.00063846755,0.002288524,0.0012380496,0.0010690104,0.0012317447],"domain_scores_gemma":[0.9878386,0.003929342,0.0014669719,0.0059616957,0.00042535967,0.000378025],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0035525854,0.00093653944,0.0014730573,0.0010454034,0.0018919568,0.00040761882,0.0062754233,0.0002641912,0.000093823335],"category_scores_gemma":[0.00055640977,0.0010010055,0.00060601195,0.0021872555,0.0011018394,0.0023226636,0.0045963693,0.0009782759,0.000011367206],"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.00012519625,0.0037920978,0.0009296654,0.001036258,0.00024664286,0.0000132725845,0.011256378,0.00062043226,0.0023356765,0.9728254,0.002213732,0.0046052416],"study_design_scores_gemma":[0.0042330096,0.0012155297,0.00049589435,0.00044054777,0.00028490383,0.00022907494,0.0037565874,0.18755049,0.00066918996,0.6620145,0.13695993,0.0021503365],"about_ca_topic_score_codex":0.000043358927,"about_ca_topic_score_gemma":0.00029418003,"teacher_disagreement_score":0.3152702,"about_ca_system_score_codex":0.00028393514,"about_ca_system_score_gemma":0.000352589,"threshold_uncertainty_score":0.9994075},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69575334,0.0343218,0.24353068,0.0038068907,0.0002792044,0.0012927499,0.00012646952,0.001130877,0.01975798],"genre_scores_gemma":[0.7817125,0.011733827,0.20628695,0.00007100032,0.000011905821,0.000034512086,0.000017461918,0.000018549992,0.00011331771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873185,0.00012667241,0.00047869387,0.00023798646,0.00019332898,0.00023145937],"domain_scores_gemma":[0.99616355,0.0018754837,0.00022524195,0.0015827353,0.00005969037,0.00009331825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062261405,0.00017317157,0.00035835474,0.00029383626,0.00019057553,0.00006740272,0.0012517723,0.000064903186,0.000006909594],"category_scores_gemma":[0.00023300017,0.0001690057,0.00005753289,0.0009470367,0.00052237324,0.0007274487,0.00080740644,0.00017479013,0.000010827563],"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.0000059575586,0.00023482728,0.0016150024,0.00017632953,0.000026204965,0.000002141877,0.0042921477,0.00006576837,0.0007696699,0.980657,0.00010890627,0.012046087],"study_design_scores_gemma":[0.0009379391,0.00014172631,0.0018364436,0.0005023121,0.0000351281,0.00002215678,0.0014211506,0.09575779,0.0007580281,0.886297,0.011888362,0.000401994],"about_ca_topic_score_codex":0.000026300382,"about_ca_topic_score_gemma":0.00018312079,"teacher_disagreement_score":0.095692016,"about_ca_system_score_codex":0.000011850058,"about_ca_system_score_gemma":0.00004025052,"threshold_uncertainty_score":0.6891852},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4628305,0.0075697396,0.516593,0.005982563,0.00028651228,0.0008073252,0.00010595342,0.0003978827,0.005426549],"genre_scores_gemma":[0.6810947,0.0037416338,0.31507817,0.000012365475,0.000011268831,0.000009317951,0.0000156202,0.0000063100765,0.000030617837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991378,0.00008053211,0.00038353674,0.00013457259,0.00014700703,0.00011654833],"domain_scores_gemma":[0.9970413,0.0016106864,0.00026771074,0.0009889852,0.0000574323,0.000033890235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024799895,0.0000812268,0.00023667041,0.00017952542,0.00007467987,0.000019094989,0.0010026894,0.00002877529,0.0000011028391],"category_scores_gemma":[0.0002541256,0.00007707687,0.000037336995,0.0007049271,0.0002030479,0.00023339805,0.0005642118,0.00010981846,0.000002334564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014759601,0.0005906887,0.0018121899,0.00040100713,0.000082847335,0.0000031943175,0.040960554,0.02770567,0.0042454437,0.61400247,0.0018245552,0.30835664],"study_design_scores_gemma":[0.00024401778,0.000050652467,0.002014712,0.00023091241,0.000006788334,0.000004911709,0.0006986708,0.8111036,0.0020154715,0.1824327,0.0010935009,0.00010408287],"about_ca_topic_score_codex":0.000058658334,"about_ca_topic_score_gemma":0.00006737719,"teacher_disagreement_score":0.7833979,"about_ca_system_score_codex":0.0000073136075,"about_ca_system_score_gemma":0.00003651805,"threshold_uncertainty_score":0.31431034},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001469407,0.009929545,0.9708924,0.0051510595,0.00021321127,0.00056011457,0.000004601796,0.0003340162,0.011445632],"genre_scores_gemma":[0.6085568,0.0016976625,0.38945276,0.000047064877,0.000006096469,0.00020036458,0.0000010362725,0.000008799378,0.000029408406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992997,0.000056158988,0.0002835561,0.00012819507,0.00011819551,0.00011419411],"domain_scores_gemma":[0.9937805,0.0044779233,0.00009296486,0.0015713434,0.00006460937,0.000012671666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079932174,0.00008013456,0.000120476456,0.00030429577,0.00011403353,0.000059852668,0.0021287892,0.000027373853,8.9891915e-7],"category_scores_gemma":[0.0005810906,0.000060406313,0.000058691203,0.00088828936,0.00006810025,0.00037525923,0.00040119936,0.00015694133,0.000004381504],"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":[6.4251134e-7,0.00008429749,0.0000034747238,0.00013500343,0.0000039787474,2.3816551e-7,0.0017084826,0.00006883447,0.0001976362,0.9807554,0.000110146735,0.016931858],"study_design_scores_gemma":[0.000025043068,0.000057282898,0.0000060261623,0.00059530913,0.0000036560853,0.0000027605686,0.00015616485,0.5159657,0.0011138687,0.47936907,0.0026435666,0.00006155518],"about_ca_topic_score_codex":0.000002186301,"about_ca_topic_score_gemma":0.000011977476,"teacher_disagreement_score":0.6070874,"about_ca_system_score_codex":0.000039679224,"about_ca_system_score_gemma":0.000024310137,"threshold_uncertainty_score":0.39558557},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18260522,0.029008092,0.7515184,0.0028724745,0.0006600054,0.00107142,0.000052157255,0.0004472255,0.03176498],"genre_scores_gemma":[0.8615847,0.0006131603,0.13772728,0.000022358887,0.000004600175,0.00003575428,0.000002866697,0.0000059837853,0.0000032732664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887085,0.00018886889,0.0004750153,0.0001576679,0.00018972934,0.000117862066],"domain_scores_gemma":[0.9964663,0.0015301915,0.00013594632,0.0017986236,0.000044888966,0.000024077512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007651615,0.00009853065,0.00022209334,0.00042112664,0.00004126903,0.00003835852,0.0021134398,0.000038095168,0.0000048571164],"category_scores_gemma":[0.00006472752,0.00008889027,0.000063201194,0.0008882897,0.00019734727,0.0009096257,0.00013874,0.00015906591,0.0000030899432],"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.0000022697202,0.0003291744,0.00034277892,0.00029657665,0.0000043177415,8.7192757e-7,0.0014472761,0.0024596292,0.0005729327,0.99107903,0.0000027758783,0.0034623719],"study_design_scores_gemma":[0.000096479394,0.00010807858,0.000115948365,0.0011342574,0.000004831144,0.0000010959269,0.0004812599,0.26708364,0.0012343084,0.72912806,0.000512927,0.000099115176],"about_ca_topic_score_codex":0.000006736333,"about_ca_topic_score_gemma":0.000090264904,"teacher_disagreement_score":0.6789795,"about_ca_system_score_codex":0.000022277422,"about_ca_system_score_gemma":0.000055681307,"threshold_uncertainty_score":0.39273322},"labels":[],"label_agreement":null}]}