{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":6,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":6,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"eb5e94b1e0e5","filters":{"venue":"Information and Control Systems"}},"results":[{"id":"W2749014923","doi":"10.15217/issn1684-8853.2017.5.2","title":"CONSTRUCTION OF SYMMETRIC HADAMARD MATRICES","year":2017,"lang":"en","type":"article","venue":"Information and Control Systems","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Hadamard transform; Complex Hadamard matrix; Hadamard's inequality; Hadamard matrix; Hadamard product; Order (exchange); Hadamard three-lines theorem; Hadamard's maximal determinant problem; Mathematics; Combinatorics; Pure mathematics; Mathematical analysis","authors":[{"name":"Н. А. Балонин","is_ca":false},{"name":"Yuriy Balonin","is_ca":false},{"name":"DragomirZˇ. Dokovic ́","is_ca":true},{"name":"D. A. Karbovskiy","is_ca":false},{"name":"Mikhail Sergeev","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.003790157416105087,"gpt":0.1738287341652745,"spread":0.1700385767491694,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006333861,0.0006004503,0.0005066509,0.001361161,0.001210615,0.001457077,0.0009772517,0.0008100317,0.006232514],"category_scores_gemma":[0.001643836,0.0005391676,0.0007077557,0.000590885,0.001604172,0.00165386,0.001576025,0.001843364,0.001910861],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005886876,"about_ca_system_score_gemma":0.0006805767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002633187,"about_ca_topic_score_gemma":0.000376959,"domain_scores_codex":[0.999273,0.000216546,0.00002769767,0.0001063313,0.0002822515,0.00009421902],"domain_scores_gemma":[0.9994152,0.0001527493,0.00005462103,0.0001865428,0.0001278726,0.00006319338],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001585228,0.00001388146,0.00008295829,0.00004868501,0.000005549352,0.0000819452,0.0001157655,0.001683673,0.006319861,0.9810364,0.001128386,0.009466989],"study_design_scores_gemma":[0.00003308829,0.00009127061,0.0001400732,0.00005138556,0.000009687397,0.0004397043,0.0001167312,0.03530494,0.02856938,0.9029293,0.03225945,0.00005496875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07614908,0.0007982285,0.7989587,0.0008252762,0.0006494623,0.0001994745,0.0002512904,0.0006841859,0.1214844],"genre_scores_gemma":[0.5318733,0.0008778863,0.4345666,0.0005415009,0.0001988966,0.0003267353,0.0004059603,0.0003577302,0.03085144],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006232514,"threshold_uncertainty_score":0.02084976,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963006461","doi":"10.31799/1684-8853-2018-4-2-8","title":"Symmetric Hadamard Matrices of Orders 268, 412, 436 and 604","year":2018,"lang":"en","type":"article","venue":"Information and Control Systems","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Hadamard transform; Mathematics; Complex Hadamard matrix; Rectangle; Hadamard product; Symmetric-key algorithm; Hadamard matrix; Algorithm; Computer science; Mathematical analysis; Geometry; Encryption","authors":[{"name":"Н. А. Балонин","is_ca":false},{"name":"Dragomir Ž. Ðoković","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.002750279093694454,"gpt":0.1635226526549562,"spread":0.1607723735612617,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004547403,0.0004880202,0.0003392936,0.0007382003,0.000574266,0.0004663377,0.0003672319,0.0003334335,0.006000697],"category_scores_gemma":[0.00210538,0.0002057791,0.0004514345,0.0005083312,0.0008964741,0.0008257893,0.0002979664,0.0006516864,0.001094306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000469165,"about_ca_system_score_gemma":0.0005664091,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000549465,"about_ca_topic_score_gemma":0.0007217327,"domain_scores_codex":[0.9996111,0.00008663559,0.0000203099,0.00006646288,0.000151793,0.00006374908],"domain_scores_gemma":[0.9988585,0.0004704981,0.0001732087,0.0002038398,0.0002164884,0.00007751655],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007382175,0.0001443271,0.004398052,0.000377826,0.00003935149,0.001050341,0.0004620753,0.04210987,0.0916575,0.7562001,0.004204045,0.0986183],"study_design_scores_gemma":[0.0001922998,0.001132943,0.003886084,0.000114762,0.00006942697,0.003208447,0.0004285767,0.1841984,0.2213803,0.5321005,0.05307435,0.0002138941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5967661,0.0008703309,0.3618468,0.0004549641,0.0001740468,0.0001639479,0.0007931787,0.0003257915,0.03860466],"genre_scores_gemma":[0.8555874,0.0002716728,0.1347841,0.00008279976,0.00004118874,0.00007422957,0.0005975836,0.00005269652,0.008508337],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006000697,"threshold_uncertainty_score":0.02007431,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3081345703","doi":"10.31799/1684-8853-2020-4-2-10","title":"Conference matrices from Legendre C-pairs","year":2020,"lang":"en","type":"article","venue":"Information and Control Systems","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Ministry of Education and Science of the Russian Federation; Compute Canada","keywords":"Legendre polynomials; Mathematics; Order (exchange); Combinatorics; Abelian group; Group (periodic table); Pure mathematics; Physics; Mathematical analysis; Quantum mechanics","authors":[{"name":"Nikolay Balonin","is_ca":false},{"name":"Dragomir Ž. Ðoković","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006935592973951402,"gpt":0.1591168324270149,"spread":0.1521812394530635,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003928368,0.0005727696,0.0003395571,0.001285728,0.001023886,0.002005184,0.00052771,0.0007552944,0.01396191],"category_scores_gemma":[0.001572627,0.0002089219,0.0004997198,0.0007464546,0.001225527,0.001700079,0.001226692,0.001384508,0.002204717],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008640795,"about_ca_system_score_gemma":0.0004761016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003749084,"about_ca_topic_score_gemma":0.0003321882,"domain_scores_codex":[0.9993116,0.0001449369,0.00003902991,0.0001336515,0.0002457337,0.000125033],"domain_scores_gemma":[0.9992911,0.0001529646,0.0001193662,0.0001043453,0.0002001514,0.0001320918],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003307046,0.0000111685,0.0001243912,0.00004800572,0.000003563818,0.00009347494,0.0001330615,0.0007620339,0.002416037,0.9849432,0.002309048,0.009122944],"study_design_scores_gemma":[0.0000217409,0.00009692852,0.0004394093,0.00004500611,0.000006614961,0.0007686769,0.0001593086,0.009882486,0.007358665,0.9387544,0.04242219,0.0000445613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3235753,0.002541128,0.3272329,0.001533691,0.001910604,0.0003245852,0.0008743436,0.0008277317,0.3411797],"genre_scores_gemma":[0.8918874,0.0009232882,0.05694698,0.0007418967,0.0007901495,0.0002252745,0.000714612,0.0002571004,0.04751313],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01396191,"threshold_uncertainty_score":0.04670727,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2982082459","doi":"10.31799/1684-8853-2019-5-2-9","title":"Hadamard matrices from Goethals — Seidel difference families with a repeated block","year":2019,"lang":"en","type":"article","venue":"Information and Control Systems","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Mathematics; Hadamard transform; Combinatorics; Complex Hadamard matrix; Hadamard matrix; Hadamard's maximal determinant problem; Order (exchange); Discrete mathematics; Mathematical analysis","authors":[{"name":"Leonid Abuzin","is_ca":false},{"name":"Nikolai Unknown","is_ca":false},{"name":"Dragomir Ž. Ðoković","is_ca":true},{"name":"Ilias Kotsireas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.002459892335687036,"gpt":0.1479545263836205,"spread":0.1454946340479334,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004355135,0.0004352157,0.0003253118,0.000946847,0.000867465,0.000597803,0.0005078556,0.0005488591,0.00300778],"category_scores_gemma":[0.001264789,0.0002796878,0.0007246314,0.0004017249,0.001060822,0.0008338479,0.0006788724,0.0008163319,0.000526155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007779766,"about_ca_system_score_gemma":0.0004176893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006344577,"about_ca_topic_score_gemma":0.0005720112,"domain_scores_codex":[0.9995253,0.0001099551,0.00002439031,0.00006066394,0.0001996801,0.00008001563],"domain_scores_gemma":[0.9995091,0.0001536178,0.00009380056,0.0001015963,0.00008284055,0.000059067],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002260358,0.00005793946,0.00164845,0.0001232602,0.0000236614,0.0008255378,0.0005463295,0.01117222,0.03025108,0.9288763,0.001180505,0.02506874],"study_design_scores_gemma":[0.0001416575,0.0004484722,0.003036825,0.00006819833,0.0000321436,0.001991462,0.0003979004,0.09683112,0.07779728,0.7967038,0.02245468,0.00009652736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7911472,0.0003280855,0.1757399,0.0002584229,0.0001009009,0.00008985447,0.0001797836,0.0002243678,0.0319314],"genre_scores_gemma":[0.9401881,0.0001472049,0.05220313,0.00007810101,0.00003664737,0.00008978423,0.0002985877,0.00005530823,0.006903206],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00300778,"threshold_uncertainty_score":0.01006198,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3135767204","doi":"10.31799/1684-8853-2021-1-2-7","title":"Three new lengths for cyclic Legendre pairs","year":2021,"lang":"en","type":"article","venue":"Information and Control Systems","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Legendre polynomials; Mathematics; Circulant matrix; Combinatorics; Hadamard transform; Mathematical analysis","authors":[{"name":"Nikolay Balonin","is_ca":false},{"name":"Dragomir Ž. Ðoković","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006628157526751887,"gpt":0.1793610165932185,"spread":0.1727328590664666,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004712799,0.0005796214,0.0003652108,0.0007246183,0.001008284,0.001041734,0.0004993934,0.0008474761,0.008536675],"category_scores_gemma":[0.002214519,0.0003408283,0.0007771908,0.0004527399,0.001415536,0.001376981,0.001351015,0.001487564,0.001303604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007298632,"about_ca_system_score_gemma":0.0006132904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001839794,"about_ca_topic_score_gemma":0.0002856339,"domain_scores_codex":[0.9993693,0.0001231713,0.00004479697,0.0001188721,0.0002152376,0.0001286068],"domain_scores_gemma":[0.998629,0.0004283121,0.0002597757,0.0002941651,0.0002011499,0.0001876372],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000413284,0.0001450441,0.003424265,0.000267008,0.00002182928,0.0006879841,0.0005869638,0.006071577,0.03974345,0.8853256,0.003640977,0.05967205],"study_design_scores_gemma":[0.0001255679,0.001291496,0.003917878,0.0002267371,0.00006983478,0.003233214,0.0005605427,0.03335351,0.1338749,0.7364729,0.08665719,0.0002162538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6650922,0.000908628,0.240407,0.0005932567,0.000466304,0.0002780896,0.0004966116,0.0008416726,0.09091628],"genre_scores_gemma":[0.8576235,0.0003246975,0.1271891,0.0002626608,0.0001043866,0.0002162304,0.0006389696,0.0002331266,0.01340722],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008536675,"threshold_uncertainty_score":0.02855802,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4280580529","doi":"10.31799/1684-8853-2022-2-2-10","title":"Some new symmetric Hadamard matrices","year":2022,"lang":"en","type":"article","venue":"Information and Control Systems","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Compute Canada","keywords":"Hadamard transform; Mathematics; Combinatorics; Conjecture; Complex Hadamard matrix; Hadamard matrix; Hadamard's maximal determinant problem; Order (exchange); Discrete mathematics; Mathematical analysis","authors":[{"name":"Dragomir Ž. Ðoković","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.003724991387440348,"gpt":0.1603535096779384,"spread":0.156628518290498,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034523,0.0004011902,0.000327613,0.0008508632,0.0009446691,0.0008949823,0.0004873075,0.0006827595,0.004867143],"category_scores_gemma":[0.001133699,0.0003241174,0.0005190421,0.000475779,0.0009415236,0.001209349,0.0008551763,0.0008022797,0.0006737499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006749108,"about_ca_system_score_gemma":0.0004277289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002907268,"about_ca_topic_score_gemma":0.0003147283,"domain_scores_codex":[0.9995433,0.0000947873,0.00002464882,0.00008356004,0.0001833203,0.0000702765],"domain_scores_gemma":[0.9993637,0.0002021907,0.0001015844,0.00012691,0.0001108106,0.00009481295],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002770633,0.00008254062,0.002786894,0.0002234713,0.00003047137,0.001368816,0.0007270369,0.00850573,0.03899666,0.9042468,0.002702868,0.04005161],"study_design_scores_gemma":[0.0001611097,0.00068931,0.003951858,0.0001220713,0.00006491379,0.005669079,0.0005942694,0.1027207,0.13804,0.6713305,0.07647227,0.0001839557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8031914,0.001152014,0.1363886,0.000648029,0.0002697106,0.0001166626,0.0004970867,0.0004009747,0.05733545],"genre_scores_gemma":[0.9284621,0.0003388499,0.0591535,0.0001470407,0.00007346826,0.00007020427,0.0004329185,0.00004323934,0.01127862],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004867143,"threshold_uncertainty_score":0.0162822,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}