{"meta":{"query_hash":"6ecf5e280fda","filters":{"venue":"Cryptography and Communications"},"cohort_total":41,"direct_labels_cover":0,"predictions_cover":41,"exported":41,"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/6ecf5e280fda","api":"https://metacan.xera.ac/api/v1/cohort?venue=Cryptography+and+Communications"},"results":[{"id":"W1055513040","doi":"10.1007/s12095-015-0141-x","title":"Enhanced criteria on differential uniformity and nonlinearity of cryptographically significant functions","year":2015,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Block cipher; S-box; Nonlinear system; Differential cryptanalysis; Differential (mechanical device); Cryptography; Mathematics; Linear cryptanalysis; Permutation (music); Substitution (logic); Discrete mathematics; Stream cipher; Pure mathematics; Algorithm; Computer science; Physics; Quantum mechanics","score_opus":0.04080440793990234,"score_gpt":0.2805707567951725,"score_spread":0.23976634885527018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1055513040","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.41136622,0.0004245384,0.58181185,0.0010048916,0.00016259612,0.00023654131,0.00004610383,0.00017337775,0.004773859],"genre_scores_gemma":[0.96756744,0.00036596056,0.031848542,0.00012136395,0.000021025364,0.00004171883,0.00002146849,0.000008017573,0.000004448124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860346,0.0002806911,0.0003418202,0.00034372424,0.00020878739,0.00022151138],"domain_scores_gemma":[0.9973455,0.00031701179,0.0001425647,0.0017071082,0.0002263872,0.00026143575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040537014,0.00019686713,0.0002584555,0.00041518375,0.00042618695,0.00013911907,0.001061382,0.00010285598,0.000011141266],"category_scores_gemma":[0.00006160403,0.000182262,0.0001437957,0.0010543183,0.0008507495,0.00028610945,0.0005971074,0.00030059877,0.0000021770213],"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.00007497512,0.00058377476,0.0029971066,0.000021185911,0.00008095268,4.4000606e-7,0.0012422394,0.0000028106242,0.0029037718,0.9730139,0.00011617596,0.018962711],"study_design_scores_gemma":[0.003977753,0.0029654696,0.12275014,0.0002830305,0.0002615641,0.000027607446,0.002600772,0.0118196495,0.0056193797,0.83874696,0.009404758,0.0015429144],"about_ca_topic_score_codex":0.00002566377,"about_ca_topic_score_gemma":0.000023863176,"teacher_disagreement_score":0.5562012,"about_ca_system_score_codex":0.000005516722,"about_ca_system_score_gemma":0.000046195222,"threshold_uncertainty_score":0.74324286},"labels":[],"label_agreement":null},{"id":"W1985780997","doi":"10.1007/s12095-015-0131-z","title":"Linear complexity profile and correlation measure of interleaved sequences","year":2015,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Measure (data warehouse); Correlation; Linear correlation; Distance correlation; Statistics; Mathematics; Computer science; Data mining; Geometry","score_opus":0.09925557996039795,"score_gpt":0.2913021286730739,"score_spread":0.19204654871267596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985780997","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.1448898,0.0060707573,0.83323306,0.0020319053,0.00015716054,0.00039055824,0.000025544554,0.0002447933,0.012956404],"genre_scores_gemma":[0.8837617,0.00016033526,0.11598122,0.000054753324,0.000007404392,0.00001811611,0.000010420958,0.0000033071358,0.0000027268586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914104,0.00024471566,0.00020559883,0.00017387638,0.00012757437,0.00010718015],"domain_scores_gemma":[0.99850595,0.00016029323,0.00011741474,0.0009248798,0.00018416764,0.00010728729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052920484,0.00009732119,0.00014263272,0.00017832161,0.00024888467,0.00005644996,0.0007690801,0.000051928746,0.0000037268246],"category_scores_gemma":[0.00004933106,0.00009087268,0.00005608847,0.00062041025,0.0008068885,0.00032048766,0.00040679265,0.00015004736,0.0000016270845],"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.000013596101,0.00007693583,0.010576011,0.000011264774,0.000029314944,1.6485468e-7,0.0035229975,0.000003148545,0.00020098491,0.9688298,0.00009958936,0.016636172],"study_design_scores_gemma":[0.00077125116,0.00037222353,0.021228064,0.00013183246,0.000045813125,0.000024397268,0.0019076979,0.032349773,0.000551162,0.93903065,0.0032502154,0.0003369363],"about_ca_topic_score_codex":0.00004415505,"about_ca_topic_score_gemma":0.00003389126,"teacher_disagreement_score":0.73887193,"about_ca_system_score_codex":0.000003971892,"about_ca_system_score_gemma":0.000032550524,"threshold_uncertainty_score":0.37056804},"labels":[],"label_agreement":null},{"id":"W1986968979","doi":"10.1007/s12095-011-0061-3","title":"Fault analysis of the NTRUSign digital signature scheme","year":2012,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Signature (topology); Digital signature; Discrete mathematics; NTRU; Transpose; Computer science; Combinatorics; Polynomial; Lattice (music); Mathematics; Algorithm; Physics; Cryptography; Computer security; Quantum mechanics; Mathematical analysis; Geometry","score_opus":0.021450423385992394,"score_gpt":0.2749272250956457,"score_spread":0.2534768017096533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986968979","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.51094216,0.01284183,0.4604293,0.005114133,0.00027557762,0.00063916715,0.00042391743,0.00020222766,0.009131655],"genre_scores_gemma":[0.97927046,0.00021520411,0.020288896,0.00016039581,0.000007678602,0.000020487507,0.000030207828,0.000002867357,0.0000037753866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.999261,0.00007928976,0.00021427135,0.00011573356,0.00015504143,0.00017464306],"domain_scores_gemma":[0.9978467,0.00016809479,0.000119213,0.0017065582,0.00008921194,0.00007022607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018395648,0.00008913522,0.00013614364,0.0003203759,0.0004396761,0.000113163296,0.0013505043,0.00004648161,0.000013139724],"category_scores_gemma":[0.000019222358,0.00006607879,0.00024864264,0.003731756,0.00028935468,0.0005168011,0.0006153169,0.00015747514,7.052554e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.2756486e-7,0.00016238025,0.15574482,0.0000033042827,0.000349498,1.6901648e-8,0.0026644063,0.0000026327557,0.0002587589,0.83174586,0.00014151783,0.008925977],"study_design_scores_gemma":[0.00036537557,0.00003436795,0.9262744,0.000017184451,0.00054116786,0.00000379818,0.0017897844,0.0075108395,0.00024076749,0.025160603,0.037712704,0.00034898636],"about_ca_topic_score_codex":0.000019077264,"about_ca_topic_score_gemma":0.000033313412,"teacher_disagreement_score":0.80658525,"about_ca_system_score_codex":0.000003891475,"about_ca_system_score_gemma":0.000015419388,"threshold_uncertainty_score":0.33816776},"labels":[],"label_agreement":null},{"id":"W2015875314","doi":"10.1007/s12095-013-0082-1","title":"A simple combinatorial treatment of constructions and threshold gaps of ramp schemes","year":2013,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Simple (philosophy); Code (set theory); Mathematical proof; Dual (grammatical number); Minimum distance; Mathematics; Nonlinear system; Algorithm; Computer science; Combinatorial design; Linear code; Discrete mathematics; Block code; Geometry; Decoding methods; Physics","score_opus":0.01868826974391217,"score_gpt":0.25166845567538865,"score_spread":0.23298018593147649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015875314","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.9680262,0.0069514476,0.019440718,0.00061461766,0.0001309204,0.00047749144,0.000027309037,0.00010119077,0.0042300774],"genre_scores_gemma":[0.9786192,0.0018697499,0.019404082,0.000016895305,0.00000767285,0.0000702887,0.0000065728027,0.0000039273755,0.0000016093558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993166,0.00007831997,0.0002476304,0.00015953199,0.00007820847,0.00011975037],"domain_scores_gemma":[0.9982707,0.0002404576,0.00012540499,0.0011681995,0.000120424455,0.00007479668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000086000844,0.00011065777,0.00020363684,0.0002143524,0.0002717595,0.000054961816,0.00052615104,0.00005107654,0.000017317312],"category_scores_gemma":[0.000009115716,0.000099994,0.00010838117,0.00056885066,0.0008630349,0.00023779883,0.00023601527,0.00006316145,7.0328934e-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.000004113296,0.00023585779,0.015746472,0.000011855431,0.00006816433,4.9538073e-8,0.00072762923,4.203116e-7,0.0013581687,0.9614412,0.00003219555,0.020373836],"study_design_scores_gemma":[0.001182261,0.00052570103,0.014756835,0.000038268776,0.0000605174,0.000010777488,0.00064237224,0.000930625,0.0047055525,0.96960926,0.0073263524,0.00021145133],"about_ca_topic_score_codex":0.000066731845,"about_ca_topic_score_gemma":0.0000060204375,"teacher_disagreement_score":0.020162385,"about_ca_system_score_codex":0.0000032280648,"about_ca_system_score_gemma":0.000021110707,"threshold_uncertainty_score":0.4077637},"labels":[],"label_agreement":null},{"id":"W2028643223","doi":"10.1007/s12095-013-0089-7","title":"Resilience to distinguishing attacks on WG-7 cipher and their generalizations","year":2013,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"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","keywords":"Stream cipher; Stream cipher attack; Computer science; Cipher; Cryptography; Correlation attack; Transposition cipher; Resilience (materials science); Computer security; Theoretical computer science; Arithmetic; Running key cipher; Mathematics; Encryption","score_opus":0.020968303989266152,"score_gpt":0.252730133834662,"score_spread":0.2317618298453958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028643223","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.2640152,0.0018094955,0.7001642,0.011273144,0.00013982343,0.0005980847,0.000014695181,0.00040693575,0.021578403],"genre_scores_gemma":[0.9566643,0.00027982096,0.041374296,0.0014811286,0.000020919399,0.00014328591,0.000005685861,0.000008546527,0.000022005956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902165,0.00016052794,0.00018558842,0.00032303348,0.00008867505,0.0002205434],"domain_scores_gemma":[0.99761814,0.0003630072,0.00005723092,0.0016718508,0.00010459718,0.00018514945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021177878,0.00015555495,0.00012728102,0.0002418411,0.0009960878,0.0004624203,0.0013010028,0.0000476048,0.000016789278],"category_scores_gemma":[0.000070222835,0.00013402579,0.0000628795,0.0010245158,0.00026670904,0.0003491212,0.0007115349,0.00016844699,0.000011600881],"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.0000017974312,0.000070416834,0.005221395,0.0000050196795,0.0000175525,1.3871555e-7,0.0026223103,0.000020655989,0.0004710334,0.93156236,0.0010297674,0.058977537],"study_design_scores_gemma":[0.00057139684,0.0004667744,0.15105559,0.0002769946,0.00003045978,0.000022520779,0.0020479595,0.0149313295,0.000750668,0.7314282,0.09722742,0.0011907079],"about_ca_topic_score_codex":0.000054218162,"about_ca_topic_score_gemma":0.00003760061,"teacher_disagreement_score":0.6926491,"about_ca_system_score_codex":0.0000050537888,"about_ca_system_score_gemma":0.0000116367455,"threshold_uncertainty_score":0.76612025},"labels":[],"label_agreement":null},{"id":"W2035522326","doi":"10.1007/s12095-014-0102-9","title":"Multidimensional meet-in-the-middle attack and its applications to KATAN32/48/64","year":2014,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"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","keywords":"Block cipher; Computer science; Key schedule; Key (lock); Block size; Cipher; Block (permutation group theory); Cryptography; Theoretical computer science; Computer security; Differential cryptanalysis; Arithmetic; Mathematics; Encryption","score_opus":0.06520715281484786,"score_gpt":0.3169153443027311,"score_spread":0.25170819148788326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035522326","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.2562012,0.006053728,0.6967719,0.031076608,0.00012303145,0.0022624407,0.000063658656,0.0002488933,0.0071985023],"genre_scores_gemma":[0.92487705,0.000523322,0.072731376,0.0013535919,0.00001743681,0.00046453302,0.000021852049,0.0000058986425,0.0000049134724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99881095,0.00021037948,0.00027356436,0.00030539176,0.00017442188,0.00022529611],"domain_scores_gemma":[0.9977747,0.00051781896,0.00006344104,0.0014269293,0.00009481905,0.0001222776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005499418,0.00013473295,0.00013210569,0.00030100622,0.00082103076,0.00015794109,0.0011816702,0.000044845507,0.000006381851],"category_scores_gemma":[0.000028864632,0.00011726004,0.000057466357,0.0012725219,0.00014920063,0.00024394499,0.0005226277,0.0001600747,0.000012291157],"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.00000153136,0.00012892764,0.0013245629,0.000008604221,0.0000101145715,1.3624448e-7,0.003138278,0.0000041271105,0.000108856155,0.9827823,0.00053367595,0.01195891],"study_design_scores_gemma":[0.0015991605,0.00021110667,0.07478236,0.00008269303,0.0000599024,0.00004632809,0.0040900204,0.029583538,0.00012946081,0.11666534,0.77186733,0.00088276085],"about_ca_topic_score_codex":0.00003849045,"about_ca_topic_score_gemma":0.00042783385,"teacher_disagreement_score":0.86611694,"about_ca_system_score_codex":0.000005637557,"about_ca_system_score_gemma":0.00001752728,"threshold_uncertainty_score":0.6314788},"labels":[],"label_agreement":null},{"id":"W2055296824","doi":"10.1007/s12095-009-0012-4","title":"A new distinguishing and key recovery attack on NGG stream cipher","year":2009,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stream cipher; Keystream; Stream cipher attack; Computer science; RC4; Key (lock); Computer security; Encryption; Theoretical computer science; Arithmetic; Mathematics","score_opus":0.036578378121658095,"score_gpt":0.282026855152945,"score_spread":0.24544847703128692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055296824","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.2525286,0.013764407,0.55145305,0.020038005,0.00038698566,0.00067692937,0.000026461574,0.0011891671,0.15993638],"genre_scores_gemma":[0.91203916,0.0008439601,0.08615862,0.00085837924,0.000041301013,0.000009167446,0.000007375627,0.000006713141,0.000035323068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999009,0.00013482035,0.000204052,0.00031683422,0.00011801364,0.00021728658],"domain_scores_gemma":[0.9977509,0.00033710117,0.00009007463,0.0016062838,0.000042109266,0.00017355055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025078614,0.00016657813,0.00015922773,0.00021264712,0.000650162,0.00038719364,0.0011093431,0.00006610222,0.000009910024],"category_scores_gemma":[0.000051248102,0.00016242822,0.00010514616,0.000722819,0.00014095787,0.00035440875,0.0003030225,0.0002558273,0.0000041190756],"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.000012782369,0.000085415944,0.001068174,0.0000033246788,0.000022109292,9.92581e-7,0.0009502977,0.0000032879288,0.0000530951,0.71808195,0.0011871852,0.27853137],"study_design_scores_gemma":[0.0007815951,0.0008125406,0.06596614,0.0002324039,0.00005199388,0.00003064289,0.0002985348,0.0010407579,0.00010850716,0.8652429,0.06477244,0.0006615284],"about_ca_topic_score_codex":0.000025350786,"about_ca_topic_score_gemma":0.000023486555,"teacher_disagreement_score":0.65951055,"about_ca_system_score_codex":0.000005783651,"about_ca_system_score_gemma":0.00002257898,"threshold_uncertainty_score":0.66236305},"labels":[],"label_agreement":null},{"id":"W2065586216","doi":"10.1007/s12095-013-0091-0","title":"Optimal parameters for the WG stream cipher family","year":2013,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"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","keywords":"Stream cipher; Cipher; Mathematics; Transformation (genetics); Exponent; Finite field; Degree (music); Discrete mathematics; Algebraic number; Sequence (biology); Transposition cipher; Algorithm; Combinatorics; Cryptography; Computer science; Mathematical analysis; Physics","score_opus":0.0336229700315679,"score_gpt":0.25574630739844845,"score_spread":0.22212333736688056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065586216","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.04999828,0.0045841266,0.9350504,0.0060253064,0.00013886798,0.00074916205,0.000011668869,0.00021523485,0.003226936],"genre_scores_gemma":[0.80676925,0.00072241423,0.19096497,0.0008139351,0.000014234999,0.0006853301,0.000006284435,0.000008232304,0.00001536121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991585,0.00010646058,0.00018128207,0.00022413998,0.00009287989,0.00023675313],"domain_scores_gemma":[0.9965764,0.0010457555,0.00007066146,0.0021155146,0.00010719253,0.000084473446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026052748,0.00013593478,0.00011413797,0.00011724489,0.0009798625,0.000378131,0.0022303616,0.000051860738,0.000012261262],"category_scores_gemma":[0.000021370835,0.00009955902,0.00019241888,0.00060379226,0.00046637683,0.00036715454,0.00045515885,0.000162808,0.000010505981],"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.0000050247704,0.00009998719,0.0007092892,0.000005891569,0.0001006331,6.156381e-8,0.000934642,0.00004684733,0.00020244946,0.8315063,0.0026416616,0.16374719],"study_design_scores_gemma":[0.0013070848,0.00051258225,0.045040518,0.00006880787,0.00017454455,0.000014062583,0.0040101777,0.059212673,0.00035987145,0.6804932,0.20783672,0.0009698063],"about_ca_topic_score_codex":0.000057086952,"about_ca_topic_score_gemma":0.000008763212,"teacher_disagreement_score":0.75677097,"about_ca_system_score_codex":0.0000034470568,"about_ca_system_score_gemma":0.000016312653,"threshold_uncertainty_score":0.75364095},"labels":[],"label_agreement":null},{"id":"W2073411533","doi":"10.1007/s12095-014-0101-x","title":"Revisiting iterated attacks in the context of decorrelation theory","year":2014,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Imperial Bank of Commerce (Canada)","funders":"","keywords":"Decorrelation; Iterated function; Stream cipher; Ciphertext; Computer science; Cipher; Plaintext; Mathematics; Theoretical computer science; Block cipher; Algorithm; Context (archaeology); Generalization; Discrete mathematics; Cryptography; Encryption; Computer security","score_opus":0.02313353761003308,"score_gpt":0.29160466073669583,"score_spread":0.26847112312666277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073411533","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.26241553,0.0019303198,0.7260624,0.003482185,0.000050662486,0.0003343865,0.000008816037,0.000054241802,0.0056614396],"genre_scores_gemma":[0.9852753,0.00032827532,0.013898723,0.00043457584,0.000007435898,0.000031811964,0.000020735753,0.0000024159604,6.8301233e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988286,0.00057890895,0.0002762576,0.00011950909,0.0000928457,0.0001039169],"domain_scores_gemma":[0.99784005,0.0009031706,0.00011626509,0.0010395988,0.00007962171,0.000021324133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011722527,0.000068831774,0.00009890058,0.0002026316,0.0002947389,0.000089225,0.0009094594,0.000030378495,0.000005060235],"category_scores_gemma":[0.00005561173,0.000054192107,0.00005748246,0.0009706773,0.00017242691,0.0002194701,0.00015367828,0.00014474546,0.0000010679179],"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.000001504664,0.00003375007,0.017414268,0.000005188128,0.000006443944,4.470581e-8,0.00653451,0.0000010221777,0.000033909964,0.8797396,0.000024519557,0.09620528],"study_design_scores_gemma":[0.0014071809,0.00015270767,0.4485294,0.00017225186,0.00004767867,0.000017291739,0.015689366,0.038388226,0.00011973758,0.46889478,0.026175076,0.00040630682],"about_ca_topic_score_codex":0.00004698776,"about_ca_topic_score_gemma":0.00008897278,"teacher_disagreement_score":0.7228598,"about_ca_system_score_codex":0.0000027131696,"about_ca_system_score_gemma":0.000009954582,"threshold_uncertainty_score":0.2266923},"labels":[],"label_agreement":null},{"id":"W2100535482","doi":"10.1007/s12095-010-0029-8","title":"Unbiased complex Hadamard matrices and bases","year":2010,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Advanced Photonic Communication Systems","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Hadamard transform; Complex Hadamard matrix; Hadamard matrix; Mathematics; Mutually unbiased bases; Order (exchange); Hadamard product; Hadamard's inequality; Combinatorics; Hadamard's maximal determinant problem; Pure mathematics; Mathematical analysis","score_opus":0.02123927109641836,"score_gpt":0.2520727094033488,"score_spread":0.23083343830693046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100535482","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.84852344,0.030867789,0.022654844,0.0025533293,0.0003937322,0.001136916,0.00023165952,0.0020680754,0.0915702],"genre_scores_gemma":[0.94811606,0.004477716,0.047182173,0.00006807233,0.000012334748,0.00008226783,0.000037287373,0.000017859085,0.0000062511417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994501,0.00004752737,0.00020249559,0.00010694818,0.00006504369,0.00012789729],"domain_scores_gemma":[0.9979263,0.00033737102,0.000040984563,0.0015559242,0.000045944806,0.000093483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011762902,0.00011976876,0.00013887395,0.00013680036,0.00033169807,0.00006859661,0.00051036687,0.000058049256,0.000038156562],"category_scores_gemma":[0.000017172682,0.0001264302,0.000038723832,0.00031540872,0.00034402768,0.00013850925,0.0001888505,0.0003072681,0.0000049160235],"study_design_candidate":"not_applicable","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.000032106702,0.00043029562,0.0760848,0.00047661245,0.00055132323,0.0000021242065,0.0063004773,0.00027154275,0.18963215,0.41751269,0.008431783,0.3002741],"study_design_scores_gemma":[0.0006842299,0.000027726292,0.063837744,0.0000579163,0.000056557994,0.000041265994,0.0012288659,0.027005466,0.0008715515,0.008186486,0.89745975,0.00054246746],"about_ca_topic_score_codex":0.000031357402,"about_ca_topic_score_gemma":0.0002526076,"teacher_disagreement_score":0.88902795,"about_ca_system_score_codex":0.0000040504187,"about_ca_system_score_gemma":0.000007071252,"threshold_uncertainty_score":0.51556736},"labels":[],"label_agreement":null},{"id":"W2116360492","doi":"10.1007/s12095-010-0039-6","title":"Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures","year":2010,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Secret sharing; Access structure; Overhead (engineering); Computer science; Converse; Decoding methods; Secure multi-party computation; Scheme (mathematics); Theoretical computer science; Context (archaeology); Mathematics; Cryptography; Algorithm","score_opus":0.02625024890392574,"score_gpt":0.2840280931100921,"score_spread":0.25777784420616634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116360492","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.45572683,0.0061460636,0.532769,0.002117333,0.00019407569,0.0006911284,0.0001719238,0.00028187627,0.001901754],"genre_scores_gemma":[0.6419705,0.001130575,0.35646176,0.00018876139,0.000036015183,0.000075000935,0.00012252887,0.0000116896545,0.0000031397808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998792,0.00006560382,0.00024324308,0.00046952124,0.00013520545,0.00029442413],"domain_scores_gemma":[0.9976784,0.00019392304,0.00008992492,0.0017471326,0.00007783729,0.0002127699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032582792,0.00020667516,0.00020751657,0.00022995174,0.001228466,0.0003749931,0.0015351367,0.0001749795,0.00002060033],"category_scores_gemma":[0.000016413858,0.00020036226,0.00013055159,0.00046158384,0.00035747094,0.0007843301,0.000564111,0.00050748576,4.4929538e-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.000016599737,0.00009780324,0.0042735767,0.000056209505,0.00005476264,4.0571874e-7,0.0017629194,0.0000013515595,0.004097596,0.9718457,0.00022018906,0.0175729],"study_design_scores_gemma":[0.0014341536,0.0001826664,0.031240696,0.000058607227,0.00011622726,0.00004027836,0.00040822857,0.03145043,0.0009693001,0.8382089,0.09518395,0.00070652115],"about_ca_topic_score_codex":0.000073392635,"about_ca_topic_score_gemma":0.0002750125,"teacher_disagreement_score":0.18624367,"about_ca_system_score_codex":0.0000036265008,"about_ca_system_score_gemma":0.00004000117,"threshold_uncertainty_score":0.9448492},"labels":[],"label_agreement":null},{"id":"W2125124709","doi":"10.1007/s12095-015-0134-9","title":"On encoding symbol degrees of array BP-XOR codes","year":2015,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Luby transform code; Low-density parity-check code; Fountain code; Encoding (memory); Decoding methods; Exclusive or; Computer science; Bitwise operation; Belief propagation; Arithmetic; Tornado code; Binary number; Symbol (formal); Algorithm; Theoretical computer science; Mathematics; Error floor","score_opus":0.0674218556422158,"score_gpt":0.30376916118930675,"score_spread":0.23634730554709094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125124709","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.070914164,0.0024736724,0.87883335,0.0017510434,0.000162176,0.00028514373,0.0000066887005,0.0007549604,0.044818785],"genre_scores_gemma":[0.76271725,0.0001796935,0.23697753,0.00007985393,0.0000052245096,0.00002946473,0.0000015941473,0.0000048385054,0.0000045668057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992071,0.00014456995,0.00019875405,0.00017270897,0.00014728689,0.00012957878],"domain_scores_gemma":[0.99745715,0.00041158058,0.0001184059,0.0017743773,0.00015122652,0.00008728868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038891294,0.00010179565,0.00014584733,0.00024116486,0.00019598285,0.000059914375,0.0016155558,0.000049851977,0.0000011533882],"category_scores_gemma":[0.000108783825,0.00009663594,0.00006607723,0.00058757875,0.00022483351,0.0002045629,0.0003368938,0.00017691423,0.000002764156],"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.0000063921825,0.00016974418,0.009110737,0.000012772289,0.000030844534,4.1462962e-7,0.0046970877,0.000020680865,0.0028393806,0.96656084,0.0010841871,0.015466889],"study_design_scores_gemma":[0.0018080043,0.0020939705,0.034759905,0.0012652252,0.00013398277,0.00007998694,0.0058956207,0.02609644,0.074840344,0.83271337,0.018391708,0.0019214177],"about_ca_topic_score_codex":0.000062774976,"about_ca_topic_score_gemma":0.000042072814,"teacher_disagreement_score":0.6918031,"about_ca_system_score_codex":0.000010267374,"about_ca_system_score_gemma":0.00003674586,"threshold_uncertainty_score":0.3940699},"labels":[],"label_agreement":null},{"id":"W2130959496","doi":"10.1007/s12095-009-0013-3","title":"On the structural weakness of the GGHN stream cipher","year":2009,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Keystream; Stream cipher; RC4; Computer science; State (computer science); Stream cipher attack; Cryptanalysis; Computation; Arithmetic; Algorithm; Cryptography; Theoretical computer science; Parallel computing; Mathematics","score_opus":0.019974549228413296,"score_gpt":0.2722364008669581,"score_spread":0.2522618516385448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130959496","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.9364769,0.0010710412,0.021135006,0.031807773,0.00015264911,0.0005313568,0.000027844824,0.00008554261,0.008711875],"genre_scores_gemma":[0.9952583,0.00013217104,0.003819214,0.0007589376,0.0000061725177,0.000016410631,0.0000028048032,0.0000021501185,0.00000387063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926394,0.0001545053,0.0001830552,0.00012577225,0.00014841797,0.00012429956],"domain_scores_gemma":[0.9975206,0.0002632338,0.00010015289,0.0020159807,0.000068849455,0.00003114354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016150052,0.00008956523,0.000083147934,0.00007534614,0.00080545375,0.00008947016,0.0018644619,0.000027948205,0.000016800488],"category_scores_gemma":[0.000017044104,0.00005031433,0.00011628748,0.0009019069,0.0003199947,0.00012097021,0.00025968644,0.00017171846,6.0041464e-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.0000013425239,0.000042645053,0.001503234,0.0000011234866,0.000012724774,2.7147093e-8,0.0011611506,0.000002275366,0.00007526367,0.9811587,0.00027063137,0.015770912],"study_design_scores_gemma":[0.00026779284,0.000100165176,0.3038108,0.000027046544,0.000020259262,0.000004499108,0.00084303593,0.0016898522,0.00035202608,0.6896492,0.0030916221,0.00014365351],"about_ca_topic_score_codex":0.00003655048,"about_ca_topic_score_gemma":0.00007098668,"teacher_disagreement_score":0.30230758,"about_ca_system_score_codex":0.0000033481997,"about_ca_system_score_gemma":0.000019215482,"threshold_uncertainty_score":0.6194981},"labels":[],"label_agreement":null},{"id":"W2140046536","doi":"10.1007/s12095-015-0125-x","title":"Extended results on privacy against coalitions of users in user-private information retrieval protocols","year":2015,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Anonymity; Private information retrieval; Probabilistic logic; Differential privacy; Information retrieval; Identity (music); Set (abstract data type); Computer security; Database; Data mining","score_opus":0.07438507081949432,"score_gpt":0.3265853601268155,"score_spread":0.2522002893073212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140046536","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.36108243,0.0007646362,0.39210653,0.16588335,0.00040806652,0.030764995,0.0011956792,0.0035910131,0.04420331],"genre_scores_gemma":[0.66760796,0.00032487878,0.33067253,0.00023985986,0.0000045426455,0.0009998129,0.00014213045,0.0000067255155,0.0000015731101],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850124,0.0002035178,0.0005835731,0.00021927796,0.00027802048,0.0002143493],"domain_scores_gemma":[0.98741543,0.0002910349,0.0002954833,0.011717357,0.0001912109,0.00008947884],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00083485094,0.00013847127,0.00018288987,0.0006043474,0.00016768818,0.00013755933,0.015427071,0.00012118953,4.827278e-7],"category_scores_gemma":[0.0073335217,0.00013910205,0.000052469764,0.0017516816,0.0003852141,0.0015081173,0.020000583,0.00035907663,0.000006082711],"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.00037015046,0.0011251639,0.009353048,0.00010233214,0.00008331708,0.0000025169118,0.0044311155,0.0000749522,0.0005440347,0.90414417,0.03929386,0.04047536],"study_design_scores_gemma":[0.004479328,0.0005958215,0.056103867,0.0006447026,0.00001323938,0.0000059661825,0.0009490069,0.022673776,0.0045373966,0.8261348,0.08325282,0.0006092978],"about_ca_topic_score_codex":0.000025504807,"about_ca_topic_score_gemma":0.000010255364,"teacher_disagreement_score":0.30652553,"about_ca_system_score_codex":0.00004016361,"about_ca_system_score_gemma":0.00009207083,"threshold_uncertainty_score":0.98989993},"labels":[],"label_agreement":null},{"id":"W2148201159","doi":"10.1007/s12095-010-0019-x","title":"Asymptotic enumeration of correlation-immune boolean functions","year":2010,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Boolean function; Mathematics; Combinatorics; Parity function; Function (biology); Discrete mathematics; Maximum satisfiability problem; Boolean data type; Order (exchange); Boolean expression","score_opus":0.008518214191220884,"score_gpt":0.22122794436111445,"score_spread":0.21270973016989356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148201159","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.12719603,0.0012252867,0.8547583,0.0012474419,0.0005519015,0.0002764169,0.000018666899,0.00023693976,0.014489016],"genre_scores_gemma":[0.95664823,0.0001370573,0.04304063,0.000061734856,0.000017810074,0.000036360652,0.000030647265,0.000006320855,0.000021179692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991422,0.0001022632,0.0003019246,0.00019542575,0.00011912003,0.00013901135],"domain_scores_gemma":[0.9974454,0.00027245298,0.00014972509,0.0019157648,0.00014142152,0.0000752029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033932575,0.00011586209,0.00013754575,0.0003161518,0.00061661593,0.00009692059,0.0010503271,0.00008138859,0.000036018115],"category_scores_gemma":[0.000044080574,0.00011935893,0.0001387343,0.00096649287,0.00040319414,0.00042871854,0.00029750765,0.00034219289,0.000009911046],"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.000003646125,0.000102335056,0.0051464443,0.000006155241,0.000033232627,8.0097884e-8,0.00072280114,0.000015900725,0.00511437,0.96169186,0.000058848065,0.027104352],"study_design_scores_gemma":[0.0015692214,0.0004839453,0.18233363,0.00012208814,0.00021117028,0.00006539175,0.001004496,0.04864847,0.003441344,0.6963764,0.06465271,0.0010911704],"about_ca_topic_score_codex":0.000017631963,"about_ca_topic_score_gemma":0.000043291653,"teacher_disagreement_score":0.8294522,"about_ca_system_score_codex":0.000003175781,"about_ca_system_score_gemma":0.00003807676,"threshold_uncertainty_score":0.4867316},"labels":[],"label_agreement":null},{"id":"W2284443012","doi":"10.1007/s12095-016-0208-3","title":"Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences","year":2016,"lang":"en","type":"preprint","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Character (mathematics); Autocorrelation; Stream cipher; Cipher; Algorithm; Cryptography; Binary number; Mathematics; Sequence (biology); Computer science; Discrete mathematics; Arithmetic; Statistics; Encryption","score_opus":0.02833204586572379,"score_gpt":0.2651129283421842,"score_spread":0.2367808824764604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2284443012","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.5468581,0.03919182,0.27214074,0.06426697,0.003840672,0.0035696912,0.00066453626,0.0012101299,0.06825739],"genre_scores_gemma":[0.98475355,0.0022354277,0.012381619,0.0003965583,0.000056018634,0.00012544294,0.000010149226,0.000014473197,0.00002678737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781847,0.0006127069,0.00050454703,0.0004967466,0.00029006583,0.0002774566],"domain_scores_gemma":[0.99280155,0.00047781432,0.0005189154,0.0058848397,0.00021786854,0.00009902632],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0006195752,0.00031581544,0.00036225753,0.00033035545,0.0006833759,0.0002187799,0.006819507,0.00021992392,0.000016595757],"category_scores_gemma":[0.0000393189,0.00020965737,0.000543879,0.0007228442,0.0015046311,0.00021334752,0.005623914,0.0006303356,0.000004223646],"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.000005728182,0.000109969515,0.007914962,0.00006251503,0.00016115289,2.7795974e-7,0.0017613638,0.0000017370847,0.0010171286,0.9711236,0.00024656745,0.017595014],"study_design_scores_gemma":[0.00016829095,0.000039390074,0.028506612,0.00058744213,0.00007699249,0.0000069978573,0.000117626994,0.00018550466,0.001082181,0.95898867,0.009872191,0.0003681075],"about_ca_topic_score_codex":0.000030300678,"about_ca_topic_score_gemma":0.00001991795,"teacher_disagreement_score":0.43789548,"about_ca_system_score_codex":0.000011162223,"about_ca_system_score_gemma":0.00012017234,"threshold_uncertainty_score":0.99855405},"labels":[],"label_agreement":null},{"id":"W2293795016","doi":"10.1007/s12095-015-0178-x","title":"A new class of Fibonacci sequence based error correcting codes","year":2016,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Fibonacci number; Parity-check matrix; Mathematics; Combinatorics; Decoding methods; Matrix (chemical analysis); Integer matrix; Error detection and correction; Integer (computer science); Discrete mathematics; Inverse; Binary number; Class (philosophy); Sequence (biology); Low-density parity-check code; Arithmetic; Algorithm; Computer science; Nonnegative matrix; Symmetric matrix; Physics","score_opus":0.03790508481512996,"score_gpt":0.3152612926342888,"score_spread":0.2773562078191589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293795016","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.013551997,0.00013286293,0.9720216,0.001720094,0.0000135302225,0.00014504127,0.00007424805,0.00003496732,0.012305705],"genre_scores_gemma":[0.90828294,0.000021422742,0.09152757,0.000027908938,0.000016253018,0.000051222585,0.000009238595,0.0000065199533,0.000056943936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995368,0.000028861696,0.0001771853,0.00010406292,0.000048496855,0.00010458588],"domain_scores_gemma":[0.99852705,0.0005570006,0.00010672915,0.00068451324,0.000055381057,0.00006934607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000064542815,0.00007809276,0.00012251342,0.00003782976,0.00019163846,0.000011905122,0.00029178956,0.000018607188,0.00014007416],"category_scores_gemma":[0.000013149156,0.000056607423,0.00007352322,0.00022461134,0.00024323314,0.00007254889,0.00008785983,0.000061571634,0.0000037312693],"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.000003254738,0.000048912123,0.0039234385,0.0000050551025,0.000016798656,8.364922e-9,0.000081730985,0.000002224339,0.0024082474,0.9020484,0.00008762103,0.09137428],"study_design_scores_gemma":[0.00041393845,0.000030295636,0.0008320622,0.0001396364,0.000038222242,4.0667618e-7,0.0007882168,0.0003499805,0.0061450074,0.9782182,0.01287817,0.00016584048],"about_ca_topic_score_codex":0.00003176496,"about_ca_topic_score_gemma":0.000003286603,"teacher_disagreement_score":0.8947309,"about_ca_system_score_codex":0.0000031133072,"about_ca_system_score_gemma":0.000031021467,"threshold_uncertainty_score":0.23083837},"labels":[],"label_agreement":null},{"id":"W2612667250","doi":"10.1007/s12095-018-0300-y","title":"A lower bound on the 2-adic complexity of the modified Jacobi sequence","year":2018,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Fundamental Research Funds for the Central Universities; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Sequence (biology); Mathematics; Gauss; Upper and lower bounds; Combinatorics; Discrete mathematics; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.10689209376763982,"score_gpt":0.29245332446002376,"score_spread":0.18556123069238395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612667250","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.73764414,0.0014671006,0.14590825,0.03364762,0.00065852236,0.00096906896,0.000057840174,0.00029275968,0.07935468],"genre_scores_gemma":[0.9954916,0.00011067559,0.0031723336,0.001152535,0.00001994126,0.000037326434,0.0000012283724,0.000004901994,0.000009409724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988581,0.0003817242,0.00020202906,0.00020589317,0.0001740325,0.00017820341],"domain_scores_gemma":[0.99574506,0.0004392198,0.00013311482,0.0035039042,0.00012807561,0.00005064223],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0004849225,0.00012472188,0.00011812039,0.00010261604,0.0014374331,0.00012110652,0.0035693008,0.00004600602,0.000020245121],"category_scores_gemma":[0.000041203482,0.00007512157,0.00017336382,0.001406779,0.004168596,0.00013811249,0.00082192576,0.00025116408,0.0000059068293],"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.0000087473345,0.000096752585,0.0003430838,0.0000029308649,0.000026171967,6.502059e-8,0.0009194221,8.3548605e-7,0.000577452,0.99464285,0.0002445352,0.0031371652],"study_design_scores_gemma":[0.0001919403,0.00019967616,0.015391289,0.00007957648,0.000023027398,0.0000061803703,0.00017134355,0.0027377212,0.0012791529,0.97067463,0.009070066,0.00017538205],"about_ca_topic_score_codex":0.00003504654,"about_ca_topic_score_gemma":0.00006342391,"teacher_disagreement_score":0.2578475,"about_ca_system_score_codex":0.0000056522913,"about_ca_system_score_gemma":0.00003439222,"threshold_uncertainty_score":0.99986255},"labels":[],"label_agreement":null},{"id":"W2624155812","doi":"10.1007/s12095-017-0233-x","title":"The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation","year":2017,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Science Foundation of Shandong Province","keywords":"Autocorrelation; Pseudorandom binary sequence; Mathematics; Binary number; Sequence (biology); Complementary sequences; Class (philosophy); Distribution (mathematics); Stream cipher; Autocorrelation matrix; Combinatorics; Discrete mathematics; Time complexity; Algorithm; Cryptography; Computer science; Statistics; Arithmetic; Mathematical analysis","score_opus":0.03889153615739618,"score_gpt":0.2767834628078698,"score_spread":0.23789192665047362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2624155812","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.63121897,0.0018664874,0.3607044,0.0032807721,0.00008861298,0.0007065044,0.000063068874,0.00009579555,0.001975378],"genre_scores_gemma":[0.9859459,0.00054793566,0.013405264,0.000008806517,0.000005386429,0.00005078899,0.000029375806,0.0000038284643,0.000002745703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.999068,0.00019578704,0.0002669401,0.00018657146,0.00014944917,0.00013323568],"domain_scores_gemma":[0.99718523,0.0003763301,0.0004817288,0.0017553718,0.00014731931,0.000054036627],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.00052831136,0.00011698764,0.00015581356,0.00008833462,0.0020638134,0.0001827666,0.0012373903,0.00006022655,0.0000015995814],"category_scores_gemma":[0.00004529404,0.000086148975,0.000070268856,0.0003282612,0.0029695635,0.0005861986,0.0004376844,0.00017622084,2.5762557e-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.00003940711,0.00007042112,0.031638257,0.00001563527,0.000045537618,1.8720779e-7,0.0006848994,0.000037508733,0.0002678574,0.9487461,0.000016447124,0.01843775],"study_design_scores_gemma":[0.0005504471,0.00045395203,0.81859297,0.00016896674,0.000067786525,0.000015999693,0.000462122,0.059536535,0.00024355213,0.117746785,0.0019495921,0.00021132111],"about_ca_topic_score_codex":0.00007608389,"about_ca_topic_score_gemma":0.000056293982,"teacher_disagreement_score":0.8309993,"about_ca_system_score_codex":0.0000062287218,"about_ca_system_score_gemma":0.000039855342,"threshold_uncertainty_score":0.99974376},"labels":[],"label_agreement":null},{"id":"W2745796023","doi":"10.1007/s12095-017-0253-6","title":"Security of BLS and BGLS signatures in a multi-user setting","year":2017,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":23,"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":"Horizon 2020 Framework Programme; University of Waterloo; European Commission","keywords":"Computer science; Chemistry","score_opus":0.02860318381621792,"score_gpt":0.30377426839742083,"score_spread":0.27517108458120293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745796023","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.7783303,0.030791447,0.17564243,0.0061282953,0.00019992278,0.001007953,0.00022548408,0.00024181651,0.0074323183],"genre_scores_gemma":[0.920273,0.0020070786,0.07760405,0.000078558456,0.000004868557,0.000022310698,0.000005503306,0.0000037947773,8.437426e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991176,0.00012002358,0.00023768275,0.00025503043,0.00009724588,0.000172415],"domain_scores_gemma":[0.9968278,0.00021684842,0.0001930736,0.002620061,0.000063642714,0.00007860295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000411185,0.000119991106,0.0001803133,0.00023308111,0.00069952384,0.00024415163,0.0019317736,0.00008825435,0.0000024413712],"category_scores_gemma":[0.000082192084,0.000118746335,0.0000704582,0.0002692731,0.0006673874,0.00069461577,0.0014158463,0.00028509102,2.9959816e-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.0000054007974,0.00023005356,0.10768931,0.000038114114,0.000026208458,0.0000011830232,0.0035245775,0.0000010468567,0.0003423787,0.8785597,0.00010107175,0.009480921],"study_design_scores_gemma":[0.0013387168,0.00006849961,0.81852543,0.00019463293,0.000025518058,0.0000058108963,0.0007106149,0.006130642,0.00061675,0.16287623,0.009102767,0.0004043695],"about_ca_topic_score_codex":0.00020707116,"about_ca_topic_score_gemma":0.0006339765,"teacher_disagreement_score":0.7156835,"about_ca_system_score_codex":0.0000023940977,"about_ca_system_score_gemma":0.000018438948,"threshold_uncertainty_score":0.53802425},"labels":[],"label_agreement":null},{"id":"W2757847923","doi":"10.1007/s12095-017-0256-3","title":"Characteristic digit-sum sequences","year":2017,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Finite field; Autocorrelation; Complementary sequences; Binary number; Mathematics; Numerical digit; Nonlinear system; Primitive polynomial; Sequence (biology); Discrete mathematics; Combinatorics; Arithmetic; Statistics; Biology; Physics; Genetics","score_opus":0.03788298953616897,"score_gpt":0.2873308536251481,"score_spread":0.24944786408897912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757847923","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.3289704,0.00638813,0.4516016,0.029061664,0.0011286517,0.0007730598,0.00007574141,0.0013525647,0.1806482],"genre_scores_gemma":[0.9811884,0.0010758436,0.01741202,0.00022363222,0.000024035116,0.000045036242,0.000006399493,0.0000052836194,0.000019335634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991957,0.00008553284,0.00016727866,0.00024963537,0.00010308427,0.00019877538],"domain_scores_gemma":[0.99541277,0.00014875668,0.0001652644,0.0041017276,0.00006229946,0.00010918101],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00022108135,0.00012748722,0.0001356122,0.00014324451,0.0025148925,0.0010703806,0.0040636663,0.00005015138,0.000010441323],"category_scores_gemma":[0.000051399387,0.0001203966,0.00011173609,0.00019990439,0.00082813884,0.00087969686,0.0011217603,0.00017518457,0.000013273634],"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.0000022400732,0.000050445684,0.010101264,0.0000056568097,0.000024783823,0.0000010926126,0.00038650143,6.4946974e-8,0.00021365845,0.8978069,0.000068025285,0.091339365],"study_design_scores_gemma":[0.00032651724,0.00010352466,0.20042974,0.00008247268,0.00003217372,0.00002545778,0.00013762772,0.0007077483,0.00037046504,0.71877307,0.07854818,0.00046304194],"about_ca_topic_score_codex":0.000025460013,"about_ca_topic_score_gemma":0.000019839541,"teacher_disagreement_score":0.652218,"about_ca_system_score_codex":0.0000033702327,"about_ca_system_score_gemma":0.000021333199,"threshold_uncertainty_score":0.9999666},"labels":[],"label_agreement":null},{"id":"W2791996780","doi":"10.1007/s12095-018-0292-7","title":"Compositional inverses of permutation polynomials of the form xrh(xs) over finite fields","year":2018,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Key Research and Development Program of China; Program for New Century Excellent Talents in University","keywords":"Permutation (music); Finite field; Mathematics; Combinatorics; Polynomial; Inverse; Discrete mathematics; Cyclic permutation; Field (mathematics); Permutation matrix; Pure mathematics; Symmetric group; Physics","score_opus":0.019065109459526768,"score_gpt":0.2589763174456607,"score_spread":0.2399112079861339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791996780","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.7702626,0.0008902376,0.21342143,0.0024745802,0.00024775128,0.0002994135,0.000064459346,0.000069945316,0.012269577],"genre_scores_gemma":[0.98823655,0.00012729666,0.011312975,0.00028046622,0.00001716945,0.000012503726,0.0000062759073,0.0000029580183,0.0000038379217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992961,0.00013367325,0.00023501832,0.00011643791,0.0001247442,0.00009399411],"domain_scores_gemma":[0.998127,0.00039161154,0.00017302096,0.0011305381,0.00014552384,0.00003230246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002069628,0.000078608435,0.00011519306,0.00015487104,0.00038807053,0.00003104827,0.0011517182,0.00005143589,0.000026180061],"category_scores_gemma":[0.000025872663,0.00006335338,0.00014890461,0.0007085735,0.0007569667,0.00021689452,0.00044273605,0.00009931812,9.62409e-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.000013180327,0.00011001068,0.009207386,0.000013891728,0.00004688478,2.88907e-8,0.0027169888,0.0000032635676,0.002911336,0.97861606,0.00021167076,0.006149272],"study_design_scores_gemma":[0.00089874136,0.0004308589,0.19408792,0.00021523255,0.00009458161,0.000008665864,0.0006117236,0.005272035,0.027247796,0.7615936,0.00918753,0.00035134683],"about_ca_topic_score_codex":0.000032383443,"about_ca_topic_score_gemma":0.00004486197,"teacher_disagreement_score":0.21797392,"about_ca_system_score_codex":0.0000030166884,"about_ca_system_score_gemma":0.000030510708,"threshold_uncertainty_score":0.2984764},"labels":[],"label_agreement":null},{"id":"W2800569707","doi":"10.1007/s12095-018-0301-x","title":"Error analysis of weak Poly-LWE instances","year":2018,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Learning with errors; Gaussian; Encryption; Distribution (mathematics); Error detection and correction; Algorithm; Computer science; Error analysis; Algebraic number; Mathematics; Cryptography; Applied mathematics; Physics; Mathematical analysis","score_opus":0.03121228252270323,"score_gpt":0.2987014544463359,"score_spread":0.26748917192363264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800569707","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.080608666,0.015429063,0.8576781,0.0020576513,0.00018015146,0.0002430509,0.0002322549,0.0002857508,0.043285277],"genre_scores_gemma":[0.8984308,0.0012440344,0.10010885,0.00014307763,0.0000128714255,0.000015737267,0.000040022413,0.000003154173,0.0000014155445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99901474,0.000121794576,0.00028437393,0.00025549976,0.00015112964,0.00017249603],"domain_scores_gemma":[0.9967883,0.00018317712,0.00015016874,0.0026351847,0.00015178732,0.00009136097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002549448,0.000115115734,0.0002329527,0.0007925073,0.0004612994,0.000089173045,0.0019752919,0.000064100495,0.000025734318],"category_scores_gemma":[0.000018084416,0.00010982024,0.00019365922,0.0048885825,0.0010190309,0.00044397198,0.00061349233,0.00013588049,0.0000030864128],"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.0000048163984,0.00014021274,0.016931234,0.00000503397,0.0003787989,8.801709e-8,0.0014899594,2.7799746e-7,0.0001352421,0.9619247,0.00021950783,0.018770158],"study_design_scores_gemma":[0.0008743436,0.00048523257,0.53561753,0.000077051576,0.0013783242,0.0000064152164,0.002609814,0.019233126,0.0012906244,0.22106074,0.2164278,0.0009389648],"about_ca_topic_score_codex":0.00011447314,"about_ca_topic_score_gemma":0.0007344985,"teacher_disagreement_score":0.81782216,"about_ca_system_score_codex":0.0000029501941,"about_ca_system_score_gemma":0.000024302439,"threshold_uncertainty_score":0.44783393},"labels":[],"label_agreement":null},{"id":"W2890991810","doi":"10.1007/s12095-019-00384-4","title":"Unicyclic strong permutations","year":2019,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Combinatorics; Mathematics","score_opus":0.01529905154711339,"score_gpt":0.24889155304962726,"score_spread":0.23359250150251387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890991810","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.22038077,0.0057080323,0.6360528,0.008032753,0.0003401436,0.0006552441,0.000020464706,0.00084961124,0.12796022],"genre_scores_gemma":[0.9692541,0.0004126181,0.029963307,0.00026256486,0.0000086983555,0.000039082814,0.000012629756,0.0000067707188,0.000040277333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914557,0.0001392868,0.00017097451,0.00024572134,0.00010618118,0.0001922806],"domain_scores_gemma":[0.9973059,0.00025329585,0.00006337276,0.0022271997,0.000058760474,0.000091432645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020256688,0.000116411,0.00012277384,0.00027086807,0.00045514066,0.00017620937,0.0016355246,0.000048809765,0.00004291243],"category_scores_gemma":[0.000009785009,0.000117641815,0.000118247626,0.0009753162,0.00020285521,0.00044934658,0.0005485757,0.00019801385,0.000055155866],"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.0000014031672,0.000054102835,0.0068880743,0.0000047501508,0.0000242472,1.5127505e-7,0.0006285597,0.0000044682583,0.00020289549,0.97713923,0.0000585827,0.014993552],"study_design_scores_gemma":[0.0009569242,0.00024699193,0.06427123,0.00008093831,0.0000543535,0.00003187956,0.0015581824,0.010642365,0.00019669767,0.7796491,0.14155506,0.0007562743],"about_ca_topic_score_codex":0.000009763351,"about_ca_topic_score_gemma":0.000011419984,"teacher_disagreement_score":0.7488733,"about_ca_system_score_codex":0.000005140659,"about_ca_system_score_gemma":0.000023199083,"threshold_uncertainty_score":0.4797294},"labels":[],"label_agreement":null},{"id":"W2902893142","doi":"10.1007/s12095-019-00386-2","title":"New constructions of involutions over finite fields","year":2019,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Finite field; Mathematics; Combinatorics; Permutation (music); Coding theory; Multiplicative function; Discrete mathematics; Field (mathematics); Inverse; Pure mathematics; Physics; Mathematical analysis; Geometry","score_opus":0.012569949773552767,"score_gpt":0.23385835745186695,"score_spread":0.22128840767831418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902893142","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.057720862,0.0024861547,0.9101858,0.0015278022,0.0002667452,0.00024395762,0.000018521716,0.0001831064,0.027367057],"genre_scores_gemma":[0.9064962,0.000482419,0.09279461,0.00015057981,0.000010205811,0.000011404216,0.000006222414,0.0000040493965,0.00004429117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992807,0.00008752784,0.00021552753,0.00018262924,0.00009537184,0.0001382337],"domain_scores_gemma":[0.997526,0.00039161972,0.000094893374,0.0018310312,0.00006491205,0.000091557005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013051459,0.00009854831,0.00013927872,0.0002924669,0.00025426064,0.00005716818,0.0011216145,0.000069054855,0.0001024463],"category_scores_gemma":[0.000017118575,0.00010144072,0.00014387444,0.0010646753,0.0002438886,0.00030457348,0.00044717223,0.000185717,0.000010533081],"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.000002514931,0.000041043633,0.014193775,0.000007038067,0.000035303183,5.2920655e-8,0.0005649948,0.0000105874315,0.00020995083,0.9706504,0.00035475646,0.013929599],"study_design_scores_gemma":[0.0007970422,0.00019284993,0.036466435,0.000093959294,0.000051149946,0.000013960749,0.00047824052,0.0035428198,0.00039478985,0.9075544,0.050032623,0.00038175684],"about_ca_topic_score_codex":0.000060965718,"about_ca_topic_score_gemma":0.00003730853,"teacher_disagreement_score":0.8487753,"about_ca_system_score_codex":0.000003240563,"about_ca_system_score_gemma":0.000054571323,"threshold_uncertainty_score":0.41366324},"labels":[],"label_agreement":null},{"id":"W3086805570","doi":"10.1007/s12095-021-00490-2","title":"Kim-type APN functions are affine equivalent to Gold functions","year":2021,"lang":"en","type":"preprint","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Type (biology); Permutation (music); Affine transformation; Combinatorics; Mathematics; Function (biology); Physics; Pure mathematics","score_opus":0.04773061018136424,"score_gpt":0.27858215718456353,"score_spread":0.2308515470031993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3086805570","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.03948375,0.013632387,0.89479387,0.016825099,0.0032724855,0.001263594,0.0002552626,0.0014397432,0.029033795],"genre_scores_gemma":[0.9280721,0.0033952876,0.06561815,0.0012596687,0.00017985856,0.00063149066,0.00041693012,0.000047737285,0.00037876717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970605,0.00046969915,0.0005797455,0.0010522448,0.0003372686,0.0005005553],"domain_scores_gemma":[0.9911398,0.00039004252,0.00029269815,0.007165091,0.0005883684,0.00042397727],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004849102,0.00051298476,0.00052851724,0.0010163254,0.0011655866,0.000983578,0.0037336065,0.00029517704,0.00009241694],"category_scores_gemma":[0.000102150254,0.0005655131,0.00057110866,0.0033088366,0.00037077142,0.0004058893,0.00781235,0.0012851006,0.00005710708],"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.00010331658,0.0031593808,0.00868143,0.00044833228,0.001895014,0.00002210307,0.008838974,0.0013599253,0.0012776775,0.74077314,0.03131815,0.20212258],"study_design_scores_gemma":[0.0017529109,0.0010762877,0.09985293,0.002841468,0.0014132424,0.00014914961,0.012258116,0.0050968034,0.0003201955,0.14415419,0.72549254,0.0055921436],"about_ca_topic_score_codex":0.00006226034,"about_ca_topic_score_gemma":0.0003822608,"teacher_disagreement_score":0.88858837,"about_ca_system_score_codex":0.000040906354,"about_ca_system_score_gemma":0.00017359918,"threshold_uncertainty_score":0.9996796},"labels":[],"label_agreement":null},{"id":"W3121786052","doi":"10.1007/s12095-020-00469-5","title":"Quiescent photonics side channel analysis: Low cost SRAM readout attack","year":2021,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Integrated Circuits and Semiconductor Failure Analysis","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Photonics; Static random-access memory; Channel (broadcasting); Computer science; Substrate (aquarium); Flash (photography); Optoelectronics; Photon; Computer hardware; Embedded system; Materials science; Optics; Telecommunications; Physics","score_opus":0.025129568954345673,"score_gpt":0.2511682808218927,"score_spread":0.226038711867547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121786052","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.6616343,0.109712355,0.068712115,0.0037857848,0.0007524954,0.0011394109,0.00068336364,0.0020770733,0.15150307],"genre_scores_gemma":[0.9888615,0.009215411,0.0011607785,0.00020796995,0.000015960743,0.00006333602,0.00040097334,0.000021483218,0.000052570766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990543,0.00007317357,0.00029988345,0.0002088211,0.000115436575,0.00024838868],"domain_scores_gemma":[0.99803394,0.00007915225,0.000045311488,0.0015287243,0.00019231465,0.00012055449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000104271145,0.00018592688,0.00031220354,0.00032904814,0.00028916486,0.00013799938,0.0004172999,0.00011660413,0.00008118841],"category_scores_gemma":[0.000015765421,0.00018909188,0.0003271921,0.0021822217,0.00014293431,0.00011823317,0.00008433464,0.00034984798,0.00001450045],"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.00007035889,0.0046470147,0.049419567,0.0012054493,0.097026154,0.00015709532,0.045640733,0.20424774,0.10667926,0.29273394,0.046815056,0.15135762],"study_design_scores_gemma":[0.0017036862,0.00007535356,0.015374189,0.0004157491,0.011666154,0.000059060654,0.024374634,0.54991597,0.027963312,0.005394322,0.3600535,0.0030040543],"about_ca_topic_score_codex":0.00005556898,"about_ca_topic_score_gemma":0.001101971,"teacher_disagreement_score":0.34566823,"about_ca_system_score_codex":0.00002581059,"about_ca_system_score_gemma":0.000028969815,"threshold_uncertainty_score":0.7710943},"labels":[],"label_agreement":null},{"id":"W3209060430","doi":"10.1007/s12095-022-00580-9","title":"Construction of APN permutations via Walsh zero spaces","year":2022,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subspace topology; Combinatorics; Mathematics; Zero (linguistics); Space (punctuation); Vector space; Inverse; Affine transformation; Affine space; Discrete mathematics; Pure mathematics; Mathematical analysis; Geometry; Computer science","score_opus":0.015044641152424142,"score_gpt":0.23563386381277215,"score_spread":0.220589222660348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209060430","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.06037271,0.0028512757,0.9220455,0.0031130484,0.00022006988,0.00025795598,0.000047727463,0.00023295477,0.010858705],"genre_scores_gemma":[0.92953587,0.0002574532,0.069942564,0.00012413504,0.0000052859027,0.00010593198,0.00001865964,0.0000052990363,0.0000048297766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896914,0.00029540723,0.00023205689,0.00019958286,0.00016552067,0.00013827352],"domain_scores_gemma":[0.9981168,0.00024284235,0.00015208178,0.0013491493,0.000078936755,0.00006016939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003113824,0.000100202386,0.00013517661,0.00038568443,0.0012611109,0.00006783583,0.0013092649,0.000026439722,0.000046273482],"category_scores_gemma":[0.000011183871,0.000111773654,0.0001332124,0.0014349056,0.00050006167,0.0002493194,0.0008469639,0.00021867639,0.0000012469837],"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.000004843475,0.00011895001,0.0027813618,0.000006596028,0.00003812818,2.3894376e-7,0.0016620832,0.000024126628,0.00054838945,0.95269734,0.00006859897,0.042049322],"study_design_scores_gemma":[0.0003663944,0.00021017047,0.006247845,0.00001343741,0.000047270845,0.00006960793,0.0021724028,0.0030490076,0.00038816055,0.9630455,0.024119971,0.00027027892],"about_ca_topic_score_codex":0.000028042989,"about_ca_topic_score_gemma":0.000006551532,"teacher_disagreement_score":0.86916316,"about_ca_system_score_codex":0.0000073213764,"about_ca_system_score_gemma":0.00002950526,"threshold_uncertainty_score":0.9699573},"labels":[],"label_agreement":null},{"id":"W4289519905","doi":"10.1007/s12095-022-00585-4","title":"Status of three classes of sequences","year":2022,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"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","keywords":"Sequence (biology); Binary Golay code; Pseudorandom number generator; Ambiguity; Field (mathematics); Autocorrelation; Computer science; Cryptography; Complementary sequences; Theoretical computer science; Mathematics; Algorithm; Discrete mathematics; Statistics; Pure mathematics; Programming language","score_opus":0.04423353199970351,"score_gpt":0.2763334129997022,"score_spread":0.2320998809999987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289519905","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.62310225,0.030722607,0.3129238,0.0019586803,0.00027702784,0.0005098052,0.00018752123,0.00026498653,0.030053338],"genre_scores_gemma":[0.96337026,0.0009518874,0.03557055,0.00004790395,0.0000024065964,0.000046183435,0.0000062864333,0.0000030496901,0.0000014734437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999131,0.00018932958,0.00022964233,0.00013782091,0.00015959323,0.00015256304],"domain_scores_gemma":[0.99802727,0.0003041445,0.00016577542,0.001381183,0.00006856573,0.000053062373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002841861,0.000072460665,0.00013906685,0.00027647018,0.000442628,0.000020661892,0.0016330804,0.000017542576,0.000030509995],"category_scores_gemma":[0.000014428289,0.000074088515,0.00011345691,0.0012788312,0.0005005941,0.00015723598,0.0010575046,0.00014857475,2.0526222e-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.00000598374,0.00012634334,0.024174573,0.000011556535,0.000035831512,1.380579e-7,0.0009795176,0.000013841372,0.0008818316,0.95116216,0.000041209172,0.022567002],"study_design_scores_gemma":[0.00034946293,0.00046706086,0.0424201,0.000026082642,0.000038651673,0.0000091860975,0.0018180363,0.0012313479,0.0011434223,0.9202251,0.032041166,0.00023038419],"about_ca_topic_score_codex":0.000082007435,"about_ca_topic_score_gemma":0.00003774692,"teacher_disagreement_score":0.34026802,"about_ca_system_score_codex":0.0000044495305,"about_ca_system_score_gemma":0.00005291781,"threshold_uncertainty_score":0.34043813},"labels":[],"label_agreement":null},{"id":"W4289524100","doi":"10.1007/s12095-022-00603-5","title":"Concrete constructions of weightwise perfectly balanced (2-rotation symmetric) functions with optimal algebraic immunity and high weightwise nonlinearity","year":2022,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Armand Frappier Museum","funders":"Key Scientific Research Project of Colleges and Universities in Henan Province; National Natural Science Foundation of China","keywords":"Boolean function; Hamming weight; Mathematics; Cipher; Hamming distance; Stream cipher; Cryptography; Rotation (mathematics); Algebraic number; Class (philosophy); Simplicity; Discrete mathematics; Topology (electrical circuits); Hamming code; Combinatorics; Computer science; Algorithm; Encryption; Mathematical analysis; Block code","score_opus":0.010158535419387221,"score_gpt":0.2119433588205441,"score_spread":0.2017848234011569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289524100","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.8715648,0.0023987307,0.122094855,0.0011568143,0.0001504808,0.0004723284,0.0002204193,0.0002244997,0.001717076],"genre_scores_gemma":[0.9213836,0.0005345468,0.077670686,0.00008129556,0.000011892653,0.00020052293,0.000097231474,0.000011503288,0.000008689531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9982257,0.00056922645,0.00035044804,0.00036815734,0.0002479365,0.00023856787],"domain_scores_gemma":[0.9971137,0.00060608744,0.00024921686,0.0016913901,0.00020461943,0.00013500935],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00042144267,0.00020959058,0.00028386494,0.0006900507,0.0023121757,0.000121099496,0.001071745,0.000055605375,0.000051148352],"category_scores_gemma":[0.000028108225,0.00020815016,0.00011970785,0.0027973077,0.0010837285,0.00044974036,0.00096600945,0.0005522628,9.552912e-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.000088873494,0.0001860801,0.014179587,0.000027441496,0.00019173133,0.0000015315666,0.0016429105,0.000038969167,0.0009012389,0.96924764,0.000059064638,0.013434924],"study_design_scores_gemma":[0.019157115,0.00982975,0.4382294,0.00041777172,0.0017080783,0.0019995447,0.030703686,0.07949962,0.0030227755,0.35616985,0.053972457,0.0052899322],"about_ca_topic_score_codex":0.00015678204,"about_ca_topic_score_gemma":0.000024984223,"teacher_disagreement_score":0.6130778,"about_ca_system_score_codex":0.000017010645,"about_ca_system_score_gemma":0.00008950882,"threshold_uncertainty_score":0.99898666},"labels":[],"label_agreement":null},{"id":"W4311209563","doi":"10.1007/s12095-022-00616-0","title":"Self-dual and LCD double circulant and double negacirculant codes over a family of finite rings $ \\mathbb {F}_{q}[v_{1}, v_{2},\\dots ,v_{t}]$","year":2022,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Circulant matrix; Dual (grammatical number); Finite field; Physics; Discrete mathematics; Arithmetic; Crystallography; Combinatorics; Mathematics; Chemistry; Art","score_opus":0.02588309565317558,"score_gpt":0.24789743877748394,"score_spread":0.22201434312430834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311209563","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.96114576,0.01440597,0.01742773,0.00096827844,0.00015895144,0.00064097426,0.000114346585,0.0003938839,0.0047441255],"genre_scores_gemma":[0.9853929,0.0026598836,0.011348249,0.0003531314,0.000014596735,0.00017724268,0.000028163216,0.000017731289,0.00000809416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813306,0.00025172363,0.00043300877,0.0005131576,0.00031366578,0.00035537442],"domain_scores_gemma":[0.9972948,0.00040314323,0.00023549685,0.0017896023,0.00009030991,0.00018665715],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007110301,0.00027368372,0.00037282004,0.00052544224,0.0014830775,0.00026365256,0.0012393583,0.00007718898,0.0000150061105],"category_scores_gemma":[0.0000075085254,0.0002856769,0.00016609958,0.0012833168,0.00058382703,0.0004400205,0.0021467416,0.00042761283,0.0000010759439],"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.000105682615,0.00050513895,0.01494616,0.00011566804,0.00025765868,0.000006462757,0.008512778,0.00003276917,0.0023841758,0.96833605,0.00017895337,0.004618491],"study_design_scores_gemma":[0.020869657,0.0023548913,0.2301464,0.0005224326,0.0010401756,0.00090413244,0.010333815,0.0472508,0.002111568,0.4395426,0.24052821,0.0043953396],"about_ca_topic_score_codex":0.00015944088,"about_ca_topic_score_gemma":0.000028295897,"teacher_disagreement_score":0.52879345,"about_ca_system_score_codex":0.000014140078,"about_ca_system_score_gemma":0.000059264174,"threshold_uncertainty_score":0.9999595},"labels":[],"label_agreement":null},{"id":"W4321015079","doi":"10.1007/s12095-022-00623-1","title":"Comparing balanced sequences obtained from ElGamal function to random balanced sequences","year":2023,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"ElGamal encryption; Mathematics; Combinatorics; Discrete mathematics; Randomness; Modulo; Function (biology); Random function; Golomb coding; Prime (order theory); Sequence (biology); Random variable; Computer science; Public-key cryptography","score_opus":0.039306736832341094,"score_gpt":0.2698127270029333,"score_spread":0.2305059901705922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321015079","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.5875821,0.0016859492,0.39741084,0.0047427425,0.000522373,0.00053718744,0.000039334238,0.0015901474,0.0058892914],"genre_scores_gemma":[0.9762305,0.00063698145,0.022268668,0.0005407368,0.000051592375,0.00016712071,0.00008048542,0.000010957285,0.000012954859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817294,0.00033705056,0.00035434336,0.0005032463,0.00024297419,0.00038942802],"domain_scores_gemma":[0.9970522,0.0007104594,0.00012306702,0.0018019875,0.00011059025,0.00020168755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059386203,0.00023156253,0.0003191129,0.0005131633,0.0010582497,0.00038795487,0.002148748,0.00008511954,0.000019378107],"category_scores_gemma":[0.000054862066,0.00022412384,0.00017566161,0.0032009736,0.00032884002,0.00053531554,0.0007580271,0.00025911475,0.000055830213],"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.00022948765,0.00015044434,0.08018717,0.000026267053,0.00029596002,0.0000050634167,0.0055373716,0.0004195586,0.013334524,0.8490877,0.0013475397,0.04937889],"study_design_scores_gemma":[0.0028191332,0.00039130304,0.28232813,0.0002797747,0.00011650716,0.000008613671,0.0024229551,0.036349315,0.0010430182,0.6482523,0.024823332,0.0011655997],"about_ca_topic_score_codex":0.00014623122,"about_ca_topic_score_gemma":0.00013755674,"teacher_disagreement_score":0.38864836,"about_ca_system_score_codex":0.000012840386,"about_ca_system_score_gemma":0.000039763534,"threshold_uncertainty_score":0.9139505},"labels":[],"label_agreement":null},{"id":"W4385891514","doi":"10.1007/s12095-023-00656-0","title":"The welch-gong stream cipher - evolutionary path","year":2023,"lang":"en","type":"article","venue":"Cryptography and 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stream cipher; Computer science; Cipher; Transposition cipher; Block cipher mode of operation; Cryptography; Stream cipher attack; Path (computing); Encryption; Theoretical computer science; Permutation (music); Running key cipher; Algorithm; Computer security; Programming language","score_opus":0.02073569150712341,"score_gpt":0.25392970922735264,"score_spread":0.23319401772022924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385891514","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.189124,0.07181745,0.42469436,0.10090214,0.002813987,0.0025345813,0.00016756229,0.009614113,0.19833179],"genre_scores_gemma":[0.983764,0.005589046,0.010134837,0.00021853946,0.000032461292,0.00014778005,0.00002218774,0.000010302202,0.0000808242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988843,0.00023547678,0.00019686164,0.00023678297,0.00015878891,0.00028777457],"domain_scores_gemma":[0.99667937,0.0007218672,0.00006818451,0.002364381,0.00007248748,0.0000937049],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00049009564,0.00012794776,0.00009527067,0.00019580899,0.0023517911,0.0002522054,0.0022592347,0.000053486296,0.000007796424],"category_scores_gemma":[0.000030081143,0.0000995224,0.00014554878,0.002128275,0.0005662414,0.00028753714,0.0010171619,0.00022319739,0.00004183905],"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.000003139764,0.00004009649,0.0026790474,0.0000029737437,0.00003493151,6.986698e-7,0.0005382544,0.0000032085156,0.00003582584,0.9341756,0.0039918744,0.05849436],"study_design_scores_gemma":[0.00022269196,0.00006749324,0.07723753,0.000032078726,0.000019187797,0.000009827845,0.0008092817,0.005603217,0.000019404997,0.6497075,0.26601186,0.00025994936],"about_ca_topic_score_codex":0.000013076784,"about_ca_topic_score_gemma":0.00002169494,"teacher_disagreement_score":0.79464,"about_ca_system_score_codex":0.000006027634,"about_ca_system_score_gemma":0.000029064067,"threshold_uncertainty_score":0.998947},"labels":[],"label_agreement":null},{"id":"W4386863539","doi":"10.1007/s12095-023-00674-y","title":"Some classes of permutation binomials and trinomials of index $$q-1$$ over $${\\mathbb {F}_{q^n}}$$","year":2023,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Trinomial; Combinatorics; Permutation (music); Prime (order theory); Mathematics; Prime power; Degree (music); Discrete mathematics; Polynomial; Physics","score_opus":0.02931724793707374,"score_gpt":0.2847397981237077,"score_spread":0.25542255018663396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386863539","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.9803625,0.0036392855,0.013947933,0.0006587358,0.000084625724,0.00024378923,0.000034205932,0.00016442772,0.00086451555],"genre_scores_gemma":[0.9909927,0.0043258313,0.0045569967,0.000052722164,0.000014056277,0.000034513483,0.00001142043,0.000006989407,0.000004738657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989036,0.00020277675,0.0003855467,0.0002170013,0.00013661652,0.00015447396],"domain_scores_gemma":[0.9977389,0.0007037638,0.00022378344,0.0011782957,0.00008938746,0.00006589952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005552877,0.00012225007,0.0002580975,0.0006768204,0.00023298377,0.00005875604,0.0008422335,0.00007604923,0.000004657974],"category_scores_gemma":[0.00004511351,0.00012115184,0.00012285383,0.0014362998,0.0005448265,0.00044042122,0.0005554542,0.00010899745,0.0000013371139],"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.000014298317,0.00008462808,0.018951548,0.000056806493,0.000062836116,2.5882346e-7,0.0015031993,0.000007383936,0.0057714507,0.9521762,0.00011105611,0.021260303],"study_design_scores_gemma":[0.0009867077,0.0002088512,0.3957283,0.00012065488,0.000060819893,0.0000062225436,0.00076763483,0.003347294,0.004418517,0.59088683,0.0031390102,0.00032917233],"about_ca_topic_score_codex":0.000028870045,"about_ca_topic_score_gemma":0.000008906547,"teacher_disagreement_score":0.37677675,"about_ca_system_score_codex":0.0000030611354,"about_ca_system_score_gemma":0.00003215339,"threshold_uncertainty_score":0.49404287},"labels":[],"label_agreement":null},{"id":"W4396773962","doi":"10.1007/s12095-024-00720-3","title":"Additive codes with few weights","year":2024,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Mathematics","score_opus":0.013635971077980277,"score_gpt":0.2440361152280393,"score_spread":0.23040014415005902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396773962","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.013913054,0.02716504,0.8896034,0.0057550673,0.00020016858,0.0003362016,0.00006116031,0.0014023135,0.06156362],"genre_scores_gemma":[0.9299183,0.002171465,0.067533284,0.00021197327,0.00002282828,0.00008775474,0.000018750075,0.000009581116,0.000026062984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991796,0.00012115597,0.00012623417,0.00028462568,0.00011285785,0.00017553473],"domain_scores_gemma":[0.9980598,0.0004130025,0.000027836835,0.0013492561,0.000057875972,0.00009219634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017944003,0.000136995,0.00011504942,0.00031847364,0.0005342501,0.00042753047,0.0011535401,0.000043797063,0.000020316495],"category_scores_gemma":[0.0000046366636,0.00010682293,0.0000961799,0.0013718251,0.00046904004,0.00046736712,0.00032654608,0.00022693476,0.000016017186],"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.0000037611208,0.000040805677,0.00023574814,0.0000104688015,0.00007313075,0.0000029459213,0.0010712647,2.6147887e-7,0.000029911665,0.93192506,0.0003955767,0.06621107],"study_design_scores_gemma":[0.00021886904,0.00023070231,0.003888412,0.00030091807,0.00006670609,0.000066366905,0.00039113997,0.0028091518,0.00035503347,0.66156226,0.32969067,0.00041978387],"about_ca_topic_score_codex":0.000009436538,"about_ca_topic_score_gemma":0.00002872648,"teacher_disagreement_score":0.91600525,"about_ca_system_score_codex":0.000004758372,"about_ca_system_score_gemma":0.000035786605,"threshold_uncertainty_score":0.43561128},"labels":[],"label_agreement":null},{"id":"W4400692708","doi":"10.1007/s12095-024-00723-0","title":"Uni/multi variate polynomial embeddings for zkSNARKs","year":2024,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Cryptography and Data Security","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":"University of Waterloo","funders":"","keywords":"Random variate; Polynomial; Mathematics; Computer science; Algebra over a field; Pure mathematics; Statistics; Mathematical analysis; Random variable","score_opus":0.034453706021442834,"score_gpt":0.31400243489403484,"score_spread":0.279548728872592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400692708","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.0015967633,0.009948271,0.9823595,0.0031763718,0.00033593897,0.00032759501,0.00014942898,0.0005031683,0.0016029398],"genre_scores_gemma":[0.5724991,0.0018178431,0.42499432,0.0003278731,0.000057791505,0.00018523143,0.00009410072,0.000014777429,0.000008948643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99890715,0.000078051,0.000247647,0.0003985394,0.00009846474,0.00027013486],"domain_scores_gemma":[0.9975493,0.00045094223,0.000046103818,0.0017488273,0.00007388791,0.0001309303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003638283,0.00016888078,0.0001547839,0.0003641854,0.00066880294,0.00066531403,0.001735557,0.00009847813,0.0000074678474],"category_scores_gemma":[0.000024067946,0.00016427247,0.00021896842,0.0010897581,0.00028413706,0.000719314,0.00065843243,0.00025720798,0.0000071357977],"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.0000056992462,0.00009592969,0.0001812644,0.00003656708,0.00006859409,7.218236e-7,0.0014139646,7.60304e-7,0.00023530438,0.9618938,0.0036695392,0.03239783],"study_design_scores_gemma":[0.0007428531,0.00014114066,0.0032331673,0.00013003049,0.00009394293,0.000027226755,0.00029939786,0.085307114,0.00022831371,0.18775405,0.7214582,0.0005846025],"about_ca_topic_score_codex":0.000040198014,"about_ca_topic_score_gemma":0.00003780686,"teacher_disagreement_score":0.77413976,"about_ca_system_score_codex":0.000008103286,"about_ca_system_score_gemma":0.00005196426,"threshold_uncertainty_score":0.66988367},"labels":[],"label_agreement":null},{"id":"W4404597517","doi":"10.1007/s12095-024-00756-5","title":"On the counting of involutory MDS matrices","year":2024,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Complex Hadamard matrix; Circulant matrix; Hadamard transform; Hadamard matrix; Mathematics; Hadamard's maximal determinant problem; Hadamard's inequality; Matrix (chemical analysis); Hadamard three-lines theorem; Order (exchange); Combinatorics; Discrete mathematics","score_opus":0.02329012407093261,"score_gpt":0.25297691125141764,"score_spread":0.22968678718048502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404597517","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.27632362,0.118518606,0.47955897,0.02051835,0.000849308,0.0007174952,0.00004459971,0.0013360544,0.102133006],"genre_scores_gemma":[0.99253994,0.001362159,0.005788088,0.00025437897,0.000012243285,0.000029668694,0.0000016779944,0.000005036412,0.000006813092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993117,0.00014456856,0.00016057065,0.00015550673,0.000117239375,0.000110442066],"domain_scores_gemma":[0.9972633,0.0012710359,0.00004803556,0.0013451776,0.000042356867,0.000030091931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052794203,0.000085200656,0.00008250042,0.000253201,0.0004062824,0.00019054348,0.0014754003,0.00003374065,0.000012745697],"category_scores_gemma":[0.000023586153,0.00006042261,0.000115983865,0.0012469427,0.0003673465,0.0001978422,0.0003586463,0.00020250924,0.0000063376906],"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.0000013798759,0.000030932988,0.00021653566,0.000019055711,0.000032298645,2.3543632e-7,0.0009196722,0.0000012555122,0.00016991833,0.9806874,0.0006224297,0.01729888],"study_design_scores_gemma":[0.00006696711,0.00008429687,0.0017156757,0.00022629983,0.0000292334,0.0000052615896,0.00037755386,0.0058441022,0.00026460298,0.9417987,0.049428113,0.00015917583],"about_ca_topic_score_codex":0.000011066125,"about_ca_topic_score_gemma":0.0000050821764,"teacher_disagreement_score":0.7162163,"about_ca_system_score_codex":0.0000031649276,"about_ca_system_score_gemma":0.000022125418,"threshold_uncertainty_score":0.3124837},"labels":[],"label_agreement":null},{"id":"W4405262838","doi":"10.1007/s12095-024-00761-8","title":"On the stability of $$b^q(x+a)^{q+1}+x$$ from the perspective of periodic sequences","year":2024,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Perspective (graphical); Stability (learning theory); Crystallography; Mathematics; Computer science; Chemistry; Geometry","score_opus":0.03811957096684519,"score_gpt":0.274348788150973,"score_spread":0.23622921718412782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405262838","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.7912571,0.04840897,0.0919528,0.044489764,0.00028800516,0.0006481319,0.00021668836,0.00024215646,0.022496384],"genre_scores_gemma":[0.9965073,0.00072837534,0.002566842,0.00015099162,0.000008913381,0.000031437765,0.0000021587164,0.0000032443545,7.5678355e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989738,0.00039936075,0.00019166329,0.00019711119,0.00014548955,0.00009257638],"domain_scores_gemma":[0.994527,0.0032707988,0.000068286245,0.002005716,0.00010286087,0.000025369649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059742143,0.00009306654,0.00011569311,0.00008455421,0.0004053766,0.00011088803,0.0019862065,0.00003211148,0.00003835772],"category_scores_gemma":[0.00007443615,0.000051471015,0.00017832589,0.0010480976,0.0014908592,0.00013523253,0.0003574272,0.00023462591,0.0000016148426],"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.000005169851,0.000052867716,0.0008308547,0.000006121209,0.0000674574,9.8367806e-8,0.0102682775,8.318598e-7,0.0004642419,0.98449427,0.000082737926,0.0037270894],"study_design_scores_gemma":[0.00004707807,0.0000896924,0.0060345666,0.00009705075,0.000029454943,9.750464e-7,0.0055683577,0.00079493964,0.0012238432,0.9846226,0.0014161114,0.000075354284],"about_ca_topic_score_codex":0.00022631638,"about_ca_topic_score_gemma":0.00004893485,"teacher_disagreement_score":0.20525017,"about_ca_system_score_codex":0.0000060761686,"about_ca_system_score_gemma":0.000050392377,"threshold_uncertainty_score":0.5493133},"labels":[],"label_agreement":null},{"id":"W4409873972","doi":"10.1007/s12095-025-00798-3","title":"An effective approach to enumerate universal cycles for k-permutations","year":2025,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Foundation of Henan Educational Committee; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Enumeration; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.008558640135579046,"score_gpt":0.2534321535233065,"score_spread":0.24487351338772745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409873972","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.17653081,0.0019258294,0.77473694,0.0001753169,0.00012818404,0.0011893206,0.00009919181,0.0004076454,0.044806767],"genre_scores_gemma":[0.9913153,0.0000865109,0.0078099193,0.00005592561,0.000008902864,0.0006438233,0.00005809328,0.0000100985535,0.000011416974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955904,0.00008039127,0.000107479194,0.00011306723,0.00002624077,0.00011380384],"domain_scores_gemma":[0.99911505,0.00015994762,0.000011458447,0.0006038031,0.000048043956,0.00006167325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011501061,0.00009258734,0.00010851613,0.0002433649,0.00040033663,0.00005260423,0.00032117835,0.000047795475,8.787088e-7],"category_scores_gemma":[0.0000069281814,0.000099438774,0.000060352617,0.000529518,0.00009511539,0.00010982925,0.000029961053,0.00008397623,0.0000013160691],"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.000010890231,0.00008807127,0.00073875807,0.000057300174,0.0001223739,2.9775359e-8,0.0020868531,0.0019768926,0.0016357253,0.98261046,0.00026201725,0.010410621],"study_design_scores_gemma":[0.0034974078,0.00047025114,0.13272503,0.00041328982,0.000714867,0.000010063788,0.03543289,0.16277738,0.00504731,0.5232379,0.13382104,0.0018526266],"about_ca_topic_score_codex":0.0000084415215,"about_ca_topic_score_gemma":0.000015118542,"teacher_disagreement_score":0.8147845,"about_ca_system_score_codex":0.000008427747,"about_ca_system_score_gemma":0.0000058174223,"threshold_uncertainty_score":0.40549958},"labels":[],"label_agreement":null},{"id":"W4411790448","doi":"10.1007/s12095-025-00823-5","title":"New successor rules to efficiently produce exponentially many binary de Bruijn sequences","year":2025,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Science Foundation of Fujian Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Nanyang Technological University","keywords":"De Bruijn sequence; Successor cardinal; Binary number; Computer science; Sequence (biology); Arithmetic; Combinatorics; Mathematics; Biology; Genetics","score_opus":0.014948405639395227,"score_gpt":0.2771713694160146,"score_spread":0.2622229637766194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411790448","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.132479,0.005256612,0.83662444,0.014993727,0.00022292254,0.00040897573,0.000009513085,0.00038871667,0.009616083],"genre_scores_gemma":[0.77617747,0.00053627644,0.22205529,0.0009878807,0.000023857014,0.00009285515,0.000008020277,0.0000070913893,0.00011123425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986041,0.00023859709,0.0002631892,0.0004240421,0.00014319483,0.00032685866],"domain_scores_gemma":[0.9971925,0.0002543263,0.0000707984,0.0021991518,0.00009318632,0.000190007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004962498,0.00017992638,0.00017425662,0.0006466857,0.0008728638,0.00039744686,0.0031194584,0.00006814965,0.0000134967595],"category_scores_gemma":[0.000043229487,0.00018119907,0.0001401165,0.0021751712,0.0002396756,0.00032065585,0.0011384869,0.00020903556,0.000013012646],"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.000015770265,0.00013460836,0.0025971846,0.000018206703,0.0000505753,0.0000011380562,0.001391101,0.000026684418,0.0030328631,0.93212456,0.0016709873,0.058936305],"study_design_scores_gemma":[0.0009458884,0.00039141404,0.09504763,0.0005237332,0.00013735359,0.000023209328,0.00087574683,0.0026333649,0.0060889185,0.7627465,0.12956908,0.0010171421],"about_ca_topic_score_codex":0.00010840746,"about_ca_topic_score_gemma":0.00004586039,"teacher_disagreement_score":0.6436985,"about_ca_system_score_codex":0.000013743957,"about_ca_system_score_gemma":0.00016385077,"threshold_uncertainty_score":0.73890835},"labels":[],"label_agreement":null},{"id":"W4413224920","doi":"10.1007/s12095-025-00829-z","title":"New Turyn-type sequences","year":2025,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Approximation Theory and Sequence Spaces","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Type (biology); Computer science; Biology","score_opus":0.05563705351840285,"score_gpt":0.3583692880045586,"score_spread":0.3027322344861557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413224920","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.12819882,0.019530615,0.32717288,0.028022518,0.0004452242,0.0010463638,0.000017833512,0.0009005109,0.49466527],"genre_scores_gemma":[0.81753,0.0014945604,0.1795495,0.00035622678,0.000015161599,0.000023492224,0.000009444245,0.000006211708,0.0010154534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946356,0.000100892736,0.00016475582,0.00011080763,0.00005845391,0.00010151575],"domain_scores_gemma":[0.9985998,0.00040766635,0.000058437592,0.0008199407,0.000064545144,0.000049603954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019929049,0.000085762185,0.00011511131,0.00013574872,0.00039884794,0.00005808166,0.00047477018,0.000057415065,0.00006318895],"category_scores_gemma":[0.00011312639,0.00007638978,0.00004959931,0.00062615663,0.00026996018,0.00013276878,0.00012674772,0.00013655801,0.0000058730675],"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.000005261931,0.000024442741,0.0007088431,0.000016869331,0.00003187854,8.948132e-8,0.00065375026,2.4008895e-7,0.00020311377,0.987467,0.0027643668,0.008124153],"study_design_scores_gemma":[0.00010547634,0.000015167008,0.00040404234,0.00004746409,0.000033557113,0.0000015682921,0.001094738,0.0000446953,0.00045467055,0.9785318,0.019186419,0.000080402606],"about_ca_topic_score_codex":0.000021716658,"about_ca_topic_score_gemma":0.000033480603,"teacher_disagreement_score":0.6893311,"about_ca_system_score_codex":0.0000054024567,"about_ca_system_score_gemma":0.00006309885,"threshold_uncertainty_score":0.31150848},"labels":[],"label_agreement":null}]}